| blob | 77b96376e1367b920887117f09574ef6ea36a261 |
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 void cp_parser_cilk_simd
254 static tree cp_parser_cilk_for
256 static bool cp_parser_omp_declare_reduction_exprs
258 static tree cp_parser_cilk_simd_vectorlength
260 static void cp_finalize_oacc_routine
263 /* Manifest constants. */
264 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
265 #define CP_SAVED_TOKEN_STACK 5
267 /* Variables. */
269 /* The stream to which debugging output should be written. */
272 /* Nonzero if we are parsing an unevaluated operand: an operand to
273 sizeof, typeof, or alignof. */
276 /* Dump up to NUM tokens in BUFFER to FILE starting with token
277 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
278 first token in BUFFER. If NUM is 0, dump all the tokens. If
279 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
280 highlighted by surrounding it in [[ ]]. */
282 static void
286 {
303 {
306 }
311 {
318 nprinted++;
328 {
338 }
339 }
342 {
345 }
348 }
351 /* Dump all tokens in BUFFER to stderr. */
353 void
355 {
357 }
359 DEBUG_FUNCTION void
361 {
363 }
365 DEBUG_FUNCTION void
367 {
370 else
372 }
375 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
376 description for T. */
378 static void
380 {
382 {
385 }
386 }
389 /* Dump parser context C to FILE. */
391 static void
393 {
398 }
401 /* Print the stack of parsing contexts to FILE starting with FIRST. */
403 static void
405 {
411 {
414 }
415 }
418 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
420 static void
422 {
425 }
428 /* Print an unparsed function entry UF to FILE. */
430 static void
432 {
435 tree fn;
440 i++)
441 {
447 }
452 {
455 }
461 {
464 }
466 }
469 /* Print the stack of unparsed member functions S to FILE. */
471 static void
474 {
480 {
483 }
484 }
487 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
488 the given PARSER. If FILE is NULL, the output is printed on stderr. */
490 static void
492 {
504 next_token);
505 }
508 /* Dump debugging information for the given PARSER. If FILE is NULL,
509 the output is printed on stderr. */
511 void
513 {
516 expanded_location eloc;
594 }
596 DEBUG_FUNCTION void
598 {
600 }
602 DEBUG_FUNCTION void
604 {
607 else
609 }
611 /* Allocate memory for a new lexer object and return it. */
615 {
620 /* Allocate the memory. */
623 /* Initially we are not debugging. */
628 /* Create the buffer. */
632 }
635 /* Create a new main C++ lexer, the lexer that gets tokens from the
636 preprocessor. */
640 {
642 cp_token token;
644 /* It's possible that parsing the first pragma will load a PCH file,
645 which is a GC collection point. So we have to do that before
646 allocating any memory. */
651 /* Put the first token in the buffer. */
654 /* Get the remaining tokens from the preprocessor. */
656 {
659 }
668 /* Subsequent preprocessor diagnostics should use compiler
669 diagnostic functions to get the compiler source location. */
674 }
676 /* Create a new lexer whose token stream is primed with the tokens in
677 CACHE. When these tokens are exhausted, no new tokens will be read. */
681 {
686 /* We do not own the buffer. */
693 /* Initially we are not debugging. */
698 }
700 /* Frees all resources associated with LEXER. */
702 static void
704 {
708 }
710 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
711 be used. The point of this flag is to help the compiler to fold away calls
712 to cp_lexer_debugging_p within this source file at compile time, when the
713 lexer is not being debugged. */
715 #define LEXER_DEBUGGING_ENABLED_P false
717 /* Returns nonzero if debugging information should be output. */
721 {
726 }
731 {
735 }
739 {
741 }
745 {
747 }
751 {
754 else
756 }
760 {
763 /* Skip past purged tokens. */
765 {
767 tp--;
768 }
771 }
773 /* nonzero if we are presently saving tokens. */
777 {
779 }
781 /* Store the next token from the preprocessor in *TOKEN. Return true
782 if we reach EOF. If LEXER is NULL, assume we are handling an
783 initial #pragma pch_preprocess, and thus want the lexer to return
784 processed strings. */
786 static void
788 {
791 /* Get a new token from the preprocessor. */
792 token->type
799 /* On some systems, some header files are surrounded by an
800 implicit extern "C" block. Set a flag in the token if it
801 comes from such a header. */
806 /* Check to see if this token is a keyword. */
808 {
810 {
811 /* Mark this token as a keyword. */
813 /* Record which keyword. */
815 }
816 else
817 {
821 {
822 /* Warn about the C++0x keyword (but still treat it as
823 an identifier). */
828 /* Clear out the C_RID_CODE so we don't warn about this
829 particular identifier-turned-keyword again. */
831 }
834 }
835 }
837 {
838 /* This only happens in Objective-C++; it must be a keyword. */
841 {
842 /* Replace 'class' with '@class', 'private' with '@private',
843 etc. This prevents confusion with the C++ keyword
844 'class', and makes the tokens consistent with other
845 Objective-C 'AT' keywords. For example '@class' is
846 reported as RID_AT_CLASS which is consistent with
847 '@synchronized', which is reported as
848 RID_AT_SYNCHRONIZED.
849 */
859 }
860 }
861 }
863 /* Update the globals input_location and the input file stack from TOKEN. */
866 {
868 {
870 }
871 }
873 /* Update the globals input_location and the input file stack from LEXER. */
876 {
879 }
881 /* Return a pointer to the next token in the token stream, but do not
882 consume it. */
886 {
888 {
892 }
894 }
896 /* Return true if the next token has the indicated TYPE. */
900 {
902 }
904 /* Return true if the next token does not have the indicated TYPE. */
908 {
910 }
912 /* Return true if the next token is the indicated KEYWORD. */
916 {
918 }
922 {
924 }
928 {
930 }
932 /* Return true if the next token is not the indicated KEYWORD. */
936 {
938 }
940 /* Return true if KEYWORD can start a decl-specifier. */
942 bool
944 {
946 {
947 /* auto specifier: storage-class-specifier in C++,
948 simple-type-specifier in C++0x. */
950 /* Storage classes. */
956 /* Elaborated type specifiers. */
962 /* Simple type specifiers. */
976 /* GNU extensions. */
979 /* C++0x extensions. */
991 }
992 }
994 /* Return true if the next token is a keyword for a decl-specifier. */
996 static bool
998 {
1003 }
1005 /* Returns TRUE iff the token T begins a decltype type. */
1007 static bool
1009 {
1012 }
1014 /* Returns TRUE iff the next token begins a decltype type. */
1016 static bool
1018 {
1021 }
1023 /* Called when processing a token with tree_check_value; perform or defer the
1024 associated checks and return the value. */
1026 static tree
1028 {
1029 /* Perform any access checks that were deferred. */
1034 {
1040 }
1041 /* Return the stored value. */
1043 }
1045 /* Return a pointer to the Nth token in the token stream. If N is 1,
1046 then this is precisely equivalent to cp_lexer_peek_token (except
1047 that it is not inline). One would like to disallow that case, but
1048 there is one case (cp_parser_nth_token_starts_template_id) where
1049 the caller passes a variable for N and it might be 1. */
1053 {
1056 /* N is 1-based, not zero-based. */
1067 {
1070 {
1073 }
1077 }
1080 {
1083 }
1086 }
1088 /* Return the next token, and advance the lexer's next_token pointer
1089 to point to the next non-purged token. */
1093 {
1099 do
1100 {
1103 {
1106 }
1108 }
1113 /* Provide debugging output. */
1115 {
1119 }
1122 }
1124 /* Permanently remove the next token from the token stream, and
1125 advance the next_token pointer to refer to the next non-purged
1126 token. */
1128 static void
1130 {
1139 do
1140 {
1141 tok++;
1143 {
1146 }
1147 }
1150 }
1152 /* Permanently remove all tokens after TOK, up to, but not
1153 including, the token that will be returned next by
1154 cp_lexer_peek_token. */
1156 static void
1158 {
1167 {
1172 }
1173 }
1175 /* Begin saving tokens. All tokens consumed after this point will be
1176 preserved. */
1178 static void
1180 {
1181 /* Provide debugging output. */
1186 }
1188 /* Commit to the portion of the token stream most recently saved. */
1190 static void
1192 {
1193 /* Provide debugging output. */
1198 }
1200 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1201 to the token stream. Stop saving tokens. */
1203 static void
1205 {
1206 /* Provide debugging output. */
1211 }
1213 /* RAII wrapper around the above functions, with sanity checking. Creating
1214 a variable saves tokens, which are committed when the variable is
1215 destroyed unless they are explicitly rolled back by calling the rollback
1216 member function. */
1218 struct saved_token_sentinel
1219 {
1224 {
1227 }
1229 {
1232 }
1234 {
1238 }
1239 };
1241 /* Print a representation of the TOKEN on the STREAM. */
1243 static void
1245 {
1246 /* We don't use cpp_type2name here because the parser defines
1247 a few tokens of its own. */
1249 /* cpplib-defined token types */
1250 #define OP(e, s) #e,
1251 #define TK(e, s) #e,
1252 TTYPE_TABLE
1253 #undef OP
1254 #undef TK
1255 /* C++ parser token types - see "Manifest constants", above. */
1259 };
1261 /* For some tokens, print the associated data. */
1263 {
1265 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1266 For example, `struct' is mapped to an INTEGER_CST. */
1269 /* fall through */
1287 /* If we have a name for the token, print it out. Otherwise, we
1288 simply give the numeric code. */
1291 else
1294 }
1295 }
1297 DEBUG_FUNCTION void
1299 {
1302 }
1304 DEBUG_FUNCTION void
1306 {
1309 else
1311 }
1314 /* Start emitting debugging information. */
1316 static void
1318 {
1325 }
1327 /* Stop emitting debugging information. */
1329 static void
1331 {
1338 }
1340 /* Create a new cp_token_cache, representing a range of tokens. */
1344 {
1349 }
1351 /* Diagnose if #pragma omp declare simd isn't followed immediately
1352 by function declaration or definition. */
1356 {
1358 {
1362 }
1363 }
1365 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1366 and put that into "omp declare simd" attribute. */
1370 {
1372 {
1374 {
1377 }
1379 {
1382 }
1383 }
1384 }
1386 /* Diagnose if #pragma acc routine isn't followed immediately by function
1387 declaration or definition. */
1391 {
1393 {
1395 "%<#pragma acc routine%> not immediately followed by "
1398 }
1399 }
1400 \f
1401 /* Decl-specifiers. */
1403 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1405 static void
1407 {
1409 }
1411 /* Declarators. */
1413 /* Nothing other than the parser should be creating declarators;
1414 declarators are a semi-syntactic representation of C++ entities.
1415 Other parts of the front end that need to create entities (like
1416 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1419 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1429 /* An erroneous declarator. */
1432 /* The obstack on which declarators and related data structures are
1433 allocated. */
1436 /* Alloc BYTES from the declarator memory pool. */
1440 {
1442 }
1444 /* Allocate a declarator of the indicated KIND. Clear fields that are
1445 common to all declarators. */
1449 {
1462 }
1464 /* Make a declarator for a generalized identifier. If
1465 QUALIFYING_SCOPE is non-NULL, the identifier is
1466 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1467 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1468 is, if any. */
1472 special_function_kind sfk)
1473 {
1476 /* It is valid to write:
1478 class C { void f(); };
1479 typedef C D;
1480 void D::f();
1482 The standard is not clear about whether `typedef const C D' is
1483 legal; as of 2002-09-15 the committee is considering that
1484 question. EDG 3.0 allows that syntax. Therefore, we do as
1485 well. */
1499 }
1501 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1502 of modifiers such as const or volatile to apply to the pointer
1503 type, represented as identifiers. ATTRIBUTES represent the attributes that
1504 appertain to the pointer or reference. */
1506 cp_declarator *
1508 tree attributes)
1509 {
1517 {
1521 }
1522 else
1528 }
1530 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1531 represent the attributes that appertain to the pointer or
1532 reference. */
1534 cp_declarator *
1537 {
1545 {
1549 }
1550 else
1556 }
1558 /* Like make_pointer_declarator -- but for a pointer to a non-static
1559 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1560 appertain to the pointer or reference. */
1562 cp_declarator *
1565 tree attributes)
1566 {
1575 {
1578 }
1579 else
1585 }
1587 /* Make a declarator for the function given by TARGET, with the
1588 indicated PARMS. The CV_QUALIFIERS apply to the function, as in
1589 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1590 indicates what exceptions can be thrown. */
1592 cp_declarator *
1594 tree parms,
1595 cp_cv_quals cv_qualifiers,
1596 cp_virt_specifiers virt_specifiers,
1597 cp_ref_qualifier ref_qualifier,
1598 tree tx_qualifier,
1599 tree exception_specification,
1600 tree late_return_type,
1601 tree requires_clause)
1602 {
1616 {
1620 }
1621 else
1625 }
1627 /* Make a declarator for an array of BOUNDS elements, each of which is
1628 defined by ELEMENT. */
1630 cp_declarator *
1632 {
1639 {
1643 }
1644 else
1648 }
1650 /* Determine whether the declarator we've seen so far can be a
1651 parameter pack, when followed by an ellipsis. */
1652 static bool
1654 {
1656 /* We already saw an ellipsis. */
1659 /* Search for a declarator name, or any other declarator that goes
1660 after the point where the ellipsis could appear in a parameter
1661 pack. If we find any of these, then this declarator can not be
1662 made into a parameter pack. */
1665 {
1667 {
1680 }
1681 }
1684 }
1688 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1689 DECLARATOR and DEFAULT_ARGUMENT. */
1691 cp_parameter_declarator *
1694 tree default_argument,
1695 location_t loc,
1697 {
1705 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 void 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 void 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 void 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 void 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 /* Get a description of the matching symbol to TOKEN_DESC e.g. "(" for
2774 RT_CLOSE_PAREN. */
2778 {
2780 {
2788 }
2789 }
2791 /* Attempt to convert TOKEN_DESC from a required_token to an
2792 enum cpp_ttype, returning CPP_EOF if there is no good conversion. */
2794 static enum cpp_ttype
2796 {
2798 {
2819 /* Use CPP_EOF as a "no completions possible" code. */
2821 }
2822 }
2825 /* Subroutine of cp_parser_error and cp_parser_required_error.
2827 Issue a diagnostic of the form
2828 FILE:LINE: MESSAGE before TOKEN
2829 where TOKEN is the next token in the input stream. MESSAGE
2830 (specified by the caller) is usually of the form "expected
2831 OTHER-TOKEN".
2833 This bypasses the check for tentative passing, and potentially
2834 adds material needed by cp_parser_required_error.
2836 If MISSING_TOKEN_DESC is not RT_NONE, then potentially add fix-it hints
2837 suggesting insertion of the missing token.
2839 Additionally, if MATCHING_LOCATION is not UNKNOWN_LOCATION, then we
2840 have an unmatched symbol at MATCHING_LOCATION; highlight this secondary
2841 location. */
2843 static void
2845 required_token missing_token_desc,
2846 location_t matching_location)
2847 {
2849 /* This diagnostic makes more sense if it is tagged to the line
2850 of the token we just peeked at. */
2854 {
2859 }
2861 /* If this is actually a conflict marker, report it as such. */
2865 {
2866 location_t loc;
2868 {
2871 }
2872 }
2879 {
2880 /* Potentially supply a fix-it hint, suggesting to add the
2881 missing token immediately after the *previous* token.
2882 This may move the primary location within richloc. */
2884 location_t prev_token_loc
2888 /* If matching_location != UNKNOWN_LOCATION, highlight it.
2889 Attempt to consolidate diagnostics by printing it as a
2890 secondary range within the main diagnostic. */
2892 added_matching_location
2894 }
2896 /* Actually emit the error. */
2898 /* Because c_parser_error does not understand
2899 CPP_KEYWORD, keywords are treated like
2900 identifiers. */
2905 {
2906 /* If we weren't able to consolidate matching_location, then
2907 print it as a secondary diagnostic. */
2912 }
2913 }
2915 /* If not parsing tentatively, issue a diagnostic of the form
2916 FILE:LINE: MESSAGE before TOKEN
2917 where TOKEN is the next token in the input stream. MESSAGE
2918 (specified by the caller) is usually of the form "expected
2919 OTHER-TOKEN". */
2921 static void
2923 {
2926 }
2928 /* Issue an error about name-lookup failing. NAME is the
2929 IDENTIFIER_NODE DECL is the result of
2930 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2931 the thing that we hoped to find. */
2933 static void
2935 tree name,
2936 tree decl,
2937 name_lookup_error desired,
2938 location_t location)
2939 {
2940 /* If name lookup completely failed, tell the user that NAME was not
2941 declared. */
2943 {
2956 else
2958 }
2960 {
2962 {
2979 }
2980 }
2982 {
2984 {
2994 name);
2998 }
2999 }
3000 else
3001 {
3003 {
3016 }
3017 }
3018 }
3020 /* If we are parsing tentatively, remember that an error has occurred
3021 during this tentative parse. Returns true if the error was
3022 simulated; false if a message should be issued by the caller. */
3024 static bool
3026 {
3028 {
3031 }
3033 }
3035 /* This function is called when a type is defined. If type
3036 definitions are forbidden at this point, an error message is
3037 issued. */
3039 static bool
3041 {
3042 /* If types are forbidden here, issue a message. */
3044 {
3045 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
3046 in the message need to be interpreted. */
3049 }
3051 }
3053 /* This function is called when the DECLARATOR is processed. The TYPE
3054 was a type defined in the decl-specifiers. If it is invalid to
3055 define a type in the decl-specifiers for DECLARATOR, an error is
3056 issued. TYPE_LOCATION is the location of TYPE and is used
3057 for error reporting. */
3059 static void
3062 {
3063 /* [dcl.fct] forbids type definitions in return types.
3064 Unfortunately, it's not easy to know whether or not we are
3065 processing a return type until after the fact. */
3073 {
3078 type);
3079 }
3080 }
3082 /* A type-specifier (TYPE) has been parsed which cannot be followed by
3083 "<" in any valid C++ program. If the next token is indeed "<",
3084 issue a message warning the user about what appears to be an
3085 invalid attempt to form a template-id. LOCATION is the location
3086 of the type-specifier (TYPE) */
3088 static void
3090 tree type,
3092 location_t location)
3093 {
3097 {
3103 {
3106 else
3108 }
3109 else
3111 /* Remember the location of the invalid "<". */
3114 /* Consume the "<". */
3116 /* Parse the template arguments. */
3118 /* Permanently remove the invalid template arguments so that
3119 this error message is not issued again. */
3122 }
3123 }
3125 /* If parsing an integral constant-expression, issue an error message
3126 about the fact that THING appeared and return true. Otherwise,
3127 return false. In either case, set
3128 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3130 static bool
3132 non_integral_constant thing)
3133 {
3136 {
3138 {
3141 {
3144 "ISO C++ forbids using a floating-point literal "
3149 "enumeration type cannot appear in a "
3240 }
3244 }
3245 }
3247 }
3249 /* Emit a diagnostic for an invalid type name. This function commits
3250 to the current active tentative parse, if any. (Otherwise, the
3251 problematic construct might be encountered again later, resulting
3252 in duplicate error messages.) LOCATION is the location of ID. */
3254 static void
3256 location_t location)
3257 {
3260 /* Try to lookup the identifier. */
3267 /* If the lookup was ambiguous, an error will already have
3268 been issued. */
3270 /* If the lookup found a template-name, it means that the user forgot
3271 to specify an argument list. Emit a useful error message. */
3273 {
3276 decl);
3281 }
3285 /* Something like 'unsigned A a;' */
3288 {
3289 /* Issue an error message. */
3294 {
3300 }
3301 else
3303 /* If we're in a template class, it's possible that the user was
3304 referring to a type from a base class. For example:
3306 template <typename T> struct A { typedef T X; };
3307 template <typename T> struct B : public A<T> { X x; };
3309 The user should have said "typename A<T>::X". */
3325 {
3326 tree b;
3329 b;
3331 {
3335 {
3336 tree field;
3337 /* Go from a particular instantiation of the
3338 template (which will have an empty TYPE_FIELDs),
3339 to the main version. */
3342 field;
3346 {
3351 }
3354 }
3355 }
3356 }
3357 }
3358 /* Here we diagnose qualified-ids where the scope is actually correct,
3359 but the identifier does not resolve to a valid type name. */
3361 {
3363 {
3372 else
3378 }
3381 {
3382 /* A<T>::A<T>() */
3388 }
3391 {
3394 "need %<typename%> before %<%T::%D::%E%> because "
3398 id,
3401 else
3405 }
3407 {
3419 else
3425 }
3426 else
3428 }
3429 }
3431 /* Check for a common situation where a type-name should be present,
3432 but is not, and issue a sensible error message. Returns true if an
3433 invalid type-name was detected.
3435 The situation handled by this function are variable declarations of the
3436 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3437 Usually, `ID' should name a type, but if we got here it means that it
3438 does not. We try to emit the best possible error message depending on
3439 how exactly the id-expression looks like. */
3441 static bool
3443 {
3444 tree id;
3447 /* Avoid duplicate error about ambiguous lookup. */
3449 {
3453 }
3462 /* If the next token is a (, this is a function with no explicit return
3463 type, i.e. constructor, destructor or conversion op. */
3466 {
3469 }
3473 /* Emit a diagnostic for the invalid type. */
3475 out:
3476 /* If we aren't in the middle of a declarator (i.e. in a
3477 parameter-declaration-clause), skip to the end of the declaration;
3478 there's no point in trying to process it. */
3482 }
3484 /* Consume tokens up to, and including, the next non-nested closing `)'.
3485 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3486 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3487 found an unnested token of that type. */
3489 static int
3492 cpp_ttype or_ttype,
3494 {
3504 {
3507 /* Have we found what we're looking for before the closing paren? */
3513 {
3516 /* If we've run out of tokens, then there is no closing `)'. */
3519 /* This is good for lambda expression capture-lists. */
3529 /* This matches the processing in skip_to_end_of_statement. */
3549 {
3553 }
3558 }
3560 /* Consume the token. */
3562 }
3563 }
3565 /* Consume tokens up to, and including, the next non-nested closing `)'.
3566 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3567 are doing error recovery. Returns -1 if OR_COMMA is true and we
3568 found an unnested token of that type. */
3570 static int
3575 {
3579 }
3581 /* Consume tokens until we reach the end of the current statement.
3582 Normally, that will be just before consuming a `;'. However, if a
3583 non-nested `}' comes first, then we stop before consuming that. */
3585 static void
3587 {
3590 /* Unwind generic function template scope if necessary. */
3595 {
3599 {
3602 /* If we've run out of tokens, stop. */
3606 /* If the next token is a `;', we have reached the end of the
3607 statement. */
3613 /* If this is a non-nested '}', stop before consuming it.
3614 That way, when confronted with something like:
3616 { 3 + }
3618 we stop before consuming the closing '}', even though we
3619 have not yet reached a `;'. */
3623 /* If it is the closing '}' for a block that we have
3624 scanned, stop -- but only after consuming the token.
3625 That way given:
3627 void f g () { ... }
3628 typedef int I;
3630 we will stop after the body of the erroneously declared
3631 function, but before consuming the following `typedef'
3632 declaration. */
3634 {
3637 }
3646 }
3648 /* Consume the token. */
3650 }
3651 }
3653 /* This function is called at the end of a statement or declaration.
3654 If the next token is a semicolon, it is consumed; otherwise, error
3655 recovery is attempted. */
3657 static void
3659 {
3660 /* Look for the trailing `;'. */
3662 {
3663 /* If there is additional (erroneous) input, skip to the end of
3664 the statement. */
3666 /* If the next token is now a `;', consume it. */
3669 }
3670 }
3672 /* Skip tokens until we have consumed an entire block, or until we
3673 have consumed a non-nested `;'. */
3675 static void
3677 {
3680 /* Unwind generic function template scope if necessary. */
3685 {
3689 {
3692 /* If we've run out of tokens, stop. */
3696 /* Stop if this is an unnested ';'. */
3702 /* Stop if this is an unnested '}', or closes the outermost
3703 nesting level. */
3704 nesting_depth--;
3712 /* Nest. */
3713 nesting_depth++;
3718 }
3720 /* Consume the token. */
3722 }
3723 }
3725 /* Skip tokens until a non-nested closing curly brace is the next
3726 token, or there are no more tokens. Return true in the first case,
3727 false otherwise. */
3729 static bool
3731 {
3735 {
3739 {
3742 /* If we've run out of tokens, stop. */
3746 /* If the next token is a non-nested `}', then we have reached
3747 the end of the current block. */
3753 /* If it the next token is a `{', then we are entering a new
3754 block. Consume the entire block. */
3760 }
3762 /* Consume the token. */
3764 }
3765 }
3767 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3768 parameter is the PRAGMA token, allowing us to purge the entire pragma
3769 sequence. */
3771 static void
3773 {
3778 do
3782 /* Ensure that the pragma is not parsed again. */
3784 }
3786 /* Require pragma end of line, resyncing with it as necessary. The
3787 arguments are as for cp_parser_skip_to_pragma_eol. */
3789 static void
3791 {
3795 }
3797 /* This is a simple wrapper around make_typename_type. When the id is
3798 an unresolved identifier node, we can provide a superior diagnostic
3799 using cp_parser_diagnose_invalid_type_name. */
3801 static tree
3803 location_t id_location)
3804 {
3805 tree result;
3807 {
3813 }
3815 }
3817 /* This is a wrapper around the
3818 make_{pointer,ptrmem,reference}_declarator functions that decides
3819 which one to call based on the CODE and CLASS_TYPE arguments. The
3820 CODE argument should be one of the values returned by
3821 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3822 appertain to the pointer or reference. */
3826 cp_cv_quals cv_qualifiers,
3828 tree attributes)
3829 {
3836 else
3846 }
3848 /* Create a new C++ parser. */
3852 {
3857 /* cp_lexer_new_main is called before doing GC allocation because
3858 cp_lexer_new_main might load a PCH file. */
3861 /* Initialize the binops_by_token so that we can get the tree
3862 directly from the token. */
3870 /* For now, we always accept GNU extensions. */
3873 /* The `>' token is a greater-than operator, not the end of a
3874 template-id. */
3879 /* We are not parsing a constant-expression. */
3884 /* Local variable names are not forbidden. */
3887 /* We are not processing an `extern "C"' declaration. */
3890 /* We are not processing a declarator. */
3893 /* We are not processing a template-argument-list. */
3896 /* We are not in an iteration statement. */
3899 /* We are not in a switch statement. */
3902 /* We are not parsing a type-id inside an expression. */
3905 /* Declarations aren't implicitly extern "C". */
3908 /* String literals should be translated to the execution character set. */
3911 /* We are not parsing a function body. */
3914 /* We can correct until told otherwise. */
3917 /* The unparsed function queue is empty. */
3920 /* There are no classes being defined. */
3923 /* No template parameters apply. */
3926 /* Special parsing data structures. */
3931 /* Not declaring an implicit function template. */
3937 /* Allow constrained-type-specifiers. */
3940 /* We haven't yet seen an 'extern "C"'. */
3944 }
3946 /* Create a cp_lexer structure which will emit the tokens in CACHE
3947 and push it onto the parser's lexer stack. This is used for delayed
3948 parsing of in-class method bodies and default arguments, and should
3949 not be confused with tentative parsing. */
3950 static void
3952 {
3957 /* Move the current source position to that of the first token in the
3958 new lexer. */
3960 }
3962 /* Pop the top lexer off the parser stack. This is never used for the
3963 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3964 static void
3966 {
3971 /* Put the current source position back where it was before this
3972 lexer was pushed. */
3974 }
3976 /* Lexical conventions [gram.lex] */
3978 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3979 identifier. */
3981 static cp_expr
3983 {
3986 /* Look for the identifier. */
3988 /* Return the value. */
3991 else
3993 }
3995 /* Parse a sequence of adjacent string constants. Returns a
3996 TREE_STRING representing the combined, nul-terminated string
3997 constant. If TRANSLATE is true, translate the string to the
3998 execution character set. If WIDE_OK is true, a wide string is
3999 invalid here.
4001 C++98 [lex.string] says that if a narrow string literal token is
4002 adjacent to a wide string literal token, the behavior is undefined.
4003 However, C99 6.4.5p4 says that this results in a wide string literal.
4004 We follow C99 here, for consistency with the C front end.
4006 This code is largely lifted from lex_string() in c-lex.c.
4008 FUTURE: ObjC++ will need to handle @-strings here. */
4009 static cp_expr
4012 {
4013 tree value;
4020 tree string_tree;
4026 {
4029 }
4034 {
4038 }
4039 else
4040 {
4043 }
4046 /* Try to avoid the overhead of creating and destroying an obstack
4047 for the common case of just one string. */
4050 {
4058 {
4062 }
4063 else
4067 }
4068 else
4069 {
4074 do
4075 {
4077 count++;
4082 {
4085 {
4088 }
4091 {
4096 }
4098 }
4099 else
4103 {
4107 {
4111 "unsupported non-standard concatenation "
4113 }
4114 }
4122 {
4126 }
4127 else
4128 {
4132 }
4133 }
4136 /* A string literal built by concatenation has its caret=start at
4137 the start of the initial string, and its finish at the finish of
4138 the final string literal. */
4142 }
4145 {
4148 }
4152 {
4157 {
4172 }
4177 {
4182 else
4184 }
4185 }
4186 else
4187 /* cpp_interpret_string has issued an error. */
4194 }
4196 /* Look up a literal operator with the name and the exact arguments. */
4198 static tree
4200 {
4201 tree decl;
4207 {
4213 {
4216 {
4226 }
4229 /* May be this should be sufficient_parms_p instead,
4230 depending on how exactly should user-defined literals
4231 work in presence of default arguments on the literal
4232 operator parameters. */
4235 }
4236 }
4239 }
4241 /* Parse a user-defined char constant. Returns a call to a user-defined
4242 literal operator taking the character as an argument. */
4244 static cp_expr
4246 {
4254 /* Build up a call to the user-defined operator */
4255 /* Lookup the name we got back from the id-expression. */
4260 {
4265 }
4269 }
4271 /* A subroutine of cp_parser_userdef_numeric_literal to
4272 create a char... template parameter pack from a string node. */
4274 static tree
4276 {
4277 tree charvec;
4283 /* Fill in CHARVEC with all of the parameters. */
4288 /* Build the argument packs. */
4294 }
4296 /* A subroutine of cp_parser_userdef_numeric_literal to
4297 create a char... template parameter pack from a string node. */
4299 static tree
4301 {
4302 tree charvec;
4313 /* First template parm is character type. */
4316 /* Fill in CHARVEC with all of the parameters. */
4323 /* Build the argument packs. */
4329 }
4331 /* Parse a user-defined numeric constant. returns a call to a user-defined
4332 literal operator. */
4334 static cp_expr
4336 {
4347 /* Look for a literal operator taking the exact type of numeric argument
4348 as the literal value. */
4353 {
4355 tf_warning_or_error);
4358 {
4361 long_long_unsigned_type_node);
4362 }
4363 else
4364 {
4368 long_double_type_node);
4372 }
4376 }
4379 /* If the numeric argument didn't work, look for a raw literal
4380 operator taking a const char* argument consisting of the number
4381 in string format. */
4386 {
4388 tf_warning_or_error);
4391 }
4394 /* If the raw literal didn't work, look for a non-type template
4395 function with parameter pack char.... Call the function with
4396 template parameter characters representing the number. */
4400 {
4404 tf_warning_or_error);
4407 }
4416 }
4418 /* Parse a user-defined string constant. Returns a call to a user-defined
4419 literal operator taking a character pointer and the length of the string
4420 as arguments. */
4422 static tree
4424 {
4433 /* Build up a call to the user-defined operator. */
4434 /* Lookup the name we got back from the id-expression. */
4441 {
4443 tf_warning_or_error);
4446 }
4449 /* Look for a template function with typename parameter CharT
4450 and parameter pack CharT... Call the function with
4451 template parameter characters representing the string. */
4455 {
4459 tf_warning_or_error);
4462 }
4468 }
4471 /* Basic concepts [gram.basic] */
4473 /* Parse a translation-unit.
4475 translation-unit:
4476 declaration-seq [opt]
4478 Returns TRUE if all went well. */
4480 static bool
4482 {
4483 /* The address of the first non-permanent object on the declarator
4484 obstack. */
4489 /* Create the declarator obstack, if necessary. */
4491 {
4493 /* Create the error declarator. */
4495 /* Create the empty parameter list. */
4497 UNKNOWN_LOCATION);
4498 /* Remember where the base of the declarator obstack lies. */
4500 }
4504 /* If there are no tokens left then all went well. */
4506 {
4507 /* Get rid of the token array; we don't need it any more. */
4511 /* This file might have been a context that's implicitly extern
4512 "C". If so, pop the lang context. (Only relevant for PCH.) */
4514 {
4517 }
4519 /* Finish up. */
4523 }
4524 else
4525 {
4528 }
4530 /* Make sure the declarator obstack was fully cleaned up. */
4534 /* All went well. */
4536 }
4538 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4539 decltype context. */
4543 {
4548 }
4550 /* We're about to parse a collection of statements. If we're currently
4551 parsing tentatively, set up a firewall so that any nested
4552 cp_parser_commit_to_tentative_parse won't affect the current context. */
4554 static cp_token_position
4556 {
4563 }
4565 /* We've finished parsing the collection of statements. Wrap up the
4566 firewall and replace the relevant tokens with the parsed form. */
4568 static void
4570 tree expr)
4571 {
4575 /* Finish the firewall level. */
4577 /* And remember the result of the parse for when we try again. */
4583 }
4585 /* Like the above functions, but let the user modify the tokens. Used by
4586 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4587 later parses, so it makes sense to localize the effects of
4588 cp_parser_commit_to_tentative_parse. */
4590 struct tentative_firewall
4591 {
4596 {
4597 /* If we're currently parsing tentatively, start a committed level as a
4598 firewall and then an inner tentative parse. */
4600 {
4604 }
4605 }
4608 {
4610 {
4611 /* Finish the inner tentative parse and the firewall, propagating any
4612 uncommitted error state to the outer tentative parse. */
4618 }
4619 }
4620 };
4622 /* Some tokens naturally come in pairs e.g.'(' and ')'.
4623 This class is for tracking such a matching pair of symbols.
4624 In particular, it tracks the location of the first token,
4625 so that if the second token is missing, we can highlight the
4626 location of the first token when notifying the user about the
4627 problem. */
4630 class token_pair
4631 {
4633 /* token_pair's ctor. */
4636 /* If the next token is the opening symbol for this pair, consume it and
4637 return true.
4638 Otherwise, issue an error and return false.
4639 In either case, record the location of the opening token. */
4642 {
4646 }
4648 /* Consume the next token from PARSER, recording its location as
4649 that of the opening token within the pair. */
4652 {
4657 }
4659 /* If the next token is the closing symbol for this pair, consume it
4660 and return it.
4661 Otherwise, issue an error, highlighting the location of the
4662 corresponding opening token, and return NULL. */
4665 {
4668 m_open_loc);
4669 }
4672 location_t m_open_loc;
4673 };
4675 /* Traits for token_pair<T> for tracking matching pairs of parentheses. */
4677 struct matching_paren_traits
4678 {
4683 };
4685 /* "matching_parens" is a token_pair<T> class for tracking matching
4686 pairs of parentheses. */
4690 /* Traits for token_pair<T> for tracking matching pairs of braces. */
4692 struct matching_brace_traits
4693 {
4698 };
4700 /* "matching_braces" is a token_pair<T> class for tracking matching
4701 pairs of braces. */
4706 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4707 enclosing parentheses. */
4709 static cp_expr
4711 {
4714 /* Consume the '('. */
4716 matching_parens parens;
4718 /* Start the statement-expression. */
4720 /* Parse the compound-statement. */
4722 /* Finish up. */
4724 /* Consume the ')'. */
4732 }
4734 /* Expressions [gram.expr] */
4736 /* Parse a fold-operator.
4738 fold-operator:
4739 - * / % ^ & | = < > << >>
4740 = -= *= /= %= ^= &= |= <<= >>=
4741 == != <= >= && || , .* ->*
4743 This returns the tree code corresponding to the matched operator
4744 as an int. When the current token matches a compound assignment
4745 opertor, the resulting tree code is the negative value of the
4746 non-assignment operator. */
4748 static int
4750 {
4752 {
4792 }
4793 }
4795 /* Returns true if CODE indicates a binary expression, which is not allowed in
4796 the LHS of a fold-expression. More codes will need to be added to use this
4797 function in other contexts. */
4799 static bool
4801 {
4803 {
4836 }
4837 }
4839 /* If the next token is a suitable fold operator, consume it and return as
4840 the function above. */
4842 static int
4844 {
4850 }
4852 /* Parse a fold-expression.
4854 fold-expression:
4855 ( ... folding-operator cast-expression)
4856 ( cast-expression folding-operator ... )
4857 ( cast-expression folding operator ... folding-operator cast-expression)
4859 Note that the '(' and ')' are matched in primary expression. */
4861 static cp_expr
4863 {
4864 cp_id_kind pidk;
4866 // Left fold.
4868 {
4872 {
4875 }
4882 }
4887 {
4890 }
4893 {
4896 }
4899 /* The operands of a fold-expression are cast-expressions, so binary or
4900 conditional expressions are not allowed. We check this here to avoid
4901 tentative parsing. */
4911 // Right fold.
4916 {
4919 }
4922 // Binary left or right fold.
4927 }
4929 /* Parse a primary-expression.
4931 primary-expression:
4932 literal
4933 this
4934 ( expression )
4935 id-expression
4936 lambda-expression (C++11)
4938 GNU Extensions:
4940 primary-expression:
4941 ( compound-statement )
4942 __builtin_va_arg ( assignment-expression , type-id )
4943 __builtin_offsetof ( type-id , offsetof-expression )
4945 C++ Extensions:
4946 __has_nothrow_assign ( type-id )
4947 __has_nothrow_constructor ( type-id )
4948 __has_nothrow_copy ( type-id )
4949 __has_trivial_assign ( type-id )
4950 __has_trivial_constructor ( type-id )
4951 __has_trivial_copy ( type-id )
4952 __has_trivial_destructor ( type-id )
4953 __has_virtual_destructor ( type-id )
4954 __is_abstract ( type-id )
4955 __is_base_of ( type-id , type-id )
4956 __is_class ( type-id )
4957 __is_empty ( type-id )
4958 __is_enum ( type-id )
4959 __is_final ( type-id )
4960 __is_literal_type ( type-id )
4961 __is_pod ( type-id )
4962 __is_polymorphic ( type-id )
4963 __is_std_layout ( type-id )
4964 __is_trivial ( type-id )
4965 __is_union ( type-id )
4967 Objective-C++ Extension:
4969 primary-expression:
4970 objc-expression
4972 literal:
4973 __null
4975 ADDRESS_P is true iff this expression was immediately preceded by
4976 "&" and therefore might denote a pointer-to-member. CAST_P is true
4977 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4978 true iff this expression is a template argument.
4980 Returns a representation of the expression. Upon return, *IDK
4981 indicates what kind of id-expression (if any) was present. */
4983 static cp_expr
4990 {
4993 /* Assume the primary expression is not an id-expression. */
4996 /* Peek at the next token. */
4999 {
5000 /* literal:
5001 integer-literal
5002 character-literal
5003 floating-literal
5004 string-literal
5005 boolean-literal
5006 pointer-literal
5007 user-defined-literal */
5019 {
5023 }
5024 /* Floating-point literals are only allowed in an integral
5025 constant expression if they are cast to an integral or
5026 enumeration type. */
5030 {
5031 /* CAST_P will be set even in invalid code like "int(2.7 +
5032 ...)". Therefore, we have to check that the next token
5033 is sure to end the cast. */
5035 {
5040 enumerator-definition. */
5042 /* The curly brace at the end of an enum-specifier. */
5044 /* The end of a statement. */
5046 /* The end of the cast-expression. */
5048 /* The end of an array bound. */
5050 /* The closing ">" in a template-argument-list. */
5053 /* C++0x only: A ">>" treated like two ">" tokens,
5054 in a template-argument-list. */
5059 }
5061 /* If we are within a cast, then the constraint that the
5062 cast is to an integral or enumeration type will be
5063 checked at that point. If we are not within a cast, then
5064 this code is invalid. */
5067 }
5087 /* ??? Should wide strings be allowed when parser->translate_strings_p
5088 is false (i.e. in attributes)? If not, we can kill the third
5089 argument to cp_parser_string_literal. */
5095 /* If we see `( { ' then we are looking at the beginning of
5096 a GNU statement-expression. */
5099 {
5100 /* Statement-expressions are not allowed by the standard. */
5104 /* And they're not allowed outside of a function-body; you
5105 cannot, for example, write:
5107 int i = ({ int j = 3; j + 1; });
5109 at class or namespace scope. */
5112 {
5114 "statement-expressions are not allowed outside "
5120 }
5121 else
5123 }
5124 /* Otherwise it's a normal parenthesized expression. */
5125 {
5126 cp_expr expr;
5131 /* Consume the `('. */
5132 matching_parens parens;
5134 /* Within a parenthesized expression, a `>' token is always
5135 the greater-than operator. */
5136 saved_greater_than_is_operator_p
5141 /* Left fold expression. */
5143 else
5144 /* Parse the parenthesized expression. */
5149 {
5156 }
5157 else
5158 /* Let the front end know that this expression was
5159 enclosed in parentheses. This matters in case, for
5160 example, the expression is of the form `A::B', since
5161 `&A::B' might be a pointer-to-member, but `&(A::B)' is
5162 not. */
5165 /* DR 705: Wrapping an unqualified name in parentheses
5166 suppresses arg-dependent lookup. We want to pass back
5167 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
5168 (c++/37862), but none of the others. */
5172 /* The `>' token might be the end of a template-id or
5173 template-parameter-list now. */
5174 parser->greater_than_is_operator_p
5177 /* Consume the `)'. */
5186 }
5189 {
5191 {
5192 /* We might have an Objective-C++ message. */
5195 /* If that works out, we're done ... */
5198 /* ... else, fall though to see if it's a lambda. */
5199 }
5201 /* Don't warn about a failed tentative parse. */
5206 }
5210 /* We have an Objective-C++ string literal. */
5217 {
5218 /* These two are the boolean literals. */
5226 /* The `__null' literal. */
5231 /* The `nullptr' literal. */
5236 /* Recognize the `this' keyword. */
5240 {
5244 }
5245 /* Pointers cannot appear in constant-expressions. */
5250 /* The `operator' keyword can be the beginning of an
5251 id-expression. */
5258 {
5259 non_integral_constant name;
5261 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
5262 __func__ are the names of variables -- but they are
5263 treated specially. Therefore, they are handled here,
5264 rather than relying on the generic id-expression logic
5265 below. Grammatically, these names are id-expressions.
5267 Consume the token. */
5271 {
5283 }
5288 /* Look up the name. */
5290 }
5293 {
5294 tree expression;
5295 tree type;
5296 source_location type_location;
5297 location_t start_loc
5299 /* The `__builtin_va_arg' construct is used to handle
5300 `va_arg'. Consume the `__builtin_va_arg' token. */
5302 /* Look for the opening `('. */
5303 matching_parens parens;
5305 /* Now, parse the assignment-expression. */
5307 /* Look for the `,'. */
5310 /* Parse the type-id. */
5311 {
5314 }
5315 /* Look for the closing `)'. */
5316 location_t finish_loc
5319 /* Using `va_arg' in a constant-expression is not
5320 allowed. */
5322 NIC_VA_ARG))
5324 /* Construct a location of the form:
5325 __builtin_va_arg (v, int)
5326 ~~~~~~~~~~~~~~~~~~~~~^~~~
5327 with the caret at the type, ranging from the start of the
5328 "__builtin_va_arg" token to the close paren. */
5329 location_t combined_loc
5332 }
5367 // C++ concepts
5371 /* Objective-C++ expressions. */
5381 {
5386 }
5387 /* FALLTHRU */
5391 }
5393 /* An id-expression can start with either an identifier, a
5394 `::' as the beginning of a qualified-id, or the "operator"
5395 keyword. */
5400 {
5401 id_expression:
5402 cp_expr id_expression;
5403 cp_expr decl;
5409 /* Parse the id-expression. */
5410 id_expression
5427 /* If we have a template-id, then no further lookup is
5428 required. If the template-id was for a template-class, we
5429 will sometimes have a TYPE_DECL at this point. */
5433 /* Look up the name. */
5434 else
5435 {
5436 tree ambiguous_decls;
5438 /* If we already know that this lookup is ambiguous, then
5439 we've already issued an error message; there's no reason
5440 to check again. */
5443 {
5446 }
5449 none_type,
5450 template_p,
5455 /* If the lookup was ambiguous, an error will already have
5456 been issued. */
5460 /* In Objective-C++, we may have an Objective-C 2.0
5461 dot-syntax for classes here. */
5466 {
5467 tree component;
5474 component);
5475 /* Build a location of the form:
5476 expr.component
5477 ~~~~~^~~~~~~~~
5478 with caret at the start of the component name (at
5479 input_location), ranging from the start of the id_expression
5480 to the end of the component name. */
5481 location_t combined_loc
5486 }
5488 /* In Objective-C++, an instance variable (ivar) may be preferred
5489 to whatever cp_parser_lookup_name() found.
5490 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5491 rest of c-family, we have to do a little extra work to preserve
5492 any location information in cp_expr "decl". Given that
5493 objc_lookup_ivar is implemented in "c-family" and "objc", we
5494 have a trip through the pure "tree" type, rather than cp_expr.
5495 Naively copying it back to "decl" would implicitly give the
5496 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5497 store an EXPR_LOCATION. Hence we only update "decl" (and
5498 hence its location_t) if we get back a different tree node. */
5500 id_expression);
5504 /* If name lookup gives us a SCOPE_REF, then the
5505 qualifying scope was dependent. */
5507 {
5508 /* At this point, we do not know if DECL is a valid
5509 integral constant expression. We assume that it is
5510 in fact such an expression, so that code like:
5512 template <int N> struct A {
5513 int a[B<N>::i];
5514 };
5516 is accepted. At template-instantiation time, we
5517 will check that B<N>::i is actually a constant. */
5519 }
5520 /* Check to see if DECL is a local variable in a context
5521 where that is forbidden. */
5524 {
5525 /* It might be that we only found DECL because we are
5526 trying to be generous with pre-ISO scoping rules.
5527 For example, consider:
5529 int i;
5530 void g() {
5531 for (int i = 0; i < 10; ++i) {}
5532 extern void f(int j = i);
5533 }
5535 Here, name look up will originally find the out
5536 of scope `i'. We need to issue a warning message,
5537 but then use the global `i'. */
5540 {
5545 }
5546 }
5547 }
5549 decl = (finish_id_expression
5551 idk,
5556 template_arg_p,
5563 }
5565 /* Anything else is an error. */
5569 }
5570 }
5578 {
5581 }
5583 /* Parse an id-expression.
5585 id-expression:
5586 unqualified-id
5587 qualified-id
5589 qualified-id:
5590 :: [opt] nested-name-specifier template [opt] unqualified-id
5591 :: identifier
5592 :: operator-function-id
5593 :: template-id
5595 Return a representation of the unqualified portion of the
5596 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5597 a `::' or nested-name-specifier.
5599 Often, if the id-expression was a qualified-id, the caller will
5600 want to make a SCOPE_REF to represent the qualified-id. This
5601 function does not do this in order to avoid wastefully creating
5602 SCOPE_REFs when they are not required.
5604 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5605 `template' keyword.
5607 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5608 uninstantiated templates.
5610 If *TEMPLATE_P is non-NULL, it is set to true iff the
5611 `template' keyword is used to explicitly indicate that the entity
5612 named is a template.
5614 If DECLARATOR_P is true, the id-expression is appearing as part of
5615 a declarator, rather than as part of an expression. */
5617 static cp_expr
5624 {
5628 /* Assume the `template' keyword was not used. */
5632 /* Look for the optional `::' operator. */
5633 global_scope_p
5634 = (!template_keyword_p
5639 /* Look for the optional nested-name-specifier. */
5640 nested_name_specifier_p
5643 check_dependency_p,
5645 declarator_p,
5646 template_keyword_p)
5649 /* If there is a nested-name-specifier, then we are looking at
5650 the first qualified-id production. */
5652 {
5653 tree saved_scope;
5654 tree saved_object_scope;
5655 tree saved_qualifying_scope;
5656 cp_expr unqualified_id;
5659 /* See if the next token is the `template' keyword. */
5663 /* Name lookup we do during the processing of the
5664 unqualified-id might obliterate SCOPE. */
5668 /* Process the final unqualified-id. */
5670 check_dependency_p,
5671 declarator_p,
5673 /* Restore the SAVED_SCOPE for our caller. */
5679 }
5680 /* Otherwise, if we are in global scope, then we are looking at one
5681 of the other qualified-id productions. */
5683 {
5685 tree id;
5687 /* Peek at the next token. */
5690 /* If it's an identifier, and the next token is not a "<", then
5691 we can avoid the template-id case. This is an optimization
5692 for this common case. */
5694 && !cp_parser_nth_token_starts_template_argument_list_p
5699 /* Try a template-id. */
5703 none_type,
5704 declarator_p);
5705 /* If that worked, we're done. */
5709 /* Peek at the next token. (Changes in the token buffer may
5710 have invalidated the pointer obtained above.) */
5714 {
5721 /* Fall through. */
5726 }
5727 }
5728 else
5731 declarator_p,
5732 optional_p);
5733 }
5735 /* Parse an unqualified-id.
5737 unqualified-id:
5738 identifier
5739 operator-function-id
5740 conversion-function-id
5741 ~ class-name
5742 template-id
5744 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5745 keyword, in a construct like `A::template ...'.
5747 Returns a representation of unqualified-id. For the `identifier'
5748 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5749 production a BIT_NOT_EXPR is returned; the operand of the
5750 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5751 other productions, see the documentation accompanying the
5752 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5753 names are looked up in uninstantiated templates. If DECLARATOR_P
5754 is true, the unqualified-id is appearing as part of a declarator,
5755 rather than as part of an expression. */
5757 static cp_expr
5763 {
5766 /* Peek at the next token. */
5770 {
5772 {
5773 tree id;
5775 /* We don't know yet whether or not this will be a
5776 template-id. */
5778 /* Try a template-id. */
5780 check_dependency_p,
5781 none_type,
5782 declarator_p);
5783 /* If it worked, we're done. */
5786 /* Otherwise, it's an ordinary identifier. */
5788 }
5792 check_dependency_p,
5793 none_type,
5794 declarator_p);
5797 {
5798 tree type_decl;
5799 tree qualifying_scope;
5800 tree object_scope;
5801 tree scope;
5804 /* Consume the `~' token. */
5806 /* Parse the class-name. The standard, as written, seems to
5807 say that:
5809 template <typename T> struct S { ~S (); };
5810 template <typename T> S<T>::~S() {}
5812 is invalid, since `~' must be followed by a class-name, but
5813 `S<T>' is dependent, and so not known to be a class.
5814 That's not right; we need to look in uninstantiated
5815 templates. A further complication arises from:
5817 template <typename T> void f(T t) {
5818 t.T::~T();
5819 }
5821 Here, it is not possible to look up `T' in the scope of `T'
5822 itself. We must look in both the current scope, and the
5823 scope of the containing complete expression.
5825 Yet another issue is:
5827 struct S {
5828 int S;
5829 ~S();
5830 };
5832 S::~S() {}
5834 The standard does not seem to say that the `S' in `~S'
5835 should refer to the type `S' and not the data member
5836 `S::S'. */
5838 /* DR 244 says that we look up the name after the "~" in the
5839 same scope as we looked up the qualifying name. That idea
5840 isn't fully worked out; it's more complicated than that. */
5845 /* Check for invalid scopes. */
5847 {
5851 }
5853 {
5857 scope);
5862 }
5865 /* If the name is of the form "X::~X" it's OK even if X is a
5866 typedef. */
5875 {
5878 }
5880 /* ~auto means the destructor of whatever the object is. */
5882 {
5885 "%<~auto%> only available with "
5889 }
5891 /* If there was an explicit qualification (S::~T), first look
5892 in the scope given by the qualification (i.e., S).
5894 Note: in the calls to cp_parser_class_name below we pass
5895 typename_type so that lookup finds the injected-class-name
5896 rather than the constructor. */
5900 {
5905 typename_type,
5908 declarator_p);
5911 }
5912 /* In "N::S::~S", look in "N" as well. */
5914 {
5919 type_decl
5923 typename_type,
5926 declarator_p);
5929 }
5930 /* In "p->S::~T", look in the scope given by "*p" as well. */
5932 {
5937 type_decl
5941 typename_type,
5944 declarator_p);
5947 }
5948 /* Look in the surrounding context. */
5950 {
5956 type_decl
5960 typename_type,
5963 declarator_p);
5966 {
5967 /* We couldn't find a type with this name. If we're parsing
5968 tentatively, fail and try something else. */
5970 {
5973 }
5974 /* Otherwise, accept it and check for a match at instantiation
5975 time. */
5980 }
5981 }
5982 /* If an error occurred, assume that the name of the
5983 destructor is the same as the name of the qualifying
5984 class. That allows us to keep parsing after running
5985 into ill-formed destructor names. */
5991 /* Check that destructor name and scope match. */
5993 {
6000 }
6002 /* [class.dtor]
6004 A typedef-name that names a class shall not be used as the
6005 identifier in the declarator for a destructor declaration. */
6012 type_decl);
6015 }
6019 {
6020 cp_expr id;
6022 /* This could be a template-id, so we try that first. */
6024 /* Try a template-id. */
6027 none_type,
6028 declarator_p);
6029 /* If that worked, we're done. */
6032 /* We still don't know whether we're looking at an
6033 operator-function-id or a conversion-function-id. */
6035 /* Try an operator-function-id. */
6037 /* If that didn't work, try a conversion-function-id. */
6041 {
6042 /* 17.6.3.3.5 */
6047 "literal operator suffixes not preceded by %<_%>"
6049 }
6052 }
6053 /* Fall through. */
6060 }
6061 }
6063 /* Parse an (optional) nested-name-specifier.
6065 nested-name-specifier: [C++98]
6066 class-or-namespace-name :: nested-name-specifier [opt]
6067 class-or-namespace-name :: template nested-name-specifier [opt]
6069 nested-name-specifier: [C++0x]
6070 type-name ::
6071 namespace-name ::
6072 nested-name-specifier identifier ::
6073 nested-name-specifier template [opt] simple-template-id ::
6075 PARSER->SCOPE should be set appropriately before this function is
6076 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
6077 effect. TYPE_P is TRUE if we non-type bindings should be ignored
6078 in name lookups.
6080 Sets PARSER->SCOPE to the class (TYPE) or namespace
6081 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
6082 it unchanged if there is no nested-name-specifier. Returns the new
6083 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
6085 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
6086 part of a declaration and/or decl-specifier. */
6088 static tree
6095 {
6100 /* Remember where the nested-name-specifier starts. */
6102 {
6105 }
6108 {
6109 tree new_scope;
6110 tree old_scope;
6111 tree saved_qualifying_scope;
6113 /* Spot cases that cannot be the beginning of a
6114 nested-name-specifier. */
6117 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
6118 the already parsed nested-name-specifier. */
6120 {
6121 /* Grab the nested-name-specifier and continue the loop. */
6123 /* If we originally encountered this nested-name-specifier
6124 with IS_DECLARATION set to false, we will not have
6125 resolved TYPENAME_TYPEs, so we must do so here. */
6128 {
6133 }
6136 }
6138 /* Spot cases that cannot be the beginning of a
6139 nested-name-specifier. On the second and subsequent times
6140 through the loop, we look for the `template' keyword. */
6142 ;
6143 /* A template-id can start a nested-name-specifier. */
6145 ;
6146 /* DR 743: decltype can be used in a nested-name-specifier. */
6148 ;
6149 else
6150 {
6151 /* If the next token is not an identifier, then it is
6152 definitely not a type-name or namespace-name. */
6155 /* If the following token is neither a `<' (to begin a
6156 template-id), nor a `::', then we are not looking at a
6157 nested-name-specifier. */
6163 {
6167 "found %<:%> in nested-name-specifier, "
6170 }
6173 && !cp_parser_nth_token_starts_template_argument_list_p
6176 }
6178 /* The nested-name-specifier is optional, so we parse
6179 tentatively. */
6182 /* Look for the optional `template' keyword, if this isn't the
6183 first time through the loop. */
6187 /* Save the old scope since the name lookup we are about to do
6188 might destroy it. */
6191 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
6192 look up names in "X<T>::I" in order to determine that "Y" is
6193 a template. So, if we have a typename at this point, we make
6194 an effort to look through it. */
6196 && !typename_keyword_p
6201 /* Parse the qualifying entity. */
6202 new_scope
6204 typename_keyword_p,
6205 template_keyword_p,
6206 check_dependency_p,
6207 type_p,
6208 is_declaration);
6209 /* Look for the `::' token. */
6212 /* If we found what we wanted, we keep going; otherwise, we're
6213 done. */
6215 {
6218 /* Restore the OLD_SCOPE since it was valid before the
6219 failed attempt at finding the last
6220 class-or-namespace-name. */
6224 /* If the next token is a decltype, and the one after that is a
6225 `::', then the decltype has failed to resolve to a class or
6226 enumeration type. Give this error even when parsing
6227 tentatively since it can't possibly be valid--and we're going
6228 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
6229 won't get another chance.*/
6233 {
6240 /* As below. */
6243 }
6247 {
6248 /* If we have a non-type template-id followed by ::, it can't
6249 possibly be valid. */
6254 {
6257 {
6263 }
6264 else
6265 {
6266 /* Variable template. */
6271 }
6278 /* As below. */
6282 }
6283 }
6287 /* If the next token is an identifier, and the one after
6288 that is a `::', then any valid interpretation would have
6289 found a class-or-namespace-name. */
6295 {
6298 {
6300 {
6301 tree decl;
6302 tree ambiguous_decls;
6305 none_type,
6314 decl);
6316 {
6317 // cp_parser_lookup_name has the same diagnostic,
6318 // thus make sure to emit it at most once.
6321 {
6326 }
6328 }
6329 else
6330 {
6332 cp_parser_name_lookup_error
6335 else
6336 cp_parser_name_lookup_error
6339 }
6340 }
6343 /* Treat this as a successful nested-name-specifier
6344 due to:
6346 [basic.lookup.qual]
6348 If the name found is not a class-name (clause
6349 _class_) or namespace-name (_namespace.def_), the
6350 program is ill-formed. */
6352 }
6354 }
6356 }
6357 /* We've found one valid nested-name-specifier. */
6359 /* Name lookup always gives us a DECL. */
6362 /* Uses of "template" must be followed by actual templates. */
6374 new_scope);
6375 /* If it is a class scope, try to complete it; we are about to
6376 be looking up names inside the class. */
6378 /* Since checking types for dependency can be expensive,
6379 avoid doing it if the type is already complete. */
6381 /* Do not try to complete dependent types. */
6383 {
6385 /* If it is a typedef to current class, use the current
6386 class instead, as the typedef won't have any names inside
6387 it yet. */
6391 }
6392 /* Make sure we look in the right scope the next time through
6393 the loop. */
6395 }
6397 /* If parsing tentatively, replace the sequence of tokens that makes
6398 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6399 token. That way, should we re-parse the token stream, we will
6400 not have to repeat the effort required to do the parse, nor will
6401 we issue duplicate error messages. */
6403 {
6407 /* Reset the contents of the START token. */
6409 /* Retrieve any deferred checks. Do not pop this access checks yet
6410 so the memory will not be reclaimed during token replacing below. */
6418 /* Purge all subsequent tokens. */
6420 }
6426 }
6428 /* Parse a nested-name-specifier. See
6429 cp_parser_nested_name_specifier_opt for details. This function
6430 behaves identically, except that it will an issue an error if no
6431 nested-name-specifier is present. */
6433 static tree
6439 {
6440 tree scope;
6442 /* Look for the nested-name-specifier. */
6444 typename_keyword_p,
6445 check_dependency_p,
6446 type_p,
6447 is_declaration);
6448 /* If it was not present, issue an error message. */
6450 {
6453 }
6456 }
6458 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6459 this is either a class-name or a namespace-name (which corresponds
6460 to the class-or-namespace-name production in the grammar). For
6461 C++0x, it can also be a type-name that refers to an enumeration
6462 type or a simple-template-id.
6464 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6465 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6466 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6467 TYPE_P is TRUE iff the next name should be taken as a class-name,
6468 even the same name is declared to be another entity in the same
6469 scope.
6471 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6472 specified by the class-or-namespace-name. If neither is found the
6473 ERROR_MARK_NODE is returned. */
6475 static tree
6482 {
6483 tree saved_scope;
6484 tree saved_qualifying_scope;
6485 tree saved_object_scope;
6486 tree scope;
6490 /* DR 743: decltype can appear in a nested-name-specifier. */
6492 {
6496 {
6499 }
6503 }
6505 /* Before we try to parse the class-name, we must save away the
6506 current PARSER->SCOPE since cp_parser_class_name will destroy
6507 it. */
6511 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6512 there is no need to look for a namespace-name. */
6513 only_class_p = template_keyword_p
6518 typename_keyword_p,
6519 template_keyword_p,
6521 check_dependency_p,
6523 is_declaration,
6526 /* If that didn't work, try for a namespace-name. */
6528 {
6529 /* Restore the saved scope. */
6533 /* If we are not looking at an identifier followed by the scope
6534 resolution operator, then this is not part of a
6535 nested-name-specifier. (Note that this function is only used
6536 to parse the components of a nested-name-specifier.) */
6541 }
6544 }
6546 /* Return true if we are looking at a compound-literal, false otherwise. */
6548 static bool
6550 {
6553 /* Skip tokens until the next token is a closing parenthesis.
6554 If we find the closing `)', and the next token is a `{', then
6555 we are looking at a compound-literal. */
6556 bool compound_literal_p
6561 /* Roll back the tokens we skipped. */
6565 }
6567 /* Parse a postfix-expression.
6569 postfix-expression:
6570 primary-expression
6571 postfix-expression [ expression ]
6572 postfix-expression ( expression-list [opt] )
6573 simple-type-specifier ( expression-list [opt] )
6574 typename :: [opt] nested-name-specifier identifier
6575 ( expression-list [opt] )
6576 typename :: [opt] nested-name-specifier template [opt] template-id
6577 ( expression-list [opt] )
6578 postfix-expression . template [opt] id-expression
6579 postfix-expression -> template [opt] id-expression
6580 postfix-expression . pseudo-destructor-name
6581 postfix-expression -> pseudo-destructor-name
6582 postfix-expression ++
6583 postfix-expression --
6584 dynamic_cast < type-id > ( expression )
6585 static_cast < type-id > ( expression )
6586 reinterpret_cast < type-id > ( expression )
6587 const_cast < type-id > ( expression )
6588 typeid ( expression )
6589 typeid ( type-id )
6591 GNU Extension:
6593 postfix-expression:
6594 ( type-id ) { initializer-list , [opt] }
6596 This extension is a GNU version of the C99 compound-literal
6597 construct. (The C99 grammar uses `type-name' instead of `type-id',
6598 but they are essentially the same concept.)
6600 If ADDRESS_P is true, the postfix expression is the operand of the
6601 `&' operator. CAST_P is true if this expression is the target of a
6602 cast.
6604 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6605 class member access expressions [expr.ref].
6607 Returns a representation of the expression. */
6609 static cp_expr
6613 {
6615 location_t loc;
6622 /* Peek at the next token. */
6627 /* Some of the productions are determined by keywords. */
6630 {
6635 {
6636 tree type;
6637 cp_expr expression;
6641 /* All of these can be handled in the same way from the point
6642 of view of parsing. Begin by consuming the token
6643 identifying the cast. */
6646 /* New types cannot be defined in the cast. */
6648 parser->type_definition_forbidden_message
6651 /* Look for the opening `<'. */
6653 /* Parse the type to which we are casting. */
6658 /* Look for the closing `>'. */
6660 /* Restore the old message. */
6663 bool saved_greater_than_is_operator_p
6667 /* And the expression which is being cast. */
6668 matching_parens parens;
6672 RT_CLOSE_PAREN);
6676 parser->greater_than_is_operator_p
6679 /* Only type conversions to integral or enumeration types
6680 can be used in constant-expressions. */
6683 {
6686 }
6689 {
6691 postfix_expression
6695 postfix_expression
6699 postfix_expression
6701 tf_warning_or_error);
6704 postfix_expression
6709 }
6711 /* Construct a location e.g. :
6712 reinterpret_cast <int *> (expr)
6713 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6714 ranging from the start of the "*_cast" token to the final closing
6715 paren, with the caret at the start. */
6718 }
6722 {
6723 tree type;
6727 /* Consume the `typeid' token. */
6729 /* Look for the `(' token. */
6730 matching_parens parens;
6732 /* Types cannot be defined in a `typeid' expression. */
6734 parser->type_definition_forbidden_message
6736 /* We can't be sure yet whether we're looking at a type-id or an
6737 expression. */
6739 /* Try a type-id first. */
6744 /* Look for the `)' token. Otherwise, we can't be sure that
6745 we're not looking at an expression: consider `typeid (int
6746 (3))', for example. */
6748 /* If all went well, simply lookup the type-id. */
6751 /* Otherwise, fall back to the expression variant. */
6752 else
6753 {
6754 tree expression;
6756 /* Look for an expression. */
6758 /* Compute its typeid. */
6760 /* Look for the `)' token. */
6762 }
6763 /* Restore the saved message. */
6765 /* `typeid' may not appear in an integral constant expression. */
6769 /* Construct a location e.g. :
6770 typeid (expr)
6771 ^~~~~~~~~~~~~
6772 ranging from the start of the "typeid" token to the final closing
6773 paren, with the caret at the start. */
6775 {
6776 location_t typeid_loc
6779 }
6780 }
6784 {
6785 tree type;
6786 /* The syntax permitted here is the same permitted for an
6787 elaborated-type-specifier. */
6794 }
6798 {
6799 location_t cilk_spawn_loc
6804 {
6809 }
6811 {
6816 }
6817 else
6818 {
6819 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6822 }
6824 postfix_expression =
6828 {
6832 }
6834 {
6839 }
6840 else
6841 {
6844 postfix_expression);
6845 /* Build a location of the form:
6846 _Cilk_spawn expr
6847 ~~~~~~~~~~~~^~~~
6848 with caret at the expr, ranging from the start of the
6849 _Cilk_spawn token to the end of the expression. */
6850 location_t combined_loc =
6856 }
6858 }
6863 {
6866 tree p;
6873 {
6876 }
6882 {
6885 postfix_expression
6887 else
6888 {
6892 }
6898 tf_warning_or_error);
6899 else
6900 {
6904 }
6909 postfix_expression
6913 postfix_expression
6916 else
6917 {
6921 }
6926 }
6928 }
6931 {
6932 tree type;
6934 /* If the next thing is a simple-type-specifier, we may be
6935 looking at a functional cast. We could also be looking at
6936 an id-expression. So, we try the functional cast, and if
6937 that doesn't work we fall back to the primary-expression. */
6939 /* Look for the simple-type-specifier. */
6943 CP_PARSER_FLAGS_NONE);
6945 /* Parse the cast itself. */
6947 postfix_expression
6949 /* If that worked, we're done. */
6953 /* If the functional-cast didn't work out, try a
6954 compound-literal. */
6957 {
6962 matching_parens parens;
6965 /* Avoid calling cp_parser_type_id pointlessly, see comment
6966 in cp_parser_cast_expression about c++/29234. */
6969 else
6970 {
6971 /* Parse the type. */
6977 }
6979 /* If things aren't going well, there's no need to
6980 keep going. */
6982 {
6984 /* Parse the brace-enclosed initializer list. */
6987 }
6988 /* If that worked, we're definitely looking at a
6989 compound-literal expression. */
6991 {
6992 /* Warn the user that a compound literal is not
6993 allowed in standard C++. */
6996 /* For simplicity, we disallow compound literals in
6997 constant-expressions. We could
6998 allow compound literals of integer type, whose
6999 initializer was a constant, in constant
7000 expressions. Permitting that usage, as a further
7001 extension, would not change the meaning of any
7002 currently accepted programs. (Of course, as
7003 compound literals are not part of ISO C++, the
7004 standard has nothing to say.) */
7006 NIC_NCC))
7007 {
7010 }
7011 /* Form the representation of the compound-literal. */
7012 postfix_expression
7017 }
7018 }
7020 /* It must be a primary-expression. */
7021 postfix_expression
7024 decltype_p,
7026 }
7028 }
7030 /* Note that we don't need to worry about calling build_cplus_new on a
7031 class-valued CALL_EXPR in decltype when it isn't the end of the
7032 postfix-expression; unary_complex_lvalue will take care of that for
7033 all these cases. */
7035 /* Keep looping until the postfix-expression is complete. */
7037 {
7041 /* It is not a Koenig lookup function call. */
7042 postfix_expression
7045 /* Peek at the next token. */
7049 {
7052 {
7054 "two consecutive %<[%> shall "
7057 }
7058 postfix_expression
7060 postfix_expression,
7062 decltype_p);
7071 /* postfix-expression ( expression-list [opt] ) */
7072 {
7083 is_builtin_constant_p
7086 {
7087 /* The whole point of __builtin_constant_p is to allow
7088 non-constant expressions to appear as arguments. */
7089 saved_integral_constant_expression_p
7091 saved_non_integral_constant_expression_p
7094 }
7095 args = (cp_parser_parenthesized_expression_list
7101 {
7102 parser->integral_constant_expression_p
7104 parser->non_integral_constant_expression_p
7106 }
7109 {
7112 }
7114 /* Function calls are not permitted in
7115 constant-expressions. */
7118 NIC_FUNC_CALL))
7119 {
7123 }
7128 {
7130 {
7132 {
7135 postfix_expression
7137 complain);
7138 }
7139 else
7140 postfix_expression
7142 }
7143 /* We do not perform argument-dependent lookup if
7144 normal lookup finds a non-function, in accordance
7145 with the expected resolution of DR 218. */
7148 {
7152 /* Do not do argument dependent lookup if regular
7153 lookup finds a member function or a block-scope
7154 function declaration. [basic.lookup.argdep]/3 */
7157 {
7160 postfix_expression
7162 complain);
7163 }
7164 }
7165 }
7171 {
7180 }
7183 {
7193 {
7195 postfix_expression
7199 }
7202 {
7203 postfix_expression
7204 = (build_new_method_call
7210 complain));
7211 }
7212 else
7213 postfix_expression
7217 complain);
7218 }
7222 postfix_expression = (build_offset_ref_call_from_tree
7224 complain));
7226 /* A call to a static class member, or a namespace-scope
7227 function. */
7228 postfix_expression
7231 koenig_p,
7232 complain);
7233 else
7234 /* All other function calls. */
7235 postfix_expression
7238 koenig_p,
7239 complain);
7242 {
7244 start_loc,
7245 close_paren_loc);
7247 }
7249 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
7253 }
7258 /* postfix-expression . template [opt] id-expression
7259 postfix-expression . pseudo-destructor-name
7260 postfix-expression -> template [opt] id-expression
7261 postfix-expression -> pseudo-destructor-name */
7263 /* Consume the `.' or `->' operator. */
7266 postfix_expression
7268 postfix_expression,
7275 /* postfix-expression ++ */
7276 /* Consume the `++' token. */
7278 /* Generate a representation for the complete expression. */
7279 postfix_expression
7281 POSTINCREMENT_EXPR);
7282 /* Increments may not appear in constant-expressions. */
7290 /* postfix-expression -- */
7291 /* Consume the `--' token. */
7293 /* Generate a representation for the complete expression. */
7294 postfix_expression
7296 POSTDECREMENT_EXPR);
7297 /* Decrements may not appear in constant-expressions. */
7308 return is_member_access
7309 ? postfix_expression
7311 else
7313 }
7314 }
7316 /* We should never get here. */
7319 }
7321 /* This function parses Cilk Plus array notations. If a normal array expr. is
7322 parsed then the array index is passed back to the caller through *INIT_INDEX
7323 and the function returns a NULL_TREE. If array notation expr. is parsed,
7324 then *INIT_INDEX is ignored by the caller and the function returns
7325 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
7326 error_mark_node. */
7328 static tree
7330 tree array_value)
7331 {
7335 {
7338 }
7347 {
7350 }
7352 {
7353 /* Consume the ':'. */
7356 /* If we are here, then we have a case like this A[:]. */
7358 {
7362 }
7366 }
7367 else
7368 {
7369 /* If we are here, then there are three valid possibilities:
7370 1. ARRAY [ EXP ]
7371 2. ARRAY [ EXP : EXP ]
7372 3. ARRAY [ EXP : EXP : EXP ] */
7376 {
7377 /* This indicates that we have a normal array expression. */
7380 }
7382 /* Consume the ':'. */
7386 {
7389 }
7390 }
7395 {
7399 }
7405 }
7407 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7408 by cp_parser_builtin_offsetof. We're looking for
7410 postfix-expression [ expression ]
7411 postfix-expression [ braced-init-list ] (C++11)
7413 FOR_OFFSETOF is set if we're being called in that context, which
7414 changes how we deal with integer constant expressions. */
7416 static tree
7418 tree postfix_expression,
7421 {
7426 /* Consume the `[' token. */
7432 /* Parse the index expression. */
7433 /* ??? For offsetof, there is a question of what to allow here. If
7434 offsetof is not being used in an integral constant expression context,
7435 then we *could* get the right answer by computing the value at runtime.
7436 If we are in an integral constant expression context, then we might
7437 could accept any constant expression; hard to say without analysis.
7438 Rather than open the barn door too wide right away, allow only integer
7439 constant expressions here. */
7442 else
7443 {
7445 {
7452 {
7454 "braced list index is not allowed with array "
7458 }
7459 }
7461 {
7462 /* Here are have these two options:
7463 ARRAY[EXP : EXP] - Array notation expr with default
7464 stride of 1.
7465 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7466 stride. */
7468 postfix_expression);
7471 }
7472 else
7474 }
7478 /* Look for the closing `]'. */
7481 /* Build the ARRAY_REF. */
7485 /* When not doing offsetof, array references are not permitted in
7486 constant-expressions. */
7492 }
7494 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7495 by cp_parser_builtin_offsetof. We're looking for
7497 postfix-expression . template [opt] id-expression
7498 postfix-expression . pseudo-destructor-name
7499 postfix-expression -> template [opt] id-expression
7500 postfix-expression -> pseudo-destructor-name
7502 FOR_OFFSETOF is set if we're being called in that context. That sorta
7503 limits what of the above we'll actually accept, but nevermind.
7504 TOKEN_TYPE is the "." or "->" token, which will already have been
7505 removed from the stream. */
7507 static tree
7510 cp_expr postfix_expression,
7512 location_t location)
7513 {
7514 tree name;
7520 /* If this is a `->' operator, dereference the pointer. */
7523 tf_warning_or_error);
7524 /* Check to see whether or not the expression is type-dependent and
7525 not the current instantiation. */
7527 /* The identifier following the `->' or `.' is not qualified. */
7533 /* Enter the scope corresponding to the type of the object
7534 given by the POSTFIX_EXPRESSION. */
7536 {
7538 /* According to the standard, no expression should ever have
7539 reference type. Unfortunately, we do not currently match
7540 the standard in this respect in that our internal representation
7541 of an expression may have reference type even when the standard
7542 says it does not. Therefore, we have to manually obtain the
7543 underlying type here. */
7545 /* The type of the POSTFIX_EXPRESSION must be complete. */
7546 /* Unlike the object expression in other contexts, *this is not
7547 required to be of complete type for purposes of class member
7548 access (5.2.5) outside the member function body. */
7551 && !(processing_template_decl
7552 && current_class_type
7553 && (same_type_ignoring_top_level_qualifiers_p
7555 {
7558 /* Avoid clobbering e.g. OVERLOADs or DECLs. */
7560 {
7561 /* In a template, be permissive by treating an object expression
7562 of incomplete type as dependent (after a pedwarn). */
7563 diagnostic_t kind = (processing_template_decl
7565 ? DK_PEDWARN
7567 cxx_incomplete_type_diagnostic
7573 {
7576 }
7577 }
7578 }
7581 {
7582 /* Let the name lookup machinery know that we are processing a
7583 class member access expression. */
7585 /* If something went wrong, we want to be able to discern that case,
7586 as opposed to the case where there was no SCOPE due to the type
7587 of expression being dependent. */
7590 /* If the SCOPE was erroneous, make the various semantic analysis
7591 functions exit quickly -- and without issuing additional error
7592 messages. */
7595 }
7596 }
7599 /* Tell cp_parser_lookup_name that there was an object, even though it's
7600 type-dependent. */
7603 /* Assume this expression is not a pseudo-destructor access. */
7606 /* If the SCOPE is a scalar type, then, if this is a valid program,
7607 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7608 is type dependent, it can be pseudo-destructor-name or something else.
7609 Try to parse it as pseudo-destructor-name first. */
7611 {
7612 tree s;
7613 tree type;
7616 /* Parse the pseudo-destructor-name. */
7625 {
7627 postfix_expression
7630 }
7631 }
7634 {
7635 /* If the SCOPE is not a scalar type, we are looking at an
7636 ordinary class member access expression, rather than a
7637 pseudo-destructor-name. */
7640 /* Parse the id-expression. */
7641 name = (cp_parser_id_expression
7648 /* In general, build a SCOPE_REF if the member name is qualified.
7649 However, if the name was not dependent and has already been
7650 resolved; there is no need to build the SCOPE_REF. For example;
7652 struct X { void f(); };
7653 template <typename T> void f(T* t) { t->X::f(); }
7655 Even though "t" is dependent, "X::f" is not and has been resolved
7656 to a BASELINK; there is no need to include scope information. */
7658 /* But we do need to remember that there was an explicit scope for
7659 virtual function calls. */
7663 /* If the name is a template-id that names a type, we will get a
7664 TYPE_DECL here. That is invalid code. */
7666 {
7669 }
7670 else
7671 {
7673 {
7675 {
7679 }
7680 else
7683 name,
7684 template_p);
7688 }
7690 adjust_result_of_qualified_name_lookup
7692 postfix_expression
7694 template_p,
7695 tf_warning_or_error);
7696 /* Build a location e.g.:
7697 ptr->access_expr
7698 ~~~^~~~~~~~~~~~~
7699 where the caret is at the deref token, ranging from
7700 the start of postfix_expression to the end of the access expr. */
7701 location_t end_loc
7703 location_t combined_loc
7706 }
7707 }
7709 /* We no longer need to look up names in the scope of the object on
7710 the left-hand side of the `.' or `->' operator. */
7713 /* Outside of offsetof, these operators may not appear in
7714 constant-expressions. */
7716 && (cp_parser_non_integral_constant_expression
7721 }
7723 /* Parse a parenthesized expression-list.
7725 expression-list:
7726 assignment-expression
7727 expression-list, assignment-expression
7729 attribute-list:
7730 expression-list
7731 identifier
7732 identifier, expression-list
7734 CAST_P is true if this expression is the target of a cast.
7736 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7737 argument pack.
7739 Returns a vector of trees. Each element is a representation of an
7740 assignment-expression. NULL is returned if the ( and or ) are
7741 missing. An empty, but allocated, vector is returned on no
7742 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7743 if we are parsing an attribute list for an attribute that wants a
7744 plain identifier argument, normal_attr for an attribute that wants
7745 an expression, or non_attr if we aren't parsing an attribute list. If
7746 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7747 not all of the expressions in the list were constant.
7748 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7749 will be written to with the location of the closing parenthesis. If
7750 an error occurs, it may or may not be written to. */
7759 {
7765 /* Assume all the expressions will be constant. */
7769 matching_parens parens;
7775 /* Within a parenthesized expression, a `>' token is always
7776 the greater-than operator. */
7777 saved_greater_than_is_operator_p
7781 /* Consume expressions until there are no more. */
7784 {
7785 tree expr;
7787 /* At the beginning of attribute lists, check to see if the
7788 next token is an identifier. */
7791 {
7794 /* Consume the identifier. */
7796 /* Save the identifier. */
7798 }
7799 else
7800 {
7803 /* Parse the next assignment-expression. */
7805 {
7806 /* A braced-init-list. */
7812 }
7814 {
7815 expr = (cp_parser_constant_expression
7820 }
7821 else
7823 cast_p);
7828 /* If we have an ellipsis, then this is an expression
7829 expansion. */
7832 {
7833 /* Consume the `...'. */
7836 /* Build the argument pack. */
7838 }
7840 /* Add it to the list. We add error_mark_node
7841 expressions to the list, so that we can still tell if
7842 the correct form for a parenthesized expression-list
7843 is found. That gives better errors. */
7848 }
7850 /* After the first item, attribute lists look the same as
7851 expression lists. */
7854 get_comma:;
7855 /* If the next token isn't a `,', then we are done. */
7859 /* Otherwise, consume the `,' and keep going. */
7861 }
7867 {
7870 skip_comma:;
7871 /* We try and resync to an unnested comma, as that will give the
7872 user better diagnostics. */
7880 {
7881 parser->greater_than_is_operator_p
7884 }
7885 }
7887 parser->greater_than_is_operator_p
7894 }
7896 /* Parse a pseudo-destructor-name.
7898 pseudo-destructor-name:
7899 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7900 :: [opt] nested-name-specifier template template-id :: ~ type-name
7901 :: [opt] nested-name-specifier [opt] ~ type-name
7903 If either of the first two productions is used, sets *SCOPE to the
7904 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7905 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7906 or ERROR_MARK_NODE if the parse fails. */
7908 static void
7910 tree object,
7913 {
7916 /* Handle ~auto. */
7920 {
7923 "%<~auto%> only available with "
7930 }
7932 /* Assume that things will not work out. */
7935 /* Look for the optional `::' operator. */
7937 /* Look for the optional nested-name-specifier. */
7938 nested_name_specifier_p
7945 /* Now, if we saw a nested-name-specifier, we might be doing the
7946 second production. */
7949 {
7950 /* Consume the `template' keyword. */
7952 /* Parse the template-id. */
7956 class_type,
7958 /* Look for the `::' token. */
7960 }
7961 /* If the next token is not a `~', then there might be some
7962 additional qualification. */
7964 {
7965 /* At this point, we're looking for "type-name :: ~". The type-name
7966 must not be a class-name, since this is a pseudo-destructor. So,
7967 it must be either an enum-name, or a typedef-name -- both of which
7968 are just identifiers. So, we peek ahead to check that the "::"
7969 and "~" tokens are present; if they are not, then we can avoid
7970 calling type_name. */
7974 {
7977 }
7979 /* Look for the type-name. */
7984 /* Look for the `::' token. */
7986 }
7987 else
7990 /* Look for the `~'. */
7993 /* Once we see the ~, this has to be a pseudo-destructor. */
7997 /* Look for the type-name again. We are not responsible for
7998 checking that it matches the first type-name. */
8000 }
8002 /* Parse a unary-expression.
8004 unary-expression:
8005 postfix-expression
8006 ++ cast-expression
8007 -- cast-expression
8008 unary-operator cast-expression
8009 sizeof unary-expression
8010 sizeof ( type-id )
8011 alignof ( type-id ) [C++0x]
8012 new-expression
8013 delete-expression
8015 GNU Extensions:
8017 unary-expression:
8018 __extension__ cast-expression
8019 __alignof__ unary-expression
8020 __alignof__ ( type-id )
8021 alignof unary-expression [C++0x]
8022 __real__ cast-expression
8023 __imag__ cast-expression
8024 && identifier
8025 sizeof ( type-id ) { initializer-list , [opt] }
8026 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
8027 __alignof__ ( type-id ) { initializer-list , [opt] }
8029 ADDRESS_P is true iff the unary-expression is appearing as the
8030 operand of the `&' operator. CAST_P is true if this expression is
8031 the target of a cast.
8033 Returns a representation of the expression. */
8035 static cp_expr
8038 {
8042 /* Peek at the next token. */
8044 /* Some keywords give away the kind of expression. */
8046 {
8050 {
8053 {
8059 /* Consume the token. */
8061 /* Parse the operand. */
8066 else
8067 {
8068 /* ISO C++ defines alignof only with types, not with
8069 expressions. So pedwarn if alignof is used with a non-
8070 type expression. However, __alignof__ is ok. */
8073 "ISO C++ does not allow %<alignof%> "
8077 }
8078 /* For SIZEOF_EXPR, just issue diagnostics, but keep
8079 SIZEOF_EXPR with the original operand. */
8081 {
8083 {
8085 {
8088 error_mark_node));
8090 }
8091 else
8095 }
8096 }
8098 /* Construct a location e.g. :
8099 alignof (expr)
8100 ^~~~~~~~~~~~~~
8101 with start == caret at the start of the "alignof"/"sizeof"
8102 token, with the endpoint at the final closing paren. */
8103 location_t finish_loc
8105 location_t compound_loc
8111 }
8120 {
8121 /* The saved value of the PEDANTIC flag. */
8123 tree expr;
8125 /* Save away the PEDANTIC flag. */
8127 /* Parse the cast-expression. */
8129 /* Restore the PEDANTIC flag. */
8133 }
8137 {
8138 tree expression;
8140 /* Consume the `__real__' or `__imag__' token. */
8142 /* Parse the cast-expression. */
8144 /* Create the complete representation. */
8148 expression,
8149 tf_warning_or_error);
8150 }
8158 {
8159 tree expr;
8166 matching_parens parens;
8170 parser->type_definition_forbidden_message
8173 saved_integral_constant_expression_p
8175 saved_non_integral_constant_expression_p
8179 saved_greater_than_is_operator_p
8191 parser->greater_than_is_operator_p
8194 parser->integral_constant_expression_p
8196 parser->non_integral_constant_expression_p
8203 }
8207 }
8208 }
8210 /* Look for the `:: new' and `:: delete', which also signal the
8211 beginning of a new-expression, or delete-expression,
8212 respectively. If the next token is `::', then it might be one of
8213 these. */
8215 {
8218 /* See if the token after the `::' is one of the keywords in
8219 which we're interested. */
8221 /* If it's `new', we have a new-expression. */
8224 /* Similarly, for `delete'. */
8227 }
8229 /* Look for a unary operator. */
8231 /* The `++' and `--' operators can be handled similarly, even though
8232 they are not technically unary-operators in the grammar. */
8234 {
8239 /* Handle the GNU address-of-label extension. */
8242 {
8243 tree identifier;
8244 tree expression;
8247 /* Consume the '&&' token. */
8249 /* Look for the identifier. */
8250 location_t finish_loc
8253 /* Construct a location of the form:
8254 &&label
8255 ^~~~~~~
8256 with caret==start at the "&&", finish at the end of the label. */
8257 location_t combined_loc
8259 /* Create an expression representing the address. */
8262 NIC_ADDR_LABEL))
8265 }
8266 }
8268 {
8269 cp_expr cast_expression;
8275 /* Consume the operator token. */
8279 /* Parse the cast-expression. */
8280 cast_expression
8285 pidk);
8287 /* Make a location:
8288 OP_TOKEN CAST_EXPRESSION
8289 ^~~~~~~~~~~~~~~~~~~~~~~~~
8290 with start==caret at the operator token, and
8291 extending to the end of the cast_expression. */
8294 /* Now, build an appropriate representation. */
8296 {
8300 RO_UNARY_STAR,
8301 complain);
8302 /* TODO: build_x_indirect_ref does not always honor the
8303 location, so ensure it is set. */
8309 /* Fall through. */
8312 cast_expression,
8313 complain);
8314 /* TODO: build_x_unary_op does not always honor the location,
8315 so ensure it is set. */
8323 /* Fall through. */
8325 /* Immediately fold negation of a constant, unless the constant is 0
8326 (since -0 == 0) or it would overflow. */
8331 {
8334 cast_expression);
8336 {
8339 }
8340 }
8341 /* Fall through. */
8350 }
8354 non_constant_p))
8358 }
8362 decltype_p,
8363 pidk);
8364 }
8366 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
8367 unary-operator, the corresponding tree code is returned. */
8369 static enum tree_code
8371 {
8373 {
8394 }
8395 }
8397 /* Parse a new-expression.
8399 new-expression:
8400 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8401 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8403 Returns a representation of the expression. */
8405 static tree
8407 {
8410 tree type;
8413 tree ret;
8417 /* Look for the optional `::' operator. */
8418 global_scope_p
8422 /* Look for the `new' operator. */
8424 /* There's no easy way to tell a new-placement from the
8425 `( type-id )' construct. */
8427 /* Look for a new-placement. */
8429 /* If that didn't work out, there's no new-placement. */
8431 {
8435 }
8437 /* If the next token is a `(', then we have a parenthesized
8438 type-id. */
8440 {
8444 /* Consume the `('. */
8445 matching_parens parens;
8448 /* Parse the type-id. */
8449 parser->type_definition_forbidden_message
8451 {
8454 }
8457 /* Look for the closing `)'. */
8460 /* There should not be a direct-new-declarator in this production,
8461 but GCC used to allowed this, so we check and emit a sensible error
8462 message for this case. */
8464 {
8470 }
8471 }
8472 /* Otherwise, there must be a new-type-id. */
8473 else
8476 /* If the next token is a `(' or '{', then we have a new-initializer. */
8481 else
8484 /* A new-expression may not appear in an integral constant
8485 expression. */
8488 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8489 of a new-type-id or type-id of a new-expression, the new-expression shall
8490 contain a new-initializer of the form ( assignment-expression )".
8491 Additionally, consistently with the spirit of DR 1467, we want to accept
8492 'new auto { 2 }' too. */
8498 {
8500 "initialization of new-expression for type %<auto%> "
8503 }
8504 else
8505 {
8506 /* Construct a location e.g.:
8507 ptr = new int[100]
8508 ^~~~~~~~~~~~
8509 with caret == start at the start of the "new" token, and the end
8510 at the end of the final token we consumed. */
8515 /* Create a representation of the new-expression. */
8517 tf_warning_or_error);
8519 }
8527 }
8529 /* Parse a new-placement.
8531 new-placement:
8532 ( expression-list )
8534 Returns the same representation as for an expression-list. */
8538 {
8541 /* Parse the expression-list. */
8542 expression_list = (cp_parser_parenthesized_expression_list
8551 }
8553 /* Parse a new-type-id.
8555 new-type-id:
8556 type-specifier-seq new-declarator [opt]
8558 Returns the TYPE allocated. If the new-type-id indicates an array
8559 type, *NELTS is set to the number of elements in the last array
8560 bound; the TYPE will not include the last array bound. */
8562 static tree
8564 {
8565 cp_decl_specifier_seq type_specifier_seq;
8571 /* The type-specifier sequence must not contain type definitions.
8572 (It cannot contain declarations of new types either, but if they
8573 are not definitions we will catch that because they are not
8574 complete.) */
8576 parser->type_definition_forbidden_message
8578 /* Parse the type-specifier-seq. */
8582 /* Restore the old message. */
8588 /* Parse the new-declarator. */
8591 /* Determine the number of elements in the last array dimension, if
8592 any. */
8594 /* Skip down to the last array dimension. */
8599 {
8602 }
8607 {
8610 }
8613 {
8620 else
8622 }
8625 }
8627 /* Parse an (optional) new-declarator.
8629 new-declarator:
8630 ptr-operator new-declarator [opt]
8631 direct-new-declarator
8633 Returns the declarator. */
8637 {
8640 cp_cv_quals cv_quals;
8642 /* We don't know if there's a ptr-operator next, or not. */
8644 /* Look for a ptr-operator. */
8646 /* If that worked, look for more new-declarators. */
8648 {
8651 /* Parse another optional declarator. */
8654 declarator = cp_parser_make_indirect_declarator
8658 }
8660 /* If the next token is a `[', there is a direct-new-declarator. */
8665 }
8667 /* Parse a direct-new-declarator.
8669 direct-new-declarator:
8670 [ expression ]
8671 direct-new-declarator [constant-expression]
8673 */
8677 {
8681 {
8682 tree expression;
8685 /* Look for the opening `['. */
8690 /* The standard requires that the expression have integral
8691 type. DR 74 adds enumeration types. We believe that the
8692 real intent is that these expressions be handled like the
8693 expression in a `switch' condition, which also allows
8694 classes with a single conversion to integral or
8695 enumeration type. */
8697 {
8698 expression
8700 expression,
8703 {
8705 "expression in new-declarator must have integral "
8708 }
8709 }
8711 /* Look for the closing `]'. */
8714 /* Add this bound to the declarator. */
8717 /* If the next token is not a `[', then there are no more
8718 bounds. */
8721 }
8724 }
8726 /* Parse a new-initializer.
8728 new-initializer:
8729 ( expression-list [opt] )
8730 braced-init-list
8732 Returns a representation of the expression-list. */
8736 {
8740 {
8741 tree t;
8748 }
8749 else
8750 expression_list = (cp_parser_parenthesized_expression_list
8756 }
8758 /* Parse a delete-expression.
8760 delete-expression:
8761 :: [opt] delete cast-expression
8762 :: [opt] delete [ ] cast-expression
8764 Returns a representation of the expression. */
8766 static tree
8768 {
8771 tree expression;
8773 /* Look for the optional `::' operator. */
8774 global_scope_p
8778 /* Look for the `delete' keyword. */
8780 /* See if the array syntax is in use. */
8782 {
8783 /* Consume the `[' token. */
8785 /* Look for the `]' token. */
8787 /* Remember that this is the `[]' construct. */
8789 }
8790 else
8793 /* Parse the cast-expression. */
8796 /* A delete-expression may not appear in an integral constant
8797 expression. */
8802 tf_warning_or_error);
8803 }
8805 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8806 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8807 0 otherwise. */
8809 static int
8811 {
8814 {
8856 /* In ((type ()) () the last () isn't a valid cast-expression,
8857 so the whole must be parsed as postfix-expression. */
8862 /* '[' may start a primary-expression in obj-c++ and in C++11,
8863 as a lambda-expression, eg, '(void)[]{}'. */
8870 /* '++' and '--' may or may not start a cast-expression:
8872 struct T { void operator++(int); };
8873 void f() { (T())++; }
8875 vs
8877 int a;
8878 (int)++a; */
8883 }
8884 }
8886 /* Try to find a legal C++-style cast to DST_TYPE for ORIG_EXPR, trying them
8887 in the order: const_cast, static_cast, reinterpret_cast.
8889 Don't suggest dynamic_cast.
8891 Return the first legal cast kind found, or NULL otherwise. */
8895 {
8896 tree trial;
8898 /* Reuse the parser logic by attempting to build the various kinds of
8899 cast, with "complain" disabled.
8900 Identify the first such cast that is valid. */
8902 /* Don't attempt to run such logic within template processing. */
8906 /* First try const_cast. */
8911 /* If that fails, try static_cast. */
8916 /* Finally, try reinterpret_cast. */
8921 /* No such cast possible. */
8923 }
8925 /* If -Wold-style-cast is enabled, add fix-its to RICHLOC,
8926 suggesting how to convert a C-style cast of the form:
8928 (DST_TYPE)ORIG_EXPR
8930 to a C++-style cast.
8932 The primary range of RICHLOC is asssumed to be that of the original
8933 expression. OPEN_PAREN_LOC and CLOSE_PAREN_LOC give the locations
8934 of the parens in the C-style cast. */
8936 static void
8939 tree dst_type)
8940 {
8941 /* This function is non-trivial, so bail out now if the warning isn't
8942 going to be emitted. */
8946 /* Try to find a legal C++ cast, trying them in order:
8947 const_cast, static_cast, reinterpret_cast. */
8952 /* Replace the open paren with "CAST_SUGGESTION<". */
8953 pretty_printer pp;
8957 /* Replace the close paren with "> (". */
8960 /* Add a closing paren after the expr (the primary range of RICH_LOC). */
8962 }
8965 /* Parse a cast-expression.
8967 cast-expression:
8968 unary-expression
8969 ( type-id ) cast-expression
8971 ADDRESS_P is true iff the unary-expression is appearing as the
8972 operand of the `&' operator. CAST_P is true if this expression is
8973 the target of a cast.
8975 Returns a representation of the expression. */
8977 static cp_expr
8980 {
8981 /* If it's a `(', then we might be looking at a cast. */
8983 {
8989 /* There's no way to know yet whether or not this is a cast.
8990 For example, `(int (3))' is a unary-expression, while `(int)
8991 3' is a cast. So, we resort to parsing tentatively. */
8993 /* Types may not be defined in a cast. */
8995 parser->type_definition_forbidden_message
8997 /* Consume the `('. */
8998 matching_parens parens;
9003 /* A very tricky bit is that `(struct S) { 3 }' is a
9004 compound-literal (which we permit in C++ as an extension).
9005 But, that construct is not a cast-expression -- it is a
9006 postfix-expression. (The reason is that `(struct S) { 3 }.i'
9007 is legal; if the compound-literal were a cast-expression,
9008 you'd need an extra set of parentheses.) But, if we parse
9009 the type-id, and it happens to be a class-specifier, then we
9010 will commit to the parse at that point, because we cannot
9011 undo the action that is done when creating a new class. So,
9012 then we cannot back up and do a postfix-expression.
9014 Another tricky case is the following (c++/29234):
9016 struct S { void operator () (); };
9018 void foo ()
9019 {
9020 ( S()() );
9021 }
9023 As a type-id we parse the parenthesized S()() as a function
9024 returning a function, groktypename complains and we cannot
9025 back up in this case either.
9027 Therefore, we scan ahead to the closing `)', and check to see
9028 if the tokens after the `)' can start a cast-expression. Otherwise
9029 we are dealing with an unary-expression, a postfix-expression
9030 or something else.
9032 Yet another tricky case, in C++11, is the following (c++/54891):
9034 (void)[]{};
9036 The issue is that usually, besides the case of lambda-expressions,
9037 the parenthesized type-id cannot be followed by '[', and, eg, we
9038 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
9039 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
9040 we don't commit, we try a cast-expression, then an unary-expression.
9042 Save tokens so that we can put them back. */
9045 /* We may be looking at a cast-expression. */
9048 cast_expression
9051 /* Roll back the tokens we skipped. */
9053 /* If we aren't looking at a cast-expression, simulate an error so
9054 that the call to cp_parser_error_occurred below returns true. */
9057 else
9058 {
9061 /* Look for the type-id. */
9063 /* Look for the closing `)'. */
9068 }
9070 /* Restore the saved message. */
9073 /* At this point this can only be either a cast or a
9074 parenthesized ctor such as `(T ())' that looks like a cast to
9075 function returning T. */
9077 {
9078 /* Only commit if the cast-expression doesn't start with
9079 '++', '--', or '[' in C++11. */
9087 pidk);
9090 {
9091 /* Warn about old-style casts, if so requested. */
9096 {
9102 }
9104 /* Only type conversions to integral or enumeration types
9105 can be used in constant-expressions. */
9108 NIC_CAST))
9111 /* Perform the cast. */
9112 /* Make a location:
9113 (TYPE) EXPR
9114 ^~~~~~~~~~~
9115 with start==caret at the open paren, extending to the
9116 end of "expr". */
9118 open_paren_loc,
9122 }
9123 }
9124 else
9126 }
9128 /* If we get here, then it's not a cast, so it must be a
9129 unary-expression. */
9132 }
9134 /* Parse a binary expression of the general form:
9136 pm-expression:
9137 cast-expression
9138 pm-expression .* cast-expression
9139 pm-expression ->* cast-expression
9141 multiplicative-expression:
9142 pm-expression
9143 multiplicative-expression * pm-expression
9144 multiplicative-expression / pm-expression
9145 multiplicative-expression % pm-expression
9147 additive-expression:
9148 multiplicative-expression
9149 additive-expression + multiplicative-expression
9150 additive-expression - multiplicative-expression
9152 shift-expression:
9153 additive-expression
9154 shift-expression << additive-expression
9155 shift-expression >> additive-expression
9157 relational-expression:
9158 shift-expression
9159 relational-expression < shift-expression
9160 relational-expression > shift-expression
9161 relational-expression <= shift-expression
9162 relational-expression >= shift-expression
9164 GNU Extension:
9166 relational-expression:
9167 relational-expression <? shift-expression
9168 relational-expression >? shift-expression
9170 equality-expression:
9171 relational-expression
9172 equality-expression == relational-expression
9173 equality-expression != relational-expression
9175 and-expression:
9176 equality-expression
9177 and-expression & equality-expression
9179 exclusive-or-expression:
9180 and-expression
9181 exclusive-or-expression ^ and-expression
9183 inclusive-or-expression:
9184 exclusive-or-expression
9185 inclusive-or-expression | exclusive-or-expression
9187 logical-and-expression:
9188 inclusive-or-expression
9189 logical-and-expression && inclusive-or-expression
9191 logical-or-expression:
9192 logical-and-expression
9193 logical-or-expression || logical-and-expression
9195 All these are implemented with a single function like:
9197 binary-expression:
9198 simple-cast-expression
9199 binary-expression <token> binary-expression
9201 CAST_P is true if this expression is the target of a cast.
9203 The binops_by_token map is used to get the tree codes for each <token> type.
9204 binary-expressions are associated according to a precedence table. */
9206 #define TOKEN_PRECEDENCE(token) \
9207 (((token->type == CPP_GREATER \
9208 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
9209 && !parser->greater_than_is_operator_p) \
9210 ? PREC_NOT_OPERATOR \
9211 : binops_by_token[token->type].prec)
9213 static cp_expr
9219 {
9220 cp_parser_expression_stack stack;
9222 cp_parser_expression_stack_entry current;
9223 cp_expr rhs;
9227 tree overload;
9229 /* Parse the first expression. */
9240 {
9241 /* Get an operator token. */
9247 {
9249 "%<>>%> operator is treated"
9253 }
9258 /* This is a fold-expression; handle it later. */
9261 /* Popping an entry off the stack means we completed a subexpression:
9262 - either we found a token which is not an operator (`>' where it is not
9263 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
9264 will happen repeatedly;
9265 - or, we found an operator which has lower priority. This is the case
9266 where the recursive descent *ascends*, as in `3 * 4 + 5' after
9267 parsing `3 * 4'. */
9269 {
9272 else
9274 }
9276 get_rhs:
9280 /* We used the operator token. */
9283 /* For "false && x" or "true || x", x will never be executed;
9284 disable warnings while evaluating it. */
9286 c_inhibit_evaluation_warnings +=
9289 c_inhibit_evaluation_warnings +=
9292 /* Extract another operand. It may be the RHS of this expression
9293 or the LHS of a new, higher priority expression. */
9298 /* Get another operator token. Look up its precedence to avoid
9299 building a useless (immediately popped) stack entry for common
9300 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
9307 {
9308 /* ... and prepare to parse the RHS of the new, higher priority
9309 expression. Since precedence levels on the stack are
9310 monotonically increasing, we do not have to care about
9311 stack overflows. */
9320 pop:
9322 /* If the stack is not empty, we have parsed into LHS the right side
9323 (`4' in the example above) of an expression we had suspended.
9324 We can use the information on the stack to recover the LHS (`3')
9325 from the stack together with the tree code (`MULT_EXPR'), and
9326 the precedence of the higher level subexpression
9327 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
9328 which will be used to actually build the additive expression. */
9333 }
9335 /* Undo the disabling of warnings done above. */
9337 c_inhibit_evaluation_warnings -=
9340 c_inhibit_evaluation_warnings -=
9346 /* Avoid warning for !!x == y. */
9351 /* Avoid warning for !b == y where b is boolean. */
9355 /* Avoid warning for !!b == y where b is boolean. */
9368 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
9369 ERROR_MARK for everything that is not a binary expression.
9370 This makes warn_about_parentheses miss some warnings that
9371 involve unary operators. For unary expressions we should
9372 pass the correct tree_code unless the unary expression was
9373 surrounded by parentheses.
9374 */
9381 == tcc_comparison
9384 else
9385 {
9390 /* TODO: build_x_binary_op doesn't always honor the location. */
9392 }
9395 /* If the binary operator required the use of an overloaded operator,
9396 then this expression cannot be an integral constant-expression.
9397 An overloaded operator can be used even if both operands are
9398 otherwise permissible in an integral constant-expression if at
9399 least one of the operands is of enumeration type. */
9403 NIC_OVERLOADED))
9405 }
9408 }
9410 static cp_expr
9415 {
9418 }
9420 /* Parse the `? expression : assignment-expression' part of a
9421 conditional-expression. The LOGICAL_OR_EXPR is the
9422 logical-or-expression that started the conditional-expression.
9423 Returns a representation of the entire conditional-expression.
9425 This routine is used by cp_parser_assignment_expression.
9427 ? expression : assignment-expression
9429 GNU Extensions:
9431 ? : assignment-expression */
9433 static tree
9435 {
9437 cp_expr assignment_expr;
9441 /* Consume the `?' token. */
9446 {
9449 /* Implicit true clause. */
9451 c_inhibit_evaluation_warnings +=
9454 }
9455 else
9456 {
9459 /* Parse the expression. */
9460 c_inhibit_evaluation_warnings +=
9463 c_inhibit_evaluation_warnings +=
9467 }
9469 /* The next token should be a `:'. */
9471 /* Parse the assignment-expression. */
9473 c_inhibit_evaluation_warnings -=
9476 /* Make a location:
9477 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9478 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9479 with the caret at the "?", ranging from the start of
9480 the logical_or_expr to the end of the assignment_expr. */
9485 /* Build the conditional-expression. */
9487 expr,
9488 assignment_expr,
9489 tf_warning_or_error);
9490 }
9492 /* Parse an assignment-expression.
9494 assignment-expression:
9495 conditional-expression
9496 logical-or-expression assignment-operator assignment_expression
9497 throw-expression
9499 CAST_P is true if this expression is the target of a cast.
9500 DECLTYPE_P is true if this expression is the operand of decltype.
9502 Returns a representation for the expression. */
9504 static cp_expr
9507 {
9508 cp_expr expr;
9510 /* If the next token is the `throw' keyword, then we're looking at
9511 a throw-expression. */
9514 /* Otherwise, it must be that we are looking at a
9515 logical-or-expression. */
9516 else
9517 {
9518 /* Parse the binary expressions (logical-or-expression). */
9520 decltype_p,
9522 /* If the next token is a `?' then we're actually looking at a
9523 conditional-expression. */
9526 else
9527 {
9530 /* If it's an assignment-operator, we're using the second
9531 production. */
9532 enum tree_code assignment_operator
9535 {
9538 /* Parse the right-hand side of the assignment. */
9545 /* An assignment may not appear in a
9546 constant-expression. */
9548 NIC_ASSIGNMENT))
9550 /* Build the assignment expression. Its default
9551 location:
9552 LHS = RHS
9553 ~~~~^~~~~
9554 is the location of the '=' token as the
9555 caret, ranging from the start of the lhs to the
9556 end of the rhs. */
9561 assignment_operator,
9562 rhs,
9564 /* TODO: build_x_modify_expr doesn't honor the location,
9565 so we must set it here. */
9567 }
9568 }
9569 }
9572 }
9574 /* Parse an (optional) assignment-operator.
9576 assignment-operator: one of
9577 = *= /= %= += -= >>= <<= &= ^= |=
9579 GNU Extension:
9581 assignment-operator: one of
9582 <?= >?=
9584 If the next token is an assignment operator, the corresponding tree
9585 code is returned, and the token is consumed. For example, for
9586 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9587 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9588 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9589 operator, ERROR_MARK is returned. */
9591 static enum tree_code
9593 {
9597 /* Peek at the next token. */
9601 {
9647 /* Nothing else is an assignment operator. */
9649 }
9651 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9656 /* If it was an assignment operator, consume it. */
9661 }
9663 /* Parse an expression.
9665 expression:
9666 assignment-expression
9667 expression , assignment-expression
9669 CAST_P is true if this expression is the target of a cast.
9670 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9671 except possibly parenthesized or on the RHS of a comma (N3276).
9673 Returns a representation of the expression. */
9675 static cp_expr
9678 {
9683 {
9684 cp_expr assignment_expression;
9686 /* Parse the next assignment-expression. */
9687 assignment_expression
9690 /* We don't create a temporary for a call that is the immediate operand
9691 of decltype or on the RHS of a comma. But when we see a comma, we
9692 need to create a temporary for a call on the LHS. */
9697 assignment_expression
9701 /* If this is the first assignment-expression, we can just
9702 save it away. */
9705 else
9706 {
9707 /* Create a location with caret at the comma, ranging
9708 from the start of the LHS to the end of the RHS. */
9713 assignment_expression,
9716 }
9717 /* If the next token is not a comma, or we're in a fold-expression, then
9718 we are done with the expression. */
9722 /* Consume the `,'. */
9725 /* A comma operator cannot appear in a constant-expression. */
9728 }
9731 }
9733 /* Parse a constant-expression.
9735 constant-expression:
9736 conditional-expression
9738 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9739 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9740 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9741 is false, NON_CONSTANT_P should be NULL. If STRICT_P is true,
9742 only parse a conditional-expression, otherwise parse an
9743 assignment-expression. See below for rationale. */
9745 static cp_expr
9750 {
9754 cp_expr expression;
9756 /* It might seem that we could simply parse the
9757 conditional-expression, and then check to see if it were
9758 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9759 one that the compiler can figure out is constant, possibly after
9760 doing some simplifications or optimizations. The standard has a
9761 precise definition of constant-expression, and we must honor
9762 that, even though it is somewhat more restrictive.
9764 For example:
9766 int i[(2, 3)];
9768 is not a legal declaration, because `(2, 3)' is not a
9769 constant-expression. The `,' operator is forbidden in a
9770 constant-expression. However, GCC's constant-folding machinery
9771 will fold this operation to an INTEGER_CST for `3'. */
9773 /* Save the old settings. */
9775 saved_allow_non_integral_constant_expression_p
9778 /* We are now parsing a constant-expression. */
9780 parser->allow_non_integral_constant_expression_p
9783 /* Although the grammar says "conditional-expression", when not STRICT_P,
9784 we parse an "assignment-expression", which also permits
9785 "throw-expression" and the use of assignment operators. In the case
9786 that ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9787 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9788 actually essential that we look for an assignment-expression.
9789 For example, cp_parser_initializer_clauses uses this function to
9790 determine whether a particular assignment-expression is in fact
9791 constant. */
9793 {
9794 /* Parse the binary expressions (logical-or-expression). */
9797 /* If the next token is a `?' then we're actually looking at
9798 a conditional-expression; otherwise we're done. */
9801 }
9802 else
9804 /* Restore the old settings. */
9805 parser->integral_constant_expression_p
9807 parser->allow_non_integral_constant_expression_p
9810 {
9811 /* Require an rvalue constant expression here; that's what our
9812 callers expect. Reference constant expressions are handled
9813 separately in e.g. cp_parser_template_argument. */
9822 }
9825 parser->non_integral_constant_expression_p
9829 }
9831 /* Parse __builtin_offsetof.
9833 offsetof-expression:
9834 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9836 offsetof-member-designator:
9837 id-expression
9838 | offsetof-member-designator "." id-expression
9839 | offsetof-member-designator "[" expression "]"
9840 | offsetof-member-designator "->" id-expression */
9842 static cp_expr
9844 {
9846 tree type;
9847 cp_expr expr;
9848 cp_id_kind dummy;
9850 location_t finish_loc;
9852 /* We're about to accept non-integral-constant things, but will
9853 definitely yield an integral constant expression. Save and
9854 restore these values around our local parsing. */
9860 /* Consume the "__builtin_offsetof" token. */
9862 /* Consume the opening `('. */
9863 matching_parens parens;
9865 /* Parse the type-id. */
9868 /* Look for the `,'. */
9872 /* Build the (type *)null that begins the traditional offsetof macro. */
9873 tree object_ptr
9875 tf_warning_or_error);
9877 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9881 {
9884 {
9886 /* offsetof-member-designator "[" expression "]" */
9892 /* offsetof-member-designator "->" identifier */
9895 /* FALLTHRU */
9898 /* offsetof-member-designator "." identifier */
9906 /* Consume the ")" token. */
9912 /* Error. We know the following require will fail, but
9913 that gives the proper error message. */
9918 }
9919 }
9921 success:
9922 /* Make a location of the form:
9923 __builtin_offsetof (struct s, f)
9924 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9925 with caret at the type-id, ranging from the start of the
9926 "_builtin_offsetof" token to the close paren. */
9928 /* The result will be an INTEGER_CST, so we need to explicitly
9929 preserve the location. */
9932 failure:
9937 }
9939 /* Parse a trait expression.
9941 Returns a representation of the expression, the underlying type
9942 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9944 static tree
9946 {
9947 cp_trait_kind kind;
9953 {
10055 }
10057 /* Consume the token. */
10060 matching_parens parens;
10063 {
10066 }
10072 {
10075 {
10078 }
10082 }
10084 {
10086 {
10090 {
10093 }
10097 }
10098 }
10102 /* Complete the trait expression, which may mean either processing
10103 the trait expr now or saving it for template instantiation. */
10105 {
10114 }
10115 }
10117 /* Parse a lambda expression.
10119 lambda-expression:
10120 lambda-introducer lambda-declarator [opt] compound-statement
10122 Returns a representation of the expression. */
10124 static cp_expr
10126 {
10128 tree type;
10136 {
10138 {
10142 }
10144 }
10146 {
10148 {
10151 }
10153 }
10155 /* We may be in the middle of deferred access check. Disable
10156 it now. */
10167 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
10170 /* Now that we've started the type, add the capture fields for any
10171 explicit captures. */
10174 {
10175 /* Inside the class, surrounding template-parameter-lists do not apply. */
10176 unsigned int saved_num_template_parameter_lists
10180 bool fully_implicit_function_template_p
10184 bool auto_is_implicit_function_template_parm_p
10195 /* By virtue of defining a local class, a lambda expression has access to
10196 the private variables of enclosing classes. */
10204 {
10209 }
10211 {
10214 }
10216 /* The capture list was built up in reverse order; fix that now. */
10228 parser->fully_implicit_function_template_p
10232 parser->auto_is_implicit_function_template_parm_p
10234 }
10236 /* This field is only used during parsing of the lambda. */
10239 /* This lambda shouldn't have any proxies left at this point. */
10241 /* And now that we're done, push proxies for an enclosing lambda. */
10246 else
10254 }
10256 /* Parse the beginning of a lambda expression.
10258 lambda-introducer:
10259 [ lambda-capture [opt] ]
10261 LAMBDA_EXPR is the current representation of the lambda expression. */
10263 static void
10265 {
10266 /* Need commas after the first capture. */
10269 /* Eat the leading `['. */
10272 /* Record default capture mode. "[&" "[=" "[&," "[=," */
10280 {
10283 }
10286 {
10288 tree capture_id;
10289 tree capture_init_expr;
10293 enum capture_kind_type
10294 {
10295 BY_COPY,
10296 BY_REFERENCE
10297 };
10301 {
10304 }
10308 else
10311 /* Possibly capture `this'. */
10313 {
10324 explicit_init_p);
10326 }
10328 /* Possibly capture `*this'. */
10331 {
10342 explicit_init_p);
10344 }
10346 /* Remember whether we want to capture as a reference or not. */
10348 {
10351 }
10353 /* Get the identifier. */
10358 /* Would be nice to have a cp_parser_skip_to_closing_x for general
10359 delimiters, but I modified this to stop on unnested ']' as well. It
10360 was already changed to stop on unnested '}', so the
10361 "closing_parenthesis" name is no more misleading with my change. */
10362 {
10368 }
10370 /* Find the initializer for this capture. */
10374 {
10376 /* An explicit initializer exists. */
10379 "lambda capture initializers "
10385 {
10388 }
10389 }
10390 else
10391 {
10394 /* Turn the identifier into an id-expression. */
10395 capture_init_expr
10400 {
10403 }
10407 {
10410 capture_init_expr);
10414 }
10417 {
10420 capture_init_expr))
10424 }
10426 capture_init_expr
10427 = finish_id_expression
10429 capture_init_expr,
10443 {
10446 }
10447 else
10449 }
10453 {
10458 capture_id);
10462 "capture of %qD redundant with by-reference capture "
10464 }
10467 capture_id,
10468 capture_init_expr,
10470 explicit_init_p);
10471 }
10474 }
10476 /* Parse the (optional) middle of a lambda expression.
10478 lambda-declarator:
10479 < template-parameter-list [opt] >
10480 ( parameter-declaration-clause [opt] )
10481 attribute-specifier [opt]
10482 decl-specifier-seq [opt]
10483 exception-specification [opt]
10484 lambda-return-type-clause [opt]
10486 LAMBDA_EXPR is the current representation of the lambda expression. */
10488 static bool
10490 {
10491 /* 5.1.1.4 of the standard says:
10492 If a lambda-expression does not include a lambda-declarator, it is as if
10493 the lambda-declarator were ().
10494 This means an empty parameter list, no attributes, and no exception
10495 specification. */
10502 cp_decl_specifier_seq lambda_specs;
10505 /* The template-parameter-list is optional, but must begin with
10506 an opening angle if present. */
10508 {
10511 "lambda templates are only available with "
10513 else
10523 /* We just processed one more parameter list. */
10525 }
10527 /* The parameter-declaration-clause is optional (unless
10528 template-parameter-list was given), but must begin with an
10529 opening parenthesis if present. */
10531 {
10532 matching_parens parens;
10537 /* Parse parameters. */
10540 /* Default arguments shall not be specified in the
10541 parameter-declaration-clause of a lambda-declarator. */
10552 /* In the decl-specifier-seq of the lambda-declarator, each
10553 decl-specifier shall either be mutable or constexpr. */
10557 CP_PARSER_FLAGS_ONLY_MUTABLE_OR_CONSTEXPR,
10560 {
10565 }
10569 /* Parse optional exception specification. */
10572 /* Parse optional trailing return type. */
10574 {
10577 }
10579 /* The function parameters must be in scope all the way until after the
10580 trailing-return-type in case of decltype. */
10582 }
10586 /* Create the function call operator.
10588 Messing with declarators like this is no uglier than building up the
10589 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10590 other code. */
10591 {
10592 cp_decl_specifier_seq return_type_specs;
10594 tree fco;
10601 else
10602 /* Maybe we will deduce the return type later. */
10606 {
10610 else
10613 }
10622 VIRT_SPEC_UNSPECIFIED,
10623 REF_QUAL_NONE,
10624 tx_qual,
10625 exception_spec,
10631 declarator,
10632 attributes);
10634 {
10637 /* Give the object parameter a different name. */
10641 }
10643 {
10647 }
10656 }
10657 }
10659 /* Parse the body of a lambda expression, which is simply
10661 compound-statement
10663 but which requires special handling.
10664 LAMBDA_EXPR is the current representation of the lambda expression. */
10666 static void
10668 {
10674 else
10675 /* Still increment function_depth so that we don't GC in the
10676 middle of an expression. */
10680 /* Clear this in case we're in the middle of a default argument. */
10684 /* Finish the function call operator
10685 - class_specifier
10686 + late_parsing_for_member
10687 + function_definition_after_declarator
10688 + ctor_initializer_opt_and_function_body */
10689 {
10695 tree compound_stmt;
10697 matching_braces braces;
10703 /* 5.1.1.4 of the standard says:
10704 If a lambda-expression does not include a trailing-return-type, it
10705 is as if the trailing-return-type denotes the following type:
10706 * if the compound-statement is of the form
10707 { return attribute-specifier [opt] expression ; }
10708 the type of the returned expression after lvalue-to-rvalue
10709 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10710 (_conv.array_ 4.2), and function-to-pointer conversion
10711 (_conv.func_ 4.3);
10712 * otherwise, void. */
10714 /* In a lambda that has neither a lambda-return-type-clause
10715 nor a deducible form, errors should be reported for return statements
10716 in the body. Since we used void as the placeholder return type, parsing
10717 the body as usual will give such desired behavior. */
10721 {
10725 /* Parse tentatively in case there's more after the initial return
10726 statement. */
10737 {
10739 {
10744 }
10746 /* Will get error here if type not deduced yet. */
10750 }
10751 }
10754 {
10759 }
10763 out:
10765 }
10772 else
10774 }
10776 /* Statements [gram.stmt.stmt] */
10778 /* Parse a statement.
10780 statement:
10781 labeled-statement
10782 expression-statement
10783 compound-statement
10784 selection-statement
10785 iteration-statement
10786 jump-statement
10787 declaration-statement
10788 try-block
10790 C++11:
10792 statement:
10793 labeled-statement
10794 attribute-specifier-seq (opt) expression-statement
10795 attribute-specifier-seq (opt) compound-statement
10796 attribute-specifier-seq (opt) selection-statement
10797 attribute-specifier-seq (opt) iteration-statement
10798 attribute-specifier-seq (opt) jump-statement
10799 declaration-statement
10800 attribute-specifier-seq (opt) try-block
10802 init-statement:
10803 expression-statement
10804 simple-declaration
10806 TM Extension:
10808 statement:
10809 atomic-statement
10811 IN_COMPOUND is true when the statement is nested inside a
10812 cp_parser_compound_statement; this matters for certain pragmas.
10814 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10815 is a (possibly labeled) if statement which is not enclosed in braces
10816 and has an else clause. This is used to implement -Wparentheses.
10818 CHAIN is a vector of if-else-if conditions. */
10820 static void
10824 {
10829 restart:
10832 /* There is no statement yet. */
10838 /* In obj-c++, seeing '[[' might be the either the beginning of
10839 c++11 attributes, or a nested objc-message-expression. So
10840 let's parse the c++11 attributes tentatively. */
10844 {
10847 }
10849 /* Peek at the next token. */
10851 /* Remember the location of the first token in the statement. */
10853 /* If this is a keyword, then that will often determine what kind of
10854 statement we have. */
10856 {
10860 {
10863 /* Looks like a labeled-statement with a case label.
10864 Parse the label, and then use tail recursion to parse
10865 the statement. */
10883 {
10888 }
10889 else
10903 {
10908 }
10909 else
10910 {
10914 }
10918 /* Objective-C++ exception-handling constructs. */
10932 /* This must be a namespace alias definition. */
10948 /* It might be a keyword like `int' that can start a
10949 declaration-statement. */
10951 }
10952 }
10954 {
10955 /* If the next token is a `:', then we are looking at a
10956 labeled-statement. */
10959 {
10960 /* Looks like a labeled-statement with an ordinary label.
10961 Parse the label, and then use tail recursion to parse
10962 the statement. */
10967 }
10968 }
10969 /* Anything that starts with a `{' must be a compound-statement. */
10972 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10973 a statement all its own. */
10975 {
10976 /* Only certain OpenMP pragmas are attached to statements, and thus
10977 are considered statements themselves. All others are not. In
10978 the context of a compound, accept the pragma as a "statement" and
10979 return so that we can check for a close brace. Otherwise we
10980 require a real statement and must go back and read one. */
10986 }
10988 {
10991 }
10993 /* Everything else must be a declaration-statement or an
10994 expression-statement. Try for the declaration-statement
10995 first, unless we are looking at a `;', in which case we know that
10996 we have an expression-statement. */
10998 {
11000 {
11002 {
11003 /* Attributes should be parsed as part of the the
11004 declaration, so let's un-parse them. */
11007 }
11010 /* Try to parse the declaration-statement. */
11012 /* If that worked, we're done. */
11015 }
11016 /* All preceding labels have been parsed at this point. */
11020 /* Look for an expression-statement instead. */
11023 /* Handle [[fallthrough]];. */
11025 {
11026 /* The next token after the fallthrough attribute is ';'. */
11028 {
11029 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11031 IFN_FALLTHROUGH,
11034 }
11035 else
11039 }
11040 }
11042 /* Set the line number for the statement. */
11046 /* Allow "[[fallthrough]];", but warn otherwise. */
11049 OPT_Wattributes,
11051 }
11053 /* Parse the label for a labeled-statement, i.e.
11055 identifier :
11056 case constant-expression :
11057 default :
11059 GNU Extension:
11060 case constant-expression ... constant-expression : statement
11062 When a label is parsed without errors, the label is added to the
11063 parse tree by the finish_* functions, so this function doesn't
11064 have to return the label. */
11066 static void
11068 {
11073 /* The next token should be an identifier. */
11077 {
11080 }
11082 /* Remember whether this case or a user-defined label is allowed to fall
11083 through to. */
11088 {
11090 {
11094 /* Consume the `case' token. */
11096 /* Parse the constant-expression. */
11103 {
11104 /* Consume the `...' token. */
11110 /* We don't need to emit warnings here, as the common code
11111 will do this for us. */
11112 }
11113 else
11117 {
11121 }
11122 else
11125 expr);
11126 }
11130 /* Consume the `default' token. */
11134 {
11138 }
11139 else
11144 /* Anything else must be an ordinary label. */
11149 }
11151 /* Require the `:' token. */
11154 /* An ordinary label may optionally be followed by attributes.
11155 However, this is only permitted if the attributes are then
11156 followed by a semicolon. This is because, for backward
11157 compatibility, when parsing
11158 lab: __attribute__ ((unused)) int i;
11159 we want the attribute to attach to "i", not "lab". */
11162 {
11163 tree attrs;
11170 ;
11171 else
11173 }
11179 }
11181 /* Parse an expression-statement.
11183 expression-statement:
11184 expression [opt] ;
11186 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11187 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11188 indicates whether this expression-statement is part of an
11189 expression statement. */
11191 static tree
11193 {
11198 /* There might be attribute fallthrough. */
11201 /* If the next token is a ';', then there is no expression
11202 statement. */
11204 {
11208 {
11211 }
11212 }
11214 /* Handle [[fallthrough]];. */
11216 {
11217 /* The next token after the fallthrough attribute is ';'. */
11219 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11222 else
11226 }
11228 /* Allow "[[fallthrough]];", but warn otherwise. */
11233 /* Give a helpful message for "A<T>::type t;" and the like. */
11236 {
11243 {
11244 /* A::A a; */
11249 }
11250 }
11252 /* Consume the final `;'. */
11257 /* This is the final expression statement of a statement
11258 expression. */
11264 }
11266 /* Parse a compound-statement.
11268 compound-statement:
11269 { statement-seq [opt] }
11271 GNU extension:
11273 compound-statement:
11274 { label-declaration-seq [opt] statement-seq [opt] }
11276 label-declaration-seq:
11277 label-declaration
11278 label-declaration-seq label-declaration
11280 Returns a tree representing the statement. */
11282 static tree
11285 {
11286 tree compound_stmt;
11287 matching_braces braces;
11289 /* Consume the `{'. */
11296 /* Begin the compound-statement. */
11298 /* If the next keyword is `__label__' we have a label declaration. */
11301 /* Parse an (optional) statement-seq. */
11303 /* Finish the compound-statement. */
11305 /* Consume the `}'. */
11309 }
11311 /* Parse an (optional) statement-seq.
11313 statement-seq:
11314 statement
11315 statement-seq [opt] statement */
11317 static void
11319 {
11320 /* Scan statements until there aren't any more. */
11322 {
11325 /* If we are looking at a `}', then we have run out of
11326 statements; the same is true if we have reached the end
11327 of file, or have stumbled upon a stray '@end'. */
11334 /* If we are in a compound statement and find 'else' then
11335 something went wrong. */
11337 {
11340 else
11341 {
11344 }
11345 }
11347 /* Parse the statement. */
11349 }
11350 }
11352 /* Return true if we're looking at (init; cond), false otherwise. */
11354 static bool
11356 {
11357 /* Save tokens so that we can put them back. */
11360 /* Look for ';' that is not nested in () or {}. */
11363 CPP_SEMICOLON,
11366 /* Roll back the tokens we skipped. */
11370 }
11372 /* Parse a selection-statement.
11374 selection-statement:
11375 if ( init-statement [opt] condition ) statement
11376 if ( init-statement [opt] condition ) statement else statement
11377 switch ( init-statement [opt] condition ) statement
11379 Returns the new IF_STMT or SWITCH_STMT.
11381 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11382 is a (possibly labeled) if statement which is not enclosed in
11383 braces and has an else clause. This is used to implement
11384 -Wparentheses.
11386 CHAIN is a vector of if-else-if conditions. This is used to implement
11387 -Wduplicated-cond. */
11389 static tree
11392 {
11395 token_indent_info guard_tinfo;
11400 /* Peek at the next token. */
11404 /* See what kind of keyword it is. */
11407 {
11410 {
11411 tree statement;
11412 tree condition;
11417 RID_CONSTEXPR))
11418 {
11424 }
11426 /* Look for the `('. */
11427 matching_parens parens;
11429 {
11432 }
11434 /* Begin the selection-statement. */
11436 {
11439 }
11440 else
11443 /* Parse the optional init-statement. */
11445 {
11446 tree decl;
11449 "init-statement in selection statements only available "
11452 }
11454 /* Parse the condition. */
11456 /* Look for the `)'. */
11462 {
11466 /* Add the condition. */
11473 /* Parse the then-clause. */
11477 /* Outside a template, the non-selected branch of a constexpr
11478 if is a 'discarded statement', i.e. unevaluated. */
11483 {
11486 }
11489 guard_tinfo);
11496 {
11500 }
11502 /* If the next token is `else', parse the else-clause. */
11504 RID_ELSE))
11505 {
11509 {
11512 }
11514 guard_tinfo
11516 /* Consume the `else' keyword. */
11519 {
11521 RID_IF)
11523 {
11524 /* We've got "if (COND) else if (COND2)". Start
11525 the condition chain and add COND as the first
11526 element. */
11530 {
11531 /* Wrap it in a NOP_EXPR so that we can set the
11532 location of the condition. */
11534 condition);
11537 }
11538 }
11540 RID_IF))
11541 {
11542 /* This is if-else without subsequent if. Zap the
11543 condition chain; we would have already warned at
11544 this point. */
11547 }
11548 }
11550 /* Parse the else-clause. */
11556 /* If we are currently parsing a then-clause, then
11557 IF_P will not be NULL. We set it to true to
11558 indicate that this if statement has an else clause.
11559 This may trigger the Wparentheses warning below
11560 when we get back up to the parent if statement. */
11565 {
11569 }
11570 }
11571 else
11572 {
11573 /* This if statement does not have an else clause. If
11574 NESTED_IF is true, then the then-clause has an if
11575 statement which does have an else clause. We warn
11576 about the potential ambiguity. */
11579 "suggest explicit braces to avoid ambiguous"
11582 {
11583 /* We don't need the condition chain anymore. */
11586 }
11587 }
11589 /* Now we're all done with the if-statement. */
11591 }
11592 else
11593 {
11597 /* Add the condition. */
11600 /* Parse the body of the switch-statement. */
11606 guard_tinfo);
11610 /* Now we're all done with the switch-statement. */
11612 }
11615 }
11621 }
11622 }
11624 /* Parse a condition.
11626 condition:
11627 expression
11628 type-specifier-seq declarator = initializer-clause
11629 type-specifier-seq declarator braced-init-list
11631 GNU Extension:
11633 condition:
11634 type-specifier-seq declarator asm-specification [opt]
11635 attributes [opt] = assignment-expression
11637 Returns the expression that should be tested. */
11639 static tree
11641 {
11642 cp_decl_specifier_seq type_specifiers;
11646 /* Try the declaration first. */
11648 /* New types are not allowed in the type-specifier-seq for a
11649 condition. */
11651 parser->type_definition_forbidden_message
11653 /* Parse the type-specifier-seq. */
11655 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11658 /* Restore the saved message. */
11660 /* If all is well, we might be looking at a declaration. */
11662 {
11663 tree decl;
11664 tree asm_specification;
11665 tree attributes;
11669 /* Parse the declarator. */
11675 /* Parse the attributes. */
11677 /* Parse the asm-specification. */
11679 /* If the next token is not an `=' or '{', then we might still be
11680 looking at an expression. For example:
11682 if (A(a).x)
11684 looks like a decl-specifier-seq and a declarator -- but then
11685 there is no `=', so this is an expression. */
11690 /* If we did see an `=' or '{', then we are looking at a declaration
11691 for sure. */
11693 {
11694 tree pushed_scope;
11698 /* Create the declaration. */
11704 /* Parse the initializer. */
11706 {
11710 }
11711 else
11712 {
11713 /* Consume the `='. */
11716 }
11720 /* Process the initializer. */
11723 asm_specification,
11724 flags);
11730 }
11731 }
11732 /* If we didn't even get past the declarator successfully, we are
11733 definitely not looking at a declaration. */
11734 else
11737 /* Otherwise, we are looking at an expression. */
11739 }
11741 /* Parses a for-statement or range-for-statement until the closing ')',
11742 not included. */
11744 static tree
11746 {
11750 /* Begin the for-statement. */
11753 /* Parse the initialization. */
11758 else
11760 }
11762 static tree
11764 {
11765 /* Normal for loop */
11768 tree stmt;
11771 /* The init-statement has already been parsed in
11772 cp_parser_init_statement, so no work is needed here. */
11775 /* If there's a condition, process it. */
11779 {
11783 }
11785 /* Look for the `;'. */
11788 /* If there's an expression, process it. */
11794 }
11796 /* Tries to parse a range-based for-statement:
11798 range-based-for:
11799 decl-specifier-seq declarator : expression
11801 The decl-specifier-seq declarator and the `:' are already parsed by
11802 cp_parser_init_statement. If processing_template_decl it returns a
11803 newly created RANGE_FOR_STMT; if not, it is converted to a
11804 regular FOR_STMT. */
11806 static tree
11809 {
11816 /* Get the range declaration momentarily out of the way so that
11817 the range expression doesn't clash with it. */
11819 {
11821 {
11823 /* For decomposition declaration get all of the corresponding
11824 declarations out of the way. */
11828 {
11834 {
11840 }
11841 }
11842 }
11844 {
11849 }
11850 }
11853 {
11856 }
11857 else
11860 /* Put the range declaration(s) back into scope. */
11862 {
11866 }
11868 /* If in template, STMT is converted to a normal for-statement
11869 at instantiation. If not, it is done just ahead. */
11871 {
11879 /* do_auto_deduction doesn't mess with template init-lists. */
11882 }
11883 else
11884 {
11888 }
11890 }
11892 /* Subroutine of cp_convert_range_for: given the initializer expression,
11893 builds up the range temporary. */
11895 static tree
11897 {
11900 /* Find out the type deduced by the declaration
11901 `auto &&__range = range_expr'. */
11906 /* Create the __range variable. */
11913 }
11915 /* Used by cp_parser_range_for in template context: we aren't going to
11916 do a full conversion yet, but we still need to resolve auto in the
11917 type of the for-range-declaration if present. This is basically
11918 a shortcut version of cp_convert_range_for. */
11920 static void
11922 {
11925 {
11928 iter_type = (cp_parser_perform_range_for_lookup
11931 {
11933 iter_type);
11935 tf_warning_or_error);
11938 }
11939 }
11940 }
11942 /* Converts a range-based for-statement into a normal
11943 for-statement, as per the definition.
11945 for (RANGE_DECL : RANGE_EXPR)
11946 BLOCK
11948 should be equivalent to:
11950 {
11951 auto &&__range = RANGE_EXPR;
11952 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11953 __begin != __end;
11954 ++__begin)
11955 {
11956 RANGE_DECL = *__begin;
11957 BLOCK
11958 }
11959 }
11961 If RANGE_EXPR is an array:
11962 BEGIN_EXPR = __range
11963 END_EXPR = __range + ARRAY_SIZE(__range)
11964 Else if RANGE_EXPR has a member 'begin' or 'end':
11965 BEGIN_EXPR = __range.begin()
11966 END_EXPR = __range.end()
11967 Else:
11968 BEGIN_EXPR = begin(__range)
11969 END_EXPR = end(__range);
11971 If __range has a member 'begin' but not 'end', or vice versa, we must
11972 still use the second alternative (it will surely fail, however).
11973 When calling begin()/end() in the third alternative we must use
11974 argument dependent lookup, but always considering 'std' as an associated
11975 namespace. */
11977 tree
11981 {
11989 /* If an error happened previously do nothing or else a lot of
11990 unhelpful errors would be issued. */
11992 else
11993 {
11994 tree range_temp;
11998 /* Can't bind a reference to an array of runtime bound. */
12000 else
12001 {
12006 LOOKUP_ONLYCONVERTING);
12008 }
12011 }
12013 /* The new for initialization statement. */
12021 LOOKUP_ONLYCONVERTING);
12032 LOOKUP_ONLYCONVERTING);
12036 /* The new for condition. */
12043 /* The new increment expression. */
12046 tf_warning_or_error);
12049 /* The declaration is initialized with *__begin inside the loop body. */
12052 tf_warning_or_error),
12054 LOOKUP_ONLYCONVERTING);
12059 }
12061 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12062 We need to solve both at the same time because the method used
12063 depends on the existence of members begin or end.
12064 Returns the type deduced for the iterator expression. */
12066 static tree
12068 {
12070 {
12073 }
12076 {
12081 }
12083 {
12084 /* If RANGE is an array, we will use pointer arithmetic. */
12087 range,
12091 }
12092 else
12093 {
12094 /* If it is not an array, we must do a bit of magic. */
12104 tf_warning_or_error);
12107 tf_warning_or_error);
12110 {
12111 /* Use the member functions. */
12114 else
12120 else
12123 }
12124 else
12125 {
12126 /* Use global functions with ADL. */
12133 tf_warning_or_error);
12135 tf_warning_or_error);
12137 tf_warning_or_error);
12139 tf_warning_or_error);
12142 }
12144 /* Last common checks. */
12146 {
12147 /* If one of the expressions is an error do no more checks. */
12150 }
12153 /* Can happen, when, eg, in a template context, Koenig lookup
12154 can't resolve begin/end (c++/58503). */
12156 else
12157 {
12159 /* The unqualified type of the __begin and __end temporaries should
12160 be the same, as required by the multiple auto declaration. */
12162 {
12169 /* P0184R0 allows __begin and __end to have different types,
12170 but make sure they are comparable so we can give a better
12172 else
12176 }
12178 }
12179 }
12180 }
12182 /* Helper function for cp_parser_perform_range_for_lookup.
12183 Builds a tree for RANGE.IDENTIFIER(). */
12185 static tree
12187 {
12200 tf_warning_or_error);
12203 }
12205 /* Parse an iteration-statement.
12207 iteration-statement:
12208 while ( condition ) statement
12209 do statement while ( expression ) ;
12210 for ( init-statement condition [opt] ; expression [opt] )
12211 statement
12213 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12215 static tree
12217 {
12220 tree statement;
12222 token_indent_info guard_tinfo;
12224 /* Peek at the next token. */
12231 /* Remember whether or not we are already within an iteration
12232 statement. */
12235 /* See what kind of keyword it is. */
12238 {
12240 {
12241 tree condition;
12243 /* Begin the while-statement. */
12245 /* Look for the `('. */
12246 matching_parens parens;
12248 /* Parse the condition. */
12251 /* Look for the `)'. */
12253 /* Parse the dependent statement. */
12257 /* We're done with the while-statement. */
12259 }
12263 {
12264 tree expression;
12266 /* Begin the do-statement. */
12268 /* Parse the body of the do-statement. */
12273 /* Look for the `while' keyword. */
12275 /* Look for the `('. */
12276 matching_parens parens;
12278 /* Parse the expression. */
12280 /* We're done with the do-statement. */
12282 /* Look for the `)'. */
12284 /* Look for the `;'. */
12286 }
12290 {
12291 /* Look for the `('. */
12292 matching_parens parens;
12297 /* Look for the `)'. */
12300 /* Parse the body of the for-statement. */
12305 /* We're done with the for-statement. */
12307 }
12314 }
12317 }
12319 /* Parse a init-statement or the declarator of a range-based-for.
12320 Returns true if a range-based-for declaration is seen.
12322 init-statement:
12323 expression-statement
12324 simple-declaration */
12326 static bool
12328 {
12329 /* If the next token is a `;', then we have an empty
12330 expression-statement. Grammatically, this is also a
12331 simple-declaration, but an invalid one, because it does not
12332 declare anything. Therefore, if we did not handle this case
12333 specially, we would issue an error message about an invalid
12334 declaration. */
12336 {
12340 /* A colon is used in range-based for. */
12343 /* We're going to speculatively look for a declaration, falling back
12344 to an expression, if necessary. */
12346 /* Parse the declaration. */
12349 decl);
12352 {
12353 /* It is a range-for, consume the ':' */
12357 {
12359 "range-based %<for%> loops only available with "
12362 }
12363 }
12364 else
12365 /* The ';' is not consumed yet because we told
12366 cp_parser_simple_declaration not to. */
12371 /* If the tentative parse failed, then we shall need to look for an
12372 expression-statement. */
12373 }
12374 /* If we are here, it is an expression-statement. */
12377 }
12379 /* Parse a jump-statement.
12381 jump-statement:
12382 break ;
12383 continue ;
12384 return expression [opt] ;
12385 return braced-init-list ;
12386 goto identifier ;
12388 GNU extension:
12390 jump-statement:
12391 goto * expression ;
12393 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12395 static tree
12397 {
12403 /* Peek at the next token. */
12408 /* See what kind of keyword it is. */
12411 {
12415 {
12435 }
12441 {
12448 /* Fall through. */
12458 }
12463 {
12464 tree expr;
12468 {
12472 }
12475 else
12476 /* If the next token is a `;', then there is no
12477 expression. */
12479 /* Build the return-statement. */
12482 else
12484 /* Look for the final `;'. */
12486 }
12492 {
12495 }
12497 /* Create the goto-statement. */
12499 {
12500 /* Issue a warning about this use of a GNU extension. */
12502 /* Consume the '*' token. */
12504 /* Parse the dependent expression. */
12506 }
12507 else
12509 /* Look for the final `;'. */
12516 }
12519 }
12521 /* Parse a declaration-statement.
12523 declaration-statement:
12524 block-declaration */
12526 static void
12528 {
12531 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12534 /* Parse the block-declaration. */
12537 /* Free any declarators allocated. */
12539 }
12541 /* Some dependent statements (like `if (cond) statement'), are
12542 implicitly in their own scope. In other words, if the statement is
12543 a single statement (as opposed to a compound-statement), it is
12544 none-the-less treated as if it were enclosed in braces. Any
12545 declarations appearing in the dependent statement are out of scope
12546 after control passes that point. This function parses a statement,
12547 but ensures that is in its own scope, even if it is not a
12548 compound-statement.
12550 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12551 is a (possibly labeled) if statement which is not enclosed in
12552 braces and has an else clause. This is used to implement
12553 -Wparentheses.
12555 CHAIN is a vector of if-else-if conditions. This is used to implement
12556 -Wduplicated-cond.
12558 Returns the new statement. */
12560 static tree
12564 {
12565 tree statement;
12568 token_indent_info body_tinfo
12574 /* Mark if () ; with a special NOP_EXPR. */
12576 {
12587 }
12588 /* if a compound is opened, we simply parse the statement directly. */
12591 /* If the token is not a `{', then we must take special action. */
12592 else
12593 {
12594 /* Create a compound-statement. */
12596 /* Parse the dependent-statement. */
12599 /* Finish the dummy compound-statement. */
12601 }
12603 token_indent_info next_tinfo
12612 /* Return the statement. */
12614 }
12616 /* For some dependent statements (like `while (cond) statement'), we
12617 have already created a scope. Therefore, even if the dependent
12618 statement is a compound-statement, we do not want to create another
12619 scope. */
12621 static void
12624 {
12625 /* If the token is a `{', then we must take special action. */
12627 {
12628 token_indent_info body_tinfo
12634 token_indent_info next_tinfo
12643 }
12644 else
12645 {
12646 /* Avoid calling cp_parser_compound_statement, so that we
12647 don't create a new scope. Do everything else by hand. */
12648 matching_braces braces;
12650 /* If the next keyword is `__label__' we have a label declaration. */
12653 /* Parse an (optional) statement-seq. */
12656 }
12657 }
12659 /* Declarations [gram.dcl.dcl] */
12661 /* Parse an optional declaration-sequence.
12663 declaration-seq:
12664 declaration
12665 declaration-seq declaration */
12667 static void
12669 {
12671 {
12682 {
12683 /* A declaration consisting of a single semicolon is
12684 invalid. Allow it unless we're being pedantic. */
12689 }
12691 /* If we're entering or exiting a region that's implicitly
12692 extern "C", modify the lang context appropriately. */
12694 {
12697 }
12699 {
12702 }
12705 {
12706 /* A top-level declaration can consist solely of a #pragma.
12707 A nested declaration cannot, so this is done here and not
12708 in cp_parser_declaration. (A #pragma at block scope is
12709 handled in cp_parser_statement.) */
12712 }
12714 /* Parse the declaration itself. */
12716 }
12717 }
12719 /* Parse a declaration.
12721 declaration:
12722 block-declaration
12723 function-definition
12724 template-declaration
12725 explicit-instantiation
12726 explicit-specialization
12727 linkage-specification
12728 namespace-definition
12730 C++17:
12731 deduction-guide
12733 GNU extension:
12735 declaration:
12736 __extension__ declaration */
12738 static void
12740 {
12741 cp_token token1;
12742 cp_token token2;
12747 /* Check for the `__extension__' keyword. */
12749 {
12750 /* Parse the qualified declaration. */
12752 /* Restore the PEDANTIC flag. */
12756 }
12758 /* Try to figure out what kind of declaration is present. */
12763 else
12764 {
12767 }
12769 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12772 /* If the next token is `extern' and the following token is a string
12773 literal, then we have a linkage specification. */
12777 /* If the next token is `template', then we have either a template
12778 declaration, an explicit instantiation, or an explicit
12779 specialization. */
12781 {
12782 /* `template <>' indicates a template specialization. */
12786 /* `template <' indicates a template declaration. */
12789 /* Anything else must be an explicit instantiation. */
12790 else
12792 }
12793 /* If the next token is `export', then we have a template
12794 declaration. */
12797 /* If the next token is `extern', 'static' or 'inline' and the one
12798 after that is `template', we have a GNU extended explicit
12799 instantiation directive. */
12806 /* If the next token is `namespace', check for a named or unnamed
12807 namespace definition. */
12816 /* An unnamed namespace definition. */
12820 /* An inline (associated) namespace definition. */
12824 /* Objective-C++ declaration/definition. */
12831 /* At this point we may have a template declared by a concept
12832 introduction. */
12837 else
12838 /* Try to parse a block-declaration, or a function-definition. */
12841 /* Free any declarators allocated. */
12843 }
12845 /* Parse a block-declaration.
12847 block-declaration:
12848 simple-declaration
12849 asm-definition
12850 namespace-alias-definition
12851 using-declaration
12852 using-directive
12854 GNU Extension:
12856 block-declaration:
12857 __extension__ block-declaration
12859 C++0x Extension:
12861 block-declaration:
12862 static_assert-declaration
12864 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12865 part of a declaration-statement. */
12867 static void
12870 {
12874 /* Check for the `__extension__' keyword. */
12876 {
12877 /* Parse the qualified declaration. */
12879 /* Restore the PEDANTIC flag. */
12883 }
12885 /* Peek at the next token to figure out which kind of declaration is
12886 present. */
12889 /* If the next keyword is `asm', we have an asm-definition. */
12891 {
12895 }
12896 /* If the next keyword is `namespace', we have a
12897 namespace-alias-definition. */
12900 /* If the next keyword is `using', we have a
12901 using-declaration, a using-directive, or an alias-declaration. */
12903 {
12908 /* If the token after `using' is `namespace', then we have a
12909 using-directive. */
12913 /* If the second token after 'using' is '=', then we have an
12914 alias-declaration. */
12920 /* Otherwise, it's a using-declaration. */
12921 else
12924 }
12925 /* If the next keyword is `__label__' we have a misplaced label
12926 declaration. */
12928 {
12932 /* If the next token is now a `;', consume it. */
12935 }
12936 /* If the next token is `static_assert' we have a static assertion. */
12939 /* Anything else must be a simple-declaration. */
12940 else
12943 }
12945 /* Parse a simple-declaration.
12947 simple-declaration:
12948 decl-specifier-seq [opt] init-declarator-list [opt] ;
12949 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12950 brace-or-equal-initializer ;
12952 init-declarator-list:
12953 init-declarator
12954 init-declarator-list , init-declarator
12956 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12957 function-definition as a simple-declaration.
12959 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12960 parsed declaration if it is an uninitialized single declarator not followed
12961 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12962 if present, will not be consumed. */
12964 static void
12968 {
12969 cp_decl_specifier_seq decl_specifiers;
12978 /* Defer access checks until we know what is being declared; the
12979 checks for names appearing in the decl-specifier-seq should be
12980 done as if we were in the scope of the thing being declared. */
12983 /* Parse the decl-specifier-seq. We have to keep track of whether
12984 or not the decl-specifier-seq declares a named class or
12985 enumeration type, since that is the only case in which the
12986 init-declarator-list is allowed to be empty.
12988 [dcl.dcl]
12990 In a simple-declaration, the optional init-declarator-list can be
12991 omitted only when declaring a class or enumeration, that is when
12992 the decl-specifier-seq contains either a class-specifier, an
12993 elaborated-type-specifier, or an enum-specifier. */
12995 CP_PARSER_FLAGS_OPTIONAL,
12998 /* We no longer need to defer access checks. */
13001 /* In a block scope, a valid declaration must always have a
13002 decl-specifier-seq. By not trying to parse declarators, we can
13003 resolve the declaration/expression ambiguity more quickly. */
13006 {
13009 }
13011 /* If the next two tokens are both identifiers, the code is
13012 erroneous. The usual cause of this situation is code like:
13014 T t;
13016 where "T" should name a type -- but does not. */
13019 {
13020 /* If parsing tentatively, we should commit; we really are
13021 looking at a declaration. */
13023 /* Give up. */
13025 }
13027 /* If we have seen at least one decl-specifier, and the next token
13028 is not a parenthesis, then we must be looking at a declaration.
13029 (After "int (" we might be looking at a functional cast.) */
13036 /* Look for C++17 decomposition declaration. */
13044 {
13045 tree decl
13047 maybe_range_for_decl,
13050 /* The next token should be either a `,' or a `;'. */
13052 /* If it's a `;', we are done. */
13055 /* Anything else is an error. */
13056 else
13057 {
13058 /* If we have already issued an error message we don't need
13059 to issue another one. */
13064 /* Skip tokens until we reach the end of the statement. */
13066 /* If the next token is now a `;', consume it. */
13070 }
13071 }
13072 else
13075 tree last_type;
13077 /* NULL_TREE if both variable and function declaration are allowed,
13078 error_mark_node if function declaration are not allowed and
13079 a FUNCTION_DECL that should be diagnosed if it is followed by
13080 variable declarations. */
13081 tree auto_function_declaration;
13084 auto_specifier_p
13088 /* Keep going until we hit the `;' at the end of the simple
13089 declaration. */
13092 CPP_SEMICOLON))
13093 {
13096 tree decl;
13100 {
13101 /* If we are processing next declarator, comma is expected */
13106 {
13110 }
13111 }
13112 else
13115 /* Parse the init-declarator. */
13118 function_definition_allowed_p,
13120 declares_class_or_enum,
13122 maybe_range_for_decl,
13125 /* If an error occurred while parsing tentatively, exit quickly.
13126 (That usually happens when in the body of a function; each
13127 statement is treated as a declaration-statement until proven
13128 otherwise.) */
13133 {
13134 /* If the init-declarator-list contains more than one
13135 init-declarator, they shall all form declarations of
13136 variables. */
13138 auto_function_declaration
13142 {
13144 "non-variable %qD in declaration with more than one "
13149 }
13150 }
13154 {
13158 {
13159 /* If the list of declarators contains more than one declarator,
13160 the type of each declared variable is determined as described
13161 above. If the type deduced for the template parameter U is not
13162 the same in each deduction, the program is ill-formed. */
13167 }
13168 else
13170 }
13172 /* Handle function definitions specially. */
13174 {
13175 /* If the next token is a `,', then we are probably
13176 processing something like:
13178 void f() {}, *p;
13180 which is erroneous. */
13182 {
13185 "mixing"
13187 }
13188 /* Otherwise, we're done with the list of declarators. */
13189 else
13190 {
13193 }
13194 }
13197 /* The next token should be either a `,' or a `;'. */
13199 /* If it's a `,', there are more declarators to come. */
13202 /* If it's a `;', we are done. */
13206 {
13211 }
13212 /* Anything else is an error. */
13213 else
13214 {
13215 /* If we have already issued an error message we don't need
13216 to issue another one. */
13221 /* Skip tokens until we reach the end of the statement. */
13223 /* If the next token is now a `;', consume it. */
13227 }
13228 /* After the first time around, a function-definition is not
13229 allowed -- even if it was OK at first. For example:
13231 int i, f() {}
13233 is not valid. */
13235 }
13237 /* Issue an error message if no declarators are present, and the
13238 decl-specifier-seq does not itself declare a class or
13239 enumeration: [dcl.dcl]/3. */
13241 {
13243 {
13247 /* Ensure an error is issued anyway when finish_decltype_type,
13248 called via cp_parser_decl_specifier_seq, returns a class or
13249 an enumeration (c++/51786). */
13252 }
13253 /* Perform any deferred access checks. */
13255 }
13257 /* Consume the `;'. */
13258 finish:
13262 {
13268 }
13270 done:
13272 }
13274 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13275 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13276 initializer ; */
13278 static tree
13283 {
13288 /* Parse the identifier-list. */
13292 {
13300 }
13304 {
13310 else
13311 {
13314 }
13315 }
13321 tree pushed_scope;
13328 NULL_TREE);
13335 cp_expr e;
13336 cp_decl_specifier_seq decl_specs;
13341 {
13344 else
13347 tree elt_pushed_scope;
13353 {
13354 /* Ensure we've diagnosed redeclaration if we aren't creating
13355 a new VAR_DECL. */
13358 }
13359 else
13363 }
13366 {
13369 }
13373 {
13383 {
13387 }
13390 {
13394 }
13395 }
13397 {
13399 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13400 the underlying DECL. */
13402 }
13408 {
13411 }
13414 }
13416 /* Parse a decl-specifier-seq.
13418 decl-specifier-seq:
13419 decl-specifier-seq [opt] decl-specifier
13420 decl-specifier attribute-specifier-seq [opt] (C++11)
13422 decl-specifier:
13423 storage-class-specifier
13424 type-specifier
13425 function-specifier
13426 friend
13427 typedef
13429 GNU Extension:
13431 decl-specifier:
13432 attributes
13434 Concepts Extension:
13436 decl-specifier:
13437 concept
13439 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13441 The parser flags FLAGS is used to control type-specifier parsing.
13443 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13444 flags:
13446 1: one of the decl-specifiers is an elaborated-type-specifier
13447 (i.e., a type declaration)
13448 2: one of the decl-specifiers is an enum-specifier or a
13449 class-specifier (i.e., a type definition)
13451 */
13453 static void
13455 cp_parser_flags flags,
13458 {
13462 cp_decl_spec ds;
13464 /* Clear DECL_SPECS. */
13467 /* Assume no class or enumeration type is declared. */
13470 /* Keep reading specifiers until there are no more to read. */
13472 {
13477 /* Peek at the next token. */
13480 /* Save the first token of the decl spec list for error
13481 reporting. */
13484 /* Handle attributes. */
13486 {
13487 /* Parse the attributes. */
13490 /* In a sequence of declaration specifiers, c++11 attributes
13491 appertain to the type that precede them. In that case
13492 [dcl.spec]/1 says:
13494 The attribute-specifier-seq affects the type only for
13495 the declaration it appears in, not other declarations
13496 involving the same type.
13498 But for now let's force the user to position the
13499 attribute either at the beginning of the declaration or
13500 after the declarator-id, which would clearly mean that it
13501 applies to the declarator. */
13503 {
13505 /* The c++11 attribute is at the beginning of the
13506 declaration. It appertains to the entity being
13508 else
13509 {
13511 {
13512 /* This is an attribute following a
13513 class-specifier. */
13518 }
13519 else
13520 {
13521 decl_specs->std_attributes
13523 attrs);
13526 }
13528 }
13529 }
13531 decl_specs->attributes
13533 attrs);
13537 }
13538 /* Assume we will find a decl-specifier keyword. */
13540 /* If the next token is an appropriate keyword, we can simply
13541 add it to the list. */
13543 {
13544 /* decl-specifier:
13545 friend
13546 constexpr */
13549 {
13554 }
13555 else
13556 {
13558 /* Consume the token. */
13560 }
13573 /* function-specifier:
13574 inline
13575 virtual
13576 explicit */
13583 /* decl-specifier:
13584 typedef */
13587 /* Consume the token. */
13589 /* A constructor declarator cannot appear in a typedef. */
13591 /* The "typedef" keyword can only occur in a declaration; we
13592 may as well commit at this point. */
13599 /* storage-class-specifier:
13600 auto
13601 register
13602 static
13603 extern
13604 mutable
13606 GNU Extension:
13607 thread */
13610 {
13611 /* Consume the token. */
13614 /* Complain about `auto' as a storage specifier, if
13615 we're complaining about C++0x compatibility. */
13619 "%<auto%> changes meaning in C++11; "
13622 /* Set the storage class anyway. */
13624 token);
13625 }
13626 else
13627 /* C++0x auto type-specifier. */
13635 /* Consume the token. */
13638 token);
13641 /* Consume the token. */
13647 /* We did not yet find a decl-specifier yet. */
13650 }
13667 /* Constructors are a special case. The `S' in `S()' is not a
13668 decl-specifier; it is the beginning of the declarator. */
13669 constructor_p
13670 = (!found_decl_spec
13671 && constructor_possible_p
13672 && (cp_parser_constructor_declarator_p
13675 /* If we don't have a DECL_SPEC yet, then we must be looking at
13676 a type-specifier. */
13678 {
13681 tree type_spec;
13683 type_spec
13685 decl_specs,
13691 /* If this type-specifier referenced a user-defined type
13692 (a typedef, class-name, etc.), then we can't allow any
13693 more such type-specifiers henceforth.
13695 [dcl.spec]
13697 The longest sequence of decl-specifiers that could
13698 possibly be a type name is taken as the
13699 decl-specifier-seq of a declaration. The sequence shall
13700 be self-consistent as described below.
13702 [dcl.type]
13704 As a general rule, at most one type-specifier is allowed
13705 in the complete decl-specifier-seq of a declaration. The
13706 only exceptions are the following:
13708 -- const or volatile can be combined with any other
13709 type-specifier.
13711 -- signed or unsigned can be combined with char, long,
13712 short, or int.
13714 -- ..
13716 Example:
13718 typedef char* Pc;
13719 void g (const int Pc);
13721 Here, Pc is *not* part of the decl-specifier seq; it's
13722 the declarator. Therefore, once we see a type-specifier
13723 (other than a cv-qualifier), we forbid any additional
13724 user-defined types. We *do* still allow things like `int
13725 int' to be considered a decl-specifier-seq, and issue the
13726 error message later. */
13729 /* A constructor declarator cannot follow a type-specifier. */
13731 {
13736 }
13737 }
13739 /* If we still do not have a DECL_SPEC, then there are no more
13740 decl-specifiers. */
13745 /* After we see one decl-specifier, further decl-specifiers are
13746 always optional. */
13748 }
13750 /* Don't allow a friend specifier with a class definition. */
13755 }
13757 /* Parse an (optional) storage-class-specifier.
13759 storage-class-specifier:
13760 auto
13761 register
13762 static
13763 extern
13764 mutable
13766 GNU Extension:
13768 storage-class-specifier:
13769 thread
13771 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13773 static tree
13775 {
13777 {
13781 /* Fall through for C++98. */
13789 /* Consume the token. */
13794 }
13795 }
13797 /* Parse an (optional) function-specifier.
13799 function-specifier:
13800 inline
13801 virtual
13802 explicit
13804 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13805 Updates DECL_SPECS, if it is non-NULL. */
13807 static tree
13810 {
13813 {
13819 /* 14.5.2.3 [temp.mem]
13821 A member function template shall not be virtual. */
13825 else
13835 }
13837 /* Consume the token. */
13839 }
13841 /* Parse a linkage-specification.
13843 linkage-specification:
13844 extern string-literal { declaration-seq [opt] }
13845 extern string-literal declaration */
13847 static void
13849 {
13850 tree linkage;
13852 /* Look for the `extern' keyword. */
13853 cp_token *extern_token
13856 /* Look for the string-literal. */
13860 /* Transform the literal into an identifier. If the literal is a
13861 wide-character string, or contains embedded NULs, then we can't
13862 handle it as the user wants. */
13865 {
13867 /* Assume C++ linkage. */
13869 }
13870 else
13873 /* We're now using the new linkage. */
13876 /* Preserve the location of the the innermost linkage specification,
13877 tracking the locations of nested specifications via a local. */
13878 location_t saved_location
13880 /* Construct a location ranging from the start of the "extern" to
13881 the end of the string-literal, with the caret at the start, e.g.:
13882 extern "C" {
13883 ^~~~~~~~~~
13884 */
13885 parser->innermost_linkage_specification_location
13890 /* If the next token is a `{', then we're using the first
13891 production. */
13893 {
13897 /* Consume the `{' token. */
13898 matching_braces braces;
13900 /* Parse the declarations. */
13902 /* Look for the closing `}'. */
13904 }
13905 /* Otherwise, there's just one declaration. */
13906 else
13907 {
13910 saved_in_unbraced_linkage_specification_p
13914 parser->in_unbraced_linkage_specification_p
13916 }
13918 /* We're done with the linkage-specification. */
13921 /* Restore location of parent linkage specification, if any. */
13923 }
13925 /* Parse a static_assert-declaration.
13927 static_assert-declaration:
13928 static_assert ( constant-expression , string-literal ) ;
13929 static_assert ( constant-expression ) ; (C++17)
13931 If MEMBER_P, this static_assert is a class member. */
13933 static void
13935 {
13936 tree condition;
13937 tree message;
13939 location_t saved_loc;
13942 /* Peek at the `static_assert' token so we can keep track of exactly
13943 where the static assertion started. */
13947 /* Look for the `static_assert' keyword. */
13949 RT_STATIC_ASSERT))
13952 /* We know we are in a static assertion; commit to any tentative
13953 parse. */
13957 /* Parse the `(' starting the static assertion condition. */
13958 matching_parens parens;
13961 /* Parse the constant-expression. Allow a non-constant expression
13962 here in order to give better diagnostics in finish_static_assert. */
13963 condition =
13969 {
13972 "static_assert without a message "
13974 /* Eat the ')' */
13979 }
13980 else
13981 {
13982 /* Parse the separating `,'. */
13985 /* Parse the string-literal message. */
13990 /* A `)' completes the static assertion. */
13996 }
13998 /* A semicolon terminates the declaration. */
14001 /* Complete the static assertion, which may mean either processing
14002 the static assert now or saving it for template instantiation. */
14004 }
14006 /* Parse the expression in decltype ( expression ). */
14008 static tree
14011 {
14013 tree expr;
14015 /* Since we're going to preserve any side-effects from this parse, set up a
14016 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14017 in the expression. */
14020 /* First, try parsing an id-expression. */
14031 {
14034 cp_id_kind idk;
14038 /* Lookup the name we got back from the id-expression. */
14048 {
14049 /* Complete lookup of the id-expression. */
14050 expr = (finish_id_expression
14063 /* We found an id-expression, but it was something that we
14064 should not have found. This is an error, not something
14065 we can recover from, so note that we found an
14066 id-expression and we'll recover as gracefully as
14067 possible. */
14069 }
14074 /* We have an id-expression. */
14076 }
14079 {
14080 /* Abort the id-expression parse. */
14083 /* Parsing tentatively, again. */
14086 /* Parse a class member access. */
14094 /* We have an id-expression. */
14096 }
14099 /* We have parsed the complete id-expression or member access. */
14101 else
14102 {
14103 /* Abort our attempt to parse an id-expression or member access
14104 expression. */
14107 /* Parse a full expression. */
14110 }
14113 }
14115 /* Parse a `decltype' type. Returns the type.
14117 simple-type-specifier:
14118 decltype ( expression )
14119 C++14 proposal:
14120 decltype ( auto ) */
14122 static tree
14124 {
14125 tree expr;
14134 {
14135 /* Already parsed. */
14138 }
14140 /* Look for the `decltype' token. */
14144 /* Parse the opening `('. */
14145 matching_parens parens;
14149 /* decltype (auto) */
14152 {
14159 }
14161 /* Types cannot be defined in a `decltype' expression. Save away the
14162 old message. */
14165 /* And create the new one. */
14166 parser->type_definition_forbidden_message
14169 /* The restrictions on constant-expressions do not apply inside
14170 decltype expressions. */
14171 saved_integral_constant_expression_p
14173 saved_non_integral_constant_expression_p
14177 /* Within a parenthesized expression, a `>' token is always
14178 the greater-than operator. */
14179 saved_greater_than_is_operator_p
14183 /* Do not actually evaluate the expression. */
14186 /* Do not warn about problems with the expression. */
14191 /* Go back to evaluating expressions. */
14195 /* The `>' token might be the end of a template-id or
14196 template-parameter-list now. */
14197 parser->greater_than_is_operator_p
14200 /* Restore the old message and the integral constant expression
14201 flags. */
14203 parser->integral_constant_expression_p
14205 parser->non_integral_constant_expression_p
14208 /* Parse to the closing `)'. */
14210 {
14214 }
14217 tf_warning_or_error);
14219 rewrite:
14220 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14221 it again. */
14230 }
14232 /* Special member functions [gram.special] */
14234 /* Parse a conversion-function-id.
14236 conversion-function-id:
14237 operator conversion-type-id
14239 Returns an IDENTIFIER_NODE representing the operator. */
14241 static tree
14243 {
14244 tree type;
14245 tree saved_scope;
14246 tree saved_qualifying_scope;
14247 tree saved_object_scope;
14250 /* Look for the `operator' token. */
14253 /* When we parse the conversion-type-id, the current scope will be
14254 reset. However, we need that information in able to look up the
14255 conversion function later, so we save it here. */
14259 /* We must enter the scope of the class so that the names of
14260 entities declared within the class are available in the
14261 conversion-type-id. For example, consider:
14263 struct S {
14264 typedef int I;
14265 operator I();
14266 };
14268 S::operator I() { ... }
14270 In order to see that `I' is a type-name in the definition, we
14271 must be in the scope of `S'. */
14274 /* Parse the conversion-type-id. */
14276 /* Leave the scope of the class, if any. */
14279 /* Restore the saved scope. */
14283 /* If the TYPE is invalid, indicate failure. */
14287 }
14289 /* Parse a conversion-type-id:
14291 conversion-type-id:
14292 type-specifier-seq conversion-declarator [opt]
14294 Returns the TYPE specified. */
14296 static tree
14298 {
14299 tree attributes;
14300 cp_decl_specifier_seq type_specifiers;
14302 tree type_specified;
14305 /* Parse the attributes. */
14309 parser->type_definition_forbidden_message
14312 /* Parse the type-specifiers. */
14319 /* If that didn't work, stop. */
14322 /* Parse the conversion-declarator. */
14330 /* Don't give this error when parsing tentatively. This happens to
14331 work because we always parse this definitively once. */
14334 {
14336 {
14339 }
14343 }
14346 }
14348 /* Parse an (optional) conversion-declarator.
14350 conversion-declarator:
14351 ptr-operator conversion-declarator [opt]
14353 */
14357 {
14360 cp_cv_quals cv_quals;
14362 /* We don't know if there's a ptr-operator next, or not. */
14364 /* Try the ptr-operator. */
14367 /* If it worked, look for more conversion-declarators. */
14369 {
14372 /* Parse another optional declarator. */
14375 declarator = cp_parser_make_indirect_declarator
14379 }
14382 }
14384 /* Parse an (optional) ctor-initializer.
14386 ctor-initializer:
14387 : mem-initializer-list */
14389 static void
14391 {
14392 /* If the next token is not a `:', then there is no
14393 ctor-initializer. */
14395 {
14396 /* Do default initialization of any bases and members. */
14400 }
14402 /* Consume the `:' token. */
14404 /* And the mem-initializer-list. */
14406 }
14408 /* Parse a mem-initializer-list.
14410 mem-initializer-list:
14411 mem-initializer ... [opt]
14412 mem-initializer ... [opt] , mem-initializer-list */
14414 static void
14416 {
14421 /* Let the semantic analysis code know that we are starting the
14422 mem-initializer-list. */
14427 /* Loop through the list. */
14429 {
14430 tree mem_initializer;
14433 /* Parse the mem-initializer. */
14435 /* If the next token is a `...', we're expanding member initializers. */
14437 {
14438 /* Consume the `...'. */
14441 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14442 can be expanded but members cannot. */
14445 {
14450 }
14452 /* Construct the pack expansion type. */
14455 }
14458 {
14462 }
14463 /* Look for a target constructor. */
14467 {
14470 {
14474 }
14476 }
14477 /* Add it to the list, unless it was erroneous. */
14479 {
14482 }
14483 /* If the next token is not a `,', we're done. */
14486 /* Consume the `,' token. */
14488 }
14490 /* Perform semantic analysis. */
14493 }
14495 /* Parse a mem-initializer.
14497 mem-initializer:
14498 mem-initializer-id ( expression-list [opt] )
14499 mem-initializer-id braced-init-list
14501 GNU extension:
14503 mem-initializer:
14504 ( expression-list [opt] )
14506 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14507 class) or FIELD_DECL (for a non-static data member) to initialize;
14508 the TREE_VALUE is the expression-list. An empty initialization
14509 list is represented by void_list_node. */
14511 static tree
14513 {
14514 tree mem_initializer_id;
14515 tree expression_list;
14516 tree member;
14519 /* Find out what is being initialized. */
14521 {
14525 }
14526 else
14527 {
14531 }
14537 {
14544 }
14545 else
14546 {
14556 }
14566 }
14568 /* Parse a mem-initializer-id.
14570 mem-initializer-id:
14571 :: [opt] nested-name-specifier [opt] class-name
14572 decltype-specifier (C++11)
14573 identifier
14575 Returns a TYPE indicating the class to be initialized for the first
14576 production (and the second in C++11). Returns an IDENTIFIER_NODE
14577 indicating the data member to be initialized for the last production. */
14579 static tree
14581 {
14585 tree id;
14589 /* `typename' is not allowed in this context ([temp.res]). */
14591 {
14593 "keyword %<typename%> not allowed in this context (a qualified "
14596 }
14597 /* Look for the optional `::' operator. */
14598 global_scope_p
14602 /* Look for the optional nested-name-specifier. The simplest way to
14603 implement:
14605 [temp.res]
14607 The keyword `typename' is not permitted in a base-specifier or
14608 mem-initializer; in these contexts a qualified name that
14609 depends on a template-parameter is implicitly assumed to be a
14610 type name.
14612 is to assume that we have seen the `typename' keyword at this
14613 point. */
14614 nested_name_specifier_p
14623 /* If there is a `::' operator or a nested-name-specifier, then we
14624 are definitely looking for a class-name. */
14629 typename_type,
14633 /* Otherwise, we could also be looking for an ordinary identifier. */
14636 /* Try a decltype-specifier. */
14638 else
14639 /* Otherwise, try a class-name. */
14643 none_type,
14647 /* If we found one, we're done. */
14650 /* Otherwise, look for an ordinary identifier. */
14652 }
14654 /* Overloading [gram.over] */
14656 /* Parse an operator-function-id.
14658 operator-function-id:
14659 operator operator
14661 Returns an IDENTIFIER_NODE for the operator which is a
14662 human-readable spelling of the identifier, e.g., `operator +'. */
14664 static cp_expr
14666 {
14667 /* Look for the `operator' keyword. */
14670 /* And then the name of the operator itself. */
14672 }
14674 /* Return an identifier node for a user-defined literal operator.
14675 The suffix identifier is chained to the operator name identifier. */
14677 tree
14679 {
14680 tree identifier;
14687 }
14689 /* Parse an operator.
14691 operator:
14692 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14693 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14694 || ++ -- , ->* -> () []
14696 GNU Extensions:
14698 operator:
14699 <? >? <?= >?=
14701 Returns an IDENTIFIER_NODE for the operator which is a
14702 human-readable spelling of the identifier, e.g., `operator +'. */
14704 static cp_expr
14706 {
14711 /* Peek at the next token. */
14716 /* Figure out which operator we have. */
14721 {
14723 {
14724 /* The keyword should be either `new' or `delete'. */
14729 else
14732 /* Consume the `new' or `delete' token. */
14735 /* Peek at the next token. */
14737 /* If it's a `[' token then this is the array variant of the
14738 operator. */
14740 {
14741 /* Consume the `[' token. */
14743 /* Look for the `]' token. */
14748 }
14752 }
14910 {
14911 /* Consume the `('. */
14912 matching_parens parens;
14914 /* Look for the matching `)'. */
14919 }
14922 /* Consume the `['. */
14924 /* Look for the matching `]'. */
14933 /* FALLTHRU */
14942 {
14949 /* Consume the string. */
14955 {
14958 }
14959 else
14960 {
14962 /* Look for the suffix identifier. */
14967 {
14971 }
14972 else
14973 {
14976 }
14977 }
14982 {
14985 }
14988 {
14991 }
14993 {
14996 }
14998 }
15001 /* Anything else is an error. */
15003 }
15005 /* If we have selected an identifier, we need to consume the
15006 operator token. */
15008 {
15012 }
15013 /* Otherwise, no valid operator name was present. */
15014 else
15015 {
15018 }
15021 }
15023 /* Parse a template-declaration.
15025 template-declaration:
15026 export [opt] template < template-parameter-list > declaration
15028 If MEMBER_P is TRUE, this template-declaration occurs within a
15029 class-specifier.
15031 The grammar rule given by the standard isn't correct. What
15032 is really meant is:
15034 template-declaration:
15035 export [opt] template-parameter-list-seq
15036 decl-specifier-seq [opt] init-declarator [opt] ;
15037 export [opt] template-parameter-list-seq
15038 function-definition
15040 template-parameter-list-seq:
15041 template-parameter-list-seq [opt]
15042 template < template-parameter-list >
15044 Concept Extensions:
15046 template-parameter-list-seq:
15047 template < template-parameter-list > requires-clause [opt]
15049 requires-clause:
15050 requires logical-or-expression */
15052 static void
15054 {
15055 /* Check for `export'. */
15057 {
15058 /* Consume the `export' token. */
15060 /* Warn that we do not support `export'. */
15062 }
15065 }
15067 /* Parse a template-parameter-list.
15069 template-parameter-list:
15070 template-parameter
15071 template-parameter-list , template-parameter
15073 Returns a TREE_LIST. Each node represents a template parameter.
15074 The nodes are connected via their TREE_CHAINs. */
15076 static tree
15078 {
15083 /* The loop below parses the template parms. We first need to know
15084 the total number of template parms to be able to compute proper
15085 canonical types of each dependent type. So after the loop, when
15086 we know the total number of template parms,
15087 end_template_parm_list computes the proper canonical types and
15088 fixes up the dependent types accordingly. */
15090 {
15091 tree parameter;
15094 location_t parm_loc;
15096 /* Parse the template-parameter. */
15101 /* Add it to the list. */
15104 parm_loc,
15105 parameter,
15106 is_non_type,
15107 is_parameter_pack);
15108 else
15109 {
15112 }
15114 /* If the next token is not a `,', we're done. */
15117 /* Otherwise, consume the `,' token. */
15119 }
15122 }
15124 /* Parse a introduction-list.
15126 introduction-list:
15127 introduced-parameter
15128 introduction-list , introduced-parameter
15130 introduced-parameter:
15131 ...[opt] identifier
15133 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15134 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15135 WILDCARD_DECL will also have DECL_NAME set and token location in
15136 DECL_SOURCE_LOCATION. */
15138 static tree
15140 {
15144 {
15149 /* Build placeholder. */
15157 /* If the next token is not a `,', we're done. */
15160 /* Otherwise, consume the `,' token. */
15162 }
15164 /* Convert the vec into a TREE_VEC. */
15167 tree parm;
15173 }
15175 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15176 is an abstract declarator. */
15180 {
15185 }
15187 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15188 is an abstract declarator. */
15192 {
15196 else
15198 }
15200 /* Returns true if DECL represents a constrained-parameter. */
15204 {
15209 }
15211 /* Returns true if PARM declares a constrained-parameter. */
15215 {
15217 }
15219 /* Check that the type parameter is only a declarator-id, and that its
15220 type is not cv-qualified. */
15222 bool
15225 {
15230 {
15233 }
15235 /* Don't allow cv-qualified type parameters. */
15238 {
15241 }
15244 }
15246 /* Finish parsing/processing a template type parameter and checking
15247 various restrictions. */
15251 tree id,
15253 {
15256 else
15258 }
15260 static tree
15262 {
15263 /* FIXME: This should probably be copied, and we may need to adjust
15264 the template parameter depths. */
15274 }
15276 /* Finish parsing/processing a template template parameter by borrowing
15277 the template parameter list from the prototype parameter. */
15279 static tree
15281 tree proto,
15282 tree id,
15284 {
15288 }
15290 /* Create a new non-type template parameter from the given PARM
15291 declarator. */
15293 static tree
15296 {
15302 }
15304 /* Build a constrained template parameter based on the PARMDECL
15305 declarator. The type of PARMDECL is the constrained type, which
15306 refers to the prototype template parameter that ultimately
15307 specifies the type of the declared parameter. */
15309 static tree
15314 {
15320 /* A template parameter constrained by a variadic concept shall also
15321 be declared as a template parameter pack. */
15326 /* Build the parameter. Return an error if the declarator was invalid. */
15327 tree parm;
15332 parmdecl);
15333 else
15338 /* Finish the parameter decl and create a node attaching the
15339 default argument and constraint. */
15344 }
15346 /* Returns true if the parsed type actually represents the declaration
15347 of a type template-parameter. */
15351 {
15354 }
15357 /* Returns true if the parsed type actually represents the declaration of
15358 a template template-parameter. */
15360 static bool
15362 {
15365 }
15367 /* Parse a default argument for a type template-parameter.
15368 Note that diagnostics are handled in cp_parser_template_parameter. */
15370 static tree
15372 {
15375 /* Consume the `=' token. */
15380 /* Parse the default-argument. */
15386 {
15390 }
15393 }
15395 /* Parse a default argument for a template template-parameter. */
15397 static tree
15399 {
15404 /* Consume the `='. */
15406 /* Parse the id-expression. */
15408 /* save token before parsing the id-expression, for error
15409 reporting */
15411 tree default_argument
15419 /* If the id-expression was a template-id that refers to
15420 a template-class, we already have the declaration here,
15421 so no further lookup is needed. */
15422 ;
15423 else
15424 /* Look up the name. */
15425 default_argument
15427 none_type,
15433 /* See if the default argument is valid. */
15437 }
15439 /* Parse a template-parameter.
15441 template-parameter:
15442 type-parameter
15443 parameter-declaration
15445 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15446 the parameter. The TREE_PURPOSE is the default value, if any.
15447 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15448 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15449 set to true iff this parameter is a parameter pack. */
15451 static tree
15454 {
15457 tree parm;
15459 /* Assume it is a type parameter or a template parameter. */
15461 /* Assume it not a parameter pack. */
15463 /* Peek at the next token. */
15465 /* If it is `template', we have a type-parameter. */
15468 /* If it is `class' or `typename' we do not know yet whether it is a
15469 type parameter or a non-type parameter. Consider:
15471 template <typename T, typename T::X X> ...
15473 or:
15475 template <class C, class D*> ...
15477 Here, the first parameter is a type parameter, and the second is
15478 a non-type parameter. We can tell by looking at the token after
15479 the identifier -- if it is a `,', `=', or `>' then we have a type
15480 parameter. */
15482 {
15483 /* Peek at the token after `class' or `typename'. */
15485 /* If it's an ellipsis, we have a template type parameter
15486 pack. */
15489 /* If it's an identifier, skip it. */
15492 /* Now, see if the token looks like the end of a template
15493 parameter. */
15498 }
15500 /* Otherwise, it is a non-type parameter or a constrained parameter.
15502 [temp.param]
15504 When parsing a default template-argument for a non-type
15505 template-parameter, the first non-nested `>' is taken as the end
15506 of the template parameter-list rather than a greater-than
15507 operator. */
15508 parameter_declarator
15515 /* If the parameter declaration is marked as a parameter pack, set
15516 *IS_PARAMETER_PACK to notify the caller. */
15521 {
15522 /* Can happen in some cases of erroneous input (c++/34892). */
15524 /* Consume the `...' for better error recovery. */
15526 }
15528 // The parameter may have been constrained.
15531 parameter_declarator,
15532 is_non_type,
15533 is_parameter_pack);
15535 // Now we're sure that the parameter is a non-type parameter.
15546 }
15548 /* Parse a type-parameter.
15550 type-parameter:
15551 class identifier [opt]
15552 class identifier [opt] = type-id
15553 typename identifier [opt]
15554 typename identifier [opt] = type-id
15555 template < template-parameter-list > class identifier [opt]
15556 template < template-parameter-list > class identifier [opt]
15557 = id-expression
15559 GNU Extension (variadic templates):
15561 type-parameter:
15562 class ... identifier [opt]
15563 typename ... identifier [opt]
15565 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15566 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15567 the declaration of the parameter.
15569 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15571 static tree
15573 {
15575 tree parameter;
15577 /* Look for a keyword to tell us what kind of parameter this is. */
15583 {
15586 {
15587 tree identifier;
15588 tree default_argument;
15590 /* If the next token is an ellipsis, we have a template
15591 argument pack. */
15593 {
15594 /* Consume the `...' token. */
15599 }
15601 /* If the next token is an identifier, then it names the
15602 parameter. */
15605 else
15608 /* Create the parameter. */
15611 /* If the next token is an `=', we have a default argument. */
15613 {
15614 default_argument
15617 /* Template parameter packs cannot have default
15618 arguments. */
15620 {
15623 "template parameter pack %qD cannot have a "
15625 else
15627 "template parameter packs cannot have "
15630 }
15633 }
15634 else
15637 /* Create the combined representation of the parameter and the
15638 default argument. */
15640 }
15644 {
15645 tree identifier;
15646 tree default_argument;
15648 /* Look for the `<'. */
15650 /* Parse the template-parameter-list. */
15652 /* Look for the `>'. */
15655 // If template requirements are present, parse them.
15657 {
15662 }
15664 /* Look for the `class' or 'typename' keywords. */
15666 /* If the next token is an ellipsis, we have a template
15667 argument pack. */
15669 {
15670 /* Consume the `...' token. */
15675 }
15676 /* If the next token is an `=', then there is a
15677 default-argument. If the next token is a `>', we are at
15678 the end of the parameter-list. If the next token is a `,',
15679 then we are at the end of this parameter. */
15683 {
15685 /* Treat invalid names as if the parameter were nameless. */
15688 }
15689 else
15692 /* Create the template parameter. */
15694 identifier);
15696 /* If the next token is an `=', then there is a
15697 default-argument. */
15699 {
15700 default_argument
15703 /* Template parameter packs cannot have default
15704 arguments. */
15706 {
15709 "template parameter pack %qD cannot "
15711 identifier);
15712 else
15716 }
15717 }
15718 else
15721 /* Create the combined representation of the parameter and the
15722 default argument. */
15724 }
15730 }
15733 }
15735 /* Parse a template-id.
15737 template-id:
15738 template-name < template-argument-list [opt] >
15740 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15741 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15742 returned. Otherwise, if the template-name names a function, or set
15743 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15744 names a class, returns a TYPE_DECL for the specialization.
15746 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15747 uninstantiated templates. */
15749 static tree
15755 {
15756 tree templ;
15757 tree arguments;
15758 tree template_id;
15763 /* If the next token corresponds to a template-id, there is no need
15764 to reparse it. */
15767 {
15770 }
15772 /* Avoid performing name lookup if there is no possibility of
15773 finding a template-id. */
15776 && !cp_parser_nth_token_starts_template_argument_list_p
15778 {
15781 }
15783 /* Remember where the template-id starts. */
15789 /* Parse the template-name. */
15792 check_dependency_p,
15793 is_declaration,
15794 tag_type,
15797 {
15800 }
15802 /* Since we're going to preserve any side-effects from this parse, set up a
15803 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15804 in the template arguments. */
15807 /* If we find the sequence `[:' after a template-name, it's probably
15808 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15809 parse correctly the argument list. */
15816 {
15818 /* Change `:' into `::'. */
15820 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15821 CPP_LESS. */
15824 /* Parse the arguments. */
15827 {
15828 /* If we couldn't parse an argument list, then we revert our changes
15829 and return simply an error. Maybe this is not a template-id
15830 after all. */
15835 }
15836 /* Otherwise, emit an error about the invalid digraph, but continue
15837 parsing because we got our argument list. */
15840 {
15843 "%<<:%> is an alternate spelling for %<[%>."
15846 {
15848 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15851 }
15852 }
15853 }
15854 else
15855 {
15856 /* Look for the `<' that starts the template-argument-list. */
15858 {
15861 }
15862 /* Parse the arguments. */
15864 }
15866 /* Set the location to be of the form:
15867 template-name < template-argument-list [opt] >
15868 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15869 with caret == start at the start of the template-name,
15870 ranging until the closing '>'. */
15871 location_t finish_loc
15873 location_t combined_loc
15876 /* Build a representation of the specialization. */
15879 TEMPLATE_ID_EXPR,
15883 {
15885 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15886 template (rather than some instantiation thereof) only if
15887 is not nested within some other construct. For example, in
15888 "template <typename T> void f(T) { A<T>::", A<T> is just an
15889 instantiation of A. */
15892 CPP_SCOPE));
15893 template_id
15895 }
15896 /* A template-like identifier may be a partial concept id. */
15902 {
15906 }
15907 else
15908 {
15909 /* If it's not a class-template or a template-template, it should be
15910 a function-template. */
15918 }
15920 /* If parsing tentatively, replace the sequence of tokens that makes
15921 up the template-id with a CPP_TEMPLATE_ID token. That way,
15922 should we re-parse the token stream, we will not have to repeat
15923 the effort required to do the parse, nor will we issue duplicate
15924 error messages about problems during instantiation of the
15925 template. */
15927 /* Don't do this if we had a parse error in a declarator; re-parsing
15928 might succeed if a name changes meaning (60361). */
15932 {
15933 /* Reset the contents of the START_OF_ID token. */
15937 /* We must mark the lookup as kept, so we don't throw it away on
15938 the first parse. */
15942 /* Retrieve any deferred checks. Do not pop this access checks yet
15943 so the memory will not be reclaimed during token replacing below. */
15949 /* Purge all subsequent tokens. */
15952 /* ??? Can we actually assume that, if template_id ==
15953 error_mark_node, we will have issued a diagnostic to the
15954 user, as opposed to simply marking the tentative parse as
15955 failed? */
15958 }
15962 }
15964 /* Parse a template-name.
15966 template-name:
15967 identifier
15969 The standard should actually say:
15971 template-name:
15972 identifier
15973 operator-function-id
15975 A defect report has been filed about this issue.
15977 A conversion-function-id cannot be a template name because they cannot
15978 be part of a template-id. In fact, looking at this code:
15980 a.operator K<int>()
15982 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15983 It is impossible to call a templated conversion-function-id with an
15984 explicit argument list, since the only allowed template parameter is
15985 the type to which it is converting.
15987 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15988 `template' keyword, in a construction like:
15990 T::template f<3>()
15992 In that case `f' is taken to be a template-name, even though there
15993 is no way of knowing for sure.
15995 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15996 name refers to a set of overloaded functions, at least one of which
15997 is a template, or an IDENTIFIER_NODE with the name of the template,
15998 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15999 names are looked up inside uninstantiated templates. */
16001 static tree
16008 {
16009 tree identifier;
16010 tree decl;
16013 /* If the next token is `operator', then we have either an
16014 operator-function-id or a conversion-function-id. */
16016 {
16017 /* We don't know whether we're looking at an
16018 operator-function-id or a conversion-function-id. */
16020 /* Try an operator-function-id. */
16022 /* If that didn't work, try a conversion-function-id. */
16024 {
16027 }
16028 }
16029 /* Look for the identifier. */
16030 else
16033 /* If we didn't find an identifier, we don't have a template-id. */
16037 /* If the name immediately followed the `template' keyword, then it
16038 is a template-name. However, if the next token is not `<', then
16039 we do not treat it as a template-name, since it is not being used
16040 as part of a template-id. This enables us to handle constructs
16041 like:
16043 template <typename T> struct S { S(); };
16044 template <typename T> S<T>::S();
16046 correctly. We would treat `S' as a template -- if it were `S<T>'
16047 -- but we do not if there is no `<'. */
16051 {
16052 /* In a declaration, in a dependent context, we pretend that the
16053 "template" keyword was present in order to improve error
16054 recovery. For example, given:
16056 template <typename T> void f(T::X<int>);
16058 we want to treat "X<int>" as a template-id. */
16060 && !template_keyword_p
16062 && check_dependency_p
16064 /* Do not do this for dtors (or ctors), since they never
16065 need the template keyword before their name. */
16067 {
16070 /* Explain what went wrong. */
16072 identifier);
16075 /* If parsing tentatively, find the location of the "<" token. */
16078 /* Parse the template arguments so that we can issue error
16079 messages about them. */
16082 /* Skip tokens until we find a good place from which to
16083 continue parsing. */
16088 /* If parsing tentatively, permanently remove the
16089 template argument list. That will prevent duplicate
16090 error messages from being issued about the missing
16091 "template" keyword. */
16098 }
16100 /* If the "template" keyword is present, then there is generally
16101 no point in doing name-lookup, so we just return IDENTIFIER.
16102 But, if the qualifying scope is non-dependent then we can
16103 (and must) do name-lookup normally. */
16105 {
16111 {
16112 /* We're optimizing away the call to cp_parser_lookup_name, but
16113 we still need to do this. */
16116 }
16117 }
16118 }
16120 /* Look up the name. */
16122 tag_type,
16125 check_dependency_p,
16131 /* If DECL is a template, then the name was a template-name. */
16133 {
16137 }
16138 else
16139 {
16140 /* The standard does not explicitly indicate whether a name that
16141 names a set of overloaded declarations, some of which are
16142 templates, is a template-name. However, such a name should
16143 be a template-name; otherwise, there is no way to form a
16144 template-id for the overloaded templates. */
16153 {
16154 /* The name does not name a template. */
16157 }
16158 }
16160 /* If DECL is dependent, and refers to a function, then just return
16161 its name; we will look it up again during template instantiation. */
16163 {
16167 }
16170 }
16172 /* Parse a template-argument-list.
16174 template-argument-list:
16175 template-argument ... [opt]
16176 template-argument-list , template-argument ... [opt]
16178 Returns a TREE_VEC containing the arguments. */
16180 static tree
16182 {
16187 tree vec;
16194 /* Even if the template-id appears in an integral
16195 constant-expression, the contents of the argument list do
16196 not. */
16202 /* Parse the arguments. */
16203 do
16204 {
16205 tree argument;
16208 /* Consume the comma. */
16211 /* Parse the template-argument. */
16214 /* If the next token is an ellipsis, we're expanding a template
16215 argument pack. */
16217 {
16219 {
16223 }
16224 /* Consume the `...' token. */
16227 /* Make the argument into a TYPE_PACK_EXPANSION or
16228 EXPR_PACK_EXPANSION. */
16230 }
16233 {
16237 {
16240 }
16241 else
16243 }
16245 }
16261 }
16263 /* Parse a template-argument.
16265 template-argument:
16266 assignment-expression
16267 type-id
16268 id-expression
16270 The representation is that of an assignment-expression, type-id, or
16271 id-expression -- except that the qualified id-expression is
16272 evaluated, so that the value returned is either a DECL or an
16273 OVERLOAD.
16275 Although the standard says "assignment-expression", it forbids
16276 throw-expressions or assignments in the template argument.
16277 Therefore, we use "conditional-expression" instead. */
16279 static tree
16281 {
16282 tree argument;
16288 cp_id_kind idk;
16290 /* There's really no way to know what we're looking at, so we just
16291 try each alternative in order.
16293 [temp.arg]
16295 In a template-argument, an ambiguity between a type-id and an
16296 expression is resolved to a type-id, regardless of the form of
16297 the corresponding template-parameter.
16299 Therefore, we try a type-id first. */
16302 /* If there was no error parsing the type-id but the next token is a
16303 '>>', our behavior depends on which dialect of C++ we're
16304 parsing. In C++98, we probably found a typo for '> >'. But there
16305 are type-id which are also valid expressions. For instance:
16307 struct X { int operator >> (int); };
16308 template <int V> struct Foo {};
16309 Foo<X () >> 5> r;
16311 Here 'X()' is a valid type-id of a function type, but the user just
16312 wanted to write the expression "X() >> 5". Thus, we remember that we
16313 found a valid type-id, but we still try to parse the argument as an
16314 expression to see what happens.
16316 In C++0x, the '>>' will be considered two separate '>'
16317 tokens. */
16321 {
16324 }
16325 else
16326 {
16327 /* If the next token isn't a `,' or a `>', then this argument wasn't
16328 really finished. This means that the argument is not a valid
16329 type-id. */
16332 /* If that worked, we're done. */
16335 }
16336 /* We're still not sure what the argument will be. */
16338 /* Try a template. */
16346 /* If the next token isn't a `,' or a `>', then this argument wasn't
16347 really finished. */
16351 {
16352 /* Figure out what is being referred to. If the id-expression
16353 was for a class template specialization, then we will have a
16354 TYPE_DECL at this point. There is no need to do name lookup
16355 at this point in that case. */
16358 none_type,
16364 /* Handle a constrained-type-specifier for a non-type template
16365 parameter. */
16371 }
16373 {
16377 }
16378 /* It must be a non-type argument. In C++17 any constant-expression is
16379 allowed. */
16383 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16385 -- an integral constant-expression of integral or enumeration
16386 type; or
16388 -- the name of a non-type template-parameter; or
16390 -- the name of an object or function with external linkage...
16392 -- the address of an object or function with external linkage...
16394 -- a pointer to member... */
16395 /* Look for a non-type template parameter. */
16397 {
16409 }
16411 /* If the next token is "&", the argument must be the address of an
16412 object or function with external linkage. */
16415 {
16418 }
16419 /* See if we might have an id-expression. */
16426 {
16429 address_p,
16436 else
16437 {
16438 tree probe;
16441 {
16442 /* Strip the dereference temporarily. */
16445 }
16447 /* If we're in a template, we represent a qualified-id referring
16448 to a static data member as a SCOPE_REF even if the scope isn't
16449 dependent so that we can check access control later. */
16454 {
16455 /* A variable without external linkage might still be a
16456 valid constant-expression, so no error is issued here
16457 if the external-linkage check fails. */
16460 }
16462 /* All overloaded functions are allowed; if the external
16463 linkage test does not pass, an error will be issued
16464 later. */
16465 ;
16469 /* A pointer-to-member. */
16470 ;
16472 ;
16473 else
16477 {
16480 tf_warning_or_error);
16481 else
16484 }
16485 }
16486 }
16487 /* If the argument started with "&", there are no other valid
16488 alternatives at this point. */
16490 {
16493 }
16495 general_expr:
16496 /* If the argument wasn't successfully parsed as a type-id followed
16497 by '>>', the argument can only be a constant expression now.
16498 Otherwise, we try parsing the constant-expression tentatively,
16499 because the argument could really be a type-id. */
16505 else
16506 {
16507 /* With C++17 generalized non-type template arguments we need to handle
16508 lvalue constant expressions, too. */
16511 }
16519 /* We did our best to parse the argument as a non type-id, but that
16520 was the only alternative that matched (albeit with a '>' after
16521 it). We can assume it's just a typo from the user, and a
16522 diagnostic will then be issued. */
16524 }
16526 /* Parse an explicit-instantiation.
16528 explicit-instantiation:
16529 template declaration
16531 Although the standard says `declaration', what it really means is:
16533 explicit-instantiation:
16534 template decl-specifier-seq [opt] declarator [opt] ;
16536 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16537 supposed to be allowed. A defect report has been filed about this
16538 issue.
16540 GNU Extension:
16542 explicit-instantiation:
16543 storage-class-specifier template
16544 decl-specifier-seq [opt] declarator [opt] ;
16545 function-specifier template
16546 decl-specifier-seq [opt] declarator [opt] ; */
16548 static void
16550 {
16552 cp_decl_specifier_seq decl_specifiers;
16557 /* Look for an (optional) storage-class-specifier or
16558 function-specifier. */
16560 {
16561 extension_specifier
16564 extension_specifier
16567 }
16569 /* Look for the `template' keyword. */
16571 /* Let the front end know that we are processing an explicit
16572 instantiation. */
16574 /* [temp.explicit] says that we are supposed to ignore access
16575 control while processing explicit instantiation directives. */
16577 /* Parse a decl-specifier-seq. */
16579 CP_PARSER_FLAGS_OPTIONAL,
16582 /* If there was exactly one decl-specifier, and it declared a class,
16583 and there's no declarator, then we have an explicit type
16584 instantiation. */
16586 {
16587 tree type;
16591 /* Turn access control back on for names used during
16592 template instantiation. */
16597 }
16598 else
16599 {
16601 tree decl;
16603 /* Parse the declarator. */
16604 declarator
16615 {
16618 "explicit instantiation shall not use"
16622 "explicit instantiation shall not use"
16627 /* Turn access control back on for names used during
16628 template instantiation. */
16630 /* Do the explicit instantiation. */
16632 }
16633 else
16634 {
16636 /* Skip the body of the explicit instantiation. */
16638 }
16639 }
16640 /* We're done with the instantiation. */
16646 }
16648 /* Parse an explicit-specialization.
16650 explicit-specialization:
16651 template < > declaration
16653 Although the standard says `declaration', what it really means is:
16655 explicit-specialization:
16656 template <> decl-specifier [opt] init-declarator [opt] ;
16657 template <> function-definition
16658 template <> explicit-specialization
16659 template <> template-declaration */
16661 static void
16663 {
16667 /* Look for the `template' keyword. */
16669 /* Look for the `<'. */
16671 /* Look for the `>'. */
16673 /* We have processed another parameter list. */
16675 /* [temp]
16677 A template ... explicit specialization ... shall not have C
16678 linkage. */
16680 {
16683 /* Give it C++ linkage to avoid confusing other parts of the
16684 front end. */
16687 }
16688 else
16690 /* Let the front end know that we are beginning a specialization. */
16692 {
16695 }
16697 /* If the next keyword is `template', we need to figure out whether
16698 or not we're looking a template-declaration. */
16700 {
16705 else
16707 }
16708 else
16709 /* Parse the dependent declaration. */
16715 /* We're done with the specialization. */
16717 /* For the erroneous case of a template with C linkage, we pushed an
16718 implicit C++ linkage scope; exit that scope now. */
16721 /* We're done with this parameter list. */
16723 }
16725 /* Parse a type-specifier.
16727 type-specifier:
16728 simple-type-specifier
16729 class-specifier
16730 enum-specifier
16731 elaborated-type-specifier
16732 cv-qualifier
16734 GNU Extension:
16736 type-specifier:
16737 __complex__
16739 Returns a representation of the type-specifier. For a
16740 class-specifier, enum-specifier, or elaborated-type-specifier, a
16741 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16743 The parser flags FLAGS is used to control type-specifier parsing.
16745 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16746 in a decl-specifier-seq.
16748 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16749 class-specifier, enum-specifier, or elaborated-type-specifier, then
16750 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16751 if a type is declared; 2 if it is defined. Otherwise, it is set to
16752 zero.
16754 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16755 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16756 is set to FALSE. */
16758 static tree
16760 cp_parser_flags flags,
16765 {
16771 /* Assume this type-specifier does not declare a new type. */
16774 /* And that it does not specify a cv-qualifier. */
16777 /* Peek at the next token. */
16780 /* If we're looking at a keyword, we can use that to guide the
16781 production we choose. */
16784 {
16789 /* Look for the enum-specifier. */
16791 /* If that worked, we're done. */
16793 {
16798 type_spec,
16799 token,
16802 }
16803 else
16806 /* Any of these indicate either a class-specifier, or an
16807 elaborated-type-specifier. */
16814 /* Parse tentatively so that we can back up if we don't find a
16815 class-specifier. */
16817 /* Look for the class-specifier. */
16820 /* If that worked, we're done. */
16822 {
16827 type_spec,
16828 token,
16831 }
16833 /* Fall through. */
16834 elaborated_type_specifier:
16835 /* We're declaring (not defining) a class or enum. */
16839 /* Fall through. */
16841 /* Look for an elaborated-type-specifier. */
16842 type_spec
16843 = (cp_parser_elaborated_type_specifier
16846 is_declaration));
16849 type_spec,
16850 token,
16873 /* The `__complex__' keyword is a GNU extension. */
16879 }
16881 /* Handle simple keywords. */
16883 {
16885 {
16888 }
16890 }
16892 /* If we do not already have a type-specifier, assume we are looking
16893 at a simple-type-specifier. */
16895 decl_specs,
16896 flags);
16898 /* If we didn't find a type-specifier, and a type-specifier was not
16899 optional in this context, issue an error message. */
16901 {
16904 }
16907 }
16909 /* Parse a simple-type-specifier.
16911 simple-type-specifier:
16912 :: [opt] nested-name-specifier [opt] type-name
16913 :: [opt] nested-name-specifier template template-id
16914 char
16915 wchar_t
16916 bool
16917 short
16918 int
16919 long
16920 signed
16921 unsigned
16922 float
16923 double
16924 void
16926 C++11 Extension:
16928 simple-type-specifier:
16929 auto
16930 decltype ( expression )
16931 char16_t
16932 char32_t
16933 __underlying_type ( type-id )
16935 C++17 extension:
16937 nested-name-specifier(opt) template-name
16939 GNU Extension:
16941 simple-type-specifier:
16942 __int128
16943 __typeof__ unary-expression
16944 __typeof__ ( type-id )
16945 __typeof__ ( type-id ) { initializer-list , [opt] }
16947 Concepts Extension:
16949 simple-type-specifier:
16950 constrained-type-specifier
16952 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16953 appropriately updated. */
16955 static tree
16958 cp_parser_flags flags)
16959 {
16964 /* Peek at the next token. */
16967 /* If we're looking at a keyword, things are easy. */
16969 {
17004 {
17007 }
17036 {
17037 /* The 'auto' might be the placeholder return type for a function decl
17038 with trailing return type. */
17047 {
17049 {
17056 }
17059 {
17062 }
17065 }
17069 {
17072 }
17075 {
17078 }
17079 else
17083 {
17086 "use of %<auto%> in lambda parameter declaration "
17087 "only available with "
17089 }
17092 "use of %<auto%> in parameter declaration "
17093 "only available with "
17097 "ISO C++ forbids use of %<auto%> in parameter "
17099 }
17100 else
17105 /* Since DR 743, decltype can either be a simple-type-specifier by
17106 itself or begin a nested-name-specifier. Parsing it will replace
17107 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17108 handling below decide what to do. */
17114 /* Consume the `typeof' token. */
17116 /* Parse the operand to `typeof'. */
17118 /* If it is not already a TYPE, take its type. */
17124 token,
17133 token,
17143 token,
17148 }
17150 /* If token is an already-parsed decltype not followed by ::,
17151 it's a simple-type-specifier. */
17154 {
17157 {
17159 token,
17161 /* Remember that we are handling a decltype in order to
17162 implement the resolution of DR 1510 when the argument
17163 isn't instantiation dependent. */
17165 }
17168 }
17170 /* If the type-specifier was for a built-in type, we're done. */
17172 {
17173 /* Record the type. */
17180 type,
17181 token,
17186 /* Consume the token. */
17192 /* There is no valid C++ program where a non-template type is
17193 followed by a "<". That usually indicates that the user thought
17194 that the type was a template. */
17199 }
17201 /* The type-specifier must be a user-defined type. */
17203 {
17207 /* Don't gobble tokens or issue error messages if this is an
17208 optional type-specifier. */
17214 /* Look for the optional `::' operator. */
17215 global_p
17219 /* Look for the nested-name specifier. */
17220 qualified_p
17227 /* If we have seen a nested-name-specifier, and the next token
17228 is `template', then we are using the template-id production. */
17231 {
17232 /* Look for the template-id. */
17236 none_type,
17238 /* If the template-id did not name a type, we are out of
17239 luck. */
17241 {
17244 }
17245 }
17246 /* Otherwise, look for a type-name. */
17247 else
17249 /* Keep track of all name-lookups performed in class scopes. */
17251 && !global_p
17252 && !qualified_p
17256 /* If it didn't work out, we don't have a TYPE. */
17261 {
17275 {
17277 none_type,
17287 else
17288 {
17293 }
17294 }
17295 else
17301 }
17304 token,
17306 }
17308 /* If we didn't get a type-name, issue an error message. */
17310 {
17313 }
17316 {
17317 /* See if TYPE is an Objective-C type, and if so, parse and
17318 accept any protocol references following it. Do this before
17319 the cp_parser_check_for_invalid_template_id() call, because
17320 Objective-C types can be followed by '<...>' which would
17321 enclose protocol names rather than template arguments, and so
17322 everything is fine. */
17325 {
17329 /* Clobber the "unqualified" type previously entered into
17330 DECL_SPECS with the new, improved protocol-qualified version. */
17335 }
17337 /* There is no valid C++ program where a non-template type is
17338 followed by a "<". That usually indicates that the user
17339 thought that the type was a template. */
17341 none_type,
17343 }
17346 }
17348 /* Parse a type-name.
17350 type-name:
17351 class-name
17352 enum-name
17353 typedef-name
17354 simple-template-id [in c++0x]
17356 enum-name:
17357 identifier
17359 typedef-name:
17360 identifier
17362 Concepts:
17364 type-name:
17365 concept-name
17366 partial-concept-id
17368 concept-name:
17369 identifier
17371 Returns a TYPE_DECL for the type. */
17373 static tree
17375 {
17377 }
17379 /* See above. */
17380 static tree
17382 {
17383 tree type_decl;
17385 /* We can't know yet whether it is a class-name or not. */
17387 /* Try a class-name. */
17389 typename_keyword_p,
17391 none_type,
17395 /* If it's not a class-name, keep looking. */
17397 {
17399 /* It must be a typedef-name or an enum-name. */
17403 /* It is either a simple-template-id representing an
17404 instantiation of an alias template... */
17408 none_type,
17410 /* Note that this must be an instantiation of an alias template
17411 because [temp.names]/6 says:
17413 A template-id that names an alias template specialization
17414 is a type-name.
17416 Whereas [temp.names]/7 says:
17418 A simple-template-id that names a class template
17419 specialization is a class-name.
17421 With concepts, this could also be a partial-concept-id that
17422 declares a non-type template parameter. */
17429 else
17433 /* ... Or a typedef-name or an enum-name. */
17435 }
17438 }
17440 /* Check if DECL and ARGS can form a constrained-type-specifier.
17441 If ARGS is non-null, we try to form a concept check of the
17442 form DECL<?, ARGS> where ? is a wildcard that matches any
17443 kind of template argument. If ARGS is NULL, then we try to
17444 form a concept check of the form DECL<?>. */
17446 static tree
17449 {
17452 /* If we a constrained-type-specifier cannot be deduced. */
17456 /* A constrained type specifier can only be found in an
17457 overload set or as a reference to a template declaration.
17459 FIXME: This might be masking a bug. It's possible that
17460 that the deduction below is causing template specializations
17461 to be formed with the wildcard as an argument. */
17465 /* Try to build a call expression that evaluates the
17466 concept. This can fail if the overload set refers
17467 only to non-templates. */
17473 /* Deduce the checked constraint and the prototype parameter.
17475 FIXME: In certain cases, failure to deduce should be a
17476 diagnosable error. */
17477 tree conc;
17478 tree proto;
17482 /* In template parameter scope, this results in a constrained
17483 parameter. Return a descriptor of that parm. */
17487 /* In a parameter-declaration-clause, constrained-type
17488 specifiers result in invented template parameters. */
17490 {
17493 }
17494 else
17495 {
17496 /* Otherwise, we're in a context where the constrained
17497 type name is deduced and the constraint applies
17498 after deduction. */
17500 }
17503 }
17505 /* If DECL refers to a concept, return a TYPE_DECL representing
17506 the result of using the constrained type specifier in the
17507 current context. DECL refers to a concept if
17509 - it is an overload set containing a function concept taking a single
17510 type argument, or
17512 - it is a variable concept taking a single type argument. */
17514 static tree
17516 {
17522 else
17524 }
17526 /* Check if DECL and ARGS form a partial-concept-id. If so,
17527 assign ID to the resulting constrained placeholder.
17529 Returns true if the partial-concept-id designates a placeholder
17530 and false otherwise. Note that *id is set to NULL_TREE in
17531 this case. */
17533 static tree
17535 {
17537 }
17539 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17540 or a concept-name.
17542 enum-name:
17543 identifier
17545 typedef-name:
17546 identifier
17548 concept-name:
17549 identifier
17551 Returns a TYPE_DECL for the type. */
17553 static tree
17555 {
17556 tree type_decl;
17557 tree identifier;
17564 /* Look up the type-name. */
17569 /* If we found an overload set, then it may refer to a concept-name. */
17575 {
17576 /* See if this is an Objective-C type. */
17581 }
17583 /* Issue an error if we did not find a type-name. */
17585 /* In Objective-C, we have the complication that class names are
17586 normally type names and start declarations (eg, the
17587 "NSObject" in "NSObject *object;"), but can be used in an
17588 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17589 is an expression. So, a classname followed by a dot is not a
17590 valid type-name. */
17593 {
17598 }
17599 /* Remember that the name was used in the definition of the
17600 current class so that we can check later to see if the
17601 meaning would have been different after the class was
17602 entirely defined. */
17608 }
17610 /* Parse an elaborated-type-specifier. Note that the grammar given
17611 here incorporates the resolution to DR68.
17613 elaborated-type-specifier:
17614 class-key :: [opt] nested-name-specifier [opt] identifier
17615 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17616 enum-key :: [opt] nested-name-specifier [opt] identifier
17617 typename :: [opt] nested-name-specifier identifier
17618 typename :: [opt] nested-name-specifier template [opt]
17619 template-id
17621 GNU extension:
17623 elaborated-type-specifier:
17624 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17625 class-key attributes :: [opt] nested-name-specifier [opt]
17626 template [opt] template-id
17627 enum attributes :: [opt] nested-name-specifier [opt] identifier
17629 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17630 declared `friend'. If IS_DECLARATION is TRUE, then this
17631 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17632 something is being declared.
17634 Returns the TYPE specified. */
17636 static tree
17640 {
17642 tree identifier;
17645 tree globalscope;
17648 /* See if we're looking at the `enum' keyword. */
17650 {
17651 /* Consume the `enum' token. */
17653 /* Remember that it's an enumeration type. */
17655 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17656 enums) is used here. */
17660 {
17667 /* Consume the `struct' or `class' and parse it anyway. */
17669 }
17670 /* Parse the attributes. */
17672 }
17673 /* Or, it might be `typename'. */
17675 RID_TYPENAME))
17676 {
17677 /* Consume the `typename' token. */
17679 /* Remember that it's a `typename' type. */
17681 }
17682 /* Otherwise it must be a class-key. */
17683 else
17684 {
17688 /* Parse the attributes. */
17690 }
17692 /* Look for the `::' operator. */
17695 /* Look for the nested-name-specifier. */
17696 tree nested_name_specifier;
17698 {
17699 nested_name_specifier
17704 is_declaration);
17707 }
17708 else
17709 /* Even though `typename' is not present, the proposed resolution
17710 to Core Issue 180 says that in `class A<T>::B', `B' should be
17711 considered a type-name, even if `A<T>' is dependent. */
17712 nested_name_specifier
17717 is_declaration);
17718 /* For everything but enumeration types, consider a template-id.
17719 For an enumeration type, consider only a plain identifier. */
17721 {
17723 tree decl;
17725 /* Allow the `template' keyword. */
17727 /* If we didn't see `template', we don't know if there's a
17728 template-id or not. */
17731 /* Parse the template-id. */
17735 tag_type,
17736 is_declaration);
17737 /* If we didn't find a template-id, look for an ordinary
17738 identifier. */
17740 ;
17741 /* We can get here when cp_parser_template_id, called by
17742 cp_parser_class_name with tag_type == none_type, succeeds
17743 and caches a BASELINK. Then, when called again here,
17744 instead of failing and returning an error_mark_node
17745 returns it (see template/typename17.C in C++11).
17746 ??? Could we diagnose this earlier? */
17748 {
17751 }
17752 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17753 in effect, then we must assume that, upon instantiation, the
17754 template will correspond to a class. */
17758 typename_type,
17760 /* If the `typename' keyword is in effect and DECL is not a type
17761 decl, then type is non existent. */
17763 ;
17765 {
17769 /* If the next token is a semicolon, this must be a specialization,
17770 instantiation, or friend declaration. Check the scope while we
17771 still know whether or not we had a nested-name-specifier. */
17776 }
17779 }
17782 {
17787 {
17790 }
17792 /* For a `typename', we needn't call xref_tag. */
17798 /* Template parameter lists apply only if we are not within a
17799 function parameter list. */
17800 bool template_parm_lists_apply
17809 /* Look up a qualified name in the usual way. */
17811 {
17812 tree decl;
17813 tree ambiguous_decls;
17816 tag_type,
17823 /* If the lookup was ambiguous, an error will already have been
17824 issued. */
17828 /* If we are parsing friend declaration, DECL may be a
17829 TEMPLATE_DECL tree node here. However, we need to check
17830 whether this TEMPLATE_DECL results in valid code. Consider
17831 the following example:
17833 namespace N {
17834 template <class T> class C {};
17835 }
17836 class X {
17837 template <class T> friend class N::C; // #1, valid code
17838 };
17839 template <class T> class Y {
17840 friend class N::C; // #2, invalid code
17841 };
17843 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17844 name lookup of `N::C'. We see that friend declaration must
17845 be template for the code to be valid. Note that
17846 processing_template_decl does not work here since it is
17847 always 1 for the above two cases. */
17849 decl = (cp_parser_maybe_treat_template_as_class
17854 {
17856 identifier,
17859 }
17862 {
17866 allow_template);
17870 }
17872 /* Forward declarations of nested types, such as
17874 class C1::C2;
17875 class C1::C2::C3;
17877 are invalid unless all components preceding the final '::'
17878 are complete. If all enclosing types are complete, these
17879 declarations become merely pointless.
17881 Invalid forward declarations of nested types are errors
17882 caught elsewhere in parsing. Those that are pointless arrive
17883 here. */
17890 }
17891 else
17892 {
17893 /* An elaborated-type-specifier sometimes introduces a new type and
17894 sometimes names an existing type. Normally, the rule is that it
17895 introduces a new type only if there is not an existing type of
17896 the same name already in scope. For example, given:
17898 struct S {};
17899 void f() { struct S s; }
17901 the `struct S' in the body of `f' is the same `struct S' as in
17902 the global scope; the existing definition is used. However, if
17903 there were no global declaration, this would introduce a new
17904 local class named `S'.
17906 An exception to this rule applies to the following code:
17908 namespace N { struct S; }
17910 Here, the elaborated-type-specifier names a new type
17911 unconditionally; even if there is already an `S' in the
17912 containing scope this declaration names a new type.
17913 This exception only applies if the elaborated-type-specifier
17914 forms the complete declaration:
17916 [class.name]
17918 A declaration consisting solely of `class-key identifier ;' is
17919 either a redeclaration of the name in the current scope or a
17920 forward declaration of the identifier as a class name. It
17921 introduces the name into the current scope.
17923 We are in this situation precisely when the next token is a `;'.
17925 An exception to the exception is that a `friend' declaration does
17926 *not* name a new type; i.e., given:
17928 struct S { friend struct T; };
17930 `T' is not a new type in the scope of `S'.
17932 Also, `new struct S' or `sizeof (struct S)' never results in the
17933 definition of a new type; a new type can only be declared in a
17934 declaration context. */
17936 tag_scope ts;
17940 /* Friends have special name lookup rules. */
17944 CPP_SEMICOLON))
17945 /* This is a `class-key identifier ;' */
17947 else
17950 template_p =
17951 (template_parm_lists_apply
17954 /* An unqualified name was used to reference this type, so
17955 there were no qualifying templates. */
17963 }
17964 }
17969 /* Allow attributes on forward declarations of classes. */
17971 {
17981 else
17984 }
17987 {
17988 /* Indicate whether this class was declared as a `class' or as a
17989 `struct'. */
17993 }
17995 /* A "<" cannot follow an elaborated type specifier. If that
17996 happens, the user was probably trying to form a template-id. */
18001 }
18003 /* Parse an enum-specifier.
18005 enum-specifier:
18006 enum-head { enumerator-list [opt] }
18007 enum-head { enumerator-list , } [C++0x]
18009 enum-head:
18010 enum-key identifier [opt] enum-base [opt]
18011 enum-key nested-name-specifier identifier enum-base [opt]
18013 enum-key:
18014 enum
18015 enum class [C++0x]
18016 enum struct [C++0x]
18018 enum-base: [C++0x]
18019 : type-specifier-seq
18021 opaque-enum-specifier:
18022 enum-key identifier enum-base [opt] ;
18024 GNU Extensions:
18025 enum-key attributes[opt] identifier [opt] enum-base [opt]
18026 { enumerator-list [opt] }attributes[opt]
18027 enum-key attributes[opt] identifier [opt] enum-base [opt]
18028 { enumerator-list, }attributes[opt] [C++0x]
18030 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18031 if the token stream isn't an enum-specifier after all. */
18033 static tree
18035 {
18036 tree identifier;
18038 tree prev_scope;
18040 tree attributes;
18053 /* Parse tentatively so that we can back up if we don't find a
18054 enum-specifier. */
18057 /* Caller guarantees that the current token is 'enum', an identifier
18058 possibly follows, and the token after that is an opening brace.
18059 If we don't have an identifier, fabricate an anonymous name for
18060 the enumeration being defined. */
18063 /* Parse the "class" or "struct", which indicates a scoped
18064 enumeration type in C++0x. */
18067 {
18071 /* Consume the `struct' or `class' token. */
18075 }
18079 /* Clear the qualification. */
18084 /* Figure out in what scope the declaration is being placed. */
18090 nested_name_specifier
18098 {
18099 tree name;
18103 enum_type,
18108 input_location);
18110 {
18113 {
18114 /* Are template enums allowed in ISO? */
18118 /* ignore a typename reference, for it will be solved by name
18119 in start_enum. */
18121 }
18122 }
18125 else
18126 {
18131 }
18132 }
18133 else
18134 {
18137 else
18138 {
18144 }
18145 }
18148 /* Check for the `:' that denotes a specified underlying type in C++0x.
18149 Note that a ':' could also indicate a bitfield width, however. */
18151 {
18152 cp_decl_specifier_seq type_specifiers;
18154 /* Consume the `:'. */
18157 /* Parse the type-specifier-seq. */
18162 /* At this point this is surely not elaborated type specifier. */
18171 /* If that didn't work, stop. */
18173 {
18179 }
18180 }
18182 /* Look for the `{' but don't consume it yet. */
18184 {
18186 {
18189 {
18192 }
18193 }
18194 /* An opaque-enum-specifier must have a ';' here. */
18197 {
18200 {
18203 }
18204 }
18205 }
18211 {
18213 {
18217 }
18219 {
18221 }
18222 }
18224 /* Issue an error message if type-definitions are forbidden here. */
18227 else
18228 /* Create the new type. We do this before consuming the opening
18229 brace so the enum will be recorded as being on the line of its
18230 tag (or the 'enum' keyword, if there is no tag). */
18234 /* If the next token is not '{' it is an opaque-enum-specifier or an
18235 elaborated-type-specifier. */
18237 {
18241 {
18242 /* The following catches invalid code such as:
18243 enum class S<int>::E { A, B, C }; */
18251 {
18255 nested_name_specifier);
18257 }
18260 {
18262 "%qT for enum declaration does not name a class "
18265 }
18266 /* If that scope does not contain the scope in which the
18267 class was originally declared, the program is invalid. */
18269 nested_name_specifier))
18270 {
18273 "declaration of %qD in namespace %qD which does not "
18276 else
18278 "declaration of %qD in %qD which does not "
18282 }
18283 /* If that scope is the scope where the declaration is being placed
18284 the program is invalid. */
18288 {
18292 }
18293 }
18298 /* Consume the opening brace. */
18299 matching_braces braces;
18306 {
18310 }
18311 else
18312 {
18318 }
18322 /* If the next token is not '}', then there are some enumerators. */
18324 {
18328 }
18329 else
18332 /* Consume the final '}'. */
18338 }
18339 else
18340 {
18341 /* If a ';' follows, then it is an opaque-enum-specifier
18342 and additional restrictions apply. */
18344 {
18351 }
18352 }
18354 /* Look for trailing attributes to apply to this enumeration, and
18355 apply them if appropriate. */
18357 {
18360 trailing_attr,
18362 }
18364 /* Finish up the enumeration. */
18366 {
18371 }
18374 {
18376 {
18379 }
18381 {
18383 }
18384 }
18385 out:
18388 }
18390 /* Parse an enumerator-list. The enumerators all have the indicated
18391 TYPE.
18393 enumerator-list:
18394 enumerator-definition
18395 enumerator-list , enumerator-definition */
18397 static void
18399 {
18401 {
18402 /* Parse an enumerator-definition. */
18405 /* If the next token is not a ',', we've reached the end of
18406 the list. */
18409 /* Otherwise, consume the `,' and keep going. */
18411 /* If the next token is a `}', there is a trailing comma. */
18413 {
18418 }
18419 }
18420 }
18422 /* Parse an enumerator-definition. The enumerator has the indicated
18423 TYPE.
18425 enumerator-definition:
18426 enumerator
18427 enumerator = constant-expression
18429 enumerator:
18430 identifier
18432 GNU Extensions:
18434 enumerator-definition:
18435 enumerator attributes [opt]
18436 enumerator attributes [opt] = constant-expression */
18438 static void
18440 {
18441 tree identifier;
18442 tree value;
18443 location_t loc;
18445 /* Save the input location because we are interested in the location
18446 of the identifier and not the location of the explicit value. */
18449 /* Look for the identifier. */
18454 /* Parse any specified attributes. */
18457 /* If the next token is an '=', then there is an explicit value. */
18459 {
18460 /* Consume the `=' token. */
18462 /* Parse the value. */
18464 }
18465 else
18468 /* If we are processing a template, make sure the initializer of the
18469 enumerator doesn't contain any bare template parameter pack. */
18473 /* Create the enumerator. */
18475 }
18477 /* Parse a namespace-name.
18479 namespace-name:
18480 original-namespace-name
18481 namespace-alias
18483 Returns the NAMESPACE_DECL for the namespace. */
18485 static tree
18487 {
18488 tree identifier;
18489 tree namespace_decl;
18493 /* Get the name of the namespace. */
18498 /* Look up the identifier in the currently active scope. Look only
18499 for namespaces, due to:
18501 [basic.lookup.udir]
18503 When looking up a namespace-name in a using-directive or alias
18504 definition, only namespace names are considered.
18506 And:
18508 [basic.lookup.qual]
18510 During the lookup of a name preceding the :: scope resolution
18511 operator, object, function, and enumerator names are ignored.
18513 (Note that cp_parser_qualifying_entity only calls this
18514 function if the token after the name is the scope resolution
18515 operator.) */
18517 none_type,
18523 /* If it's not a namespace, issue an error. */
18526 {
18531 }
18534 }
18536 /* Parse a namespace-definition.
18538 namespace-definition:
18539 named-namespace-definition
18540 unnamed-namespace-definition
18542 named-namespace-definition:
18543 original-namespace-definition
18544 extension-namespace-definition
18546 original-namespace-definition:
18547 namespace identifier { namespace-body }
18549 extension-namespace-definition:
18550 namespace original-namespace-name { namespace-body }
18552 unnamed-namespace-definition:
18553 namespace { namespace-body } */
18555 static void
18557 {
18558 tree identifier;
18567 {
18570 }
18572 /* Look for the `namespace' keyword. */
18573 cp_token* token
18576 /* Parse any specified attributes before the identifier. */
18580 {
18584 {
18587 /* Parse any attributes specified after the identifier. */
18589 }
18596 "nested namespace definitions only available with "
18599 /* Nested namespace names can create new namespaces (unlike
18600 other qualified-ids). */
18603 else
18606 }
18618 /* Start the namespace. */
18625 /* Look for the `{' to validate starting the namespace. */
18626 matching_braces braces;
18628 {
18629 /* Parse the body of the namespace. */
18632 /* Look for the final `}'. */
18634 }
18639 /* Pop the nested namespace definitions. */
18642 }
18644 /* Parse a namespace-body.
18646 namespace-body:
18647 declaration-seq [opt] */
18649 static void
18651 {
18653 }
18655 /* Parse a namespace-alias-definition.
18657 namespace-alias-definition:
18658 namespace identifier = qualified-namespace-specifier ; */
18660 static void
18662 {
18663 tree identifier;
18664 tree namespace_specifier;
18668 /* Look for the `namespace' keyword. */
18670 /* Look for the identifier. */
18674 /* Look for the `=' token. */
18677 {
18679 /* Skip the definition. */
18684 }
18686 /* Look for the qualified-namespace-specifier. */
18687 namespace_specifier
18689 /* Look for the `;' token. */
18692 /* Register the alias in the symbol table. */
18694 }
18696 /* Parse a qualified-namespace-specifier.
18698 qualified-namespace-specifier:
18699 :: [opt] nested-name-specifier [opt] namespace-name
18701 Returns a NAMESPACE_DECL corresponding to the specified
18702 namespace. */
18704 static tree
18706 {
18707 /* Look for the optional `::'. */
18711 /* Look for the optional nested-name-specifier. */
18719 }
18721 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18722 access declaration.
18724 using-declaration:
18725 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18726 using :: unqualified-id ;
18728 access-declaration:
18729 qualified-id ;
18731 */
18733 static bool
18736 {
18740 tree decl;
18741 tree identifier;
18742 tree qscope;
18747 {
18750 }
18751 else
18752 {
18753 /* Look for the `using' keyword. */
18756 again:
18757 /* Peek at the next token. */
18759 /* See if it's `typename'. */
18761 {
18762 /* Remember that we've seen it. */
18764 /* Consume the `typename' token. */
18766 }
18767 }
18769 /* Look for the optional global scope qualification. */
18770 global_scope_p
18775 /* If we saw `typename', or didn't see `::', then there must be a
18776 nested-name-specifier present. */
18778 {
18784 {
18787 }
18788 }
18789 /* Otherwise, we could be in either of the two productions. In that
18790 case, treat the nested-name-specifier as optional. */
18791 else
18803 /* Something has already gone wrong; there's no need to parse
18804 further. Since an error has occurred, the return value of
18805 cp_parser_parse_definitely will be false, as required. */
18809 /* Parse the unqualified-id. */
18817 {
18822 }
18824 {
18829 "pack expansion in using-declaration only available "
18832 }
18834 /* The function we call to handle a using-declaration is different
18835 depending on what scope we are in. */
18837 ;
18840 /* [namespace.udecl]
18842 A using declaration shall not name a template-id. */
18845 else
18846 {
18848 {
18849 /* Create the USING_DECL. */
18856 {
18859 }
18860 else
18861 /* Add it to the list of members in this class. */
18863 }
18864 else
18865 {
18867 identifier,
18874 {
18877 }
18880 else
18882 }
18883 }
18887 {
18891 "comma-separated list in using-declaration only available "
18894 }
18896 /* Look for the final `;'. */
18901 "access declarations are deprecated "
18902 "in favour of using-declarations; "
18906 }
18908 /* Parse an alias-declaration.
18910 alias-declaration:
18911 using identifier attribute-specifier-seq [opt] = type-id */
18913 static tree
18915 {
18917 location_t id_location;
18919 cp_decl_specifier_seq decl_specs;
18923 /* Look for the `using' keyword. */
18924 cp_token *using_token
18946 /* Now we are going to parse the type-id of the declaration. */
18948 /*
18949 [dcl.type]/3 says:
18951 "A type-specifier-seq shall not define a class or enumeration
18952 unless it appears in the type-id of an alias-declaration (7.1.3) that
18953 is not the declaration of a template-declaration."
18955 In other words, if we currently are in an alias template, the
18956 type-id should not define a type.
18958 So let's set parser->type_definition_forbidden_message in that
18959 case; cp_parser_check_type_definition (called by
18960 cp_parser_class_specifier) will then emit an error if a type is
18961 defined in the type-id. */
18963 {
18967 }
18971 /* Restore the error message if need be. */
18977 {
18980 }
18982 /* A typedef-name can also be introduced by an alias-declaration. The
18983 identifier following the using keyword becomes a typedef-name. It has
18984 the same semantics as if it were introduced by the typedef
18985 specifier. In particular, it does not define a new type and it shall
18986 not appear in the type-id. */
18991 {
18994 ds_attribute,
18995 attrs_token);
18996 }
18998 ds_typedef,
18999 using_token);
19001 ds_alias,
19002 using_token);
19011 else
19017 // Attach constraints to the alias declaration.
19019 {
19023 }
19030 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19031 added into the symbol table; otherwise, return the TYPE_DECL. */
19035 {
19039 }
19042 }
19044 /* Parse a using-directive.
19046 using-directive:
19047 using namespace :: [opt] nested-name-specifier [opt]
19048 namespace-name ; */
19050 static void
19052 {
19053 tree namespace_decl;
19054 tree attribs;
19056 /* Look for the `using' keyword. */
19058 /* And the `namespace' keyword. */
19060 /* Look for the optional `::' operator. */
19062 /* And the optional nested-name-specifier. */
19068 /* Get the namespace being used. */
19070 /* And any specified attributes. */
19073 /* Update the symbol table. */
19076 else
19079 /* Look for the final `;'. */
19081 }
19083 /* Parse an asm-definition.
19085 asm-definition:
19086 asm ( string-literal ) ;
19088 GNU Extension:
19090 asm-definition:
19091 asm volatile [opt] ( string-literal ) ;
19092 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19093 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19094 : asm-operand-list [opt] ) ;
19095 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19096 : asm-operand-list [opt]
19097 : asm-clobber-list [opt] ) ;
19098 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19099 : asm-clobber-list [opt]
19100 : asm-goto-list ) ; */
19102 static void
19104 {
19105 tree string;
19110 tree asm_stmt;
19118 /* Look for the `asm' keyword. */
19123 {
19126 }
19128 /* See if the next token is `volatile'. */
19131 {
19132 /* Remember that we saw the `volatile' keyword. */
19134 /* Consume the token. */
19136 }
19140 {
19141 /* Remember that we saw the `goto' keyword. */
19143 /* Consume the token. */
19145 }
19146 /* Look for the opening `('. */
19149 /* Look for the string. */
19152 {
19156 }
19158 /* If we're allowing GNU extensions, check for the extended assembly
19159 syntax. Unfortunately, the `:' tokens need not be separated by
19160 a space in C, and so, for compatibility, we tolerate that here
19161 too. Doing that means that we have to treat the `::' operator as
19162 two `:' tokens. */
19167 {
19172 /* The extended syntax was used. */
19175 /* Look for outputs. */
19177 {
19178 /* Consume the `:'. */
19180 /* Parse the output-operands. */
19182 CPP_COLON)
19184 CPP_SCOPE)
19186 CPP_CLOSE_PAREN)
19188 {
19192 }
19193 }
19194 /* If the next token is `::', there are no outputs, and the
19195 next token is the beginning of the inputs. */
19197 /* The inputs are coming next. */
19200 /* Look for inputs. */
19203 {
19204 /* Consume the `:' or `::'. */
19206 /* Parse the output-operands. */
19208 CPP_COLON)
19210 CPP_SCOPE)
19212 CPP_CLOSE_PAREN))
19213 {
19217 }
19218 }
19220 /* The clobbers are coming next. */
19223 /* Look for clobbers. */
19226 {
19228 /* Consume the `:' or `::'. */
19230 /* Parse the clobbers. */
19232 CPP_COLON)
19234 CPP_CLOSE_PAREN))
19236 }
19239 /* The labels are coming next. */
19242 /* Look for labels. */
19245 {
19247 /* Consume the `:' or `::'. */
19249 /* Parse the labels. */
19251 }
19255 }
19259 /* Look for the closing `)'. */
19267 {
19268 /* Create the ASM_EXPR. */
19270 {
19273 /* If the extended syntax was not used, mark the ASM_EXPR. */
19275 {
19281 }
19282 }
19283 else
19285 }
19286 }
19288 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19289 type that comes from the decl-specifier-seq. */
19291 static tree
19293 {
19296 {
19309 }
19312 }
19314 /* Declarators [gram.dcl.decl] */
19316 /* Parse an init-declarator.
19318 init-declarator:
19319 declarator initializer [opt]
19321 GNU Extension:
19323 init-declarator:
19324 declarator asm-specification [opt] attributes [opt] initializer [opt]
19326 function-definition:
19327 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19328 function-body
19329 decl-specifier-seq [opt] declarator function-try-block
19331 GNU Extension:
19333 function-definition:
19334 __extension__ function-definition
19336 TM Extension:
19338 function-definition:
19339 decl-specifier-seq [opt] declarator function-transaction-block
19341 The DECL_SPECIFIERS apply to this declarator. Returns a
19342 representation of the entity declared. If MEMBER_P is TRUE, then
19343 this declarator appears in a class scope. The new DECL created by
19344 this declarator is returned.
19346 The CHECKS are access checks that should be performed once we know
19347 what entity is being declared (and, therefore, what classes have
19348 befriended it).
19350 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19351 for a function-definition here as well. If the declarator is a
19352 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19353 be TRUE upon return. By that point, the function-definition will
19354 have been completely parsed.
19356 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19357 is FALSE.
19359 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19360 parsed declaration if it is an uninitialized single declarator not followed
19361 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19362 if present, will not be consumed. If returned, this declarator will be
19363 created with SD_INITIALIZED but will not call cp_finish_decl.
19365 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19366 and there is an initializer, the pointed location_t is set to the
19367 location of the '=' or `(', or '{' in C++11 token introducing the
19368 initializer. */
19370 static tree
19381 {
19385 tree prefix_attributes;
19387 tree asm_specification;
19388 tree initializer;
19390 tree scope;
19392 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19393 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19394 "(...)". */
19405 /* Gather the attributes that were provided with the
19406 decl-specifiers. */
19409 /* Assume that this is not the declarator for a function
19410 definition. */
19414 /* Default arguments are only permitted for function parameters. */
19418 /* Defer access checks while parsing the declarator; we cannot know
19419 what names are accessible until we know what is being
19420 declared. */
19425 /* Parse the declarator. */
19426 declarator
19431 /* Gather up the deferred checks. */
19436 /* If the DECLARATOR was erroneous, there's no need to go
19437 further. */
19441 /* Check that the number of template-parameter-lists is OK. */
19451 /* Figure out what scope the entity declared by the DECLARATOR is
19452 located in. `grokdeclarator' sometimes changes the scope, so
19453 we compute it now. */
19456 /* Perform any lookups in the declared type which were thought to be
19457 dependent, but are not in the scope of the declarator. */
19458 decl_specifiers->type
19461 /* If we're allowing GNU extensions, look for an
19462 asm-specification. */
19464 {
19465 /* Look for an asm-specification. */
19468 }
19469 else
19472 /* Look for attributes. */
19476 /* Peek at the next token. */
19482 {
19483 /* Handle C++17 deduction guides. */
19487 {
19495 {
19499 }
19500 }
19502 /* Check to see if the token indicates the start of a
19503 function-definition. */
19505 {
19507 {
19508 /* If a function-definition should not appear here, issue an
19509 error message. */
19513 }
19515 location_t func_brace_location
19518 /* Neither attributes nor an asm-specification are allowed
19519 on a function-definition. */
19522 "an asm-specification is not allowed "
19526 "attributes are not allowed "
19528 /* This is a function-definition. */
19531 /* Parse the function definition. */
19534 decl_specifiers,
19535 declarator,
19536 prefix_attributes);
19537 else
19538 decl =
19539 (cp_parser_function_definition_from_specifiers_and_declarator
19543 {
19544 /* This is where the prologue starts... */
19547 }
19550 }
19551 }
19553 {
19554 /* A non-template declaration involving a function parameter list
19555 containing an implicit template parameter will be made into a
19556 template. If the resulting declaration is not going to be an
19557 actual function then finish the template scope here to prevent it.
19558 An error message will be issued once we have a decl to talk about.
19560 FIXME probably we should do type deduction rather than create an
19561 implicit template, but the standard currently doesn't allow it. */
19564 }
19566 /* [dcl.dcl]
19568 Only in function declarations for constructors, destructors, type
19569 conversions, and deduction guides can the decl-specifier-seq be omitted.
19571 We explicitly postpone this check past the point where we handle
19572 function-definitions because we tolerate function-definitions
19573 that are missing their return types in some modes. */
19575 {
19579 }
19581 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19585 {
19596 {
19602 }
19603 }
19604 else
19605 {
19606 /* If the init-declarator isn't initialized and isn't followed by a
19607 `,' or `;', it's not a valid init-declarator. */
19610 {
19613 else
19614 {
19618 }
19619 }
19622 }
19624 /* Because start_decl has side-effects, we should only call it if we
19625 know we're going ahead. By this point, we know that we cannot
19626 possibly be looking at any other construct. */
19629 /* Enter the newly declared entry in the symbol table. If we're
19630 processing a declaration in a class-specifier, we wait until
19631 after processing the initializer. */
19633 {
19641 /* Adjust location of decl if declarator->id_loc is more appropriate:
19642 set, and decl wasn't merged with another decl, in which case its
19643 location would be different from input_location, and more accurate. */
19648 }
19650 /* Enter the SCOPE. That way unqualified names appearing in the
19651 initializer will be looked up in SCOPE. */
19654 /* Perform deferred access control checks, now that we know in which
19655 SCOPE the declared entity resides. */
19657 {
19660 /* If the entity being declared is a function, pretend that we
19661 are in its scope. If it is a `friend', it may have access to
19662 things that would not otherwise be accessible. */
19664 {
19667 }
19669 /* Perform access checks for template parameters. */
19672 /* Perform the access control checks for the declarator and the
19673 decl-specifiers. */
19676 /* Restore the saved value. */
19679 }
19681 /* Parse the initializer. */
19686 {
19688 {
19691 else
19692 {
19693 /* If the declaration was erroneous, we don't really
19694 know what the user intended, so just silently
19695 consume the initializer. */
19702 }
19703 }
19704 else
19705 {
19706 /* We want to record the extra mangling scope for in-class
19707 initializers of class members and initializers of static data
19708 member templates. The former involves deferring
19709 parsing of the initializer until end of class as with default
19710 arguments. So right here we only handle the latter. */
19720 }
19721 }
19723 /* The old parser allows attributes to appear after a parenthesized
19724 initializer. Mark Mitchell proposed removing this functionality
19725 on the GCC mailing lists on 2002-08-13. This parser accepts the
19726 attributes -- but ignores them. */
19733 /* And now complain about a non-function implicit template. */
19738 /* For an in-class declaration, use `grokfield' to create the
19739 declaration. */
19741 {
19743 {
19746 }
19755 }
19757 /* Finish processing the declaration. But, skip member
19758 declarations. */
19760 {
19763 asm_specification,
19764 /* If the initializer is in parentheses, then this is
19765 a direct-initialization, which means that an
19766 `explicit' constructor is OK. Otherwise, an
19767 `explicit' constructor cannot be used. */
19770 }
19773 /* Core issue #226 (C++0x only): A default template-argument
19774 shall not be specified in a friend class template
19775 declaration. */
19784 {
19787 else
19789 }
19796 }
19798 /* Parse a declarator.
19800 declarator:
19801 direct-declarator
19802 ptr-operator declarator
19804 abstract-declarator:
19805 ptr-operator abstract-declarator [opt]
19806 direct-abstract-declarator
19808 GNU Extensions:
19810 declarator:
19811 attributes [opt] direct-declarator
19812 attributes [opt] ptr-operator declarator
19814 abstract-declarator:
19815 attributes [opt] ptr-operator abstract-declarator [opt]
19816 attributes [opt] direct-abstract-declarator
19818 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19819 detect constructors, destructors, deduction guides, or conversion operators.
19820 It is set to -1 if the declarator is a name, and +1 if it is a
19821 function. Otherwise it is set to zero. Usually you just want to
19822 test for >0, but internally the negative value is used.
19824 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19825 a decl-specifier-seq unless it declares a constructor, destructor,
19826 or conversion. It might seem that we could check this condition in
19827 semantic analysis, rather than parsing, but that makes it difficult
19828 to handle something like `f()'. We want to notice that there are
19829 no decl-specifiers, and therefore realize that this is an
19830 expression, not a declaration.)
19832 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19833 the declarator is a direct-declarator of the form "(...)".
19835 MEMBER_P is true iff this declarator is a member-declarator.
19837 FRIEND_P is true iff this declarator is a friend. */
19841 cp_parser_declarator_kind dcl_kind,
19845 {
19848 cp_cv_quals cv_quals;
19849 tree class_type;
19852 /* Assume this is not a constructor, destructor, or type-conversion
19853 operator. */
19860 /* Check for the ptr-operator production. */
19862 /* Parse the ptr-operator. */
19868 /* If that worked, then we have a ptr-operator. */
19870 {
19871 /* If a ptr-operator was found, then this declarator was not
19872 parenthesized. */
19875 /* The dependent declarator is optional if we are parsing an
19876 abstract-declarator. */
19880 /* Parse the dependent declarator. */
19885 friend_p);
19887 /* If we are parsing an abstract-declarator, we must handle the
19888 case where the dependent declarator is absent. */
19893 declarator = cp_parser_make_indirect_declarator
19895 }
19896 /* Everything else is a direct-declarator. */
19897 else
19898 {
19901 CPP_OPEN_PAREN);
19903 ctor_dtor_or_conv_p,
19905 }
19910 }
19912 /* Parse a direct-declarator or direct-abstract-declarator.
19914 direct-declarator:
19915 declarator-id
19916 direct-declarator ( parameter-declaration-clause )
19917 cv-qualifier-seq [opt]
19918 ref-qualifier [opt]
19919 exception-specification [opt]
19920 direct-declarator [ constant-expression [opt] ]
19921 ( declarator )
19923 direct-abstract-declarator:
19924 direct-abstract-declarator [opt]
19925 ( parameter-declaration-clause )
19926 cv-qualifier-seq [opt]
19927 ref-qualifier [opt]
19928 exception-specification [opt]
19929 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19930 ( abstract-declarator )
19932 Returns a representation of the declarator. DCL_KIND is
19933 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19934 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19935 we are parsing a direct-declarator. It is
19936 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19937 of ambiguity we prefer an abstract declarator, as per
19938 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19939 as for cp_parser_declarator. */
19943 cp_parser_declarator_kind dcl_kind,
19946 {
19957 {
19958 /* Peek at the next token. */
19961 {
19962 /* This is either a parameter-declaration-clause, or a
19963 parenthesized declarator. When we know we are parsing a
19964 named declarator, it must be a parenthesized declarator
19965 if FIRST is true. For instance, `(int)' is a
19966 parameter-declaration-clause, with an omitted
19967 direct-abstract-declarator. But `((*))', is a
19968 parenthesized abstract declarator. Finally, when T is a
19969 template parameter `(T)' is a
19970 parameter-declaration-clause, and not a parenthesized
19971 named declarator.
19973 We first try and parse a parameter-declaration-clause,
19974 and then try a nested declarator (if FIRST is true).
19976 It is not an error for it not to be a
19977 parameter-declaration-clause, even when FIRST is
19978 false. Consider,
19980 int i (int);
19981 int i (3);
19983 The first is the declaration of a function while the
19984 second is the definition of a variable, including its
19985 initializer.
19987 Having seen only the parenthesis, we cannot know which of
19988 these two alternatives should be selected. Even more
19989 complex are examples like:
19991 int i (int (a));
19992 int i (int (3));
19994 The former is a function-declaration; the latter is a
19995 variable initialization.
19997 Thus again, we try a parameter-declaration-clause, and if
19998 that fails, we back out and return. */
20001 {
20002 tree params;
20007 /* In a member-declarator, the only valid interpretation
20008 of a parenthesis is the start of a
20009 parameter-declaration-clause. (It is invalid to
20010 initialize a static data member with a parenthesized
20011 initializer; only the "=" form of initialization is
20012 permitted.) */
20016 /* Consume the `('. */
20017 matching_parens parens;
20020 {
20021 /* If this is going to be an abstract declarator, we're
20022 in a declarator and we can't have default args. */
20025 }
20029 /* Parse the parameter-declaration-clause. */
20032 /* Consume the `)'. */
20035 /* If all went well, parse the cv-qualifier-seq,
20036 ref-qualifier and the exception-specification. */
20038 {
20039 cp_cv_quals cv_quals;
20040 cp_virt_specifiers virt_specifiers;
20041 cp_ref_qualifier ref_qual;
20042 tree exception_specification;
20043 tree late_return;
20044 tree attrs;
20054 /* Parse the cv-qualifier-seq. */
20056 /* Parse the ref-qualifier. */
20058 /* Parse the tx-qualifier. */
20060 /* And the exception-specification. */
20061 exception_specification
20066 /* In here, we handle cases where attribute is used after
20067 the function declaration. For example:
20068 void func (int x) __attribute__((vector(..))); */
20072 {
20076 CPP_SEMICOLON)
20078 CPP_OPEN_BRACE))
20081 ;
20082 else
20084 }
20086 late_return = (cp_parser_late_return_type_opt
20090 /* Parse the virt-specifier-seq. */
20093 /* Create the function-declarator. */
20095 params,
20096 cv_quals,
20097 virt_specifiers,
20098 ref_qual,
20099 tx_qual,
20100 exception_specification,
20101 late_return,
20102 requires_clause);
20105 /* Any subsequent parameter lists are to do with
20106 return type, so are not those of the declared
20107 function. */
20109 }
20111 /* Remove the function parms from scope. */
20115 /* Repeat the main loop. */
20117 }
20119 /* If this is the first, we can try a parenthesized
20120 declarator. */
20122 {
20129 /* Consume the `('. */
20130 matching_parens parens;
20132 /* Parse the nested declarator. */
20135 declarator
20141 /* Expect a `)'. */
20149 }
20150 /* Otherwise, we must be done. */
20151 else
20153 }
20157 {
20158 /* Parse an array-declarator. */
20168 /* Consume the `['. */
20170 /* Peek at the next token. */
20172 /* If the next token is `]', then there is no
20173 constant-expression. */
20175 {
20177 bounds
20187 {
20188 /* Normally, the array bound must be an integral constant
20189 expression. However, as an extension, we allow VLAs
20190 in function scopes as long as they aren't part of a
20191 parameter declaration. */
20195 }
20198 {
20199 /* Remember this wasn't a constant-expression. */
20202 }
20203 }
20204 else
20206 /* Look for the closing `]'. */
20208 {
20211 }
20216 }
20218 {
20219 {
20220 tree qualifying_scope;
20221 tree unqualified_name;
20222 tree attrs;
20223 special_function_kind sfk;
20228 /* Parse a declarator-id */
20231 {
20234 /* If we see an ellipsis, we should be looking at a
20235 parameter pack. */
20237 {
20238 /* Consume the `...' */
20242 }
20243 }
20246 unqualified_name
20250 {
20254 {
20255 /* Check whether an error occurred. */
20258 /* We already consumed the ellipsis to mark a
20259 parameter pack, but we have no way to report it,
20260 so abort the tentative parse. We will be exiting
20261 immediately anyway. */
20263 }
20264 else
20270 && (qualifying_scope
20272 {
20275 }
20276 }
20281 {
20286 }
20292 {
20293 /* In the declaration of a member of a template class
20294 outside of the class itself, the SCOPE will sometimes
20295 be a TYPENAME_TYPE. For example, given:
20297 template <typename T>
20298 int S<T>::R::i = 3;
20300 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20301 this context, we must resolve S<T>::R to an ordinary
20302 type, rather than a typename type.
20304 The reason we normally avoid resolving TYPENAME_TYPEs
20305 is that a specialization of `S' might render
20306 `S<T>::R' not a type. However, if `S' is
20307 specialized, then this `i' will not be used, so there
20308 is no harm in resolving the types here. */
20309 tree type;
20311 /* Resolve the TYPENAME_TYPE. */
20314 /* If that failed, the declarator is invalid. */
20316 {
20319 "cannot define member of dependent typedef "
20321 else
20326 }
20328 }
20333 {
20334 tree class_type;
20339 else
20343 {
20347 {
20348 /* We do not attempt to print the declarator
20349 here because we do not have enough
20350 information about its original syntactic
20351 form. */
20355 }
20358 {
20362 "use %<%T::%D%> instead of %<%T::%D%> to "
20364 class_type,
20369 }
20371 }
20374 {
20381 for an unnamed type, even if the type
20382 got a name for linkage purposes. */
20384 /* Handle correctly (c++/19200):
20386 struct S {
20387 struct T{};
20388 friend void S(T);
20389 };
20391 and also:
20393 namespace N {
20394 void S();
20395 }
20397 struct S {
20398 friend void N::S();
20399 }; */
20402 class_type))
20411 }
20412 }
20414 unqualified_name,
20415 sfk);
20422 }
20424 handle_declarator:;
20427 {
20428 /* Any names that appear after the declarator-id for a
20429 member are looked up in the containing scope. */
20431 {
20432 /* But declarations with qualified-ids can't appear in a
20433 function. */
20437 }
20439 }
20443 /* Default args are only allowed on function
20444 declarations. */
20446 else
20450 }
20451 /* We're done. */
20452 else
20454 }
20456 /* For an abstract declarator, we might wind up with nothing at this
20457 point. That's an error; the declarator is not optional. */
20461 {
20462 /* Record overly parenthesized declarator so we can give a
20463 diagnostic about confusing decl/expr disambiguation. */
20465 {
20466 /* If the open and close parens are on different lines, this
20467 is probably a formatting thing, so ignore. */
20472 }
20475 }
20477 /* If we entered a scope, we must exit it now. */
20485 }
20487 /* Parse a ptr-operator.
20489 ptr-operator:
20490 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20491 * cv-qualifier-seq [opt]
20492 &
20493 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20494 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20496 GNU Extension:
20498 ptr-operator:
20499 & cv-qualifier-seq [opt]
20501 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20502 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20503 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20504 filled in with the TYPE containing the member. *CV_QUALS is
20505 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20506 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20507 Note that the tree codes returned by this function have nothing
20508 to do with the types of trees that will be eventually be created
20509 to represent the pointer or reference type being parsed. They are
20510 just constants with suggestive names. */
20511 static enum tree_code
20516 {
20521 /* Assume that it's not a pointer-to-member. */
20523 /* And that there are no cv-qualifiers. */
20526 /* Peek at the next token. */
20529 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20539 {
20540 /* Consume the `*', `&' or `&&'. */
20543 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20544 `&', if we are allowing GNU extensions. (The only qualifier
20545 that can legally appear after `&' is `restrict', but that is
20546 enforced during semantic analysis. */
20554 }
20555 else
20556 {
20557 /* Try the pointer-to-member case. */
20559 /* Look for the optional `::' operator. */
20562 /* Look for the nested-name specifier. */
20569 /* If we found it, and the next token is a `*', then we are
20570 indeed looking at a pointer-to-member operator. */
20573 {
20574 /* Indicate that the `*' operator was used. */
20582 else
20583 {
20584 /* The type of which the member is a member is given by the
20585 current SCOPE. */
20587 /* The next name will not be qualified. */
20591 /* Look for optional c++11 attributes. */
20595 /* Look for the optional cv-qualifier-seq. */
20597 }
20598 }
20599 /* If that didn't work we don't have a ptr-operator. */
20602 }
20605 }
20607 /* Parse an (optional) cv-qualifier-seq.
20609 cv-qualifier-seq:
20610 cv-qualifier cv-qualifier-seq [opt]
20612 cv-qualifier:
20613 const
20614 volatile
20616 GNU Extension:
20618 cv-qualifier:
20619 __restrict__
20621 Returns a bitmask representing the cv-qualifiers. */
20623 static cp_cv_quals
20625 {
20629 {
20631 cp_cv_quals cv_qualifier;
20633 /* Peek at the next token. */
20635 /* See if it's a cv-qualifier. */
20637 {
20653 }
20659 {
20664 }
20665 else
20666 {
20669 }
20670 }
20673 }
20675 /* Parse an (optional) ref-qualifier
20677 ref-qualifier:
20678 &
20679 &&
20681 Returns cp_ref_qualifier representing ref-qualifier. */
20683 static cp_ref_qualifier
20685 {
20688 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20693 {
20698 {
20710 }
20715 {
20718 }
20719 else
20720 {
20723 }
20724 }
20727 }
20729 /* Parse an optional tx-qualifier.
20731 tx-qualifier:
20732 transaction_safe
20733 transaction_safe_dynamic */
20735 static tree
20737 {
20740 {
20745 {
20749 {
20752 {
20755 }
20756 else
20758 }
20759 }
20760 }
20762 }
20764 /* Parse an (optional) virt-specifier-seq.
20766 virt-specifier-seq:
20767 virt-specifier virt-specifier-seq [opt]
20769 virt-specifier:
20770 override
20771 final
20773 Returns a bitmask representing the virt-specifiers. */
20775 static cp_virt_specifiers
20777 {
20781 {
20783 cp_virt_specifiers virt_specifier;
20785 /* Peek at the next token. */
20787 /* See if it's a virt-specifier-qualifier. */
20791 {
20794 }
20796 {
20799 }
20801 {
20803 }
20804 else
20808 {
20813 }
20814 else
20815 {
20818 }
20819 }
20821 }
20823 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20824 is in scope even though it isn't real. */
20826 void
20828 {
20829 tree this_parm;
20832 {
20833 /* We don't clear this between NSDMIs. Is it already what we want? */
20840 }
20843 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20845 current_class_ref
20848 }
20850 /* Return true iff our current scope is a non-static data member
20851 initializer. */
20853 bool
20855 {
20856 /* We recognize NSDMI context by the context-less 'this' pointer set up
20857 by the function above. */
20863 }
20865 /* Parse a late-specified return type, if any. This is not a separate
20866 non-terminal, but part of a function declarator, which looks like
20868 -> trailing-type-specifier-seq abstract-declarator(opt)
20870 Returns the type indicated by the type-id.
20872 In addition to this, parse any queued up #pragma omp declare simd
20873 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20874 #pragma acc routine clauses.
20876 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20877 function. */
20879 static tree
20882 {
20886 && declarator
20893 && declarator
20896 /* Peek at the next token. */
20898 /* A late-specified return type is indicated by an initial '->'. */
20909 {
20910 /* DR 1207: 'this' is in scope in the trailing return type. */
20912 }
20915 {
20916 /* Consume the ->. */
20920 }
20922 /* Function declarations may be followed by a trailing
20923 requires-clause. */
20927 declarator->attributes
20931 declarator->attributes
20935 declarator->attributes
20940 {
20943 }
20946 }
20948 /* Parse a declarator-id.
20950 declarator-id:
20951 id-expression
20952 :: [opt] nested-name-specifier [opt] type-name
20954 In the `id-expression' case, the value returned is as for
20955 cp_parser_id_expression if the id-expression was an unqualified-id.
20956 If the id-expression was a qualified-id, then a SCOPE_REF is
20957 returned. The first operand is the scope (either a NAMESPACE_DECL
20958 or TREE_TYPE), but the second is still just a representation of an
20959 unqualified-id. */
20961 static tree
20963 {
20964 tree id;
20965 /* The expression must be an id-expression. Assume that qualified
20966 names are the names of types so that:
20968 template <class T>
20969 int S<T>::R::i = 3;
20971 will work; we must treat `S<T>::R' as the name of a type.
20972 Similarly, assume that qualified names are templates, where
20973 required, so that:
20975 template <class T>
20976 int S<T>::R<T>::i = 3;
20978 will work, too. */
20984 optional_p);
20988 }
20990 /* Parse a type-id.
20992 type-id:
20993 type-specifier-seq abstract-declarator [opt]
20995 Returns the TYPE specified. */
20997 static tree
21000 {
21001 cp_decl_specifier_seq type_specifier_seq;
21004 /* Parse the type-specifier-seq. */
21006 is_trailing_return,
21011 /* A bare template name as a template argument is a template template
21012 argument, not a placeholder, so fail parsing it as a type argument. */
21013 {
21017 }
21021 /* There might or might not be an abstract declarator. */
21023 /* Look for the declarator. */
21024 abstract_declarator
21029 /* Check to see if there really was a declarator. */
21034 /* The concepts TS allows 'auto' as a type-id. */
21036 /* None of the valid uses of 'auto' in C++14 involve the type-id
21037 nonterminal, but it is valid in a trailing-return-type. */
21040 {
21041 /* A type-id with type 'auto' is only ok if the abstract declarator
21042 is a function declarator with a late-specified return type.
21044 A type-id with 'auto' is also valid in a trailing-return-type
21045 in a compound-requirement. */
21052 else
21053 {
21056 {
21058 auto_node);
21060 tmpl);
21061 }
21062 else
21065 }
21066 }
21069 is_template_arg);
21070 }
21072 static tree
21074 {
21076 }
21078 static tree
21080 {
21081 tree r;
21083 parser->type_definition_forbidden_message
21088 {
21091 }
21093 }
21095 static tree
21097 {
21099 }
21101 /* Parse a type-specifier-seq.
21103 type-specifier-seq:
21104 type-specifier type-specifier-seq [opt]
21106 GNU extension:
21108 type-specifier-seq:
21109 attributes type-specifier-seq [opt]
21111 If IS_DECLARATION is true, we are at the start of a "condition" or
21112 exception-declaration, so we might be followed by a declarator-id.
21114 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21115 i.e. we've just seen "->".
21117 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21119 static void
21124 {
21129 /* Clear the TYPE_SPECIFIER_SEQ. */
21132 /* In the context of a trailing return type, enum E { } is an
21133 elaborated-type-specifier followed by a function-body, not an
21134 enum-specifier. */
21138 /* Parse the type-specifiers and attributes. */
21140 {
21141 tree type_specifier;
21144 /* Check for attributes first. */
21146 {
21151 }
21153 /* record the token of the beginning of the type specifier seq,
21154 for error reporting purposes*/
21158 /* Look for the type-specifier. */
21160 flags,
21161 type_specifier_seq,
21163 NULL,
21166 {
21167 /* If the first type-specifier could not be found, this is not a
21168 type-specifier-seq at all. */
21170 {
21171 /* Set in_declarator_p to avoid skipping to the semicolon. */
21183 }
21184 /* If subsequent type-specifiers could not be found, the
21185 type-specifier-seq is complete. */
21187 }
21190 /* The standard says that a condition can be:
21192 type-specifier-seq declarator = assignment-expression
21194 However, given:
21196 struct S {};
21197 if (int S = ...)
21199 we should treat the "S" as a declarator, not as a
21200 type-specifier. The standard doesn't say that explicitly for
21201 type-specifier-seq, but it does say that for
21202 decl-specifier-seq in an ordinary declaration. Perhaps it
21203 would be clearer just to allow a decl-specifier-seq here, and
21204 then add a semantic restriction that if any decl-specifiers
21205 that are not type-specifiers appear, the program is invalid. */
21208 }
21209 }
21211 /* Return whether the function currently being declared has an associated
21212 template parameter list. */
21214 static bool
21216 {
21229 }
21231 /* Parse a parameter-declaration-clause.
21233 parameter-declaration-clause:
21234 parameter-declaration-list [opt] ... [opt]
21235 parameter-declaration-list , ...
21237 Returns a representation for the parameter declarations. A return
21238 value of NULL indicates a parameter-declaration-clause consisting
21239 only of an ellipsis. */
21241 static tree
21243 {
21244 tree parameters;
21253 parser->auto_is_implicit_function_template_parm_p
21255 }
21261 && !processing_template_parmlist
21267 /* Peek at the next token. */
21269 /* Check for trivial parameter-declaration-clauses. */
21271 {
21272 /* Consume the `...' token. */
21275 }
21277 /* There are no parameters. */
21278 {
21279 #ifndef NO_IMPLICIT_EXTERN_C
21284 else
21285 #endif
21287 }
21288 /* Check for `(void)', too, which is a special case. */
21292 {
21293 /* Consume the `void' token. */
21295 /* There are no parameters. */
21297 }
21299 /* Parse the parameter-declaration-list. */
21301 /* If a parse error occurred while parsing the
21302 parameter-declaration-list, then the entire
21303 parameter-declaration-clause is erroneous. */
21307 /* Peek at the next token. */
21309 /* If it's a `,', the clause should terminate with an ellipsis. */
21311 {
21312 /* Consume the `,'. */
21314 /* Expect an ellipsis. */
21315 ellipsis_p
21317 }
21318 /* It might also be `...' if the optional trailing `,' was
21319 omitted. */
21321 {
21322 /* Consume the `...' token. */
21324 /* And remember that we saw it. */
21326 }
21327 else
21330 /* Finish the parameter list. */
21335 }
21337 /* Parse a parameter-declaration-list.
21339 parameter-declaration-list:
21340 parameter-declaration
21341 parameter-declaration-list , parameter-declaration
21343 Returns a representation of the parameter-declaration-list, as for
21344 cp_parser_parameter_declaration_clause. However, the
21345 `void_list_node' is never appended to the list. Upon return,
21346 *IS_ERROR will be true iff an error occurred. */
21348 static tree
21350 {
21356 /* Assume all will go well. */
21358 /* The special considerations that apply to a function within an
21359 unbraced linkage specifications do not apply to the parameters
21360 to the function. */
21361 saved_in_unbraced_linkage_specification_p
21365 /* Look for more parameters. */
21367 {
21375 /* Parse the parameter. */
21376 parameter
21381 /* We don't know yet if the enclosing context is deprecated, so wait
21382 and warn in grokparms if appropriate. */
21386 {
21387 /* If a function parameter pack was specified and an implicit template
21388 parameter was introduced during cp_parser_parameter_declaration,
21389 change any implicit parameters introduced into packs. */
21393 {
21401 }
21405 PARM,
21410 }
21414 /* If a parse error occurred parsing the parameter declaration,
21415 then the entire parameter-declaration-list is erroneous. */
21417 {
21421 }
21431 {
21435 }
21437 /* Add the new parameter to the list. */
21441 /* Peek at the next token. */
21444 /* These are for Objective-C++ */
21447 /* The parameter-declaration-list is complete. */
21450 {
21453 /* Peek at the next token. */
21455 /* If it's an ellipsis, then the list is complete. */
21458 /* Otherwise, there must be more parameters. Consume the
21459 `,'. */
21461 /* When parsing something like:
21463 int i(float f, double d)
21465 we can tell after seeing the declaration for "f" that we
21466 are not looking at an initialization of a variable "i",
21467 but rather at the declaration of a function "i".
21469 Due to the fact that the parsing of template arguments
21470 (as specified to a template-id) requires backtracking we
21471 cannot use this technique when inside a template argument
21472 list. */
21476 /* However, a parameter-declaration of the form
21477 "float(f)" (which is a valid declaration of a
21478 parameter "f") can also be interpreted as an
21479 expression (the conversion of "f" to "float"). */
21482 }
21483 else
21484 {
21492 }
21493 }
21495 parser->in_unbraced_linkage_specification_p
21498 /* Reset implicit_template_scope if we are about to leave the function
21499 parameter list that introduced it. Note that for out-of-line member
21500 definitions, there will be one or more class scopes before we get to
21501 the template parameter scope. */
21505 {
21509 {
21512 }
21513 }
21516 }
21518 /* Parse a parameter declaration.
21520 parameter-declaration:
21521 decl-specifier-seq ... [opt] declarator
21522 decl-specifier-seq declarator = assignment-expression
21523 decl-specifier-seq ... [opt] abstract-declarator [opt]
21524 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21526 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21527 declares a template parameter. (In that case, a non-nested `>'
21528 token encountered during the parsing of the assignment-expression
21529 is not interpreted as a greater-than operator.)
21531 Returns a representation of the parameter, or NULL if an error
21532 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21533 true iff the declarator is of the form "(p)". */
21539 {
21541 cp_decl_specifier_seq decl_specifiers;
21543 tree default_argument;
21548 /* In a template parameter, `>' is not an operator.
21550 [temp.param]
21552 When parsing a default template-argument for a non-type
21553 template-parameter, the first non-nested `>' is taken as the end
21554 of the template parameter-list rather than a greater-than
21555 operator. */
21557 /* Type definitions may not appear in parameter types. */
21559 parser->type_definition_forbidden_message
21562 /* Parse the declaration-specifiers. */
21565 CP_PARSER_FLAGS_NONE,
21569 /* Complain about missing 'typename' or other invalid type names. */
21574 /* If an error occurred, there's no reason to attempt to parse the
21575 rest of the declaration. */
21577 {
21580 }
21582 /* Peek at the next token. */
21585 /* If the next token is a `)', `,', `=', `>', or `...', then there
21586 is no declarator. However, when variadic templates are enabled,
21587 there may be a declarator following `...'. */
21592 {
21596 }
21597 /* Otherwise, there should be a declarator. */
21598 else
21599 {
21603 /* After seeing a decl-specifier-seq, if the next token is not a
21604 "(", there is no possibility that the code is a valid
21605 expression. Therefore, if parsing tentatively, we commit at
21606 this point. */
21608 /* In an expression context, having seen:
21610 (int((char ...
21612 we cannot be sure whether we are looking at a
21613 function-type (taking a "char" as a parameter) or a cast
21614 of some object of type "char" to "int". */
21620 /* Parse the declarator. */
21623 CP_PARSER_DECLARATOR_EITHER,
21625 parenthesized_p,
21629 /* After the declarator, allow more attributes. */
21630 decl_specifiers.attributes
21634 /* If the declarator is a template parameter pack, remember that and
21635 clear the flag in the declarator itself so we don't get errors
21636 from grokdeclarator. */
21638 {
21641 }
21642 }
21644 /* If the next token is an ellipsis, and we have not seen a declarator
21645 name, and if either the type of the declarator contains parameter
21646 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21647 for, eg, abbreviated integral type names), then we actually have a
21648 parameter pack expansion expression. Otherwise, leave the ellipsis
21649 for a C-style variadic function. */
21652 {
21663 {
21664 /* Consume the `...'. */
21668 /* Build a pack expansion type */
21673 else
21675 }
21676 }
21678 /* The restriction on defining new types applies only to the type
21679 of the parameter, not to the default argument. */
21682 /* If the next token is `=', then process a default argument. */
21684 {
21687 /* If we are defining a class, then the tokens that make up the
21688 default argument must be saved and processed later. */
21694 // A constrained-type-specifier may declare a type template-parameter.
21696 default_argument
21699 // A constrained-type-specifier may declare a template-template-parameter.
21701 default_argument
21704 /* Outside of a class definition, we can just parse the
21705 assignment-expression. */
21706 else
21707 default_argument
21711 {
21713 "default arguments are only "
21715 }
21717 || template_parameter_pack_p
21720 {
21721 /* Find the name of the parameter pack. */
21728 template_parm_p
21734 else
21736 template_parm_p
21743 }
21744 }
21745 else
21748 /* Generate a location for the parameter, ranging from the start of the
21749 initial token to the end of the final token (using input_location for
21750 the latter, set up by cp_lexer_set_source_position_from_token when
21751 consuming tokens).
21753 If we have a identifier, then use it for the caret location, e.g.
21755 extern int callee (int one, int (*two)(int, int), float three);
21756 ~~~~~~^~~~~~~~~~~~~~
21758 otherwise, reuse the start location for the caret location e.g.:
21760 extern int callee (int one, int (*)(int, int), float three);
21761 ^~~~~~~~~~~~~~~~~
21763 */
21769 input_location);
21772 declarator,
21773 default_argument,
21774 param_loc,
21775 template_parameter_pack_p);
21776 }
21778 /* Parse a default argument and return it.
21780 TEMPLATE_PARM_P is true if this is a default argument for a
21781 non-type template parameter. */
21782 static tree
21784 {
21790 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21791 set correctly. */
21794 /* Local variable names (and the `this' keyword) may not
21795 appear in a default argument. */
21798 /* Parse the assignment-expression. */
21803 /* The "this" pointer is not valid in a default argument. */
21805 {
21810 }
21811 default_argument
21813 /* Restore the "this" pointer. */
21815 {
21818 }
21827 }
21829 /* Parse a function-body.
21831 function-body:
21832 compound_statement */
21834 static void
21836 {
21840 }
21842 /* Parse a ctor-initializer-opt followed by a function-body. Return
21843 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21844 is true we are parsing a function-try-block. */
21846 static void
21849 {
21856 /* Begin the function body. */
21858 /* Parse the optional ctor-initializer. */
21861 /* If we're parsing a constexpr constructor definition, we need
21862 to check that the constructor body is indeed empty. However,
21863 before we get to cp_parser_function_body lot of junk has been
21864 generated, so we can't just check that we have an empty block.
21865 Rather we take a snapshot of the outermost block, and check whether
21866 cp_parser_function_body changed its state. */
21868 {
21872 }
21873 /* Parse the function-body. */
21877 /* Finish the function body. */
21879 }
21881 /* Parse an initializer.
21883 initializer:
21884 = initializer-clause
21885 ( expression-list )
21887 Returns an expression representing the initializer. If no
21888 initializer is present, NULL_TREE is returned.
21890 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21891 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21892 set to TRUE if there is no initializer present. If there is an
21893 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21894 is set to true; otherwise it is set to false. */
21896 static tree
21899 {
21901 tree init;
21903 /* Peek at the next token. */
21906 /* Let our caller know whether or not this initializer was
21907 parenthesized. */
21909 /* Assume that the initializer is constant. */
21913 {
21914 /* Consume the `='. */
21916 /* Parse the initializer-clause. */
21918 }
21920 {
21925 non_constant_p);
21930 }
21932 {
21937 }
21938 else
21939 {
21940 /* Anything else is an error. */
21943 }
21949 }
21951 /* Parse an initializer-clause.
21953 initializer-clause:
21954 assignment-expression
21955 braced-init-list
21957 Returns an expression representing the initializer.
21959 If the `assignment-expression' production is used the value
21960 returned is simply a representation for the expression.
21962 Otherwise, calls cp_parser_braced_list. */
21964 static cp_expr
21966 {
21967 cp_expr initializer;
21969 /* Assume the expression is constant. */
21972 /* If it is not a `{', then we are looking at an
21973 assignment-expression. */
21975 {
21976 initializer
21979 non_constant_p);
21980 }
21981 else
21985 }
21987 /* Parse a brace-enclosed initializer list.
21989 braced-init-list:
21990 { initializer-list , [opt] }
21991 { }
21993 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21994 the elements of the initializer-list (or NULL, if the last
21995 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21996 NULL_TREE. There is no way to detect whether or not the optional
21997 trailing `,' was provided. NON_CONSTANT_P is as for
21998 cp_parser_initializer. */
22000 static cp_expr
22002 {
22003 tree initializer;
22006 /* Consume the `{' token. */
22007 matching_braces braces;
22009 /* Create a CONSTRUCTOR to represent the braced-initializer. */
22011 /* If it's not a `}', then there is a non-trivial initializer. */
22013 {
22014 /* Parse the initializer list. */
22017 /* A trailing `,' token is allowed. */
22020 }
22021 else
22023 /* Now, there should be a trailing `}'. */
22029 /* Build a location of the form:
22030 { ... }
22031 ^~~~~~~
22032 with caret==start at the open brace, finish at the close brace. */
22036 }
22038 /* Consume tokens up to, and including, the next non-nested closing `]'.
22039 Returns true iff we found a closing `]'. */
22041 static bool
22043 {
22047 {
22051 {
22054 /* If we've run out of tokens, then there is no closing `]'. */
22063 {
22066 }
22071 }
22073 /* Consume the token. */
22075 }
22076 }
22078 /* Return true if we are looking at an array-designator, false otherwise. */
22080 static bool
22082 {
22083 /* Consume the `['. */
22088 /* Skip tokens until the next token is a closing square bracket.
22089 If we find the closing `]', and the next token is a `=', then
22090 we are looking at an array designator. */
22091 bool array_designator_p
22095 /* Roll back the tokens we skipped. */
22099 }
22101 /* Parse an initializer-list.
22103 initializer-list:
22104 initializer-clause ... [opt]
22105 initializer-list , initializer-clause ... [opt]
22107 GNU Extension:
22109 initializer-list:
22110 designation initializer-clause ...[opt]
22111 initializer-list , designation initializer-clause ...[opt]
22113 designation:
22114 . identifier =
22115 identifier :
22116 [ constant-expression ] =
22118 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22119 for the initializer. If the INDEX of the elt is non-NULL, it is the
22120 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22121 as for cp_parser_initializer. */
22125 {
22128 /* Assume all of the expressions are constant. */
22131 /* Parse the rest of the list. */
22133 {
22135 tree designator;
22136 tree initializer;
22139 /* If the next token is an identifier and the following one is a
22140 colon, we are looking at the GNU designated-initializer
22141 syntax. */
22145 {
22146 /* Warn the user that they are using an extension. */
22149 /* Consume the identifier. */
22151 /* Consume the `:'. */
22153 }
22154 /* Also handle the C99 syntax, '. id ='. */
22159 {
22160 /* Warn the user that they are using an extension. */
22163 /* Consume the `.'. */
22165 /* Consume the identifier. */
22167 /* Consume the `='. */
22169 }
22170 /* Also handle C99 array designators, '[ const ] ='. */
22174 {
22175 /* In C++11, [ could start a lambda-introducer. */
22181 {
22184 }
22185 else
22186 {
22191 }
22197 }
22198 else
22201 /* Parse the initializer. */
22204 /* If any clause is non-constant, so is the entire initializer. */
22208 /* If we have an ellipsis, this is an initializer pack
22209 expansion. */
22211 {
22212 /* Consume the `...'. */
22215 /* Turn the initializer into an initializer expansion. */
22217 }
22219 /* Add it to the vector. */
22222 /* If the next token is not a comma, we have reached the end of
22223 the list. */
22227 /* Peek at the next token. */
22229 /* If the next token is a `}', then we're still done. An
22230 initializer-clause can have a trailing `,' after the
22231 initializer-list and before the closing `}'. */
22235 /* Consume the `,' token. */
22237 }
22240 }
22242 /* Classes [gram.class] */
22244 /* Parse a class-name.
22246 class-name:
22247 identifier
22248 template-id
22250 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22251 to indicate that names looked up in dependent types should be
22252 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22253 keyword has been used to indicate that the name that appears next
22254 is a template. TAG_TYPE indicates the explicit tag given before
22255 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22256 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22257 is the class being defined in a class-head. If ENUM_OK is TRUE,
22258 enum-names are also accepted.
22260 Returns the TYPE_DECL representing the class. */
22262 static tree
22271 {
22272 tree decl;
22273 tree scope;
22278 /* All class-names start with an identifier. */
22281 {
22284 }
22286 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22287 to a template-id, so we save it here. */
22292 /* Any name names a type if we're following the `typename' keyword
22293 in a qualified name where the enclosing scope is type-dependent. */
22296 /* Handle the common case (an identifier, but not a template-id)
22297 efficiently. */
22300 {
22304 /* Look for the identifier. */
22308 /* If the next token isn't an identifier, we are certainly not
22309 looking at a class-name. */
22312 /* If we know this is a type-name, there's no need to look it
22313 up. */
22316 else
22317 {
22318 tree ambiguous_decls;
22319 /* If we already know that this lookup is ambiguous, then
22320 we've already issued an error message; there's no reason
22321 to check again. */
22323 {
22326 }
22327 /* If the next token is a `::', then the name must be a type
22328 name.
22330 [basic.lookup.qual]
22332 During the lookup for a name preceding the :: scope
22333 resolution operator, object, function, and enumerator
22334 names are ignored. */
22337 /* Look up the name. */
22339 tag_type,
22342 check_dependency_p,
22346 {
22350 }
22351 }
22352 }
22353 else
22354 {
22355 /* Try a template-id. */
22357 check_dependency_p,
22358 tag_type,
22359 is_declaration);
22362 }
22366 /* If this is a typename, create a TYPENAME_TYPE. */
22368 {
22373 }
22377 /* Check to see that it is really the name of a class. */
22381 /* Situations like this:
22383 template <typename T> struct A {
22384 typename T::template X<int>::I i;
22385 };
22387 are problematic. Is `T::template X<int>' a class-name? The
22388 standard does not seem to be definitive, but there is no other
22389 valid interpretation of the following `::'. Therefore, those
22390 names are considered class-names. */
22391 {
22395 }
22400 /* In Objective-C 2.0, a classname followed by '.' starts a
22401 dot-syntax expression, and it's not a type-name. */
22413 }
22415 /* Parse a class-specifier.
22417 class-specifier:
22418 class-head { member-specification [opt] }
22420 Returns the TREE_TYPE representing the class. */
22422 static tree
22424 {
22425 tree type;
22439 /* Parse the class-head. */
22442 /* If the class-head was a semantic disaster, skip the entire body
22443 of the class. */
22445 {
22449 }
22451 /* Look for the `{'. */
22452 matching_braces braces;
22454 {
22457 }
22462 /* Issue an error message if type-definitions are forbidden here. */
22464 /* Remember that we are defining one more class. */
22466 /* Inside the class, surrounding template-parameter-lists do not
22467 apply. */
22468 saved_num_template_parameter_lists
22471 /* We are not in a function body. */
22474 /* Or in a loop. */
22477 /* Or in a switch. */
22480 /* We are not immediately inside an extern "lang" block. */
22481 saved_in_unbraced_linkage_specification_p
22485 // Associate constraints with the type.
22489 /* Start the class. */
22491 {
22494 }
22498 /* If the type is erroneous, skip the entire body of the class. */
22500 else
22501 /* Parse the member-specification. */
22504 /* Look for the trailing `}'. */
22506 /* Look for trailing attributes to apply to this class. */
22514 /* We've finished a type definition. Check for the common syntax
22515 error of forgetting a semicolon after the definition. We need to
22516 be careful, as we can't just check for not-a-semicolon and be done
22517 with it; the user might have typed:
22519 class X { } c = ...;
22520 class X { } *p = ...;
22522 and so forth. Instead, enumerate all the possible tokens that
22523 might follow this production; if we don't see one of them, then
22524 complain and silently insert the semicolon. */
22525 {
22530 /* Don't try to parse c++11 attributes here. As per the
22531 grammar, that should be a task for
22532 cp_parser_decl_specifier_seq. */
22536 {
22547 /* While it's legal for type qualifiers and storage class
22548 specifiers to follow type definitions in the grammar, only
22549 compiler testsuites contain code like that. Assume that if
22550 we see such code, then what we're really seeing is a case
22551 like:
22553 class X { }
22554 const <type> var = ...;
22556 or
22558 class Y { }
22559 static <type> func (...) ...
22561 i.e. the qualifier or specifier applies to the next
22562 declaration. To do so, however, we need to look ahead one
22563 more token to see if *that* token is a type specifier.
22565 This code could be improved to handle:
22567 class Z { }
22568 static const <type> var = ...; */
22571 {
22574 /* Handling user-defined types here would be nice, but very
22575 tricky. */
22576 want_semicolon
22579 }
22583 }
22585 /* If we don't have a type, then something is very wrong and we
22586 shouldn't try to do anything clever. Likewise for not seeing the
22587 closing brace. */
22589 {
22590 /* Locate the closing brace. */
22591 cp_token_position prev
22596 /* We want to suggest insertion of a ';' immediately *after* the
22597 closing brace, so, if we can, offset the location by 1 column. */
22604 /* If we successfully offset the location, suggest the fix-it. */
22617 else
22620 /* Unget one token and smash it to look as though we encountered
22621 a semicolon in the input stream. */
22626 }
22627 }
22629 /* If this class is not itself within the scope of another class,
22630 then we need to parse the bodies of all of the queued function
22631 definitions. Note that the queued functions defined in a class
22632 are not always processed immediately following the
22633 class-specifier for that class. Consider:
22635 struct A {
22636 struct B { void f() { sizeof (A); } };
22637 };
22639 If `f' were processed before the processing of `A' were
22640 completed, there would be no way to compute the size of `A'.
22641 Note that the nesting we are interested in here is lexical --
22642 not the semantic nesting given by TYPE_CONTEXT. In particular,
22643 for:
22645 struct A { struct B; };
22646 struct A::B { void f() { } };
22648 there is no need to delay the parsing of `A::B::f'. */
22650 {
22651 tree decl;
22658 /* In a first pass, parse default arguments to the functions.
22659 Then, in a second pass, parse the bodies of the functions.
22660 This two-phased approach handles cases like:
22662 struct S {
22663 void f() { g(); }
22664 void g(int i = 3);
22665 };
22667 */
22669 {
22671 /* If there are default arguments that have not yet been processed,
22672 take care of them now. */
22674 {
22679 }
22680 /* Make sure that any template parameters are in scope. */
22682 /* Parse the default argument expressions. */
22684 /* Remove any template parameters from the symbol table. */
22686 }
22688 /* Now parse any NSDMIs. */
22692 {
22694 {
22699 }
22702 }
22709 /* Now do some post-NSDMI bookkeeping. */
22715 /* Now parse the body of the functions. */
22717 {
22718 /* OpenMP UDRs need to be parsed before all other functions. */
22725 }
22726 else
22730 }
22731 else
22734 /* Put back any saved access checks. */
22737 /* Restore saved state. */
22741 parser->num_template_parameter_lists
22743 parser->in_unbraced_linkage_specification_p
22747 }
22749 static tree
22751 {
22752 tree ret;
22757 }
22759 /* Parse a class-head.
22761 class-head:
22762 class-key identifier [opt] base-clause [opt]
22763 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22764 class-key nested-name-specifier [opt] template-id
22765 base-clause [opt]
22767 class-virt-specifier:
22768 final
22770 GNU Extensions:
22771 class-key attributes identifier [opt] base-clause [opt]
22772 class-key attributes nested-name-specifier identifier base-clause [opt]
22773 class-key attributes nested-name-specifier [opt] template-id
22774 base-clause [opt]
22776 Upon return BASES is initialized to the list of base classes (or
22777 NULL, if there are none) in the same form returned by
22778 cp_parser_base_clause.
22780 Returns the TYPE of the indicated class. Sets
22781 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22782 involving a nested-name-specifier was used, and FALSE otherwise.
22784 Returns error_mark_node if this is not a class-head.
22786 Returns NULL_TREE if the class-head is syntactically valid, but
22787 semantically invalid in a way that means we should skip the entire
22788 body of the class. */
22790 static tree
22793 {
22794 tree nested_name_specifier;
22798 tree attributes;
22799 tree bases;
22809 /* Assume no nested-name-specifier will be present. */
22811 /* Assume no template parameter lists will be used in defining the
22812 type. */
22816 /* Look for the class-key. */
22823 /* Parse the attributes. */
22826 /* If the next token is `::', that is invalid -- but sometimes
22827 people do try to write:
22829 struct ::S {};
22831 Handle this gracefully by accepting the extra qualifier, and then
22832 issuing an error about it later if this really is a
22833 class-head. If it turns out just to be an elaborated type
22834 specifier, remain silent. */
22840 /* Determine the name of the class. Begin by looking for an
22841 optional nested-name-specifier. */
22843 nested_name_specifier
22849 /* If there was a nested-name-specifier, then there *must* be an
22850 identifier. */
22855 {
22857 /* Although the grammar says `identifier', it really means
22858 `class-name' or `template-name'. You are only allowed to
22859 define a class that has already been declared with this
22860 syntax.
22862 The proposed resolution for Core Issue 180 says that wherever
22863 you see `class T::X' you should treat `X' as a type-name.
22865 It is OK to define an inaccessible class; for example:
22867 class A { class B; };
22868 class A::B {};
22870 We do not know if we will see a class-name, or a
22871 template-name. We look for a class-name first, in case the
22872 class-name is a template-id; if we looked for the
22873 template-name first we would stop after the template-name. */
22880 class_type,
22884 /* If that didn't work, ignore the nested-name-specifier. */
22886 {
22892 }
22893 /* If we could not find a corresponding TYPE, treat this
22894 declaration like an unqualified declaration. */
22897 /* Otherwise, count the number of templates used in TYPE and its
22898 containing scopes. */
22899 else
22900 {
22901 tree scope;
22913 }
22914 }
22915 /* Otherwise, the identifier is optional. */
22916 else
22917 {
22918 /* We don't know whether what comes next is a template-id,
22919 an identifier, or nothing at all. */
22921 /* Check for a template-id. */
22926 class_key,
22928 /* If that didn't work, it could still be an identifier. */
22930 {
22932 {
22935 }
22936 else
22938 }
22939 else
22940 {
22943 }
22944 }
22949 {
22951 class_key,
22953 }
22956 /* If it's not a `:' or a `{' then we can't really be looking at a
22957 class-head, since a class-head only appears as part of a
22958 class-specifier. We have to detect this situation before calling
22959 xref_tag, since that has irreversible side-effects. */
22961 {
22965 }
22967 /* At this point, we're going ahead with the class-specifier, even
22968 if some other problem occurs. */
22971 {
22976 }
22977 /* Issue the error about the overly-qualified name now. */
22979 {
22984 }
22986 {
22991 }
22993 {
22994 tree scope;
22997 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22998 keyword template shall not appear at the top level. */
23002 /* Reject typedef-names in class heads. */
23004 {
23007 type);
23010 }
23012 /* Figure out in what scope the declaration is being placed. */
23014 /* If that scope does not contain the scope in which the
23015 class was originally declared, the program is invalid. */
23017 {
23020 "declaration of %qD in namespace %qD which does not "
23023 else
23029 }
23030 /* [dcl.meaning]
23032 A declarator-id shall not be qualified except for the
23033 definition of a ... nested class outside of its class
23034 ... [or] the definition or explicit instantiation of a
23035 class member of a namespace outside of its namespace. */
23037 {
23042 }
23043 }
23044 /* An explicit-specialization must be preceded by "template <>". If
23045 it is not, try to recover gracefully. */
23048 && !processing_template_parmlist
23050 {
23051 /* Build a location of this form:
23052 struct typename <ARGS>
23053 ^~~~~~~~~~~~~~~~~~~~~~
23054 with caret==start at the start token, and
23055 finishing at the end of the type. */
23056 location_t reported_loc
23058 class_head_start_location,
23064 "an explicit specialization must be preceded by"
23067 /* Take the same action that would have been taken by
23068 cp_parser_explicit_specialization. */
23071 }
23072 /* There must be no "return" statements between this point and the
23073 end of this function; set "type "to the correct return value and
23074 use "goto done;" to return. */
23075 /* Make sure that the right number of template parameters were
23076 present. */
23080 {
23081 /* If something went wrong, there is no point in even trying to
23082 process the class-definition. */
23085 }
23087 /* Look up the type. */
23089 {
23093 {
23097 }
23098 else
23099 {
23103 /* Check the scope while we still know whether or not we had a
23104 nested-name-specifier. */
23107 }
23110 }
23112 {
23113 tree class_type;
23115 /* Given:
23117 template <typename T> struct S { struct T };
23118 template <typename T> struct S<T>::T { };
23120 we will get a TYPENAME_TYPE when processing the definition of
23121 `S::T'. We need to resolve it to the actual type before we
23122 try to define it. */
23124 {
23129 else
23130 {
23133 }
23134 }
23138 {
23141 }
23144 /* Enter the scope indicated by the nested-name-specifier. */
23146 /* Get the canonical version of this type. */
23148 /* Call push_template_decl if it seems like we should be defining a
23149 template either from the template headers or the type we're
23150 defining, so that we diagnose both extra and missing headers. */
23154 {
23157 {
23160 }
23161 }
23165 }
23167 {
23168 /* If the class was unnamed, create a dummy name. */
23172 ? ts_within_enclosing_non_class
23176 }
23178 /* Indicate whether this class was declared as a `class' or as a
23179 `struct'. */
23184 /* If this type was already complete, and we see another definition,
23185 that's an error. */
23187 {
23189 type);
23191 type);
23194 }
23199 {
23200 /* Apply attributes now, before any use of the class as a template
23201 argument in its base list. */
23204 }
23206 /* We will have entered the scope containing the class; the names of
23207 base classes should be looked up in that context. For example:
23209 struct A { struct B {}; struct C; };
23210 struct A::C : B {};
23212 is valid. */
23214 /* Get the list of base-classes, if there is one. */
23216 {
23217 /* PR59482: enter the class scope so that base-specifiers are looked
23218 up correctly. */
23222 /* PR59482: get out of the previously pushed class scope so that the
23223 subsequent pops pop the right thing. */
23226 }
23227 else
23230 /* If we're really defining a class, process the base classes.
23231 If they're invalid, fail. */
23235 done:
23236 /* Leave the scope given by the nested-name-specifier. We will
23237 enter the class scope itself while processing the members. */
23242 {
23245 }
23251 out:
23254 }
23256 /* Parse a class-key.
23258 class-key:
23259 class
23260 struct
23261 union
23263 Returns the kind of class-key specified, or none_type to indicate
23264 error. */
23266 static enum tag_types
23268 {
23272 /* Look for the class-key. */
23277 /* Check to see if the TOKEN is a class-key. */
23282 }
23284 /* Parse a type-parameter-key.
23286 type-parameter-key:
23287 class
23288 typename
23289 */
23291 static void
23293 {
23294 /* Look for the type-parameter-key. */
23298 {
23301 /* typename is not allowed in a template template parameter
23302 by the standard until C++17. */
23304 "ISO C++ forbids typename key in template template parameter;"
23306 }
23307 else
23311 }
23313 /* Parse an (optional) member-specification.
23315 member-specification:
23316 member-declaration member-specification [opt]
23317 access-specifier : member-specification [opt] */
23319 static void
23321 {
23323 {
23327 /* Peek at the next token. */
23329 /* If it's a `}', or EOF then we've seen all the members. */
23335 /* See if this token is a keyword. */
23338 {
23342 /* Consume the access-specifier. */
23344 /* Remember which access-specifier is active. */
23346 /* Look for the `:'. */
23351 /* Accept #pragmas at class scope. */
23353 {
23356 }
23358 /* Otherwise, the next construction must be a
23359 member-declaration. */
23361 }
23362 }
23363 }
23365 /* Parse a member-declaration.
23367 member-declaration:
23368 decl-specifier-seq [opt] member-declarator-list [opt] ;
23369 function-definition ; [opt]
23370 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23371 using-declaration
23372 template-declaration
23373 alias-declaration
23375 member-declarator-list:
23376 member-declarator
23377 member-declarator-list , member-declarator
23379 member-declarator:
23380 declarator pure-specifier [opt]
23381 declarator constant-initializer [opt]
23382 identifier [opt] : constant-expression
23384 GNU Extensions:
23386 member-declaration:
23387 __extension__ member-declaration
23389 member-declarator:
23390 declarator attributes [opt] pure-specifier [opt]
23391 declarator attributes [opt] constant-initializer [opt]
23392 identifier [opt] attributes [opt] : constant-expression
23394 C++0x Extensions:
23396 member-declaration:
23397 static_assert-declaration */
23399 static void
23401 {
23402 cp_decl_specifier_seq decl_specifiers;
23403 tree prefix_attributes;
23404 tree decl;
23413 /* Check for the `__extension__' keyword. */
23415 {
23416 /* Recurse. */
23418 /* Restore the old value of the PEDANTIC flag. */
23422 }
23424 /* Check for a template-declaration. */
23426 {
23427 /* An explicit specialization here is an error condition, and we
23428 expect the specialization handler to detect and report this. */
23432 else
23436 }
23437 /* Check for a template introduction. */
23441 /* Check for a using-declaration. */
23443 {
23445 {
23446 /* Parse the using-declaration. */
23450 }
23451 else
23452 {
23453 tree decl;
23457 /* Note that if we actually see the '=' token after the
23458 identifier, cp_parser_alias_declaration commits the
23459 tentative parse. In that case, we really expect an
23460 alias-declaration. Otherwise, we expect a using
23461 declaration. */
23462 alias_decl_expected =
23468 else
23472 }
23473 }
23475 /* Check for @defs. */
23477 {
23482 {
23487 }
23489 }
23491 /* If the next token is `static_assert' we have a static assertion. */
23493 {
23496 }
23503 /* Parse the decl-specifier-seq. */
23506 CP_PARSER_FLAGS_OPTIONAL,
23509 /* Check for an invalid type-name. */
23513 /* If there is no declarator, then the decl-specifier-seq should
23514 specify a type. */
23516 {
23517 /* If there was no decl-specifier-seq, and the next token is a
23518 `;', then we have something like:
23520 struct S { ; };
23522 [class.mem]
23524 Each member-declaration shall declare at least one member
23525 name of the class. */
23527 {
23530 {
23534 }
23535 }
23536 else
23537 {
23538 tree type;
23540 /* See if this declaration is a friend. */
23542 /* If there were decl-specifiers, check to see if there was
23543 a class-declaration. */
23546 /* Nested classes have already been added to the class, but
23547 a `friend' needs to be explicitly registered. */
23549 {
23550 /* If the `friend' keyword was present, the friend must
23551 be introduced with a class-key. */
23554 "in C++03 a class-key must be used "
23556 /* In this case:
23558 template <typename T> struct A {
23559 friend struct A<T>::B;
23560 };
23562 A<T>::B will be represented by a TYPENAME_TYPE, and
23563 therefore not recognized by check_tag_decl. */
23565 {
23569 }
23572 "friend declaration does not name a class or "
23574 else
23577 }
23578 /* If there is no TYPE, an error message will already have
23579 been issued. */
23581 ;
23582 /* An anonymous aggregate has to be handled specially; such
23583 a declaration really declares a data member (with a
23584 particular type), as opposed to a nested class. */
23586 {
23587 /* C++11 9.5/6. */
23590 "a storage class on an anonymous aggregate "
23593 /* Remove constructors and such from TYPE, now that we
23594 know it is an anonymous aggregate. */
23596 /* And make the corresponding data member. */
23599 /* Add it to the class. */
23601 }
23602 else
23603 cp_parser_check_access_in_redeclaration
23606 }
23607 }
23608 else
23609 {
23612 /* Clear attributes from the decl_specifiers but keep them
23613 around as prefix attributes that apply them to the entity
23614 being declared. */
23618 /* See if these declarations will be friends. */
23621 /* Keep going until we hit the `;' at the end of the
23622 declaration. */
23624 {
23626 tree first_attribute;
23627 tree initializer;
23631 /* Peek at the next token. */
23634 /* The following code wants to know early if it is a bit-field
23635 or some other declaration. Attributes can appear before
23636 the `:' token, but are hopefully rare enough that the
23637 simplicity of the tentative lookup pays off. */
23642 {
23650 }
23652 /* Check for a bitfield declaration. */
23658 {
23659 tree identifier;
23660 tree width;
23665 else
23668 /* Look for attributes that apply to the bitfield. */
23671 /* Consume the `:' token. */
23674 /* Get the width of the bitfield. */
23678 /* In C++2A and as extension for C++11 and above we allow
23679 default member initializers for bit-fields. */
23684 CPP_OPEN_BRACE)))
23685 {
23686 location_t loc
23692 "default member initializers for bit-fields "
23693 "only available with -std=c++2a or "
23698 {
23702 }
23703 }
23704 else
23705 {
23706 /* Look for attributes that apply to the bitfield after
23707 the `:' token and width. This is where GCC used to
23708 parse attributes in the past, pedwarn if there is
23709 a std attribute. */
23712 "ISO C++ allows bit-field attributes only "
23716 }
23720 /* Remember which attributes are prefix attributes and
23721 which are not. */
23723 /* Combine the attributes. */
23726 /* Create the bitfield declaration. */
23729 identifier,
23730 sfk_none)
23734 attributes);
23735 }
23736 else
23737 {
23739 tree asm_specification;
23742 /* Parse the declarator. */
23743 declarator
23748 friend_p);
23750 /* If something went wrong parsing the declarator, make sure
23751 that we at least consume some tokens. */
23753 {
23754 /* Skip to the end of the statement. */
23756 /* If the next token is not a semicolon, that is
23757 probably because we just skipped over the body of
23758 a function. So, we consume a semicolon if
23759 present, but do not issue an error message if it
23760 is not present. */
23762 CPP_SEMICOLON))
23765 }
23768 cp_parser_check_for_definition_in_return_type
23772 /* Look for an asm-specification. */
23774 /* Look for attributes that apply to the declaration. */
23776 /* Remember which attributes are prefix attributes and
23777 which are not. */
23779 /* Combine the attributes. */
23782 /* If it's an `=', then we have a constant-initializer or a
23783 pure-specifier. It is not correct to parse the
23784 initializer before registering the member declaration
23785 since the member declaration should be in scope while
23786 its initializer is processed. However, the rest of the
23787 front end does not yet provide an interface that allows
23788 us to handle this correctly. */
23790 {
23791 /* In [class.mem]:
23793 A pure-specifier shall be used only in the declaration of
23794 a virtual function.
23796 A member-declarator can contain a constant-initializer
23797 only if it declares a static member of integral or
23798 enumeration type.
23800 Therefore, if the DECLARATOR is for a function, we look
23801 for a pure-specifier; otherwise, we look for a
23802 constant-initializer. When we call `grokfield', it will
23803 perform more stringent semantics checks. */
23815 {
23817 /* Don't require a constant rvalue in C++11, since we
23818 might want a reference constant. We'll enforce
23819 constancy later. */
23821 /* Parse the initializer. */
23824 }
23825 else
23826 /* Parse the initializer. */
23828 }
23831 {
23835 else
23837 }
23838 /* Otherwise, there is no initializer. */
23839 else
23842 /* See if we are probably looking at a function
23843 definition. We are certainly not looking at a
23844 member-declarator. Calling `grokfield' has
23845 side-effects, so we must not do it unless we are sure
23846 that we are looking at a member-declarator. */
23849 {
23850 /* The grammar does not allow a pure-specifier to be
23851 used when a member function is defined. (It is
23852 possible that this fact is an oversight in the
23853 standard, since a pure function may be defined
23854 outside of the class-specifier. */
23860 declarator,
23861 attributes);
23864 /* If the member was not a friend, declare it here. */
23867 /* Peek at the next token. */
23869 /* If the next token is a semicolon, consume it. */
23871 {
23872 location_t semicolon_loc
23877 "extra %<;%> after in-class "
23879 }
23881 }
23882 else
23885 /* Create the declaration. */
23890 {
23893 else
23895 }
23896 }
23901 /* Reset PREFIX_ATTRIBUTES. */
23907 /* If there is any qualification still in effect, clear it
23908 now; we will be starting fresh with the next declarator. */
23912 /* If it's a `,', then there are more declarators. */
23914 {
23917 {
23923 }
23924 }
23925 /* If the next token isn't a `;', then we have a parse error. */
23927 CPP_SEMICOLON))
23928 {
23929 /* The next token might be a ways away from where the
23930 actual semicolon is missing. Find the previous token
23931 and use that for our error position. */
23938 /* Assume that the user meant to provide a semicolon. If
23939 we were to cp_parser_skip_to_end_of_statement, we might
23940 skip to a semicolon inside a member function definition
23941 and issue nonsensical error messages. */
23943 }
23946 {
23947 /* Add DECL to the list of members. */
23949 /* Explicitly include, eg, NSDMIs, for better error
23950 recovery (c++/58650). */
23958 /* Add DECL to the queue of NSDMI to be parsed later. */
23960 }
23964 }
23965 }
23968 out:
23970 }
23972 /* Parse a pure-specifier.
23974 pure-specifier:
23975 = 0
23977 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23978 Otherwise, ERROR_MARK_NODE is returned. */
23980 static tree
23982 {
23985 /* Look for the `=' token. */
23988 /* Look for the `0' token. */
23997 /* Accept = default or = delete in c++0x mode. */
24000 {
24003 }
24005 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
24007 {
24012 }
24014 {
24017 }
24020 }
24022 /* Parse a constant-initializer.
24024 constant-initializer:
24025 = constant-expression
24027 Returns a representation of the constant-expression. */
24029 static tree
24031 {
24032 /* Look for the `=' token. */
24036 /* It is invalid to write:
24038 struct S { static const int i = { 7 }; };
24040 */
24042 {
24045 /* Consume the opening brace. */
24046 matching_braces braces;
24048 /* Skip the initializer. */
24050 /* Look for the trailing `}'. */
24054 }
24057 }
24059 /* Derived classes [gram.class.derived] */
24061 /* Parse a base-clause.
24063 base-clause:
24064 : base-specifier-list
24066 base-specifier-list:
24067 base-specifier ... [opt]
24068 base-specifier-list , base-specifier ... [opt]
24070 Returns a TREE_LIST representing the base-classes, in the order in
24071 which they were declared. The representation of each node is as
24072 described by cp_parser_base_specifier.
24074 In the case that no bases are specified, this function will return
24075 NULL_TREE, not ERROR_MARK_NODE. */
24077 static tree
24079 {
24082 /* Look for the `:' that begins the list. */
24085 /* Scan the base-specifier-list. */
24087 {
24089 tree base;
24092 /* Look for the base-specifier. */
24094 /* Look for the (optional) ellipsis. */
24096 {
24097 /* Consume the `...'. */
24101 }
24103 /* Add BASE to the front of the list. */
24105 {
24107 /* Make this a pack expansion type. */
24111 {
24114 }
24115 }
24116 /* Peek at the next token. */
24118 /* If it's not a comma, then the list is complete. */
24121 /* Consume the `,'. */
24123 }
24125 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24126 base class had a qualified name. However, the next name that
24127 appears is certainly not qualified. */
24133 }
24135 /* Parse a base-specifier.
24137 base-specifier:
24138 :: [opt] nested-name-specifier [opt] class-name
24139 virtual access-specifier [opt] :: [opt] nested-name-specifier
24140 [opt] class-name
24141 access-specifier virtual [opt] :: [opt] nested-name-specifier
24142 [opt] class-name
24144 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24145 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24146 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24147 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24149 static tree
24151 {
24159 tree type;
24161 /* Process the optional `virtual' and `access-specifier'. */
24163 {
24164 /* Peek at the next token. */
24166 /* Process `virtual'. */
24168 {
24170 /* If `virtual' appears more than once, issue an error. */
24172 {
24176 }
24180 /* Consume the `virtual' token. */
24188 /* If more than one access specifier appears, issue an
24189 error. */
24192 {
24196 }
24200 /* Consume the access-specifier. */
24208 }
24209 }
24210 /* It is not uncommon to see programs mechanically, erroneously, use
24211 the 'typename' keyword to denote (dependent) qualified types
24212 as base classes. */
24214 {
24219 else
24221 "keyword %<typename%> not allowed in this context "
24224 }
24226 /* Look for the optional `::' operator. */
24228 /* Look for the nested-name-specifier. The simplest way to
24229 implement:
24231 [temp.res]
24233 The keyword `typename' is not permitted in a base-specifier or
24234 mem-initializer; in these contexts a qualified name that
24235 depends on a template-parameter is implicitly assumed to be a
24236 type name.
24238 is to pretend that we have seen the `typename' keyword at this
24239 point. */
24245 /* If the base class is given by a qualified name, assume that names
24246 we see are type names or templates, as appropriate. */
24252 /* DR 950 allows decltype as a base-specifier. */
24254 else
24255 {
24256 /* Otherwise, look for the class-name. */
24258 class_scope_p,
24259 template_p,
24260 typename_type,
24265 }
24271 }
24273 /* Exception handling [gram.exception] */
24275 /* Parse an (optional) noexcept-specification.
24277 noexcept-specification:
24278 noexcept ( constant-expression ) [opt]
24280 If no noexcept-specification is present, returns NULL_TREE.
24281 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24282 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24283 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24284 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24285 in which case a boolean condition is returned instead. */
24287 static tree
24292 {
24296 /* Peek at the next token. */
24299 /* Is it a noexcept-specification? */
24301 {
24302 tree expr;
24306 {
24307 matching_parens parens;
24311 {
24312 /* Types may not be defined in an exception-specification. */
24314 parser->type_definition_forbidden_message
24319 /* Restore the saved message. */
24321 }
24322 else
24323 {
24326 }
24329 }
24330 else
24331 {
24335 }
24337 /* We cannot build a noexcept-spec right away because this will check
24338 that expr is a constexpr. */
24341 else
24343 }
24344 else
24346 }
24348 /* Parse an (optional) exception-specification.
24350 exception-specification:
24351 throw ( type-id-list [opt] )
24353 Returns a TREE_LIST representing the exception-specification. The
24354 TREE_VALUE of each node is a type. */
24356 static tree
24358 {
24360 tree type_id_list;
24363 /* Peek at the next token. */
24366 /* Is it a noexcept-specification? */
24372 /* If it's not `throw', then there's no exception-specification. */
24378 /* Consume the `throw'. */
24381 /* Look for the `('. */
24382 matching_parens parens;
24385 /* Peek at the next token. */
24387 /* If it's not a `)', then there is a type-id-list. */
24389 {
24390 /* Types may not be defined in an exception-specification. */
24392 parser->type_definition_forbidden_message
24394 /* Parse the type-id-list. */
24396 /* Restore the saved message. */
24400 {
24404 }
24407 "dynamic exception specifications are deprecated in "
24409 }
24410 /* In C++17, throw() is equivalent to noexcept (true). throw()
24411 is deprecated in C++11 and above as well, but is still widely used,
24412 so don't warn about it yet. */
24415 else
24418 /* Look for the `)'. */
24422 }
24424 /* Parse an (optional) type-id-list.
24426 type-id-list:
24427 type-id ... [opt]
24428 type-id-list , type-id ... [opt]
24430 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24431 in the order that the types were presented. */
24433 static tree
24435 {
24439 {
24441 tree type;
24445 /* Get the next type-id. */
24447 /* Check for invalid 'auto'. */
24449 {
24453 }
24454 /* Parse the optional ellipsis. */
24456 {
24457 /* Consume the `...'. */
24460 /* Turn the type into a pack expansion expression. */
24462 }
24463 /* Add it to the list. */
24465 /* Peek at the next token. */
24467 /* If it is not a `,', we are done. */
24470 /* Consume the `,'. */
24472 }
24475 }
24477 /* Parse a try-block.
24479 try-block:
24480 try compound-statement handler-seq */
24482 static tree
24484 {
24485 tree try_block;
24499 }
24501 /* Parse a function-try-block.
24503 function-try-block:
24504 try ctor-initializer [opt] function-body handler-seq */
24506 static void
24508 {
24509 tree compound_stmt;
24510 tree try_block;
24512 /* Look for the `try' keyword. */
24515 /* Let the rest of the front end know where we are. */
24517 /* Parse the function-body. */
24518 cp_parser_ctor_initializer_opt_and_function_body
24520 /* We're done with the `try' part. */
24522 /* Parse the handlers. */
24524 /* We're done with the handlers. */
24526 }
24528 /* Parse a handler-seq.
24530 handler-seq:
24531 handler handler-seq [opt] */
24533 static void
24535 {
24537 {
24540 /* Parse the handler. */
24542 /* Peek at the next token. */
24544 /* If it's not `catch' then there are no more handlers. */
24547 }
24548 }
24550 /* Parse a handler.
24552 handler:
24553 catch ( exception-declaration ) compound-statement */
24555 static void
24557 {
24558 tree handler;
24559 tree declaration;
24563 matching_parens parens;
24570 }
24572 /* Parse an exception-declaration.
24574 exception-declaration:
24575 type-specifier-seq declarator
24576 type-specifier-seq abstract-declarator
24577 type-specifier-seq
24578 ...
24580 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24581 ellipsis variant is used. */
24583 static tree
24585 {
24586 cp_decl_specifier_seq type_specifiers;
24590 /* If it's an ellipsis, it's easy to handle. */
24592 {
24593 /* Consume the `...' token. */
24596 }
24598 /* Types may not be defined in exception-declarations. */
24600 parser->type_definition_forbidden_message
24603 /* Parse the type-specifier-seq. */
24607 /* If it's a `)', then there is no declarator. */
24610 else
24617 /* Restore the saved message. */
24624 }
24626 /* Parse a throw-expression.
24628 throw-expression:
24629 throw assignment-expression [opt]
24631 Returns a THROW_EXPR representing the throw-expression. */
24633 static tree
24635 {
24636 tree expression;
24641 /* Figure out whether or not there is an assignment-expression
24642 following the "throw" keyword. */
24650 else
24654 }
24656 /* GNU Extensions */
24658 /* Parse an (optional) asm-specification.
24660 asm-specification:
24661 asm ( string-literal )
24663 If the asm-specification is present, returns a STRING_CST
24664 corresponding to the string-literal. Otherwise, returns
24665 NULL_TREE. */
24667 static tree
24669 {
24671 tree asm_specification;
24673 /* Peek at the next token. */
24675 /* If the next token isn't the `asm' keyword, then there's no
24676 asm-specification. */
24680 /* Consume the `asm' token. */
24682 /* Look for the `('. */
24683 matching_parens parens;
24686 /* Look for the string-literal. */
24689 /* Look for the `)'. */
24693 }
24695 /* Parse an asm-operand-list.
24697 asm-operand-list:
24698 asm-operand
24699 asm-operand-list , asm-operand
24701 asm-operand:
24702 string-literal ( expression )
24703 [ string-literal ] string-literal ( expression )
24705 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24706 each node is the expression. The TREE_PURPOSE is itself a
24707 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24708 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24709 is a STRING_CST for the string literal before the parenthesis. Returns
24710 ERROR_MARK_NODE if any of the operands are invalid. */
24712 static tree
24714 {
24719 {
24720 tree string_literal;
24721 tree expression;
24722 tree name;
24725 {
24726 /* Consume the `[' token. */
24728 /* Read the operand name. */
24733 /* Look for the closing `]'. */
24735 }
24736 else
24738 /* Look for the string-literal. */
24741 /* Look for the `('. */
24742 matching_parens parens;
24744 /* Parse the expression. */
24746 /* Look for the `)'. */
24754 /* Add this operand to the list. */
24756 expression,
24757 asm_operands);
24758 /* If the next token is not a `,', there are no more
24759 operands. */
24762 /* Consume the `,'. */
24764 }
24767 }
24769 /* Parse an asm-clobber-list.
24771 asm-clobber-list:
24772 string-literal
24773 asm-clobber-list , string-literal
24775 Returns a TREE_LIST, indicating the clobbers in the order that they
24776 appeared. The TREE_VALUE of each node is a STRING_CST. */
24778 static tree
24780 {
24784 {
24785 tree string_literal;
24787 /* Look for the string literal. */
24789 /* Add it to the list. */
24791 /* If the next token is not a `,', then the list is
24792 complete. */
24795 /* Consume the `,' token. */
24797 }
24800 }
24802 /* Parse an asm-label-list.
24804 asm-label-list:
24805 identifier
24806 asm-label-list , identifier
24808 Returns a TREE_LIST, indicating the labels in the order that they
24809 appeared. The TREE_VALUE of each node is a label. */
24811 static tree
24813 {
24817 {
24820 /* Look for the identifier. */
24823 {
24826 {
24832 }
24833 }
24834 /* If the next token is not a `,', then the list is
24835 complete. */
24838 /* Consume the `,' token. */
24840 }
24843 }
24845 /* Return TRUE iff the next tokens in the stream are possibly the
24846 beginning of a GNU extension attribute. */
24848 static bool
24850 {
24852 }
24854 /* Return TRUE iff the next tokens in the stream are possibly the
24855 beginning of a standard C++-11 attribute specifier. */
24857 static bool
24859 {
24861 }
24863 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24864 beginning of a standard C++-11 attribute specifier. */
24866 static bool
24868 {
24876 }
24878 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24879 beginning of a GNU extension attribute. */
24881 static bool
24883 {
24887 }
24889 /* Return true iff the next tokens can be the beginning of either a
24890 GNU attribute list, or a standard C++11 attribute sequence. */
24892 static bool
24894 {
24897 }
24899 /* Return true iff the next Nth tokens can be the beginning of either
24900 a GNU attribute list, or a standard C++11 attribute sequence. */
24902 static bool
24904 {
24907 }
24909 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24910 of GNU attributes, or return NULL. */
24912 static tree
24914 {
24918 }
24920 #define CILK_SIMD_FN_CLAUSE_MASK \
24921 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24922 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24923 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24924 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24925 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24927 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24928 vector [(<clauses>)] */
24930 static void
24932 {
24936 {
24942 }
24945 {
24948 paren_scope++;
24949 }
24951 {
24954 paren_scope++;
24956 paren_scope--;
24957 /* Do not push the last ')' */
24960 }
24969 }
24971 /* Parse an (optional) series of attributes.
24973 attributes:
24974 attributes attribute
24976 attribute:
24977 __attribute__ (( attribute-list [opt] ))
24979 The return value is as for cp_parser_gnu_attribute_list. */
24981 static tree
24983 {
24987 {
24989 tree attribute_list;
24992 /* Peek at the next token. */
24994 /* If it's not `__attribute__', then we're done. */
24998 /* Consume the `__attribute__' keyword. */
25000 /* Look for the two `(' tokens. */
25001 matching_parens outer_parens;
25003 matching_parens inner_parens;
25006 /* Peek at the next token. */
25009 /* Parse the attribute-list. */
25011 else
25012 /* If the next token is a `)', then there is no attribute
25013 list. */
25016 /* Look for the two `)' tokens. */
25024 /* Add these new attributes to the list. */
25026 }
25029 }
25031 /* Parse a GNU attribute-list.
25033 attribute-list:
25034 attribute
25035 attribute-list , attribute
25037 attribute:
25038 identifier
25039 identifier ( identifier )
25040 identifier ( identifier , expression-list )
25041 identifier ( expression-list )
25043 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25044 to an attribute. The TREE_PURPOSE of each node is the identifier
25045 indicating which attribute is in use. The TREE_VALUE represents
25046 the arguments, if any. */
25048 static tree
25050 {
25056 {
25058 tree identifier;
25059 tree attribute;
25061 /* Look for the identifier. We also allow keywords here; for
25062 example `__attribute__ ((const))' is legal. */
25066 {
25069 /* Consume the token, but save it since we need it for the
25070 SIMD enabled function parsing. */
25073 /* Save away the identifier that indicates which attribute
25074 this is. */
25076 /* For keywords, use the canonical spelling, not the
25077 parsed identifier. */
25084 /* Peek at the next token. */
25086 /* If it's an `(', then parse the attribute arguments. */
25088 {
25093 {
25096 }
25097 else
25098 vec = cp_parser_parenthesized_expression_list
25104 else
25105 {
25108 }
25109 /* Save the arguments away. */
25111 }
25113 {
25116 }
25119 {
25120 /* Add this attribute to the list. */
25123 }
25126 }
25127 /* Now, look for more attributes. If the next token isn't a
25128 `,', we're done. */
25132 /* Consume the comma and keep going. */
25134 }
25137 /* We built up the list in reverse order. */
25139 }
25141 /* Parse a standard C++11 attribute.
25143 The returned representation is a TREE_LIST which TREE_PURPOSE is
25144 the scoped name of the attribute, and the TREE_VALUE is its
25145 arguments list.
25147 Note that the scoped name of the attribute is itself a TREE_LIST
25148 which TREE_PURPOSE is the namespace of the attribute, and
25149 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25150 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25151 and which TREE_PURPOSE is directly the attribute name.
25153 Clients of the attribute code should use get_attribute_namespace
25154 and get_attribute_name to get the actual namespace and name of
25155 attributes, regardless of their being GNU or C++11 attributes.
25157 attribute:
25158 attribute-token attribute-argument-clause [opt]
25160 attribute-token:
25161 identifier
25162 attribute-scoped-token
25164 attribute-scoped-token:
25165 attribute-namespace :: identifier
25167 attribute-namespace:
25168 identifier
25170 attribute-argument-clause:
25171 ( balanced-token-seq )
25173 balanced-token-seq:
25174 balanced-token [opt]
25175 balanced-token-seq balanced-token
25177 balanced-token:
25178 ( balanced-token-seq )
25179 [ balanced-token-seq ]
25180 { balanced-token-seq }. */
25182 static tree
25184 {
25188 /* First, parse name of the attribute, a.k.a attribute-token. */
25205 {
25206 /* We are seeing a scoped attribute token. */
25221 else
25222 {
25226 }
25230 NULL_TREE);
25232 }
25235 NULL_TREE);
25236 else
25237 {
25240 NULL_TREE);
25241 /* C++11 noreturn attribute is equivalent to GNU's. */
25244 /* C++14 deprecated attribute is equivalent to GNU's. */
25247 /* C++17 fallthrough attribute is equivalent to GNU's. */
25250 /* Transactional Memory TS optimize_for_synchronized attribute is
25251 equivalent to GNU transaction_callable. */
25255 /* Transactional Memory attributes are GNU attributes. */
25258 }
25260 /* Now parse the optional argument clause of the attribute. */
25265 {
25271 /* A GNU attribute that takes an identifier in parameter. */
25274 vec = cp_parser_parenthesized_expression_list
25280 else
25281 {
25284 }
25288 else
25290 }
25293 }
25295 /* Check that the attribute ATTRIBUTE appears at most once in the
25296 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25297 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25298 isn't implemented yet in GCC. */
25300 static void
25302 {
25304 {
25314 }
25315 }
25317 /* Parse a list of standard C++-11 attributes.
25319 attribute-list:
25320 attribute [opt]
25321 attribute-list , attribute[opt]
25322 attribute ...
25323 attribute-list , attribute ...
25324 */
25326 static tree
25328 {
25333 {
25338 {
25342 }
25345 {
25350 else
25351 {
25356 }
25358 }
25362 }
25365 }
25367 /* Parse a standard C++-11 attribute specifier.
25369 attribute-specifier:
25370 [ [ attribute-using-prefix [opt] attribute-list ] ]
25371 alignment-specifier
25373 attribute-using-prefix:
25374 using attribute-namespace :
25376 alignment-specifier:
25377 alignas ( type-id ... [opt] )
25378 alignas ( alignment-expression ... [opt] ). */
25380 static tree
25382 {
25388 {
25395 {
25406 {
25410 "attribute using prefix only available "
25416 }
25417 else
25419 }
25426 else
25427 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25428 when we are sure that we have actually parsed them. */
25430 }
25431 else
25432 {
25433 tree alignas_expr;
25435 /* Look for an alignment-specifier. */
25446 matching_parens parens;
25448 {
25451 }
25457 {
25464 }
25469 /* Handle alignas (pack...). */
25471 {
25474 }
25476 /* Something went wrong, so don't build the attribute. */
25481 {
25484 }
25486 /* Build the C++-11 representation of an 'aligned'
25487 attribute. */
25488 attributes =
25491 alignas_expr);
25492 }
25495 }
25497 /* Parse a standard C++-11 attribute-specifier-seq.
25499 attribute-specifier-seq:
25500 attribute-specifier-seq [opt] attribute-specifier
25501 */
25503 static tree
25505 {
25510 {
25519 else
25522 }
25525 }
25527 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25528 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25529 current value of the PEDANTIC flag, regardless of whether or not
25530 the `__extension__' keyword is present. The caller is responsible
25531 for restoring the value of the PEDANTIC flag. */
25533 static bool
25535 {
25536 /* Save the old value of the PEDANTIC flag. */
25540 {
25541 /* Consume the `__extension__' token. */
25543 /* We're not being pedantic while the `__extension__' keyword is
25544 in effect. */
25548 }
25551 }
25553 /* Parse a label declaration.
25555 label-declaration:
25556 __label__ label-declarator-seq ;
25558 label-declarator-seq:
25559 identifier , label-declarator-seq
25560 identifier */
25562 static void
25564 {
25565 /* Look for the `__label__' keyword. */
25569 {
25570 tree identifier;
25572 /* Look for an identifier. */
25574 /* If we failed, stop. */
25577 /* Declare it as a label. */
25579 /* If the next token is a `;', stop. */
25582 /* Look for the `,' separating the label declarations. */
25584 }
25586 /* Look for the final `;'. */
25588 }
25590 // -------------------------------------------------------------------------- //
25591 // Requires Clause
25593 // Parse a requires clause.
25594 //
25595 // requires-clause:
25596 // 'requires' logical-or-expression
25597 //
25598 // The required logical-or-expression must be a constant expression. Note
25599 // that we don't check that the expression is constepxr here. We defer until
25600 // we analyze constraints and then, we only check atomic constraints.
25601 static tree
25603 {
25604 // Parse the requires clause so that it is not automatically folded.
25612 }
25614 // Optionally parse a requires clause:
25615 static tree
25617 {
25620 {
25623 {
25626 /* Parse and discard the requires-clause. */
25629 }
25631 }
25634 }
25637 /*---------------------------------------------------------------------------
25638 Requires expressions
25639 ---------------------------------------------------------------------------*/
25641 /* Parse a requires expression
25643 requirement-expression:
25644 'requires' requirement-parameter-list [opt] requirement-body */
25645 static tree
25647 {
25651 /* A requires-expression shall appear only within a concept
25652 definition or a requires-clause.
25654 TODO: Implement this diagnostic correctly. */
25656 {
25660 }
25663 {
25664 /* Local parameters are delared as variables within the scope
25665 of the expression. They are not visible past the end of
25666 the expression. Expressions within the requires-expression
25667 are unevaluated. */
25668 struct scope_sentinel
25669 {
25671 {
25674 }
25677 {
25680 }
25683 /* Parse the optional parameter list. */
25685 {
25689 }
25690 else
25693 /* Parse the requirement body. */
25697 }
25699 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25700 the parm chain. */
25703 }
25705 /* Parse a parameterized requirement.
25707 requirement-parameter-list:
25708 '(' parameter-declaration-clause ')' */
25709 static tree
25711 {
25712 matching_parens parens;
25722 }
25724 /* Parse the body of a requirement.
25726 requirement-body:
25727 '{' requirement-list '}' */
25728 static tree
25730 {
25731 matching_braces braces;
25741 }
25743 /* Parse a list of requirements.
25745 requirement-list:
25746 requirement
25747 requirement-list ';' requirement[opt] */
25748 static tree
25750 {
25753 {
25760 /* If we see a semi-colon, consume it. */
25764 /* Stop processing at the end of the list. */
25767 }
25769 /* Reverse the order of requirements so they are analyzed in
25770 declaration order. */
25772 }
25774 /* Parse a syntactic requirement or type requirement.
25776 requirement:
25777 simple-requirement
25778 compound-requirement
25779 type-requirement
25780 nested-requirement */
25781 static tree
25783 {
25790 else
25792 }
25794 /* Parse a simple requirement.
25796 simple-requirement:
25797 expression ';' */
25798 static tree
25800 {
25809 }
25811 /* Parse a type requirement
25813 type-requirement
25814 nested-name-specifier [opt] required-type-name ';'
25816 required-type-name:
25817 type-name
25818 'template' [opt] simple-template-id */
25819 static tree
25821 {
25824 // Save the scope before parsing name specifiers.
25835 tree type;
25837 {
25846 }
25847 else
25866 }
25868 /* Parse a compound requirement
25870 compound-requirement:
25871 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25872 static tree
25874 {
25875 /* Parse an expression enclosed in '{ }'s. */
25876 matching_braces braces;
25887 /* Parse the optional noexcept. */
25890 {
25893 }
25895 /* Parse the optional trailing return type. */
25898 {
25906 }
25909 }
25911 /* Parse a nested requirement. This is the same as a requires clause.
25913 nested-requirement:
25914 requires-clause */
25915 static tree
25917 {
25923 }
25925 /* Support Functions */
25927 /* Return the appropriate prefer_type argument for lookup_name_real based on
25928 tag_type and template_mem_access. */
25932 {
25933 /* DR 141: When looking in the current enclosing context for a template-name
25934 after -> or ., only consider class templates. */
25938 {
25942 }
25943 }
25945 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25946 NAME should have one of the representations used for an
25947 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25948 is returned. If PARSER->SCOPE is a dependent type, then a
25949 SCOPE_REF is returned.
25951 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25952 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25953 was formed. Abstractly, such entities should not be passed to this
25954 function, because they do not need to be looked up, but it is
25955 simpler to check for this special case here, rather than at the
25956 call-sites.
25958 In cases not explicitly covered above, this function returns a
25959 DECL, OVERLOAD, or baselink representing the result of the lookup.
25960 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25961 is returned.
25963 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25964 (e.g., "struct") that was used. In that case bindings that do not
25965 refer to types are ignored.
25967 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25968 ignored.
25970 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25971 are ignored.
25973 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25974 types.
25976 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25977 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25978 NULL_TREE otherwise. */
25980 static cp_expr
25987 location_t name_location)
25988 {
25989 tree decl;
25992 /* Assume that the lookup will be unambiguous. */
25996 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25997 no longer valid. Note that if we are parsing tentatively, and
25998 the parse fails, OBJECT_TYPE will be automatically restored. */
26004 /* A template-id has already been resolved; there is no lookup to
26005 do. */
26009 {
26013 }
26015 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26016 it should already have been checked to make sure that the name
26017 used matches the type being destroyed. */
26019 {
26020 tree type;
26022 /* Figure out to which type this destructor applies. */
26027 else
26029 /* If that's not a class type, there is no destructor. */
26040 }
26042 /* By this point, the NAME should be an ordinary identifier. If
26043 the id-expression was a qualified name, the qualifying scope is
26044 stored in PARSER->SCOPE at this point. */
26047 /* Perform the lookup. */
26049 {
26055 /* If the SCOPE is dependent, the lookup must be deferred until
26056 the template is instantiated -- unless we are explicitly
26057 looking up names in uninstantiated templates. Even then, we
26058 cannot look up the name if the scope is not a class type; it
26059 might, for example, be a template type parameter. */
26064 /* Defer lookup. */
26066 else
26067 {
26070 /* If PARSER->SCOPE is a dependent type, then it must be a
26071 class type, and we must not be checking dependencies;
26072 otherwise, we would have processed this lookup above. So
26073 that PARSER->SCOPE is not considered a dependent base by
26074 lookup_member, we must enter the scope here. */
26078 /* If the PARSER->SCOPE is a template specialization, it
26079 may be instantiated during name lookup. In that case,
26080 errors may be issued. Even if we rollback the current
26081 tentative parse, those errors are valid. */
26086 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26087 lookup result and the nested-name-specifier nominates a class C:
26088 * if the name specified after the nested-name-specifier, when
26089 looked up in C, is the injected-class-name of C (Clause 9), or
26090 * if the name specified after the nested-name-specifier is the
26091 same as the identifier or the simple-template-id's template-
26092 name in the last component of the nested-name-specifier,
26093 the name is instead considered to name the constructor of
26094 class C. [ Note: for example, the constructor is not an
26095 acceptable lookup result in an elaborated-type-specifier so
26096 the constructor would not be used in place of the
26097 injected-class-name. --end note ] Such a constructor name
26098 shall be used only in the declarator-id of a declaration that
26099 names a constructor or in a using-declaration. */
26107 /* If we have a single function from a using decl, pull it out. */
26114 }
26116 /* If the scope is a dependent type and either we deferred lookup or
26117 we did lookup but didn't find the name, rememeber the name. */
26120 {
26122 {
26123 tree type;
26125 /* The resolution to Core Issue 180 says that `struct
26126 A::B' should be considered a type-name, even if `A'
26127 is dependent. */
26132 }
26136 CPP_CLOSE_PAREN)))
26140 else
26143 is_template);
26144 }
26147 }
26149 {
26150 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26151 OBJECT_TYPE is not a class. */
26153 /* If the OBJECT_TYPE is a template specialization, it may
26154 be instantiated during name lookup. In that case, errors
26155 may be issued. Even if we rollback the current tentative
26156 parse, those errors are valid. */
26158 name,
26161 tf_warning_or_error);
26162 else
26166 /* Look it up in the enclosing context. DR 141: When looking for a
26167 template-name after -> or ., only consider class templates. */
26172 /* The object is type-dependent, so we can't look anything up; we used
26173 this to get the DR 141 behavior. */
26177 }
26178 else
26179 {
26185 }
26187 /* If the lookup failed, let our caller know. */
26191 /* Pull out the template from an injected-class-name (or multiple). */
26195 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26197 {
26200 /* The error message we have to print is too complicated for
26201 cp_parser_error, so we incorporate its actions directly. */
26203 {
26205 name);
26207 }
26209 }
26217 /* If we have resolved the name of a member declaration, check to
26218 see if the declaration is accessible. When the name resolves to
26219 set of overloaded functions, accessibility is checked when
26220 overload resolution is done.
26222 During an explicit instantiation, access is not checked at all,
26223 as per [temp.explicit]. */
26230 }
26232 /* Like cp_parser_lookup_name, but for use in the typical case where
26233 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26234 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26236 static tree
26238 {
26240 none_type,
26245 location);
26246 }
26248 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26249 the current context, return the TYPE_DECL. If TAG_NAME_P is
26250 true, the DECL indicates the class being defined in a class-head,
26251 or declared in an elaborated-type-specifier.
26253 Otherwise, return DECL. */
26255 static tree
26257 {
26258 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26259 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26261 struct A {
26262 template <typename T> struct B;
26263 };
26265 template <typename T> struct A::B {};
26267 Similarly, in an elaborated-type-specifier:
26269 namespace N { struct X{}; }
26271 struct A {
26272 template <typename T> friend struct N::X;
26273 };
26275 However, if the DECL refers to a class type, and we are in
26276 the scope of the class, then the name lookup automatically
26277 finds the TYPE_DECL created by build_self_reference rather
26278 than a TEMPLATE_DECL. For example, in:
26280 template <class T> struct S {
26281 S s;
26282 };
26284 there is no need to handle such case. */
26290 }
26292 /* If too many, or too few, template-parameter lists apply to the
26293 declarator, issue an error message. Returns TRUE if all went well,
26294 and FALSE otherwise. */
26296 static bool
26299 location_t declarator_location)
26300 {
26302 {
26304 {
26312 /* If the DECLARATOR has the form `X<y>' then it uses one
26313 additional level of template parameters. */
26316 return cp_parser_check_template_parameters
26318 }
26334 }
26336 }
26338 /* NUM_TEMPLATES were used in the current declaration. If that is
26339 invalid, return FALSE and issue an error messages. Otherwise,
26340 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26341 declarator and we can print more accurate diagnostics. */
26343 static bool
26346 location_t location,
26348 {
26349 /* If there are the same number of template classes and parameter
26350 lists, that's OK. */
26353 /* If there are more, but only one more, then we are referring to a
26354 member template. That's OK too. */
26357 /* If there are more template classes than parameter lists, we have
26358 something like:
26360 template <class T> void S<T>::R<T>::f (); */
26362 {
26372 else
26375 }
26376 /* Otherwise, there are too many template parameter lists. We have
26377 something like:
26379 template <class T> template <class U> void S::f(); */
26382 }
26384 /* Parse an optional `::' token indicating that the following name is
26385 from the global namespace. If so, PARSER->SCOPE is set to the
26386 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26387 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26388 Returns the new value of PARSER->SCOPE, if the `::' token is
26389 present, and NULL_TREE otherwise. */
26391 static tree
26393 {
26396 /* Peek at the next token. */
26398 /* If we're looking at a `::' token then we're starting from the
26399 global namespace, not our current location. */
26401 {
26402 /* Consume the `::' token. */
26404 /* Set the SCOPE so that we know where to start the lookup. */
26410 }
26412 {
26416 }
26419 }
26421 /* Returns TRUE if the upcoming token sequence is the start of a
26422 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26423 declarator is preceded by the `friend' specifier. */
26425 static bool
26427 {
26430 tree nested_name_specifier;
26433 /* The common case is that this is not a constructor declarator, so
26434 try to avoid doing lots of work if at all possible. It's not
26435 valid declare a constructor at function scope. */
26438 /* And only certain tokens can begin a constructor declarator. */
26446 /* Parse tentatively; we are going to roll back all of the tokens
26447 consumed here. */
26449 /* Assume that we are looking at a constructor declarator. */
26452 /* Look for the optional `::' operator. */
26455 /* Look for the nested-name-specifier. */
26456 nested_name_specifier
26467 /* Outside of a class-specifier, there must be a
26468 nested-name-specifier. Except in C++17 mode, where we
26469 might be declaring a guiding declaration. */
26476 /* If we have a class scope, this is easy; DR 147 says that S::S always
26477 names the constructor, and no other qualified name could. */
26480 {
26490 }
26491 /* If we still think that this might be a constructor-declarator,
26492 look for a class-name. */
26494 {
26495 /* If we have:
26497 template <typename T> struct S {
26498 S();
26499 };
26501 we must recognize that the nested `S' names a class. */
26505 tree type_decl;
26509 none_type,
26516 {
26522 none_type,
26527 else
26529 }
26531 /* If there was no class-name, then this is not a constructor.
26532 Otherwise, if we are in a class-specifier and we aren't
26533 handling a friend declaration, check that its type matches
26534 current_class_type (c++/38313). Note: error_mark_node
26535 is left alone for error recovery purposes. */
26537 && (outside_class_specifier_p
26543 /* If we're still considering a constructor, we have to see a `(',
26544 to begin the parameter-declaration-clause, followed by either a
26545 `)', an `...', or a decl-specifier. We need to check for a
26546 type-specifier to avoid being fooled into thinking that:
26548 S (f) (int);
26550 is a constructor. (It is actually a function named `f' that
26551 takes one parameter (of type `int') and returns a value of type
26552 `S'. */
26560 /* A parameter declaration begins with a decl-specifier,
26561 which is either the "attribute" keyword, a storage class
26562 specifier, or (usually) a type-specifier. */
26564 {
26565 tree type;
26569 /* Names appearing in the type-specifier should be looked up
26570 in the scope of the class. */
26574 {
26577 {
26581 {
26584 }
26585 }
26587 }
26589 /* Inside the constructor parameter list, surrounding
26590 template-parameter-lists do not apply. */
26591 saved_num_template_parameter_lists
26595 /* Look for the type-specifier. */
26597 CP_PARSER_FLAGS_NONE,
26603 parser->num_template_parameter_lists
26606 /* Leave the scope of the class. */
26611 }
26612 }
26614 /* We did not really want to consume any tokens. */
26618 }
26620 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26621 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26622 they must be performed once we are in the scope of the function.
26624 Returns the function defined. */
26626 static tree
26627 cp_parser_function_definition_from_specifiers_and_declarator
26630 tree attributes,
26632 {
26633 tree fn;
26636 /* Begin the function-definition. */
26639 /* The things we're about to see are not directly qualified by any
26640 template headers we've seen thus far. */
26643 /* If there were names looked up in the decl-specifier-seq that we
26644 did not check, check them now. We must wait until we are in the
26645 scope of the function to perform the checks, since the function
26646 might be a friend. */
26650 {
26655 }
26658 {
26659 /* Skip the entire function. */
26662 }
26664 {
26665 /* Seen already, skip it. An error message has already been output. */
26669 /* If this is a function from a class, pop the nested class. */
26672 }
26673 else
26674 {
26675 timevar_id_t tv;
26678 else
26684 }
26687 }
26689 /* Parse the part of a function-definition that follows the
26690 declarator. INLINE_P is TRUE iff this function is an inline
26691 function defined within a class-specifier.
26693 Returns the function defined. */
26695 static tree
26698 {
26699 tree fn;
26704 bool fully_implicit_function_template_p
26707 tree implicit_template_parms
26710 cp_binding_level* implicit_template_scope
26716 /* If the next token is `return', then the code may be trying to
26717 make use of the "named return value" extension that G++ used to
26718 support. */
26721 {
26722 /* Consume the `return' keyword. */
26724 /* Look for the identifier that indicates what value is to be
26725 returned. */
26727 /* Issue an error message. */
26730 /* Skip tokens until we reach the start of the function body. */
26732 {
26739 }
26740 }
26741 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26742 anything declared inside `f'. */
26743 saved_in_unbraced_linkage_specification_p
26746 /* Inside the function, surrounding template-parameter-lists do not
26747 apply. */
26748 saved_num_template_parameter_lists
26752 /* If the next token is `try', `__transaction_atomic', or
26753 `__transaction_relaxed`, then we are looking at either function-try-block
26754 or function-transaction-block. Note that all of these include the
26755 function-body. */
26759 RID_TRANSACTION_RELAXED))
26763 else
26764 cp_parser_ctor_initializer_opt_and_function_body
26767 /* Finish the function. */
26769 /* Generate code for it, if necessary. */
26771 /* Restore the saved values. */
26772 parser->in_unbraced_linkage_specification_p
26774 parser->num_template_parameter_lists
26778 parser->fully_implicit_function_template_p
26780 parser->implicit_template_parms
26782 parser->implicit_template_scope
26789 }
26791 /* Parse a template-declaration body (following argument list). */
26793 static void
26795 tree parameter_list,
26797 {
26801 /* We just processed one more parameter list. */
26804 /* Get the deferred access checks from the parameter list. These
26805 will be checked once we know what is being declared, as for a
26806 member template the checks must be performed in the scope of the
26807 class containing the member. */
26810 /* Tentatively parse for a new template parameter list, which can either be
26811 the template keyword or a template introduction. */
26817 else
26818 {
26819 /* There are no access checks when parsing a template, as we do not
26820 know if a specialization will be a friend. */
26824 checks,
26825 member_p,
26830 /* If this is a member template declaration, let the front
26831 end know. */
26833 {
26838 }
26843 }
26844 /* We are done with the current parameter list. */
26849 /* Finish up. */
26852 /* Check the template arguments for a literal operator template. */
26856 {
26860 else
26861 {
26864 {
26870 }
26872 {
26881 }
26882 else
26884 }
26886 {
26889 " Expected non-type template argument pack <char...>"
26891 decl);
26892 else
26895 decl);
26896 }
26897 }
26899 /* Register member declarations. */
26902 /* If DECL is a function template, we must return to parse it later.
26903 (Even though there is no definition, there might be default
26904 arguments that need handling.) */
26908 }
26910 /* Parse a template introduction header for a template-declaration. Returns
26911 false if tentative parse fails. */
26913 static bool
26915 {
26922 /* Look for the optional `::' operator. */
26925 /* Look for the nested-name-specifier. */
26935 /* Look up the concept for which we will be matching
26936 template parameters. */
26946 /* Look for opening brace for introduction. */
26947 matching_braces braces;
26955 /* Build vector of placeholder parameters and grab
26956 matching identifiers. */
26959 /* The introduction-list shall not be empty. */
26962 {
26965 }
26967 /* Look for closing brace for introduction. */
26972 {
26976 }
26978 /* Build and associate the constraint. */
26981 {
26983 member_p);
26985 }
26989 }
26991 /* Parse a normal template-declaration following the template keyword. */
26993 static void
26995 {
26996 tree parameter_list;
27000 /* Look for the `<' token. */
27004 {
27005 /* 14.5.2.2 [temp.mem]
27007 A local class shall not have member templates. */
27012 }
27013 /* [temp]
27015 A template ... shall not have C linkage. */
27017 {
27020 /* Give it C++ linkage to avoid confusing other parts of the
27021 front end. */
27024 }
27025 else
27028 /* We cannot perform access checks on the template parameter
27029 declarations until we know what is being declared, just as we
27030 cannot check the decl-specifier list. */
27033 /* If the next token is `>', then we have an invalid
27034 specialization. Rather than complain about an invalid template
27035 parameter, issue an error message here. */
27037 {
27041 }
27042 else
27043 {
27044 /* Parse the template parameters. */
27046 }
27048 /* Look for the `>'. */
27051 /* Manage template requirements */
27053 {
27058 }
27061 member_p);
27063 /* For the erroneous case of a template with C linkage, we pushed an
27064 implicit C++ linkage scope; exit that scope now. */
27067 }
27069 /* Parse a template-declaration, assuming that the `export' (and
27070 `extern') keywords, if present, has already been scanned. MEMBER_P
27071 is as for cp_parser_template_declaration. */
27073 static bool
27075 {
27077 {
27081 }
27086 }
27088 /* Perform the deferred access checks from a template-parameter-list.
27089 CHECKS is a TREE_LIST of access checks, as returned by
27090 get_deferred_access_checks. */
27092 static void
27093 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27094 {
27098 }
27100 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27101 `function-definition' sequence that follows a template header.
27102 If MEMBER_P is true, this declaration appears in a class scope.
27104 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27105 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27107 static tree
27113 {
27116 cp_decl_specifier_seq decl_specifiers;
27120 /* This function is only used when processing a template
27121 declaration. */
27125 /* Defer access checks until we know what is being declared. */
27128 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27129 alternative. */
27132 CP_PARSER_FLAGS_OPTIONAL,
27138 /* There are no template typedefs. */
27140 {
27144 }
27146 /* Gather up the access checks that occurred the
27147 decl-specifier-seq. */
27150 /* Check for the declaration of a template class. */
27152 {
27155 {
27156 // If this is a declaration, but not a definition, associate
27157 // any constraints with the type declaration. Constraints
27158 // are associated with definitions in cp_parser_class_specifier.
27164 /* In this case:
27166 struct C {
27167 friend template <typename T> struct A<T>::B;
27168 };
27170 A<T>::B will be represented by a TYPENAME_TYPE, and
27171 therefore not recognized by shadow_tag. */
27173 && !decl
27180 else
27183 /* Perform access checks for template parameters. */
27186 /* Give a helpful diagnostic for
27187 template <class T> struct A { } a;
27188 if we aren't already recovering from an error. */
27191 {
27193 "a class template declaration must not declare "
27197 }
27198 }
27199 }
27201 /* Complain about missing 'typename' or other invalid type names. */
27204 {
27205 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27206 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27207 the rest of this declaration. */
27210 }
27212 /* If it's not a template class, try for a template function. If
27213 the next token is a `;', then this declaration does not declare
27214 anything. But, if there were errors in the decl-specifiers, then
27215 the error might well have come from an attempted class-specifier.
27216 In that case, there's no need to warn about a missing declarator. */
27220 {
27223 checks,
27225 member_p,
27226 declares_class_or_enum,
27230 /* 7.1.1-1 [dcl.stc]
27232 A storage-class-specifier shall not be specified in an explicit
27233 specialization... */
27235 && explicit_specialization_p
27237 {
27241 }
27245 }
27247 /* Look for a trailing `;' after the declaration. */
27253 out:
27256 /* Clear any current qualification; whatever comes next is the start
27257 of something new. */
27263 }
27265 /* Parse a cast-expression that is not the operand of a unary "&". */
27267 static cp_expr
27269 {
27272 }
27274 /* Parse a functional cast to TYPE. Returns an expression
27275 representing the cast. */
27277 static cp_expr
27279 {
27281 tree expression_list;
27282 cp_expr cast;
27291 {
27301 /* Create a location of the form:
27302 type_name{i, f}
27303 ^~~~~~~~~~~~~~~
27304 with caret == start at the start of the type name,
27305 finishing at the closing brace. */
27306 location_t finish_loc
27309 finish_loc);
27312 }
27321 else
27322 {
27325 }
27328 tf_warning_or_error);
27329 /* [expr.const]/1: In an integral constant expression "only type
27330 conversions to integral or enumeration type can be used". */
27336 NIC_CONSTRUCTOR))
27339 /* Create a location of the form:
27340 float(i)
27341 ^~~~~~~~
27342 with caret == start at the start of the type name,
27343 finishing at the closing paren. */
27344 location_t finish_loc
27349 }
27351 /* Save the tokens that make up the body of a member function defined
27352 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27353 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27354 specifiers applied to the declaration. Returns the FUNCTION_DECL
27355 for the member function. */
27357 static tree
27361 tree attributes)
27362 {
27365 tree fn;
27368 /* Create the FUNCTION_DECL. */
27372 /* If something went badly wrong, bail out now. */
27374 {
27375 /* If there's a function-body, skip it. */
27380 }
27382 /* Remember it, if there default args to post process. */
27385 /* Save away the tokens that make up the body of the
27386 function. */
27392 RID_TRANSACTION_ATOMIC))
27393 {
27395 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27402 {
27408 }
27409 else
27412 {
27416 }
27417 }
27419 /* Handle function try blocks. */
27421 {
27424 }
27425 /* We can have braced-init-list mem-initializers before the fn body. */
27427 {
27430 {
27431 /* cache_group will stop after an un-nested { } pair, too. */
27435 /* variadic mem-inits have ... after the ')'. */
27438 }
27439 }
27441 /* Handle function try blocks. */
27447 /* Save away the inline definition; we will process it when the
27448 class is complete. */
27452 /* We need to know that this was defined in the class, so that
27453 friend templates are handled correctly. */
27456 /* Add FN to the queue of functions to be parsed later. */
27460 }
27462 /* Save the tokens that make up the in-class initializer for a non-static
27463 data member. Returns a DEFAULT_ARG. */
27465 static tree
27467 {
27469 }
27471 /* Parse a template-argument-list, as well as the trailing ">" (but
27472 not the opening "<"). See cp_parser_template_argument_list for the
27473 return value. */
27475 static tree
27477 {
27478 tree arguments;
27479 tree saved_scope;
27480 tree saved_qualifying_scope;
27481 tree saved_object_scope;
27486 /* [temp.names]
27488 When parsing a template-id, the first non-nested `>' is taken as
27489 the end of the template-argument-list rather than a greater-than
27490 operator. */
27491 saved_greater_than_is_operator_p
27494 /* Parsing the argument list may modify SCOPE, so we save it
27495 here. */
27499 /* We need to evaluate the template arguments, even though this
27500 template-id may be nested within a "sizeof". */
27505 /* Parse the template-argument-list itself. */
27509 else
27511 /* Look for the `>' that ends the template-argument-list. If we find
27512 a '>>' instead, it's probably just a typo. */
27514 {
27516 {
27517 /* In C++0x, a `>>' in a template argument list or cast
27518 expression is considered to be two separate `>'
27519 tokens. So, change the current token to a `>', but don't
27520 consume it: it will be consumed later when the outer
27521 template argument list (or cast expression) is parsed.
27522 Note that this replacement of `>' for `>>' is necessary
27523 even if we are parsing tentatively: in the tentative
27524 case, after calling
27525 cp_parser_enclosed_template_argument_list we will always
27526 throw away all of the template arguments and the first
27527 closing `>', either because the template argument list
27528 was erroneous or because we are replacing those tokens
27529 with a CPP_TEMPLATE_ID token. The second `>' (which will
27530 not have been thrown away) is needed either to close an
27531 outer template argument list or to complete a new-style
27532 cast. */
27535 }
27537 {
27538 /* If we're in a nested template argument list, the '>>' has
27539 to be a typo for '> >'. We emit the error message, but we
27540 continue parsing and we push a '>' as next token, so that
27541 the argument list will be parsed correctly. Note that the
27542 global source location is still on the token before the
27543 '>>', so we need to say explicitly where we want it. */
27551 }
27552 else
27553 {
27554 /* If this is not a nested template argument list, the '>>'
27555 is a typo for '>'. Emit an error message and continue.
27556 Same deal about the token location, but here we can get it
27557 right by consuming the '>>' before issuing the diagnostic. */
27560 "spurious %<>>%>, use %<>%> to terminate "
27562 }
27563 }
27564 else
27566 /* The `>' token might be a greater-than operator again now. */
27567 parser->greater_than_is_operator_p
27569 /* Restore the SAVED_SCOPE. */
27577 }
27579 /* MEMBER_FUNCTION is a member function, or a friend. If default
27580 arguments, or the body of the function have not yet been parsed,
27581 parse them now. */
27583 static void
27585 {
27587 /* If this member is a template, get the underlying
27588 FUNCTION_DECL. */
27592 /* There should not be any class definitions in progress at this
27593 point; the bodies of members are only parsed outside of all class
27594 definitions. */
27596 /* While we're parsing the member functions we might encounter more
27597 classes. We want to handle them right away, but we don't want
27598 them getting mixed up with functions that are currently in the
27599 queue. */
27602 /* Make sure that any template parameters are in scope. */
27605 /* If the body of the function has not yet been parsed, parse it
27606 now. */
27608 {
27609 tree function_scope;
27612 /* The function is no longer pending; we are processing it. */
27617 /* If this is a local class, enter the scope of the containing
27618 function. */
27623 /* Push the body of the function onto the lexer stack. */
27626 /* Let the front end know that we going to be defining this
27627 function. */
27631 /* Don't do access checking if it is a templated function. */
27635 /* #pragma omp declare reduction needs special parsing. */
27637 {
27642 }
27643 else
27644 /* Now, parse the body of the function. */
27651 /* Leave the scope of the containing function. */
27655 }
27657 /* Remove any template parameters from the symbol table. */
27660 /* Restore the queue. */
27663 }
27665 /* If DECL contains any default args, remember it on the unparsed
27666 functions queue. */
27668 static void
27670 {
27671 tree probe;
27674 probe;
27677 {
27681 }
27682 }
27684 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27685 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27686 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27687 from the parameter-type-list. */
27689 static tree
27692 {
27694 tree parsed_arg;
27700 /* Push the saved tokens for the default argument onto the parser's
27701 lexer stack. */
27707 /* Parse the default argument. */
27718 {
27719 /* In a non-template class, check conversions now. In a template,
27720 we'll wait and instantiate these as needed. */
27723 tf_warning_or_error);
27726 else
27728 }
27730 /* If the token stream has not been completely used up, then
27731 there was extra junk after the end of the default
27732 argument. */
27734 {
27737 else
27739 }
27741 /* Revert to the main lexer. */
27745 }
27747 /* FIELD is a non-static data member with an initializer which we saved for
27748 later; parse it now. */
27750 static void
27752 {
27753 tree def;
27760 NULL_TREE);
27766 }
27768 /* FN is a FUNCTION_DECL which may contains a parameter with an
27769 unparsed DEFAULT_ARG. Parse the default args now. This function
27770 assumes that the current scope is the scope in which the default
27771 argument should be processed. */
27773 static void
27775 {
27779 /* While we're parsing the default args, we might (due to the
27780 statement expression extension) encounter more classes. We want
27781 to handle them right away, but we don't want them getting mixed
27782 up with default args that are currently in the queue. */
27785 /* Local variable names (and the `this' keyword) may not appear
27786 in a default argument. */
27797 {
27799 tree parsed_arg;
27801 tree copy;
27808 /* This can happen for a friend declaration for a function
27809 already declared with default arguments. */
27812 parsed_arg
27814 default_arg,
27818 /* Update any instantiations we've already created. */
27822 }
27826 /* Make sure no default arg is missing. */
27829 /* Restore the state of local_variables_forbidden_p. */
27832 /* Restore the queue. */
27834 }
27836 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27838 sizeof ... ( identifier )
27840 where the 'sizeof' token has already been consumed. */
27842 static tree
27844 {
27845 /* Consume the `...'. */
27849 matching_parens parens;
27853 else
27861 /* The name is not qualified. */
27880 }
27882 /* Parse the operand of `sizeof' (or a similar operator). Returns
27883 either a TYPE or an expression, depending on the form of the
27884 input. The KEYWORD indicates which kind of expression we have
27885 encountered. */
27887 static tree
27889 {
27896 /* If it's a `...', then we are computing the length of a parameter
27897 pack. */
27902 /* Types cannot be defined in a `sizeof' expression. Save away the
27903 old message. */
27905 /* And create the new one. */
27911 /* The restrictions on constant-expressions do not apply inside
27912 sizeof expressions. */
27913 saved_integral_constant_expression_p
27915 saved_non_integral_constant_expression_p
27919 /* Do not actually evaluate the expression. */
27922 /* If it's a `(', then we might be looking at the type-id
27923 construction. */
27925 {
27928 /* We can't be sure yet whether we're looking at a type-id or an
27929 expression. */
27932 matching_parens parens;
27935 /* Note: as a GNU Extension, compound literals are considered
27936 postfix-expressions as they are in C99, so they are valid
27937 arguments to sizeof. See comment in cp_parser_cast_expression
27938 for details. */
27941 else
27942 {
27945 /* Look for the type-id. */
27947 /* Look for the closing `)'. */
27950 }
27952 /* If all went well, then we're done. */
27954 {
27955 cp_decl_specifier_seq decl_specs;
27957 /* Build a trivial decl-specifier-seq. */
27961 /* Call grokdeclarator to figure out what type this is. */
27964 TYPENAME,
27967 }
27968 }
27970 /* If the type-id production did not work out, then we must be
27971 looking at the unary-expression production. */
27975 /* Go back to evaluating expressions. */
27979 /* Free the message we created. */
27981 /* And restore the old one. */
27983 parser->integral_constant_expression_p
27985 parser->non_integral_constant_expression_p
27989 }
27991 /* If the current declaration has no declarator, return true. */
27993 static bool
27995 {
27996 /* If the next token is a `;' or a `,' then there is no
27997 declarator. */
28000 }
28002 /* Update the DECL_SPECS to reflect the storage class indicated by
28003 KEYWORD. */
28005 static void
28010 {
28011 cp_storage_class storage_class;
28014 {
28018 }
28020 {
28023 }
28028 {
28031 }
28034 {
28052 }
28056 /* A storage class specifier cannot be applied alongside a typedef
28057 specifier. If there is a typedef specifier present then set
28058 conflicting_specifiers_p which will trigger an error later
28059 on in grokdeclarator. */
28062 }
28064 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28065 is true, the type is a class or enum definition. */
28067 static void
28069 tree type_spec,
28072 {
28075 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28076 (with, for example, in "typedef int wchar_t;") we remember that
28077 this is what happened. In system headers, we ignore these
28078 declarations so that G++ can work with system headers that are not
28079 C++-safe. */
28081 && !type_definition_p
28091 {
28094 ds_redefined_builtin_type_spec,
28095 token);
28097 {
28101 }
28102 }
28105 else
28106 {
28111 }
28112 }
28114 /* True iff TOKEN is the GNU keyword __thread. */
28116 static bool
28118 {
28121 }
28123 /* Set the location for a declarator specifier and check if it is
28124 duplicated.
28126 DECL_SPECS is the sequence of declarator specifiers onto which to
28127 set the location.
28129 DS is the single declarator specifier to set which location is to
28130 be set onto the existing sequence of declarators.
28132 LOCATION is the location for the declarator specifier to
28133 consider. */
28135 static void
28138 {
28147 {
28151 }
28152 else
28153 {
28155 {
28159 else
28160 {
28163 OPT_Wlong_long,
28165 }
28166 }
28168 {
28173 else
28174 {
28178 }
28179 }
28180 else
28181 {
28197 "__complex"
28198 };
28202 }
28203 }
28204 }
28206 /* Return true iff the declarator specifier DS is present in the
28207 sequence of declarator specifiers DECL_SPECS. */
28209 bool
28211 cp_decl_spec ds)
28212 {
28219 }
28221 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28222 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28224 static bool
28226 {
28228 }
28230 /* Issue an error message indicating that TOKEN_DESC was expected.
28231 If KEYWORD is true, it indicated this function is called by
28232 cp_parser_require_keword and the required token can only be
28233 a indicated keyword.
28235 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28236 within any error as the location of an "opening" token matching
28237 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28238 RT_CLOSE_PAREN). */
28240 static void
28242 required_token token_desc,
28244 location_t matching_location)
28245 {
28251 {
28320 }
28323 {
28325 {
28403 }
28404 }
28408 }
28411 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28412 issue an error message indicating that TOKEN_DESC was expected.
28414 Returns the token consumed, if the token had the appropriate type.
28415 Otherwise, returns NULL.
28417 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28418 within any error as the location of an "opening" token matching
28419 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28420 RT_CLOSE_PAREN). */
28425 required_token token_desc,
28426 location_t matching_location)
28427 {
28430 else
28431 {
28432 /* Output the MESSAGE -- unless we're parsing tentatively. */
28435 matching_location);
28437 }
28438 }
28440 /* An error message is produced if the next token is not '>'.
28441 All further tokens are skipped until the desired token is
28442 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28444 static void
28446 {
28447 /* Current level of '< ... >'. */
28449 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28452 /* Are we ready, yet? If not, issue error message. */
28456 /* Skip tokens until the desired token is found. */
28458 {
28459 /* Peek at the next token. */
28461 {
28469 /* C++0x views the `>>' operator as two `>' tokens, but
28470 C++98 does not. */
28473 {
28474 /* We've hit a `>>' where the first `>' closes the
28475 template argument list, and the second `>' is
28476 spurious. Just consume the `>>' and stop; we've
28477 already produced at least one error. */
28480 }
28481 /* Fall through for C++0x, so we handle the second `>' in
28482 the `>>'. */
28487 {
28488 /* We've reached the token we want, consume it and stop. */
28491 }
28510 /* The '>' was probably forgotten, don't look further. */
28515 }
28517 /* Consume this token. */
28519 }
28520 }
28522 /* If the next token is the indicated keyword, consume it. Otherwise,
28523 issue an error message indicating that TOKEN_DESC was expected.
28525 Returns the token consumed, if the token had the appropriate type.
28526 Otherwise, returns NULL. */
28531 required_token token_desc)
28532 {
28536 {
28538 UNKNOWN_LOCATION);
28540 }
28543 }
28545 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28546 function-definition. */
28548 static bool
28550 {
28553 /* A ctor-initializer begins with a `:'. */
28555 /* A function-try-block begins with `try'. */
28557 /* A function-transaction-block begins with `__transaction_atomic'
28558 or `__transaction_relaxed'. */
28561 /* The named return value extension begins with `return'. */
28563 }
28565 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28566 definition. */
28568 static bool
28570 {
28577 }
28579 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28580 C++0x) ending a template-argument. */
28582 static bool
28584 {
28592 }
28594 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28595 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28597 static bool
28600 {
28606 /* Check for the sequence `<::' in the original code. It would be lexed as
28607 `[:', where `[' is a digraph, and there is no whitespace before
28608 `:'. */
28610 {
28615 }
28617 }
28619 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28620 or none_type otherwise. */
28622 static enum tag_types
28624 {
28626 {
28636 }
28637 }
28639 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28640 or none_type otherwise or if the token is null. */
28642 static enum tag_types
28644 {
28649 {
28657 }
28658 }
28660 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28662 static void
28664 {
28668 {
28672 type))
28675 }
28676 }
28678 /* Issue an error message if DECL is redeclared with different
28679 access than its original declaration [class.access.spec/3].
28680 This applies to nested classes, nested class templates and
28681 enumerations [class.mem/1]. */
28683 static void
28685 {
28696 }
28698 /* Look for the `template' keyword, as a syntactic disambiguator.
28699 Return TRUE iff it is present, in which case it will be
28700 consumed. */
28702 static bool
28704 {
28706 {
28707 /* In C++98 the `template' keyword can only be used within templates;
28708 outside templates the parser can always figure out what is a
28709 template and what is not. In C++11, per the resolution of DR 468,
28710 `template' is allowed in cases where it is not strictly necessary. */
28713 {
28716 "in C++98 %<template%> (as a disambiguator) is only "
28718 /* If this part of the token stream is rescanned, the same
28719 error message would be generated. So, we purge the token
28720 from the stream. */
28723 }
28724 else
28725 {
28726 /* Consume the `template' keyword. */
28729 }
28730 }
28732 }
28734 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28735 set PARSER->SCOPE, and perform other related actions. */
28737 static void
28739 {
28742 /* Get the stored value. */
28744 /* Set the scope from the stored value. */
28748 }
28750 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28751 encounter the end of a block before what we were looking for. */
28753 static bool
28757 {
28759 {
28762 /* Abort a parenthesized expression if we encounter a semicolon. */
28766 /* If we've reached the end of the file, stop. */
28772 /* We've hit the end of an enclosing block, so there's been some
28773 kind of syntax error. */
28776 /* Consume the token. */
28778 /* See if it starts a new group. */
28780 {
28782 /* In theory this should probably check end == '}', but
28783 cp_parser_save_member_function_body needs it to exit
28784 after either '}' or ')' when called with ')'. */
28787 }
28789 {
28793 }
28798 }
28799 }
28801 /* Like above, for caching a default argument or NSDMI. Both of these are
28802 terminated by a non-nested comma, but it can be unclear whether or not a
28803 comma is nested in a template argument list unless we do more parsing.
28804 In order to handle this ambiguity, when we encounter a ',' after a '<'
28805 we try to parse what follows as a parameter-declaration-list (in the
28806 case of a default argument) or a member-declarator (in the case of an
28807 NSDMI). If that succeeds, then we stop caching. */
28809 static tree
28811 {
28816 tree default_argument;
28818 /* Add tokens until we have processed the entire default
28819 argument. We add the range [first_token, token). */
28822 {
28823 /* For list-initialization, this is straightforward. */
28826 }
28828 {
28831 /* Peek at the next token. */
28833 /* What we do depends on what token we have. */
28835 {
28836 /* In valid code, a default argument must be
28837 immediately followed by a `,' `)', or `...'. */
28840 {
28841 /* If we've seen a '<', we might be in a
28842 template-argument-list. Until Core issue 325 is
28843 resolved, we don't know how this situation ought
28844 to be handled, so try to DTRT. We check whether
28845 what comes after the comma is a valid parameter
28846 declaration list. If it is, then the comma ends
28847 the default argument; otherwise the default
28848 argument continues. */
28852 /* Set ITALP so cp_parser_parameter_declaration_list
28853 doesn't decide to commit to this parse. */
28860 {
28861 /* Parse declarators until we reach a non-comma or
28862 somthing that cannot be an initializer.
28863 Just checking whether we're looking at a single
28864 declarator is insufficient. Consider:
28865 int var = tuple<T,U>::x;
28866 The template parameter 'U' looks exactly like a
28867 declarator. */
28868 do
28869 {
28880 }
28882 /* If we met an '=' or ';' then the original comma
28883 was the end of the NSDMI. Otherwise assume
28884 we're still in the NSDMI. */
28887 }
28888 else
28889 {
28894 }
28901 }
28902 /* FALLTHRU */
28905 /* If we run into a non-nested `;', `}', or `]',
28906 then the code is invalid -- but the default
28907 argument is certainly over. */
28912 /* Handle correctly int n = sizeof ... ( p ); */
28915 /* Update DEPTH, if necessary. */
28930 /* This might be the comparison operator, or it might
28931 start a template argument list. */
28938 /* Fall through for C++0x, which treats the `>>'
28939 operator like two `>' tokens in certain
28940 cases. */
28945 {
28946 /* This might be an operator, or it might close a
28947 template argument list. But if a previous '<'
28948 started a template argument list, this will have
28949 closed it, so we can't be in one anymore. */
28953 }
28956 /* If we run out of tokens, issue an error message. */
28964 /* In these cases, we should look for template-ids.
28965 For example, if the default argument is
28966 `X<int, double>()', we need to do name lookup to
28967 figure out whether or not `X' is a template; if
28968 so, the `,' does not end the default argument.
28970 That is not yet done. */
28975 }
28977 /* If we've reached the end, stop. */
28981 /* Add the token to the token block. */
28983 }
28985 /* Create a DEFAULT_ARG to represent the unparsed default
28986 argument. */
28993 }
28995 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28997 location_t
28999 {
29004 }
29006 /* Begin parsing tentatively. We always save tokens while parsing
29007 tentatively so that if the tentative parsing fails we can restore the
29008 tokens. */
29010 static void
29012 {
29013 /* Enter a new parsing context. */
29015 /* Begin saving tokens. */
29017 /* In order to avoid repetitive access control error messages,
29018 access checks are queued up until we are no longer parsing
29019 tentatively. */
29021 }
29023 /* Commit to the currently active tentative parse. */
29025 static void
29027 {
29031 /* Mark all of the levels as committed. */
29034 {
29041 }
29042 }
29044 /* Commit to the topmost currently active tentative parse.
29046 Note that this function shouldn't be called when there are
29047 irreversible side-effects while in a tentative state. For
29048 example, we shouldn't create a permanent entry in the symbol
29049 table, or issue an error message that might not apply if the
29050 tentative parse is aborted. */
29052 static void
29054 {
29059 {
29067 }
29068 }
29070 /* Abort the currently active tentative parse. All consumed tokens
29071 will be rolled back, and no diagnostics will be issued. */
29073 static void
29075 {
29079 /* Now, pretend that we want to see if the construct was
29080 successfully parsed. */
29082 }
29084 /* Stop parsing tentatively. If a parse error has occurred, restore the
29085 token stream. Otherwise, commit to the tokens we have consumed.
29086 Returns true if no error occurred; false otherwise. */
29088 static bool
29090 {
29094 /* Remember whether or not an error occurred, since we are about to
29095 destroy that information. */
29097 /* Remove the topmost context from the stack. */
29100 /* If no parse errors occurred, commit to the tentative parse. */
29102 {
29103 /* Commit to the tokens read tentatively, unless that was
29104 already done. */
29109 }
29110 /* Otherwise, if errors occurred, roll back our state so that things
29111 are just as they were before we began the tentative parse. */
29112 else
29113 {
29116 }
29117 /* Add the context to the front of the free list. */
29122 }
29124 /* Returns true if we are parsing tentatively and are not committed to
29125 this tentative parse. */
29127 static bool
29129 {
29132 }
29134 /* Returns nonzero iff an error has occurred during the most recent
29135 tentative parse. */
29137 static bool
29139 {
29142 }
29144 /* Returns nonzero if GNU extensions are allowed. */
29146 static bool
29148 {
29150 }
29151 \f
29152 /* Objective-C++ Productions */
29155 /* Parse an Objective-C expression, which feeds into a primary-expression
29156 above.
29158 objc-expression:
29159 objc-message-expression
29160 objc-string-literal
29161 objc-encode-expression
29162 objc-protocol-expression
29163 objc-selector-expression
29165 Returns a tree representation of the expression. */
29167 static cp_expr
29169 {
29170 /* Try to figure out what kind of declaration is present. */
29174 {
29184 {
29196 }
29202 }
29205 }
29207 /* Parse an Objective-C message expression.
29209 objc-message-expression:
29210 [ objc-message-receiver objc-message-args ]
29212 Returns a representation of an Objective-C message. */
29214 static tree
29216 {
29228 /* Construct a location e.g.
29229 [self func1:5]
29230 ^~~~~~~~~~~~~~
29231 ranging from the '[' to the ']', with the caret at the start. */
29236 }
29238 /* Parse an objc-message-receiver.
29240 objc-message-receiver:
29241 expression
29242 simple-type-specifier
29244 Returns a representation of the type or expression. */
29246 static tree
29248 {
29249 tree rcv;
29251 /* An Objective-C message receiver may be either (1) a type
29252 or (2) an expression. */
29256 /* If that worked out, fine. */
29263 CP_PARSER_FLAGS_NONE);
29270 }
29272 /* Parse the arguments and selectors comprising an Objective-C message.
29274 objc-message-args:
29275 objc-selector
29276 objc-selector-args
29277 objc-selector-args , objc-comma-args
29279 objc-selector-args:
29280 objc-selector [opt] : assignment-expression
29281 objc-selector-args objc-selector [opt] : assignment-expression
29283 objc-comma-args:
29284 assignment-expression
29285 objc-comma-args , assignment-expression
29287 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29288 selector arguments and TREE_VALUE containing a list of comma
29289 arguments. */
29291 static tree
29293 {
29299 {
29305 /* Detect if we have a unary selector. */
29314 sel_args
29319 }
29321 /* Handle non-selector arguments, if any. */
29323 {
29324 tree arg;
29329 addl_args
29334 }
29337 {
29340 }
29343 }
29345 /* Parse an Objective-C encode expression.
29347 objc-encode-expression:
29348 @encode objc-typename
29350 Returns an encoded representation of the type argument. */
29352 static cp_expr
29354 {
29355 tree type;
29360 matching_parens parens;
29367 {
29371 }
29373 /* This happens if we find @encode(T) (where T is a template
29374 typename or something dependent on a template typename) when
29375 parsing a template. In that case, we can't compile it
29376 immediately, but we rather create an AT_ENCODE_EXPR which will
29377 need to be instantiated when the template is used.
29378 */
29380 {
29384 }
29387 /* Build a location of the form:
29388 @encode(int)
29389 ^~~~~~~~~~~~
29390 with caret==start at the @ token, finishing at the close paren. */
29391 location_t combined_loc
29396 }
29398 /* Parse an Objective-C @defs expression. */
29400 static tree
29402 {
29403 tree name;
29406 matching_parens parens;
29412 }
29414 /* Parse an Objective-C protocol expression.
29416 objc-protocol-expression:
29417 @protocol ( identifier )
29419 Returns a representation of the protocol expression. */
29421 static tree
29423 {
29424 tree proto;
29428 matching_parens parens;
29433 /* Build a location of the form:
29434 @protocol(prot)
29435 ^~~~~~~~~~~~~~~
29436 with caret==start at the @ token, finishing at the close paren. */
29437 location_t combined_loc
29443 }
29445 /* Parse an Objective-C selector expression.
29447 objc-selector-expression:
29448 @selector ( objc-method-signature )
29450 objc-method-signature:
29451 objc-selector
29452 objc-selector-seq
29454 objc-selector-seq:
29455 objc-selector :
29456 objc-selector-seq objc-selector :
29458 Returns a representation of the method selector. */
29460 static tree
29462 {
29469 matching_parens parens;
29475 {
29484 {
29485 /* Detect if we have a unary selector. */
29487 {
29490 }
29491 else
29492 {
29494 }
29495 }
29500 {
29501 sel_seq
29504 sel_seq
29507 }
29508 else
29509 sel_seq
29514 }
29516 finish_selector:
29520 /* Build a location of the form:
29521 @selector(func)
29522 ^~~~~~~~~~~~~~~
29523 with caret==start at the @ token, finishing at the close paren. */
29524 location_t combined_loc
29528 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29531 }
29533 /* Parse a list of identifiers.
29535 objc-identifier-list:
29536 identifier
29537 objc-identifier-list , identifier
29539 Returns a TREE_LIST of identifier nodes. */
29541 static tree
29543 {
29544 tree identifier;
29545 tree list;
29556 {
29563 identifier));
29565 }
29568 }
29570 /* Parse an Objective-C alias declaration.
29572 objc-alias-declaration:
29573 @compatibility_alias identifier identifier ;
29575 This function registers the alias mapping with the Objective-C front end.
29576 It returns nothing. */
29578 static void
29580 {
29588 }
29590 /* Parse an Objective-C class forward-declaration.
29592 objc-class-declaration:
29593 @class objc-identifier-list ;
29595 The function registers the forward declarations with the Objective-C
29596 front end. It returns nothing. */
29598 static void
29600 {
29603 {
29604 tree id;
29614 else
29616 }
29618 }
29620 /* Parse a list of Objective-C protocol references.
29622 objc-protocol-refs-opt:
29623 objc-protocol-refs [opt]
29625 objc-protocol-refs:
29626 < objc-identifier-list >
29628 Returns a TREE_LIST of identifiers, if any. */
29630 static tree
29632 {
29636 {
29640 }
29643 }
29645 /* Parse a Objective-C visibility specification. */
29647 static void
29649 {
29653 {
29668 }
29670 /* Eat '@private'/'@protected'/'@public'. */
29672 }
29674 /* Parse an Objective-C method type. Return 'true' if it is a class
29675 (+) method, and 'false' if it is an instance (-) method. */
29679 {
29682 else
29684 }
29686 /* Parse an Objective-C protocol qualifier. */
29688 static tree
29690 {
29703 {
29708 }
29711 }
29713 /* Parse an Objective-C typename. */
29715 static tree
29717 {
29721 {
29724 matching_parens parens;
29728 /* An ObjC type name may consist of just protocol qualifiers, in which
29729 case the type shall default to 'id'. */
29731 {
29734 /* If the type could not be parsed, an error has already
29735 been produced. For error recovery, behave as if it had
29736 not been specified, which will use the default type
29737 'id'. */
29739 {
29741 /* We need to skip to the closing parenthesis as
29742 cp_parser_type_id() does not seem to do it for
29743 us. */
29748 }
29749 }
29753 }
29756 }
29758 /* Check to see if TYPE refers to an Objective-C selector name. */
29760 static bool
29762 {
29768 }
29770 /* Parse an Objective-C selector. */
29772 static tree
29774 {
29778 {
29781 }
29783 /* C++ operator names are allowed to appear in ObjC selectors. */
29785 {
29798 }
29799 }
29801 /* Parse an Objective-C params list. */
29803 static tree
29805 {
29811 {
29821 /* Detect if we have a unary selector. */
29824 {
29827 }
29831 {
29832 /* Something went quite wrong. There should be a colon
29833 here, but there is not. Stop parsing parameters. */
29835 }
29837 /* New ObjC allows attributes on parameters too. */
29842 params
29845 type_name,
29846 identifier,
29847 parm_attr));
29850 }
29853 {
29856 }
29858 /* We allow tail attributes for the method. */
29860 {
29868 }
29871 {
29874 }
29876 }
29878 /* Parse the non-keyword Objective-C params. */
29880 static tree
29883 {
29889 {
29891 tree parm;
29897 {
29902 }
29904 /* TODO: parse attributes for tail parameters. */
29913 }
29915 /* We allow tail attributes for the method. */
29917 {
29919 {
29924 }
29925 else
29926 /* We have an error, but parse the attributes, so that we can
29927 carry on. */
29933 }
29936 }
29938 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29940 static void
29942 {
29945 /* If the next token is `extern' and the following token is a string
29946 literal, then we have a linkage specification. */
29948 && cp_parser_is_pure_string_literal
29951 /* Handle #pragma, if any. */
29954 /* Allow stray semicolons. */
29957 /* Mark methods as optional or required, when building protocols. */
29959 {
29962 }
29964 {
29967 }
29970 /* Other stray characters must generate errors. */
29972 {
29976 }
29977 /* Finally, try to parse a block-declaration, or a function-definition. */
29978 else
29980 }
29982 /* Parse a method signature. */
29984 static tree
29986 {
30002 }
30004 static bool
30006 {
30007 tree tattr;
30012 /* If the attributes are followed by a method introducer, this is not allowed.
30013 Dump the attributes and flag the situation. */
30018 /* Otherwise, the attributes introduce some interstitial code, possibly so
30019 rewind to allow that check. */
30022 }
30024 /* Parse an Objective-C method prototype list. */
30026 static void
30028 {
30032 {
30034 {
30039 else
30043 {
30047 }
30050 }
30056 OPT_Wattributes,
30058 else
30059 /* Allow for interspersed non-ObjC++ code. */
30063 }
30067 else
30071 }
30073 /* Parse an Objective-C method definition list. */
30075 static void
30077 {
30081 {
30082 tree meth;
30085 {
30091 else
30096 {
30100 }
30102 NULL_TREE);
30104 /* For historical reasons, we accept an optional semicolon. */
30111 {
30118 }
30119 }
30120 /* The following case will be removed once @synthesize is
30121 completely implemented. */
30132 else
30133 /* Allow for interspersed non-ObjC++ code. */
30137 }
30141 else
30145 }
30147 /* Parse Objective-C ivars. */
30149 static void
30151 {
30162 {
30163 cp_decl_specifier_seq declspecs;
30165 tree prefix_attributes;
30173 CP_PARSER_FLAGS_OPTIONAL,
30177 /* auto, register, static, extern, mutable. */
30179 {
30182 }
30184 /* thread_local. */
30186 {
30189 }
30191 /* typedef. */
30193 {
30196 }
30201 /* Keep going until we hit the `;' at the end of the
30202 declaration. */
30204 {
30209 /* Check for a (possibly unnamed) bitfield declaration. */
30217 {
30218 /* Get the name of the bitfield. */
30221 sfk_none);
30223 eat_colon:
30225 /* Get the width of the bitfield. */
30226 width
30228 }
30229 else
30230 {
30231 /* Parse the declarator. */
30232 declarator
30238 }
30240 /* Look for attributes that apply to the ivar. */
30242 /* Remember which attributes are prefix attributes and
30243 which are not. */
30245 /* Combine the attributes. */
30249 /* Create the bitfield declaration. */
30252 else
30257 /* Add the instance variable. */
30261 /* Reset PREFIX_ATTRIBUTES. */
30270 {
30273 }
30275 }
30279 }
30284 /* Do not consume the RID_AT_END, so it will be read again as terminating
30285 the @interface of @implementation. */
30289 /* For historical reasons, we accept an optional semicolon. */
30292 }
30294 /* Parse an Objective-C protocol declaration. */
30296 static void
30298 {
30304 {
30309 }
30311 /* See if we have a forward declaration or a definition. */
30314 /* Try a forward declaration first. */
30316 {
30318 {
30319 tree id;
30329 else
30331 }
30333 }
30335 /* Ok, we got a full-fledged definition (or at least should). */
30336 else
30337 {
30342 }
30343 }
30345 /* Parse an Objective-C superclass or category. */
30347 static void
30352 {
30358 {
30361 }
30363 {
30364 matching_parens parens;
30367 /* If there is no category name, and this is an @interface, we
30368 have a class extension. */
30370 {
30373 }
30374 else
30378 }
30379 }
30381 /* Parse an Objective-C class interface. */
30383 static void
30385 {
30392 {
30393 /* It's hard to recover because even if valid @interface stuff
30394 is to follow, we can't compile it (or validate it) if we
30395 don't even know which class it refers to. Let's assume this
30396 was a stray '@interface' token in the stream and skip it.
30397 */
30399 }
30404 /* We have either a class or a category on our hands. */
30407 else
30408 {
30410 /* Handle instance variable declarations, if any. */
30413 }
30416 }
30418 /* Parse an Objective-C class implementation. */
30420 static void
30422 {
30429 {
30430 /* It's hard to recover because even if valid @implementation
30431 stuff is to follow, we can't compile it (or validate it) if
30432 we don't even know which class it refers to. Let's assume
30433 this was a stray '@implementation' token in the stream and
30434 skip it.
30435 */
30437 }
30441 /* We have either a class or a category on our hands. */
30444 else
30445 {
30447 /* Handle instance variable declarations, if any. */
30450 }
30453 }
30455 /* Consume the @end token and finish off the implementation. */
30457 static void
30459 {
30462 }
30464 /* Parse an Objective-C declaration. */
30466 static void
30468 {
30469 /* Try to figure out what kind of declaration is present. */
30474 {
30490 }
30493 {
30516 }
30517 }
30519 /* Parse an Objective-C try-catch-finally statement.
30521 objc-try-catch-finally-stmt:
30522 @try compound-statement objc-catch-clause-seq [opt]
30523 objc-finally-clause [opt]
30525 objc-catch-clause-seq:
30526 objc-catch-clause objc-catch-clause-seq [opt]
30528 objc-catch-clause:
30529 @catch ( objc-exception-declaration ) compound-statement
30531 objc-finally-clause:
30532 @finally compound-statement
30534 objc-exception-declaration:
30535 parameter-declaration
30536 '...'
30538 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30540 Returns NULL_TREE.
30542 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30543 for C. Keep them in sync. */
30545 static tree
30547 {
30548 location_t location;
30549 tree stmt;
30554 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30555 node, lest it get absorbed into the surrounding block. */
30561 {
30565 matching_parens parens;
30571 {
30572 /* We have "@catch (...)" (where the '...' are literally
30573 what is in the code). Skip the '...'.
30574 parameter_declaration is set to NULL_TREE, and
30575 objc_being_catch_clauses() knows that that means
30576 '...'. */
30579 }
30580 else
30581 {
30582 /* We have "@catch (NSException *exception)" or something
30583 like that. Parse the parameter declaration. */
30587 else
30592 }
30595 else
30596 {
30597 /* If there was no open parenthesis, we are recovering from
30598 an error, and we are trying to figure out what mistake
30599 the user has made. */
30601 /* If there is an immediate closing parenthesis, the user
30602 probably forgot the opening one (ie, they typed "@catch
30603 NSException *e)". Parse the closing parenthesis and keep
30604 going. */
30608 /* If these is no immediate closing parenthesis, the user
30609 probably doesn't know that parenthesis are required at
30610 all (ie, they typed "@catch NSException *e"). So, just
30611 forget about the closing parenthesis and keep going. */
30612 }
30616 }
30618 {
30621 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30622 node, lest it get absorbed into the surrounding block. */
30626 }
30629 }
30631 /* Parse an Objective-C synchronized statement.
30633 objc-synchronized-stmt:
30634 @synchronized ( expression ) compound-statement
30636 Returns NULL_TREE. */
30638 static tree
30640 {
30641 location_t location;
30648 matching_parens parens;
30653 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30654 node, lest it get absorbed into the surrounding block. */
30659 }
30661 /* Parse an Objective-C throw statement.
30663 objc-throw-stmt:
30664 @throw assignment-expression [opt] ;
30666 Returns a constructed '@throw' statement. */
30668 static tree
30670 {
30682 }
30684 /* Parse an Objective-C statement. */
30686 static tree
30688 {
30689 /* Try to figure out what kind of declaration is present. */
30693 {
30704 }
30707 }
30709 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30710 look ahead to see if an objc keyword follows the attributes. This
30711 is to detect the use of prefix attributes on ObjC @interface and
30712 @protocol. */
30714 static bool
30716 {
30721 {
30724 }
30727 }
30729 /* This routine is a minimal replacement for
30730 c_parser_struct_declaration () used when parsing the list of
30731 types/names or ObjC++ properties. For example, when parsing the
30732 code
30734 @property (readonly) int a, b, c;
30736 this function is responsible for parsing "int a, int b, int c" and
30737 returning the declarations as CHAIN of DECLs.
30739 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30740 similar parsing. */
30741 static tree
30743 {
30745 cp_decl_specifier_seq declspecs;
30747 tree prefix_attributes;
30750 CP_PARSER_FLAGS_NONE,
30757 /* auto, register, static, extern, mutable. */
30759 {
30762 }
30764 /* thread_local. */
30766 {
30769 }
30771 /* typedef. */
30773 {
30776 }
30781 /* Keep going until we hit the `;' at the end of the declaration. */
30783 {
30788 /* Parse the declarator. */
30792 /* Look for attributes that apply to the ivar. */
30794 /* Remember which attributes are prefix attributes and
30795 which are not. */
30797 /* Combine the attributes. */
30807 /* Reset PREFIX_ATTRIBUTES. */
30818 {
30821 }
30822 else
30824 }
30826 }
30828 /* Parse an Objective-C @property declaration. The syntax is:
30830 objc-property-declaration:
30831 '@property' objc-property-attributes[opt] struct-declaration ;
30833 objc-property-attributes:
30834 '(' objc-property-attribute-list ')'
30836 objc-property-attribute-list:
30837 objc-property-attribute
30838 objc-property-attribute-list, objc-property-attribute
30840 objc-property-attribute
30841 'getter' = identifier
30842 'setter' = identifier
30843 'readonly'
30844 'readwrite'
30845 'assign'
30846 'retain'
30847 'copy'
30848 'nonatomic'
30850 For example:
30851 @property NSString *name;
30852 @property (readonly) id object;
30853 @property (retain, nonatomic, getter=getTheName) id name;
30854 @property int a, b, c;
30856 PS: This function is identical to
30857 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30858 static void
30860 {
30861 /* The following variables hold the attributes of the properties as
30862 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30863 seen. When we see an attribute, we set them to 'true' (if they
30864 are boolean properties) or to the identifier (if they have an
30865 argument, ie, for getter and setter). Note that here we only
30866 parse the list of attributes, check the syntax and accumulate the
30867 attributes that we find. objc_add_property_declaration() will
30868 then process the information. */
30878 /* 'properties' is the list of properties that we read. Usually a
30879 single one, but maybe more (eg, in "@property int a, b, c;" there
30880 are three). */
30881 tree properties;
30882 location_t loc;
30888 /* Parse the optional attribute list... */
30890 {
30891 /* Eat the '('. */
30892 matching_parens parens;
30896 {
30902 {
30905 }
30909 {
30920 {
30924 else
30929 }
30932 {
30936 }
30938 {
30940 {
30943 }
30944 else
30948 else
30950 }
30951 else
30952 {
30954 {
30957 }
30958 else
30960 }
30966 }
30973 else
30975 }
30977 /* FIXME: "@property (setter, assign);" will generate a spurious
30978 "error: expected ‘)’ before ‘,’ token". This is because
30979 cp_parser_require, unlike the C counterpart, will produce an
30980 error even if we are in error recovery. */
30982 {
30987 }
30988 }
30990 /* ... and the property declaration(s). */
30994 {
30996 /* If the next token is now a `;', consume it. */
31000 }
31004 else
31005 {
31006 /* Comma-separated properties are chained together in
31007 reverse order; add them one by one. */
31016 }
31019 }
31021 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31023 objc-synthesize-declaration:
31024 @synthesize objc-synthesize-identifier-list ;
31026 objc-synthesize-identifier-list:
31027 objc-synthesize-identifier
31028 objc-synthesize-identifier-list, objc-synthesize-identifier
31030 objc-synthesize-identifier
31031 identifier
31032 identifier = identifier
31034 For example:
31035 @synthesize MyProperty;
31036 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31038 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31039 for C. Keep them in sync.
31040 */
31041 static void
31043 {
31045 location_t loc;
31050 {
31054 {
31057 }
31059 {
31063 {
31066 }
31067 }
31068 else
31073 else
31075 }
31078 }
31080 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31082 objc-dynamic-declaration:
31083 @dynamic identifier-list ;
31085 For example:
31086 @dynamic MyProperty;
31087 @dynamic MyProperty, AnotherProperty;
31089 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31090 for C. Keep them in sync.
31091 */
31092 static void
31094 {
31096 location_t loc;
31101 {
31102 tree property;
31105 {
31108 }
31112 else
31114 }
31117 }
31119 \f
31120 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31122 /* Returns name of the next clause.
31123 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31124 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31125 returned and the token is consumed. */
31127 static pragma_omp_clause
31129 {
31145 {
31150 {
31333 }
31334 }
31340 }
31342 /* Validate that a clause of the given type does not already exist. */
31344 static void
31347 {
31348 tree c;
31352 {
31355 }
31356 }
31358 /* OpenMP 2.5:
31359 variable-list:
31360 identifier
31361 variable-list , identifier
31363 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31364 colon). An opening parenthesis will have been consumed by the caller.
31366 If KIND is nonzero, create the appropriate node and install the decl
31367 in OMP_CLAUSE_DECL and add the node to the head of the list.
31369 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31370 return the list created.
31372 COLON can be NULL if only closing parenthesis should end the list,
31373 or pointer to bool which will receive false if the list is terminated
31374 by closing parenthesis or true if the list is terminated by colon. */
31376 static tree
31379 {
31383 {
31386 }
31388 {
31393 && current_class_ptr
31395 {
31401 }
31402 else
31403 {
31416 }
31418 ;
31420 {
31422 {
31424 /* The OpenACC cache directive explicitly only allows "array
31425 elements or subarrays". */
31427 {
31431 }
31432 /* FALLTHROUGH. */
31437 {
31438 location_t loc
31443 decl
31447 }
31448 /* FALLTHROUGH. */
31452 {
31460 parser->colon_corrects_to_scope_p
31464 else
31465 {
31466 /* Look for `:'. */
31470 CPP_CLOSE_SQUARE))
31472 }
31473 /* Look for the closing `]'. */
31475 RT_CLOSE_SQUARE))
31479 }
31483 }
31489 }
31490 else
31493 get_comma:
31497 }
31503 {
31507 }
31510 {
31513 /* Try to resync to an unnested comma. Copied from
31514 cp_parser_parenthesized_expression_list. */
31515 skip_comma:
31524 }
31527 }
31529 /* Similarly, but expect leading and trailing parenthesis. This is a very
31530 common case for omp clauses. */
31532 static tree
31534 {
31538 }
31540 /* OpenACC 2.0:
31541 copy ( variable-list )
31542 copyin ( variable-list )
31543 copyout ( variable-list )
31544 create ( variable-list )
31545 delete ( variable-list )
31546 present ( variable-list )
31547 present_or_copy ( variable-list )
31548 pcopy ( variable-list )
31549 present_or_copyin ( variable-list )
31550 pcopyin ( variable-list )
31551 present_or_copyout ( variable-list )
31552 pcopyout ( variable-list )
31553 present_or_create ( variable-list )
31554 pcreate ( variable-list ) */
31556 static tree
31558 tree list)
31559 {
31562 {
31608 }
31616 }
31618 /* OpenACC 2.0:
31619 deviceptr ( variable-list ) */
31621 static tree
31623 {
31627 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31628 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31629 variable-list must only allow for pointer variables. */
31632 {
31639 }
31642 }
31644 /* OpenACC 2.0:
31645 auto
31646 independent
31647 nohost
31648 seq */
31650 static tree
31654 {
31659 }
31661 /* OpenACC:
31662 num_gangs ( expression )
31663 num_workers ( expression )
31664 vector_length ( expression ) */
31666 static tree
31669 {
31672 matching_parens parens;
31680 {
31685 }
31693 }
31695 /* OpenACC:
31697 gang [( gang-arg-list )]
31698 worker [( [num:] int-expr )]
31699 vector [( [length:] int-expr )]
31701 where gang-arg is one of:
31703 [num:] int-expr
31704 static: size-expr
31706 and size-expr may be:
31708 *
31709 int-expr
31710 */
31712 static tree
31715 {
31725 {
31726 matching_parens parens;
31729 do
31730 {
31734 /* Gang static argument. */
31737 {
31745 {
31748 }
31750 /* Check for the '*' argument. */
31754 CPP_CLOSE_PAREN)))
31755 {
31760 {
31763 }
31765 }
31766 }
31767 /* Worker num: argument and vector length: arguments. */
31771 {
31774 }
31776 /* Now collect the actual argument. */
31778 {
31781 }
31793 {
31796 }
31798 }
31803 }
31817 cleanup_error:
31820 }
31822 /* OpenACC 2.0:
31823 tile ( size-expr-list ) */
31825 static tree
31827 {
31831 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31832 so, but the spec authors never considered such a case and have
31833 differing opinions on what it might mean, including 'not
31834 allowed'.) */
31837 clause_loc);
31842 do
31843 {
31850 {
31853 }
31854 else
31858 }
31861 /* Consume the trailing ')'. */
31869 }
31871 /* OpenACC 2.0
31872 Parse wait clause or directive parameters. */
31874 static tree
31876 {
31886 {
31891 }
31898 {
31902 {
31905 else
31906 {
31913 }
31914 }
31915 }
31918 }
31920 /* OpenACC:
31921 wait ( int-expr-list ) */
31923 static tree
31925 {
31934 }
31936 /* OpenMP 3.0:
31937 collapse ( constant-expression ) */
31939 static tree
31941 {
31943 location_t loc;
31944 HOST_WIDE_INT n;
31947 matching_parens parens;
31965 {
31968 }
31977 }
31979 /* OpenMP 2.5:
31980 default ( none | shared )
31982 OpenACC:
31983 default ( none | present ) */
31985 static tree
31988 {
31990 tree c;
31992 matching_parens parens;
31996 {
32001 {
32022 }
32025 }
32026 else
32027 {
32028 invalid_kind:
32031 else
32033 }
32050 }
32052 /* OpenMP 3.1:
32053 final ( expression ) */
32055 static tree
32057 {
32060 matching_parens parens;
32079 }
32081 /* OpenMP 2.5:
32082 if ( expression )
32084 OpenMP 4.5:
32085 if ( directive-name-modifier : expression )
32087 directive-name-modifier:
32088 parallel | task | taskloop | target data | target | target update
32089 | target enter data | target exit data */
32091 static tree
32094 {
32098 matching_parens parens;
32103 {
32115 {
32118 {
32131 else
32132 {
32133 location_t loc
32138 }
32141 {
32143 {
32148 }
32150 {
32151 location_t loc
32155 }
32156 }
32157 }
32158 }
32160 {
32162 {
32165 }
32166 else
32167 {
32169 {
32170 location_t loc
32173 }
32175 }
32176 }
32177 }
32189 {
32192 {
32195 {
32205 }
32207 p);
32209 }
32211 {
32214 else
32217 }
32220 {
32224 }
32225 }
32233 }
32235 /* OpenMP 3.1:
32236 mergeable */
32238 static tree
32241 {
32242 tree c;
32245 location);
32250 }
32252 /* OpenMP 2.5:
32253 nowait */
32255 static tree
32258 {
32259 tree c;
32266 }
32268 /* OpenMP 2.5:
32269 num_threads ( expression ) */
32271 static tree
32273 location_t location)
32274 {
32277 matching_parens parens;
32297 }
32299 /* OpenMP 4.5:
32300 num_tasks ( expression ) */
32302 static tree
32304 location_t location)
32305 {
32308 matching_parens parens;
32328 }
32330 /* OpenMP 4.5:
32331 grainsize ( expression ) */
32333 static tree
32335 location_t location)
32336 {
32339 matching_parens parens;
32359 }
32361 /* OpenMP 4.5:
32362 priority ( expression ) */
32364 static tree
32366 location_t location)
32367 {
32370 matching_parens parens;
32390 }
32392 /* OpenMP 4.5:
32393 hint ( expression ) */
32395 static tree
32397 location_t location)
32398 {
32401 matching_parens parens;
32420 }
32422 /* OpenMP 4.5:
32423 defaultmap ( tofrom : scalar ) */
32425 static tree
32427 location_t location)
32428 {
32432 matching_parens parens;
32437 {
32440 }
32444 {
32447 }
32453 {
32456 }
32460 {
32463 }
32469 location);
32475 out_err:
32480 }
32482 /* OpenMP 2.5:
32483 ordered
32485 OpenMP 4.5:
32486 ordered ( constant-expression ) */
32488 static tree
32491 {
32493 HOST_WIDE_INT n;
32499 {
32500 matching_parens parens;
32517 {
32519 "ordered argument needs positive constant integer "
32522 }
32523 }
32529 }
32531 /* OpenMP 2.5:
32532 reduction ( reduction-operator : variable-list )
32534 reduction-operator:
32535 One of: + * - & ^ | && ||
32537 OpenMP 3.1:
32539 reduction-operator:
32540 One of: + * - & ^ | && || min max
32542 OpenMP 4.0:
32544 reduction-operator:
32545 One of: + * - & ^ | && ||
32546 id-expression */
32548 static tree
32550 {
32558 {
32568 }
32572 else
32573 {
32584 {
32614 }
32615 else
32616 {
32618 resync_fail:
32623 }
32624 }
32630 NULL);
32632 {
32635 }
32638 }
32640 /* OpenMP 2.5:
32641 schedule ( schedule-kind )
32642 schedule ( schedule-kind , expression )
32644 schedule-kind:
32645 static | dynamic | guided | runtime | auto
32647 OpenMP 4.5:
32648 schedule ( schedule-modifier : schedule-kind )
32649 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32651 schedule-modifier:
32652 simd
32653 monotonic
32654 nonmonotonic */
32656 static tree
32658 {
32662 matching_parens parens;
32669 {
32678 else
32684 else
32685 {
32688 }
32689 }
32692 {
32697 {
32718 }
32719 }
32724 else
32730 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32732 {
32736 }
32739 {
32754 else
32759 }
32771 invalid_kind:
32773 resync_fail:
32778 }
32780 /* OpenMP 3.0:
32781 untied */
32783 static tree
32786 {
32787 tree c;
32794 }
32796 /* OpenMP 4.0:
32797 inbranch
32798 notinbranch */
32800 static tree
32803 {
32808 }
32810 /* OpenMP 4.0:
32811 parallel
32812 for
32813 sections
32814 taskgroup */
32816 static tree
32820 {
32824 }
32826 /* OpenMP 4.5:
32827 nogroup */
32829 static tree
32832 {
32837 }
32839 /* OpenMP 4.5:
32840 simd
32841 threads */
32843 static tree
32847 {
32852 }
32854 /* OpenMP 4.0:
32855 num_teams ( expression ) */
32857 static tree
32859 location_t location)
32860 {
32863 matching_parens parens;
32883 }
32885 /* OpenMP 4.0:
32886 thread_limit ( expression ) */
32888 static tree
32890 location_t location)
32891 {
32894 matching_parens parens;
32914 }
32916 /* OpenMP 4.0:
32917 aligned ( variable-list )
32918 aligned ( variable-list : constant-expression ) */
32920 static tree
32922 {
32926 matching_parens parens;
32934 {
32944 }
32950 }
32952 /* OpenMP 4.0:
32953 linear ( variable-list )
32954 linear ( variable-list : expression )
32956 OpenMP 4.5:
32957 linear ( modifier ( variable-list ) )
32958 linear ( modifier ( variable-list ) : expression ) */
32960 static tree
32963 {
32968 matching_parens parens;
32974 {
32986 else
32988 }
32993 else
32994 {
33003 }
33006 {
33011 {
33022 {
33025 }
33028 }
33033 {
33036 }
33044 }
33047 {
33050 }
33053 }
33055 /* OpenMP 4.0:
33056 safelen ( constant-expression ) */
33058 static tree
33060 location_t location)
33061 {
33064 matching_parens parens;
33083 }
33085 /* OpenMP 4.0:
33086 simdlen ( constant-expression ) */
33088 static tree
33090 location_t location)
33091 {
33094 matching_parens parens;
33113 }
33115 /* OpenMP 4.5:
33116 vec:
33117 identifier [+/- integer]
33118 vec , identifier [+/- integer]
33119 */
33121 static tree
33123 tree list)
33124 {
33128 {
33131 }
33134 {
33141 else
33142 {
33143 t = cp_parser_lookup_name_simple
33148 id_loc);
33149 }
33155 {
33158 }
33162 {
33165 }
33169 {
33172 }
33175 add_to_vector:
33177 {
33181 }
33187 }
33190 {
33196 }
33198 }
33200 /* OpenMP 4.0:
33201 depend ( depend-kind : variable-list )
33203 depend-kind:
33204 in | out | inout
33206 OpenMP 4.5:
33207 depend ( source )
33209 depend ( sink : vec ) */
33211 static tree
33213 {
33217 matching_parens parens;
33222 {
33236 else
33238 }
33239 else
33245 {
33255 }
33262 else
33263 {
33269 }
33272 invalid_kind:
33274 resync_fail:
33279 }
33281 /* OpenMP 4.0:
33282 map ( map-kind : variable-list )
33283 map ( variable-list )
33285 map-kind:
33286 alloc | to | from | tofrom
33288 OpenMP 4.5:
33289 map-kind:
33290 alloc | to | from | tofrom | release | delete
33292 map ( always [,] map-kind: variable-list ) */
33294 static tree
33296 {
33305 {
33310 {
33313 nth++;
33319 {
33324 }
33325 }
33326 }
33330 {
33344 else
33345 {
33351 }
33354 }
33357 {
33361 }
33364 NULL);
33370 }
33372 /* OpenMP 4.0:
33373 device ( expression ) */
33375 static tree
33377 location_t location)
33378 {
33381 matching_parens parens;
33401 }
33403 /* OpenMP 4.0:
33404 dist_schedule ( static )
33405 dist_schedule ( static , expression ) */
33407 static tree
33409 location_t location)
33410 {
33413 matching_parens parens;
33424 {
33435 }
33440 location);
33444 invalid_kind:
33446 resync_fail:
33451 }
33453 /* OpenMP 4.0:
33454 proc_bind ( proc-bind-kind )
33456 proc-bind-kind:
33457 master | close | spread */
33459 static tree
33461 location_t location)
33462 {
33463 tree c;
33470 {
33480 else
33482 }
33483 else
33492 location);
33497 invalid_kind:
33499 resync_fail:
33504 }
33506 /* OpenACC:
33507 async [( int-expr )] */
33509 static tree
33511 {
33518 {
33519 matching_parens parens;
33528 }
33538 }
33540 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33541 is a bitmask in MASK. Return the list of clauses found. */
33543 static tree
33547 {
33552 {
33553 location_t here;
33554 pragma_omp_clause c_kind;
33555 omp_clause_code code;
33566 {
33618 clauses);
33636 OMP_CLAUSE_INDEPENDENT,
33648 clauses);
33654 clauses);
33678 clauses);
33700 clauses);
33712 clauses);
33726 }
33731 {
33732 /* Remove the invalid clause(s) from the list to avoid
33733 confusing the rest of the compiler. */
33736 }
33737 }
33739 saw_error:
33746 }
33748 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33749 is a bitmask in MASK. Return the list of clauses found; the result
33750 of clause default goes in *pdefault. */
33752 static tree
33756 {
33762 {
33763 pragma_omp_clause c_kind;
33774 {
33786 clauses);
33800 clauses);
33820 clauses);
33825 clauses);
33835 clauses);
33869 clauses);
33883 clauses);
33900 OMP_CLAUSE_NOTINBRANCH,
33909 {
33910 clause_not_first:
33914 }
33944 clauses);
33945 else
33955 clauses);
33973 {
33981 }
34024 clauses
34030 clauses
34042 }
34047 {
34048 /* Remove the invalid clause(s) from the list to avoid
34049 confusing the rest of the compiler. */
34052 }
34053 }
34054 saw_error:
34055 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
34056 no reason to skip to the end. */
34060 {
34063 else
34065 }
34067 }
34069 /* OpenMP 2.5:
34070 structured-block:
34071 statement
34073 In practice, we're also interested in adding the statement to an
34074 outer node. So it is convenient if we work around the fact that
34075 cp_parser_statement calls add_stmt. */
34077 static unsigned
34079 {
34082 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34083 This preserves the "not within loop or switch" style error messages
34084 for nonsense cases like
34085 void foo() {
34086 #pragma omp single
34087 break;
34088 }
34089 */
34094 }
34096 static void
34098 {
34100 }
34102 static tree
34104 {
34112 }
34114 /* OpenMP 2.5:
34115 # pragma omp atomic new-line
34116 expression-stmt
34118 expression-stmt:
34119 x binop= expr | x++ | ++x | x-- | --x
34120 binop:
34121 +, *, -, /, &, ^, |, <<, >>
34123 where x is an lvalue expression with scalar type.
34125 OpenMP 3.1:
34126 # pragma omp atomic new-line
34127 update-stmt
34129 # pragma omp atomic read new-line
34130 read-stmt
34132 # pragma omp atomic write new-line
34133 write-stmt
34135 # pragma omp atomic update new-line
34136 update-stmt
34138 # pragma omp atomic capture new-line
34139 capture-stmt
34141 # pragma omp atomic capture new-line
34142 capture-block
34144 read-stmt:
34145 v = x
34146 write-stmt:
34147 x = expr
34148 update-stmt:
34149 expression-stmt | x = x binop expr
34150 capture-stmt:
34151 v = expression-stmt
34152 capture-block:
34153 { v = x; update-stmt; } | { update-stmt; v = x; }
34155 OpenMP 4.0:
34156 update-stmt:
34157 expression-stmt | x = x binop expr | x = expr binop x
34158 capture-stmt:
34159 v = update-stmt
34160 capture-block:
34161 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34163 where x and v are lvalue expressions with scalar type. */
34165 static void
34167 {
34175 {
34180 {
34186 }
34187 }
34189 {
34201 else
34205 }
34207 {
34213 {
34218 {
34221 }
34222 }
34223 }
34227 {
34237 else
34242 {
34243 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34244 opcode. */
34249 }
34253 {
34256 }
34257 else
34258 {
34264 }
34267 }
34269 restart:
34273 {
34280 /* FALLTHROUGH */
34290 /* FALLTHROUGH */
34305 /* Undo effects of boolean_increment for post {in,de}crement. */
34307 /* FALLTHRU */
34311 {
34312 /* Undo effects of boolean_increment. */
34314 {
34315 /* This is pre or post increment. */
34320 && !structured_block
34324 }
34325 }
34326 /* FALLTHRU */
34329 {
34364 {
34368 }
34371 {
34377 {
34382 }
34384 {
34396 {
34398 {
34403 }
34404 else
34406 }
34410 }
34413 {
34420 }
34424 }
34428 {
34431 {
34439 }
34441 {
34446 }
34481 }
34492 /* FALLTHROUGH */
34497 }
34504 }
34505 stmt_done:
34507 {
34518 }
34520 {
34523 }
34524 done:
34530 saw_error:
34533 {
34537 {
34541 }
34542 }
34543 }
34546 /* OpenMP 2.5:
34547 # pragma omp barrier new-line */
34549 static void
34551 {
34554 }
34556 /* OpenMP 2.5:
34557 # pragma omp critical [(name)] new-line
34558 structured-block
34560 OpenMP 4.5:
34561 # pragma omp critical [(name) [hint(expression)]] new-line
34562 structured-block */
34564 #define OMP_CRITICAL_CLAUSE_MASK \
34565 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34567 static tree
34569 {
34573 {
34574 matching_parens parens;
34588 OMP_CRITICAL_CLAUSE_MASK,
34590 }
34591 else
34596 }
34598 /* OpenMP 2.5:
34599 # pragma omp flush flush-vars[opt] new-line
34601 flush-vars:
34602 ( variable-list ) */
34604 static void
34606 {
34612 }
34614 /* Helper function, to parse omp for increment expression. */
34616 static tree
34618 {
34623 {
34626 }
34629 {
34638 /* Fall through: OpenMP disallows NE_EXPR. */
34642 }
34644 /* If decl is an iterator, preserve LHS and RHS of the relational
34645 expr until finish_omp_for. */
34656 }
34658 /* Helper function, to parse omp for increment expression. */
34660 static tree
34662 {
34666 cp_id_kind idk;
34670 {
34679 }
34688 {
34693 }
34700 {
34704 }
34717 do
34718 {
34725 {
34727 {
34730 else
34732 tf_warning_or_error);
34733 }
34734 else
34737 }
34738 }
34742 {
34748 }
34749 else
34753 }
34755 /* Parse the initialization statement of either an OpenMP for loop or
34756 a Cilk Plus for loop.
34758 Return true if the resulting construct should have an
34759 OMP_CLAUSE_PRIVATE added to it. */
34761 static tree
34770 {
34776 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34778 init-expr:
34779 var = lb
34780 integer-type var = lb
34781 random-access-iterator-type var = lb
34782 pointer-type var = lb
34783 */
34784 cp_decl_specifier_seq type_specifiers;
34786 /* First, try to parse as an initialized declaration. See
34787 cp_parser_condition, from whence the bulk of this is copied. */
34794 {
34795 /* If parsing a type specifier seq succeeded, then this
34796 MUST be a initialized declaration. */
34801 CP_PARSER_DECLARATOR_NAMED,
34812 else
34813 {
34823 {
34825 CPP_OPEN_PAREN))
34826 {
34830 else
34833 }
34834 else
34835 /* Trigger an error. */
34840 }
34844 {
34852 {
34855 auto_node);
34860 }
34863 asm_specification,
34864 LOOKUP_ONLYCONVERTING);
34867 {
34870 }
34871 else
34872 {
34875 {
34877 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34879 {
34883 {
34887 }
34889 }
34891 {
34896 }
34897 }
34898 }
34900 }
34901 else
34902 {
34903 /* Consume '='. */
34907 non_class:
34910 else
34913 asm_specification,
34914 LOOKUP_ONLYCONVERTING);
34915 }
34919 }
34920 }
34921 else
34922 {
34923 cp_id_kind idk;
34924 /* If parsing a type specifier sequence failed, then
34925 this MUST be a simple expression. */
34934 && decl
34937 {
34948 {
34953 }
34958 }
34960 && decl
34963 {
34964 tree rhs;
34972 rhs,
34973 tf_warning_or_error));
34976 }
34977 else
34978 {
34983 {
34987 }
34988 }
34989 }
34991 }
34993 /* Parse the restricted form of the for statement allowed by OpenMP. */
34995 static tree
34998 {
35002 location_t loc_first;
35013 {
35016 }
35019 {
35022 }
35025 {
35031 }
35033 {
35036 {
35038 "%<linear%> clause may not be specified together "
35041 }
35042 else
35044 }
35057 {
35060 location_t loc;
35064 {
35068 }
35071 {
35075 }
35078 matching_parens parens;
35085 add_private_clause
35092 {
35095 {
35101 }
35102 else
35104 }
35111 {
35116 {
35120 }
35123 {
35124 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35128 {
35131 }
35132 else
35133 {
35136 }
35138 }
35139 else
35140 {
35145 }
35146 }
35149 {
35150 tree c;
35152 {
35161 decl);
35165 decl);
35166 }
35168 {
35173 else
35178 {
35181 /* For linear, signal that we need to fill up
35182 the so far unknown linear step. */
35185 }
35186 }
35187 }
35196 {
35197 /* If decl is an iterator, preserve the operator on decl
35198 until finish_omp_for. */
35200 && ((processing_template_decl
35205 else
35209 }
35221 {
35224 }
35229 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35230 in between the collapsed for loops to be still considered perfectly
35231 nested. Hopefully the final version clarifies this.
35232 For now handle (multiple) {'s and empty statements. */
35235 {
35239 {
35241 bracecount++;
35242 }
35246 else
35247 {
35254 }
35255 }
35258 {
35261 }
35262 }
35267 /* Note that we saved the original contents of this flag when we entered
35268 the structured block, and so we don't need to re-save it here. */
35271 else
35274 /* Note that the grammar doesn't call for a structured block here,
35275 though the loop as a whole is a structured block. */
35282 else
35287 {
35289 {
35291 nbraces--;
35292 }
35295 else
35296 {
35298 {
35301 }
35306 }
35307 }
35310 {
35314 else
35316 }
35320 }
35322 /* Helper function for OpenMP parsing, split clauses and call
35323 finish_omp_clauses on each of the set of clauses afterwards. */
35325 static void
35328 {
35334 }
35336 /* OpenMP 4.0:
35337 #pragma omp simd simd-clause[optseq] new-line
35338 for-loop */
35340 #define OMP_SIMD_CLAUSE_MASK \
35341 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35342 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35348 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35350 static tree
35354 {
35365 {
35369 OMP_CLAUSE_ORDERED);
35371 {
35373 "%<ordered%> clause with parameter may not be specified "
35376 }
35377 }
35388 }
35390 /* OpenMP 2.5:
35391 #pragma omp for for-clause[optseq] new-line
35392 for-loop
35394 OpenMP 4.0:
35395 #pragma omp for simd for-simd-clause[optseq] new-line
35396 for-loop */
35398 #define OMP_FOR_CLAUSE_MASK \
35399 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35409 static tree
35413 {
35420 /* parallel for{, simd} disallows nowait clause, but for
35421 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35424 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35429 {
35434 {
35458 }
35459 }
35461 {
35464 }
35466 /* Composite distribute parallel for disallows linear clause. */
35473 {
35476 }
35487 }
35489 /* OpenMP 2.5:
35490 # pragma omp master new-line
35491 structured-block */
35493 static tree
35495 {
35499 }
35501 /* OpenMP 2.5:
35502 # pragma omp ordered new-line
35503 structured-block
35505 OpenMP 4.5:
35506 # pragma omp ordered ordered-clauses new-line
35507 structured-block */
35509 #define OMP_ORDERED_CLAUSE_MASK \
35510 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35513 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35514 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35516 static bool
35519 {
35523 {
35528 {
35530 {
35533 }
35535 {
35537 "%<depend%> clause may only be used in compound "
35541 }
35542 tree clauses
35544 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35548 }
35549 }
35551 tree clauses
35562 }
35564 /* OpenMP 2.5:
35566 section-scope:
35567 { section-sequence }
35569 section-sequence:
35570 section-directive[opt] structured-block
35571 section-sequence section-directive structured-block */
35573 static tree
35575 {
35580 matching_braces braces;
35588 {
35592 }
35595 {
35603 {
35607 }
35609 {
35612 }
35617 }
35628 }
35630 /* OpenMP 2.5:
35631 # pragma omp sections sections-clause[optseq] newline
35632 sections-scope */
35634 #define OMP_SECTIONS_CLAUSE_MASK \
35635 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35636 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35637 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35638 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35639 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35641 static tree
35644 {
35656 {
35659 }
35666 }
35668 /* OpenMP 2.5:
35669 # pragma omp parallel parallel-clause[optseq] new-line
35670 structured-block
35671 # pragma omp parallel for parallel-for-clause[optseq] new-line
35672 structured-block
35673 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35674 structured-block
35676 OpenMP 4.0:
35677 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35678 structured-block */
35680 #define OMP_PARALLEL_CLAUSE_MASK \
35681 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35691 static tree
35695 {
35702 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35708 {
35716 if_p);
35720 if_p);
35723 block);
35728 }
35729 /* When combined with distribute, parallel has to be followed by for.
35730 #pragma omp target parallel is allowed though. */
35734 {
35738 }
35740 {
35743 }
35745 {
35749 {
35759 block);
35762 }
35763 }
35768 {
35771 }
35779 }
35781 /* OpenMP 2.5:
35782 # pragma omp single single-clause[optseq] new-line
35783 structured-block */
35785 #define OMP_SINGLE_CLAUSE_MASK \
35786 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35791 static tree
35793 {
35803 }
35805 /* OpenMP 3.0:
35806 # pragma omp task task-clause[optseq] new-line
35807 structured-block */
35809 #define OMP_TASK_CLAUSE_MASK \
35810 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35821 static tree
35823 {
35834 }
35836 /* OpenMP 3.0:
35837 # pragma omp taskwait new-line */
35839 static void
35841 {
35844 }
35846 /* OpenMP 3.1:
35847 # pragma omp taskyield new-line */
35849 static void
35851 {
35854 }
35856 /* OpenMP 4.0:
35857 # pragma omp taskgroup new-line
35858 structured-block */
35860 static tree
35862 {
35866 if_p));
35867 }
35870 /* OpenMP 2.5:
35871 # pragma omp threadprivate (variable-list) */
35873 static void
35875 {
35876 tree vars;
35882 }
35884 /* OpenMP 4.0:
35885 # pragma omp cancel cancel-clause[optseq] new-line */
35887 #define OMP_CANCEL_CLAUSE_MASK \
35888 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35892 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35894 static void
35896 {
35900 }
35902 /* OpenMP 4.0:
35903 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35905 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35906 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35907 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35908 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35909 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35911 static void
35914 {
35915 tree clauses;
35919 {
35924 {
35927 }
35928 }
35930 {
35934 }
35937 {
35942 else
35946 }
35949 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35951 pragma_tok);
35953 }
35955 /* OpenMP 4.0:
35956 #pragma omp distribute distribute-clause[optseq] new-line
35957 for-loop */
35959 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35960 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35962 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35963 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35964 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35966 static tree
35970 {
35979 {
35987 else
35990 {
35996 {
36000 else
36003 }
36009 else
36023 }
36024 }
36026 {
36029 }
36034 {
36037 }
36048 }
36050 /* OpenMP 4.0:
36051 # pragma omp teams teams-clause[optseq] new-line
36052 structured-block */
36054 #define OMP_TEAMS_CLAUSE_MASK \
36055 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36063 static tree
36067 {
36076 {
36080 {
36105 }
36106 }
36108 {
36111 }
36116 {
36119 }
36128 }
36130 /* OpenMP 4.0:
36131 # pragma omp target data target-data-clause[optseq] new-line
36132 structured-block */
36134 #define OMP_TARGET_DATA_CLAUSE_MASK \
36135 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36140 static tree
36142 {
36143 tree clauses
36148 {
36151 {
36168 "%<#pragma omp target data%> with map-type other "
36169 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36173 }
36175 }
36178 {
36181 "%<#pragma omp target data%> must contain at least "
36184 }
36195 }
36197 /* OpenMP 4.5:
36198 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36199 structured-block */
36201 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36202 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36204 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36205 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36206 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36208 static tree
36211 {
36214 {
36219 {
36222 }
36223 }
36225 {
36229 }
36232 {
36238 }
36240 tree clauses
36245 {
36248 {
36261 "%<#pragma omp target enter data%> with map-type other "
36265 }
36267 }
36270 {
36273 "%<#pragma omp target enter data%> must contain at least "
36276 }
36283 }
36285 /* OpenMP 4.5:
36286 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36287 structured-block */
36289 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36290 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36296 static tree
36299 {
36302 {
36307 {
36310 }
36311 }
36313 {
36317 }
36320 {
36326 }
36328 tree clauses
36333 {
36336 {
36350 "%<#pragma omp target exit data%> with map-type other "
36351 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36355 }
36357 }
36360 {
36363 "%<#pragma omp target exit data%> must contain at least "
36366 }
36373 }
36375 /* OpenMP 4.0:
36376 # pragma omp target update target-update-clause[optseq] new-line */
36378 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36379 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36386 static bool
36389 {
36391 {
36397 }
36399 tree clauses
36404 {
36406 "%<#pragma omp target update%> must contain at least one "
36409 }
36417 }
36419 /* OpenMP 4.0:
36420 # pragma omp target target-clause[optseq] new-line
36421 structured-block */
36423 #define OMP_TARGET_CLAUSE_MASK \
36424 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36431 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36432 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36434 static bool
36437 {
36441 {
36453 {
36461 {
36462 tree stmt;
36464 {
36467 OMP_TARGET_CLAUSE_MASK,
36472 OMP_TARGET_CLAUSE_MASK,
36477 OMP_TARGET_CLAUSE_MASK,
36482 }
36484 }
36489 {
36493 if_p);
36498 if_p);
36503 if_p);
36507 }
36513 {
36514 /* For combined target teams, ensure the num_teams and
36515 thread_limit clause expressions are evaluated on the host,
36516 before entering the target construct. */
36517 tree c;
36523 {
36532 OMP_CLAUSE_FIRSTPRIVATE);
36537 }
36538 }
36548 }
36550 {
36553 }
36555 {
36559 }
36561 {
36565 }
36567 {
36571 }
36573 {
36576 }
36577 }
36579 {
36582 }
36597 check_clauses:
36599 {
36602 {
36616 "%<#pragma omp target%> with map-type other "
36617 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36621 }
36623 }
36625 }
36627 /* OpenACC 2.0:
36628 # pragma acc cache (variable-list) new-line
36629 */
36631 static tree
36633 {
36648 }
36650 /* OpenACC 2.0:
36651 # pragma acc data oacc-data-clause[optseq] new-line
36652 structured-block */
36654 #define OACC_DATA_CLAUSE_MASK \
36655 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36661 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36662 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36663 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36667 static tree
36669 {
36682 }
36684 /* OpenACC 2.0:
36685 # pragma acc host_data <clauses> new-line
36686 structured-block */
36688 #define OACC_HOST_DATA_CLAUSE_MASK \
36689 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36691 static tree
36693 {
36706 }
36708 /* OpenACC 2.0:
36709 # pragma acc declare oacc-data-clause[optseq] new-line
36710 */
36712 #define OACC_DECLARE_CLAUSE_MASK \
36713 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36715 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36716 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36717 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36722 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36726 static tree
36728 {
36737 {
36741 }
36744 {
36748 {
36752 }
36755 {
36767 {
36769 "%qD must be a global variable in "
36771 decl);
36774 }
36779 {
36783 }
36785 {
36787 "invalid use of %<extern%> variable %qD "
36791 }
36793 {
36795 "invalid use of %<global%> variable %qD "
36799 }
36801 }
36806 {
36811 }
36814 {
36815 tree id;
36819 else
36825 {
36828 {
36831 {
36835 }
36836 }
36837 }
36838 }
36839 }
36852 }
36854 /* OpenACC 2.0:
36855 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36857 or
36859 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36861 LOC is the location of the #pragma token.
36862 */
36864 #define OACC_ENTER_DATA_CLAUSE_MASK \
36865 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36873 #define OACC_EXIT_DATA_CLAUSE_MASK \
36874 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36880 static tree
36883 {
36892 {
36897 }
36904 else
36909 {
36913 }
36921 }
36923 /* OpenACC 2.0:
36924 # pragma acc loop oacc-loop-clause[optseq] new-line
36925 structured-block */
36927 #define OACC_LOOP_CLAUSE_MASK \
36928 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36929 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36930 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36931 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36932 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36933 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36934 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36935 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36936 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36937 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36939 static tree
36942 {
36951 {
36957 }
36966 }
36968 /* OpenACC 2.0:
36969 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36970 structured-block
36972 or
36974 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36975 structured-block
36976 */
36978 #define OACC_KERNELS_CLAUSE_MASK \
36979 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36980 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36981 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36982 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36983 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36984 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36988 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36989 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36990 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36991 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36997 #define OACC_PARALLEL_CLAUSE_MASK \
36998 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
37000 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
37001 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
37002 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
37003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
37004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
37005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
37006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37007 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
37008 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
37009 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
37010 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
37011 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
37012 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
37013 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37014 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37015 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37016 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37019 static tree
37022 {
37023 omp_clause_mask mask;
37026 {
37039 }
37042 {
37046 {
37049 tree clauses;
37051 if_p);
37053 }
37054 }
37063 }
37065 /* OpenACC 2.0:
37066 # pragma acc update oacc-update-clause[optseq] new-line
37067 */
37069 #define OACC_UPDATE_CLAUSE_MASK \
37070 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37077 static tree
37079 {
37086 {
37088 "%<#pragma acc update%> must contain at least one "
37091 }
37099 }
37101 /* OpenACC 2.0:
37102 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37104 LOC is the location of the #pragma token.
37105 */
37107 #define OACC_WAIT_CLAUSE_MASK \
37108 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37110 static tree
37112 {
37126 }
37128 /* OpenMP 4.0:
37129 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37131 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37132 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37133 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37134 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37135 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37136 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37139 static void
37142 {
37144 cp_omp_declare_simd_data data;
37146 {
37151 /* It is safe to take the address of a local variable; it will only be
37152 used while this scope is live. */
37154 }
37156 /* Store away all pragma tokens. */
37168 {
37172 {
37185 }
37190 "%<#pragma omp declare simd%> not immediately followed by "
37194 }
37195 }
37197 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
37198 This function is modelled similar to the late parsing of omp declare
37199 simd. */
37201 static tree
37203 {
37210 {
37212 "used in the same function marked as a Cilk Plus SIMD-enabled "
37218 }
37220 {
37224 }
37229 {
37236 NULL);
37250 }
37256 }
37258 /* Finalize #pragma omp declare simd clauses after direct declarator has
37259 been parsed, and put that into "omp declare simd" attribute. */
37261 static tree
37263 {
37269 {
37273 }
37278 {
37296 }
37300 }
37303 /* OpenMP 4.0:
37304 # pragma omp declare target new-line
37305 declarations and definitions
37306 # pragma omp end declare target new-line
37308 OpenMP 4.5:
37309 # pragma omp declare target ( extended-list ) new-line
37311 # pragma omp declare target declare-target-clauses[seq] new-line */
37313 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37314 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37317 static void
37319 {
37322 clauses
37326 {
37328 clauses);
37331 }
37332 else
37333 {
37337 }
37340 "%<#pragma omp declare target%> with clauses in between "
37341 "%<#pragma omp declare target%> without clauses and "
37344 {
37350 {
37353 }
37354 else
37357 {
37359 "%qD specified both in declare target %<link%> and %<to%>"
37362 }
37364 {
37371 {
37374 {
37378 }
37379 }
37380 }
37381 }
37382 }
37384 static void
37386 {
37389 {
37392 }
37394 {
37398 {
37401 }
37404 else
37405 {
37409 }
37410 }
37411 else
37412 {
37416 }
37420 "%<#pragma omp end declare target%> without corresponding "
37422 else
37424 }
37426 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37427 expression and optional initializer clause of
37428 #pragma omp declare reduction. We store the expression(s) as
37429 either 3, 6 or 7 special statements inside of the artificial function's
37430 body. The first two statements are DECL_EXPRs for the artificial
37431 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37432 expression that uses those variables.
37433 If there was any INITIALIZER clause, this is followed by further statements,
37434 the fourth and fifth statements are DECL_EXPRs for the artificial
37435 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37436 constructor variant (first token after open paren is not omp_priv),
37437 then the sixth statement is a statement with the function call expression
37438 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37439 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37440 to initialize the OMP_PRIV artificial variable and there is seventh
37441 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37443 static bool
37445 {
37457 tree combiner;
37472 {
37475 }
37478 {
37480 matching_parens parens;
37486 {
37489 }
37505 {
37509 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37513 == CPP_CLOSE_PAREN
37516 {
37520 }
37525 }
37526 else
37527 {
37543 {
37548 }
37550 tree arg;
37563 }
37574 }
37578 UNKNOWN_LOCATION);
37581 }
37583 /* OpenMP 4.0
37584 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37585 initializer-clause[opt] new-line
37587 initializer-clause:
37588 initializer (omp_priv initializer)
37589 initializer (function-name (argument-list)) */
37591 static void
37594 {
37604 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37611 {
37643 }
37655 /* Types may not be defined in declare reduction type list. */
37658 parser->type_definition_forbidden_message
37664 saved_colon_doesnt_start_class_def_p
37669 {
37673 ;
37692 else
37697 else
37699 }
37701 /* Restore the saved message. */
37704 parser->colon_doesnt_start_class_def_p
37709 {
37710 fail:
37713 }
37719 {
37720 tree fntype
37723 NULL_TREE);
37743 {
37748 }
37750 {
37752 {
37761 }
37768 }
37769 else
37770 {
37773 }
37776 else
37779 {
37782 }
37784 {
37787 else
37792 }
37797 else
37798 {
37807 }
37814 }
37818 done:
37819 /* Free any declarators allocated. */
37821 }
37823 /* OpenMP 4.0
37824 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37825 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37826 initializer-clause[opt] new-line
37827 #pragma omp declare target new-line */
37829 static void
37832 {
37834 {
37839 {
37842 context);
37844 }
37847 {
37850 context);
37852 }
37854 {
37857 }
37859 {
37863 }
37864 }
37868 }
37870 /* OpenMP 4.5:
37871 #pragma omp taskloop taskloop-clause[optseq] new-line
37872 for-loop
37874 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37875 for-loop */
37877 #define OMP_TASKLOOP_CLAUSE_MASK \
37878 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37884 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37885 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37886 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37887 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37888 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37889 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37890 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37891 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37893 static tree
37897 {
37906 {
37911 {
37935 }
37936 }
37938 {
37941 }
37946 {
37949 }
37955 if_p);
37961 }
37964 /* OpenACC 2.0:
37965 # pragma acc routine oacc-routine-clause[optseq] new-line
37966 function-definition
37968 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37969 */
37971 #define OACC_ROUTINE_CLAUSE_MASK \
37972 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37978 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37979 component, which must resolve to a declared namespace-scope
37980 function. The clauses are either processed directly (for a named
37981 function), or defered until the immediatley following declaration
37982 is parsed. */
37984 static void
37987 {
37989 /* The checking for "another pragma following this one" in the "no optional
37990 '( name )'" case makes sure that we dont re-enter. */
37993 cp_oacc_routine_data data;
37999 /* It is safe to take the address of a local variable; it will only be
38000 used while this scope is live. */
38003 /* Look for optional '( name )'. */
38005 {
38006 matching_parens parens;
38009 /* We parse the name as an id-expression. If it resolves to
38010 anything other than a non-overloaded function at namespace
38011 scope, it's an error. */
38025 {
38029 }
38031 data.clauses
38039 {
38044 }
38046 /* Perhaps we should use the same rule as declarations in different
38047 namespaces? */
38049 {
38054 }
38057 {
38061 }
38065 }
38067 {
38068 /* Store away all pragma tokens. */
38079 /* Emit a helpful diagnostic if there's another pragma following this
38080 one. */
38082 {
38085 /* ..., and then just keep going. */
38087 }
38089 /* We only have to consider the pragma_external case here. */
38094 else
38097 }
38098 }
38100 /* Finalize #pragma acc routine clauses after direct declarator has
38101 been parsed. */
38103 static tree
38105 {
38110 {
38112 "%<#pragma acc routine%> not immediately followed by "
38115 }
38132 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38133 fndecl_seen. */
38136 }
38138 /* Apply any saved OpenACC routine clauses to a just-parsed
38139 declaration. */
38141 static void
38143 {
38145 {
38146 /* Keep going if we're in error reporting mode. */
38152 {
38154 "%<#pragma acc routine%> not immediately followed by"
38158 }
38160 {
38163 }
38166 {
38171 }
38174 {
38182 }
38184 /* Process the routine's dimension clauses. */
38188 /* Add an "omp declare target" attribute. */
38193 /* Don't unset parser->oacc_routine here: we may still need it to
38194 diagnose wrong usage. But, remember that we've used this "#pragma acc
38195 routine". */
38197 }
38198 }
38200 /* Main entry point to OpenMP statement pragmas. */
38202 static void
38204 {
38205 tree stmt;
38210 {
38233 if_p);
38238 if_p);
38255 if_p);
38260 if_p);
38268 if_p);
38277 if_p);
38291 if_p);
38296 if_p);
38300 }
38303 }
38304 \f
38305 /* Transactional Memory parsing routines. */
38307 /* Parse a transaction attribute.
38309 txn-attribute:
38310 attribute
38311 [ [ identifier ] ]
38313 We use this instead of cp_parser_attributes_opt for transactions to avoid
38314 the pedwarn in C++98 mode. */
38316 static tree
38318 {
38333 {
38337 /* For keywords, use the canonical spelling,
38338 not the parsed identifier. */
38342 }
38343 else
38347 error1:
38350 }
38352 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38354 transaction-statement:
38355 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38356 compound-statement
38357 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38358 */
38360 static tree
38362 {
38373 else
38374 {
38378 }
38380 /* Parse a noexcept specification. */
38384 {
38385 /* cancel-and-throw is unimplemented. */
38388 }
38389 else
38392 /* Keep track if we're in the lexical scope of an outer transaction. */
38404 }
38406 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38408 transaction-expression:
38409 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38410 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38411 */
38413 static tree
38415 {
38428 keyword == RID_TRANSACTION_RELAXED
38442 /* Set this early. This might mean that we allow transaction_cancel in
38443 an expression that we find out later actually has to be a constexpr.
38444 However, we expect that cxx_constant_value will be able to deal with
38445 this; also, if the noexcept has no constexpr, then what we parse next
38446 really is a transaction's body. */
38449 /* Parse a noexcept specification. */
38455 {
38456 matching_parens parens;
38463 }
38464 else
38465 {
38466 /* The only expression that is available got parsed for the noexcept
38467 already. noexcept is true then. */
38470 }
38479 }
38481 /* Parse a function-transaction-block.
38483 function-transaction-block:
38484 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38485 function-body
38486 __transaction_atomic txn-attribute[opt] function-try-block
38487 __transaction_relaxed ctor-initializer[opt] function-body
38488 __transaction_relaxed function-try-block
38489 */
38491 static void
38493 {
38508 else
38509 {
38513 }
38521 else
38522 cp_parser_ctor_initializer_opt_and_function_body
38528 }
38530 /* Parse a __transaction_cancel statement.
38532 cancel-statement:
38533 __transaction_cancel txn-attribute[opt] ;
38534 __transaction_cancel txn-attribute[opt] throw-expression ;
38536 ??? Cancel and throw is not yet implemented. */
38538 static tree
38540 {
38546 RT_TRANSACTION_CANCEL);
38553 /* ??? Parse cancel-and-throw here. */
38558 {
38562 }
38564 {
38568 }
38570 {
38573 {
38579 }
38580 }
38582 {
38586 }
38592 }
38593 \f
38594 /* The parser. */
38598 \f
38599 /* Special handling for the first token or line in the file. The first
38600 thing in the file might be #pragma GCC pch_preprocess, which loads a
38601 PCH file, which is a GC collection point. So we need to handle this
38602 first pragma without benefit of an existing lexer structure.
38604 Always returns one token to the caller in *FIRST_TOKEN. This is
38605 either the true first token of the file, or the first token after
38606 the initial pragma. */
38608 static void
38610 {
38619 {
38626 }
38627 else
38630 /* Skip to the end of the pragma. */
38634 /* Now actually load the PCH file. */
38638 /* Read one more token to return to our caller. We have to do this
38639 after reading the PCH file in, since its pointers have to be
38640 live. */
38642 }
38644 /* Parses the grainsize pragma for the _Cilk_for statement.
38645 Syntax:
38646 #pragma cilk grainsize = <VALUE>. */
38648 static void
38650 {
38652 {
38657 {
38660 }
38662 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38665 else
38667 "%<#pragma cilk grainsize%> is not followed by "
38670 }
38672 }
38674 /* Normal parsing of a pragma token. Here we can (and must) use the
38675 regular lexer. */
38677 static bool
38679 {
38682 tree stmt;
38693 {
38701 {
38711 }
38716 {
38726 }
38731 {
38742 }
38747 {
38758 }
38763 {
38774 }
38795 {
38800 }
38808 {
38813 }
38821 {
38825 }
38831 {
38836 }
38844 {
38849 }
38904 "%<#pragma omp section%> may only be used in "
38909 {
38911 {
38915 }
38922 {
38925 }
38928 }
38932 {
38936 }
38944 {
38948 }
38950 /* Ignore the pragma if Cilk Plus is not enabled. */
38952 {
38955 }
38956 else
38957 {
38961 }
38968 bad_stmt:
38971 }
38975 }
38977 /* The interface the pragma parsers have to the lexer. */
38979 enum cpp_ttype
38981 {
38993 else
38994 {
38998 }
39001 }
39003 \f
39004 /* External interface. */
39006 /* Parse one entire translation unit. */
39008 void
39010 {
39023 }
39025 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
39026 vectorlength clause:
39027 Syntax:
39028 vectorlength ( constant-expression ) */
39030 static tree
39033 {
39035 tree expr;
39036 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
39037 safelen clause. Thus, vectorlength is represented as OMP 4.0
39038 safelen. For SIMD-enabled function it is represented by OMP 4.0
39039 simdlen. */
39042 loc);
39043 else
39045 loc);
39047 matching_parens parens;
39054 /* If expr == error_mark_node, then don't emit any errors nor
39055 create a clause. if any of the above functions returns
39056 error mark node then they would have emitted an error message. */
39058 ;
39066 else
39067 {
39068 tree c;
39070 {
39075 }
39076 else
39077 {
39082 }
39083 }
39088 }
39090 /* Handles the Cilk Plus #pragma simd linear clause.
39091 Syntax:
39092 linear ( simd-linear-variable-list )
39094 simd-linear-variable-list:
39095 simd-linear-variable
39096 simd-linear-variable-list , simd-linear-variable
39098 simd-linear-variable:
39099 id-expression
39100 id-expression : simd-linear-step
39102 simd-linear-step:
39103 conditional-expression */
39105 static tree
39107 {
39113 {
39117 }
39122 {
39125 {
39129 }
39136 {
39140 }
39141 else
39142 {
39146 /* If present, parse the linear step. Otherwise, assume the default
39147 value of 1. */
39149 {
39156 {
39157 /* If an error has occurred, then the whole pragma is
39158 considered ill-formed. Thus, no reason to keep
39159 parsing. */
39162 }
39170 else
39172 "step size must be an integer constant "
39174 }
39176 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
39182 }
39187 else
39188 {
39193 }
39194 }
39198 }
39200 /* Returns the name of the next clause. If the clause is not
39201 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
39202 token is not consumed. Otherwise, the appropriate enum from the
39203 pragma_simd_clause is returned and the token is consumed. */
39205 static pragma_omp_clause
39207 {
39208 pragma_omp_clause clause_type;
39225 else
39230 }
39232 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
39234 static tree
39236 {
39241 {
39242 pragma_omp_clause c_kind;
39249 /* Use the OpenMP 4.0 equivalent function. */
39252 /* Use the OpenMP 4.0 equivalent function. */
39254 clauses);
39256 /* Use the OMP 4.0 equivalent function. */
39258 clauses);
39260 /* Use the OMP 4.0 equivalent function. */
39262 else
39263 {
39267 }
39268 }
39274 else
39276 }
39278 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
39280 static void
39282 {
39289 {
39293 }
39302 }
39304 /* Main entry-point for parsing Cilk Plus _Cilk_for
39305 loops. The return value is error_mark_node
39306 when errors happen and CILK_FOR tree on success. */
39308 static tree
39310 {
39325 else
39331 }
39333 /* Create an identifier for a generic parameter type (a synthesized
39334 template parameter implied by `auto' or a concept identifier). */
39337 static tree
39339 {
39343 }
39345 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39346 (creating a new template parameter list if necessary). Returns the newly
39347 created template type parm. */
39349 static tree
39351 {
39354 /* Before committing to modifying any scope, if we're in an
39355 implicit template scope, and we're trying to synthesize a
39356 constrained parameter, try to find a previous parameter with
39357 the same name. This is the same-type rule for abbreviated
39358 function templates.
39360 NOTE: We can generate implicit parameters when tentatively
39361 parsing a nested name specifier, only to reject that parse
39362 later. However, matching the same template-id as part of a
39363 direct-declarator should generate an identical template
39364 parameter, so this rule will merge them. */
39366 {
39369 {
39371 {
39374 /* Return the TEMPLATE_PARM_INDEX. */
39377 }
39379 }
39380 }
39382 /* We are either continuing a function template that already contains implicit
39383 template parameters, creating a new fully-implicit function template, or
39384 extending an existing explicit function template with implicit template
39385 parameters. */
39393 {
39397 }
39398 else
39399 {
39400 /* Roll back to the existing template parameter scope (in the case of
39401 extending an explicit function template) or introduce a new template
39402 parameter scope ahead of the function parameter scope (or class scope
39403 in the case of out-of-line member definitions). The function scope is
39404 added back after template parameter synthesis below. */
39409 {
39412 }
39414 {
39415 /* If not defining a class, then any class scope is a scope level in
39416 an out-of-line member definition. In this case simply wind back
39417 beyond the first such scope to inject the template parameter list.
39418 Otherwise wind back to the class being defined. The latter can
39419 occur in class member friend declarations such as:
39421 class A {
39422 void foo (auto);
39423 };
39424 class B {
39425 friend void A::foo (auto);
39426 };
39428 The template parameter list synthesized for the friend declaration
39429 must be injected in the scope of 'B'. This can also occur in
39430 erroneous cases such as:
39432 struct A {
39433 struct B {
39434 void foo (auto);
39435 };
39436 void B::foo (auto) {}
39437 };
39439 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39440 but, nevertheless, the template parameter list synthesized for the
39441 declarator should be injected into the scope of 'A' as if the
39442 ill-formed template was specified explicitly. */
39445 {
39448 }
39449 }
39455 {
39456 /* Introduce a new template parameter list for implicit template
39457 parameters. */
39461 parser->implicit_template_scope
39468 }
39469 else
39470 {
39471 /* Synthesize implicit template parameters at the end of the explicit
39472 template parameter list. */
39479 parser->implicit_template_parms
39481 }
39482 }
39484 /* Synthesize a new template parameter and track the current template
39485 parameter chain with implicit_template_parms. */
39489 tree synth_tmpl_parm;
39493 synth_tmpl_parm
39496 synth_tmpl_parm
39498 else
39499 {
39503 }
39505 // Attach the constraint to the parm before processing.
39508 tree new_parm
39510 input_location,
39511 node,
39515 // Chain the new parameter to the list of implicit parameters.
39517 parser->implicit_template_parms
39519 else
39524 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39527 /* If creating a fully implicit function template, start the new implicit
39528 template parameter list with this synthesized type, otherwise grow the
39529 current template parameter list. */
39532 {
39539 }
39540 else
39541 {
39546 }
39548 // If the new parameter was constrained, we need to add that to the
39549 // constraints in the template parameter list.
39551 {
39555 }
39560 }
39562 /* Finish the declaration of a fully implicit function template. Such a
39563 template has no explicit template parameter list so has not been through the
39564 normal template head and tail processing. synthesize_implicit_template_parm
39565 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39566 provided if the declaration is a class member such that its template
39567 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39568 form is returned. Otherwise NULL_TREE is returned. */
39570 static tree
39572 {
39577 {
39581 }
39591 }
39593 /* Helper function for diagnostics that have complained about things
39594 being used with 'extern "C"' linkage.
39596 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39598 void
39600 {
39604 }