| blob | 2337be52c382bdfdfedd9f51c38fb3a777b76c2a |
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 }
10618 sfk_none);
10623 VIRT_SPEC_UNSPECIFIED,
10624 REF_QUAL_NONE,
10625 tx_qual,
10626 exception_spec,
10632 declarator,
10633 attributes);
10635 {
10638 /* Give the object parameter a different name. */
10642 }
10644 {
10648 }
10657 }
10658 }
10660 /* Parse the body of a lambda expression, which is simply
10662 compound-statement
10664 but which requires special handling.
10665 LAMBDA_EXPR is the current representation of the lambda expression. */
10667 static void
10669 {
10675 else
10676 /* Still increment function_depth so that we don't GC in the
10677 middle of an expression. */
10681 /* Clear this in case we're in the middle of a default argument. */
10685 /* Finish the function call operator
10686 - class_specifier
10687 + late_parsing_for_member
10688 + function_definition_after_declarator
10689 + ctor_initializer_opt_and_function_body */
10690 {
10696 tree compound_stmt;
10698 matching_braces braces;
10704 /* 5.1.1.4 of the standard says:
10705 If a lambda-expression does not include a trailing-return-type, it
10706 is as if the trailing-return-type denotes the following type:
10707 * if the compound-statement is of the form
10708 { return attribute-specifier [opt] expression ; }
10709 the type of the returned expression after lvalue-to-rvalue
10710 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10711 (_conv.array_ 4.2), and function-to-pointer conversion
10712 (_conv.func_ 4.3);
10713 * otherwise, void. */
10715 /* In a lambda that has neither a lambda-return-type-clause
10716 nor a deducible form, errors should be reported for return statements
10717 in the body. Since we used void as the placeholder return type, parsing
10718 the body as usual will give such desired behavior. */
10722 {
10726 /* Parse tentatively in case there's more after the initial return
10727 statement. */
10738 {
10740 {
10745 }
10747 /* Will get error here if type not deduced yet. */
10751 }
10752 }
10755 {
10760 }
10764 out:
10766 }
10773 else
10775 }
10777 /* Statements [gram.stmt.stmt] */
10779 /* Parse a statement.
10781 statement:
10782 labeled-statement
10783 expression-statement
10784 compound-statement
10785 selection-statement
10786 iteration-statement
10787 jump-statement
10788 declaration-statement
10789 try-block
10791 C++11:
10793 statement:
10794 labeled-statement
10795 attribute-specifier-seq (opt) expression-statement
10796 attribute-specifier-seq (opt) compound-statement
10797 attribute-specifier-seq (opt) selection-statement
10798 attribute-specifier-seq (opt) iteration-statement
10799 attribute-specifier-seq (opt) jump-statement
10800 declaration-statement
10801 attribute-specifier-seq (opt) try-block
10803 init-statement:
10804 expression-statement
10805 simple-declaration
10807 TM Extension:
10809 statement:
10810 atomic-statement
10812 IN_COMPOUND is true when the statement is nested inside a
10813 cp_parser_compound_statement; this matters for certain pragmas.
10815 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10816 is a (possibly labeled) if statement which is not enclosed in braces
10817 and has an else clause. This is used to implement -Wparentheses.
10819 CHAIN is a vector of if-else-if conditions. */
10821 static void
10825 {
10830 restart:
10833 /* There is no statement yet. */
10839 /* In obj-c++, seeing '[[' might be the either the beginning of
10840 c++11 attributes, or a nested objc-message-expression. So
10841 let's parse the c++11 attributes tentatively. */
10845 {
10848 }
10850 /* Peek at the next token. */
10852 /* Remember the location of the first token in the statement. */
10854 /* If this is a keyword, then that will often determine what kind of
10855 statement we have. */
10857 {
10861 {
10864 /* Looks like a labeled-statement with a case label.
10865 Parse the label, and then use tail recursion to parse
10866 the statement. */
10884 {
10889 }
10890 else
10904 {
10909 }
10910 else
10911 {
10915 }
10919 /* Objective-C++ exception-handling constructs. */
10933 /* This must be a namespace alias definition. */
10949 /* It might be a keyword like `int' that can start a
10950 declaration-statement. */
10952 }
10953 }
10955 {
10956 /* If the next token is a `:', then we are looking at a
10957 labeled-statement. */
10960 {
10961 /* Looks like a labeled-statement with an ordinary label.
10962 Parse the label, and then use tail recursion to parse
10963 the statement. */
10968 }
10969 }
10970 /* Anything that starts with a `{' must be a compound-statement. */
10973 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10974 a statement all its own. */
10976 {
10977 /* Only certain OpenMP pragmas are attached to statements, and thus
10978 are considered statements themselves. All others are not. In
10979 the context of a compound, accept the pragma as a "statement" and
10980 return so that we can check for a close brace. Otherwise we
10981 require a real statement and must go back and read one. */
10987 }
10989 {
10992 }
10994 /* Everything else must be a declaration-statement or an
10995 expression-statement. Try for the declaration-statement
10996 first, unless we are looking at a `;', in which case we know that
10997 we have an expression-statement. */
10999 {
11001 {
11003 {
11004 /* Attributes should be parsed as part of the the
11005 declaration, so let's un-parse them. */
11008 }
11011 /* Try to parse the declaration-statement. */
11013 /* If that worked, we're done. */
11016 }
11017 /* All preceding labels have been parsed at this point. */
11021 /* Look for an expression-statement instead. */
11024 /* Handle [[fallthrough]];. */
11026 {
11027 /* The next token after the fallthrough attribute is ';'. */
11029 {
11030 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11032 IFN_FALLTHROUGH,
11035 }
11036 else
11040 }
11041 }
11043 /* Set the line number for the statement. */
11047 /* Allow "[[fallthrough]];", but warn otherwise. */
11050 OPT_Wattributes,
11052 }
11054 /* Parse the label for a labeled-statement, i.e.
11056 identifier :
11057 case constant-expression :
11058 default :
11060 GNU Extension:
11061 case constant-expression ... constant-expression : statement
11063 When a label is parsed without errors, the label is added to the
11064 parse tree by the finish_* functions, so this function doesn't
11065 have to return the label. */
11067 static void
11069 {
11074 /* The next token should be an identifier. */
11078 {
11081 }
11083 /* Remember whether this case or a user-defined label is allowed to fall
11084 through to. */
11089 {
11091 {
11095 /* Consume the `case' token. */
11097 /* Parse the constant-expression. */
11104 {
11105 /* Consume the `...' token. */
11111 /* We don't need to emit warnings here, as the common code
11112 will do this for us. */
11113 }
11114 else
11118 {
11122 }
11123 else
11126 expr);
11127 }
11131 /* Consume the `default' token. */
11135 {
11139 }
11140 else
11145 /* Anything else must be an ordinary label. */
11150 }
11152 /* Require the `:' token. */
11155 /* An ordinary label may optionally be followed by attributes.
11156 However, this is only permitted if the attributes are then
11157 followed by a semicolon. This is because, for backward
11158 compatibility, when parsing
11159 lab: __attribute__ ((unused)) int i;
11160 we want the attribute to attach to "i", not "lab". */
11163 {
11164 tree attrs;
11171 ;
11172 else
11174 }
11180 }
11182 /* Parse an expression-statement.
11184 expression-statement:
11185 expression [opt] ;
11187 Returns the new EXPR_STMT -- or NULL_TREE if the expression
11188 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
11189 indicates whether this expression-statement is part of an
11190 expression statement. */
11192 static tree
11194 {
11199 /* There might be attribute fallthrough. */
11202 /* If the next token is a ';', then there is no expression
11203 statement. */
11205 {
11209 {
11212 }
11213 }
11215 /* Handle [[fallthrough]];. */
11217 {
11218 /* The next token after the fallthrough attribute is ';'. */
11220 /* Turn [[fallthrough]]; into FALLTHROUGH ();. */
11223 else
11227 }
11229 /* Allow "[[fallthrough]];", but warn otherwise. */
11234 /* Give a helpful message for "A<T>::type t;" and the like. */
11237 {
11244 {
11245 /* A::A a; */
11250 }
11251 }
11253 /* Consume the final `;'. */
11258 /* This is the final expression statement of a statement
11259 expression. */
11265 }
11267 /* Parse a compound-statement.
11269 compound-statement:
11270 { statement-seq [opt] }
11272 GNU extension:
11274 compound-statement:
11275 { label-declaration-seq [opt] statement-seq [opt] }
11277 label-declaration-seq:
11278 label-declaration
11279 label-declaration-seq label-declaration
11281 Returns a tree representing the statement. */
11283 static tree
11286 {
11287 tree compound_stmt;
11288 matching_braces braces;
11290 /* Consume the `{'. */
11297 /* Begin the compound-statement. */
11299 /* If the next keyword is `__label__' we have a label declaration. */
11302 /* Parse an (optional) statement-seq. */
11304 /* Finish the compound-statement. */
11306 /* Consume the `}'. */
11310 }
11312 /* Parse an (optional) statement-seq.
11314 statement-seq:
11315 statement
11316 statement-seq [opt] statement */
11318 static void
11320 {
11321 /* Scan statements until there aren't any more. */
11323 {
11326 /* If we are looking at a `}', then we have run out of
11327 statements; the same is true if we have reached the end
11328 of file, or have stumbled upon a stray '@end'. */
11335 /* If we are in a compound statement and find 'else' then
11336 something went wrong. */
11338 {
11341 else
11342 {
11345 }
11346 }
11348 /* Parse the statement. */
11350 }
11351 }
11353 /* Return true if we're looking at (init; cond), false otherwise. */
11355 static bool
11357 {
11358 /* Save tokens so that we can put them back. */
11361 /* Look for ';' that is not nested in () or {}. */
11364 CPP_SEMICOLON,
11367 /* Roll back the tokens we skipped. */
11371 }
11373 /* Parse a selection-statement.
11375 selection-statement:
11376 if ( init-statement [opt] condition ) statement
11377 if ( init-statement [opt] condition ) statement else statement
11378 switch ( init-statement [opt] condition ) statement
11380 Returns the new IF_STMT or SWITCH_STMT.
11382 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11383 is a (possibly labeled) if statement which is not enclosed in
11384 braces and has an else clause. This is used to implement
11385 -Wparentheses.
11387 CHAIN is a vector of if-else-if conditions. This is used to implement
11388 -Wduplicated-cond. */
11390 static tree
11393 {
11396 token_indent_info guard_tinfo;
11401 /* Peek at the next token. */
11405 /* See what kind of keyword it is. */
11408 {
11411 {
11412 tree statement;
11413 tree condition;
11418 RID_CONSTEXPR))
11419 {
11425 }
11427 /* Look for the `('. */
11428 matching_parens parens;
11430 {
11433 }
11435 /* Begin the selection-statement. */
11437 {
11440 }
11441 else
11444 /* Parse the optional init-statement. */
11446 {
11447 tree decl;
11450 "init-statement in selection statements only available "
11453 }
11455 /* Parse the condition. */
11457 /* Look for the `)'. */
11463 {
11467 /* Add the condition. */
11474 /* Parse the then-clause. */
11478 /* Outside a template, the non-selected branch of a constexpr
11479 if is a 'discarded statement', i.e. unevaluated. */
11484 {
11487 }
11490 guard_tinfo);
11497 {
11501 }
11503 /* If the next token is `else', parse the else-clause. */
11505 RID_ELSE))
11506 {
11510 {
11513 }
11515 guard_tinfo
11517 /* Consume the `else' keyword. */
11520 {
11522 RID_IF)
11524 {
11525 /* We've got "if (COND) else if (COND2)". Start
11526 the condition chain and add COND as the first
11527 element. */
11531 {
11532 /* Wrap it in a NOP_EXPR so that we can set the
11533 location of the condition. */
11535 condition);
11538 }
11539 }
11541 RID_IF))
11542 {
11543 /* This is if-else without subsequent if. Zap the
11544 condition chain; we would have already warned at
11545 this point. */
11548 }
11549 }
11551 /* Parse the else-clause. */
11557 /* If we are currently parsing a then-clause, then
11558 IF_P will not be NULL. We set it to true to
11559 indicate that this if statement has an else clause.
11560 This may trigger the Wparentheses warning below
11561 when we get back up to the parent if statement. */
11566 {
11570 }
11571 }
11572 else
11573 {
11574 /* This if statement does not have an else clause. If
11575 NESTED_IF is true, then the then-clause has an if
11576 statement which does have an else clause. We warn
11577 about the potential ambiguity. */
11580 "suggest explicit braces to avoid ambiguous"
11583 {
11584 /* We don't need the condition chain anymore. */
11587 }
11588 }
11590 /* Now we're all done with the if-statement. */
11592 }
11593 else
11594 {
11598 /* Add the condition. */
11601 /* Parse the body of the switch-statement. */
11607 guard_tinfo);
11611 /* Now we're all done with the switch-statement. */
11613 }
11616 }
11622 }
11623 }
11625 /* Parse a condition.
11627 condition:
11628 expression
11629 type-specifier-seq declarator = initializer-clause
11630 type-specifier-seq declarator braced-init-list
11632 GNU Extension:
11634 condition:
11635 type-specifier-seq declarator asm-specification [opt]
11636 attributes [opt] = assignment-expression
11638 Returns the expression that should be tested. */
11640 static tree
11642 {
11643 cp_decl_specifier_seq type_specifiers;
11647 /* Try the declaration first. */
11649 /* New types are not allowed in the type-specifier-seq for a
11650 condition. */
11652 parser->type_definition_forbidden_message
11654 /* Parse the type-specifier-seq. */
11656 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11659 /* Restore the saved message. */
11661 /* If all is well, we might be looking at a declaration. */
11663 {
11664 tree decl;
11665 tree asm_specification;
11666 tree attributes;
11670 /* Parse the declarator. */
11676 /* Parse the attributes. */
11678 /* Parse the asm-specification. */
11680 /* If the next token is not an `=' or '{', then we might still be
11681 looking at an expression. For example:
11683 if (A(a).x)
11685 looks like a decl-specifier-seq and a declarator -- but then
11686 there is no `=', so this is an expression. */
11691 /* If we did see an `=' or '{', then we are looking at a declaration
11692 for sure. */
11694 {
11695 tree pushed_scope;
11699 /* Create the declaration. */
11705 /* Parse the initializer. */
11707 {
11711 }
11712 else
11713 {
11714 /* Consume the `='. */
11717 }
11721 /* Process the initializer. */
11724 asm_specification,
11725 flags);
11731 }
11732 }
11733 /* If we didn't even get past the declarator successfully, we are
11734 definitely not looking at a declaration. */
11735 else
11738 /* Otherwise, we are looking at an expression. */
11740 }
11742 /* Parses a for-statement or range-for-statement until the closing ')',
11743 not included. */
11745 static tree
11747 {
11751 /* Begin the for-statement. */
11754 /* Parse the initialization. */
11759 else
11761 }
11763 static tree
11765 {
11766 /* Normal for loop */
11769 tree stmt;
11772 /* The init-statement has already been parsed in
11773 cp_parser_init_statement, so no work is needed here. */
11776 /* If there's a condition, process it. */
11780 {
11784 }
11786 /* Look for the `;'. */
11789 /* If there's an expression, process it. */
11795 }
11797 /* Tries to parse a range-based for-statement:
11799 range-based-for:
11800 decl-specifier-seq declarator : expression
11802 The decl-specifier-seq declarator and the `:' are already parsed by
11803 cp_parser_init_statement. If processing_template_decl it returns a
11804 newly created RANGE_FOR_STMT; if not, it is converted to a
11805 regular FOR_STMT. */
11807 static tree
11810 {
11817 /* Get the range declaration momentarily out of the way so that
11818 the range expression doesn't clash with it. */
11820 {
11822 {
11824 /* For decomposition declaration get all of the corresponding
11825 declarations out of the way. */
11829 {
11835 {
11841 }
11842 }
11843 }
11845 {
11850 }
11851 }
11854 {
11857 }
11858 else
11861 /* Put the range declaration(s) back into scope. */
11863 {
11867 }
11869 /* If in template, STMT is converted to a normal for-statement
11870 at instantiation. If not, it is done just ahead. */
11872 {
11880 /* do_auto_deduction doesn't mess with template init-lists. */
11883 }
11884 else
11885 {
11889 }
11891 }
11893 /* Subroutine of cp_convert_range_for: given the initializer expression,
11894 builds up the range temporary. */
11896 static tree
11898 {
11901 /* Find out the type deduced by the declaration
11902 `auto &&__range = range_expr'. */
11907 /* Create the __range variable. */
11914 }
11916 /* Used by cp_parser_range_for in template context: we aren't going to
11917 do a full conversion yet, but we still need to resolve auto in the
11918 type of the for-range-declaration if present. This is basically
11919 a shortcut version of cp_convert_range_for. */
11921 static void
11923 {
11926 {
11929 iter_type = (cp_parser_perform_range_for_lookup
11932 {
11934 iter_type);
11936 tf_warning_or_error);
11939 }
11940 }
11941 }
11943 /* Converts a range-based for-statement into a normal
11944 for-statement, as per the definition.
11946 for (RANGE_DECL : RANGE_EXPR)
11947 BLOCK
11949 should be equivalent to:
11951 {
11952 auto &&__range = RANGE_EXPR;
11953 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11954 __begin != __end;
11955 ++__begin)
11956 {
11957 RANGE_DECL = *__begin;
11958 BLOCK
11959 }
11960 }
11962 If RANGE_EXPR is an array:
11963 BEGIN_EXPR = __range
11964 END_EXPR = __range + ARRAY_SIZE(__range)
11965 Else if RANGE_EXPR has a member 'begin' or 'end':
11966 BEGIN_EXPR = __range.begin()
11967 END_EXPR = __range.end()
11968 Else:
11969 BEGIN_EXPR = begin(__range)
11970 END_EXPR = end(__range);
11972 If __range has a member 'begin' but not 'end', or vice versa, we must
11973 still use the second alternative (it will surely fail, however).
11974 When calling begin()/end() in the third alternative we must use
11975 argument dependent lookup, but always considering 'std' as an associated
11976 namespace. */
11978 tree
11982 {
11990 /* If an error happened previously do nothing or else a lot of
11991 unhelpful errors would be issued. */
11993 else
11994 {
11995 tree range_temp;
11999 /* Can't bind a reference to an array of runtime bound. */
12001 else
12002 {
12007 LOOKUP_ONLYCONVERTING);
12009 }
12012 }
12014 /* The new for initialization statement. */
12022 LOOKUP_ONLYCONVERTING);
12033 LOOKUP_ONLYCONVERTING);
12037 /* The new for condition. */
12044 /* The new increment expression. */
12047 tf_warning_or_error);
12050 /* The declaration is initialized with *__begin inside the loop body. */
12053 tf_warning_or_error),
12055 LOOKUP_ONLYCONVERTING);
12060 }
12062 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
12063 We need to solve both at the same time because the method used
12064 depends on the existence of members begin or end.
12065 Returns the type deduced for the iterator expression. */
12067 static tree
12069 {
12071 {
12074 }
12077 {
12082 }
12084 {
12085 /* If RANGE is an array, we will use pointer arithmetic. */
12088 range,
12092 }
12093 else
12094 {
12095 /* If it is not an array, we must do a bit of magic. */
12105 tf_warning_or_error);
12108 tf_warning_or_error);
12111 {
12112 /* Use the member functions. */
12115 else
12121 else
12124 }
12125 else
12126 {
12127 /* Use global functions with ADL. */
12134 tf_warning_or_error);
12136 tf_warning_or_error);
12138 tf_warning_or_error);
12140 tf_warning_or_error);
12143 }
12145 /* Last common checks. */
12147 {
12148 /* If one of the expressions is an error do no more checks. */
12151 }
12154 /* Can happen, when, eg, in a template context, Koenig lookup
12155 can't resolve begin/end (c++/58503). */
12157 else
12158 {
12160 /* The unqualified type of the __begin and __end temporaries should
12161 be the same, as required by the multiple auto declaration. */
12163 {
12170 /* P0184R0 allows __begin and __end to have different types,
12171 but make sure they are comparable so we can give a better
12173 else
12177 }
12179 }
12180 }
12181 }
12183 /* Helper function for cp_parser_perform_range_for_lookup.
12184 Builds a tree for RANGE.IDENTIFIER(). */
12186 static tree
12188 {
12201 tf_warning_or_error);
12204 }
12206 /* Parse an iteration-statement.
12208 iteration-statement:
12209 while ( condition ) statement
12210 do statement while ( expression ) ;
12211 for ( init-statement condition [opt] ; expression [opt] )
12212 statement
12214 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
12216 static tree
12218 {
12221 tree statement;
12223 token_indent_info guard_tinfo;
12225 /* Peek at the next token. */
12232 /* Remember whether or not we are already within an iteration
12233 statement. */
12236 /* See what kind of keyword it is. */
12239 {
12241 {
12242 tree condition;
12244 /* Begin the while-statement. */
12246 /* Look for the `('. */
12247 matching_parens parens;
12249 /* Parse the condition. */
12252 /* Look for the `)'. */
12254 /* Parse the dependent statement. */
12258 /* We're done with the while-statement. */
12260 }
12264 {
12265 tree expression;
12267 /* Begin the do-statement. */
12269 /* Parse the body of the do-statement. */
12274 /* Look for the `while' keyword. */
12276 /* Look for the `('. */
12277 matching_parens parens;
12279 /* Parse the expression. */
12281 /* We're done with the do-statement. */
12283 /* Look for the `)'. */
12285 /* Look for the `;'. */
12287 }
12291 {
12292 /* Look for the `('. */
12293 matching_parens parens;
12298 /* Look for the `)'. */
12301 /* Parse the body of the for-statement. */
12306 /* We're done with the for-statement. */
12308 }
12315 }
12318 }
12320 /* Parse a init-statement or the declarator of a range-based-for.
12321 Returns true if a range-based-for declaration is seen.
12323 init-statement:
12324 expression-statement
12325 simple-declaration */
12327 static bool
12329 {
12330 /* If the next token is a `;', then we have an empty
12331 expression-statement. Grammatically, this is also a
12332 simple-declaration, but an invalid one, because it does not
12333 declare anything. Therefore, if we did not handle this case
12334 specially, we would issue an error message about an invalid
12335 declaration. */
12337 {
12341 /* A colon is used in range-based for. */
12344 /* We're going to speculatively look for a declaration, falling back
12345 to an expression, if necessary. */
12347 /* Parse the declaration. */
12350 decl);
12353 {
12354 /* It is a range-for, consume the ':' */
12358 {
12360 "range-based %<for%> loops only available with "
12363 }
12364 }
12365 else
12366 /* The ';' is not consumed yet because we told
12367 cp_parser_simple_declaration not to. */
12372 /* If the tentative parse failed, then we shall need to look for an
12373 expression-statement. */
12374 }
12375 /* If we are here, it is an expression-statement. */
12378 }
12380 /* Parse a jump-statement.
12382 jump-statement:
12383 break ;
12384 continue ;
12385 return expression [opt] ;
12386 return braced-init-list ;
12387 goto identifier ;
12389 GNU extension:
12391 jump-statement:
12392 goto * expression ;
12394 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
12396 static tree
12398 {
12404 /* Peek at the next token. */
12409 /* See what kind of keyword it is. */
12412 {
12416 {
12436 }
12442 {
12449 /* Fall through. */
12459 }
12464 {
12465 tree expr;
12469 {
12473 }
12476 else
12477 /* If the next token is a `;', then there is no
12478 expression. */
12480 /* Build the return-statement. */
12483 else
12485 /* Look for the final `;'. */
12487 }
12493 {
12496 }
12498 /* Create the goto-statement. */
12500 {
12501 /* Issue a warning about this use of a GNU extension. */
12503 /* Consume the '*' token. */
12505 /* Parse the dependent expression. */
12507 }
12508 else
12510 /* Look for the final `;'. */
12517 }
12520 }
12522 /* Parse a declaration-statement.
12524 declaration-statement:
12525 block-declaration */
12527 static void
12529 {
12532 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12535 /* Parse the block-declaration. */
12538 /* Free any declarators allocated. */
12540 }
12542 /* Some dependent statements (like `if (cond) statement'), are
12543 implicitly in their own scope. In other words, if the statement is
12544 a single statement (as opposed to a compound-statement), it is
12545 none-the-less treated as if it were enclosed in braces. Any
12546 declarations appearing in the dependent statement are out of scope
12547 after control passes that point. This function parses a statement,
12548 but ensures that is in its own scope, even if it is not a
12549 compound-statement.
12551 If IF_P is not NULL, *IF_P is set to indicate whether the statement
12552 is a (possibly labeled) if statement which is not enclosed in
12553 braces and has an else clause. This is used to implement
12554 -Wparentheses.
12556 CHAIN is a vector of if-else-if conditions. This is used to implement
12557 -Wduplicated-cond.
12559 Returns the new statement. */
12561 static tree
12565 {
12566 tree statement;
12569 token_indent_info body_tinfo
12575 /* Mark if () ; with a special NOP_EXPR. */
12577 {
12588 }
12589 /* if a compound is opened, we simply parse the statement directly. */
12592 /* If the token is not a `{', then we must take special action. */
12593 else
12594 {
12595 /* Create a compound-statement. */
12597 /* Parse the dependent-statement. */
12600 /* Finish the dummy compound-statement. */
12602 }
12604 token_indent_info next_tinfo
12613 /* Return the statement. */
12615 }
12617 /* For some dependent statements (like `while (cond) statement'), we
12618 have already created a scope. Therefore, even if the dependent
12619 statement is a compound-statement, we do not want to create another
12620 scope. */
12622 static void
12625 {
12626 /* If the token is a `{', then we must take special action. */
12628 {
12629 token_indent_info body_tinfo
12635 token_indent_info next_tinfo
12644 }
12645 else
12646 {
12647 /* Avoid calling cp_parser_compound_statement, so that we
12648 don't create a new scope. Do everything else by hand. */
12649 matching_braces braces;
12651 /* If the next keyword is `__label__' we have a label declaration. */
12654 /* Parse an (optional) statement-seq. */
12657 }
12658 }
12660 /* Declarations [gram.dcl.dcl] */
12662 /* Parse an optional declaration-sequence.
12664 declaration-seq:
12665 declaration
12666 declaration-seq declaration */
12668 static void
12670 {
12672 {
12683 {
12684 /* A declaration consisting of a single semicolon is
12685 invalid. Allow it unless we're being pedantic. */
12690 }
12692 /* If we're entering or exiting a region that's implicitly
12693 extern "C", modify the lang context appropriately. */
12695 {
12698 }
12700 {
12703 }
12706 {
12707 /* A top-level declaration can consist solely of a #pragma.
12708 A nested declaration cannot, so this is done here and not
12709 in cp_parser_declaration. (A #pragma at block scope is
12710 handled in cp_parser_statement.) */
12713 }
12715 /* Parse the declaration itself. */
12717 }
12718 }
12720 /* Parse a declaration.
12722 declaration:
12723 block-declaration
12724 function-definition
12725 template-declaration
12726 explicit-instantiation
12727 explicit-specialization
12728 linkage-specification
12729 namespace-definition
12731 C++17:
12732 deduction-guide
12734 GNU extension:
12736 declaration:
12737 __extension__ declaration */
12739 static void
12741 {
12742 cp_token token1;
12743 cp_token token2;
12748 /* Check for the `__extension__' keyword. */
12750 {
12751 /* Parse the qualified declaration. */
12753 /* Restore the PEDANTIC flag. */
12757 }
12759 /* Try to figure out what kind of declaration is present. */
12764 else
12765 {
12768 }
12770 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12773 /* If the next token is `extern' and the following token is a string
12774 literal, then we have a linkage specification. */
12778 /* If the next token is `template', then we have either a template
12779 declaration, an explicit instantiation, or an explicit
12780 specialization. */
12782 {
12783 /* `template <>' indicates a template specialization. */
12787 /* `template <' indicates a template declaration. */
12790 /* Anything else must be an explicit instantiation. */
12791 else
12793 }
12794 /* If the next token is `export', then we have a template
12795 declaration. */
12798 /* If the next token is `extern', 'static' or 'inline' and the one
12799 after that is `template', we have a GNU extended explicit
12800 instantiation directive. */
12807 /* If the next token is `namespace', check for a named or unnamed
12808 namespace definition. */
12817 /* An unnamed namespace definition. */
12821 /* An inline (associated) namespace definition. */
12825 /* Objective-C++ declaration/definition. */
12832 /* At this point we may have a template declared by a concept
12833 introduction. */
12838 else
12839 /* Try to parse a block-declaration, or a function-definition. */
12842 /* Free any declarators allocated. */
12844 }
12846 /* Parse a block-declaration.
12848 block-declaration:
12849 simple-declaration
12850 asm-definition
12851 namespace-alias-definition
12852 using-declaration
12853 using-directive
12855 GNU Extension:
12857 block-declaration:
12858 __extension__ block-declaration
12860 C++0x Extension:
12862 block-declaration:
12863 static_assert-declaration
12865 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12866 part of a declaration-statement. */
12868 static void
12871 {
12875 /* Check for the `__extension__' keyword. */
12877 {
12878 /* Parse the qualified declaration. */
12880 /* Restore the PEDANTIC flag. */
12884 }
12886 /* Peek at the next token to figure out which kind of declaration is
12887 present. */
12890 /* If the next keyword is `asm', we have an asm-definition. */
12892 {
12896 }
12897 /* If the next keyword is `namespace', we have a
12898 namespace-alias-definition. */
12901 /* If the next keyword is `using', we have a
12902 using-declaration, a using-directive, or an alias-declaration. */
12904 {
12909 /* If the token after `using' is `namespace', then we have a
12910 using-directive. */
12914 /* If the second token after 'using' is '=', then we have an
12915 alias-declaration. */
12921 /* Otherwise, it's a using-declaration. */
12922 else
12925 }
12926 /* If the next keyword is `__label__' we have a misplaced label
12927 declaration. */
12929 {
12933 /* If the next token is now a `;', consume it. */
12936 }
12937 /* If the next token is `static_assert' we have a static assertion. */
12940 /* Anything else must be a simple-declaration. */
12941 else
12944 }
12946 /* Parse a simple-declaration.
12948 simple-declaration:
12949 decl-specifier-seq [opt] init-declarator-list [opt] ;
12950 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
12951 brace-or-equal-initializer ;
12953 init-declarator-list:
12954 init-declarator
12955 init-declarator-list , init-declarator
12957 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12958 function-definition as a simple-declaration.
12960 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12961 parsed declaration if it is an uninitialized single declarator not followed
12962 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12963 if present, will not be consumed. */
12965 static void
12969 {
12970 cp_decl_specifier_seq decl_specifiers;
12979 /* Defer access checks until we know what is being declared; the
12980 checks for names appearing in the decl-specifier-seq should be
12981 done as if we were in the scope of the thing being declared. */
12984 /* Parse the decl-specifier-seq. We have to keep track of whether
12985 or not the decl-specifier-seq declares a named class or
12986 enumeration type, since that is the only case in which the
12987 init-declarator-list is allowed to be empty.
12989 [dcl.dcl]
12991 In a simple-declaration, the optional init-declarator-list can be
12992 omitted only when declaring a class or enumeration, that is when
12993 the decl-specifier-seq contains either a class-specifier, an
12994 elaborated-type-specifier, or an enum-specifier. */
12996 CP_PARSER_FLAGS_OPTIONAL,
12999 /* We no longer need to defer access checks. */
13002 /* In a block scope, a valid declaration must always have a
13003 decl-specifier-seq. By not trying to parse declarators, we can
13004 resolve the declaration/expression ambiguity more quickly. */
13007 {
13010 }
13012 /* If the next two tokens are both identifiers, the code is
13013 erroneous. The usual cause of this situation is code like:
13015 T t;
13017 where "T" should name a type -- but does not. */
13020 {
13021 /* If parsing tentatively, we should commit; we really are
13022 looking at a declaration. */
13024 /* Give up. */
13026 }
13028 /* If we have seen at least one decl-specifier, and the next token
13029 is not a parenthesis, then we must be looking at a declaration.
13030 (After "int (" we might be looking at a functional cast.) */
13037 /* Look for C++17 decomposition declaration. */
13045 {
13046 tree decl
13048 maybe_range_for_decl,
13051 /* The next token should be either a `,' or a `;'. */
13053 /* If it's a `;', we are done. */
13056 /* Anything else is an error. */
13057 else
13058 {
13059 /* If we have already issued an error message we don't need
13060 to issue another one. */
13065 /* Skip tokens until we reach the end of the statement. */
13067 /* If the next token is now a `;', consume it. */
13071 }
13072 }
13073 else
13076 tree last_type;
13078 /* NULL_TREE if both variable and function declaration are allowed,
13079 error_mark_node if function declaration are not allowed and
13080 a FUNCTION_DECL that should be diagnosed if it is followed by
13081 variable declarations. */
13082 tree auto_function_declaration;
13085 auto_specifier_p
13089 /* Keep going until we hit the `;' at the end of the simple
13090 declaration. */
13093 CPP_SEMICOLON))
13094 {
13097 tree decl;
13101 {
13102 /* If we are processing next declarator, comma is expected */
13107 {
13111 }
13112 }
13113 else
13116 /* Parse the init-declarator. */
13119 function_definition_allowed_p,
13121 declares_class_or_enum,
13123 maybe_range_for_decl,
13126 /* If an error occurred while parsing tentatively, exit quickly.
13127 (That usually happens when in the body of a function; each
13128 statement is treated as a declaration-statement until proven
13129 otherwise.) */
13134 {
13135 /* If the init-declarator-list contains more than one
13136 init-declarator, they shall all form declarations of
13137 variables. */
13139 auto_function_declaration
13143 {
13145 "non-variable %qD in declaration with more than one "
13150 }
13151 }
13155 {
13159 {
13160 /* If the list of declarators contains more than one declarator,
13161 the type of each declared variable is determined as described
13162 above. If the type deduced for the template parameter U is not
13163 the same in each deduction, the program is ill-formed. */
13168 }
13169 else
13171 }
13173 /* Handle function definitions specially. */
13175 {
13176 /* If the next token is a `,', then we are probably
13177 processing something like:
13179 void f() {}, *p;
13181 which is erroneous. */
13183 {
13186 "mixing"
13188 }
13189 /* Otherwise, we're done with the list of declarators. */
13190 else
13191 {
13194 }
13195 }
13198 /* The next token should be either a `,' or a `;'. */
13200 /* If it's a `,', there are more declarators to come. */
13203 /* If it's a `;', we are done. */
13207 {
13212 }
13213 /* Anything else is an error. */
13214 else
13215 {
13216 /* If we have already issued an error message we don't need
13217 to issue another one. */
13222 /* Skip tokens until we reach the end of the statement. */
13224 /* If the next token is now a `;', consume it. */
13228 }
13229 /* After the first time around, a function-definition is not
13230 allowed -- even if it was OK at first. For example:
13232 int i, f() {}
13234 is not valid. */
13236 }
13238 /* Issue an error message if no declarators are present, and the
13239 decl-specifier-seq does not itself declare a class or
13240 enumeration: [dcl.dcl]/3. */
13242 {
13244 {
13248 /* Ensure an error is issued anyway when finish_decltype_type,
13249 called via cp_parser_decl_specifier_seq, returns a class or
13250 an enumeration (c++/51786). */
13253 }
13254 /* Perform any deferred access checks. */
13256 }
13258 /* Consume the `;'. */
13259 finish:
13263 {
13269 }
13271 done:
13273 }
13275 /* Helper of cp_parser_simple_declaration, parse a decomposition declaration.
13276 decl-specifier-seq ref-qualifier [opt] [ identifier-list ]
13277 initializer ; */
13279 static tree
13284 {
13289 /* Parse the identifier-list. */
13293 {
13301 }
13305 {
13311 else
13312 {
13315 }
13316 }
13322 tree pushed_scope;
13329 NULL_TREE);
13336 cp_expr e;
13337 cp_decl_specifier_seq decl_specs;
13342 {
13345 else
13348 tree elt_pushed_scope;
13354 {
13355 /* Ensure we've diagnosed redeclaration if we aren't creating
13356 a new VAR_DECL. */
13359 }
13360 else
13364 }
13367 {
13370 }
13374 {
13384 {
13388 }
13391 {
13395 }
13396 }
13398 {
13400 /* Ensure DECL_VALUE_EXPR is created for all the decls but
13401 the underlying DECL. */
13403 }
13409 {
13412 }
13415 }
13417 /* Parse a decl-specifier-seq.
13419 decl-specifier-seq:
13420 decl-specifier-seq [opt] decl-specifier
13421 decl-specifier attribute-specifier-seq [opt] (C++11)
13423 decl-specifier:
13424 storage-class-specifier
13425 type-specifier
13426 function-specifier
13427 friend
13428 typedef
13430 GNU Extension:
13432 decl-specifier:
13433 attributes
13435 Concepts Extension:
13437 decl-specifier:
13438 concept
13440 Set *DECL_SPECS to a representation of the decl-specifier-seq.
13442 The parser flags FLAGS is used to control type-specifier parsing.
13444 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
13445 flags:
13447 1: one of the decl-specifiers is an elaborated-type-specifier
13448 (i.e., a type declaration)
13449 2: one of the decl-specifiers is an enum-specifier or a
13450 class-specifier (i.e., a type definition)
13452 */
13454 static void
13456 cp_parser_flags flags,
13459 {
13463 cp_decl_spec ds;
13465 /* Clear DECL_SPECS. */
13468 /* Assume no class or enumeration type is declared. */
13471 /* Keep reading specifiers until there are no more to read. */
13473 {
13478 /* Peek at the next token. */
13481 /* Save the first token of the decl spec list for error
13482 reporting. */
13485 /* Handle attributes. */
13487 {
13488 /* Parse the attributes. */
13491 /* In a sequence of declaration specifiers, c++11 attributes
13492 appertain to the type that precede them. In that case
13493 [dcl.spec]/1 says:
13495 The attribute-specifier-seq affects the type only for
13496 the declaration it appears in, not other declarations
13497 involving the same type.
13499 But for now let's force the user to position the
13500 attribute either at the beginning of the declaration or
13501 after the declarator-id, which would clearly mean that it
13502 applies to the declarator. */
13504 {
13506 /* The c++11 attribute is at the beginning of the
13507 declaration. It appertains to the entity being
13509 else
13510 {
13512 {
13513 /* This is an attribute following a
13514 class-specifier. */
13519 }
13520 else
13521 {
13522 decl_specs->std_attributes
13524 attrs);
13527 }
13529 }
13530 }
13532 decl_specs->attributes
13534 attrs);
13538 }
13539 /* Assume we will find a decl-specifier keyword. */
13541 /* If the next token is an appropriate keyword, we can simply
13542 add it to the list. */
13544 {
13545 /* decl-specifier:
13546 friend
13547 constexpr */
13550 {
13555 }
13556 else
13557 {
13559 /* Consume the token. */
13561 }
13574 /* function-specifier:
13575 inline
13576 virtual
13577 explicit */
13584 /* decl-specifier:
13585 typedef */
13588 /* Consume the token. */
13590 /* A constructor declarator cannot appear in a typedef. */
13592 /* The "typedef" keyword can only occur in a declaration; we
13593 may as well commit at this point. */
13600 /* storage-class-specifier:
13601 auto
13602 register
13603 static
13604 extern
13605 mutable
13607 GNU Extension:
13608 thread */
13611 {
13612 /* Consume the token. */
13615 /* Complain about `auto' as a storage specifier, if
13616 we're complaining about C++0x compatibility. */
13620 "%<auto%> changes meaning in C++11; "
13623 /* Set the storage class anyway. */
13625 token);
13626 }
13627 else
13628 /* C++0x auto type-specifier. */
13636 /* Consume the token. */
13639 token);
13642 /* Consume the token. */
13648 /* We did not yet find a decl-specifier yet. */
13651 }
13668 /* Constructors are a special case. The `S' in `S()' is not a
13669 decl-specifier; it is the beginning of the declarator. */
13670 constructor_p
13671 = (!found_decl_spec
13672 && constructor_possible_p
13673 && (cp_parser_constructor_declarator_p
13676 /* If we don't have a DECL_SPEC yet, then we must be looking at
13677 a type-specifier. */
13679 {
13682 tree type_spec;
13684 type_spec
13686 decl_specs,
13692 /* If this type-specifier referenced a user-defined type
13693 (a typedef, class-name, etc.), then we can't allow any
13694 more such type-specifiers henceforth.
13696 [dcl.spec]
13698 The longest sequence of decl-specifiers that could
13699 possibly be a type name is taken as the
13700 decl-specifier-seq of a declaration. The sequence shall
13701 be self-consistent as described below.
13703 [dcl.type]
13705 As a general rule, at most one type-specifier is allowed
13706 in the complete decl-specifier-seq of a declaration. The
13707 only exceptions are the following:
13709 -- const or volatile can be combined with any other
13710 type-specifier.
13712 -- signed or unsigned can be combined with char, long,
13713 short, or int.
13715 -- ..
13717 Example:
13719 typedef char* Pc;
13720 void g (const int Pc);
13722 Here, Pc is *not* part of the decl-specifier seq; it's
13723 the declarator. Therefore, once we see a type-specifier
13724 (other than a cv-qualifier), we forbid any additional
13725 user-defined types. We *do* still allow things like `int
13726 int' to be considered a decl-specifier-seq, and issue the
13727 error message later. */
13730 /* A constructor declarator cannot follow a type-specifier. */
13732 {
13737 }
13738 }
13740 /* If we still do not have a DECL_SPEC, then there are no more
13741 decl-specifiers. */
13746 /* After we see one decl-specifier, further decl-specifiers are
13747 always optional. */
13749 }
13751 /* Don't allow a friend specifier with a class definition. */
13756 }
13758 /* Parse an (optional) storage-class-specifier.
13760 storage-class-specifier:
13761 auto
13762 register
13763 static
13764 extern
13765 mutable
13767 GNU Extension:
13769 storage-class-specifier:
13770 thread
13772 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
13774 static tree
13776 {
13778 {
13782 /* Fall through for C++98. */
13790 /* Consume the token. */
13795 }
13796 }
13798 /* Parse an (optional) function-specifier.
13800 function-specifier:
13801 inline
13802 virtual
13803 explicit
13805 Returns an IDENTIFIER_NODE corresponding to the keyword used.
13806 Updates DECL_SPECS, if it is non-NULL. */
13808 static tree
13811 {
13814 {
13820 /* 14.5.2.3 [temp.mem]
13822 A member function template shall not be virtual. */
13826 else
13836 }
13838 /* Consume the token. */
13840 }
13842 /* Parse a linkage-specification.
13844 linkage-specification:
13845 extern string-literal { declaration-seq [opt] }
13846 extern string-literal declaration */
13848 static void
13850 {
13851 tree linkage;
13853 /* Look for the `extern' keyword. */
13854 cp_token *extern_token
13857 /* Look for the string-literal. */
13861 /* Transform the literal into an identifier. If the literal is a
13862 wide-character string, or contains embedded NULs, then we can't
13863 handle it as the user wants. */
13866 {
13868 /* Assume C++ linkage. */
13870 }
13871 else
13874 /* We're now using the new linkage. */
13877 /* Preserve the location of the the innermost linkage specification,
13878 tracking the locations of nested specifications via a local. */
13879 location_t saved_location
13881 /* Construct a location ranging from the start of the "extern" to
13882 the end of the string-literal, with the caret at the start, e.g.:
13883 extern "C" {
13884 ^~~~~~~~~~
13885 */
13886 parser->innermost_linkage_specification_location
13891 /* If the next token is a `{', then we're using the first
13892 production. */
13894 {
13898 /* Consume the `{' token. */
13899 matching_braces braces;
13901 /* Parse the declarations. */
13903 /* Look for the closing `}'. */
13905 }
13906 /* Otherwise, there's just one declaration. */
13907 else
13908 {
13911 saved_in_unbraced_linkage_specification_p
13915 parser->in_unbraced_linkage_specification_p
13917 }
13919 /* We're done with the linkage-specification. */
13922 /* Restore location of parent linkage specification, if any. */
13924 }
13926 /* Parse a static_assert-declaration.
13928 static_assert-declaration:
13929 static_assert ( constant-expression , string-literal ) ;
13930 static_assert ( constant-expression ) ; (C++17)
13932 If MEMBER_P, this static_assert is a class member. */
13934 static void
13936 {
13937 tree condition;
13938 tree message;
13940 location_t saved_loc;
13943 /* Peek at the `static_assert' token so we can keep track of exactly
13944 where the static assertion started. */
13948 /* Look for the `static_assert' keyword. */
13950 RT_STATIC_ASSERT))
13953 /* We know we are in a static assertion; commit to any tentative
13954 parse. */
13958 /* Parse the `(' starting the static assertion condition. */
13959 matching_parens parens;
13962 /* Parse the constant-expression. Allow a non-constant expression
13963 here in order to give better diagnostics in finish_static_assert. */
13964 condition =
13970 {
13973 "static_assert without a message "
13975 /* Eat the ')' */
13980 }
13981 else
13982 {
13983 /* Parse the separating `,'. */
13986 /* Parse the string-literal message. */
13991 /* A `)' completes the static assertion. */
13997 }
13999 /* A semicolon terminates the declaration. */
14002 /* Complete the static assertion, which may mean either processing
14003 the static assert now or saving it for template instantiation. */
14005 }
14007 /* Parse the expression in decltype ( expression ). */
14009 static tree
14012 {
14014 tree expr;
14016 /* Since we're going to preserve any side-effects from this parse, set up a
14017 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14018 in the expression. */
14021 /* First, try parsing an id-expression. */
14032 {
14035 cp_id_kind idk;
14039 /* Lookup the name we got back from the id-expression. */
14049 {
14050 /* Complete lookup of the id-expression. */
14051 expr = (finish_id_expression
14064 /* We found an id-expression, but it was something that we
14065 should not have found. This is an error, not something
14066 we can recover from, so note that we found an
14067 id-expression and we'll recover as gracefully as
14068 possible. */
14070 }
14075 /* We have an id-expression. */
14077 }
14080 {
14081 /* Abort the id-expression parse. */
14084 /* Parsing tentatively, again. */
14087 /* Parse a class member access. */
14095 /* We have an id-expression. */
14097 }
14100 /* We have parsed the complete id-expression or member access. */
14102 else
14103 {
14104 /* Abort our attempt to parse an id-expression or member access
14105 expression. */
14108 /* Parse a full expression. */
14111 }
14114 }
14116 /* Parse a `decltype' type. Returns the type.
14118 simple-type-specifier:
14119 decltype ( expression )
14120 C++14 proposal:
14121 decltype ( auto ) */
14123 static tree
14125 {
14126 tree expr;
14135 {
14136 /* Already parsed. */
14139 }
14141 /* Look for the `decltype' token. */
14145 /* Parse the opening `('. */
14146 matching_parens parens;
14150 /* decltype (auto) */
14153 {
14160 }
14162 /* Types cannot be defined in a `decltype' expression. Save away the
14163 old message. */
14166 /* And create the new one. */
14167 parser->type_definition_forbidden_message
14170 /* The restrictions on constant-expressions do not apply inside
14171 decltype expressions. */
14172 saved_integral_constant_expression_p
14174 saved_non_integral_constant_expression_p
14178 /* Within a parenthesized expression, a `>' token is always
14179 the greater-than operator. */
14180 saved_greater_than_is_operator_p
14184 /* Do not actually evaluate the expression. */
14187 /* Do not warn about problems with the expression. */
14192 /* Go back to evaluating expressions. */
14196 /* The `>' token might be the end of a template-id or
14197 template-parameter-list now. */
14198 parser->greater_than_is_operator_p
14201 /* Restore the old message and the integral constant expression
14202 flags. */
14204 parser->integral_constant_expression_p
14206 parser->non_integral_constant_expression_p
14209 /* Parse to the closing `)'. */
14211 {
14215 }
14218 tf_warning_or_error);
14220 rewrite:
14221 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
14222 it again. */
14231 }
14233 /* Special member functions [gram.special] */
14235 /* Parse a conversion-function-id.
14237 conversion-function-id:
14238 operator conversion-type-id
14240 Returns an IDENTIFIER_NODE representing the operator. */
14242 static tree
14244 {
14245 tree type;
14246 tree saved_scope;
14247 tree saved_qualifying_scope;
14248 tree saved_object_scope;
14251 /* Look for the `operator' token. */
14254 /* When we parse the conversion-type-id, the current scope will be
14255 reset. However, we need that information in able to look up the
14256 conversion function later, so we save it here. */
14260 /* We must enter the scope of the class so that the names of
14261 entities declared within the class are available in the
14262 conversion-type-id. For example, consider:
14264 struct S {
14265 typedef int I;
14266 operator I();
14267 };
14269 S::operator I() { ... }
14271 In order to see that `I' is a type-name in the definition, we
14272 must be in the scope of `S'. */
14275 /* Parse the conversion-type-id. */
14277 /* Leave the scope of the class, if any. */
14280 /* Restore the saved scope. */
14284 /* If the TYPE is invalid, indicate failure. */
14288 }
14290 /* Parse a conversion-type-id:
14292 conversion-type-id:
14293 type-specifier-seq conversion-declarator [opt]
14295 Returns the TYPE specified. */
14297 static tree
14299 {
14300 tree attributes;
14301 cp_decl_specifier_seq type_specifiers;
14303 tree type_specified;
14306 /* Parse the attributes. */
14310 parser->type_definition_forbidden_message
14313 /* Parse the type-specifiers. */
14320 /* If that didn't work, stop. */
14323 /* Parse the conversion-declarator. */
14331 /* Don't give this error when parsing tentatively. This happens to
14332 work because we always parse this definitively once. */
14335 {
14337 {
14340 }
14344 }
14347 }
14349 /* Parse an (optional) conversion-declarator.
14351 conversion-declarator:
14352 ptr-operator conversion-declarator [opt]
14354 */
14358 {
14361 cp_cv_quals cv_quals;
14363 /* We don't know if there's a ptr-operator next, or not. */
14365 /* Try the ptr-operator. */
14368 /* If it worked, look for more conversion-declarators. */
14370 {
14373 /* Parse another optional declarator. */
14376 declarator = cp_parser_make_indirect_declarator
14380 }
14383 }
14385 /* Parse an (optional) ctor-initializer.
14387 ctor-initializer:
14388 : mem-initializer-list */
14390 static void
14392 {
14393 /* If the next token is not a `:', then there is no
14394 ctor-initializer. */
14396 {
14397 /* Do default initialization of any bases and members. */
14401 }
14403 /* Consume the `:' token. */
14405 /* And the mem-initializer-list. */
14407 }
14409 /* Parse a mem-initializer-list.
14411 mem-initializer-list:
14412 mem-initializer ... [opt]
14413 mem-initializer ... [opt] , mem-initializer-list */
14415 static void
14417 {
14422 /* Let the semantic analysis code know that we are starting the
14423 mem-initializer-list. */
14428 /* Loop through the list. */
14430 {
14431 tree mem_initializer;
14434 /* Parse the mem-initializer. */
14436 /* If the next token is a `...', we're expanding member initializers. */
14438 {
14439 /* Consume the `...'. */
14442 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
14443 can be expanded but members cannot. */
14446 {
14451 }
14453 /* Construct the pack expansion type. */
14456 }
14459 {
14463 }
14464 /* Look for a target constructor. */
14468 {
14471 {
14475 }
14477 }
14478 /* Add it to the list, unless it was erroneous. */
14480 {
14483 }
14484 /* If the next token is not a `,', we're done. */
14487 /* Consume the `,' token. */
14489 }
14491 /* Perform semantic analysis. */
14494 }
14496 /* Parse a mem-initializer.
14498 mem-initializer:
14499 mem-initializer-id ( expression-list [opt] )
14500 mem-initializer-id braced-init-list
14502 GNU extension:
14504 mem-initializer:
14505 ( expression-list [opt] )
14507 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
14508 class) or FIELD_DECL (for a non-static data member) to initialize;
14509 the TREE_VALUE is the expression-list. An empty initialization
14510 list is represented by void_list_node. */
14512 static tree
14514 {
14515 tree mem_initializer_id;
14516 tree expression_list;
14517 tree member;
14520 /* Find out what is being initialized. */
14522 {
14526 }
14527 else
14528 {
14532 }
14538 {
14545 }
14546 else
14547 {
14557 }
14567 }
14569 /* Parse a mem-initializer-id.
14571 mem-initializer-id:
14572 :: [opt] nested-name-specifier [opt] class-name
14573 decltype-specifier (C++11)
14574 identifier
14576 Returns a TYPE indicating the class to be initialized for the first
14577 production (and the second in C++11). Returns an IDENTIFIER_NODE
14578 indicating the data member to be initialized for the last production. */
14580 static tree
14582 {
14586 tree id;
14590 /* `typename' is not allowed in this context ([temp.res]). */
14592 {
14594 "keyword %<typename%> not allowed in this context (a qualified "
14597 }
14598 /* Look for the optional `::' operator. */
14599 global_scope_p
14603 /* Look for the optional nested-name-specifier. The simplest way to
14604 implement:
14606 [temp.res]
14608 The keyword `typename' is not permitted in a base-specifier or
14609 mem-initializer; in these contexts a qualified name that
14610 depends on a template-parameter is implicitly assumed to be a
14611 type name.
14613 is to assume that we have seen the `typename' keyword at this
14614 point. */
14615 nested_name_specifier_p
14624 /* If there is a `::' operator or a nested-name-specifier, then we
14625 are definitely looking for a class-name. */
14630 typename_type,
14634 /* Otherwise, we could also be looking for an ordinary identifier. */
14637 /* Try a decltype-specifier. */
14639 else
14640 /* Otherwise, try a class-name. */
14644 none_type,
14648 /* If we found one, we're done. */
14651 /* Otherwise, look for an ordinary identifier. */
14653 }
14655 /* Overloading [gram.over] */
14657 /* Parse an operator-function-id.
14659 operator-function-id:
14660 operator operator
14662 Returns an IDENTIFIER_NODE for the operator which is a
14663 human-readable spelling of the identifier, e.g., `operator +'. */
14665 static cp_expr
14667 {
14668 /* Look for the `operator' keyword. */
14671 /* And then the name of the operator itself. */
14673 }
14675 /* Return an identifier node for a user-defined literal operator.
14676 The suffix identifier is chained to the operator name identifier. */
14678 tree
14680 {
14681 tree identifier;
14688 }
14690 /* Parse an operator.
14692 operator:
14693 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
14694 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
14695 || ++ -- , ->* -> () []
14697 GNU Extensions:
14699 operator:
14700 <? >? <?= >?=
14702 Returns an IDENTIFIER_NODE for the operator which is a
14703 human-readable spelling of the identifier, e.g., `operator +'. */
14705 static cp_expr
14707 {
14712 /* Peek at the next token. */
14717 /* Figure out which operator we have. */
14719 {
14721 {
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. */
14749 }
14750 /* Otherwise, we have the non-array variant. */
14751 else
14757 }
14904 {
14905 /* Consume the `('. */
14906 matching_parens parens;
14908 /* Look for the matching `)'. */
14911 }
14914 /* Consume the `['. */
14916 /* Look for the matching `]'. */
14923 /* FALLTHRU */
14932 {
14939 /* Consume the string. */
14945 {
14948 }
14949 else
14950 {
14952 /* Look for the suffix identifier. */
14957 {
14961 }
14962 else
14963 {
14966 }
14967 }
14972 {
14975 }
14978 {
14981 }
14983 {
14986 }
14988 }
14991 /* Anything else is an error. */
14993 }
14995 /* If we have selected an identifier, we need to consume the
14996 operator token. */
14999 /* Otherwise, no valid operator name was present. */
15000 else
15001 {
15004 }
15007 }
15009 /* Parse a template-declaration.
15011 template-declaration:
15012 export [opt] template < template-parameter-list > declaration
15014 If MEMBER_P is TRUE, this template-declaration occurs within a
15015 class-specifier.
15017 The grammar rule given by the standard isn't correct. What
15018 is really meant is:
15020 template-declaration:
15021 export [opt] template-parameter-list-seq
15022 decl-specifier-seq [opt] init-declarator [opt] ;
15023 export [opt] template-parameter-list-seq
15024 function-definition
15026 template-parameter-list-seq:
15027 template-parameter-list-seq [opt]
15028 template < template-parameter-list >
15030 Concept Extensions:
15032 template-parameter-list-seq:
15033 template < template-parameter-list > requires-clause [opt]
15035 requires-clause:
15036 requires logical-or-expression */
15038 static void
15040 {
15041 /* Check for `export'. */
15043 {
15044 /* Consume the `export' token. */
15046 /* Warn that we do not support `export'. */
15048 }
15051 }
15053 /* Parse a template-parameter-list.
15055 template-parameter-list:
15056 template-parameter
15057 template-parameter-list , template-parameter
15059 Returns a TREE_LIST. Each node represents a template parameter.
15060 The nodes are connected via their TREE_CHAINs. */
15062 static tree
15064 {
15069 /* The loop below parses the template parms. We first need to know
15070 the total number of template parms to be able to compute proper
15071 canonical types of each dependent type. So after the loop, when
15072 we know the total number of template parms,
15073 end_template_parm_list computes the proper canonical types and
15074 fixes up the dependent types accordingly. */
15076 {
15077 tree parameter;
15080 location_t parm_loc;
15082 /* Parse the template-parameter. */
15087 /* Add it to the list. */
15090 parm_loc,
15091 parameter,
15092 is_non_type,
15093 is_parameter_pack);
15094 else
15095 {
15098 }
15100 /* If the next token is not a `,', we're done. */
15103 /* Otherwise, consume the `,' token. */
15105 }
15108 }
15110 /* Parse a introduction-list.
15112 introduction-list:
15113 introduced-parameter
15114 introduction-list , introduced-parameter
15116 introduced-parameter:
15117 ...[opt] identifier
15119 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
15120 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
15121 WILDCARD_DECL will also have DECL_NAME set and token location in
15122 DECL_SOURCE_LOCATION. */
15124 static tree
15126 {
15130 {
15135 /* Build placeholder. */
15143 /* If the next token is not a `,', we're done. */
15146 /* Otherwise, consume the `,' token. */
15148 }
15150 /* Convert the vec into a TREE_VEC. */
15153 tree parm;
15159 }
15161 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
15162 is an abstract declarator. */
15166 {
15171 }
15173 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
15174 is an abstract declarator. */
15178 {
15182 else
15184 }
15186 /* Returns true if DECL represents a constrained-parameter. */
15190 {
15195 }
15197 /* Returns true if PARM declares a constrained-parameter. */
15201 {
15203 }
15205 /* Check that the type parameter is only a declarator-id, and that its
15206 type is not cv-qualified. */
15208 bool
15211 {
15216 {
15219 }
15221 /* Don't allow cv-qualified type parameters. */
15224 {
15227 }
15230 }
15232 /* Finish parsing/processing a template type parameter and checking
15233 various restrictions. */
15237 tree id,
15239 {
15242 else
15244 }
15246 static tree
15248 {
15249 /* FIXME: This should probably be copied, and we may need to adjust
15250 the template parameter depths. */
15260 }
15262 /* Finish parsing/processing a template template parameter by borrowing
15263 the template parameter list from the prototype parameter. */
15265 static tree
15267 tree proto,
15268 tree id,
15270 {
15274 }
15276 /* Create a new non-type template parameter from the given PARM
15277 declarator. */
15279 static tree
15282 {
15288 }
15290 /* Build a constrained template parameter based on the PARMDECL
15291 declarator. The type of PARMDECL is the constrained type, which
15292 refers to the prototype template parameter that ultimately
15293 specifies the type of the declared parameter. */
15295 static tree
15300 {
15306 /* A template parameter constrained by a variadic concept shall also
15307 be declared as a template parameter pack. */
15312 /* Build the parameter. Return an error if the declarator was invalid. */
15313 tree parm;
15318 parmdecl);
15319 else
15324 /* Finish the parameter decl and create a node attaching the
15325 default argument and constraint. */
15330 }
15332 /* Returns true if the parsed type actually represents the declaration
15333 of a type template-parameter. */
15337 {
15340 }
15343 /* Returns true if the parsed type actually represents the declaration of
15344 a template template-parameter. */
15346 static bool
15348 {
15351 }
15353 /* Parse a default argument for a type template-parameter.
15354 Note that diagnostics are handled in cp_parser_template_parameter. */
15356 static tree
15358 {
15361 /* Consume the `=' token. */
15366 /* Parse the default-argument. */
15372 {
15376 }
15379 }
15381 /* Parse a default argument for a template template-parameter. */
15383 static tree
15385 {
15390 /* Consume the `='. */
15392 /* Parse the id-expression. */
15394 /* save token before parsing the id-expression, for error
15395 reporting */
15397 tree default_argument
15405 /* If the id-expression was a template-id that refers to
15406 a template-class, we already have the declaration here,
15407 so no further lookup is needed. */
15408 ;
15409 else
15410 /* Look up the name. */
15411 default_argument
15413 none_type,
15419 /* See if the default argument is valid. */
15423 }
15425 /* Parse a template-parameter.
15427 template-parameter:
15428 type-parameter
15429 parameter-declaration
15431 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
15432 the parameter. The TREE_PURPOSE is the default value, if any.
15433 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
15434 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
15435 set to true iff this parameter is a parameter pack. */
15437 static tree
15440 {
15443 tree parm;
15445 /* Assume it is a type parameter or a template parameter. */
15447 /* Assume it not a parameter pack. */
15449 /* Peek at the next token. */
15451 /* If it is `template', we have a type-parameter. */
15454 /* If it is `class' or `typename' we do not know yet whether it is a
15455 type parameter or a non-type parameter. Consider:
15457 template <typename T, typename T::X X> ...
15459 or:
15461 template <class C, class D*> ...
15463 Here, the first parameter is a type parameter, and the second is
15464 a non-type parameter. We can tell by looking at the token after
15465 the identifier -- if it is a `,', `=', or `>' then we have a type
15466 parameter. */
15468 {
15469 /* Peek at the token after `class' or `typename'. */
15471 /* If it's an ellipsis, we have a template type parameter
15472 pack. */
15475 /* If it's an identifier, skip it. */
15478 /* Now, see if the token looks like the end of a template
15479 parameter. */
15484 }
15486 /* Otherwise, it is a non-type parameter or a constrained parameter.
15488 [temp.param]
15490 When parsing a default template-argument for a non-type
15491 template-parameter, the first non-nested `>' is taken as the end
15492 of the template parameter-list rather than a greater-than
15493 operator. */
15494 parameter_declarator
15501 /* If the parameter declaration is marked as a parameter pack, set
15502 *IS_PARAMETER_PACK to notify the caller. */
15507 {
15508 /* Can happen in some cases of erroneous input (c++/34892). */
15510 /* Consume the `...' for better error recovery. */
15512 }
15514 // The parameter may have been constrained.
15517 parameter_declarator,
15518 is_non_type,
15519 is_parameter_pack);
15521 // Now we're sure that the parameter is a non-type parameter.
15532 }
15534 /* Parse a type-parameter.
15536 type-parameter:
15537 class identifier [opt]
15538 class identifier [opt] = type-id
15539 typename identifier [opt]
15540 typename identifier [opt] = type-id
15541 template < template-parameter-list > class identifier [opt]
15542 template < template-parameter-list > class identifier [opt]
15543 = id-expression
15545 GNU Extension (variadic templates):
15547 type-parameter:
15548 class ... identifier [opt]
15549 typename ... identifier [opt]
15551 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
15552 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
15553 the declaration of the parameter.
15555 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
15557 static tree
15559 {
15561 tree parameter;
15563 /* Look for a keyword to tell us what kind of parameter this is. */
15569 {
15572 {
15573 tree identifier;
15574 tree default_argument;
15576 /* If the next token is an ellipsis, we have a template
15577 argument pack. */
15579 {
15580 /* Consume the `...' token. */
15585 }
15587 /* If the next token is an identifier, then it names the
15588 parameter. */
15591 else
15594 /* Create the parameter. */
15597 /* If the next token is an `=', we have a default argument. */
15599 {
15600 default_argument
15603 /* Template parameter packs cannot have default
15604 arguments. */
15606 {
15609 "template parameter pack %qD cannot have a "
15611 else
15613 "template parameter packs cannot have "
15616 }
15619 }
15620 else
15623 /* Create the combined representation of the parameter and the
15624 default argument. */
15626 }
15630 {
15631 tree identifier;
15632 tree default_argument;
15634 /* Look for the `<'. */
15636 /* Parse the template-parameter-list. */
15638 /* Look for the `>'. */
15641 // If template requirements are present, parse them.
15643 {
15648 }
15650 /* Look for the `class' or 'typename' keywords. */
15652 /* If the next token is an ellipsis, we have a template
15653 argument pack. */
15655 {
15656 /* Consume the `...' token. */
15661 }
15662 /* If the next token is an `=', then there is a
15663 default-argument. If the next token is a `>', we are at
15664 the end of the parameter-list. If the next token is a `,',
15665 then we are at the end of this parameter. */
15669 {
15671 /* Treat invalid names as if the parameter were nameless. */
15674 }
15675 else
15678 /* Create the template parameter. */
15680 identifier);
15682 /* If the next token is an `=', then there is a
15683 default-argument. */
15685 {
15686 default_argument
15689 /* Template parameter packs cannot have default
15690 arguments. */
15692 {
15695 "template parameter pack %qD cannot "
15697 identifier);
15698 else
15702 }
15703 }
15704 else
15707 /* Create the combined representation of the parameter and the
15708 default argument. */
15710 }
15716 }
15719 }
15721 /* Parse a template-id.
15723 template-id:
15724 template-name < template-argument-list [opt] >
15726 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
15727 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
15728 returned. Otherwise, if the template-name names a function, or set
15729 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
15730 names a class, returns a TYPE_DECL for the specialization.
15732 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
15733 uninstantiated templates. */
15735 static tree
15741 {
15742 tree templ;
15743 tree arguments;
15744 tree template_id;
15749 /* If the next token corresponds to a template-id, there is no need
15750 to reparse it. */
15753 {
15756 }
15758 /* Avoid performing name lookup if there is no possibility of
15759 finding a template-id. */
15762 && !cp_parser_nth_token_starts_template_argument_list_p
15764 {
15767 }
15769 /* Remember where the template-id starts. */
15775 /* Parse the template-name. */
15778 check_dependency_p,
15779 is_declaration,
15780 tag_type,
15783 {
15786 }
15788 /* Since we're going to preserve any side-effects from this parse, set up a
15789 firewall to protect our callers from cp_parser_commit_to_tentative_parse
15790 in the template arguments. */
15793 /* If we find the sequence `[:' after a template-name, it's probably
15794 a digraph-typo for `< ::'. Substitute the tokens and check if we can
15795 parse correctly the argument list. */
15802 {
15804 /* Change `:' into `::'. */
15806 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
15807 CPP_LESS. */
15810 /* Parse the arguments. */
15813 {
15814 /* If we couldn't parse an argument list, then we revert our changes
15815 and return simply an error. Maybe this is not a template-id
15816 after all. */
15821 }
15822 /* Otherwise, emit an error about the invalid digraph, but continue
15823 parsing because we got our argument list. */
15826 {
15829 "%<<:%> is an alternate spelling for %<[%>."
15832 {
15834 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
15837 }
15838 }
15839 }
15840 else
15841 {
15842 /* Look for the `<' that starts the template-argument-list. */
15844 {
15847 }
15848 /* Parse the arguments. */
15850 }
15852 /* Set the location to be of the form:
15853 template-name < template-argument-list [opt] >
15854 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
15855 with caret == start at the start of the template-name,
15856 ranging until the closing '>'. */
15857 location_t finish_loc
15859 location_t combined_loc
15862 /* Build a representation of the specialization. */
15865 TEMPLATE_ID_EXPR,
15869 {
15871 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
15872 template (rather than some instantiation thereof) only if
15873 is not nested within some other construct. For example, in
15874 "template <typename T> void f(T) { A<T>::", A<T> is just an
15875 instantiation of A. */
15878 CPP_SCOPE));
15879 template_id
15881 }
15882 /* A template-like identifier may be a partial concept id. */
15888 {
15892 }
15893 else
15894 {
15895 /* If it's not a class-template or a template-template, it should be
15896 a function-template. */
15904 }
15906 /* If parsing tentatively, replace the sequence of tokens that makes
15907 up the template-id with a CPP_TEMPLATE_ID token. That way,
15908 should we re-parse the token stream, we will not have to repeat
15909 the effort required to do the parse, nor will we issue duplicate
15910 error messages about problems during instantiation of the
15911 template. */
15913 /* Don't do this if we had a parse error in a declarator; re-parsing
15914 might succeed if a name changes meaning (60361). */
15918 {
15919 /* Reset the contents of the START_OF_ID token. */
15923 /* We must mark the lookup as kept, so we don't throw it away on
15924 the first parse. */
15928 /* Retrieve any deferred checks. Do not pop this access checks yet
15929 so the memory will not be reclaimed during token replacing below. */
15935 /* Purge all subsequent tokens. */
15938 /* ??? Can we actually assume that, if template_id ==
15939 error_mark_node, we will have issued a diagnostic to the
15940 user, as opposed to simply marking the tentative parse as
15941 failed? */
15944 }
15948 }
15950 /* Parse a template-name.
15952 template-name:
15953 identifier
15955 The standard should actually say:
15957 template-name:
15958 identifier
15959 operator-function-id
15961 A defect report has been filed about this issue.
15963 A conversion-function-id cannot be a template name because they cannot
15964 be part of a template-id. In fact, looking at this code:
15966 a.operator K<int>()
15968 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
15969 It is impossible to call a templated conversion-function-id with an
15970 explicit argument list, since the only allowed template parameter is
15971 the type to which it is converting.
15973 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15974 `template' keyword, in a construction like:
15976 T::template f<3>()
15978 In that case `f' is taken to be a template-name, even though there
15979 is no way of knowing for sure.
15981 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15982 name refers to a set of overloaded functions, at least one of which
15983 is a template, or an IDENTIFIER_NODE with the name of the template,
15984 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15985 names are looked up inside uninstantiated templates. */
15987 static tree
15994 {
15995 tree identifier;
15996 tree decl;
15999 /* If the next token is `operator', then we have either an
16000 operator-function-id or a conversion-function-id. */
16002 {
16003 /* We don't know whether we're looking at an
16004 operator-function-id or a conversion-function-id. */
16006 /* Try an operator-function-id. */
16008 /* If that didn't work, try a conversion-function-id. */
16010 {
16013 }
16014 }
16015 /* Look for the identifier. */
16016 else
16019 /* If we didn't find an identifier, we don't have a template-id. */
16023 /* If the name immediately followed the `template' keyword, then it
16024 is a template-name. However, if the next token is not `<', then
16025 we do not treat it as a template-name, since it is not being used
16026 as part of a template-id. This enables us to handle constructs
16027 like:
16029 template <typename T> struct S { S(); };
16030 template <typename T> S<T>::S();
16032 correctly. We would treat `S' as a template -- if it were `S<T>'
16033 -- but we do not if there is no `<'. */
16037 {
16038 /* In a declaration, in a dependent context, we pretend that the
16039 "template" keyword was present in order to improve error
16040 recovery. For example, given:
16042 template <typename T> void f(T::X<int>);
16044 we want to treat "X<int>" as a template-id. */
16046 && !template_keyword_p
16048 && check_dependency_p
16050 /* Do not do this for dtors (or ctors), since they never
16051 need the template keyword before their name. */
16053 {
16056 /* Explain what went wrong. */
16058 identifier);
16061 /* If parsing tentatively, find the location of the "<" token. */
16064 /* Parse the template arguments so that we can issue error
16065 messages about them. */
16068 /* Skip tokens until we find a good place from which to
16069 continue parsing. */
16074 /* If parsing tentatively, permanently remove the
16075 template argument list. That will prevent duplicate
16076 error messages from being issued about the missing
16077 "template" keyword. */
16084 }
16086 /* If the "template" keyword is present, then there is generally
16087 no point in doing name-lookup, so we just return IDENTIFIER.
16088 But, if the qualifying scope is non-dependent then we can
16089 (and must) do name-lookup normally. */
16091 {
16097 {
16098 /* We're optimizing away the call to cp_parser_lookup_name, but
16099 we still need to do this. */
16102 }
16103 }
16104 }
16106 /* Look up the name. */
16108 tag_type,
16111 check_dependency_p,
16117 /* If DECL is a template, then the name was a template-name. */
16119 {
16123 }
16124 else
16125 {
16126 /* The standard does not explicitly indicate whether a name that
16127 names a set of overloaded declarations, some of which are
16128 templates, is a template-name. However, such a name should
16129 be a template-name; otherwise, there is no way to form a
16130 template-id for the overloaded templates. */
16139 {
16140 /* The name does not name a template. */
16143 }
16144 }
16146 /* If DECL is dependent, and refers to a function, then just return
16147 its name; we will look it up again during template instantiation. */
16149 {
16153 }
16156 }
16158 /* Parse a template-argument-list.
16160 template-argument-list:
16161 template-argument ... [opt]
16162 template-argument-list , template-argument ... [opt]
16164 Returns a TREE_VEC containing the arguments. */
16166 static tree
16168 {
16173 tree vec;
16180 /* Even if the template-id appears in an integral
16181 constant-expression, the contents of the argument list do
16182 not. */
16188 /* Parse the arguments. */
16189 do
16190 {
16191 tree argument;
16194 /* Consume the comma. */
16197 /* Parse the template-argument. */
16200 /* If the next token is an ellipsis, we're expanding a template
16201 argument pack. */
16203 {
16205 {
16209 }
16210 /* Consume the `...' token. */
16213 /* Make the argument into a TYPE_PACK_EXPANSION or
16214 EXPR_PACK_EXPANSION. */
16216 }
16219 {
16223 {
16226 }
16227 else
16229 }
16231 }
16247 }
16249 /* Parse a template-argument.
16251 template-argument:
16252 assignment-expression
16253 type-id
16254 id-expression
16256 The representation is that of an assignment-expression, type-id, or
16257 id-expression -- except that the qualified id-expression is
16258 evaluated, so that the value returned is either a DECL or an
16259 OVERLOAD.
16261 Although the standard says "assignment-expression", it forbids
16262 throw-expressions or assignments in the template argument.
16263 Therefore, we use "conditional-expression" instead. */
16265 static tree
16267 {
16268 tree argument;
16274 cp_id_kind idk;
16276 /* There's really no way to know what we're looking at, so we just
16277 try each alternative in order.
16279 [temp.arg]
16281 In a template-argument, an ambiguity between a type-id and an
16282 expression is resolved to a type-id, regardless of the form of
16283 the corresponding template-parameter.
16285 Therefore, we try a type-id first. */
16288 /* If there was no error parsing the type-id but the next token is a
16289 '>>', our behavior depends on which dialect of C++ we're
16290 parsing. In C++98, we probably found a typo for '> >'. But there
16291 are type-id which are also valid expressions. For instance:
16293 struct X { int operator >> (int); };
16294 template <int V> struct Foo {};
16295 Foo<X () >> 5> r;
16297 Here 'X()' is a valid type-id of a function type, but the user just
16298 wanted to write the expression "X() >> 5". Thus, we remember that we
16299 found a valid type-id, but we still try to parse the argument as an
16300 expression to see what happens.
16302 In C++0x, the '>>' will be considered two separate '>'
16303 tokens. */
16307 {
16310 }
16311 else
16312 {
16313 /* If the next token isn't a `,' or a `>', then this argument wasn't
16314 really finished. This means that the argument is not a valid
16315 type-id. */
16318 /* If that worked, we're done. */
16321 }
16322 /* We're still not sure what the argument will be. */
16324 /* Try a template. */
16332 /* If the next token isn't a `,' or a `>', then this argument wasn't
16333 really finished. */
16337 {
16338 /* Figure out what is being referred to. If the id-expression
16339 was for a class template specialization, then we will have a
16340 TYPE_DECL at this point. There is no need to do name lookup
16341 at this point in that case. */
16344 none_type,
16350 /* Handle a constrained-type-specifier for a non-type template
16351 parameter. */
16357 }
16359 {
16363 }
16364 /* It must be a non-type argument. In C++17 any constant-expression is
16365 allowed. */
16369 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
16371 -- an integral constant-expression of integral or enumeration
16372 type; or
16374 -- the name of a non-type template-parameter; or
16376 -- the name of an object or function with external linkage...
16378 -- the address of an object or function with external linkage...
16380 -- a pointer to member... */
16381 /* Look for a non-type template parameter. */
16383 {
16395 }
16397 /* If the next token is "&", the argument must be the address of an
16398 object or function with external linkage. */
16401 {
16404 }
16405 /* See if we might have an id-expression. */
16412 {
16415 address_p,
16422 else
16423 {
16424 tree probe;
16427 {
16428 /* Strip the dereference temporarily. */
16431 }
16433 /* If we're in a template, we represent a qualified-id referring
16434 to a static data member as a SCOPE_REF even if the scope isn't
16435 dependent so that we can check access control later. */
16440 {
16441 /* A variable without external linkage might still be a
16442 valid constant-expression, so no error is issued here
16443 if the external-linkage check fails. */
16446 }
16448 /* All overloaded functions are allowed; if the external
16449 linkage test does not pass, an error will be issued
16450 later. */
16451 ;
16455 /* A pointer-to-member. */
16456 ;
16458 ;
16459 else
16463 {
16466 tf_warning_or_error);
16467 else
16470 }
16471 }
16472 }
16473 /* If the argument started with "&", there are no other valid
16474 alternatives at this point. */
16476 {
16479 }
16481 general_expr:
16482 /* If the argument wasn't successfully parsed as a type-id followed
16483 by '>>', the argument can only be a constant expression now.
16484 Otherwise, we try parsing the constant-expression tentatively,
16485 because the argument could really be a type-id. */
16491 else
16492 {
16493 /* With C++17 generalized non-type template arguments we need to handle
16494 lvalue constant expressions, too. */
16497 }
16505 /* We did our best to parse the argument as a non type-id, but that
16506 was the only alternative that matched (albeit with a '>' after
16507 it). We can assume it's just a typo from the user, and a
16508 diagnostic will then be issued. */
16510 }
16512 /* Parse an explicit-instantiation.
16514 explicit-instantiation:
16515 template declaration
16517 Although the standard says `declaration', what it really means is:
16519 explicit-instantiation:
16520 template decl-specifier-seq [opt] declarator [opt] ;
16522 Things like `template int S<int>::i = 5, int S<double>::j;' are not
16523 supposed to be allowed. A defect report has been filed about this
16524 issue.
16526 GNU Extension:
16528 explicit-instantiation:
16529 storage-class-specifier template
16530 decl-specifier-seq [opt] declarator [opt] ;
16531 function-specifier template
16532 decl-specifier-seq [opt] declarator [opt] ; */
16534 static void
16536 {
16538 cp_decl_specifier_seq decl_specifiers;
16543 /* Look for an (optional) storage-class-specifier or
16544 function-specifier. */
16546 {
16547 extension_specifier
16550 extension_specifier
16553 }
16555 /* Look for the `template' keyword. */
16557 /* Let the front end know that we are processing an explicit
16558 instantiation. */
16560 /* [temp.explicit] says that we are supposed to ignore access
16561 control while processing explicit instantiation directives. */
16563 /* Parse a decl-specifier-seq. */
16565 CP_PARSER_FLAGS_OPTIONAL,
16568 /* If there was exactly one decl-specifier, and it declared a class,
16569 and there's no declarator, then we have an explicit type
16570 instantiation. */
16572 {
16573 tree type;
16577 /* Turn access control back on for names used during
16578 template instantiation. */
16583 }
16584 else
16585 {
16587 tree decl;
16589 /* Parse the declarator. */
16590 declarator
16601 {
16604 "explicit instantiation shall not use"
16608 "explicit instantiation shall not use"
16613 /* Turn access control back on for names used during
16614 template instantiation. */
16616 /* Do the explicit instantiation. */
16618 }
16619 else
16620 {
16622 /* Skip the body of the explicit instantiation. */
16624 }
16625 }
16626 /* We're done with the instantiation. */
16632 }
16634 /* Parse an explicit-specialization.
16636 explicit-specialization:
16637 template < > declaration
16639 Although the standard says `declaration', what it really means is:
16641 explicit-specialization:
16642 template <> decl-specifier [opt] init-declarator [opt] ;
16643 template <> function-definition
16644 template <> explicit-specialization
16645 template <> template-declaration */
16647 static void
16649 {
16653 /* Look for the `template' keyword. */
16655 /* Look for the `<'. */
16657 /* Look for the `>'. */
16659 /* We have processed another parameter list. */
16661 /* [temp]
16663 A template ... explicit specialization ... shall not have C
16664 linkage. */
16666 {
16669 /* Give it C++ linkage to avoid confusing other parts of the
16670 front end. */
16673 }
16674 else
16676 /* Let the front end know that we are beginning a specialization. */
16678 {
16681 }
16683 /* If the next keyword is `template', we need to figure out whether
16684 or not we're looking a template-declaration. */
16686 {
16691 else
16693 }
16694 else
16695 /* Parse the dependent declaration. */
16701 /* We're done with the specialization. */
16703 /* For the erroneous case of a template with C linkage, we pushed an
16704 implicit C++ linkage scope; exit that scope now. */
16707 /* We're done with this parameter list. */
16709 }
16711 /* Parse a type-specifier.
16713 type-specifier:
16714 simple-type-specifier
16715 class-specifier
16716 enum-specifier
16717 elaborated-type-specifier
16718 cv-qualifier
16720 GNU Extension:
16722 type-specifier:
16723 __complex__
16725 Returns a representation of the type-specifier. For a
16726 class-specifier, enum-specifier, or elaborated-type-specifier, a
16727 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
16729 The parser flags FLAGS is used to control type-specifier parsing.
16731 If IS_DECLARATION is TRUE, then this type-specifier is appearing
16732 in a decl-specifier-seq.
16734 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
16735 class-specifier, enum-specifier, or elaborated-type-specifier, then
16736 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
16737 if a type is declared; 2 if it is defined. Otherwise, it is set to
16738 zero.
16740 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
16741 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
16742 is set to FALSE. */
16744 static tree
16746 cp_parser_flags flags,
16751 {
16757 /* Assume this type-specifier does not declare a new type. */
16760 /* And that it does not specify a cv-qualifier. */
16763 /* Peek at the next token. */
16766 /* If we're looking at a keyword, we can use that to guide the
16767 production we choose. */
16770 {
16775 /* Look for the enum-specifier. */
16777 /* If that worked, we're done. */
16779 {
16784 type_spec,
16785 token,
16788 }
16789 else
16792 /* Any of these indicate either a class-specifier, or an
16793 elaborated-type-specifier. */
16800 /* Parse tentatively so that we can back up if we don't find a
16801 class-specifier. */
16803 /* Look for the class-specifier. */
16806 /* If that worked, we're done. */
16808 {
16813 type_spec,
16814 token,
16817 }
16819 /* Fall through. */
16820 elaborated_type_specifier:
16821 /* We're declaring (not defining) a class or enum. */
16825 /* Fall through. */
16827 /* Look for an elaborated-type-specifier. */
16828 type_spec
16829 = (cp_parser_elaborated_type_specifier
16832 is_declaration));
16835 type_spec,
16836 token,
16859 /* The `__complex__' keyword is a GNU extension. */
16865 }
16867 /* Handle simple keywords. */
16869 {
16871 {
16874 }
16876 }
16878 /* If we do not already have a type-specifier, assume we are looking
16879 at a simple-type-specifier. */
16881 decl_specs,
16882 flags);
16884 /* If we didn't find a type-specifier, and a type-specifier was not
16885 optional in this context, issue an error message. */
16887 {
16890 }
16893 }
16895 /* Parse a simple-type-specifier.
16897 simple-type-specifier:
16898 :: [opt] nested-name-specifier [opt] type-name
16899 :: [opt] nested-name-specifier template template-id
16900 char
16901 wchar_t
16902 bool
16903 short
16904 int
16905 long
16906 signed
16907 unsigned
16908 float
16909 double
16910 void
16912 C++11 Extension:
16914 simple-type-specifier:
16915 auto
16916 decltype ( expression )
16917 char16_t
16918 char32_t
16919 __underlying_type ( type-id )
16921 C++17 extension:
16923 nested-name-specifier(opt) template-name
16925 GNU Extension:
16927 simple-type-specifier:
16928 __int128
16929 __typeof__ unary-expression
16930 __typeof__ ( type-id )
16931 __typeof__ ( type-id ) { initializer-list , [opt] }
16933 Concepts Extension:
16935 simple-type-specifier:
16936 constrained-type-specifier
16938 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
16939 appropriately updated. */
16941 static tree
16944 cp_parser_flags flags)
16945 {
16950 /* Peek at the next token. */
16953 /* If we're looking at a keyword, things are easy. */
16955 {
16990 {
16993 }
17022 {
17023 /* The 'auto' might be the placeholder return type for a function decl
17024 with trailing return type. */
17033 {
17035 {
17042 }
17045 {
17048 }
17051 }
17055 {
17058 }
17061 {
17064 }
17065 else
17069 {
17072 "use of %<auto%> in lambda parameter declaration "
17073 "only available with "
17075 }
17078 "use of %<auto%> in parameter declaration "
17079 "only available with "
17083 "ISO C++ forbids use of %<auto%> in parameter "
17085 }
17086 else
17091 /* Since DR 743, decltype can either be a simple-type-specifier by
17092 itself or begin a nested-name-specifier. Parsing it will replace
17093 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
17094 handling below decide what to do. */
17100 /* Consume the `typeof' token. */
17102 /* Parse the operand to `typeof'. */
17104 /* If it is not already a TYPE, take its type. */
17110 token,
17119 token,
17129 token,
17134 }
17136 /* If token is an already-parsed decltype not followed by ::,
17137 it's a simple-type-specifier. */
17140 {
17143 {
17145 token,
17147 /* Remember that we are handling a decltype in order to
17148 implement the resolution of DR 1510 when the argument
17149 isn't instantiation dependent. */
17151 }
17154 }
17156 /* If the type-specifier was for a built-in type, we're done. */
17158 {
17159 /* Record the type. */
17166 type,
17167 token,
17172 /* Consume the token. */
17178 /* There is no valid C++ program where a non-template type is
17179 followed by a "<". That usually indicates that the user thought
17180 that the type was a template. */
17185 }
17187 /* The type-specifier must be a user-defined type. */
17189 {
17193 /* Don't gobble tokens or issue error messages if this is an
17194 optional type-specifier. */
17200 /* Look for the optional `::' operator. */
17201 global_p
17205 /* Look for the nested-name specifier. */
17206 qualified_p
17213 /* If we have seen a nested-name-specifier, and the next token
17214 is `template', then we are using the template-id production. */
17217 {
17218 /* Look for the template-id. */
17222 none_type,
17224 /* If the template-id did not name a type, we are out of
17225 luck. */
17227 {
17230 }
17231 }
17232 /* Otherwise, look for a type-name. */
17233 else
17235 /* Keep track of all name-lookups performed in class scopes. */
17237 && !global_p
17238 && !qualified_p
17242 /* If it didn't work out, we don't have a TYPE. */
17247 {
17261 {
17263 none_type,
17273 else
17274 {
17279 }
17280 }
17281 else
17287 }
17290 token,
17292 }
17294 /* If we didn't get a type-name, issue an error message. */
17296 {
17299 }
17302 {
17303 /* See if TYPE is an Objective-C type, and if so, parse and
17304 accept any protocol references following it. Do this before
17305 the cp_parser_check_for_invalid_template_id() call, because
17306 Objective-C types can be followed by '<...>' which would
17307 enclose protocol names rather than template arguments, and so
17308 everything is fine. */
17311 {
17315 /* Clobber the "unqualified" type previously entered into
17316 DECL_SPECS with the new, improved protocol-qualified version. */
17321 }
17323 /* There is no valid C++ program where a non-template type is
17324 followed by a "<". That usually indicates that the user
17325 thought that the type was a template. */
17327 none_type,
17329 }
17332 }
17334 /* Parse a type-name.
17336 type-name:
17337 class-name
17338 enum-name
17339 typedef-name
17340 simple-template-id [in c++0x]
17342 enum-name:
17343 identifier
17345 typedef-name:
17346 identifier
17348 Concepts:
17350 type-name:
17351 concept-name
17352 partial-concept-id
17354 concept-name:
17355 identifier
17357 Returns a TYPE_DECL for the type. */
17359 static tree
17361 {
17363 }
17365 /* See above. */
17366 static tree
17368 {
17369 tree type_decl;
17371 /* We can't know yet whether it is a class-name or not. */
17373 /* Try a class-name. */
17375 typename_keyword_p,
17377 none_type,
17381 /* If it's not a class-name, keep looking. */
17383 {
17385 /* It must be a typedef-name or an enum-name. */
17389 /* It is either a simple-template-id representing an
17390 instantiation of an alias template... */
17394 none_type,
17396 /* Note that this must be an instantiation of an alias template
17397 because [temp.names]/6 says:
17399 A template-id that names an alias template specialization
17400 is a type-name.
17402 Whereas [temp.names]/7 says:
17404 A simple-template-id that names a class template
17405 specialization is a class-name.
17407 With concepts, this could also be a partial-concept-id that
17408 declares a non-type template parameter. */
17415 else
17419 /* ... Or a typedef-name or an enum-name. */
17421 }
17424 }
17426 /* Check if DECL and ARGS can form a constrained-type-specifier.
17427 If ARGS is non-null, we try to form a concept check of the
17428 form DECL<?, ARGS> where ? is a wildcard that matches any
17429 kind of template argument. If ARGS is NULL, then we try to
17430 form a concept check of the form DECL<?>. */
17432 static tree
17435 {
17438 /* If we a constrained-type-specifier cannot be deduced. */
17442 /* A constrained type specifier can only be found in an
17443 overload set or as a reference to a template declaration.
17445 FIXME: This might be masking a bug. It's possible that
17446 that the deduction below is causing template specializations
17447 to be formed with the wildcard as an argument. */
17451 /* Try to build a call expression that evaluates the
17452 concept. This can fail if the overload set refers
17453 only to non-templates. */
17459 /* Deduce the checked constraint and the prototype parameter.
17461 FIXME: In certain cases, failure to deduce should be a
17462 diagnosable error. */
17463 tree conc;
17464 tree proto;
17468 /* In template parameter scope, this results in a constrained
17469 parameter. Return a descriptor of that parm. */
17473 /* In a parameter-declaration-clause, constrained-type
17474 specifiers result in invented template parameters. */
17476 {
17479 }
17480 else
17481 {
17482 /* Otherwise, we're in a context where the constrained
17483 type name is deduced and the constraint applies
17484 after deduction. */
17486 }
17489 }
17491 /* If DECL refers to a concept, return a TYPE_DECL representing
17492 the result of using the constrained type specifier in the
17493 current context. DECL refers to a concept if
17495 - it is an overload set containing a function concept taking a single
17496 type argument, or
17498 - it is a variable concept taking a single type argument. */
17500 static tree
17502 {
17508 else
17510 }
17512 /* Check if DECL and ARGS form a partial-concept-id. If so,
17513 assign ID to the resulting constrained placeholder.
17515 Returns true if the partial-concept-id designates a placeholder
17516 and false otherwise. Note that *id is set to NULL_TREE in
17517 this case. */
17519 static tree
17521 {
17523 }
17525 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
17526 or a concept-name.
17528 enum-name:
17529 identifier
17531 typedef-name:
17532 identifier
17534 concept-name:
17535 identifier
17537 Returns a TYPE_DECL for the type. */
17539 static tree
17541 {
17542 tree type_decl;
17543 tree identifier;
17550 /* Look up the type-name. */
17555 /* If we found an overload set, then it may refer to a concept-name. */
17561 {
17562 /* See if this is an Objective-C type. */
17567 }
17569 /* Issue an error if we did not find a type-name. */
17571 /* In Objective-C, we have the complication that class names are
17572 normally type names and start declarations (eg, the
17573 "NSObject" in "NSObject *object;"), but can be used in an
17574 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
17575 is an expression. So, a classname followed by a dot is not a
17576 valid type-name. */
17579 {
17584 }
17585 /* Remember that the name was used in the definition of the
17586 current class so that we can check later to see if the
17587 meaning would have been different after the class was
17588 entirely defined. */
17594 }
17596 /* Parse an elaborated-type-specifier. Note that the grammar given
17597 here incorporates the resolution to DR68.
17599 elaborated-type-specifier:
17600 class-key :: [opt] nested-name-specifier [opt] identifier
17601 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
17602 enum-key :: [opt] nested-name-specifier [opt] identifier
17603 typename :: [opt] nested-name-specifier identifier
17604 typename :: [opt] nested-name-specifier template [opt]
17605 template-id
17607 GNU extension:
17609 elaborated-type-specifier:
17610 class-key attributes :: [opt] nested-name-specifier [opt] identifier
17611 class-key attributes :: [opt] nested-name-specifier [opt]
17612 template [opt] template-id
17613 enum attributes :: [opt] nested-name-specifier [opt] identifier
17615 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
17616 declared `friend'. If IS_DECLARATION is TRUE, then this
17617 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
17618 something is being declared.
17620 Returns the TYPE specified. */
17622 static tree
17626 {
17628 tree identifier;
17631 tree globalscope;
17634 /* See if we're looking at the `enum' keyword. */
17636 {
17637 /* Consume the `enum' token. */
17639 /* Remember that it's an enumeration type. */
17641 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
17642 enums) is used here. */
17646 {
17653 /* Consume the `struct' or `class' and parse it anyway. */
17655 }
17656 /* Parse the attributes. */
17658 }
17659 /* Or, it might be `typename'. */
17661 RID_TYPENAME))
17662 {
17663 /* Consume the `typename' token. */
17665 /* Remember that it's a `typename' type. */
17667 }
17668 /* Otherwise it must be a class-key. */
17669 else
17670 {
17674 /* Parse the attributes. */
17676 }
17678 /* Look for the `::' operator. */
17681 /* Look for the nested-name-specifier. */
17682 tree nested_name_specifier;
17684 {
17685 nested_name_specifier
17690 is_declaration);
17693 }
17694 else
17695 /* Even though `typename' is not present, the proposed resolution
17696 to Core Issue 180 says that in `class A<T>::B', `B' should be
17697 considered a type-name, even if `A<T>' is dependent. */
17698 nested_name_specifier
17703 is_declaration);
17704 /* For everything but enumeration types, consider a template-id.
17705 For an enumeration type, consider only a plain identifier. */
17707 {
17709 tree decl;
17711 /* Allow the `template' keyword. */
17713 /* If we didn't see `template', we don't know if there's a
17714 template-id or not. */
17717 /* Parse the template-id. */
17721 tag_type,
17722 is_declaration);
17723 /* If we didn't find a template-id, look for an ordinary
17724 identifier. */
17726 ;
17727 /* We can get here when cp_parser_template_id, called by
17728 cp_parser_class_name with tag_type == none_type, succeeds
17729 and caches a BASELINK. Then, when called again here,
17730 instead of failing and returning an error_mark_node
17731 returns it (see template/typename17.C in C++11).
17732 ??? Could we diagnose this earlier? */
17734 {
17737 }
17738 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
17739 in effect, then we must assume that, upon instantiation, the
17740 template will correspond to a class. */
17744 typename_type,
17746 /* If the `typename' keyword is in effect and DECL is not a type
17747 decl, then type is non existent. */
17749 ;
17751 {
17755 /* If the next token is a semicolon, this must be a specialization,
17756 instantiation, or friend declaration. Check the scope while we
17757 still know whether or not we had a nested-name-specifier. */
17762 }
17765 }
17768 {
17773 {
17776 }
17778 /* For a `typename', we needn't call xref_tag. */
17784 /* Template parameter lists apply only if we are not within a
17785 function parameter list. */
17786 bool template_parm_lists_apply
17795 /* Look up a qualified name in the usual way. */
17797 {
17798 tree decl;
17799 tree ambiguous_decls;
17802 tag_type,
17809 /* If the lookup was ambiguous, an error will already have been
17810 issued. */
17814 /* If we are parsing friend declaration, DECL may be a
17815 TEMPLATE_DECL tree node here. However, we need to check
17816 whether this TEMPLATE_DECL results in valid code. Consider
17817 the following example:
17819 namespace N {
17820 template <class T> class C {};
17821 }
17822 class X {
17823 template <class T> friend class N::C; // #1, valid code
17824 };
17825 template <class T> class Y {
17826 friend class N::C; // #2, invalid code
17827 };
17829 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
17830 name lookup of `N::C'. We see that friend declaration must
17831 be template for the code to be valid. Note that
17832 processing_template_decl does not work here since it is
17833 always 1 for the above two cases. */
17835 decl = (cp_parser_maybe_treat_template_as_class
17840 {
17842 identifier,
17845 }
17848 {
17852 allow_template);
17856 }
17858 /* Forward declarations of nested types, such as
17860 class C1::C2;
17861 class C1::C2::C3;
17863 are invalid unless all components preceding the final '::'
17864 are complete. If all enclosing types are complete, these
17865 declarations become merely pointless.
17867 Invalid forward declarations of nested types are errors
17868 caught elsewhere in parsing. Those that are pointless arrive
17869 here. */
17876 }
17877 else
17878 {
17879 /* An elaborated-type-specifier sometimes introduces a new type and
17880 sometimes names an existing type. Normally, the rule is that it
17881 introduces a new type only if there is not an existing type of
17882 the same name already in scope. For example, given:
17884 struct S {};
17885 void f() { struct S s; }
17887 the `struct S' in the body of `f' is the same `struct S' as in
17888 the global scope; the existing definition is used. However, if
17889 there were no global declaration, this would introduce a new
17890 local class named `S'.
17892 An exception to this rule applies to the following code:
17894 namespace N { struct S; }
17896 Here, the elaborated-type-specifier names a new type
17897 unconditionally; even if there is already an `S' in the
17898 containing scope this declaration names a new type.
17899 This exception only applies if the elaborated-type-specifier
17900 forms the complete declaration:
17902 [class.name]
17904 A declaration consisting solely of `class-key identifier ;' is
17905 either a redeclaration of the name in the current scope or a
17906 forward declaration of the identifier as a class name. It
17907 introduces the name into the current scope.
17909 We are in this situation precisely when the next token is a `;'.
17911 An exception to the exception is that a `friend' declaration does
17912 *not* name a new type; i.e., given:
17914 struct S { friend struct T; };
17916 `T' is not a new type in the scope of `S'.
17918 Also, `new struct S' or `sizeof (struct S)' never results in the
17919 definition of a new type; a new type can only be declared in a
17920 declaration context. */
17922 tag_scope ts;
17926 /* Friends have special name lookup rules. */
17930 CPP_SEMICOLON))
17931 /* This is a `class-key identifier ;' */
17933 else
17936 template_p =
17937 (template_parm_lists_apply
17940 /* An unqualified name was used to reference this type, so
17941 there were no qualifying templates. */
17949 }
17950 }
17955 /* Allow attributes on forward declarations of classes. */
17957 {
17967 else
17970 }
17973 {
17974 /* Indicate whether this class was declared as a `class' or as a
17975 `struct'. */
17979 }
17981 /* A "<" cannot follow an elaborated type specifier. If that
17982 happens, the user was probably trying to form a template-id. */
17987 }
17989 /* Parse an enum-specifier.
17991 enum-specifier:
17992 enum-head { enumerator-list [opt] }
17993 enum-head { enumerator-list , } [C++0x]
17995 enum-head:
17996 enum-key identifier [opt] enum-base [opt]
17997 enum-key nested-name-specifier identifier enum-base [opt]
17999 enum-key:
18000 enum
18001 enum class [C++0x]
18002 enum struct [C++0x]
18004 enum-base: [C++0x]
18005 : type-specifier-seq
18007 opaque-enum-specifier:
18008 enum-key identifier enum-base [opt] ;
18010 GNU Extensions:
18011 enum-key attributes[opt] identifier [opt] enum-base [opt]
18012 { enumerator-list [opt] }attributes[opt]
18013 enum-key attributes[opt] identifier [opt] enum-base [opt]
18014 { enumerator-list, }attributes[opt] [C++0x]
18016 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
18017 if the token stream isn't an enum-specifier after all. */
18019 static tree
18021 {
18022 tree identifier;
18024 tree prev_scope;
18026 tree attributes;
18039 /* Parse tentatively so that we can back up if we don't find a
18040 enum-specifier. */
18043 /* Caller guarantees that the current token is 'enum', an identifier
18044 possibly follows, and the token after that is an opening brace.
18045 If we don't have an identifier, fabricate an anonymous name for
18046 the enumeration being defined. */
18049 /* Parse the "class" or "struct", which indicates a scoped
18050 enumeration type in C++0x. */
18053 {
18057 /* Consume the `struct' or `class' token. */
18061 }
18065 /* Clear the qualification. */
18070 /* Figure out in what scope the declaration is being placed. */
18076 nested_name_specifier
18084 {
18085 tree name;
18089 enum_type,
18094 input_location);
18096 {
18099 {
18100 /* Are template enums allowed in ISO? */
18104 /* ignore a typename reference, for it will be solved by name
18105 in start_enum. */
18107 }
18108 }
18111 else
18112 {
18117 }
18118 }
18119 else
18120 {
18123 else
18124 {
18130 }
18131 }
18134 /* Check for the `:' that denotes a specified underlying type in C++0x.
18135 Note that a ':' could also indicate a bitfield width, however. */
18137 {
18138 cp_decl_specifier_seq type_specifiers;
18140 /* Consume the `:'. */
18143 /* Parse the type-specifier-seq. */
18148 /* At this point this is surely not elaborated type specifier. */
18157 /* If that didn't work, stop. */
18159 {
18165 }
18166 }
18168 /* Look for the `{' but don't consume it yet. */
18170 {
18172 {
18175 {
18178 }
18179 }
18180 /* An opaque-enum-specifier must have a ';' here. */
18183 {
18186 {
18189 }
18190 }
18191 }
18197 {
18199 {
18203 }
18205 {
18207 }
18208 }
18210 /* Issue an error message if type-definitions are forbidden here. */
18213 else
18214 /* Create the new type. We do this before consuming the opening
18215 brace so the enum will be recorded as being on the line of its
18216 tag (or the 'enum' keyword, if there is no tag). */
18220 /* If the next token is not '{' it is an opaque-enum-specifier or an
18221 elaborated-type-specifier. */
18223 {
18227 {
18228 /* The following catches invalid code such as:
18229 enum class S<int>::E { A, B, C }; */
18237 {
18241 nested_name_specifier);
18243 }
18246 {
18248 "%qT for enum declaration does not name a class "
18251 }
18252 /* If that scope does not contain the scope in which the
18253 class was originally declared, the program is invalid. */
18255 nested_name_specifier))
18256 {
18259 "declaration of %qD in namespace %qD which does not "
18262 else
18264 "declaration of %qD in %qD which does not "
18268 }
18269 /* If that scope is the scope where the declaration is being placed
18270 the program is invalid. */
18274 {
18278 }
18279 }
18284 /* Consume the opening brace. */
18285 matching_braces braces;
18292 {
18296 }
18297 else
18298 {
18304 }
18308 /* If the next token is not '}', then there are some enumerators. */
18310 {
18314 }
18315 else
18318 /* Consume the final '}'. */
18324 }
18325 else
18326 {
18327 /* If a ';' follows, then it is an opaque-enum-specifier
18328 and additional restrictions apply. */
18330 {
18337 }
18338 }
18340 /* Look for trailing attributes to apply to this enumeration, and
18341 apply them if appropriate. */
18343 {
18346 trailing_attr,
18348 }
18350 /* Finish up the enumeration. */
18352 {
18357 }
18360 {
18362 {
18365 }
18367 {
18369 }
18370 }
18371 out:
18374 }
18376 /* Parse an enumerator-list. The enumerators all have the indicated
18377 TYPE.
18379 enumerator-list:
18380 enumerator-definition
18381 enumerator-list , enumerator-definition */
18383 static void
18385 {
18387 {
18388 /* Parse an enumerator-definition. */
18391 /* If the next token is not a ',', we've reached the end of
18392 the list. */
18395 /* Otherwise, consume the `,' and keep going. */
18397 /* If the next token is a `}', there is a trailing comma. */
18399 {
18404 }
18405 }
18406 }
18408 /* Parse an enumerator-definition. The enumerator has the indicated
18409 TYPE.
18411 enumerator-definition:
18412 enumerator
18413 enumerator = constant-expression
18415 enumerator:
18416 identifier
18418 GNU Extensions:
18420 enumerator-definition:
18421 enumerator attributes [opt]
18422 enumerator attributes [opt] = constant-expression */
18424 static void
18426 {
18427 tree identifier;
18428 tree value;
18429 location_t loc;
18431 /* Save the input location because we are interested in the location
18432 of the identifier and not the location of the explicit value. */
18435 /* Look for the identifier. */
18440 /* Parse any specified attributes. */
18443 /* If the next token is an '=', then there is an explicit value. */
18445 {
18446 /* Consume the `=' token. */
18448 /* Parse the value. */
18450 }
18451 else
18454 /* If we are processing a template, make sure the initializer of the
18455 enumerator doesn't contain any bare template parameter pack. */
18459 /* Create the enumerator. */
18461 }
18463 /* Parse a namespace-name.
18465 namespace-name:
18466 original-namespace-name
18467 namespace-alias
18469 Returns the NAMESPACE_DECL for the namespace. */
18471 static tree
18473 {
18474 tree identifier;
18475 tree namespace_decl;
18479 /* Get the name of the namespace. */
18484 /* Look up the identifier in the currently active scope. Look only
18485 for namespaces, due to:
18487 [basic.lookup.udir]
18489 When looking up a namespace-name in a using-directive or alias
18490 definition, only namespace names are considered.
18492 And:
18494 [basic.lookup.qual]
18496 During the lookup of a name preceding the :: scope resolution
18497 operator, object, function, and enumerator names are ignored.
18499 (Note that cp_parser_qualifying_entity only calls this
18500 function if the token after the name is the scope resolution
18501 operator.) */
18503 none_type,
18509 /* If it's not a namespace, issue an error. */
18512 {
18517 }
18520 }
18522 /* Parse a namespace-definition.
18524 namespace-definition:
18525 named-namespace-definition
18526 unnamed-namespace-definition
18528 named-namespace-definition:
18529 original-namespace-definition
18530 extension-namespace-definition
18532 original-namespace-definition:
18533 namespace identifier { namespace-body }
18535 extension-namespace-definition:
18536 namespace original-namespace-name { namespace-body }
18538 unnamed-namespace-definition:
18539 namespace { namespace-body } */
18541 static void
18543 {
18544 tree identifier;
18553 {
18556 }
18558 /* Look for the `namespace' keyword. */
18559 cp_token* token
18562 /* Parse any specified attributes before the identifier. */
18566 {
18570 {
18573 /* Parse any attributes specified after the identifier. */
18575 }
18582 "nested namespace definitions only available with "
18585 /* Nested namespace names can create new namespaces (unlike
18586 other qualified-ids). */
18589 else
18592 }
18604 /* Start the namespace. */
18611 /* Look for the `{' to validate starting the namespace. */
18612 matching_braces braces;
18614 {
18615 /* Parse the body of the namespace. */
18618 /* Look for the final `}'. */
18620 }
18625 /* Pop the nested namespace definitions. */
18628 }
18630 /* Parse a namespace-body.
18632 namespace-body:
18633 declaration-seq [opt] */
18635 static void
18637 {
18639 }
18641 /* Parse a namespace-alias-definition.
18643 namespace-alias-definition:
18644 namespace identifier = qualified-namespace-specifier ; */
18646 static void
18648 {
18649 tree identifier;
18650 tree namespace_specifier;
18654 /* Look for the `namespace' keyword. */
18656 /* Look for the identifier. */
18660 /* Look for the `=' token. */
18663 {
18665 /* Skip the definition. */
18670 }
18672 /* Look for the qualified-namespace-specifier. */
18673 namespace_specifier
18675 /* Look for the `;' token. */
18678 /* Register the alias in the symbol table. */
18680 }
18682 /* Parse a qualified-namespace-specifier.
18684 qualified-namespace-specifier:
18685 :: [opt] nested-name-specifier [opt] namespace-name
18687 Returns a NAMESPACE_DECL corresponding to the specified
18688 namespace. */
18690 static tree
18692 {
18693 /* Look for the optional `::'. */
18697 /* Look for the optional nested-name-specifier. */
18705 }
18707 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
18708 access declaration.
18710 using-declaration:
18711 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
18712 using :: unqualified-id ;
18714 access-declaration:
18715 qualified-id ;
18717 */
18719 static bool
18722 {
18726 tree decl;
18727 tree identifier;
18728 tree qscope;
18733 {
18736 }
18737 else
18738 {
18739 /* Look for the `using' keyword. */
18742 again:
18743 /* Peek at the next token. */
18745 /* See if it's `typename'. */
18747 {
18748 /* Remember that we've seen it. */
18750 /* Consume the `typename' token. */
18752 }
18753 }
18755 /* Look for the optional global scope qualification. */
18756 global_scope_p
18761 /* If we saw `typename', or didn't see `::', then there must be a
18762 nested-name-specifier present. */
18764 {
18770 {
18773 }
18774 }
18775 /* Otherwise, we could be in either of the two productions. In that
18776 case, treat the nested-name-specifier as optional. */
18777 else
18789 /* Something has already gone wrong; there's no need to parse
18790 further. Since an error has occurred, the return value of
18791 cp_parser_parse_definitely will be false, as required. */
18795 /* Parse the unqualified-id. */
18803 {
18808 }
18810 {
18815 "pack expansion in using-declaration only available "
18818 }
18820 /* The function we call to handle a using-declaration is different
18821 depending on what scope we are in. */
18823 ;
18826 /* [namespace.udecl]
18828 A using declaration shall not name a template-id. */
18831 else
18832 {
18834 {
18835 /* Create the USING_DECL. */
18842 {
18845 }
18846 else
18847 /* Add it to the list of members in this class. */
18849 }
18850 else
18851 {
18853 identifier,
18860 {
18863 }
18866 else
18868 }
18869 }
18873 {
18877 "comma-separated list in using-declaration only available "
18880 }
18882 /* Look for the final `;'. */
18887 "access declarations are deprecated "
18888 "in favour of using-declarations; "
18892 }
18894 /* Parse an alias-declaration.
18896 alias-declaration:
18897 using identifier attribute-specifier-seq [opt] = type-id */
18899 static tree
18901 {
18903 location_t id_location;
18905 cp_decl_specifier_seq decl_specs;
18909 /* Look for the `using' keyword. */
18910 cp_token *using_token
18932 /* Now we are going to parse the type-id of the declaration. */
18934 /*
18935 [dcl.type]/3 says:
18937 "A type-specifier-seq shall not define a class or enumeration
18938 unless it appears in the type-id of an alias-declaration (7.1.3) that
18939 is not the declaration of a template-declaration."
18941 In other words, if we currently are in an alias template, the
18942 type-id should not define a type.
18944 So let's set parser->type_definition_forbidden_message in that
18945 case; cp_parser_check_type_definition (called by
18946 cp_parser_class_specifier) will then emit an error if a type is
18947 defined in the type-id. */
18949 {
18953 }
18957 /* Restore the error message if need be. */
18963 {
18966 }
18968 /* A typedef-name can also be introduced by an alias-declaration. The
18969 identifier following the using keyword becomes a typedef-name. It has
18970 the same semantics as if it were introduced by the typedef
18971 specifier. In particular, it does not define a new type and it shall
18972 not appear in the type-id. */
18977 {
18980 ds_attribute,
18981 attrs_token);
18982 }
18984 ds_typedef,
18985 using_token);
18987 ds_alias,
18988 using_token);
18997 else
19003 // Attach constraints to the alias declaration.
19005 {
19009 }
19016 /* If decl is a template, return its TEMPLATE_DECL so that it gets
19017 added into the symbol table; otherwise, return the TYPE_DECL. */
19021 {
19025 }
19028 }
19030 /* Parse a using-directive.
19032 using-directive:
19033 using namespace :: [opt] nested-name-specifier [opt]
19034 namespace-name ; */
19036 static void
19038 {
19039 tree namespace_decl;
19040 tree attribs;
19042 /* Look for the `using' keyword. */
19044 /* And the `namespace' keyword. */
19046 /* Look for the optional `::' operator. */
19048 /* And the optional nested-name-specifier. */
19054 /* Get the namespace being used. */
19056 /* And any specified attributes. */
19059 /* Update the symbol table. */
19062 else
19065 /* Look for the final `;'. */
19067 }
19069 /* Parse an asm-definition.
19071 asm-definition:
19072 asm ( string-literal ) ;
19074 GNU Extension:
19076 asm-definition:
19077 asm volatile [opt] ( string-literal ) ;
19078 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
19079 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19080 : asm-operand-list [opt] ) ;
19081 asm volatile [opt] ( string-literal : asm-operand-list [opt]
19082 : asm-operand-list [opt]
19083 : asm-clobber-list [opt] ) ;
19084 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
19085 : asm-clobber-list [opt]
19086 : asm-goto-list ) ; */
19088 static void
19090 {
19091 tree string;
19096 tree asm_stmt;
19104 /* Look for the `asm' keyword. */
19109 {
19112 }
19114 /* See if the next token is `volatile'. */
19117 {
19118 /* Remember that we saw the `volatile' keyword. */
19120 /* Consume the token. */
19122 }
19126 {
19127 /* Remember that we saw the `goto' keyword. */
19129 /* Consume the token. */
19131 }
19132 /* Look for the opening `('. */
19135 /* Look for the string. */
19138 {
19142 }
19144 /* If we're allowing GNU extensions, check for the extended assembly
19145 syntax. Unfortunately, the `:' tokens need not be separated by
19146 a space in C, and so, for compatibility, we tolerate that here
19147 too. Doing that means that we have to treat the `::' operator as
19148 two `:' tokens. */
19153 {
19158 /* The extended syntax was used. */
19161 /* Look for outputs. */
19163 {
19164 /* Consume the `:'. */
19166 /* Parse the output-operands. */
19168 CPP_COLON)
19170 CPP_SCOPE)
19172 CPP_CLOSE_PAREN)
19174 {
19178 }
19179 }
19180 /* If the next token is `::', there are no outputs, and the
19181 next token is the beginning of the inputs. */
19183 /* The inputs are coming next. */
19186 /* Look for inputs. */
19189 {
19190 /* Consume the `:' or `::'. */
19192 /* Parse the output-operands. */
19194 CPP_COLON)
19196 CPP_SCOPE)
19198 CPP_CLOSE_PAREN))
19199 {
19203 }
19204 }
19206 /* The clobbers are coming next. */
19209 /* Look for clobbers. */
19212 {
19214 /* Consume the `:' or `::'. */
19216 /* Parse the clobbers. */
19218 CPP_COLON)
19220 CPP_CLOSE_PAREN))
19222 }
19225 /* The labels are coming next. */
19228 /* Look for labels. */
19231 {
19233 /* Consume the `:' or `::'. */
19235 /* Parse the labels. */
19237 }
19241 }
19245 /* Look for the closing `)'. */
19253 {
19254 /* Create the ASM_EXPR. */
19256 {
19259 /* If the extended syntax was not used, mark the ASM_EXPR. */
19261 {
19267 }
19268 }
19269 else
19271 }
19272 }
19274 /* Given the type TYPE of a declaration with declarator DECLARATOR, return the
19275 type that comes from the decl-specifier-seq. */
19277 static tree
19279 {
19282 {
19295 }
19298 }
19300 /* Declarators [gram.dcl.decl] */
19302 /* Parse an init-declarator.
19304 init-declarator:
19305 declarator initializer [opt]
19307 GNU Extension:
19309 init-declarator:
19310 declarator asm-specification [opt] attributes [opt] initializer [opt]
19312 function-definition:
19313 decl-specifier-seq [opt] declarator ctor-initializer [opt]
19314 function-body
19315 decl-specifier-seq [opt] declarator function-try-block
19317 GNU Extension:
19319 function-definition:
19320 __extension__ function-definition
19322 TM Extension:
19324 function-definition:
19325 decl-specifier-seq [opt] declarator function-transaction-block
19327 The DECL_SPECIFIERS apply to this declarator. Returns a
19328 representation of the entity declared. If MEMBER_P is TRUE, then
19329 this declarator appears in a class scope. The new DECL created by
19330 this declarator is returned.
19332 The CHECKS are access checks that should be performed once we know
19333 what entity is being declared (and, therefore, what classes have
19334 befriended it).
19336 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
19337 for a function-definition here as well. If the declarator is a
19338 declarator for a function-definition, *FUNCTION_DEFINITION_P will
19339 be TRUE upon return. By that point, the function-definition will
19340 have been completely parsed.
19342 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
19343 is FALSE.
19345 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
19346 parsed declaration if it is an uninitialized single declarator not followed
19347 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
19348 if present, will not be consumed. If returned, this declarator will be
19349 created with SD_INITIALIZED but will not call cp_finish_decl.
19351 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
19352 and there is an initializer, the pointed location_t is set to the
19353 location of the '=' or `(', or '{' in C++11 token introducing the
19354 initializer. */
19356 static tree
19367 {
19371 tree prefix_attributes;
19373 tree asm_specification;
19374 tree initializer;
19376 tree scope;
19378 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
19379 initialized with "= ..", CPP_OPEN_PAREN if initialized with
19380 "(...)". */
19391 /* Gather the attributes that were provided with the
19392 decl-specifiers. */
19395 /* Assume that this is not the declarator for a function
19396 definition. */
19400 /* Default arguments are only permitted for function parameters. */
19404 /* Defer access checks while parsing the declarator; we cannot know
19405 what names are accessible until we know what is being
19406 declared. */
19411 /* Parse the declarator. */
19412 declarator
19417 /* Gather up the deferred checks. */
19422 /* If the DECLARATOR was erroneous, there's no need to go
19423 further. */
19427 /* Check that the number of template-parameter-lists is OK. */
19437 /* Figure out what scope the entity declared by the DECLARATOR is
19438 located in. `grokdeclarator' sometimes changes the scope, so
19439 we compute it now. */
19442 /* Perform any lookups in the declared type which were thought to be
19443 dependent, but are not in the scope of the declarator. */
19444 decl_specifiers->type
19447 /* If we're allowing GNU extensions, look for an
19448 asm-specification. */
19450 {
19451 /* Look for an asm-specification. */
19454 }
19455 else
19458 /* Look for attributes. */
19462 /* Peek at the next token. */
19468 {
19469 /* Handle C++17 deduction guides. */
19473 {
19481 {
19485 }
19486 }
19488 /* Check to see if the token indicates the start of a
19489 function-definition. */
19491 {
19493 {
19494 /* If a function-definition should not appear here, issue an
19495 error message. */
19499 }
19501 location_t func_brace_location
19504 /* Neither attributes nor an asm-specification are allowed
19505 on a function-definition. */
19508 "an asm-specification is not allowed "
19512 "attributes are not allowed "
19514 /* This is a function-definition. */
19517 /* Parse the function definition. */
19520 decl_specifiers,
19521 declarator,
19522 prefix_attributes);
19523 else
19524 decl =
19525 (cp_parser_function_definition_from_specifiers_and_declarator
19529 {
19530 /* This is where the prologue starts... */
19533 }
19536 }
19537 }
19539 {
19540 /* A non-template declaration involving a function parameter list
19541 containing an implicit template parameter will be made into a
19542 template. If the resulting declaration is not going to be an
19543 actual function then finish the template scope here to prevent it.
19544 An error message will be issued once we have a decl to talk about.
19546 FIXME probably we should do type deduction rather than create an
19547 implicit template, but the standard currently doesn't allow it. */
19550 }
19552 /* [dcl.dcl]
19554 Only in function declarations for constructors, destructors, type
19555 conversions, and deduction guides can the decl-specifier-seq be omitted.
19557 We explicitly postpone this check past the point where we handle
19558 function-definitions because we tolerate function-definitions
19559 that are missing their return types in some modes. */
19561 {
19565 }
19567 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
19571 {
19582 {
19588 }
19589 }
19590 else
19591 {
19592 /* If the init-declarator isn't initialized and isn't followed by a
19593 `,' or `;', it's not a valid init-declarator. */
19596 {
19599 else
19600 {
19604 }
19605 }
19608 }
19610 /* Because start_decl has side-effects, we should only call it if we
19611 know we're going ahead. By this point, we know that we cannot
19612 possibly be looking at any other construct. */
19615 /* Enter the newly declared entry in the symbol table. If we're
19616 processing a declaration in a class-specifier, we wait until
19617 after processing the initializer. */
19619 {
19627 /* Adjust location of decl if declarator->id_loc is more appropriate:
19628 set, and decl wasn't merged with another decl, in which case its
19629 location would be different from input_location, and more accurate. */
19634 }
19636 /* Enter the SCOPE. That way unqualified names appearing in the
19637 initializer will be looked up in SCOPE. */
19640 /* Perform deferred access control checks, now that we know in which
19641 SCOPE the declared entity resides. */
19643 {
19646 /* If the entity being declared is a function, pretend that we
19647 are in its scope. If it is a `friend', it may have access to
19648 things that would not otherwise be accessible. */
19650 {
19653 }
19655 /* Perform access checks for template parameters. */
19658 /* Perform the access control checks for the declarator and the
19659 decl-specifiers. */
19662 /* Restore the saved value. */
19665 }
19667 /* Parse the initializer. */
19672 {
19674 {
19677 else
19678 {
19679 /* If the declaration was erroneous, we don't really
19680 know what the user intended, so just silently
19681 consume the initializer. */
19688 }
19689 }
19690 else
19691 {
19692 /* We want to record the extra mangling scope for in-class
19693 initializers of class members and initializers of static data
19694 member templates. The former involves deferring
19695 parsing of the initializer until end of class as with default
19696 arguments. So right here we only handle the latter. */
19706 }
19707 }
19709 /* The old parser allows attributes to appear after a parenthesized
19710 initializer. Mark Mitchell proposed removing this functionality
19711 on the GCC mailing lists on 2002-08-13. This parser accepts the
19712 attributes -- but ignores them. */
19719 /* And now complain about a non-function implicit template. */
19724 /* For an in-class declaration, use `grokfield' to create the
19725 declaration. */
19727 {
19729 {
19732 }
19741 }
19743 /* Finish processing the declaration. But, skip member
19744 declarations. */
19746 {
19749 asm_specification,
19750 /* If the initializer is in parentheses, then this is
19751 a direct-initialization, which means that an
19752 `explicit' constructor is OK. Otherwise, an
19753 `explicit' constructor cannot be used. */
19756 }
19759 /* Core issue #226 (C++0x only): A default template-argument
19760 shall not be specified in a friend class template
19761 declaration. */
19770 {
19773 else
19775 }
19782 }
19784 /* Parse a declarator.
19786 declarator:
19787 direct-declarator
19788 ptr-operator declarator
19790 abstract-declarator:
19791 ptr-operator abstract-declarator [opt]
19792 direct-abstract-declarator
19794 GNU Extensions:
19796 declarator:
19797 attributes [opt] direct-declarator
19798 attributes [opt] ptr-operator declarator
19800 abstract-declarator:
19801 attributes [opt] ptr-operator abstract-declarator [opt]
19802 attributes [opt] direct-abstract-declarator
19804 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
19805 detect constructors, destructors, deduction guides, or conversion operators.
19806 It is set to -1 if the declarator is a name, and +1 if it is a
19807 function. Otherwise it is set to zero. Usually you just want to
19808 test for >0, but internally the negative value is used.
19810 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
19811 a decl-specifier-seq unless it declares a constructor, destructor,
19812 or conversion. It might seem that we could check this condition in
19813 semantic analysis, rather than parsing, but that makes it difficult
19814 to handle something like `f()'. We want to notice that there are
19815 no decl-specifiers, and therefore realize that this is an
19816 expression, not a declaration.)
19818 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
19819 the declarator is a direct-declarator of the form "(...)".
19821 MEMBER_P is true iff this declarator is a member-declarator.
19823 FRIEND_P is true iff this declarator is a friend. */
19827 cp_parser_declarator_kind dcl_kind,
19831 {
19834 cp_cv_quals cv_quals;
19835 tree class_type;
19838 /* Assume this is not a constructor, destructor, or type-conversion
19839 operator. */
19846 /* Check for the ptr-operator production. */
19848 /* Parse the ptr-operator. */
19854 /* If that worked, then we have a ptr-operator. */
19856 {
19857 /* If a ptr-operator was found, then this declarator was not
19858 parenthesized. */
19861 /* The dependent declarator is optional if we are parsing an
19862 abstract-declarator. */
19866 /* Parse the dependent declarator. */
19871 friend_p);
19873 /* If we are parsing an abstract-declarator, we must handle the
19874 case where the dependent declarator is absent. */
19879 declarator = cp_parser_make_indirect_declarator
19881 }
19882 /* Everything else is a direct-declarator. */
19883 else
19884 {
19887 CPP_OPEN_PAREN);
19889 ctor_dtor_or_conv_p,
19891 }
19896 }
19898 /* Parse a direct-declarator or direct-abstract-declarator.
19900 direct-declarator:
19901 declarator-id
19902 direct-declarator ( parameter-declaration-clause )
19903 cv-qualifier-seq [opt]
19904 ref-qualifier [opt]
19905 exception-specification [opt]
19906 direct-declarator [ constant-expression [opt] ]
19907 ( declarator )
19909 direct-abstract-declarator:
19910 direct-abstract-declarator [opt]
19911 ( parameter-declaration-clause )
19912 cv-qualifier-seq [opt]
19913 ref-qualifier [opt]
19914 exception-specification [opt]
19915 direct-abstract-declarator [opt] [ constant-expression [opt] ]
19916 ( abstract-declarator )
19918 Returns a representation of the declarator. DCL_KIND is
19919 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
19920 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
19921 we are parsing a direct-declarator. It is
19922 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
19923 of ambiguity we prefer an abstract declarator, as per
19924 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
19925 as for cp_parser_declarator. */
19929 cp_parser_declarator_kind dcl_kind,
19932 {
19943 {
19944 /* Peek at the next token. */
19947 {
19948 /* This is either a parameter-declaration-clause, or a
19949 parenthesized declarator. When we know we are parsing a
19950 named declarator, it must be a parenthesized declarator
19951 if FIRST is true. For instance, `(int)' is a
19952 parameter-declaration-clause, with an omitted
19953 direct-abstract-declarator. But `((*))', is a
19954 parenthesized abstract declarator. Finally, when T is a
19955 template parameter `(T)' is a
19956 parameter-declaration-clause, and not a parenthesized
19957 named declarator.
19959 We first try and parse a parameter-declaration-clause,
19960 and then try a nested declarator (if FIRST is true).
19962 It is not an error for it not to be a
19963 parameter-declaration-clause, even when FIRST is
19964 false. Consider,
19966 int i (int);
19967 int i (3);
19969 The first is the declaration of a function while the
19970 second is the definition of a variable, including its
19971 initializer.
19973 Having seen only the parenthesis, we cannot know which of
19974 these two alternatives should be selected. Even more
19975 complex are examples like:
19977 int i (int (a));
19978 int i (int (3));
19980 The former is a function-declaration; the latter is a
19981 variable initialization.
19983 Thus again, we try a parameter-declaration-clause, and if
19984 that fails, we back out and return. */
19987 {
19988 tree params;
19993 /* In a member-declarator, the only valid interpretation
19994 of a parenthesis is the start of a
19995 parameter-declaration-clause. (It is invalid to
19996 initialize a static data member with a parenthesized
19997 initializer; only the "=" form of initialization is
19998 permitted.) */
20002 /* Consume the `('. */
20003 matching_parens parens;
20006 {
20007 /* If this is going to be an abstract declarator, we're
20008 in a declarator and we can't have default args. */
20011 }
20015 /* Parse the parameter-declaration-clause. */
20018 /* Consume the `)'. */
20021 /* If all went well, parse the cv-qualifier-seq,
20022 ref-qualifier and the exception-specification. */
20024 {
20025 cp_cv_quals cv_quals;
20026 cp_virt_specifiers virt_specifiers;
20027 cp_ref_qualifier ref_qual;
20028 tree exception_specification;
20029 tree late_return;
20030 tree attrs;
20040 /* Parse the cv-qualifier-seq. */
20042 /* Parse the ref-qualifier. */
20044 /* Parse the tx-qualifier. */
20046 /* And the exception-specification. */
20047 exception_specification
20052 /* In here, we handle cases where attribute is used after
20053 the function declaration. For example:
20054 void func (int x) __attribute__((vector(..))); */
20058 {
20062 CPP_SEMICOLON)
20064 CPP_OPEN_BRACE))
20067 ;
20068 else
20070 }
20072 late_return = (cp_parser_late_return_type_opt
20076 /* Parse the virt-specifier-seq. */
20079 /* Create the function-declarator. */
20081 params,
20082 cv_quals,
20083 virt_specifiers,
20084 ref_qual,
20085 tx_qual,
20086 exception_specification,
20087 late_return,
20088 requires_clause);
20091 /* Any subsequent parameter lists are to do with
20092 return type, so are not those of the declared
20093 function. */
20095 }
20097 /* Remove the function parms from scope. */
20101 /* Repeat the main loop. */
20103 }
20105 /* If this is the first, we can try a parenthesized
20106 declarator. */
20108 {
20115 /* Consume the `('. */
20116 matching_parens parens;
20118 /* Parse the nested declarator. */
20121 declarator
20127 /* Expect a `)'. */
20135 }
20136 /* Otherwise, we must be done. */
20137 else
20139 }
20143 {
20144 /* Parse an array-declarator. */
20154 /* Consume the `['. */
20156 /* Peek at the next token. */
20158 /* If the next token is `]', then there is no
20159 constant-expression. */
20161 {
20163 bounds
20173 {
20174 /* Normally, the array bound must be an integral constant
20175 expression. However, as an extension, we allow VLAs
20176 in function scopes as long as they aren't part of a
20177 parameter declaration. */
20181 }
20184 {
20185 /* Remember this wasn't a constant-expression. */
20188 }
20189 }
20190 else
20192 /* Look for the closing `]'. */
20194 {
20197 }
20202 }
20204 {
20205 {
20206 tree qualifying_scope;
20207 tree unqualified_name;
20208 tree attrs;
20209 special_function_kind sfk;
20214 /* Parse a declarator-id */
20217 {
20220 /* If we see an ellipsis, we should be looking at a
20221 parameter pack. */
20223 {
20224 /* Consume the `...' */
20228 }
20229 }
20232 unqualified_name
20236 {
20240 {
20241 /* Check whether an error occurred. */
20244 /* We already consumed the ellipsis to mark a
20245 parameter pack, but we have no way to report it,
20246 so abort the tentative parse. We will be exiting
20247 immediately anyway. */
20249 }
20250 else
20256 && (qualifying_scope
20258 {
20261 }
20262 }
20267 {
20272 }
20278 {
20279 /* In the declaration of a member of a template class
20280 outside of the class itself, the SCOPE will sometimes
20281 be a TYPENAME_TYPE. For example, given:
20283 template <typename T>
20284 int S<T>::R::i = 3;
20286 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
20287 this context, we must resolve S<T>::R to an ordinary
20288 type, rather than a typename type.
20290 The reason we normally avoid resolving TYPENAME_TYPEs
20291 is that a specialization of `S' might render
20292 `S<T>::R' not a type. However, if `S' is
20293 specialized, then this `i' will not be used, so there
20294 is no harm in resolving the types here. */
20295 tree type;
20297 /* Resolve the TYPENAME_TYPE. */
20300 /* If that failed, the declarator is invalid. */
20302 {
20305 "cannot define member of dependent typedef "
20307 else
20312 }
20314 }
20319 {
20320 tree class_type;
20325 else
20329 {
20333 {
20334 /* We do not attempt to print the declarator
20335 here because we do not have enough
20336 information about its original syntactic
20337 form. */
20341 }
20344 {
20348 "use %<%T::%D%> instead of %<%T::%D%> to "
20350 class_type,
20355 }
20357 }
20360 {
20367 for an unnamed type, even if the type
20368 got a name for linkage purposes. */
20370 /* Handle correctly (c++/19200):
20372 struct S {
20373 struct T{};
20374 friend void S(T);
20375 };
20377 and also:
20379 namespace N {
20380 void S();
20381 }
20383 struct S {
20384 friend void N::S();
20385 }; */
20388 class_type))
20397 }
20398 }
20400 unqualified_name,
20401 sfk);
20408 }
20410 handle_declarator:;
20413 {
20414 /* Any names that appear after the declarator-id for a
20415 member are looked up in the containing scope. */
20417 {
20418 /* But declarations with qualified-ids can't appear in a
20419 function. */
20423 }
20425 }
20429 /* Default args are only allowed on function
20430 declarations. */
20432 else
20436 }
20437 /* We're done. */
20438 else
20440 }
20442 /* For an abstract declarator, we might wind up with nothing at this
20443 point. That's an error; the declarator is not optional. */
20447 {
20448 /* Record overly parenthesized declarator so we can give a
20449 diagnostic about confusing decl/expr disambiguation. */
20451 {
20452 /* If the open and close parens are on different lines, this
20453 is probably a formatting thing, so ignore. */
20458 }
20461 }
20463 /* If we entered a scope, we must exit it now. */
20471 }
20473 /* Parse a ptr-operator.
20475 ptr-operator:
20476 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20477 * cv-qualifier-seq [opt]
20478 &
20479 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
20480 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
20482 GNU Extension:
20484 ptr-operator:
20485 & cv-qualifier-seq [opt]
20487 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
20488 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
20489 an rvalue reference. In the case of a pointer-to-member, *TYPE is
20490 filled in with the TYPE containing the member. *CV_QUALS is
20491 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
20492 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
20493 Note that the tree codes returned by this function have nothing
20494 to do with the types of trees that will be eventually be created
20495 to represent the pointer or reference type being parsed. They are
20496 just constants with suggestive names. */
20497 static enum tree_code
20502 {
20507 /* Assume that it's not a pointer-to-member. */
20509 /* And that there are no cv-qualifiers. */
20512 /* Peek at the next token. */
20515 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
20525 {
20526 /* Consume the `*', `&' or `&&'. */
20529 /* A `*' can be followed by a cv-qualifier-seq, and so can a
20530 `&', if we are allowing GNU extensions. (The only qualifier
20531 that can legally appear after `&' is `restrict', but that is
20532 enforced during semantic analysis. */
20540 }
20541 else
20542 {
20543 /* Try the pointer-to-member case. */
20545 /* Look for the optional `::' operator. */
20548 /* Look for the nested-name specifier. */
20555 /* If we found it, and the next token is a `*', then we are
20556 indeed looking at a pointer-to-member operator. */
20559 {
20560 /* Indicate that the `*' operator was used. */
20568 else
20569 {
20570 /* The type of which the member is a member is given by the
20571 current SCOPE. */
20573 /* The next name will not be qualified. */
20577 /* Look for optional c++11 attributes. */
20581 /* Look for the optional cv-qualifier-seq. */
20583 }
20584 }
20585 /* If that didn't work we don't have a ptr-operator. */
20588 }
20591 }
20593 /* Parse an (optional) cv-qualifier-seq.
20595 cv-qualifier-seq:
20596 cv-qualifier cv-qualifier-seq [opt]
20598 cv-qualifier:
20599 const
20600 volatile
20602 GNU Extension:
20604 cv-qualifier:
20605 __restrict__
20607 Returns a bitmask representing the cv-qualifiers. */
20609 static cp_cv_quals
20611 {
20615 {
20617 cp_cv_quals cv_qualifier;
20619 /* Peek at the next token. */
20621 /* See if it's a cv-qualifier. */
20623 {
20639 }
20645 {
20650 }
20651 else
20652 {
20655 }
20656 }
20659 }
20661 /* Parse an (optional) ref-qualifier
20663 ref-qualifier:
20664 &
20665 &&
20667 Returns cp_ref_qualifier representing ref-qualifier. */
20669 static cp_ref_qualifier
20671 {
20674 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
20679 {
20684 {
20696 }
20701 {
20704 }
20705 else
20706 {
20709 }
20710 }
20713 }
20715 /* Parse an optional tx-qualifier.
20717 tx-qualifier:
20718 transaction_safe
20719 transaction_safe_dynamic */
20721 static tree
20723 {
20726 {
20731 {
20735 {
20738 {
20741 }
20742 else
20744 }
20745 }
20746 }
20748 }
20750 /* Parse an (optional) virt-specifier-seq.
20752 virt-specifier-seq:
20753 virt-specifier virt-specifier-seq [opt]
20755 virt-specifier:
20756 override
20757 final
20759 Returns a bitmask representing the virt-specifiers. */
20761 static cp_virt_specifiers
20763 {
20767 {
20769 cp_virt_specifiers virt_specifier;
20771 /* Peek at the next token. */
20773 /* See if it's a virt-specifier-qualifier. */
20777 {
20780 }
20782 {
20785 }
20787 {
20789 }
20790 else
20794 {
20799 }
20800 else
20801 {
20804 }
20805 }
20807 }
20809 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
20810 is in scope even though it isn't real. */
20812 void
20814 {
20815 tree this_parm;
20818 {
20819 /* We don't clear this between NSDMIs. Is it already what we want? */
20826 }
20829 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
20831 current_class_ref
20834 }
20836 /* Return true iff our current scope is a non-static data member
20837 initializer. */
20839 bool
20841 {
20842 /* We recognize NSDMI context by the context-less 'this' pointer set up
20843 by the function above. */
20849 }
20851 /* Parse a late-specified return type, if any. This is not a separate
20852 non-terminal, but part of a function declarator, which looks like
20854 -> trailing-type-specifier-seq abstract-declarator(opt)
20856 Returns the type indicated by the type-id.
20858 In addition to this, parse any queued up #pragma omp declare simd
20859 clauses, Cilk Plus SIMD-enabled functions' vector attributes, and
20860 #pragma acc routine clauses.
20862 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
20863 function. */
20865 static tree
20868 {
20872 && declarator
20879 && declarator
20882 /* Peek at the next token. */
20884 /* A late-specified return type is indicated by an initial '->'. */
20895 {
20896 /* DR 1207: 'this' is in scope in the trailing return type. */
20898 }
20901 {
20902 /* Consume the ->. */
20906 }
20908 /* Function declarations may be followed by a trailing
20909 requires-clause. */
20913 declarator->attributes
20917 declarator->attributes
20921 declarator->attributes
20926 {
20929 }
20932 }
20934 /* Parse a declarator-id.
20936 declarator-id:
20937 id-expression
20938 :: [opt] nested-name-specifier [opt] type-name
20940 In the `id-expression' case, the value returned is as for
20941 cp_parser_id_expression if the id-expression was an unqualified-id.
20942 If the id-expression was a qualified-id, then a SCOPE_REF is
20943 returned. The first operand is the scope (either a NAMESPACE_DECL
20944 or TREE_TYPE), but the second is still just a representation of an
20945 unqualified-id. */
20947 static tree
20949 {
20950 tree id;
20951 /* The expression must be an id-expression. Assume that qualified
20952 names are the names of types so that:
20954 template <class T>
20955 int S<T>::R::i = 3;
20957 will work; we must treat `S<T>::R' as the name of a type.
20958 Similarly, assume that qualified names are templates, where
20959 required, so that:
20961 template <class T>
20962 int S<T>::R<T>::i = 3;
20964 will work, too. */
20970 optional_p);
20974 }
20976 /* Parse a type-id.
20978 type-id:
20979 type-specifier-seq abstract-declarator [opt]
20981 Returns the TYPE specified. */
20983 static tree
20986 {
20987 cp_decl_specifier_seq type_specifier_seq;
20990 /* Parse the type-specifier-seq. */
20992 is_trailing_return,
20997 /* A bare template name as a template argument is a template template
20998 argument, not a placeholder, so fail parsing it as a type argument. */
20999 {
21003 }
21007 /* There might or might not be an abstract declarator. */
21009 /* Look for the declarator. */
21010 abstract_declarator
21015 /* Check to see if there really was a declarator. */
21020 /* The concepts TS allows 'auto' as a type-id. */
21022 /* None of the valid uses of 'auto' in C++14 involve the type-id
21023 nonterminal, but it is valid in a trailing-return-type. */
21026 {
21027 /* A type-id with type 'auto' is only ok if the abstract declarator
21028 is a function declarator with a late-specified return type.
21030 A type-id with 'auto' is also valid in a trailing-return-type
21031 in a compound-requirement. */
21038 else
21039 {
21042 {
21044 auto_node);
21046 tmpl);
21047 }
21048 else
21051 }
21052 }
21055 is_template_arg);
21056 }
21058 static tree
21060 {
21062 }
21064 static tree
21066 {
21067 tree r;
21069 parser->type_definition_forbidden_message
21074 {
21077 }
21079 }
21081 static tree
21083 {
21085 }
21087 /* Parse a type-specifier-seq.
21089 type-specifier-seq:
21090 type-specifier type-specifier-seq [opt]
21092 GNU extension:
21094 type-specifier-seq:
21095 attributes type-specifier-seq [opt]
21097 If IS_DECLARATION is true, we are at the start of a "condition" or
21098 exception-declaration, so we might be followed by a declarator-id.
21100 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
21101 i.e. we've just seen "->".
21103 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
21105 static void
21110 {
21115 /* Clear the TYPE_SPECIFIER_SEQ. */
21118 /* In the context of a trailing return type, enum E { } is an
21119 elaborated-type-specifier followed by a function-body, not an
21120 enum-specifier. */
21124 /* Parse the type-specifiers and attributes. */
21126 {
21127 tree type_specifier;
21130 /* Check for attributes first. */
21132 {
21137 }
21139 /* record the token of the beginning of the type specifier seq,
21140 for error reporting purposes*/
21144 /* Look for the type-specifier. */
21146 flags,
21147 type_specifier_seq,
21149 NULL,
21152 {
21153 /* If the first type-specifier could not be found, this is not a
21154 type-specifier-seq at all. */
21156 {
21157 /* Set in_declarator_p to avoid skipping to the semicolon. */
21169 }
21170 /* If subsequent type-specifiers could not be found, the
21171 type-specifier-seq is complete. */
21173 }
21176 /* The standard says that a condition can be:
21178 type-specifier-seq declarator = assignment-expression
21180 However, given:
21182 struct S {};
21183 if (int S = ...)
21185 we should treat the "S" as a declarator, not as a
21186 type-specifier. The standard doesn't say that explicitly for
21187 type-specifier-seq, but it does say that for
21188 decl-specifier-seq in an ordinary declaration. Perhaps it
21189 would be clearer just to allow a decl-specifier-seq here, and
21190 then add a semantic restriction that if any decl-specifiers
21191 that are not type-specifiers appear, the program is invalid. */
21194 }
21195 }
21197 /* Return whether the function currently being declared has an associated
21198 template parameter list. */
21200 static bool
21202 {
21215 }
21217 /* Parse a parameter-declaration-clause.
21219 parameter-declaration-clause:
21220 parameter-declaration-list [opt] ... [opt]
21221 parameter-declaration-list , ...
21223 Returns a representation for the parameter declarations. A return
21224 value of NULL indicates a parameter-declaration-clause consisting
21225 only of an ellipsis. */
21227 static tree
21229 {
21230 tree parameters;
21239 parser->auto_is_implicit_function_template_parm_p
21241 }
21247 && !processing_template_parmlist
21253 /* Peek at the next token. */
21255 /* Check for trivial parameter-declaration-clauses. */
21257 {
21258 /* Consume the `...' token. */
21261 }
21263 /* There are no parameters. */
21264 {
21265 #ifndef NO_IMPLICIT_EXTERN_C
21270 else
21271 #endif
21273 }
21274 /* Check for `(void)', too, which is a special case. */
21278 {
21279 /* Consume the `void' token. */
21281 /* There are no parameters. */
21283 }
21285 /* Parse the parameter-declaration-list. */
21287 /* If a parse error occurred while parsing the
21288 parameter-declaration-list, then the entire
21289 parameter-declaration-clause is erroneous. */
21293 /* Peek at the next token. */
21295 /* If it's a `,', the clause should terminate with an ellipsis. */
21297 {
21298 /* Consume the `,'. */
21300 /* Expect an ellipsis. */
21301 ellipsis_p
21303 }
21304 /* It might also be `...' if the optional trailing `,' was
21305 omitted. */
21307 {
21308 /* Consume the `...' token. */
21310 /* And remember that we saw it. */
21312 }
21313 else
21316 /* Finish the parameter list. */
21321 }
21323 /* Parse a parameter-declaration-list.
21325 parameter-declaration-list:
21326 parameter-declaration
21327 parameter-declaration-list , parameter-declaration
21329 Returns a representation of the parameter-declaration-list, as for
21330 cp_parser_parameter_declaration_clause. However, the
21331 `void_list_node' is never appended to the list. Upon return,
21332 *IS_ERROR will be true iff an error occurred. */
21334 static tree
21336 {
21342 /* Assume all will go well. */
21344 /* The special considerations that apply to a function within an
21345 unbraced linkage specifications do not apply to the parameters
21346 to the function. */
21347 saved_in_unbraced_linkage_specification_p
21351 /* Look for more parameters. */
21353 {
21361 /* Parse the parameter. */
21362 parameter
21367 /* We don't know yet if the enclosing context is deprecated, so wait
21368 and warn in grokparms if appropriate. */
21372 {
21373 /* If a function parameter pack was specified and an implicit template
21374 parameter was introduced during cp_parser_parameter_declaration,
21375 change any implicit parameters introduced into packs. */
21379 {
21387 }
21391 PARM,
21396 }
21400 /* If a parse error occurred parsing the parameter declaration,
21401 then the entire parameter-declaration-list is erroneous. */
21403 {
21407 }
21417 {
21421 }
21423 /* Add the new parameter to the list. */
21427 /* Peek at the next token. */
21430 /* These are for Objective-C++ */
21433 /* The parameter-declaration-list is complete. */
21436 {
21439 /* Peek at the next token. */
21441 /* If it's an ellipsis, then the list is complete. */
21444 /* Otherwise, there must be more parameters. Consume the
21445 `,'. */
21447 /* When parsing something like:
21449 int i(float f, double d)
21451 we can tell after seeing the declaration for "f" that we
21452 are not looking at an initialization of a variable "i",
21453 but rather at the declaration of a function "i".
21455 Due to the fact that the parsing of template arguments
21456 (as specified to a template-id) requires backtracking we
21457 cannot use this technique when inside a template argument
21458 list. */
21462 /* However, a parameter-declaration of the form
21463 "float(f)" (which is a valid declaration of a
21464 parameter "f") can also be interpreted as an
21465 expression (the conversion of "f" to "float"). */
21468 }
21469 else
21470 {
21478 }
21479 }
21481 parser->in_unbraced_linkage_specification_p
21484 /* Reset implicit_template_scope if we are about to leave the function
21485 parameter list that introduced it. Note that for out-of-line member
21486 definitions, there will be one or more class scopes before we get to
21487 the template parameter scope. */
21491 {
21495 {
21498 }
21499 }
21502 }
21504 /* Parse a parameter declaration.
21506 parameter-declaration:
21507 decl-specifier-seq ... [opt] declarator
21508 decl-specifier-seq declarator = assignment-expression
21509 decl-specifier-seq ... [opt] abstract-declarator [opt]
21510 decl-specifier-seq abstract-declarator [opt] = assignment-expression
21512 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
21513 declares a template parameter. (In that case, a non-nested `>'
21514 token encountered during the parsing of the assignment-expression
21515 is not interpreted as a greater-than operator.)
21517 Returns a representation of the parameter, or NULL if an error
21518 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
21519 true iff the declarator is of the form "(p)". */
21525 {
21527 cp_decl_specifier_seq decl_specifiers;
21529 tree default_argument;
21534 /* In a template parameter, `>' is not an operator.
21536 [temp.param]
21538 When parsing a default template-argument for a non-type
21539 template-parameter, the first non-nested `>' is taken as the end
21540 of the template parameter-list rather than a greater-than
21541 operator. */
21543 /* Type definitions may not appear in parameter types. */
21545 parser->type_definition_forbidden_message
21548 /* Parse the declaration-specifiers. */
21551 CP_PARSER_FLAGS_NONE,
21555 /* Complain about missing 'typename' or other invalid type names. */
21560 /* If an error occurred, there's no reason to attempt to parse the
21561 rest of the declaration. */
21563 {
21566 }
21568 /* Peek at the next token. */
21571 /* If the next token is a `)', `,', `=', `>', or `...', then there
21572 is no declarator. However, when variadic templates are enabled,
21573 there may be a declarator following `...'. */
21578 {
21582 }
21583 /* Otherwise, there should be a declarator. */
21584 else
21585 {
21589 /* After seeing a decl-specifier-seq, if the next token is not a
21590 "(", there is no possibility that the code is a valid
21591 expression. Therefore, if parsing tentatively, we commit at
21592 this point. */
21594 /* In an expression context, having seen:
21596 (int((char ...
21598 we cannot be sure whether we are looking at a
21599 function-type (taking a "char" as a parameter) or a cast
21600 of some object of type "char" to "int". */
21606 /* Parse the declarator. */
21609 CP_PARSER_DECLARATOR_EITHER,
21611 parenthesized_p,
21615 /* After the declarator, allow more attributes. */
21616 decl_specifiers.attributes
21620 /* If the declarator is a template parameter pack, remember that and
21621 clear the flag in the declarator itself so we don't get errors
21622 from grokdeclarator. */
21624 {
21627 }
21628 }
21630 /* If the next token is an ellipsis, and we have not seen a declarator
21631 name, and if either the type of the declarator contains parameter
21632 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
21633 for, eg, abbreviated integral type names), then we actually have a
21634 parameter pack expansion expression. Otherwise, leave the ellipsis
21635 for a C-style variadic function. */
21638 {
21649 {
21650 /* Consume the `...'. */
21654 /* Build a pack expansion type */
21659 else
21661 }
21662 }
21664 /* The restriction on defining new types applies only to the type
21665 of the parameter, not to the default argument. */
21668 /* If the next token is `=', then process a default argument. */
21670 {
21673 /* If we are defining a class, then the tokens that make up the
21674 default argument must be saved and processed later. */
21680 // A constrained-type-specifier may declare a type template-parameter.
21682 default_argument
21685 // A constrained-type-specifier may declare a template-template-parameter.
21687 default_argument
21690 /* Outside of a class definition, we can just parse the
21691 assignment-expression. */
21692 else
21693 default_argument
21697 {
21699 "default arguments are only "
21701 }
21703 || template_parameter_pack_p
21706 {
21707 /* Find the name of the parameter pack. */
21714 template_parm_p
21720 else
21722 template_parm_p
21729 }
21730 }
21731 else
21734 /* Generate a location for the parameter, ranging from the start of the
21735 initial token to the end of the final token (using input_location for
21736 the latter, set up by cp_lexer_set_source_position_from_token when
21737 consuming tokens).
21739 If we have a identifier, then use it for the caret location, e.g.
21741 extern int callee (int one, int (*two)(int, int), float three);
21742 ~~~~~~^~~~~~~~~~~~~~
21744 otherwise, reuse the start location for the caret location e.g.:
21746 extern int callee (int one, int (*)(int, int), float three);
21747 ^~~~~~~~~~~~~~~~~
21749 */
21755 input_location);
21758 declarator,
21759 default_argument,
21760 param_loc,
21761 template_parameter_pack_p);
21762 }
21764 /* Parse a default argument and return it.
21766 TEMPLATE_PARM_P is true if this is a default argument for a
21767 non-type template parameter. */
21768 static tree
21770 {
21776 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
21777 set correctly. */
21780 /* Local variable names (and the `this' keyword) may not
21781 appear in a default argument. */
21784 /* Parse the assignment-expression. */
21789 /* The "this" pointer is not valid in a default argument. */
21791 {
21796 }
21797 default_argument
21799 /* Restore the "this" pointer. */
21801 {
21804 }
21813 }
21815 /* Parse a function-body.
21817 function-body:
21818 compound_statement */
21820 static void
21822 {
21826 }
21828 /* Parse a ctor-initializer-opt followed by a function-body. Return
21829 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
21830 is true we are parsing a function-try-block. */
21832 static void
21835 {
21842 /* Begin the function body. */
21844 /* Parse the optional ctor-initializer. */
21847 /* If we're parsing a constexpr constructor definition, we need
21848 to check that the constructor body is indeed empty. However,
21849 before we get to cp_parser_function_body lot of junk has been
21850 generated, so we can't just check that we have an empty block.
21851 Rather we take a snapshot of the outermost block, and check whether
21852 cp_parser_function_body changed its state. */
21854 {
21858 }
21859 /* Parse the function-body. */
21863 /* Finish the function body. */
21865 }
21867 /* Parse an initializer.
21869 initializer:
21870 = initializer-clause
21871 ( expression-list )
21873 Returns an expression representing the initializer. If no
21874 initializer is present, NULL_TREE is returned.
21876 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
21877 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
21878 set to TRUE if there is no initializer present. If there is an
21879 initializer, and it is not a constant-expression, *NON_CONSTANT_P
21880 is set to true; otherwise it is set to false. */
21882 static tree
21885 {
21887 tree init;
21889 /* Peek at the next token. */
21892 /* Let our caller know whether or not this initializer was
21893 parenthesized. */
21895 /* Assume that the initializer is constant. */
21899 {
21900 /* Consume the `='. */
21902 /* Parse the initializer-clause. */
21904 }
21906 {
21911 non_constant_p);
21916 }
21918 {
21923 }
21924 else
21925 {
21926 /* Anything else is an error. */
21929 }
21935 }
21937 /* Parse an initializer-clause.
21939 initializer-clause:
21940 assignment-expression
21941 braced-init-list
21943 Returns an expression representing the initializer.
21945 If the `assignment-expression' production is used the value
21946 returned is simply a representation for the expression.
21948 Otherwise, calls cp_parser_braced_list. */
21950 static cp_expr
21952 {
21953 cp_expr initializer;
21955 /* Assume the expression is constant. */
21958 /* If it is not a `{', then we are looking at an
21959 assignment-expression. */
21961 {
21962 initializer
21965 non_constant_p);
21966 }
21967 else
21971 }
21973 /* Parse a brace-enclosed initializer list.
21975 braced-init-list:
21976 { initializer-list , [opt] }
21977 { }
21979 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
21980 the elements of the initializer-list (or NULL, if the last
21981 production is used). The TREE_TYPE for the CONSTRUCTOR will be
21982 NULL_TREE. There is no way to detect whether or not the optional
21983 trailing `,' was provided. NON_CONSTANT_P is as for
21984 cp_parser_initializer. */
21986 static cp_expr
21988 {
21989 tree initializer;
21992 /* Consume the `{' token. */
21993 matching_braces braces;
21995 /* Create a CONSTRUCTOR to represent the braced-initializer. */
21997 /* If it's not a `}', then there is a non-trivial initializer. */
21999 {
22000 /* Parse the initializer list. */
22003 /* A trailing `,' token is allowed. */
22006 }
22007 else
22009 /* Now, there should be a trailing `}'. */
22015 /* Build a location of the form:
22016 { ... }
22017 ^~~~~~~
22018 with caret==start at the open brace, finish at the close brace. */
22022 }
22024 /* Consume tokens up to, and including, the next non-nested closing `]'.
22025 Returns true iff we found a closing `]'. */
22027 static bool
22029 {
22033 {
22037 {
22040 /* If we've run out of tokens, then there is no closing `]'. */
22049 {
22052 }
22057 }
22059 /* Consume the token. */
22061 }
22062 }
22064 /* Return true if we are looking at an array-designator, false otherwise. */
22066 static bool
22068 {
22069 /* Consume the `['. */
22074 /* Skip tokens until the next token is a closing square bracket.
22075 If we find the closing `]', and the next token is a `=', then
22076 we are looking at an array designator. */
22077 bool array_designator_p
22081 /* Roll back the tokens we skipped. */
22085 }
22087 /* Parse an initializer-list.
22089 initializer-list:
22090 initializer-clause ... [opt]
22091 initializer-list , initializer-clause ... [opt]
22093 GNU Extension:
22095 initializer-list:
22096 designation initializer-clause ...[opt]
22097 initializer-list , designation initializer-clause ...[opt]
22099 designation:
22100 . identifier =
22101 identifier :
22102 [ constant-expression ] =
22104 Returns a vec of constructor_elt. The VALUE of each elt is an expression
22105 for the initializer. If the INDEX of the elt is non-NULL, it is the
22106 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
22107 as for cp_parser_initializer. */
22111 {
22114 /* Assume all of the expressions are constant. */
22117 /* Parse the rest of the list. */
22119 {
22121 tree designator;
22122 tree initializer;
22125 /* If the next token is an identifier and the following one is a
22126 colon, we are looking at the GNU designated-initializer
22127 syntax. */
22131 {
22132 /* Warn the user that they are using an extension. */
22135 /* Consume the identifier. */
22137 /* Consume the `:'. */
22139 }
22140 /* Also handle the C99 syntax, '. id ='. */
22145 {
22146 /* Warn the user that they are using an extension. */
22149 /* Consume the `.'. */
22151 /* Consume the identifier. */
22153 /* Consume the `='. */
22155 }
22156 /* Also handle C99 array designators, '[ const ] ='. */
22160 {
22161 /* In C++11, [ could start a lambda-introducer. */
22167 {
22170 }
22171 else
22172 {
22177 }
22183 }
22184 else
22187 /* Parse the initializer. */
22190 /* If any clause is non-constant, so is the entire initializer. */
22194 /* If we have an ellipsis, this is an initializer pack
22195 expansion. */
22197 {
22198 /* Consume the `...'. */
22201 /* Turn the initializer into an initializer expansion. */
22203 }
22205 /* Add it to the vector. */
22208 /* If the next token is not a comma, we have reached the end of
22209 the list. */
22213 /* Peek at the next token. */
22215 /* If the next token is a `}', then we're still done. An
22216 initializer-clause can have a trailing `,' after the
22217 initializer-list and before the closing `}'. */
22221 /* Consume the `,' token. */
22223 }
22226 }
22228 /* Classes [gram.class] */
22230 /* Parse a class-name.
22232 class-name:
22233 identifier
22234 template-id
22236 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
22237 to indicate that names looked up in dependent types should be
22238 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
22239 keyword has been used to indicate that the name that appears next
22240 is a template. TAG_TYPE indicates the explicit tag given before
22241 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
22242 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
22243 is the class being defined in a class-head. If ENUM_OK is TRUE,
22244 enum-names are also accepted.
22246 Returns the TYPE_DECL representing the class. */
22248 static tree
22257 {
22258 tree decl;
22259 tree scope;
22264 /* All class-names start with an identifier. */
22267 {
22270 }
22272 /* PARSER->SCOPE can be cleared when parsing the template-arguments
22273 to a template-id, so we save it here. */
22278 /* Any name names a type if we're following the `typename' keyword
22279 in a qualified name where the enclosing scope is type-dependent. */
22282 /* Handle the common case (an identifier, but not a template-id)
22283 efficiently. */
22286 {
22290 /* Look for the identifier. */
22294 /* If the next token isn't an identifier, we are certainly not
22295 looking at a class-name. */
22298 /* If we know this is a type-name, there's no need to look it
22299 up. */
22302 else
22303 {
22304 tree ambiguous_decls;
22305 /* If we already know that this lookup is ambiguous, then
22306 we've already issued an error message; there's no reason
22307 to check again. */
22309 {
22312 }
22313 /* If the next token is a `::', then the name must be a type
22314 name.
22316 [basic.lookup.qual]
22318 During the lookup for a name preceding the :: scope
22319 resolution operator, object, function, and enumerator
22320 names are ignored. */
22323 /* Look up the name. */
22325 tag_type,
22328 check_dependency_p,
22332 {
22336 }
22337 }
22338 }
22339 else
22340 {
22341 /* Try a template-id. */
22343 check_dependency_p,
22344 tag_type,
22345 is_declaration);
22348 }
22352 /* If this is a typename, create a TYPENAME_TYPE. */
22354 {
22359 }
22363 /* Check to see that it is really the name of a class. */
22367 /* Situations like this:
22369 template <typename T> struct A {
22370 typename T::template X<int>::I i;
22371 };
22373 are problematic. Is `T::template X<int>' a class-name? The
22374 standard does not seem to be definitive, but there is no other
22375 valid interpretation of the following `::'. Therefore, those
22376 names are considered class-names. */
22377 {
22381 }
22386 /* In Objective-C 2.0, a classname followed by '.' starts a
22387 dot-syntax expression, and it's not a type-name. */
22399 }
22401 /* Parse a class-specifier.
22403 class-specifier:
22404 class-head { member-specification [opt] }
22406 Returns the TREE_TYPE representing the class. */
22408 static tree
22410 {
22411 tree type;
22425 /* Parse the class-head. */
22428 /* If the class-head was a semantic disaster, skip the entire body
22429 of the class. */
22431 {
22435 }
22437 /* Look for the `{'. */
22438 matching_braces braces;
22440 {
22443 }
22448 /* Issue an error message if type-definitions are forbidden here. */
22450 /* Remember that we are defining one more class. */
22452 /* Inside the class, surrounding template-parameter-lists do not
22453 apply. */
22454 saved_num_template_parameter_lists
22457 /* We are not in a function body. */
22460 /* Or in a loop. */
22463 /* Or in a switch. */
22466 /* We are not immediately inside an extern "lang" block. */
22467 saved_in_unbraced_linkage_specification_p
22471 // Associate constraints with the type.
22475 /* Start the class. */
22477 {
22480 }
22484 /* If the type is erroneous, skip the entire body of the class. */
22486 else
22487 /* Parse the member-specification. */
22490 /* Look for the trailing `}'. */
22492 /* Look for trailing attributes to apply to this class. */
22500 /* We've finished a type definition. Check for the common syntax
22501 error of forgetting a semicolon after the definition. We need to
22502 be careful, as we can't just check for not-a-semicolon and be done
22503 with it; the user might have typed:
22505 class X { } c = ...;
22506 class X { } *p = ...;
22508 and so forth. Instead, enumerate all the possible tokens that
22509 might follow this production; if we don't see one of them, then
22510 complain and silently insert the semicolon. */
22511 {
22516 /* Don't try to parse c++11 attributes here. As per the
22517 grammar, that should be a task for
22518 cp_parser_decl_specifier_seq. */
22522 {
22533 /* While it's legal for type qualifiers and storage class
22534 specifiers to follow type definitions in the grammar, only
22535 compiler testsuites contain code like that. Assume that if
22536 we see such code, then what we're really seeing is a case
22537 like:
22539 class X { }
22540 const <type> var = ...;
22542 or
22544 class Y { }
22545 static <type> func (...) ...
22547 i.e. the qualifier or specifier applies to the next
22548 declaration. To do so, however, we need to look ahead one
22549 more token to see if *that* token is a type specifier.
22551 This code could be improved to handle:
22553 class Z { }
22554 static const <type> var = ...; */
22557 {
22560 /* Handling user-defined types here would be nice, but very
22561 tricky. */
22562 want_semicolon
22565 }
22569 }
22571 /* If we don't have a type, then something is very wrong and we
22572 shouldn't try to do anything clever. Likewise for not seeing the
22573 closing brace. */
22575 {
22576 /* Locate the closing brace. */
22577 cp_token_position prev
22582 /* We want to suggest insertion of a ';' immediately *after* the
22583 closing brace, so, if we can, offset the location by 1 column. */
22590 /* If we successfully offset the location, suggest the fix-it. */
22603 else
22606 /* Unget one token and smash it to look as though we encountered
22607 a semicolon in the input stream. */
22612 }
22613 }
22615 /* If this class is not itself within the scope of another class,
22616 then we need to parse the bodies of all of the queued function
22617 definitions. Note that the queued functions defined in a class
22618 are not always processed immediately following the
22619 class-specifier for that class. Consider:
22621 struct A {
22622 struct B { void f() { sizeof (A); } };
22623 };
22625 If `f' were processed before the processing of `A' were
22626 completed, there would be no way to compute the size of `A'.
22627 Note that the nesting we are interested in here is lexical --
22628 not the semantic nesting given by TYPE_CONTEXT. In particular,
22629 for:
22631 struct A { struct B; };
22632 struct A::B { void f() { } };
22634 there is no need to delay the parsing of `A::B::f'. */
22636 {
22637 tree decl;
22644 /* In a first pass, parse default arguments to the functions.
22645 Then, in a second pass, parse the bodies of the functions.
22646 This two-phased approach handles cases like:
22648 struct S {
22649 void f() { g(); }
22650 void g(int i = 3);
22651 };
22653 */
22655 {
22657 /* If there are default arguments that have not yet been processed,
22658 take care of them now. */
22660 {
22665 }
22666 /* Make sure that any template parameters are in scope. */
22668 /* Parse the default argument expressions. */
22670 /* Remove any template parameters from the symbol table. */
22672 }
22674 /* Now parse any NSDMIs. */
22678 {
22680 {
22685 }
22688 }
22695 /* Now do some post-NSDMI bookkeeping. */
22701 /* Now parse the body of the functions. */
22703 {
22704 /* OpenMP UDRs need to be parsed before all other functions. */
22711 }
22712 else
22716 }
22717 else
22720 /* Put back any saved access checks. */
22723 /* Restore saved state. */
22727 parser->num_template_parameter_lists
22729 parser->in_unbraced_linkage_specification_p
22733 }
22735 static tree
22737 {
22738 tree ret;
22743 }
22745 /* Parse a class-head.
22747 class-head:
22748 class-key identifier [opt] base-clause [opt]
22749 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
22750 class-key nested-name-specifier [opt] template-id
22751 base-clause [opt]
22753 class-virt-specifier:
22754 final
22756 GNU Extensions:
22757 class-key attributes identifier [opt] base-clause [opt]
22758 class-key attributes nested-name-specifier identifier base-clause [opt]
22759 class-key attributes nested-name-specifier [opt] template-id
22760 base-clause [opt]
22762 Upon return BASES is initialized to the list of base classes (or
22763 NULL, if there are none) in the same form returned by
22764 cp_parser_base_clause.
22766 Returns the TYPE of the indicated class. Sets
22767 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
22768 involving a nested-name-specifier was used, and FALSE otherwise.
22770 Returns error_mark_node if this is not a class-head.
22772 Returns NULL_TREE if the class-head is syntactically valid, but
22773 semantically invalid in a way that means we should skip the entire
22774 body of the class. */
22776 static tree
22779 {
22780 tree nested_name_specifier;
22784 tree attributes;
22785 tree bases;
22795 /* Assume no nested-name-specifier will be present. */
22797 /* Assume no template parameter lists will be used in defining the
22798 type. */
22802 /* Look for the class-key. */
22809 /* Parse the attributes. */
22812 /* If the next token is `::', that is invalid -- but sometimes
22813 people do try to write:
22815 struct ::S {};
22817 Handle this gracefully by accepting the extra qualifier, and then
22818 issuing an error about it later if this really is a
22819 class-head. If it turns out just to be an elaborated type
22820 specifier, remain silent. */
22826 /* Determine the name of the class. Begin by looking for an
22827 optional nested-name-specifier. */
22829 nested_name_specifier
22835 /* If there was a nested-name-specifier, then there *must* be an
22836 identifier. */
22841 {
22843 /* Although the grammar says `identifier', it really means
22844 `class-name' or `template-name'. You are only allowed to
22845 define a class that has already been declared with this
22846 syntax.
22848 The proposed resolution for Core Issue 180 says that wherever
22849 you see `class T::X' you should treat `X' as a type-name.
22851 It is OK to define an inaccessible class; for example:
22853 class A { class B; };
22854 class A::B {};
22856 We do not know if we will see a class-name, or a
22857 template-name. We look for a class-name first, in case the
22858 class-name is a template-id; if we looked for the
22859 template-name first we would stop after the template-name. */
22866 class_type,
22870 /* If that didn't work, ignore the nested-name-specifier. */
22872 {
22878 }
22879 /* If we could not find a corresponding TYPE, treat this
22880 declaration like an unqualified declaration. */
22883 /* Otherwise, count the number of templates used in TYPE and its
22884 containing scopes. */
22885 else
22886 {
22887 tree scope;
22899 }
22900 }
22901 /* Otherwise, the identifier is optional. */
22902 else
22903 {
22904 /* We don't know whether what comes next is a template-id,
22905 an identifier, or nothing at all. */
22907 /* Check for a template-id. */
22912 class_key,
22914 /* If that didn't work, it could still be an identifier. */
22916 {
22918 {
22921 }
22922 else
22924 }
22925 else
22926 {
22929 }
22930 }
22935 {
22937 class_key,
22939 }
22942 /* If it's not a `:' or a `{' then we can't really be looking at a
22943 class-head, since a class-head only appears as part of a
22944 class-specifier. We have to detect this situation before calling
22945 xref_tag, since that has irreversible side-effects. */
22947 {
22951 }
22953 /* At this point, we're going ahead with the class-specifier, even
22954 if some other problem occurs. */
22957 {
22962 }
22963 /* Issue the error about the overly-qualified name now. */
22965 {
22970 }
22972 {
22977 }
22979 {
22980 tree scope;
22983 /* [temp.names]: in a qualified-id formed by a class-head-name, the
22984 keyword template shall not appear at the top level. */
22988 /* Reject typedef-names in class heads. */
22990 {
22993 type);
22996 }
22998 /* Figure out in what scope the declaration is being placed. */
23000 /* If that scope does not contain the scope in which the
23001 class was originally declared, the program is invalid. */
23003 {
23006 "declaration of %qD in namespace %qD which does not "
23009 else
23015 }
23016 /* [dcl.meaning]
23018 A declarator-id shall not be qualified except for the
23019 definition of a ... nested class outside of its class
23020 ... [or] the definition or explicit instantiation of a
23021 class member of a namespace outside of its namespace. */
23023 {
23028 }
23029 }
23030 /* An explicit-specialization must be preceded by "template <>". If
23031 it is not, try to recover gracefully. */
23034 && !processing_template_parmlist
23036 {
23037 /* Build a location of this form:
23038 struct typename <ARGS>
23039 ^~~~~~~~~~~~~~~~~~~~~~
23040 with caret==start at the start token, and
23041 finishing at the end of the type. */
23042 location_t reported_loc
23044 class_head_start_location,
23049 error_at_rich_loc
23053 /* Take the same action that would have been taken by
23054 cp_parser_explicit_specialization. */
23057 }
23058 /* There must be no "return" statements between this point and the
23059 end of this function; set "type "to the correct return value and
23060 use "goto done;" to return. */
23061 /* Make sure that the right number of template parameters were
23062 present. */
23066 {
23067 /* If something went wrong, there is no point in even trying to
23068 process the class-definition. */
23071 }
23073 /* Look up the type. */
23075 {
23079 {
23083 }
23084 else
23085 {
23089 /* Check the scope while we still know whether or not we had a
23090 nested-name-specifier. */
23093 }
23096 }
23098 {
23099 tree class_type;
23101 /* Given:
23103 template <typename T> struct S { struct T };
23104 template <typename T> struct S<T>::T { };
23106 we will get a TYPENAME_TYPE when processing the definition of
23107 `S::T'. We need to resolve it to the actual type before we
23108 try to define it. */
23110 {
23115 else
23116 {
23119 }
23120 }
23124 {
23127 }
23130 /* Enter the scope indicated by the nested-name-specifier. */
23132 /* Get the canonical version of this type. */
23134 /* Call push_template_decl if it seems like we should be defining a
23135 template either from the template headers or the type we're
23136 defining, so that we diagnose both extra and missing headers. */
23140 {
23143 {
23146 }
23147 }
23151 }
23153 {
23154 /* If the class was unnamed, create a dummy name. */
23158 ? ts_within_enclosing_non_class
23162 }
23164 /* Indicate whether this class was declared as a `class' or as a
23165 `struct'. */
23170 /* If this type was already complete, and we see another definition,
23171 that's an error. */
23173 {
23175 type);
23177 type);
23180 }
23185 {
23186 /* Apply attributes now, before any use of the class as a template
23187 argument in its base list. */
23190 }
23192 /* We will have entered the scope containing the class; the names of
23193 base classes should be looked up in that context. For example:
23195 struct A { struct B {}; struct C; };
23196 struct A::C : B {};
23198 is valid. */
23200 /* Get the list of base-classes, if there is one. */
23202 {
23203 /* PR59482: enter the class scope so that base-specifiers are looked
23204 up correctly. */
23208 /* PR59482: get out of the previously pushed class scope so that the
23209 subsequent pops pop the right thing. */
23212 }
23213 else
23216 /* If we're really defining a class, process the base classes.
23217 If they're invalid, fail. */
23221 done:
23222 /* Leave the scope given by the nested-name-specifier. We will
23223 enter the class scope itself while processing the members. */
23228 {
23231 }
23237 out:
23240 }
23242 /* Parse a class-key.
23244 class-key:
23245 class
23246 struct
23247 union
23249 Returns the kind of class-key specified, or none_type to indicate
23250 error. */
23252 static enum tag_types
23254 {
23258 /* Look for the class-key. */
23263 /* Check to see if the TOKEN is a class-key. */
23268 }
23270 /* Parse a type-parameter-key.
23272 type-parameter-key:
23273 class
23274 typename
23275 */
23277 static void
23279 {
23280 /* Look for the type-parameter-key. */
23284 {
23287 /* typename is not allowed in a template template parameter
23288 by the standard until C++17. */
23290 "ISO C++ forbids typename key in template template parameter;"
23292 }
23293 else
23297 }
23299 /* Parse an (optional) member-specification.
23301 member-specification:
23302 member-declaration member-specification [opt]
23303 access-specifier : member-specification [opt] */
23305 static void
23307 {
23309 {
23313 /* Peek at the next token. */
23315 /* If it's a `}', or EOF then we've seen all the members. */
23321 /* See if this token is a keyword. */
23324 {
23328 /* Consume the access-specifier. */
23330 /* Remember which access-specifier is active. */
23332 /* Look for the `:'. */
23337 /* Accept #pragmas at class scope. */
23339 {
23342 }
23344 /* Otherwise, the next construction must be a
23345 member-declaration. */
23347 }
23348 }
23349 }
23351 /* Parse a member-declaration.
23353 member-declaration:
23354 decl-specifier-seq [opt] member-declarator-list [opt] ;
23355 function-definition ; [opt]
23356 :: [opt] nested-name-specifier template [opt] unqualified-id ;
23357 using-declaration
23358 template-declaration
23359 alias-declaration
23361 member-declarator-list:
23362 member-declarator
23363 member-declarator-list , member-declarator
23365 member-declarator:
23366 declarator pure-specifier [opt]
23367 declarator constant-initializer [opt]
23368 identifier [opt] : constant-expression
23370 GNU Extensions:
23372 member-declaration:
23373 __extension__ member-declaration
23375 member-declarator:
23376 declarator attributes [opt] pure-specifier [opt]
23377 declarator attributes [opt] constant-initializer [opt]
23378 identifier [opt] attributes [opt] : constant-expression
23380 C++0x Extensions:
23382 member-declaration:
23383 static_assert-declaration */
23385 static void
23387 {
23388 cp_decl_specifier_seq decl_specifiers;
23389 tree prefix_attributes;
23390 tree decl;
23399 /* Check for the `__extension__' keyword. */
23401 {
23402 /* Recurse. */
23404 /* Restore the old value of the PEDANTIC flag. */
23408 }
23410 /* Check for a template-declaration. */
23412 {
23413 /* An explicit specialization here is an error condition, and we
23414 expect the specialization handler to detect and report this. */
23418 else
23422 }
23423 /* Check for a template introduction. */
23427 /* Check for a using-declaration. */
23429 {
23431 {
23432 /* Parse the using-declaration. */
23436 }
23437 else
23438 {
23439 tree decl;
23443 /* Note that if we actually see the '=' token after the
23444 identifier, cp_parser_alias_declaration commits the
23445 tentative parse. In that case, we really expect an
23446 alias-declaration. Otherwise, we expect a using
23447 declaration. */
23448 alias_decl_expected =
23454 else
23458 }
23459 }
23461 /* Check for @defs. */
23463 {
23468 {
23473 }
23475 }
23477 /* If the next token is `static_assert' we have a static assertion. */
23479 {
23482 }
23489 /* Parse the decl-specifier-seq. */
23492 CP_PARSER_FLAGS_OPTIONAL,
23495 /* Check for an invalid type-name. */
23499 /* If there is no declarator, then the decl-specifier-seq should
23500 specify a type. */
23502 {
23503 /* If there was no decl-specifier-seq, and the next token is a
23504 `;', then we have something like:
23506 struct S { ; };
23508 [class.mem]
23510 Each member-declaration shall declare at least one member
23511 name of the class. */
23513 {
23516 {
23520 }
23521 }
23522 else
23523 {
23524 tree type;
23526 /* See if this declaration is a friend. */
23528 /* If there were decl-specifiers, check to see if there was
23529 a class-declaration. */
23532 /* Nested classes have already been added to the class, but
23533 a `friend' needs to be explicitly registered. */
23535 {
23536 /* If the `friend' keyword was present, the friend must
23537 be introduced with a class-key. */
23540 "in C++03 a class-key must be used "
23542 /* In this case:
23544 template <typename T> struct A {
23545 friend struct A<T>::B;
23546 };
23548 A<T>::B will be represented by a TYPENAME_TYPE, and
23549 therefore not recognized by check_tag_decl. */
23551 {
23555 }
23558 "friend declaration does not name a class or "
23560 else
23563 }
23564 /* If there is no TYPE, an error message will already have
23565 been issued. */
23567 ;
23568 /* An anonymous aggregate has to be handled specially; such
23569 a declaration really declares a data member (with a
23570 particular type), as opposed to a nested class. */
23572 {
23573 /* C++11 9.5/6. */
23576 "a storage class on an anonymous aggregate "
23579 /* Remove constructors and such from TYPE, now that we
23580 know it is an anonymous aggregate. */
23582 /* And make the corresponding data member. */
23585 /* Add it to the class. */
23587 }
23588 else
23589 cp_parser_check_access_in_redeclaration
23592 }
23593 }
23594 else
23595 {
23598 /* Clear attributes from the decl_specifiers but keep them
23599 around as prefix attributes that apply them to the entity
23600 being declared. */
23604 /* See if these declarations will be friends. */
23607 /* Keep going until we hit the `;' at the end of the
23608 declaration. */
23610 {
23612 tree first_attribute;
23613 tree initializer;
23617 /* Peek at the next token. */
23620 /* The following code wants to know early if it is a bit-field
23621 or some other declaration. Attributes can appear before
23622 the `:' token, but are hopefully rare enough that the
23623 simplicity of the tentative lookup pays off. */
23628 {
23636 }
23638 /* Check for a bitfield declaration. */
23644 {
23645 tree identifier;
23646 tree width;
23651 else
23654 /* Look for attributes that apply to the bitfield. */
23657 /* Consume the `:' token. */
23660 /* Get the width of the bitfield. */
23664 /* In C++2A and as extension for C++11 and above we allow
23665 default member initializers for bit-fields. */
23670 CPP_OPEN_BRACE)))
23671 {
23672 location_t loc
23678 "default member initializers for bit-fields "
23679 "only available with -std=c++2a or "
23684 {
23688 }
23689 }
23690 else
23691 {
23692 /* Look for attributes that apply to the bitfield after
23693 the `:' token and width. This is where GCC used to
23694 parse attributes in the past, pedwarn if there is
23695 a std attribute. */
23698 "ISO C++ allows bit-field attributes only "
23702 }
23706 /* Remember which attributes are prefix attributes and
23707 which are not. */
23709 /* Combine the attributes. */
23712 /* Create the bitfield declaration. */
23715 identifier,
23716 sfk_none)
23720 attributes);
23721 }
23722 else
23723 {
23725 tree asm_specification;
23728 /* Parse the declarator. */
23729 declarator
23734 friend_p);
23736 /* If something went wrong parsing the declarator, make sure
23737 that we at least consume some tokens. */
23739 {
23740 /* Skip to the end of the statement. */
23742 /* If the next token is not a semicolon, that is
23743 probably because we just skipped over the body of
23744 a function. So, we consume a semicolon if
23745 present, but do not issue an error message if it
23746 is not present. */
23748 CPP_SEMICOLON))
23751 }
23754 cp_parser_check_for_definition_in_return_type
23758 /* Look for an asm-specification. */
23760 /* Look for attributes that apply to the declaration. */
23762 /* Remember which attributes are prefix attributes and
23763 which are not. */
23765 /* Combine the attributes. */
23768 /* If it's an `=', then we have a constant-initializer or a
23769 pure-specifier. It is not correct to parse the
23770 initializer before registering the member declaration
23771 since the member declaration should be in scope while
23772 its initializer is processed. However, the rest of the
23773 front end does not yet provide an interface that allows
23774 us to handle this correctly. */
23776 {
23777 /* In [class.mem]:
23779 A pure-specifier shall be used only in the declaration of
23780 a virtual function.
23782 A member-declarator can contain a constant-initializer
23783 only if it declares a static member of integral or
23784 enumeration type.
23786 Therefore, if the DECLARATOR is for a function, we look
23787 for a pure-specifier; otherwise, we look for a
23788 constant-initializer. When we call `grokfield', it will
23789 perform more stringent semantics checks. */
23801 {
23803 /* Don't require a constant rvalue in C++11, since we
23804 might want a reference constant. We'll enforce
23805 constancy later. */
23807 /* Parse the initializer. */
23810 }
23811 else
23812 /* Parse the initializer. */
23814 }
23817 {
23821 else
23823 }
23824 /* Otherwise, there is no initializer. */
23825 else
23828 /* See if we are probably looking at a function
23829 definition. We are certainly not looking at a
23830 member-declarator. Calling `grokfield' has
23831 side-effects, so we must not do it unless we are sure
23832 that we are looking at a member-declarator. */
23835 {
23836 /* The grammar does not allow a pure-specifier to be
23837 used when a member function is defined. (It is
23838 possible that this fact is an oversight in the
23839 standard, since a pure function may be defined
23840 outside of the class-specifier. */
23846 declarator,
23847 attributes);
23850 /* If the member was not a friend, declare it here. */
23853 /* Peek at the next token. */
23855 /* If the next token is a semicolon, consume it. */
23857 {
23858 location_t semicolon_loc
23863 "extra %<;%> after in-class "
23865 }
23867 }
23868 else
23871 /* Create the declaration. */
23876 {
23879 else
23881 }
23882 }
23887 /* Reset PREFIX_ATTRIBUTES. */
23893 /* If there is any qualification still in effect, clear it
23894 now; we will be starting fresh with the next declarator. */
23898 /* If it's a `,', then there are more declarators. */
23900 {
23903 {
23909 }
23910 }
23911 /* If the next token isn't a `;', then we have a parse error. */
23913 CPP_SEMICOLON))
23914 {
23915 /* The next token might be a ways away from where the
23916 actual semicolon is missing. Find the previous token
23917 and use that for our error position. */
23924 /* Assume that the user meant to provide a semicolon. If
23925 we were to cp_parser_skip_to_end_of_statement, we might
23926 skip to a semicolon inside a member function definition
23927 and issue nonsensical error messages. */
23929 }
23932 {
23933 /* Add DECL to the list of members. */
23935 /* Explicitly include, eg, NSDMIs, for better error
23936 recovery (c++/58650). */
23944 /* Add DECL to the queue of NSDMI to be parsed later. */
23946 }
23950 }
23951 }
23954 out:
23956 }
23958 /* Parse a pure-specifier.
23960 pure-specifier:
23961 = 0
23963 Returns INTEGER_ZERO_NODE if a pure specifier is found.
23964 Otherwise, ERROR_MARK_NODE is returned. */
23966 static tree
23968 {
23971 /* Look for the `=' token. */
23974 /* Look for the `0' token. */
23983 /* Accept = default or = delete in c++0x mode. */
23986 {
23989 }
23991 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
23993 {
23998 }
24000 {
24003 }
24006 }
24008 /* Parse a constant-initializer.
24010 constant-initializer:
24011 = constant-expression
24013 Returns a representation of the constant-expression. */
24015 static tree
24017 {
24018 /* Look for the `=' token. */
24022 /* It is invalid to write:
24024 struct S { static const int i = { 7 }; };
24026 */
24028 {
24031 /* Consume the opening brace. */
24032 matching_braces braces;
24034 /* Skip the initializer. */
24036 /* Look for the trailing `}'. */
24040 }
24043 }
24045 /* Derived classes [gram.class.derived] */
24047 /* Parse a base-clause.
24049 base-clause:
24050 : base-specifier-list
24052 base-specifier-list:
24053 base-specifier ... [opt]
24054 base-specifier-list , base-specifier ... [opt]
24056 Returns a TREE_LIST representing the base-classes, in the order in
24057 which they were declared. The representation of each node is as
24058 described by cp_parser_base_specifier.
24060 In the case that no bases are specified, this function will return
24061 NULL_TREE, not ERROR_MARK_NODE. */
24063 static tree
24065 {
24068 /* Look for the `:' that begins the list. */
24071 /* Scan the base-specifier-list. */
24073 {
24075 tree base;
24078 /* Look for the base-specifier. */
24080 /* Look for the (optional) ellipsis. */
24082 {
24083 /* Consume the `...'. */
24087 }
24089 /* Add BASE to the front of the list. */
24091 {
24093 /* Make this a pack expansion type. */
24097 {
24100 }
24101 }
24102 /* Peek at the next token. */
24104 /* If it's not a comma, then the list is complete. */
24107 /* Consume the `,'. */
24109 }
24111 /* PARSER->SCOPE may still be non-NULL at this point, if the last
24112 base class had a qualified name. However, the next name that
24113 appears is certainly not qualified. */
24119 }
24121 /* Parse a base-specifier.
24123 base-specifier:
24124 :: [opt] nested-name-specifier [opt] class-name
24125 virtual access-specifier [opt] :: [opt] nested-name-specifier
24126 [opt] class-name
24127 access-specifier virtual [opt] :: [opt] nested-name-specifier
24128 [opt] class-name
24130 Returns a TREE_LIST. The TREE_PURPOSE will be one of
24131 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
24132 indicate the specifiers provided. The TREE_VALUE will be a TYPE
24133 (or the ERROR_MARK_NODE) indicating the type that was specified. */
24135 static tree
24137 {
24145 tree type;
24147 /* Process the optional `virtual' and `access-specifier'. */
24149 {
24150 /* Peek at the next token. */
24152 /* Process `virtual'. */
24154 {
24156 /* If `virtual' appears more than once, issue an error. */
24158 {
24162 }
24166 /* Consume the `virtual' token. */
24174 /* If more than one access specifier appears, issue an
24175 error. */
24178 {
24182 }
24186 /* Consume the access-specifier. */
24194 }
24195 }
24196 /* It is not uncommon to see programs mechanically, erroneously, use
24197 the 'typename' keyword to denote (dependent) qualified types
24198 as base classes. */
24200 {
24205 else
24207 "keyword %<typename%> not allowed in this context "
24210 }
24212 /* Look for the optional `::' operator. */
24214 /* Look for the nested-name-specifier. The simplest way to
24215 implement:
24217 [temp.res]
24219 The keyword `typename' is not permitted in a base-specifier or
24220 mem-initializer; in these contexts a qualified name that
24221 depends on a template-parameter is implicitly assumed to be a
24222 type name.
24224 is to pretend that we have seen the `typename' keyword at this
24225 point. */
24231 /* If the base class is given by a qualified name, assume that names
24232 we see are type names or templates, as appropriate. */
24238 /* DR 950 allows decltype as a base-specifier. */
24240 else
24241 {
24242 /* Otherwise, look for the class-name. */
24244 class_scope_p,
24245 template_p,
24246 typename_type,
24251 }
24257 }
24259 /* Exception handling [gram.exception] */
24261 /* Parse an (optional) noexcept-specification.
24263 noexcept-specification:
24264 noexcept ( constant-expression ) [opt]
24266 If no noexcept-specification is present, returns NULL_TREE.
24267 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
24268 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
24269 there are no parentheses. CONSUMED_EXPR will be set accordingly.
24270 Otherwise, returns a noexcept specification unless RETURN_COND is true,
24271 in which case a boolean condition is returned instead. */
24273 static tree
24278 {
24282 /* Peek at the next token. */
24285 /* Is it a noexcept-specification? */
24287 {
24288 tree expr;
24292 {
24293 matching_parens parens;
24297 {
24298 /* Types may not be defined in an exception-specification. */
24300 parser->type_definition_forbidden_message
24305 /* Restore the saved message. */
24307 }
24308 else
24309 {
24312 }
24315 }
24316 else
24317 {
24321 }
24323 /* We cannot build a noexcept-spec right away because this will check
24324 that expr is a constexpr. */
24327 else
24329 }
24330 else
24332 }
24334 /* Parse an (optional) exception-specification.
24336 exception-specification:
24337 throw ( type-id-list [opt] )
24339 Returns a TREE_LIST representing the exception-specification. The
24340 TREE_VALUE of each node is a type. */
24342 static tree
24344 {
24346 tree type_id_list;
24349 /* Peek at the next token. */
24352 /* Is it a noexcept-specification? */
24358 /* If it's not `throw', then there's no exception-specification. */
24364 /* Consume the `throw'. */
24367 /* Look for the `('. */
24368 matching_parens parens;
24371 /* Peek at the next token. */
24373 /* If it's not a `)', then there is a type-id-list. */
24375 {
24376 /* Types may not be defined in an exception-specification. */
24378 parser->type_definition_forbidden_message
24380 /* Parse the type-id-list. */
24382 /* Restore the saved message. */
24386 {
24390 }
24393 "dynamic exception specifications are deprecated in "
24395 }
24396 /* In C++17, throw() is equivalent to noexcept (true). throw()
24397 is deprecated in C++11 and above as well, but is still widely used,
24398 so don't warn about it yet. */
24401 else
24404 /* Look for the `)'. */
24408 }
24410 /* Parse an (optional) type-id-list.
24412 type-id-list:
24413 type-id ... [opt]
24414 type-id-list , type-id ... [opt]
24416 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
24417 in the order that the types were presented. */
24419 static tree
24421 {
24425 {
24427 tree type;
24431 /* Get the next type-id. */
24433 /* Check for invalid 'auto'. */
24435 {
24439 }
24440 /* Parse the optional ellipsis. */
24442 {
24443 /* Consume the `...'. */
24446 /* Turn the type into a pack expansion expression. */
24448 }
24449 /* Add it to the list. */
24451 /* Peek at the next token. */
24453 /* If it is not a `,', we are done. */
24456 /* Consume the `,'. */
24458 }
24461 }
24463 /* Parse a try-block.
24465 try-block:
24466 try compound-statement handler-seq */
24468 static tree
24470 {
24471 tree try_block;
24485 }
24487 /* Parse a function-try-block.
24489 function-try-block:
24490 try ctor-initializer [opt] function-body handler-seq */
24492 static void
24494 {
24495 tree compound_stmt;
24496 tree try_block;
24498 /* Look for the `try' keyword. */
24501 /* Let the rest of the front end know where we are. */
24503 /* Parse the function-body. */
24504 cp_parser_ctor_initializer_opt_and_function_body
24506 /* We're done with the `try' part. */
24508 /* Parse the handlers. */
24510 /* We're done with the handlers. */
24512 }
24514 /* Parse a handler-seq.
24516 handler-seq:
24517 handler handler-seq [opt] */
24519 static void
24521 {
24523 {
24526 /* Parse the handler. */
24528 /* Peek at the next token. */
24530 /* If it's not `catch' then there are no more handlers. */
24533 }
24534 }
24536 /* Parse a handler.
24538 handler:
24539 catch ( exception-declaration ) compound-statement */
24541 static void
24543 {
24544 tree handler;
24545 tree declaration;
24549 matching_parens parens;
24556 }
24558 /* Parse an exception-declaration.
24560 exception-declaration:
24561 type-specifier-seq declarator
24562 type-specifier-seq abstract-declarator
24563 type-specifier-seq
24564 ...
24566 Returns a VAR_DECL for the declaration, or NULL_TREE if the
24567 ellipsis variant is used. */
24569 static tree
24571 {
24572 cp_decl_specifier_seq type_specifiers;
24576 /* If it's an ellipsis, it's easy to handle. */
24578 {
24579 /* Consume the `...' token. */
24582 }
24584 /* Types may not be defined in exception-declarations. */
24586 parser->type_definition_forbidden_message
24589 /* Parse the type-specifier-seq. */
24593 /* If it's a `)', then there is no declarator. */
24596 else
24603 /* Restore the saved message. */
24610 }
24612 /* Parse a throw-expression.
24614 throw-expression:
24615 throw assignment-expression [opt]
24617 Returns a THROW_EXPR representing the throw-expression. */
24619 static tree
24621 {
24622 tree expression;
24627 /* Figure out whether or not there is an assignment-expression
24628 following the "throw" keyword. */
24636 else
24640 }
24642 /* GNU Extensions */
24644 /* Parse an (optional) asm-specification.
24646 asm-specification:
24647 asm ( string-literal )
24649 If the asm-specification is present, returns a STRING_CST
24650 corresponding to the string-literal. Otherwise, returns
24651 NULL_TREE. */
24653 static tree
24655 {
24657 tree asm_specification;
24659 /* Peek at the next token. */
24661 /* If the next token isn't the `asm' keyword, then there's no
24662 asm-specification. */
24666 /* Consume the `asm' token. */
24668 /* Look for the `('. */
24669 matching_parens parens;
24672 /* Look for the string-literal. */
24675 /* Look for the `)'. */
24679 }
24681 /* Parse an asm-operand-list.
24683 asm-operand-list:
24684 asm-operand
24685 asm-operand-list , asm-operand
24687 asm-operand:
24688 string-literal ( expression )
24689 [ string-literal ] string-literal ( expression )
24691 Returns a TREE_LIST representing the operands. The TREE_VALUE of
24692 each node is the expression. The TREE_PURPOSE is itself a
24693 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
24694 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
24695 is a STRING_CST for the string literal before the parenthesis. Returns
24696 ERROR_MARK_NODE if any of the operands are invalid. */
24698 static tree
24700 {
24705 {
24706 tree string_literal;
24707 tree expression;
24708 tree name;
24711 {
24712 /* Consume the `[' token. */
24714 /* Read the operand name. */
24719 /* Look for the closing `]'. */
24721 }
24722 else
24724 /* Look for the string-literal. */
24727 /* Look for the `('. */
24728 matching_parens parens;
24730 /* Parse the expression. */
24732 /* Look for the `)'. */
24740 /* Add this operand to the list. */
24742 expression,
24743 asm_operands);
24744 /* If the next token is not a `,', there are no more
24745 operands. */
24748 /* Consume the `,'. */
24750 }
24753 }
24755 /* Parse an asm-clobber-list.
24757 asm-clobber-list:
24758 string-literal
24759 asm-clobber-list , string-literal
24761 Returns a TREE_LIST, indicating the clobbers in the order that they
24762 appeared. The TREE_VALUE of each node is a STRING_CST. */
24764 static tree
24766 {
24770 {
24771 tree string_literal;
24773 /* Look for the string literal. */
24775 /* Add it to the list. */
24777 /* If the next token is not a `,', then the list is
24778 complete. */
24781 /* Consume the `,' token. */
24783 }
24786 }
24788 /* Parse an asm-label-list.
24790 asm-label-list:
24791 identifier
24792 asm-label-list , identifier
24794 Returns a TREE_LIST, indicating the labels in the order that they
24795 appeared. The TREE_VALUE of each node is a label. */
24797 static tree
24799 {
24803 {
24806 /* Look for the identifier. */
24809 {
24812 {
24818 }
24819 }
24820 /* If the next token is not a `,', then the list is
24821 complete. */
24824 /* Consume the `,' token. */
24826 }
24829 }
24831 /* Return TRUE iff the next tokens in the stream are possibly the
24832 beginning of a GNU extension attribute. */
24834 static bool
24836 {
24838 }
24840 /* Return TRUE iff the next tokens in the stream are possibly the
24841 beginning of a standard C++-11 attribute specifier. */
24843 static bool
24845 {
24847 }
24849 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24850 beginning of a standard C++-11 attribute specifier. */
24852 static bool
24854 {
24862 }
24864 /* Return TRUE iff the next Nth tokens in the stream are possibly the
24865 beginning of a GNU extension attribute. */
24867 static bool
24869 {
24873 }
24875 /* Return true iff the next tokens can be the beginning of either a
24876 GNU attribute list, or a standard C++11 attribute sequence. */
24878 static bool
24880 {
24883 }
24885 /* Return true iff the next Nth tokens can be the beginning of either
24886 a GNU attribute list, or a standard C++11 attribute sequence. */
24888 static bool
24890 {
24893 }
24895 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
24896 of GNU attributes, or return NULL. */
24898 static tree
24900 {
24904 }
24906 #define CILK_SIMD_FN_CLAUSE_MASK \
24907 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
24908 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
24909 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
24910 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
24911 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
24913 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
24914 vector [(<clauses>)] */
24916 static void
24918 {
24922 {
24928 }
24931 {
24934 paren_scope++;
24935 }
24937 {
24940 paren_scope++;
24942 paren_scope--;
24943 /* Do not push the last ')' */
24946 }
24955 }
24957 /* Parse an (optional) series of attributes.
24959 attributes:
24960 attributes attribute
24962 attribute:
24963 __attribute__ (( attribute-list [opt] ))
24965 The return value is as for cp_parser_gnu_attribute_list. */
24967 static tree
24969 {
24973 {
24975 tree attribute_list;
24978 /* Peek at the next token. */
24980 /* If it's not `__attribute__', then we're done. */
24984 /* Consume the `__attribute__' keyword. */
24986 /* Look for the two `(' tokens. */
24987 matching_parens outer_parens;
24989 matching_parens inner_parens;
24992 /* Peek at the next token. */
24995 /* Parse the attribute-list. */
24997 else
24998 /* If the next token is a `)', then there is no attribute
24999 list. */
25002 /* Look for the two `)' tokens. */
25010 /* Add these new attributes to the list. */
25012 }
25015 }
25017 /* Parse a GNU attribute-list.
25019 attribute-list:
25020 attribute
25021 attribute-list , attribute
25023 attribute:
25024 identifier
25025 identifier ( identifier )
25026 identifier ( identifier , expression-list )
25027 identifier ( expression-list )
25029 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
25030 to an attribute. The TREE_PURPOSE of each node is the identifier
25031 indicating which attribute is in use. The TREE_VALUE represents
25032 the arguments, if any. */
25034 static tree
25036 {
25042 {
25044 tree identifier;
25045 tree attribute;
25047 /* Look for the identifier. We also allow keywords here; for
25048 example `__attribute__ ((const))' is legal. */
25052 {
25055 /* Consume the token, but save it since we need it for the
25056 SIMD enabled function parsing. */
25059 /* Save away the identifier that indicates which attribute
25060 this is. */
25062 /* For keywords, use the canonical spelling, not the
25063 parsed identifier. */
25070 /* Peek at the next token. */
25072 /* If it's an `(', then parse the attribute arguments. */
25074 {
25079 {
25082 }
25083 else
25084 vec = cp_parser_parenthesized_expression_list
25090 else
25091 {
25094 }
25095 /* Save the arguments away. */
25097 }
25099 {
25102 }
25105 {
25106 /* Add this attribute to the list. */
25109 }
25112 }
25113 /* Now, look for more attributes. If the next token isn't a
25114 `,', we're done. */
25118 /* Consume the comma and keep going. */
25120 }
25123 /* We built up the list in reverse order. */
25125 }
25127 /* Parse a standard C++11 attribute.
25129 The returned representation is a TREE_LIST which TREE_PURPOSE is
25130 the scoped name of the attribute, and the TREE_VALUE is its
25131 arguments list.
25133 Note that the scoped name of the attribute is itself a TREE_LIST
25134 which TREE_PURPOSE is the namespace of the attribute, and
25135 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
25136 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
25137 and which TREE_PURPOSE is directly the attribute name.
25139 Clients of the attribute code should use get_attribute_namespace
25140 and get_attribute_name to get the actual namespace and name of
25141 attributes, regardless of their being GNU or C++11 attributes.
25143 attribute:
25144 attribute-token attribute-argument-clause [opt]
25146 attribute-token:
25147 identifier
25148 attribute-scoped-token
25150 attribute-scoped-token:
25151 attribute-namespace :: identifier
25153 attribute-namespace:
25154 identifier
25156 attribute-argument-clause:
25157 ( balanced-token-seq )
25159 balanced-token-seq:
25160 balanced-token [opt]
25161 balanced-token-seq balanced-token
25163 balanced-token:
25164 ( balanced-token-seq )
25165 [ balanced-token-seq ]
25166 { balanced-token-seq }. */
25168 static tree
25170 {
25174 /* First, parse name of the attribute, a.k.a attribute-token. */
25191 {
25192 /* We are seeing a scoped attribute token. */
25207 else
25208 {
25212 }
25216 NULL_TREE);
25218 }
25221 NULL_TREE);
25222 else
25223 {
25226 NULL_TREE);
25227 /* C++11 noreturn attribute is equivalent to GNU's. */
25230 /* C++14 deprecated attribute is equivalent to GNU's. */
25233 /* C++17 fallthrough attribute is equivalent to GNU's. */
25236 /* Transactional Memory TS optimize_for_synchronized attribute is
25237 equivalent to GNU transaction_callable. */
25241 /* Transactional Memory attributes are GNU attributes. */
25244 }
25246 /* Now parse the optional argument clause of the attribute. */
25251 {
25257 /* A GNU attribute that takes an identifier in parameter. */
25260 vec = cp_parser_parenthesized_expression_list
25266 else
25267 {
25270 }
25274 else
25276 }
25279 }
25281 /* Check that the attribute ATTRIBUTE appears at most once in the
25282 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
25283 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
25284 isn't implemented yet in GCC. */
25286 static void
25288 {
25290 {
25300 }
25301 }
25303 /* Parse a list of standard C++-11 attributes.
25305 attribute-list:
25306 attribute [opt]
25307 attribute-list , attribute[opt]
25308 attribute ...
25309 attribute-list , attribute ...
25310 */
25312 static tree
25314 {
25319 {
25324 {
25328 }
25331 {
25336 else
25337 {
25342 }
25344 }
25348 }
25351 }
25353 /* Parse a standard C++-11 attribute specifier.
25355 attribute-specifier:
25356 [ [ attribute-using-prefix [opt] attribute-list ] ]
25357 alignment-specifier
25359 attribute-using-prefix:
25360 using attribute-namespace :
25362 alignment-specifier:
25363 alignas ( type-id ... [opt] )
25364 alignas ( alignment-expression ... [opt] ). */
25366 static tree
25368 {
25374 {
25381 {
25392 {
25396 "attribute using prefix only available "
25402 }
25403 else
25405 }
25412 else
25413 /* Warn about parsing c++11 attribute in non-c++1 mode, only
25414 when we are sure that we have actually parsed them. */
25416 }
25417 else
25418 {
25419 tree alignas_expr;
25421 /* Look for an alignment-specifier. */
25432 matching_parens parens;
25434 {
25437 }
25443 {
25450 }
25455 /* Handle alignas (pack...). */
25457 {
25460 }
25462 /* Something went wrong, so don't build the attribute. */
25467 {
25470 }
25472 /* Build the C++-11 representation of an 'aligned'
25473 attribute. */
25474 attributes =
25477 alignas_expr);
25478 }
25481 }
25483 /* Parse a standard C++-11 attribute-specifier-seq.
25485 attribute-specifier-seq:
25486 attribute-specifier-seq [opt] attribute-specifier
25487 */
25489 static tree
25491 {
25496 {
25505 else
25508 }
25511 }
25513 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
25514 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
25515 current value of the PEDANTIC flag, regardless of whether or not
25516 the `__extension__' keyword is present. The caller is responsible
25517 for restoring the value of the PEDANTIC flag. */
25519 static bool
25521 {
25522 /* Save the old value of the PEDANTIC flag. */
25526 {
25527 /* Consume the `__extension__' token. */
25529 /* We're not being pedantic while the `__extension__' keyword is
25530 in effect. */
25534 }
25537 }
25539 /* Parse a label declaration.
25541 label-declaration:
25542 __label__ label-declarator-seq ;
25544 label-declarator-seq:
25545 identifier , label-declarator-seq
25546 identifier */
25548 static void
25550 {
25551 /* Look for the `__label__' keyword. */
25555 {
25556 tree identifier;
25558 /* Look for an identifier. */
25560 /* If we failed, stop. */
25563 /* Declare it as a label. */
25565 /* If the next token is a `;', stop. */
25568 /* Look for the `,' separating the label declarations. */
25570 }
25572 /* Look for the final `;'. */
25574 }
25576 // -------------------------------------------------------------------------- //
25577 // Requires Clause
25579 // Parse a requires clause.
25580 //
25581 // requires-clause:
25582 // 'requires' logical-or-expression
25583 //
25584 // The required logical-or-expression must be a constant expression. Note
25585 // that we don't check that the expression is constepxr here. We defer until
25586 // we analyze constraints and then, we only check atomic constraints.
25587 static tree
25589 {
25590 // Parse the requires clause so that it is not automatically folded.
25598 }
25600 // Optionally parse a requires clause:
25601 static tree
25603 {
25606 {
25609 {
25612 /* Parse and discard the requires-clause. */
25615 }
25617 }
25620 }
25623 /*---------------------------------------------------------------------------
25624 Requires expressions
25625 ---------------------------------------------------------------------------*/
25627 /* Parse a requires expression
25629 requirement-expression:
25630 'requires' requirement-parameter-list [opt] requirement-body */
25631 static tree
25633 {
25637 /* A requires-expression shall appear only within a concept
25638 definition or a requires-clause.
25640 TODO: Implement this diagnostic correctly. */
25642 {
25646 }
25649 {
25650 /* Local parameters are delared as variables within the scope
25651 of the expression. They are not visible past the end of
25652 the expression. Expressions within the requires-expression
25653 are unevaluated. */
25654 struct scope_sentinel
25655 {
25657 {
25660 }
25663 {
25666 }
25669 /* Parse the optional parameter list. */
25671 {
25675 }
25676 else
25679 /* Parse the requirement body. */
25683 }
25685 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
25686 the parm chain. */
25689 }
25691 /* Parse a parameterized requirement.
25693 requirement-parameter-list:
25694 '(' parameter-declaration-clause ')' */
25695 static tree
25697 {
25698 matching_parens parens;
25708 }
25710 /* Parse the body of a requirement.
25712 requirement-body:
25713 '{' requirement-list '}' */
25714 static tree
25716 {
25717 matching_braces braces;
25727 }
25729 /* Parse a list of requirements.
25731 requirement-list:
25732 requirement
25733 requirement-list ';' requirement[opt] */
25734 static tree
25736 {
25739 {
25746 /* If we see a semi-colon, consume it. */
25750 /* Stop processing at the end of the list. */
25753 }
25755 /* Reverse the order of requirements so they are analyzed in
25756 declaration order. */
25758 }
25760 /* Parse a syntactic requirement or type requirement.
25762 requirement:
25763 simple-requirement
25764 compound-requirement
25765 type-requirement
25766 nested-requirement */
25767 static tree
25769 {
25776 else
25778 }
25780 /* Parse a simple requirement.
25782 simple-requirement:
25783 expression ';' */
25784 static tree
25786 {
25795 }
25797 /* Parse a type requirement
25799 type-requirement
25800 nested-name-specifier [opt] required-type-name ';'
25802 required-type-name:
25803 type-name
25804 'template' [opt] simple-template-id */
25805 static tree
25807 {
25810 // Save the scope before parsing name specifiers.
25821 tree type;
25823 {
25832 }
25833 else
25852 }
25854 /* Parse a compound requirement
25856 compound-requirement:
25857 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
25858 static tree
25860 {
25861 /* Parse an expression enclosed in '{ }'s. */
25862 matching_braces braces;
25873 /* Parse the optional noexcept. */
25876 {
25879 }
25881 /* Parse the optional trailing return type. */
25884 {
25892 }
25895 }
25897 /* Parse a nested requirement. This is the same as a requires clause.
25899 nested-requirement:
25900 requires-clause */
25901 static tree
25903 {
25909 }
25911 /* Support Functions */
25913 /* Return the appropriate prefer_type argument for lookup_name_real based on
25914 tag_type and template_mem_access. */
25918 {
25919 /* DR 141: When looking in the current enclosing context for a template-name
25920 after -> or ., only consider class templates. */
25924 {
25928 }
25929 }
25931 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
25932 NAME should have one of the representations used for an
25933 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
25934 is returned. If PARSER->SCOPE is a dependent type, then a
25935 SCOPE_REF is returned.
25937 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
25938 returned; the name was already resolved when the TEMPLATE_ID_EXPR
25939 was formed. Abstractly, such entities should not be passed to this
25940 function, because they do not need to be looked up, but it is
25941 simpler to check for this special case here, rather than at the
25942 call-sites.
25944 In cases not explicitly covered above, this function returns a
25945 DECL, OVERLOAD, or baselink representing the result of the lookup.
25946 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
25947 is returned.
25949 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
25950 (e.g., "struct") that was used. In that case bindings that do not
25951 refer to types are ignored.
25953 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
25954 ignored.
25956 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
25957 are ignored.
25959 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
25960 types.
25962 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
25963 TREE_LIST of candidates if name-lookup results in an ambiguity, and
25964 NULL_TREE otherwise. */
25966 static cp_expr
25973 location_t name_location)
25974 {
25975 tree decl;
25978 /* Assume that the lookup will be unambiguous. */
25982 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
25983 no longer valid. Note that if we are parsing tentatively, and
25984 the parse fails, OBJECT_TYPE will be automatically restored. */
25990 /* A template-id has already been resolved; there is no lookup to
25991 do. */
25995 {
25999 }
26001 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
26002 it should already have been checked to make sure that the name
26003 used matches the type being destroyed. */
26005 {
26006 tree type;
26008 /* Figure out to which type this destructor applies. */
26013 else
26015 /* If that's not a class type, there is no destructor. */
26026 }
26028 /* By this point, the NAME should be an ordinary identifier. If
26029 the id-expression was a qualified name, the qualifying scope is
26030 stored in PARSER->SCOPE at this point. */
26033 /* Perform the lookup. */
26035 {
26041 /* If the SCOPE is dependent, the lookup must be deferred until
26042 the template is instantiated -- unless we are explicitly
26043 looking up names in uninstantiated templates. Even then, we
26044 cannot look up the name if the scope is not a class type; it
26045 might, for example, be a template type parameter. */
26050 /* Defer lookup. */
26052 else
26053 {
26056 /* If PARSER->SCOPE is a dependent type, then it must be a
26057 class type, and we must not be checking dependencies;
26058 otherwise, we would have processed this lookup above. So
26059 that PARSER->SCOPE is not considered a dependent base by
26060 lookup_member, we must enter the scope here. */
26064 /* If the PARSER->SCOPE is a template specialization, it
26065 may be instantiated during name lookup. In that case,
26066 errors may be issued. Even if we rollback the current
26067 tentative parse, those errors are valid. */
26072 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
26073 lookup result and the nested-name-specifier nominates a class C:
26074 * if the name specified after the nested-name-specifier, when
26075 looked up in C, is the injected-class-name of C (Clause 9), or
26076 * if the name specified after the nested-name-specifier is the
26077 same as the identifier or the simple-template-id's template-
26078 name in the last component of the nested-name-specifier,
26079 the name is instead considered to name the constructor of
26080 class C. [ Note: for example, the constructor is not an
26081 acceptable lookup result in an elaborated-type-specifier so
26082 the constructor would not be used in place of the
26083 injected-class-name. --end note ] Such a constructor name
26084 shall be used only in the declarator-id of a declaration that
26085 names a constructor or in a using-declaration. */
26093 /* If we have a single function from a using decl, pull it out. */
26100 }
26102 /* If the scope is a dependent type and either we deferred lookup or
26103 we did lookup but didn't find the name, rememeber the name. */
26106 {
26108 {
26109 tree type;
26111 /* The resolution to Core Issue 180 says that `struct
26112 A::B' should be considered a type-name, even if `A'
26113 is dependent. */
26118 }
26122 CPP_CLOSE_PAREN)))
26126 else
26129 is_template);
26130 }
26133 }
26135 {
26136 /* Look up the name in the scope of the OBJECT_TYPE, unless the
26137 OBJECT_TYPE is not a class. */
26139 /* If the OBJECT_TYPE is a template specialization, it may
26140 be instantiated during name lookup. In that case, errors
26141 may be issued. Even if we rollback the current tentative
26142 parse, those errors are valid. */
26144 name,
26147 tf_warning_or_error);
26148 else
26152 /* Look it up in the enclosing context. DR 141: When looking for a
26153 template-name after -> or ., only consider class templates. */
26158 /* The object is type-dependent, so we can't look anything up; we used
26159 this to get the DR 141 behavior. */
26163 }
26164 else
26165 {
26171 }
26173 /* If the lookup failed, let our caller know. */
26177 /* Pull out the template from an injected-class-name (or multiple). */
26181 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
26183 {
26186 /* The error message we have to print is too complicated for
26187 cp_parser_error, so we incorporate its actions directly. */
26189 {
26191 name);
26193 }
26195 }
26203 /* If we have resolved the name of a member declaration, check to
26204 see if the declaration is accessible. When the name resolves to
26205 set of overloaded functions, accessibility is checked when
26206 overload resolution is done.
26208 During an explicit instantiation, access is not checked at all,
26209 as per [temp.explicit]. */
26216 }
26218 /* Like cp_parser_lookup_name, but for use in the typical case where
26219 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
26220 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
26222 static tree
26224 {
26226 none_type,
26231 location);
26232 }
26234 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
26235 the current context, return the TYPE_DECL. If TAG_NAME_P is
26236 true, the DECL indicates the class being defined in a class-head,
26237 or declared in an elaborated-type-specifier.
26239 Otherwise, return DECL. */
26241 static tree
26243 {
26244 /* If the TEMPLATE_DECL is being declared as part of a class-head,
26245 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
26247 struct A {
26248 template <typename T> struct B;
26249 };
26251 template <typename T> struct A::B {};
26253 Similarly, in an elaborated-type-specifier:
26255 namespace N { struct X{}; }
26257 struct A {
26258 template <typename T> friend struct N::X;
26259 };
26261 However, if the DECL refers to a class type, and we are in
26262 the scope of the class, then the name lookup automatically
26263 finds the TYPE_DECL created by build_self_reference rather
26264 than a TEMPLATE_DECL. For example, in:
26266 template <class T> struct S {
26267 S s;
26268 };
26270 there is no need to handle such case. */
26276 }
26278 /* If too many, or too few, template-parameter lists apply to the
26279 declarator, issue an error message. Returns TRUE if all went well,
26280 and FALSE otherwise. */
26282 static bool
26285 location_t declarator_location)
26286 {
26288 {
26290 {
26298 /* If the DECLARATOR has the form `X<y>' then it uses one
26299 additional level of template parameters. */
26302 return cp_parser_check_template_parameters
26304 }
26320 }
26322 }
26324 /* NUM_TEMPLATES were used in the current declaration. If that is
26325 invalid, return FALSE and issue an error messages. Otherwise,
26326 return TRUE. If DECLARATOR is non-NULL, then we are checking a
26327 declarator and we can print more accurate diagnostics. */
26329 static bool
26332 location_t location,
26334 {
26335 /* If there are the same number of template classes and parameter
26336 lists, that's OK. */
26339 /* If there are more, but only one more, then we are referring to a
26340 member template. That's OK too. */
26343 /* If there are more template classes than parameter lists, we have
26344 something like:
26346 template <class T> void S<T>::R<T>::f (); */
26348 {
26358 else
26361 }
26362 /* Otherwise, there are too many template parameter lists. We have
26363 something like:
26365 template <class T> template <class U> void S::f(); */
26368 }
26370 /* Parse an optional `::' token indicating that the following name is
26371 from the global namespace. If so, PARSER->SCOPE is set to the
26372 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
26373 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
26374 Returns the new value of PARSER->SCOPE, if the `::' token is
26375 present, and NULL_TREE otherwise. */
26377 static tree
26379 {
26382 /* Peek at the next token. */
26384 /* If we're looking at a `::' token then we're starting from the
26385 global namespace, not our current location. */
26387 {
26388 /* Consume the `::' token. */
26390 /* Set the SCOPE so that we know where to start the lookup. */
26396 }
26398 {
26402 }
26405 }
26407 /* Returns TRUE if the upcoming token sequence is the start of a
26408 constructor declarator or C++17 deduction guide. If FRIEND_P is true, the
26409 declarator is preceded by the `friend' specifier. */
26411 static bool
26413 {
26416 tree nested_name_specifier;
26419 /* The common case is that this is not a constructor declarator, so
26420 try to avoid doing lots of work if at all possible. It's not
26421 valid declare a constructor at function scope. */
26424 /* And only certain tokens can begin a constructor declarator. */
26432 /* Parse tentatively; we are going to roll back all of the tokens
26433 consumed here. */
26435 /* Assume that we are looking at a constructor declarator. */
26438 /* Look for the optional `::' operator. */
26441 /* Look for the nested-name-specifier. */
26442 nested_name_specifier
26453 /* Outside of a class-specifier, there must be a
26454 nested-name-specifier. Except in C++17 mode, where we
26455 might be declaring a guiding declaration. */
26462 /* If we have a class scope, this is easy; DR 147 says that S::S always
26463 names the constructor, and no other qualified name could. */
26466 {
26476 }
26477 /* If we still think that this might be a constructor-declarator,
26478 look for a class-name. */
26480 {
26481 /* If we have:
26483 template <typename T> struct S {
26484 S();
26485 };
26487 we must recognize that the nested `S' names a class. */
26491 tree type_decl;
26495 none_type,
26502 {
26508 none_type,
26513 else
26515 }
26517 /* If there was no class-name, then this is not a constructor.
26518 Otherwise, if we are in a class-specifier and we aren't
26519 handling a friend declaration, check that its type matches
26520 current_class_type (c++/38313). Note: error_mark_node
26521 is left alone for error recovery purposes. */
26523 && (outside_class_specifier_p
26529 /* If we're still considering a constructor, we have to see a `(',
26530 to begin the parameter-declaration-clause, followed by either a
26531 `)', an `...', or a decl-specifier. We need to check for a
26532 type-specifier to avoid being fooled into thinking that:
26534 S (f) (int);
26536 is a constructor. (It is actually a function named `f' that
26537 takes one parameter (of type `int') and returns a value of type
26538 `S'. */
26546 /* A parameter declaration begins with a decl-specifier,
26547 which is either the "attribute" keyword, a storage class
26548 specifier, or (usually) a type-specifier. */
26550 {
26551 tree type;
26555 /* Names appearing in the type-specifier should be looked up
26556 in the scope of the class. */
26560 {
26563 {
26567 {
26570 }
26571 }
26573 }
26575 /* Inside the constructor parameter list, surrounding
26576 template-parameter-lists do not apply. */
26577 saved_num_template_parameter_lists
26581 /* Look for the type-specifier. */
26583 CP_PARSER_FLAGS_NONE,
26589 parser->num_template_parameter_lists
26592 /* Leave the scope of the class. */
26597 }
26598 }
26600 /* We did not really want to consume any tokens. */
26604 }
26606 /* Parse the definition of the function given by the DECL_SPECIFIERS,
26607 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
26608 they must be performed once we are in the scope of the function.
26610 Returns the function defined. */
26612 static tree
26613 cp_parser_function_definition_from_specifiers_and_declarator
26616 tree attributes,
26618 {
26619 tree fn;
26622 /* Begin the function-definition. */
26625 /* The things we're about to see are not directly qualified by any
26626 template headers we've seen thus far. */
26629 /* If there were names looked up in the decl-specifier-seq that we
26630 did not check, check them now. We must wait until we are in the
26631 scope of the function to perform the checks, since the function
26632 might be a friend. */
26636 {
26641 }
26644 {
26645 /* Skip the entire function. */
26648 }
26650 {
26651 /* Seen already, skip it. An error message has already been output. */
26655 /* If this is a function from a class, pop the nested class. */
26658 }
26659 else
26660 {
26661 timevar_id_t tv;
26664 else
26670 }
26673 }
26675 /* Parse the part of a function-definition that follows the
26676 declarator. INLINE_P is TRUE iff this function is an inline
26677 function defined within a class-specifier.
26679 Returns the function defined. */
26681 static tree
26684 {
26685 tree fn;
26690 bool fully_implicit_function_template_p
26693 tree implicit_template_parms
26696 cp_binding_level* implicit_template_scope
26702 /* If the next token is `return', then the code may be trying to
26703 make use of the "named return value" extension that G++ used to
26704 support. */
26707 {
26708 /* Consume the `return' keyword. */
26710 /* Look for the identifier that indicates what value is to be
26711 returned. */
26713 /* Issue an error message. */
26716 /* Skip tokens until we reach the start of the function body. */
26718 {
26725 }
26726 }
26727 /* The `extern' in `extern "C" void f () { ... }' does not apply to
26728 anything declared inside `f'. */
26729 saved_in_unbraced_linkage_specification_p
26732 /* Inside the function, surrounding template-parameter-lists do not
26733 apply. */
26734 saved_num_template_parameter_lists
26738 /* If the next token is `try', `__transaction_atomic', or
26739 `__transaction_relaxed`, then we are looking at either function-try-block
26740 or function-transaction-block. Note that all of these include the
26741 function-body. */
26745 RID_TRANSACTION_RELAXED))
26749 else
26750 cp_parser_ctor_initializer_opt_and_function_body
26753 /* Finish the function. */
26755 /* Generate code for it, if necessary. */
26757 /* Restore the saved values. */
26758 parser->in_unbraced_linkage_specification_p
26760 parser->num_template_parameter_lists
26764 parser->fully_implicit_function_template_p
26766 parser->implicit_template_parms
26768 parser->implicit_template_scope
26775 }
26777 /* Parse a template-declaration body (following argument list). */
26779 static void
26781 tree parameter_list,
26783 {
26787 /* We just processed one more parameter list. */
26790 /* Get the deferred access checks from the parameter list. These
26791 will be checked once we know what is being declared, as for a
26792 member template the checks must be performed in the scope of the
26793 class containing the member. */
26796 /* Tentatively parse for a new template parameter list, which can either be
26797 the template keyword or a template introduction. */
26803 else
26804 {
26805 /* There are no access checks when parsing a template, as we do not
26806 know if a specialization will be a friend. */
26810 checks,
26811 member_p,
26816 /* If this is a member template declaration, let the front
26817 end know. */
26819 {
26824 }
26829 }
26830 /* We are done with the current parameter list. */
26835 /* Finish up. */
26838 /* Check the template arguments for a literal operator template. */
26842 {
26846 else
26847 {
26850 {
26856 }
26858 {
26867 }
26868 else
26870 }
26872 {
26875 " Expected non-type template argument pack <char...>"
26877 decl);
26878 else
26881 decl);
26882 }
26883 }
26885 /* Register member declarations. */
26888 /* If DECL is a function template, we must return to parse it later.
26889 (Even though there is no definition, there might be default
26890 arguments that need handling.) */
26894 }
26896 /* Parse a template introduction header for a template-declaration. Returns
26897 false if tentative parse fails. */
26899 static bool
26901 {
26908 /* Look for the optional `::' operator. */
26911 /* Look for the nested-name-specifier. */
26921 /* Look up the concept for which we will be matching
26922 template parameters. */
26932 /* Look for opening brace for introduction. */
26933 matching_braces braces;
26941 /* Build vector of placeholder parameters and grab
26942 matching identifiers. */
26945 /* The introduction-list shall not be empty. */
26948 {
26951 }
26953 /* Look for closing brace for introduction. */
26958 {
26962 }
26964 /* Build and associate the constraint. */
26967 {
26969 member_p);
26971 }
26975 }
26977 /* Parse a normal template-declaration following the template keyword. */
26979 static void
26981 {
26982 tree parameter_list;
26986 /* Look for the `<' token. */
26990 {
26991 /* 14.5.2.2 [temp.mem]
26993 A local class shall not have member templates. */
26998 }
26999 /* [temp]
27001 A template ... shall not have C linkage. */
27003 {
27006 /* Give it C++ linkage to avoid confusing other parts of the
27007 front end. */
27010 }
27011 else
27014 /* We cannot perform access checks on the template parameter
27015 declarations until we know what is being declared, just as we
27016 cannot check the decl-specifier list. */
27019 /* If the next token is `>', then we have an invalid
27020 specialization. Rather than complain about an invalid template
27021 parameter, issue an error message here. */
27023 {
27027 }
27028 else
27029 {
27030 /* Parse the template parameters. */
27032 }
27034 /* Look for the `>'. */
27037 /* Manage template requirements */
27039 {
27044 }
27047 member_p);
27049 /* For the erroneous case of a template with C linkage, we pushed an
27050 implicit C++ linkage scope; exit that scope now. */
27053 }
27055 /* Parse a template-declaration, assuming that the `export' (and
27056 `extern') keywords, if present, has already been scanned. MEMBER_P
27057 is as for cp_parser_template_declaration. */
27059 static bool
27061 {
27063 {
27067 }
27072 }
27074 /* Perform the deferred access checks from a template-parameter-list.
27075 CHECKS is a TREE_LIST of access checks, as returned by
27076 get_deferred_access_checks. */
27078 static void
27079 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
27080 {
27084 }
27086 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
27087 `function-definition' sequence that follows a template header.
27088 If MEMBER_P is true, this declaration appears in a class scope.
27090 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
27091 *FRIEND_P is set to TRUE iff the declaration is a friend. */
27093 static tree
27099 {
27102 cp_decl_specifier_seq decl_specifiers;
27106 /* This function is only used when processing a template
27107 declaration. */
27111 /* Defer access checks until we know what is being declared. */
27114 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
27115 alternative. */
27118 CP_PARSER_FLAGS_OPTIONAL,
27124 /* There are no template typedefs. */
27126 {
27130 }
27132 /* Gather up the access checks that occurred the
27133 decl-specifier-seq. */
27136 /* Check for the declaration of a template class. */
27138 {
27141 {
27142 // If this is a declaration, but not a definition, associate
27143 // any constraints with the type declaration. Constraints
27144 // are associated with definitions in cp_parser_class_specifier.
27150 /* In this case:
27152 struct C {
27153 friend template <typename T> struct A<T>::B;
27154 };
27156 A<T>::B will be represented by a TYPENAME_TYPE, and
27157 therefore not recognized by shadow_tag. */
27159 && !decl
27166 else
27169 /* Perform access checks for template parameters. */
27172 /* Give a helpful diagnostic for
27173 template <class T> struct A { } a;
27174 if we aren't already recovering from an error. */
27177 {
27179 "a class template declaration must not declare "
27183 }
27184 }
27185 }
27187 /* Complain about missing 'typename' or other invalid type names. */
27190 {
27191 /* cp_parser_parse_and_diagnose_invalid_type_name calls
27192 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
27193 the rest of this declaration. */
27196 }
27198 /* If it's not a template class, try for a template function. If
27199 the next token is a `;', then this declaration does not declare
27200 anything. But, if there were errors in the decl-specifiers, then
27201 the error might well have come from an attempted class-specifier.
27202 In that case, there's no need to warn about a missing declarator. */
27206 {
27209 checks,
27211 member_p,
27212 declares_class_or_enum,
27216 /* 7.1.1-1 [dcl.stc]
27218 A storage-class-specifier shall not be specified in an explicit
27219 specialization... */
27221 && explicit_specialization_p
27223 {
27227 }
27231 }
27233 /* Look for a trailing `;' after the declaration. */
27239 out:
27242 /* Clear any current qualification; whatever comes next is the start
27243 of something new. */
27249 }
27251 /* Parse a cast-expression that is not the operand of a unary "&". */
27253 static cp_expr
27255 {
27258 }
27260 /* Parse a functional cast to TYPE. Returns an expression
27261 representing the cast. */
27263 static cp_expr
27265 {
27267 tree expression_list;
27268 cp_expr cast;
27277 {
27287 /* Create a location of the form:
27288 type_name{i, f}
27289 ^~~~~~~~~~~~~~~
27290 with caret == start at the start of the type name,
27291 finishing at the closing brace. */
27292 location_t finish_loc
27295 finish_loc);
27298 }
27307 else
27308 {
27311 }
27314 tf_warning_or_error);
27315 /* [expr.const]/1: In an integral constant expression "only type
27316 conversions to integral or enumeration type can be used". */
27322 NIC_CONSTRUCTOR))
27325 /* Create a location of the form:
27326 float(i)
27327 ^~~~~~~~
27328 with caret == start at the start of the type name,
27329 finishing at the closing paren. */
27330 location_t finish_loc
27335 }
27337 /* Save the tokens that make up the body of a member function defined
27338 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
27339 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
27340 specifiers applied to the declaration. Returns the FUNCTION_DECL
27341 for the member function. */
27343 static tree
27347 tree attributes)
27348 {
27351 tree fn;
27354 /* Create the FUNCTION_DECL. */
27358 /* If something went badly wrong, bail out now. */
27360 {
27361 /* If there's a function-body, skip it. */
27366 }
27368 /* Remember it, if there default args to post process. */
27371 /* Save away the tokens that make up the body of the
27372 function. */
27378 RID_TRANSACTION_ATOMIC))
27379 {
27381 /* Match cp_parser_txn_attribute_opt [[ identifier ]]. */
27388 {
27394 }
27395 else
27398 {
27402 }
27403 }
27405 /* Handle function try blocks. */
27407 {
27410 }
27411 /* We can have braced-init-list mem-initializers before the fn body. */
27413 {
27416 {
27417 /* cache_group will stop after an un-nested { } pair, too. */
27421 /* variadic mem-inits have ... after the ')'. */
27424 }
27425 }
27427 /* Handle function try blocks. */
27433 /* Save away the inline definition; we will process it when the
27434 class is complete. */
27438 /* We need to know that this was defined in the class, so that
27439 friend templates are handled correctly. */
27442 /* Add FN to the queue of functions to be parsed later. */
27446 }
27448 /* Save the tokens that make up the in-class initializer for a non-static
27449 data member. Returns a DEFAULT_ARG. */
27451 static tree
27453 {
27455 }
27457 /* Parse a template-argument-list, as well as the trailing ">" (but
27458 not the opening "<"). See cp_parser_template_argument_list for the
27459 return value. */
27461 static tree
27463 {
27464 tree arguments;
27465 tree saved_scope;
27466 tree saved_qualifying_scope;
27467 tree saved_object_scope;
27472 /* [temp.names]
27474 When parsing a template-id, the first non-nested `>' is taken as
27475 the end of the template-argument-list rather than a greater-than
27476 operator. */
27477 saved_greater_than_is_operator_p
27480 /* Parsing the argument list may modify SCOPE, so we save it
27481 here. */
27485 /* We need to evaluate the template arguments, even though this
27486 template-id may be nested within a "sizeof". */
27491 /* Parse the template-argument-list itself. */
27495 else
27497 /* Look for the `>' that ends the template-argument-list. If we find
27498 a '>>' instead, it's probably just a typo. */
27500 {
27502 {
27503 /* In C++0x, a `>>' in a template argument list or cast
27504 expression is considered to be two separate `>'
27505 tokens. So, change the current token to a `>', but don't
27506 consume it: it will be consumed later when the outer
27507 template argument list (or cast expression) is parsed.
27508 Note that this replacement of `>' for `>>' is necessary
27509 even if we are parsing tentatively: in the tentative
27510 case, after calling
27511 cp_parser_enclosed_template_argument_list we will always
27512 throw away all of the template arguments and the first
27513 closing `>', either because the template argument list
27514 was erroneous or because we are replacing those tokens
27515 with a CPP_TEMPLATE_ID token. The second `>' (which will
27516 not have been thrown away) is needed either to close an
27517 outer template argument list or to complete a new-style
27518 cast. */
27521 }
27523 {
27524 /* If we're in a nested template argument list, the '>>' has
27525 to be a typo for '> >'. We emit the error message, but we
27526 continue parsing and we push a '>' as next token, so that
27527 the argument list will be parsed correctly. Note that the
27528 global source location is still on the token before the
27529 '>>', so we need to say explicitly where we want it. */
27537 }
27538 else
27539 {
27540 /* If this is not a nested template argument list, the '>>'
27541 is a typo for '>'. Emit an error message and continue.
27542 Same deal about the token location, but here we can get it
27543 right by consuming the '>>' before issuing the diagnostic. */
27546 "spurious %<>>%>, use %<>%> to terminate "
27548 }
27549 }
27550 else
27552 /* The `>' token might be a greater-than operator again now. */
27553 parser->greater_than_is_operator_p
27555 /* Restore the SAVED_SCOPE. */
27563 }
27565 /* MEMBER_FUNCTION is a member function, or a friend. If default
27566 arguments, or the body of the function have not yet been parsed,
27567 parse them now. */
27569 static void
27571 {
27573 /* If this member is a template, get the underlying
27574 FUNCTION_DECL. */
27578 /* There should not be any class definitions in progress at this
27579 point; the bodies of members are only parsed outside of all class
27580 definitions. */
27582 /* While we're parsing the member functions we might encounter more
27583 classes. We want to handle them right away, but we don't want
27584 them getting mixed up with functions that are currently in the
27585 queue. */
27588 /* Make sure that any template parameters are in scope. */
27591 /* If the body of the function has not yet been parsed, parse it
27592 now. */
27594 {
27595 tree function_scope;
27598 /* The function is no longer pending; we are processing it. */
27603 /* If this is a local class, enter the scope of the containing
27604 function. */
27609 /* Push the body of the function onto the lexer stack. */
27612 /* Let the front end know that we going to be defining this
27613 function. */
27617 /* Don't do access checking if it is a templated function. */
27621 /* #pragma omp declare reduction needs special parsing. */
27623 {
27628 }
27629 else
27630 /* Now, parse the body of the function. */
27637 /* Leave the scope of the containing function. */
27641 }
27643 /* Remove any template parameters from the symbol table. */
27646 /* Restore the queue. */
27649 }
27651 /* If DECL contains any default args, remember it on the unparsed
27652 functions queue. */
27654 static void
27656 {
27657 tree probe;
27660 probe;
27663 {
27667 }
27668 }
27670 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
27671 which is either a FIELD_DECL or PARM_DECL. Parse it and return
27672 the result. For a PARM_DECL, PARMTYPE is the corresponding type
27673 from the parameter-type-list. */
27675 static tree
27678 {
27680 tree parsed_arg;
27686 /* Push the saved tokens for the default argument onto the parser's
27687 lexer stack. */
27693 /* Parse the default argument. */
27704 {
27705 /* In a non-template class, check conversions now. In a template,
27706 we'll wait and instantiate these as needed. */
27709 tf_warning_or_error);
27712 else
27714 }
27716 /* If the token stream has not been completely used up, then
27717 there was extra junk after the end of the default
27718 argument. */
27720 {
27723 else
27725 }
27727 /* Revert to the main lexer. */
27731 }
27733 /* FIELD is a non-static data member with an initializer which we saved for
27734 later; parse it now. */
27736 static void
27738 {
27739 tree def;
27746 NULL_TREE);
27752 }
27754 /* FN is a FUNCTION_DECL which may contains a parameter with an
27755 unparsed DEFAULT_ARG. Parse the default args now. This function
27756 assumes that the current scope is the scope in which the default
27757 argument should be processed. */
27759 static void
27761 {
27765 /* While we're parsing the default args, we might (due to the
27766 statement expression extension) encounter more classes. We want
27767 to handle them right away, but we don't want them getting mixed
27768 up with default args that are currently in the queue. */
27771 /* Local variable names (and the `this' keyword) may not appear
27772 in a default argument. */
27783 {
27785 tree parsed_arg;
27787 tree copy;
27794 /* This can happen for a friend declaration for a function
27795 already declared with default arguments. */
27798 parsed_arg
27800 default_arg,
27804 /* Update any instantiations we've already created. */
27808 }
27812 /* Make sure no default arg is missing. */
27815 /* Restore the state of local_variables_forbidden_p. */
27818 /* Restore the queue. */
27820 }
27822 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
27824 sizeof ... ( identifier )
27826 where the 'sizeof' token has already been consumed. */
27828 static tree
27830 {
27831 /* Consume the `...'. */
27835 matching_parens parens;
27839 else
27847 /* The name is not qualified. */
27866 }
27868 /* Parse the operand of `sizeof' (or a similar operator). Returns
27869 either a TYPE or an expression, depending on the form of the
27870 input. The KEYWORD indicates which kind of expression we have
27871 encountered. */
27873 static tree
27875 {
27882 /* If it's a `...', then we are computing the length of a parameter
27883 pack. */
27888 /* Types cannot be defined in a `sizeof' expression. Save away the
27889 old message. */
27891 /* And create the new one. */
27897 /* The restrictions on constant-expressions do not apply inside
27898 sizeof expressions. */
27899 saved_integral_constant_expression_p
27901 saved_non_integral_constant_expression_p
27905 /* Do not actually evaluate the expression. */
27908 /* If it's a `(', then we might be looking at the type-id
27909 construction. */
27911 {
27914 /* We can't be sure yet whether we're looking at a type-id or an
27915 expression. */
27918 matching_parens parens;
27921 /* Note: as a GNU Extension, compound literals are considered
27922 postfix-expressions as they are in C99, so they are valid
27923 arguments to sizeof. See comment in cp_parser_cast_expression
27924 for details. */
27927 else
27928 {
27931 /* Look for the type-id. */
27933 /* Look for the closing `)'. */
27936 }
27938 /* If all went well, then we're done. */
27940 {
27941 cp_decl_specifier_seq decl_specs;
27943 /* Build a trivial decl-specifier-seq. */
27947 /* Call grokdeclarator to figure out what type this is. */
27950 TYPENAME,
27953 }
27954 }
27956 /* If the type-id production did not work out, then we must be
27957 looking at the unary-expression production. */
27961 /* Go back to evaluating expressions. */
27965 /* Free the message we created. */
27967 /* And restore the old one. */
27969 parser->integral_constant_expression_p
27971 parser->non_integral_constant_expression_p
27975 }
27977 /* If the current declaration has no declarator, return true. */
27979 static bool
27981 {
27982 /* If the next token is a `;' or a `,' then there is no
27983 declarator. */
27986 }
27988 /* Update the DECL_SPECS to reflect the storage class indicated by
27989 KEYWORD. */
27991 static void
27996 {
27997 cp_storage_class storage_class;
28000 {
28004 }
28006 {
28009 }
28014 {
28017 }
28020 {
28038 }
28042 /* A storage class specifier cannot be applied alongside a typedef
28043 specifier. If there is a typedef specifier present then set
28044 conflicting_specifiers_p which will trigger an error later
28045 on in grokdeclarator. */
28048 }
28050 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
28051 is true, the type is a class or enum definition. */
28053 static void
28055 tree type_spec,
28058 {
28061 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
28062 (with, for example, in "typedef int wchar_t;") we remember that
28063 this is what happened. In system headers, we ignore these
28064 declarations so that G++ can work with system headers that are not
28065 C++-safe. */
28067 && !type_definition_p
28077 {
28080 ds_redefined_builtin_type_spec,
28081 token);
28083 {
28087 }
28088 }
28091 else
28092 {
28097 }
28098 }
28100 /* True iff TOKEN is the GNU keyword __thread. */
28102 static bool
28104 {
28107 }
28109 /* Set the location for a declarator specifier and check if it is
28110 duplicated.
28112 DECL_SPECS is the sequence of declarator specifiers onto which to
28113 set the location.
28115 DS is the single declarator specifier to set which location is to
28116 be set onto the existing sequence of declarators.
28118 LOCATION is the location for the declarator specifier to
28119 consider. */
28121 static void
28124 {
28133 {
28137 }
28138 else
28139 {
28141 {
28145 else
28146 {
28149 OPT_Wlong_long,
28151 }
28152 }
28154 {
28159 else
28160 {
28164 }
28165 }
28166 else
28167 {
28183 "__complex"
28184 };
28188 }
28189 }
28190 }
28192 /* Return true iff the declarator specifier DS is present in the
28193 sequence of declarator specifiers DECL_SPECS. */
28195 bool
28197 cp_decl_spec ds)
28198 {
28205 }
28207 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
28208 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
28210 static bool
28212 {
28214 }
28216 /* Issue an error message indicating that TOKEN_DESC was expected.
28217 If KEYWORD is true, it indicated this function is called by
28218 cp_parser_require_keword and the required token can only be
28219 a indicated keyword.
28221 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28222 within any error as the location of an "opening" token matching
28223 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28224 RT_CLOSE_PAREN). */
28226 static void
28228 required_token token_desc,
28230 location_t matching_location)
28231 {
28237 {
28306 }
28309 {
28311 {
28389 }
28390 }
28394 }
28397 /* If the next token is of the indicated TYPE, consume it. Otherwise,
28398 issue an error message indicating that TOKEN_DESC was expected.
28400 Returns the token consumed, if the token had the appropriate type.
28401 Otherwise, returns NULL.
28403 If MATCHING_LOCATION is not UNKNOWN_LOCATION, then highlight it
28404 within any error as the location of an "opening" token matching
28405 the close token TYPE (e.g. the location of the '(' when TOKEN_DESC is
28406 RT_CLOSE_PAREN). */
28411 required_token token_desc,
28412 location_t matching_location)
28413 {
28416 else
28417 {
28418 /* Output the MESSAGE -- unless we're parsing tentatively. */
28421 matching_location);
28423 }
28424 }
28426 /* An error message is produced if the next token is not '>'.
28427 All further tokens are skipped until the desired token is
28428 found or '{', '}', ';' or an unbalanced ')' or ']'. */
28430 static void
28432 {
28433 /* Current level of '< ... >'. */
28435 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
28438 /* Are we ready, yet? If not, issue error message. */
28442 /* Skip tokens until the desired token is found. */
28444 {
28445 /* Peek at the next token. */
28447 {
28455 /* C++0x views the `>>' operator as two `>' tokens, but
28456 C++98 does not. */
28459 {
28460 /* We've hit a `>>' where the first `>' closes the
28461 template argument list, and the second `>' is
28462 spurious. Just consume the `>>' and stop; we've
28463 already produced at least one error. */
28466 }
28467 /* Fall through for C++0x, so we handle the second `>' in
28468 the `>>'. */
28473 {
28474 /* We've reached the token we want, consume it and stop. */
28477 }
28496 /* The '>' was probably forgotten, don't look further. */
28501 }
28503 /* Consume this token. */
28505 }
28506 }
28508 /* If the next token is the indicated keyword, consume it. Otherwise,
28509 issue an error message indicating that TOKEN_DESC was expected.
28511 Returns the token consumed, if the token had the appropriate type.
28512 Otherwise, returns NULL. */
28517 required_token token_desc)
28518 {
28522 {
28524 UNKNOWN_LOCATION);
28526 }
28529 }
28531 /* Returns TRUE iff TOKEN is a token that can begin the body of a
28532 function-definition. */
28534 static bool
28536 {
28539 /* A ctor-initializer begins with a `:'. */
28541 /* A function-try-block begins with `try'. */
28543 /* A function-transaction-block begins with `__transaction_atomic'
28544 or `__transaction_relaxed'. */
28547 /* The named return value extension begins with `return'. */
28549 }
28551 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
28552 definition. */
28554 static bool
28556 {
28563 }
28565 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
28566 C++0x) ending a template-argument. */
28568 static bool
28570 {
28578 }
28580 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
28581 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
28583 static bool
28586 {
28592 /* Check for the sequence `<::' in the original code. It would be lexed as
28593 `[:', where `[' is a digraph, and there is no whitespace before
28594 `:'. */
28596 {
28601 }
28603 }
28605 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
28606 or none_type otherwise. */
28608 static enum tag_types
28610 {
28612 {
28622 }
28623 }
28625 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
28626 or none_type otherwise or if the token is null. */
28628 static enum tag_types
28630 {
28635 {
28643 }
28644 }
28646 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
28648 static void
28650 {
28654 {
28658 type))
28661 }
28662 }
28664 /* Issue an error message if DECL is redeclared with different
28665 access than its original declaration [class.access.spec/3].
28666 This applies to nested classes, nested class templates and
28667 enumerations [class.mem/1]. */
28669 static void
28671 {
28682 }
28684 /* Look for the `template' keyword, as a syntactic disambiguator.
28685 Return TRUE iff it is present, in which case it will be
28686 consumed. */
28688 static bool
28690 {
28692 {
28693 /* In C++98 the `template' keyword can only be used within templates;
28694 outside templates the parser can always figure out what is a
28695 template and what is not. In C++11, per the resolution of DR 468,
28696 `template' is allowed in cases where it is not strictly necessary. */
28699 {
28702 "in C++98 %<template%> (as a disambiguator) is only "
28704 /* If this part of the token stream is rescanned, the same
28705 error message would be generated. So, we purge the token
28706 from the stream. */
28709 }
28710 else
28711 {
28712 /* Consume the `template' keyword. */
28715 }
28716 }
28718 }
28720 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
28721 set PARSER->SCOPE, and perform other related actions. */
28723 static void
28725 {
28728 /* Get the stored value. */
28730 /* Set the scope from the stored value. */
28734 }
28736 /* Consume tokens up through a non-nested END token. Returns TRUE if we
28737 encounter the end of a block before what we were looking for. */
28739 static bool
28743 {
28745 {
28748 /* Abort a parenthesized expression if we encounter a semicolon. */
28752 /* If we've reached the end of the file, stop. */
28758 /* We've hit the end of an enclosing block, so there's been some
28759 kind of syntax error. */
28762 /* Consume the token. */
28764 /* See if it starts a new group. */
28766 {
28768 /* In theory this should probably check end == '}', but
28769 cp_parser_save_member_function_body needs it to exit
28770 after either '}' or ')' when called with ')'. */
28773 }
28775 {
28779 }
28784 }
28785 }
28787 /* Like above, for caching a default argument or NSDMI. Both of these are
28788 terminated by a non-nested comma, but it can be unclear whether or not a
28789 comma is nested in a template argument list unless we do more parsing.
28790 In order to handle this ambiguity, when we encounter a ',' after a '<'
28791 we try to parse what follows as a parameter-declaration-list (in the
28792 case of a default argument) or a member-declarator (in the case of an
28793 NSDMI). If that succeeds, then we stop caching. */
28795 static tree
28797 {
28802 tree default_argument;
28804 /* Add tokens until we have processed the entire default
28805 argument. We add the range [first_token, token). */
28808 {
28809 /* For list-initialization, this is straightforward. */
28812 }
28814 {
28817 /* Peek at the next token. */
28819 /* What we do depends on what token we have. */
28821 {
28822 /* In valid code, a default argument must be
28823 immediately followed by a `,' `)', or `...'. */
28826 {
28827 /* If we've seen a '<', we might be in a
28828 template-argument-list. Until Core issue 325 is
28829 resolved, we don't know how this situation ought
28830 to be handled, so try to DTRT. We check whether
28831 what comes after the comma is a valid parameter
28832 declaration list. If it is, then the comma ends
28833 the default argument; otherwise the default
28834 argument continues. */
28838 /* Set ITALP so cp_parser_parameter_declaration_list
28839 doesn't decide to commit to this parse. */
28846 {
28847 /* Parse declarators until we reach a non-comma or
28848 somthing that cannot be an initializer.
28849 Just checking whether we're looking at a single
28850 declarator is insufficient. Consider:
28851 int var = tuple<T,U>::x;
28852 The template parameter 'U' looks exactly like a
28853 declarator. */
28854 do
28855 {
28866 }
28868 /* If we met an '=' or ';' then the original comma
28869 was the end of the NSDMI. Otherwise assume
28870 we're still in the NSDMI. */
28873 }
28874 else
28875 {
28880 }
28887 }
28888 /* FALLTHRU */
28891 /* If we run into a non-nested `;', `}', or `]',
28892 then the code is invalid -- but the default
28893 argument is certainly over. */
28898 /* Handle correctly int n = sizeof ... ( p ); */
28901 /* Update DEPTH, if necessary. */
28916 /* This might be the comparison operator, or it might
28917 start a template argument list. */
28924 /* Fall through for C++0x, which treats the `>>'
28925 operator like two `>' tokens in certain
28926 cases. */
28931 {
28932 /* This might be an operator, or it might close a
28933 template argument list. But if a previous '<'
28934 started a template argument list, this will have
28935 closed it, so we can't be in one anymore. */
28939 }
28942 /* If we run out of tokens, issue an error message. */
28950 /* In these cases, we should look for template-ids.
28951 For example, if the default argument is
28952 `X<int, double>()', we need to do name lookup to
28953 figure out whether or not `X' is a template; if
28954 so, the `,' does not end the default argument.
28956 That is not yet done. */
28961 }
28963 /* If we've reached the end, stop. */
28967 /* Add the token to the token block. */
28969 }
28971 /* Create a DEFAULT_ARG to represent the unparsed default
28972 argument. */
28979 }
28981 /* A location to use for diagnostics about an unparsed DEFAULT_ARG. */
28983 location_t
28985 {
28990 }
28992 /* Begin parsing tentatively. We always save tokens while parsing
28993 tentatively so that if the tentative parsing fails we can restore the
28994 tokens. */
28996 static void
28998 {
28999 /* Enter a new parsing context. */
29001 /* Begin saving tokens. */
29003 /* In order to avoid repetitive access control error messages,
29004 access checks are queued up until we are no longer parsing
29005 tentatively. */
29007 }
29009 /* Commit to the currently active tentative parse. */
29011 static void
29013 {
29017 /* Mark all of the levels as committed. */
29020 {
29027 }
29028 }
29030 /* Commit to the topmost currently active tentative parse.
29032 Note that this function shouldn't be called when there are
29033 irreversible side-effects while in a tentative state. For
29034 example, we shouldn't create a permanent entry in the symbol
29035 table, or issue an error message that might not apply if the
29036 tentative parse is aborted. */
29038 static void
29040 {
29045 {
29053 }
29054 }
29056 /* Abort the currently active tentative parse. All consumed tokens
29057 will be rolled back, and no diagnostics will be issued. */
29059 static void
29061 {
29065 /* Now, pretend that we want to see if the construct was
29066 successfully parsed. */
29068 }
29070 /* Stop parsing tentatively. If a parse error has occurred, restore the
29071 token stream. Otherwise, commit to the tokens we have consumed.
29072 Returns true if no error occurred; false otherwise. */
29074 static bool
29076 {
29080 /* Remember whether or not an error occurred, since we are about to
29081 destroy that information. */
29083 /* Remove the topmost context from the stack. */
29086 /* If no parse errors occurred, commit to the tentative parse. */
29088 {
29089 /* Commit to the tokens read tentatively, unless that was
29090 already done. */
29095 }
29096 /* Otherwise, if errors occurred, roll back our state so that things
29097 are just as they were before we began the tentative parse. */
29098 else
29099 {
29102 }
29103 /* Add the context to the front of the free list. */
29108 }
29110 /* Returns true if we are parsing tentatively and are not committed to
29111 this tentative parse. */
29113 static bool
29115 {
29118 }
29120 /* Returns nonzero iff an error has occurred during the most recent
29121 tentative parse. */
29123 static bool
29125 {
29128 }
29130 /* Returns nonzero if GNU extensions are allowed. */
29132 static bool
29134 {
29136 }
29137 \f
29138 /* Objective-C++ Productions */
29141 /* Parse an Objective-C expression, which feeds into a primary-expression
29142 above.
29144 objc-expression:
29145 objc-message-expression
29146 objc-string-literal
29147 objc-encode-expression
29148 objc-protocol-expression
29149 objc-selector-expression
29151 Returns a tree representation of the expression. */
29153 static cp_expr
29155 {
29156 /* Try to figure out what kind of declaration is present. */
29160 {
29170 {
29182 }
29188 }
29191 }
29193 /* Parse an Objective-C message expression.
29195 objc-message-expression:
29196 [ objc-message-receiver objc-message-args ]
29198 Returns a representation of an Objective-C message. */
29200 static tree
29202 {
29214 /* Construct a location e.g.
29215 [self func1:5]
29216 ^~~~~~~~~~~~~~
29217 ranging from the '[' to the ']', with the caret at the start. */
29222 }
29224 /* Parse an objc-message-receiver.
29226 objc-message-receiver:
29227 expression
29228 simple-type-specifier
29230 Returns a representation of the type or expression. */
29232 static tree
29234 {
29235 tree rcv;
29237 /* An Objective-C message receiver may be either (1) a type
29238 or (2) an expression. */
29242 /* If that worked out, fine. */
29249 CP_PARSER_FLAGS_NONE);
29256 }
29258 /* Parse the arguments and selectors comprising an Objective-C message.
29260 objc-message-args:
29261 objc-selector
29262 objc-selector-args
29263 objc-selector-args , objc-comma-args
29265 objc-selector-args:
29266 objc-selector [opt] : assignment-expression
29267 objc-selector-args objc-selector [opt] : assignment-expression
29269 objc-comma-args:
29270 assignment-expression
29271 objc-comma-args , assignment-expression
29273 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
29274 selector arguments and TREE_VALUE containing a list of comma
29275 arguments. */
29277 static tree
29279 {
29285 {
29291 /* Detect if we have a unary selector. */
29300 sel_args
29305 }
29307 /* Handle non-selector arguments, if any. */
29309 {
29310 tree arg;
29315 addl_args
29320 }
29323 {
29326 }
29329 }
29331 /* Parse an Objective-C encode expression.
29333 objc-encode-expression:
29334 @encode objc-typename
29336 Returns an encoded representation of the type argument. */
29338 static cp_expr
29340 {
29341 tree type;
29346 matching_parens parens;
29353 {
29357 }
29359 /* This happens if we find @encode(T) (where T is a template
29360 typename or something dependent on a template typename) when
29361 parsing a template. In that case, we can't compile it
29362 immediately, but we rather create an AT_ENCODE_EXPR which will
29363 need to be instantiated when the template is used.
29364 */
29366 {
29370 }
29373 /* Build a location of the form:
29374 @encode(int)
29375 ^~~~~~~~~~~~
29376 with caret==start at the @ token, finishing at the close paren. */
29377 location_t combined_loc
29382 }
29384 /* Parse an Objective-C @defs expression. */
29386 static tree
29388 {
29389 tree name;
29392 matching_parens parens;
29398 }
29400 /* Parse an Objective-C protocol expression.
29402 objc-protocol-expression:
29403 @protocol ( identifier )
29405 Returns a representation of the protocol expression. */
29407 static tree
29409 {
29410 tree proto;
29414 matching_parens parens;
29419 /* Build a location of the form:
29420 @protocol(prot)
29421 ^~~~~~~~~~~~~~~
29422 with caret==start at the @ token, finishing at the close paren. */
29423 location_t combined_loc
29429 }
29431 /* Parse an Objective-C selector expression.
29433 objc-selector-expression:
29434 @selector ( objc-method-signature )
29436 objc-method-signature:
29437 objc-selector
29438 objc-selector-seq
29440 objc-selector-seq:
29441 objc-selector :
29442 objc-selector-seq objc-selector :
29444 Returns a representation of the method selector. */
29446 static tree
29448 {
29455 matching_parens parens;
29461 {
29470 {
29471 /* Detect if we have a unary selector. */
29473 {
29476 }
29477 else
29478 {
29480 }
29481 }
29486 {
29487 sel_seq
29490 sel_seq
29493 }
29494 else
29495 sel_seq
29500 }
29502 finish_selector:
29506 /* Build a location of the form:
29507 @selector(func)
29508 ^~~~~~~~~~~~~~~
29509 with caret==start at the @ token, finishing at the close paren. */
29510 location_t combined_loc
29514 /* TODO: objc_build_selector_expr doesn't always honor the location. */
29517 }
29519 /* Parse a list of identifiers.
29521 objc-identifier-list:
29522 identifier
29523 objc-identifier-list , identifier
29525 Returns a TREE_LIST of identifier nodes. */
29527 static tree
29529 {
29530 tree identifier;
29531 tree list;
29542 {
29549 identifier));
29551 }
29554 }
29556 /* Parse an Objective-C alias declaration.
29558 objc-alias-declaration:
29559 @compatibility_alias identifier identifier ;
29561 This function registers the alias mapping with the Objective-C front end.
29562 It returns nothing. */
29564 static void
29566 {
29574 }
29576 /* Parse an Objective-C class forward-declaration.
29578 objc-class-declaration:
29579 @class objc-identifier-list ;
29581 The function registers the forward declarations with the Objective-C
29582 front end. It returns nothing. */
29584 static void
29586 {
29589 {
29590 tree id;
29600 else
29602 }
29604 }
29606 /* Parse a list of Objective-C protocol references.
29608 objc-protocol-refs-opt:
29609 objc-protocol-refs [opt]
29611 objc-protocol-refs:
29612 < objc-identifier-list >
29614 Returns a TREE_LIST of identifiers, if any. */
29616 static tree
29618 {
29622 {
29626 }
29629 }
29631 /* Parse a Objective-C visibility specification. */
29633 static void
29635 {
29639 {
29654 }
29656 /* Eat '@private'/'@protected'/'@public'. */
29658 }
29660 /* Parse an Objective-C method type. Return 'true' if it is a class
29661 (+) method, and 'false' if it is an instance (-) method. */
29665 {
29668 else
29670 }
29672 /* Parse an Objective-C protocol qualifier. */
29674 static tree
29676 {
29689 {
29694 }
29697 }
29699 /* Parse an Objective-C typename. */
29701 static tree
29703 {
29707 {
29710 matching_parens parens;
29714 /* An ObjC type name may consist of just protocol qualifiers, in which
29715 case the type shall default to 'id'. */
29717 {
29720 /* If the type could not be parsed, an error has already
29721 been produced. For error recovery, behave as if it had
29722 not been specified, which will use the default type
29723 'id'. */
29725 {
29727 /* We need to skip to the closing parenthesis as
29728 cp_parser_type_id() does not seem to do it for
29729 us. */
29734 }
29735 }
29739 }
29742 }
29744 /* Check to see if TYPE refers to an Objective-C selector name. */
29746 static bool
29748 {
29754 }
29756 /* Parse an Objective-C selector. */
29758 static tree
29760 {
29764 {
29767 }
29769 /* C++ operator names are allowed to appear in ObjC selectors. */
29771 {
29784 }
29785 }
29787 /* Parse an Objective-C params list. */
29789 static tree
29791 {
29797 {
29807 /* Detect if we have a unary selector. */
29810 {
29813 }
29817 {
29818 /* Something went quite wrong. There should be a colon
29819 here, but there is not. Stop parsing parameters. */
29821 }
29823 /* New ObjC allows attributes on parameters too. */
29828 params
29831 type_name,
29832 identifier,
29833 parm_attr));
29836 }
29839 {
29842 }
29844 /* We allow tail attributes for the method. */
29846 {
29854 }
29857 {
29860 }
29862 }
29864 /* Parse the non-keyword Objective-C params. */
29866 static tree
29869 {
29875 {
29877 tree parm;
29883 {
29888 }
29890 /* TODO: parse attributes for tail parameters. */
29899 }
29901 /* We allow tail attributes for the method. */
29903 {
29905 {
29910 }
29911 else
29912 /* We have an error, but parse the attributes, so that we can
29913 carry on. */
29919 }
29922 }
29924 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
29926 static void
29928 {
29931 /* If the next token is `extern' and the following token is a string
29932 literal, then we have a linkage specification. */
29934 && cp_parser_is_pure_string_literal
29937 /* Handle #pragma, if any. */
29940 /* Allow stray semicolons. */
29943 /* Mark methods as optional or required, when building protocols. */
29945 {
29948 }
29950 {
29953 }
29956 /* Other stray characters must generate errors. */
29958 {
29962 }
29963 /* Finally, try to parse a block-declaration, or a function-definition. */
29964 else
29966 }
29968 /* Parse a method signature. */
29970 static tree
29972 {
29988 }
29990 static bool
29992 {
29993 tree tattr;
29998 /* If the attributes are followed by a method introducer, this is not allowed.
29999 Dump the attributes and flag the situation. */
30004 /* Otherwise, the attributes introduce some interstitial code, possibly so
30005 rewind to allow that check. */
30008 }
30010 /* Parse an Objective-C method prototype list. */
30012 static void
30014 {
30018 {
30020 {
30025 else
30029 {
30033 }
30036 }
30042 OPT_Wattributes,
30044 else
30045 /* Allow for interspersed non-ObjC++ code. */
30049 }
30053 else
30057 }
30059 /* Parse an Objective-C method definition list. */
30061 static void
30063 {
30067 {
30068 tree meth;
30071 {
30077 else
30082 {
30086 }
30088 NULL_TREE);
30090 /* For historical reasons, we accept an optional semicolon. */
30097 {
30104 }
30105 }
30106 /* The following case will be removed once @synthesize is
30107 completely implemented. */
30118 else
30119 /* Allow for interspersed non-ObjC++ code. */
30123 }
30127 else
30131 }
30133 /* Parse Objective-C ivars. */
30135 static void
30137 {
30148 {
30149 cp_decl_specifier_seq declspecs;
30151 tree prefix_attributes;
30159 CP_PARSER_FLAGS_OPTIONAL,
30163 /* auto, register, static, extern, mutable. */
30165 {
30168 }
30170 /* thread_local. */
30172 {
30175 }
30177 /* typedef. */
30179 {
30182 }
30187 /* Keep going until we hit the `;' at the end of the
30188 declaration. */
30190 {
30195 /* Check for a (possibly unnamed) bitfield declaration. */
30203 {
30204 /* Get the name of the bitfield. */
30207 sfk_none);
30209 eat_colon:
30211 /* Get the width of the bitfield. */
30212 width
30214 }
30215 else
30216 {
30217 /* Parse the declarator. */
30218 declarator
30224 }
30226 /* Look for attributes that apply to the ivar. */
30228 /* Remember which attributes are prefix attributes and
30229 which are not. */
30231 /* Combine the attributes. */
30235 /* Create the bitfield declaration. */
30238 else
30243 /* Add the instance variable. */
30247 /* Reset PREFIX_ATTRIBUTES. */
30256 {
30259 }
30261 }
30265 }
30270 /* Do not consume the RID_AT_END, so it will be read again as terminating
30271 the @interface of @implementation. */
30275 /* For historical reasons, we accept an optional semicolon. */
30278 }
30280 /* Parse an Objective-C protocol declaration. */
30282 static void
30284 {
30290 {
30295 }
30297 /* See if we have a forward declaration or a definition. */
30300 /* Try a forward declaration first. */
30302 {
30304 {
30305 tree id;
30315 else
30317 }
30319 }
30321 /* Ok, we got a full-fledged definition (or at least should). */
30322 else
30323 {
30328 }
30329 }
30331 /* Parse an Objective-C superclass or category. */
30333 static void
30338 {
30344 {
30347 }
30349 {
30350 matching_parens parens;
30353 /* If there is no category name, and this is an @interface, we
30354 have a class extension. */
30356 {
30359 }
30360 else
30364 }
30365 }
30367 /* Parse an Objective-C class interface. */
30369 static void
30371 {
30378 {
30379 /* It's hard to recover because even if valid @interface stuff
30380 is to follow, we can't compile it (or validate it) if we
30381 don't even know which class it refers to. Let's assume this
30382 was a stray '@interface' token in the stream and skip it.
30383 */
30385 }
30390 /* We have either a class or a category on our hands. */
30393 else
30394 {
30396 /* Handle instance variable declarations, if any. */
30399 }
30402 }
30404 /* Parse an Objective-C class implementation. */
30406 static void
30408 {
30415 {
30416 /* It's hard to recover because even if valid @implementation
30417 stuff is to follow, we can't compile it (or validate it) if
30418 we don't even know which class it refers to. Let's assume
30419 this was a stray '@implementation' token in the stream and
30420 skip it.
30421 */
30423 }
30427 /* We have either a class or a category on our hands. */
30430 else
30431 {
30433 /* Handle instance variable declarations, if any. */
30436 }
30439 }
30441 /* Consume the @end token and finish off the implementation. */
30443 static void
30445 {
30448 }
30450 /* Parse an Objective-C declaration. */
30452 static void
30454 {
30455 /* Try to figure out what kind of declaration is present. */
30460 {
30476 }
30479 {
30502 }
30503 }
30505 /* Parse an Objective-C try-catch-finally statement.
30507 objc-try-catch-finally-stmt:
30508 @try compound-statement objc-catch-clause-seq [opt]
30509 objc-finally-clause [opt]
30511 objc-catch-clause-seq:
30512 objc-catch-clause objc-catch-clause-seq [opt]
30514 objc-catch-clause:
30515 @catch ( objc-exception-declaration ) compound-statement
30517 objc-finally-clause:
30518 @finally compound-statement
30520 objc-exception-declaration:
30521 parameter-declaration
30522 '...'
30524 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
30526 Returns NULL_TREE.
30528 PS: This function is identical to c_parser_objc_try_catch_finally_statement
30529 for C. Keep them in sync. */
30531 static tree
30533 {
30534 location_t location;
30535 tree stmt;
30540 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
30541 node, lest it get absorbed into the surrounding block. */
30547 {
30551 matching_parens parens;
30557 {
30558 /* We have "@catch (...)" (where the '...' are literally
30559 what is in the code). Skip the '...'.
30560 parameter_declaration is set to NULL_TREE, and
30561 objc_being_catch_clauses() knows that that means
30562 '...'. */
30565 }
30566 else
30567 {
30568 /* We have "@catch (NSException *exception)" or something
30569 like that. Parse the parameter declaration. */
30573 else
30578 }
30581 else
30582 {
30583 /* If there was no open parenthesis, we are recovering from
30584 an error, and we are trying to figure out what mistake
30585 the user has made. */
30587 /* If there is an immediate closing parenthesis, the user
30588 probably forgot the opening one (ie, they typed "@catch
30589 NSException *e)". Parse the closing parenthesis and keep
30590 going. */
30594 /* If these is no immediate closing parenthesis, the user
30595 probably doesn't know that parenthesis are required at
30596 all (ie, they typed "@catch NSException *e"). So, just
30597 forget about the closing parenthesis and keep going. */
30598 }
30602 }
30604 {
30607 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
30608 node, lest it get absorbed into the surrounding block. */
30612 }
30615 }
30617 /* Parse an Objective-C synchronized statement.
30619 objc-synchronized-stmt:
30620 @synchronized ( expression ) compound-statement
30622 Returns NULL_TREE. */
30624 static tree
30626 {
30627 location_t location;
30634 matching_parens parens;
30639 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
30640 node, lest it get absorbed into the surrounding block. */
30645 }
30647 /* Parse an Objective-C throw statement.
30649 objc-throw-stmt:
30650 @throw assignment-expression [opt] ;
30652 Returns a constructed '@throw' statement. */
30654 static tree
30656 {
30668 }
30670 /* Parse an Objective-C statement. */
30672 static tree
30674 {
30675 /* Try to figure out what kind of declaration is present. */
30679 {
30690 }
30693 }
30695 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
30696 look ahead to see if an objc keyword follows the attributes. This
30697 is to detect the use of prefix attributes on ObjC @interface and
30698 @protocol. */
30700 static bool
30702 {
30707 {
30710 }
30713 }
30715 /* This routine is a minimal replacement for
30716 c_parser_struct_declaration () used when parsing the list of
30717 types/names or ObjC++ properties. For example, when parsing the
30718 code
30720 @property (readonly) int a, b, c;
30722 this function is responsible for parsing "int a, int b, int c" and
30723 returning the declarations as CHAIN of DECLs.
30725 TODO: Share this code with cp_parser_objc_class_ivars. It's very
30726 similar parsing. */
30727 static tree
30729 {
30731 cp_decl_specifier_seq declspecs;
30733 tree prefix_attributes;
30736 CP_PARSER_FLAGS_NONE,
30743 /* auto, register, static, extern, mutable. */
30745 {
30748 }
30750 /* thread_local. */
30752 {
30755 }
30757 /* typedef. */
30759 {
30762 }
30767 /* Keep going until we hit the `;' at the end of the declaration. */
30769 {
30774 /* Parse the declarator. */
30778 /* Look for attributes that apply to the ivar. */
30780 /* Remember which attributes are prefix attributes and
30781 which are not. */
30783 /* Combine the attributes. */
30793 /* Reset PREFIX_ATTRIBUTES. */
30804 {
30807 }
30808 else
30810 }
30812 }
30814 /* Parse an Objective-C @property declaration. The syntax is:
30816 objc-property-declaration:
30817 '@property' objc-property-attributes[opt] struct-declaration ;
30819 objc-property-attributes:
30820 '(' objc-property-attribute-list ')'
30822 objc-property-attribute-list:
30823 objc-property-attribute
30824 objc-property-attribute-list, objc-property-attribute
30826 objc-property-attribute
30827 'getter' = identifier
30828 'setter' = identifier
30829 'readonly'
30830 'readwrite'
30831 'assign'
30832 'retain'
30833 'copy'
30834 'nonatomic'
30836 For example:
30837 @property NSString *name;
30838 @property (readonly) id object;
30839 @property (retain, nonatomic, getter=getTheName) id name;
30840 @property int a, b, c;
30842 PS: This function is identical to
30843 c_parser_objc_at_property_declaration for C. Keep them in sync. */
30844 static void
30846 {
30847 /* The following variables hold the attributes of the properties as
30848 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
30849 seen. When we see an attribute, we set them to 'true' (if they
30850 are boolean properties) or to the identifier (if they have an
30851 argument, ie, for getter and setter). Note that here we only
30852 parse the list of attributes, check the syntax and accumulate the
30853 attributes that we find. objc_add_property_declaration() will
30854 then process the information. */
30864 /* 'properties' is the list of properties that we read. Usually a
30865 single one, but maybe more (eg, in "@property int a, b, c;" there
30866 are three). */
30867 tree properties;
30868 location_t loc;
30874 /* Parse the optional attribute list... */
30876 {
30877 /* Eat the '('. */
30878 matching_parens parens;
30882 {
30888 {
30891 }
30895 {
30906 {
30910 else
30915 }
30918 {
30922 }
30924 {
30926 {
30929 }
30930 else
30934 else
30936 }
30937 else
30938 {
30940 {
30943 }
30944 else
30946 }
30952 }
30959 else
30961 }
30963 /* FIXME: "@property (setter, assign);" will generate a spurious
30964 "error: expected ‘)’ before ‘,’ token". This is because
30965 cp_parser_require, unlike the C counterpart, will produce an
30966 error even if we are in error recovery. */
30968 {
30973 }
30974 }
30976 /* ... and the property declaration(s). */
30980 {
30982 /* If the next token is now a `;', consume it. */
30986 }
30990 else
30991 {
30992 /* Comma-separated properties are chained together in
30993 reverse order; add them one by one. */
31002 }
31005 }
31007 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
31009 objc-synthesize-declaration:
31010 @synthesize objc-synthesize-identifier-list ;
31012 objc-synthesize-identifier-list:
31013 objc-synthesize-identifier
31014 objc-synthesize-identifier-list, objc-synthesize-identifier
31016 objc-synthesize-identifier
31017 identifier
31018 identifier = identifier
31020 For example:
31021 @synthesize MyProperty;
31022 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
31024 PS: This function is identical to c_parser_objc_at_synthesize_declaration
31025 for C. Keep them in sync.
31026 */
31027 static void
31029 {
31031 location_t loc;
31036 {
31040 {
31043 }
31045 {
31049 {
31052 }
31053 }
31054 else
31059 else
31061 }
31064 }
31066 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
31068 objc-dynamic-declaration:
31069 @dynamic identifier-list ;
31071 For example:
31072 @dynamic MyProperty;
31073 @dynamic MyProperty, AnotherProperty;
31075 PS: This function is identical to c_parser_objc_at_dynamic_declaration
31076 for C. Keep them in sync.
31077 */
31078 static void
31080 {
31082 location_t loc;
31087 {
31088 tree property;
31091 {
31094 }
31098 else
31100 }
31103 }
31105 \f
31106 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
31108 /* Returns name of the next clause.
31109 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
31110 the token is not consumed. Otherwise appropriate pragma_omp_clause is
31111 returned and the token is consumed. */
31113 static pragma_omp_clause
31115 {
31131 {
31136 {
31319 }
31320 }
31326 }
31328 /* Validate that a clause of the given type does not already exist. */
31330 static void
31333 {
31334 tree c;
31338 {
31341 }
31342 }
31344 /* OpenMP 2.5:
31345 variable-list:
31346 identifier
31347 variable-list , identifier
31349 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
31350 colon). An opening parenthesis will have been consumed by the caller.
31352 If KIND is nonzero, create the appropriate node and install the decl
31353 in OMP_CLAUSE_DECL and add the node to the head of the list.
31355 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
31356 return the list created.
31358 COLON can be NULL if only closing parenthesis should end the list,
31359 or pointer to bool which will receive false if the list is terminated
31360 by closing parenthesis or true if the list is terminated by colon. */
31362 static tree
31365 {
31369 {
31372 }
31374 {
31379 && current_class_ptr
31381 {
31387 }
31388 else
31389 {
31402 }
31404 ;
31406 {
31408 {
31410 /* The OpenACC cache directive explicitly only allows "array
31411 elements or subarrays". */
31413 {
31417 }
31418 /* FALLTHROUGH. */
31423 {
31424 location_t loc
31429 decl
31433 }
31434 /* FALLTHROUGH. */
31438 {
31446 parser->colon_corrects_to_scope_p
31450 else
31451 {
31452 /* Look for `:'. */
31456 CPP_CLOSE_SQUARE))
31458 }
31459 /* Look for the closing `]'. */
31461 RT_CLOSE_SQUARE))
31465 }
31469 }
31475 }
31476 else
31479 get_comma:
31483 }
31489 {
31493 }
31496 {
31499 /* Try to resync to an unnested comma. Copied from
31500 cp_parser_parenthesized_expression_list. */
31501 skip_comma:
31510 }
31513 }
31515 /* Similarly, but expect leading and trailing parenthesis. This is a very
31516 common case for omp clauses. */
31518 static tree
31520 {
31524 }
31526 /* OpenACC 2.0:
31527 copy ( variable-list )
31528 copyin ( variable-list )
31529 copyout ( variable-list )
31530 create ( variable-list )
31531 delete ( variable-list )
31532 present ( variable-list )
31533 present_or_copy ( variable-list )
31534 pcopy ( variable-list )
31535 present_or_copyin ( variable-list )
31536 pcopyin ( variable-list )
31537 present_or_copyout ( variable-list )
31538 pcopyout ( variable-list )
31539 present_or_create ( variable-list )
31540 pcreate ( variable-list ) */
31542 static tree
31544 tree list)
31545 {
31548 {
31594 }
31602 }
31604 /* OpenACC 2.0:
31605 deviceptr ( variable-list ) */
31607 static tree
31609 {
31613 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
31614 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
31615 variable-list must only allow for pointer variables. */
31618 {
31625 }
31628 }
31630 /* OpenACC 2.0:
31631 auto
31632 independent
31633 nohost
31634 seq */
31636 static tree
31640 {
31645 }
31647 /* OpenACC:
31648 num_gangs ( expression )
31649 num_workers ( expression )
31650 vector_length ( expression ) */
31652 static tree
31655 {
31658 matching_parens parens;
31666 {
31671 }
31679 }
31681 /* OpenACC:
31683 gang [( gang-arg-list )]
31684 worker [( [num:] int-expr )]
31685 vector [( [length:] int-expr )]
31687 where gang-arg is one of:
31689 [num:] int-expr
31690 static: size-expr
31692 and size-expr may be:
31694 *
31695 int-expr
31696 */
31698 static tree
31701 {
31711 {
31712 matching_parens parens;
31715 do
31716 {
31720 /* Gang static argument. */
31723 {
31731 {
31734 }
31736 /* Check for the '*' argument. */
31740 CPP_CLOSE_PAREN)))
31741 {
31746 {
31749 }
31751 }
31752 }
31753 /* Worker num: argument and vector length: arguments. */
31757 {
31760 }
31762 /* Now collect the actual argument. */
31764 {
31767 }
31779 {
31782 }
31784 }
31789 }
31803 cleanup_error:
31806 }
31808 /* OpenACC 2.0:
31809 tile ( size-expr-list ) */
31811 static tree
31813 {
31817 /* Collapse and tile are mutually exclusive. (The spec doesn't say
31818 so, but the spec authors never considered such a case and have
31819 differing opinions on what it might mean, including 'not
31820 allowed'.) */
31823 clause_loc);
31828 do
31829 {
31836 {
31839 }
31840 else
31844 }
31847 /* Consume the trailing ')'. */
31855 }
31857 /* OpenACC 2.0
31858 Parse wait clause or directive parameters. */
31860 static tree
31862 {
31872 {
31877 }
31884 {
31888 {
31891 else
31892 {
31899 }
31900 }
31901 }
31904 }
31906 /* OpenACC:
31907 wait ( int-expr-list ) */
31909 static tree
31911 {
31920 }
31922 /* OpenMP 3.0:
31923 collapse ( constant-expression ) */
31925 static tree
31927 {
31929 location_t loc;
31930 HOST_WIDE_INT n;
31933 matching_parens parens;
31951 {
31954 }
31963 }
31965 /* OpenMP 2.5:
31966 default ( none | shared )
31968 OpenACC:
31969 default ( none | present ) */
31971 static tree
31974 {
31976 tree c;
31978 matching_parens parens;
31982 {
31987 {
32008 }
32011 }
32012 else
32013 {
32014 invalid_kind:
32017 else
32019 }
32036 }
32038 /* OpenMP 3.1:
32039 final ( expression ) */
32041 static tree
32043 {
32046 matching_parens parens;
32065 }
32067 /* OpenMP 2.5:
32068 if ( expression )
32070 OpenMP 4.5:
32071 if ( directive-name-modifier : expression )
32073 directive-name-modifier:
32074 parallel | task | taskloop | target data | target | target update
32075 | target enter data | target exit data */
32077 static tree
32080 {
32084 matching_parens parens;
32089 {
32101 {
32104 {
32117 else
32118 {
32119 location_t loc
32124 }
32127 {
32129 {
32134 }
32136 {
32137 location_t loc
32141 }
32142 }
32143 }
32144 }
32146 {
32148 {
32151 }
32152 else
32153 {
32155 {
32156 location_t loc
32159 }
32161 }
32162 }
32163 }
32175 {
32178 {
32181 {
32191 }
32193 p);
32195 }
32197 {
32200 else
32203 }
32206 {
32210 }
32211 }
32219 }
32221 /* OpenMP 3.1:
32222 mergeable */
32224 static tree
32227 {
32228 tree c;
32231 location);
32236 }
32238 /* OpenMP 2.5:
32239 nowait */
32241 static tree
32244 {
32245 tree c;
32252 }
32254 /* OpenMP 2.5:
32255 num_threads ( expression ) */
32257 static tree
32259 location_t location)
32260 {
32263 matching_parens parens;
32283 }
32285 /* OpenMP 4.5:
32286 num_tasks ( expression ) */
32288 static tree
32290 location_t location)
32291 {
32294 matching_parens parens;
32314 }
32316 /* OpenMP 4.5:
32317 grainsize ( expression ) */
32319 static tree
32321 location_t location)
32322 {
32325 matching_parens parens;
32345 }
32347 /* OpenMP 4.5:
32348 priority ( expression ) */
32350 static tree
32352 location_t location)
32353 {
32356 matching_parens parens;
32376 }
32378 /* OpenMP 4.5:
32379 hint ( expression ) */
32381 static tree
32383 location_t location)
32384 {
32387 matching_parens parens;
32406 }
32408 /* OpenMP 4.5:
32409 defaultmap ( tofrom : scalar ) */
32411 static tree
32413 location_t location)
32414 {
32418 matching_parens parens;
32423 {
32426 }
32430 {
32433 }
32439 {
32442 }
32446 {
32449 }
32455 location);
32461 out_err:
32466 }
32468 /* OpenMP 2.5:
32469 ordered
32471 OpenMP 4.5:
32472 ordered ( constant-expression ) */
32474 static tree
32477 {
32479 HOST_WIDE_INT n;
32485 {
32486 matching_parens parens;
32503 {
32505 "ordered argument needs positive constant integer "
32508 }
32509 }
32515 }
32517 /* OpenMP 2.5:
32518 reduction ( reduction-operator : variable-list )
32520 reduction-operator:
32521 One of: + * - & ^ | && ||
32523 OpenMP 3.1:
32525 reduction-operator:
32526 One of: + * - & ^ | && || min max
32528 OpenMP 4.0:
32530 reduction-operator:
32531 One of: + * - & ^ | && ||
32532 id-expression */
32534 static tree
32536 {
32544 {
32554 }
32558 else
32559 {
32570 {
32600 }
32601 else
32602 {
32604 resync_fail:
32609 }
32610 }
32616 NULL);
32618 {
32621 }
32624 }
32626 /* OpenMP 2.5:
32627 schedule ( schedule-kind )
32628 schedule ( schedule-kind , expression )
32630 schedule-kind:
32631 static | dynamic | guided | runtime | auto
32633 OpenMP 4.5:
32634 schedule ( schedule-modifier : schedule-kind )
32635 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
32637 schedule-modifier:
32638 simd
32639 monotonic
32640 nonmonotonic */
32642 static tree
32644 {
32648 matching_parens parens;
32655 {
32664 else
32670 else
32671 {
32674 }
32675 }
32678 {
32683 {
32704 }
32705 }
32710 else
32716 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
32718 {
32722 }
32725 {
32740 else
32745 }
32757 invalid_kind:
32759 resync_fail:
32764 }
32766 /* OpenMP 3.0:
32767 untied */
32769 static tree
32772 {
32773 tree c;
32780 }
32782 /* OpenMP 4.0:
32783 inbranch
32784 notinbranch */
32786 static tree
32789 {
32794 }
32796 /* OpenMP 4.0:
32797 parallel
32798 for
32799 sections
32800 taskgroup */
32802 static tree
32806 {
32810 }
32812 /* OpenMP 4.5:
32813 nogroup */
32815 static tree
32818 {
32823 }
32825 /* OpenMP 4.5:
32826 simd
32827 threads */
32829 static tree
32833 {
32838 }
32840 /* OpenMP 4.0:
32841 num_teams ( expression ) */
32843 static tree
32845 location_t location)
32846 {
32849 matching_parens parens;
32869 }
32871 /* OpenMP 4.0:
32872 thread_limit ( expression ) */
32874 static tree
32876 location_t location)
32877 {
32880 matching_parens parens;
32900 }
32902 /* OpenMP 4.0:
32903 aligned ( variable-list )
32904 aligned ( variable-list : constant-expression ) */
32906 static tree
32908 {
32912 matching_parens parens;
32920 {
32930 }
32936 }
32938 /* OpenMP 4.0:
32939 linear ( variable-list )
32940 linear ( variable-list : expression )
32942 OpenMP 4.5:
32943 linear ( modifier ( variable-list ) )
32944 linear ( modifier ( variable-list ) : expression ) */
32946 static tree
32949 {
32954 matching_parens parens;
32960 {
32972 else
32974 }
32979 else
32980 {
32989 }
32992 {
32997 {
33008 {
33011 }
33014 }
33019 {
33022 }
33030 }
33033 {
33036 }
33039 }
33041 /* OpenMP 4.0:
33042 safelen ( constant-expression ) */
33044 static tree
33046 location_t location)
33047 {
33050 matching_parens parens;
33069 }
33071 /* OpenMP 4.0:
33072 simdlen ( constant-expression ) */
33074 static tree
33076 location_t location)
33077 {
33080 matching_parens parens;
33099 }
33101 /* OpenMP 4.5:
33102 vec:
33103 identifier [+/- integer]
33104 vec , identifier [+/- integer]
33105 */
33107 static tree
33109 tree list)
33110 {
33114 {
33117 }
33120 {
33127 else
33128 {
33129 t = cp_parser_lookup_name_simple
33134 id_loc);
33135 }
33141 {
33144 }
33148 {
33151 }
33155 {
33158 }
33161 add_to_vector:
33163 {
33167 }
33173 }
33176 {
33182 }
33184 }
33186 /* OpenMP 4.0:
33187 depend ( depend-kind : variable-list )
33189 depend-kind:
33190 in | out | inout
33192 OpenMP 4.5:
33193 depend ( source )
33195 depend ( sink : vec ) */
33197 static tree
33199 {
33203 matching_parens parens;
33208 {
33222 else
33224 }
33225 else
33231 {
33241 }
33248 else
33249 {
33255 }
33258 invalid_kind:
33260 resync_fail:
33265 }
33267 /* OpenMP 4.0:
33268 map ( map-kind : variable-list )
33269 map ( variable-list )
33271 map-kind:
33272 alloc | to | from | tofrom
33274 OpenMP 4.5:
33275 map-kind:
33276 alloc | to | from | tofrom | release | delete
33278 map ( always [,] map-kind: variable-list ) */
33280 static tree
33282 {
33291 {
33296 {
33299 nth++;
33305 {
33310 }
33311 }
33312 }
33316 {
33330 else
33331 {
33337 }
33340 }
33343 {
33347 }
33350 NULL);
33356 }
33358 /* OpenMP 4.0:
33359 device ( expression ) */
33361 static tree
33363 location_t location)
33364 {
33367 matching_parens parens;
33387 }
33389 /* OpenMP 4.0:
33390 dist_schedule ( static )
33391 dist_schedule ( static , expression ) */
33393 static tree
33395 location_t location)
33396 {
33399 matching_parens parens;
33410 {
33421 }
33426 location);
33430 invalid_kind:
33432 resync_fail:
33437 }
33439 /* OpenMP 4.0:
33440 proc_bind ( proc-bind-kind )
33442 proc-bind-kind:
33443 master | close | spread */
33445 static tree
33447 location_t location)
33448 {
33449 tree c;
33456 {
33466 else
33468 }
33469 else
33478 location);
33483 invalid_kind:
33485 resync_fail:
33490 }
33492 /* OpenACC:
33493 async [( int-expr )] */
33495 static tree
33497 {
33504 {
33505 matching_parens parens;
33514 }
33524 }
33526 /* Parse all OpenACC clauses. The set clauses allowed by the directive
33527 is a bitmask in MASK. Return the list of clauses found. */
33529 static tree
33533 {
33538 {
33539 location_t here;
33540 pragma_omp_clause c_kind;
33541 omp_clause_code code;
33552 {
33604 clauses);
33622 OMP_CLAUSE_INDEPENDENT,
33634 clauses);
33640 clauses);
33664 clauses);
33686 clauses);
33698 clauses);
33712 }
33717 {
33718 /* Remove the invalid clause(s) from the list to avoid
33719 confusing the rest of the compiler. */
33722 }
33723 }
33725 saw_error:
33732 }
33734 /* Parse all OpenMP clauses. The set clauses allowed by the directive
33735 is a bitmask in MASK. Return the list of clauses found; the result
33736 of clause default goes in *pdefault. */
33738 static tree
33742 {
33748 {
33749 pragma_omp_clause c_kind;
33760 {
33772 clauses);
33786 clauses);
33806 clauses);
33811 clauses);
33821 clauses);
33855 clauses);
33869 clauses);
33886 OMP_CLAUSE_NOTINBRANCH,
33895 {
33896 clause_not_first:
33900 }
33930 clauses);
33931 else
33941 clauses);
33959 {
33967 }
34010 clauses
34016 clauses
34028 }
34033 {
34034 /* Remove the invalid clause(s) from the list to avoid
34035 confusing the rest of the compiler. */
34038 }
34039 }
34040 saw_error:
34041 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
34042 no reason to skip to the end. */
34046 {
34049 else
34051 }
34053 }
34055 /* OpenMP 2.5:
34056 structured-block:
34057 statement
34059 In practice, we're also interested in adding the statement to an
34060 outer node. So it is convenient if we work around the fact that
34061 cp_parser_statement calls add_stmt. */
34063 static unsigned
34065 {
34068 /* Only move the values to IN_OMP_BLOCK if they weren't false.
34069 This preserves the "not within loop or switch" style error messages
34070 for nonsense cases like
34071 void foo() {
34072 #pragma omp single
34073 break;
34074 }
34075 */
34080 }
34082 static void
34084 {
34086 }
34088 static tree
34090 {
34098 }
34100 /* OpenMP 2.5:
34101 # pragma omp atomic new-line
34102 expression-stmt
34104 expression-stmt:
34105 x binop= expr | x++ | ++x | x-- | --x
34106 binop:
34107 +, *, -, /, &, ^, |, <<, >>
34109 where x is an lvalue expression with scalar type.
34111 OpenMP 3.1:
34112 # pragma omp atomic new-line
34113 update-stmt
34115 # pragma omp atomic read new-line
34116 read-stmt
34118 # pragma omp atomic write new-line
34119 write-stmt
34121 # pragma omp atomic update new-line
34122 update-stmt
34124 # pragma omp atomic capture new-line
34125 capture-stmt
34127 # pragma omp atomic capture new-line
34128 capture-block
34130 read-stmt:
34131 v = x
34132 write-stmt:
34133 x = expr
34134 update-stmt:
34135 expression-stmt | x = x binop expr
34136 capture-stmt:
34137 v = expression-stmt
34138 capture-block:
34139 { v = x; update-stmt; } | { update-stmt; v = x; }
34141 OpenMP 4.0:
34142 update-stmt:
34143 expression-stmt | x = x binop expr | x = expr binop x
34144 capture-stmt:
34145 v = update-stmt
34146 capture-block:
34147 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
34149 where x and v are lvalue expressions with scalar type. */
34151 static void
34153 {
34161 {
34166 {
34172 }
34173 }
34175 {
34187 else
34191 }
34193 {
34199 {
34204 {
34207 }
34208 }
34209 }
34213 {
34223 else
34228 {
34229 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
34230 opcode. */
34235 }
34239 {
34242 }
34243 else
34244 {
34250 }
34253 }
34255 restart:
34259 {
34266 /* FALLTHROUGH */
34276 /* FALLTHROUGH */
34291 /* Undo effects of boolean_increment for post {in,de}crement. */
34293 /* FALLTHRU */
34297 {
34298 /* Undo effects of boolean_increment. */
34300 {
34301 /* This is pre or post increment. */
34306 && !structured_block
34310 }
34311 }
34312 /* FALLTHRU */
34315 {
34350 {
34354 }
34357 {
34363 {
34368 }
34370 {
34382 {
34384 {
34389 }
34390 else
34392 }
34396 }
34399 {
34406 }
34410 }
34414 {
34417 {
34425 }
34427 {
34432 }
34467 }
34478 /* FALLTHROUGH */
34483 }
34490 }
34491 stmt_done:
34493 {
34504 }
34506 {
34509 }
34510 done:
34516 saw_error:
34519 {
34523 {
34527 }
34528 }
34529 }
34532 /* OpenMP 2.5:
34533 # pragma omp barrier new-line */
34535 static void
34537 {
34540 }
34542 /* OpenMP 2.5:
34543 # pragma omp critical [(name)] new-line
34544 structured-block
34546 OpenMP 4.5:
34547 # pragma omp critical [(name) [hint(expression)]] new-line
34548 structured-block */
34550 #define OMP_CRITICAL_CLAUSE_MASK \
34551 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
34553 static tree
34555 {
34559 {
34560 matching_parens parens;
34574 OMP_CRITICAL_CLAUSE_MASK,
34576 }
34577 else
34582 }
34584 /* OpenMP 2.5:
34585 # pragma omp flush flush-vars[opt] new-line
34587 flush-vars:
34588 ( variable-list ) */
34590 static void
34592 {
34598 }
34600 /* Helper function, to parse omp for increment expression. */
34602 static tree
34604 {
34609 {
34612 }
34615 {
34624 /* Fall through: OpenMP disallows NE_EXPR. */
34628 }
34630 /* If decl is an iterator, preserve LHS and RHS of the relational
34631 expr until finish_omp_for. */
34642 }
34644 /* Helper function, to parse omp for increment expression. */
34646 static tree
34648 {
34652 cp_id_kind idk;
34656 {
34665 }
34674 {
34679 }
34686 {
34690 }
34703 do
34704 {
34711 {
34713 {
34716 else
34718 tf_warning_or_error);
34719 }
34720 else
34723 }
34724 }
34728 {
34734 }
34735 else
34739 }
34741 /* Parse the initialization statement of either an OpenMP for loop or
34742 a Cilk Plus for loop.
34744 Return true if the resulting construct should have an
34745 OMP_CLAUSE_PRIVATE added to it. */
34747 static tree
34756 {
34762 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
34764 init-expr:
34765 var = lb
34766 integer-type var = lb
34767 random-access-iterator-type var = lb
34768 pointer-type var = lb
34769 */
34770 cp_decl_specifier_seq type_specifiers;
34772 /* First, try to parse as an initialized declaration. See
34773 cp_parser_condition, from whence the bulk of this is copied. */
34780 {
34781 /* If parsing a type specifier seq succeeded, then this
34782 MUST be a initialized declaration. */
34787 CP_PARSER_DECLARATOR_NAMED,
34798 else
34799 {
34809 {
34811 CPP_OPEN_PAREN))
34812 {
34816 else
34819 }
34820 else
34821 /* Trigger an error. */
34826 }
34830 {
34838 {
34841 auto_node);
34846 }
34849 asm_specification,
34850 LOOKUP_ONLYCONVERTING);
34853 {
34856 }
34857 else
34858 {
34861 {
34863 /* Move lambda DECL_EXPRs to FOR_BLOCK. */
34865 {
34869 {
34873 }
34875 }
34877 {
34882 }
34883 }
34884 }
34886 }
34887 else
34888 {
34889 /* Consume '='. */
34893 non_class:
34896 else
34899 asm_specification,
34900 LOOKUP_ONLYCONVERTING);
34901 }
34905 }
34906 }
34907 else
34908 {
34909 cp_id_kind idk;
34910 /* If parsing a type specifier sequence failed, then
34911 this MUST be a simple expression. */
34920 && decl
34923 {
34934 {
34939 }
34944 }
34946 && decl
34949 {
34950 tree rhs;
34958 rhs,
34959 tf_warning_or_error));
34962 }
34963 else
34964 {
34969 {
34973 }
34974 }
34975 }
34977 }
34979 /* Parse the restricted form of the for statement allowed by OpenMP. */
34981 static tree
34984 {
34988 location_t loc_first;
34999 {
35002 }
35005 {
35008 }
35011 {
35017 }
35019 {
35022 {
35024 "%<linear%> clause may not be specified together "
35027 }
35028 else
35030 }
35043 {
35046 location_t loc;
35050 {
35054 }
35057 {
35061 }
35064 matching_parens parens;
35071 add_private_clause
35078 {
35081 {
35087 }
35088 else
35090 }
35097 {
35102 {
35106 }
35109 {
35110 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
35114 {
35117 }
35118 else
35119 {
35122 }
35124 }
35125 else
35126 {
35131 }
35132 }
35135 {
35136 tree c;
35138 {
35147 decl);
35151 decl);
35152 }
35154 {
35159 else
35164 {
35167 /* For linear, signal that we need to fill up
35168 the so far unknown linear step. */
35171 }
35172 }
35173 }
35182 {
35183 /* If decl is an iterator, preserve the operator on decl
35184 until finish_omp_for. */
35186 && ((processing_template_decl
35191 else
35195 }
35207 {
35210 }
35215 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
35216 in between the collapsed for loops to be still considered perfectly
35217 nested. Hopefully the final version clarifies this.
35218 For now handle (multiple) {'s and empty statements. */
35221 {
35225 {
35227 bracecount++;
35228 }
35232 else
35233 {
35240 }
35241 }
35244 {
35247 }
35248 }
35253 /* Note that we saved the original contents of this flag when we entered
35254 the structured block, and so we don't need to re-save it here. */
35257 else
35260 /* Note that the grammar doesn't call for a structured block here,
35261 though the loop as a whole is a structured block. */
35268 else
35273 {
35275 {
35277 nbraces--;
35278 }
35281 else
35282 {
35284 {
35287 }
35292 }
35293 }
35296 {
35300 else
35302 }
35306 }
35308 /* Helper function for OpenMP parsing, split clauses and call
35309 finish_omp_clauses on each of the set of clauses afterwards. */
35311 static void
35314 {
35320 }
35322 /* OpenMP 4.0:
35323 #pragma omp simd simd-clause[optseq] new-line
35324 for-loop */
35326 #define OMP_SIMD_CLAUSE_MASK \
35327 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
35328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35336 static tree
35340 {
35351 {
35355 OMP_CLAUSE_ORDERED);
35357 {
35359 "%<ordered%> clause with parameter may not be specified "
35362 }
35363 }
35374 }
35376 /* OpenMP 2.5:
35377 #pragma omp for for-clause[optseq] new-line
35378 for-loop
35380 OpenMP 4.0:
35381 #pragma omp for simd for-simd-clause[optseq] new-line
35382 for-loop */
35384 #define OMP_FOR_CLAUSE_MASK \
35385 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
35391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
35392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
35393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35395 static tree
35399 {
35406 /* parallel for{, simd} disallows nowait clause, but for
35407 target {teams distribute ,}parallel for{, simd} it should be accepted. */
35410 /* Composite distribute parallel for{, simd} disallows ordered clause. */
35415 {
35420 {
35444 }
35445 }
35447 {
35450 }
35452 /* Composite distribute parallel for disallows linear clause. */
35459 {
35462 }
35473 }
35475 /* OpenMP 2.5:
35476 # pragma omp master new-line
35477 structured-block */
35479 static tree
35481 {
35485 }
35487 /* OpenMP 2.5:
35488 # pragma omp ordered new-line
35489 structured-block
35491 OpenMP 4.5:
35492 # pragma omp ordered ordered-clauses new-line
35493 structured-block */
35495 #define OMP_ORDERED_CLAUSE_MASK \
35496 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
35497 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
35499 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
35500 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
35502 static bool
35505 {
35509 {
35514 {
35516 {
35519 }
35521 {
35523 "%<depend%> clause may only be used in compound "
35527 }
35528 tree clauses
35530 OMP_ORDERED_DEPEND_CLAUSE_MASK,
35534 }
35535 }
35537 tree clauses
35548 }
35550 /* OpenMP 2.5:
35552 section-scope:
35553 { section-sequence }
35555 section-sequence:
35556 section-directive[opt] structured-block
35557 section-sequence section-directive structured-block */
35559 static tree
35561 {
35566 matching_braces braces;
35574 {
35578 }
35581 {
35589 {
35593 }
35595 {
35598 }
35603 }
35614 }
35616 /* OpenMP 2.5:
35617 # pragma omp sections sections-clause[optseq] newline
35618 sections-scope */
35620 #define OMP_SECTIONS_CLAUSE_MASK \
35621 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35624 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35625 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35627 static tree
35630 {
35642 {
35645 }
35652 }
35654 /* OpenMP 2.5:
35655 # pragma omp parallel parallel-clause[optseq] new-line
35656 structured-block
35657 # pragma omp parallel for parallel-for-clause[optseq] new-line
35658 structured-block
35659 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
35660 structured-block
35662 OpenMP 4.0:
35663 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
35664 structured-block */
35666 #define OMP_PARALLEL_CLAUSE_MASK \
35667 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35668 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
35673 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
35674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
35675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
35677 static tree
35681 {
35688 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
35694 {
35702 if_p);
35706 if_p);
35709 block);
35714 }
35715 /* When combined with distribute, parallel has to be followed by for.
35716 #pragma omp target parallel is allowed though. */
35720 {
35724 }
35726 {
35729 }
35731 {
35735 {
35745 block);
35748 }
35749 }
35754 {
35757 }
35765 }
35767 /* OpenMP 2.5:
35768 # pragma omp single single-clause[optseq] new-line
35769 structured-block */
35771 #define OMP_SINGLE_CLAUSE_MASK \
35772 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35774 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
35775 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
35777 static tree
35779 {
35789 }
35791 /* OpenMP 3.0:
35792 # pragma omp task task-clause[optseq] new-line
35793 structured-block */
35795 #define OMP_TASK_CLAUSE_MASK \
35796 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
35797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
35798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
35799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
35802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
35803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
35804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
35805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
35807 static tree
35809 {
35820 }
35822 /* OpenMP 3.0:
35823 # pragma omp taskwait new-line */
35825 static void
35827 {
35830 }
35832 /* OpenMP 3.1:
35833 # pragma omp taskyield new-line */
35835 static void
35837 {
35840 }
35842 /* OpenMP 4.0:
35843 # pragma omp taskgroup new-line
35844 structured-block */
35846 static tree
35848 {
35852 if_p));
35853 }
35856 /* OpenMP 2.5:
35857 # pragma omp threadprivate (variable-list) */
35859 static void
35861 {
35862 tree vars;
35868 }
35870 /* OpenMP 4.0:
35871 # pragma omp cancel cancel-clause[optseq] new-line */
35873 #define OMP_CANCEL_CLAUSE_MASK \
35874 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
35878 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
35880 static void
35882 {
35886 }
35888 /* OpenMP 4.0:
35889 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
35891 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
35892 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
35893 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
35894 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
35895 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
35897 static void
35900 {
35901 tree clauses;
35905 {
35910 {
35913 }
35914 }
35916 {
35920 }
35923 {
35928 else
35932 }
35935 OMP_CANCELLATION_POINT_CLAUSE_MASK,
35937 pragma_tok);
35939 }
35941 /* OpenMP 4.0:
35942 #pragma omp distribute distribute-clause[optseq] new-line
35943 for-loop */
35945 #define OMP_DISTRIBUTE_CLAUSE_MASK \
35946 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
35947 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
35948 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
35949 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
35950 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
35952 static tree
35956 {
35965 {
35973 else
35976 {
35982 {
35986 else
35989 }
35995 else
36009 }
36010 }
36012 {
36015 }
36020 {
36023 }
36034 }
36036 /* OpenMP 4.0:
36037 # pragma omp teams teams-clause[optseq] new-line
36038 structured-block */
36040 #define OMP_TEAMS_CLAUSE_MASK \
36041 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36042 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
36045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
36046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
36047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
36049 static tree
36053 {
36062 {
36066 {
36091 }
36092 }
36094 {
36097 }
36102 {
36105 }
36114 }
36116 /* OpenMP 4.0:
36117 # pragma omp target data target-data-clause[optseq] new-line
36118 structured-block */
36120 #define OMP_TARGET_DATA_CLAUSE_MASK \
36121 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36124 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
36126 static tree
36128 {
36129 tree clauses
36134 {
36137 {
36154 "%<#pragma omp target data%> with map-type other "
36155 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36159 }
36161 }
36164 {
36167 "%<#pragma omp target data%> must contain at least "
36170 }
36181 }
36183 /* OpenMP 4.5:
36184 # pragma omp target enter data target-enter-data-clause[optseq] new-line
36185 structured-block */
36187 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
36188 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36194 static tree
36197 {
36200 {
36205 {
36208 }
36209 }
36211 {
36215 }
36218 {
36224 }
36226 tree clauses
36231 {
36234 {
36247 "%<#pragma omp target enter data%> with map-type other "
36251 }
36253 }
36256 {
36259 "%<#pragma omp target enter data%> must contain at least "
36262 }
36269 }
36271 /* OpenMP 4.5:
36272 # pragma omp target exit data target-enter-data-clause[optseq] new-line
36273 structured-block */
36275 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
36276 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36279 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36282 static tree
36285 {
36288 {
36293 {
36296 }
36297 }
36299 {
36303 }
36306 {
36312 }
36314 tree clauses
36319 {
36322 {
36336 "%<#pragma omp target exit data%> with map-type other "
36337 "than %<from%>, %<release%> or %<delete%> on %<map%>"
36341 }
36343 }
36346 {
36349 "%<#pragma omp target exit data%> must contain at least "
36352 }
36359 }
36361 /* OpenMP 4.0:
36362 # pragma omp target update target-update-clause[optseq] new-line */
36364 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
36365 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
36366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
36367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
36372 static bool
36375 {
36377 {
36383 }
36385 tree clauses
36390 {
36392 "%<#pragma omp target update%> must contain at least one "
36395 }
36403 }
36405 /* OpenMP 4.0:
36406 # pragma omp target target-clause[optseq] new-line
36407 structured-block */
36409 #define OMP_TARGET_CLAUSE_MASK \
36410 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
36411 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
36412 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36413 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
36414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
36415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
36418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
36420 static bool
36423 {
36427 {
36439 {
36447 {
36448 tree stmt;
36450 {
36453 OMP_TARGET_CLAUSE_MASK,
36458 OMP_TARGET_CLAUSE_MASK,
36463 OMP_TARGET_CLAUSE_MASK,
36468 }
36470 }
36475 {
36479 if_p);
36484 if_p);
36489 if_p);
36493 }
36499 {
36500 /* For combined target teams, ensure the num_teams and
36501 thread_limit clause expressions are evaluated on the host,
36502 before entering the target construct. */
36503 tree c;
36509 {
36518 OMP_CLAUSE_FIRSTPRIVATE);
36523 }
36524 }
36534 }
36536 {
36539 }
36541 {
36545 }
36547 {
36551 }
36553 {
36557 }
36559 {
36562 }
36563 }
36565 {
36568 }
36583 check_clauses:
36585 {
36588 {
36602 "%<#pragma omp target%> with map-type other "
36603 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
36607 }
36609 }
36611 }
36613 /* OpenACC 2.0:
36614 # pragma acc cache (variable-list) new-line
36615 */
36617 static tree
36619 {
36634 }
36636 /* OpenACC 2.0:
36637 # pragma acc data oacc-data-clause[optseq] new-line
36638 structured-block */
36640 #define OACC_DATA_CLAUSE_MASK \
36641 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36642 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36643 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36653 static tree
36655 {
36668 }
36670 /* OpenACC 2.0:
36671 # pragma acc host_data <clauses> new-line
36672 structured-block */
36674 #define OACC_HOST_DATA_CLAUSE_MASK \
36675 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
36677 static tree
36679 {
36692 }
36694 /* OpenACC 2.0:
36695 # pragma acc declare oacc-data-clause[optseq] new-line
36696 */
36698 #define OACC_DECLARE_CLAUSE_MASK \
36699 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36700 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36701 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36702 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36704 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
36705 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
36706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
36712 static tree
36714 {
36723 {
36727 }
36730 {
36734 {
36738 }
36741 {
36753 {
36755 "%qD must be a global variable in "
36757 decl);
36760 }
36765 {
36769 }
36771 {
36773 "invalid use of %<extern%> variable %qD "
36777 }
36779 {
36781 "invalid use of %<global%> variable %qD "
36785 }
36787 }
36792 {
36797 }
36800 {
36801 tree id;
36805 else
36811 {
36814 {
36817 {
36821 }
36822 }
36823 }
36824 }
36825 }
36838 }
36840 /* OpenACC 2.0:
36841 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
36843 or
36845 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
36847 LOC is the location of the #pragma token.
36848 */
36850 #define OACC_ENTER_DATA_CLAUSE_MASK \
36851 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36859 #define OACC_EXIT_DATA_CLAUSE_MASK \
36860 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36863 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
36864 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36866 static tree
36869 {
36878 {
36883 }
36890 else
36895 {
36899 }
36907 }
36909 /* OpenACC 2.0:
36910 # pragma acc loop oacc-loop-clause[optseq] new-line
36911 structured-block */
36913 #define OACC_LOOP_CLAUSE_MASK \
36914 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
36915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
36916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
36917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36920 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
36921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
36922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
36923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
36925 static tree
36928 {
36937 {
36943 }
36952 }
36954 /* OpenACC 2.0:
36955 # pragma acc kernels oacc-kernels-clause[optseq] new-line
36956 structured-block
36958 or
36960 # pragma acc parallel oacc-parallel-clause[optseq] new-line
36961 structured-block
36962 */
36964 #define OACC_KERNELS_CLAUSE_MASK \
36965 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36966 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36967 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36968 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36976 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36977 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36978 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36979 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
36980 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
36981 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
36983 #define OACC_PARALLEL_CLAUSE_MASK \
36984 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
36985 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
36986 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
36987 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
36988 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
36989 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
36990 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
36991 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
36992 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
36993 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
36994 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
36995 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
36996 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
36997 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
36998 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
36999 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
37000 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
37001 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
37002 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
37003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
37005 static tree
37008 {
37009 omp_clause_mask mask;
37012 {
37025 }
37028 {
37032 {
37035 tree clauses;
37037 if_p);
37039 }
37040 }
37049 }
37051 /* OpenACC 2.0:
37052 # pragma acc update oacc-update-clause[optseq] new-line
37053 */
37055 #define OACC_UPDATE_CLAUSE_MASK \
37056 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
37057 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
37058 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
37059 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
37060 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
37061 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
37063 static tree
37065 {
37072 {
37074 "%<#pragma acc update%> must contain at least one "
37077 }
37085 }
37087 /* OpenACC 2.0:
37088 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
37090 LOC is the location of the #pragma token.
37091 */
37093 #define OACC_WAIT_CLAUSE_MASK \
37094 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
37096 static tree
37098 {
37112 }
37114 /* OpenMP 4.0:
37115 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
37117 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
37118 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
37119 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
37120 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
37121 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
37122 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
37123 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
37125 static void
37128 {
37130 cp_omp_declare_simd_data data;
37132 {
37137 /* It is safe to take the address of a local variable; it will only be
37138 used while this scope is live. */
37140 }
37142 /* Store away all pragma tokens. */
37154 {
37158 {
37171 }
37176 "%<#pragma omp declare simd%> not immediately followed by "
37180 }
37181 }
37183 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
37184 This function is modelled similar to the late parsing of omp declare
37185 simd. */
37187 static tree
37189 {
37196 {
37198 "used in the same function marked as a Cilk Plus SIMD-enabled "
37204 }
37206 {
37210 }
37215 {
37222 NULL);
37236 }
37242 }
37244 /* Finalize #pragma omp declare simd clauses after direct declarator has
37245 been parsed, and put that into "omp declare simd" attribute. */
37247 static tree
37249 {
37255 {
37259 }
37264 {
37282 }
37286 }
37289 /* OpenMP 4.0:
37290 # pragma omp declare target new-line
37291 declarations and definitions
37292 # pragma omp end declare target new-line
37294 OpenMP 4.5:
37295 # pragma omp declare target ( extended-list ) new-line
37297 # pragma omp declare target declare-target-clauses[seq] new-line */
37299 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
37300 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
37301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
37303 static void
37305 {
37308 clauses
37312 {
37314 clauses);
37317 }
37318 else
37319 {
37323 }
37326 "%<#pragma omp declare target%> with clauses in between "
37327 "%<#pragma omp declare target%> without clauses and "
37330 {
37336 {
37339 }
37340 else
37343 {
37345 "%qD specified both in declare target %<link%> and %<to%>"
37348 }
37350 {
37357 {
37360 {
37364 }
37365 }
37366 }
37367 }
37368 }
37370 static void
37372 {
37375 {
37378 }
37380 {
37384 {
37387 }
37390 else
37391 {
37395 }
37396 }
37397 else
37398 {
37402 }
37406 "%<#pragma omp end declare target%> without corresponding "
37408 else
37410 }
37412 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
37413 expression and optional initializer clause of
37414 #pragma omp declare reduction. We store the expression(s) as
37415 either 3, 6 or 7 special statements inside of the artificial function's
37416 body. The first two statements are DECL_EXPRs for the artificial
37417 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
37418 expression that uses those variables.
37419 If there was any INITIALIZER clause, this is followed by further statements,
37420 the fourth and fifth statements are DECL_EXPRs for the artificial
37421 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
37422 constructor variant (first token after open paren is not omp_priv),
37423 then the sixth statement is a statement with the function call expression
37424 that uses the OMP_PRIV and optionally OMP_ORIG variable.
37425 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
37426 to initialize the OMP_PRIV artificial variable and there is seventh
37427 statement, a DECL_EXPR of the OMP_PRIV statement again. */
37429 static bool
37431 {
37443 tree combiner;
37458 {
37461 }
37464 {
37466 matching_parens parens;
37472 {
37475 }
37491 {
37495 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
37499 == CPP_CLOSE_PAREN
37502 {
37506 }
37511 }
37512 else
37513 {
37529 {
37534 }
37536 tree arg;
37549 }
37560 }
37564 UNKNOWN_LOCATION);
37567 }
37569 /* OpenMP 4.0
37570 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37571 initializer-clause[opt] new-line
37573 initializer-clause:
37574 initializer (omp_priv initializer)
37575 initializer (function-name (argument-list)) */
37577 static void
37580 {
37590 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
37597 {
37629 }
37641 /* Types may not be defined in declare reduction type list. */
37644 parser->type_definition_forbidden_message
37650 saved_colon_doesnt_start_class_def_p
37655 {
37659 ;
37678 else
37683 else
37685 }
37687 /* Restore the saved message. */
37690 parser->colon_doesnt_start_class_def_p
37695 {
37696 fail:
37699 }
37705 {
37706 tree fntype
37709 NULL_TREE);
37729 {
37734 }
37736 {
37738 {
37747 }
37754 }
37755 else
37756 {
37759 }
37762 else
37765 {
37768 }
37770 {
37773 else
37778 }
37783 else
37784 {
37793 }
37800 }
37804 done:
37805 /* Free any declarators allocated. */
37807 }
37809 /* OpenMP 4.0
37810 #pragma omp declare simd declare-simd-clauses[optseq] new-line
37811 #pragma omp declare reduction (reduction-id : typename-list : expression) \
37812 initializer-clause[opt] new-line
37813 #pragma omp declare target new-line */
37815 static void
37818 {
37820 {
37825 {
37828 context);
37830 }
37833 {
37836 context);
37838 }
37840 {
37843 }
37845 {
37849 }
37850 }
37854 }
37856 /* OpenMP 4.5:
37857 #pragma omp taskloop taskloop-clause[optseq] new-line
37858 for-loop
37860 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
37861 for-loop */
37863 #define OMP_TASKLOOP_CLAUSE_MASK \
37864 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
37865 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
37866 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
37867 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
37868 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
37869 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
37870 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
37871 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
37872 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
37873 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
37874 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
37875 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
37876 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
37877 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
37879 static tree
37883 {
37892 {
37897 {
37921 }
37922 }
37924 {
37927 }
37932 {
37935 }
37941 if_p);
37947 }
37950 /* OpenACC 2.0:
37951 # pragma acc routine oacc-routine-clause[optseq] new-line
37952 function-definition
37954 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
37955 */
37957 #define OACC_ROUTINE_CLAUSE_MASK \
37958 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
37959 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
37960 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
37961 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
37964 /* Parse the OpenACC routine pragma. This has an optional '( name )'
37965 component, which must resolve to a declared namespace-scope
37966 function. The clauses are either processed directly (for a named
37967 function), or defered until the immediatley following declaration
37968 is parsed. */
37970 static void
37973 {
37975 /* The checking for "another pragma following this one" in the "no optional
37976 '( name )'" case makes sure that we dont re-enter. */
37979 cp_oacc_routine_data data;
37985 /* It is safe to take the address of a local variable; it will only be
37986 used while this scope is live. */
37989 /* Look for optional '( name )'. */
37991 {
37992 matching_parens parens;
37995 /* We parse the name as an id-expression. If it resolves to
37996 anything other than a non-overloaded function at namespace
37997 scope, it's an error. */
38011 {
38015 }
38017 data.clauses
38025 {
38030 }
38032 /* Perhaps we should use the same rule as declarations in different
38033 namespaces? */
38035 {
38040 }
38043 {
38047 }
38051 }
38053 {
38054 /* Store away all pragma tokens. */
38065 /* Emit a helpful diagnostic if there's another pragma following this
38066 one. */
38068 {
38071 /* ..., and then just keep going. */
38073 }
38075 /* We only have to consider the pragma_external case here. */
38080 else
38083 }
38084 }
38086 /* Finalize #pragma acc routine clauses after direct declarator has
38087 been parsed. */
38089 static tree
38091 {
38096 {
38098 "%<#pragma acc routine%> not immediately followed by "
38101 }
38118 /* Later, cp_finalize_oacc_routine will process the clauses, and then set
38119 fndecl_seen. */
38122 }
38124 /* Apply any saved OpenACC routine clauses to a just-parsed
38125 declaration. */
38127 static void
38129 {
38131 {
38132 /* Keep going if we're in error reporting mode. */
38138 {
38140 "%<#pragma acc routine%> not immediately followed by"
38144 }
38146 {
38149 }
38152 {
38157 }
38160 {
38168 }
38170 /* Process the routine's dimension clauses. */
38174 /* Add an "omp declare target" attribute. */
38179 /* Don't unset parser->oacc_routine here: we may still need it to
38180 diagnose wrong usage. But, remember that we've used this "#pragma acc
38181 routine". */
38183 }
38184 }
38186 /* Main entry point to OpenMP statement pragmas. */
38188 static void
38190 {
38191 tree stmt;
38196 {
38219 if_p);
38224 if_p);
38241 if_p);
38246 if_p);
38254 if_p);
38263 if_p);
38277 if_p);
38282 if_p);
38286 }
38289 }
38290 \f
38291 /* Transactional Memory parsing routines. */
38293 /* Parse a transaction attribute.
38295 txn-attribute:
38296 attribute
38297 [ [ identifier ] ]
38299 We use this instead of cp_parser_attributes_opt for transactions to avoid
38300 the pedwarn in C++98 mode. */
38302 static tree
38304 {
38319 {
38323 /* For keywords, use the canonical spelling,
38324 not the parsed identifier. */
38328 }
38329 else
38333 error1:
38336 }
38338 /* Parse a __transaction_atomic or __transaction_relaxed statement.
38340 transaction-statement:
38341 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
38342 compound-statement
38343 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
38344 */
38346 static tree
38348 {
38359 else
38360 {
38364 }
38366 /* Parse a noexcept specification. */
38370 {
38371 /* cancel-and-throw is unimplemented. */
38374 }
38375 else
38378 /* Keep track if we're in the lexical scope of an outer transaction. */
38390 }
38392 /* Parse a __transaction_atomic or __transaction_relaxed expression.
38394 transaction-expression:
38395 __transaction_atomic txn-noexcept-spec[opt] ( expression )
38396 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
38397 */
38399 static tree
38401 {
38414 keyword == RID_TRANSACTION_RELAXED
38428 /* Set this early. This might mean that we allow transaction_cancel in
38429 an expression that we find out later actually has to be a constexpr.
38430 However, we expect that cxx_constant_value will be able to deal with
38431 this; also, if the noexcept has no constexpr, then what we parse next
38432 really is a transaction's body. */
38435 /* Parse a noexcept specification. */
38441 {
38442 matching_parens parens;
38449 }
38450 else
38451 {
38452 /* The only expression that is available got parsed for the noexcept
38453 already. noexcept is true then. */
38456 }
38465 }
38467 /* Parse a function-transaction-block.
38469 function-transaction-block:
38470 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
38471 function-body
38472 __transaction_atomic txn-attribute[opt] function-try-block
38473 __transaction_relaxed ctor-initializer[opt] function-body
38474 __transaction_relaxed function-try-block
38475 */
38477 static void
38479 {
38494 else
38495 {
38499 }
38507 else
38508 cp_parser_ctor_initializer_opt_and_function_body
38514 }
38516 /* Parse a __transaction_cancel statement.
38518 cancel-statement:
38519 __transaction_cancel txn-attribute[opt] ;
38520 __transaction_cancel txn-attribute[opt] throw-expression ;
38522 ??? Cancel and throw is not yet implemented. */
38524 static tree
38526 {
38532 RT_TRANSACTION_CANCEL);
38539 /* ??? Parse cancel-and-throw here. */
38544 {
38548 }
38550 {
38554 }
38556 {
38559 {
38565 }
38566 }
38568 {
38572 }
38578 }
38579 \f
38580 /* The parser. */
38584 \f
38585 /* Special handling for the first token or line in the file. The first
38586 thing in the file might be #pragma GCC pch_preprocess, which loads a
38587 PCH file, which is a GC collection point. So we need to handle this
38588 first pragma without benefit of an existing lexer structure.
38590 Always returns one token to the caller in *FIRST_TOKEN. This is
38591 either the true first token of the file, or the first token after
38592 the initial pragma. */
38594 static void
38596 {
38605 {
38612 }
38613 else
38616 /* Skip to the end of the pragma. */
38620 /* Now actually load the PCH file. */
38624 /* Read one more token to return to our caller. We have to do this
38625 after reading the PCH file in, since its pointers have to be
38626 live. */
38628 }
38630 /* Parses the grainsize pragma for the _Cilk_for statement.
38631 Syntax:
38632 #pragma cilk grainsize = <VALUE>. */
38634 static void
38636 {
38638 {
38643 {
38646 }
38648 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
38651 else
38653 "%<#pragma cilk grainsize%> is not followed by "
38656 }
38658 }
38660 /* Normal parsing of a pragma token. Here we can (and must) use the
38661 regular lexer. */
38663 static bool
38665 {
38668 tree stmt;
38679 {
38687 {
38697 }
38702 {
38712 }
38717 {
38728 }
38733 {
38744 }
38749 {
38760 }
38781 {
38786 }
38794 {
38799 }
38807 {
38811 }
38817 {
38822 }
38830 {
38835 }
38890 "%<#pragma omp section%> may only be used in "
38895 {
38897 {
38901 }
38908 {
38911 }
38914 }
38918 {
38922 }
38930 {
38934 }
38936 /* Ignore the pragma if Cilk Plus is not enabled. */
38938 {
38941 }
38942 else
38943 {
38947 }
38954 bad_stmt:
38957 }
38961 }
38963 /* The interface the pragma parsers have to the lexer. */
38965 enum cpp_ttype
38967 {
38979 else
38980 {
38984 }
38987 }
38989 \f
38990 /* External interface. */
38992 /* Parse one entire translation unit. */
38994 void
38996 {
39009 }
39011 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
39012 vectorlength clause:
39013 Syntax:
39014 vectorlength ( constant-expression ) */
39016 static tree
39019 {
39021 tree expr;
39022 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
39023 safelen clause. Thus, vectorlength is represented as OMP 4.0
39024 safelen. For SIMD-enabled function it is represented by OMP 4.0
39025 simdlen. */
39028 loc);
39029 else
39031 loc);
39033 matching_parens parens;
39040 /* If expr == error_mark_node, then don't emit any errors nor
39041 create a clause. if any of the above functions returns
39042 error mark node then they would have emitted an error message. */
39044 ;
39052 else
39053 {
39054 tree c;
39056 {
39061 }
39062 else
39063 {
39068 }
39069 }
39074 }
39076 /* Handles the Cilk Plus #pragma simd linear clause.
39077 Syntax:
39078 linear ( simd-linear-variable-list )
39080 simd-linear-variable-list:
39081 simd-linear-variable
39082 simd-linear-variable-list , simd-linear-variable
39084 simd-linear-variable:
39085 id-expression
39086 id-expression : simd-linear-step
39088 simd-linear-step:
39089 conditional-expression */
39091 static tree
39093 {
39099 {
39103 }
39108 {
39111 {
39115 }
39122 {
39126 }
39127 else
39128 {
39132 /* If present, parse the linear step. Otherwise, assume the default
39133 value of 1. */
39135 {
39142 {
39143 /* If an error has occurred, then the whole pragma is
39144 considered ill-formed. Thus, no reason to keep
39145 parsing. */
39148 }
39156 else
39158 "step size must be an integer constant "
39160 }
39162 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
39168 }
39173 else
39174 {
39179 }
39180 }
39184 }
39186 /* Returns the name of the next clause. If the clause is not
39187 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
39188 token is not consumed. Otherwise, the appropriate enum from the
39189 pragma_simd_clause is returned and the token is consumed. */
39191 static pragma_omp_clause
39193 {
39194 pragma_omp_clause clause_type;
39211 else
39216 }
39218 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
39220 static tree
39222 {
39227 {
39228 pragma_omp_clause c_kind;
39235 /* Use the OpenMP 4.0 equivalent function. */
39238 /* Use the OpenMP 4.0 equivalent function. */
39240 clauses);
39242 /* Use the OMP 4.0 equivalent function. */
39244 clauses);
39246 /* Use the OMP 4.0 equivalent function. */
39248 else
39249 {
39253 }
39254 }
39260 else
39262 }
39264 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
39266 static void
39268 {
39275 {
39279 }
39288 }
39290 /* Main entry-point for parsing Cilk Plus _Cilk_for
39291 loops. The return value is error_mark_node
39292 when errors happen and CILK_FOR tree on success. */
39294 static tree
39296 {
39311 else
39317 }
39319 /* Create an identifier for a generic parameter type (a synthesized
39320 template parameter implied by `auto' or a concept identifier). */
39323 static tree
39325 {
39329 }
39331 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
39332 (creating a new template parameter list if necessary). Returns the newly
39333 created template type parm. */
39335 static tree
39337 {
39340 /* Before committing to modifying any scope, if we're in an
39341 implicit template scope, and we're trying to synthesize a
39342 constrained parameter, try to find a previous parameter with
39343 the same name. This is the same-type rule for abbreviated
39344 function templates.
39346 NOTE: We can generate implicit parameters when tentatively
39347 parsing a nested name specifier, only to reject that parse
39348 later. However, matching the same template-id as part of a
39349 direct-declarator should generate an identical template
39350 parameter, so this rule will merge them. */
39352 {
39355 {
39357 {
39360 /* Return the TEMPLATE_PARM_INDEX. */
39363 }
39365 }
39366 }
39368 /* We are either continuing a function template that already contains implicit
39369 template parameters, creating a new fully-implicit function template, or
39370 extending an existing explicit function template with implicit template
39371 parameters. */
39379 {
39383 }
39384 else
39385 {
39386 /* Roll back to the existing template parameter scope (in the case of
39387 extending an explicit function template) or introduce a new template
39388 parameter scope ahead of the function parameter scope (or class scope
39389 in the case of out-of-line member definitions). The function scope is
39390 added back after template parameter synthesis below. */
39395 {
39398 }
39400 {
39401 /* If not defining a class, then any class scope is a scope level in
39402 an out-of-line member definition. In this case simply wind back
39403 beyond the first such scope to inject the template parameter list.
39404 Otherwise wind back to the class being defined. The latter can
39405 occur in class member friend declarations such as:
39407 class A {
39408 void foo (auto);
39409 };
39410 class B {
39411 friend void A::foo (auto);
39412 };
39414 The template parameter list synthesized for the friend declaration
39415 must be injected in the scope of 'B'. This can also occur in
39416 erroneous cases such as:
39418 struct A {
39419 struct B {
39420 void foo (auto);
39421 };
39422 void B::foo (auto) {}
39423 };
39425 Here the attempted definition of 'B::foo' within 'A' is ill-formed
39426 but, nevertheless, the template parameter list synthesized for the
39427 declarator should be injected into the scope of 'A' as if the
39428 ill-formed template was specified explicitly. */
39431 {
39434 }
39435 }
39441 {
39442 /* Introduce a new template parameter list for implicit template
39443 parameters. */
39447 parser->implicit_template_scope
39454 }
39455 else
39456 {
39457 /* Synthesize implicit template parameters at the end of the explicit
39458 template parameter list. */
39465 parser->implicit_template_parms
39467 }
39468 }
39470 /* Synthesize a new template parameter and track the current template
39471 parameter chain with implicit_template_parms. */
39475 tree synth_tmpl_parm;
39479 synth_tmpl_parm
39482 synth_tmpl_parm
39484 else
39485 {
39489 }
39491 // Attach the constraint to the parm before processing.
39494 tree new_parm
39496 input_location,
39497 node,
39501 // Chain the new parameter to the list of implicit parameters.
39503 parser->implicit_template_parms
39505 else
39510 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
39513 /* If creating a fully implicit function template, start the new implicit
39514 template parameter list with this synthesized type, otherwise grow the
39515 current template parameter list. */
39518 {
39525 }
39526 else
39527 {
39532 }
39534 // If the new parameter was constrained, we need to add that to the
39535 // constraints in the template parameter list.
39537 {
39541 }
39546 }
39548 /* Finish the declaration of a fully implicit function template. Such a
39549 template has no explicit template parameter list so has not been through the
39550 normal template head and tail processing. synthesize_implicit_template_parm
39551 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
39552 provided if the declaration is a class member such that its template
39553 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
39554 form is returned. Otherwise NULL_TREE is returned. */
39556 static tree
39558 {
39563 {
39567 }
39577 }
39579 /* Helper function for diagnostics that have complained about things
39580 being used with 'extern "C"' linkage.
39582 Attempt to issue a note showing where the 'extern "C"' linkage began. */
39584 void
39586 {
39590 }