| blob | 6f47edf9bd0abec6d22406e185716cc1d35640a5 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2016 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/>. */
43 \f
44 /* The lexer. */
46 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
47 and c-lex.c) and the C++ parser. */
50 {
52 };
54 /* The various kinds of non integral constant we encounter. */
56 NIC_NONE,
57 /* floating-point literal */
58 NIC_FLOAT,
59 /* %<this%> */
60 NIC_THIS,
61 /* %<__FUNCTION__%> */
62 NIC_FUNC_NAME,
63 /* %<__PRETTY_FUNCTION__%> */
64 NIC_PRETTY_FUNC,
65 /* %<__func__%> */
66 NIC_C99_FUNC,
67 /* "%<va_arg%> */
68 NIC_VA_ARG,
69 /* a cast */
70 NIC_CAST,
71 /* %<typeid%> operator */
72 NIC_TYPEID,
73 /* non-constant compound literals */
74 NIC_NCC,
75 /* a function call */
76 NIC_FUNC_CALL,
77 /* an increment */
78 NIC_INC,
79 /* an decrement */
80 NIC_DEC,
81 /* an array reference */
82 NIC_ARRAY_REF,
83 /* %<->%> */
84 NIC_ARROW,
85 /* %<.%> */
86 NIC_POINT,
87 /* the address of a label */
88 NIC_ADDR_LABEL,
89 /* %<*%> */
90 NIC_STAR,
91 /* %<&%> */
92 NIC_ADDR,
93 /* %<++%> */
94 NIC_PREINCREMENT,
95 /* %<--%> */
96 NIC_PREDECREMENT,
97 /* %<new%> */
98 NIC_NEW,
99 /* %<delete%> */
100 NIC_DEL,
101 /* calls to overloaded operators */
102 NIC_OVERLOADED,
103 /* an assignment */
104 NIC_ASSIGNMENT,
105 /* a comma operator */
106 NIC_COMMA,
107 /* a call to a constructor */
108 NIC_CONSTRUCTOR,
109 /* a transaction expression */
110 NIC_TRANSACTION
111 };
113 /* The various kinds of errors about name-lookup failing. */
115 /* NULL */
116 NLE_NULL,
117 /* is not a type */
118 NLE_TYPE,
119 /* is not a class or namespace */
120 NLE_CXX98,
121 /* is not a class, namespace, or enumeration */
122 NLE_NOT_CXX98
123 };
125 /* The various kinds of required token */
127 RT_NONE,
149 /* The type is CPP_KEYWORD */
178 RT_TRANSACTION_CANCEL /* __transaction_cancel */
179 };
181 /* RAII wrapper for parser->in_type_id_in_expr_p, setting it on creation and
182 reverting it on destruction. */
184 class type_id_in_expr_sentinel
185 {
195 };
197 /* Prototypes. */
203 static void cp_lexer_destroy
205 static int cp_lexer_saving_tokens
209 static void cp_lexer_get_preprocessor_token
217 static bool cp_lexer_next_token_is_not
219 static bool cp_lexer_next_token_is_keyword
223 static void cp_lexer_purge_token
225 static void cp_lexer_purge_tokens_after
227 static void cp_lexer_save_tokens
229 static void cp_lexer_commit_tokens
231 static void cp_lexer_rollback_tokens
233 static void cp_lexer_print_token
237 static void cp_lexer_start_debugging
239 static void cp_lexer_stop_debugging
245 static void cp_parser_initial_pragma
248 static tree cp_literal_operator_id
251 static void cp_parser_cilk_simd
253 static tree cp_parser_cilk_for
255 static bool cp_parser_omp_declare_reduction_exprs
257 static tree cp_parser_cilk_simd_vectorlength
259 static void cp_finalize_oacc_routine
262 /* Manifest constants. */
263 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
264 #define CP_SAVED_TOKEN_STACK 5
266 /* Variables. */
268 /* The stream to which debugging output should be written. */
271 /* Nonzero if we are parsing an unevaluated operand: an operand to
272 sizeof, typeof, or alignof. */
275 /* Dump up to NUM tokens in BUFFER to FILE starting with token
276 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
277 first token in BUFFER. If NUM is 0, dump all the tokens. If
278 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
279 highlighted by surrounding it in [[ ]]. */
281 static void
285 {
302 {
305 }
310 {
317 nprinted++;
327 {
337 }
338 }
341 {
344 }
347 }
350 /* Dump all tokens in BUFFER to stderr. */
352 void
354 {
356 }
358 DEBUG_FUNCTION void
360 {
362 }
364 DEBUG_FUNCTION void
366 {
369 else
371 }
374 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
375 description for T. */
377 static void
379 {
381 {
384 }
385 }
388 /* Dump parser context C to FILE. */
390 static void
392 {
397 }
400 /* Print the stack of parsing contexts to FILE starting with FIRST. */
402 static void
404 {
410 {
413 }
414 }
417 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
419 static void
421 {
424 }
427 /* Print an unparsed function entry UF to FILE. */
429 static void
431 {
434 tree fn;
439 i++)
440 {
446 }
451 {
454 }
460 {
463 }
465 }
468 /* Print the stack of unparsed member functions S to FILE. */
470 static void
473 {
479 {
482 }
483 }
486 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
487 the given PARSER. If FILE is NULL, the output is printed on stderr. */
489 static void
491 {
503 next_token);
504 }
507 /* Dump debugging information for the given PARSER. If FILE is NULL,
508 the output is printed on stderr. */
510 void
512 {
515 expanded_location eloc;
593 }
595 DEBUG_FUNCTION void
597 {
599 }
601 DEBUG_FUNCTION void
603 {
606 else
608 }
610 /* Allocate memory for a new lexer object and return it. */
614 {
619 /* Allocate the memory. */
622 /* Initially we are not debugging. */
627 /* Create the buffer. */
631 }
634 /* Create a new main C++ lexer, the lexer that gets tokens from the
635 preprocessor. */
639 {
641 cp_token token;
643 /* It's possible that parsing the first pragma will load a PCH file,
644 which is a GC collection point. So we have to do that before
645 allocating any memory. */
650 /* Put the first token in the buffer. */
653 /* Get the remaining tokens from the preprocessor. */
655 {
658 }
667 /* Subsequent preprocessor diagnostics should use compiler
668 diagnostic functions to get the compiler source location. */
673 }
675 /* Create a new lexer whose token stream is primed with the tokens in
676 CACHE. When these tokens are exhausted, no new tokens will be read. */
680 {
685 /* We do not own the buffer. */
692 /* Initially we are not debugging. */
697 }
699 /* Frees all resources associated with LEXER. */
701 static void
703 {
707 }
709 /* This needs to be set to TRUE before the lexer-debugging infrastructure can
710 be used. The point of this flag is to help the compiler to fold away calls
711 to cp_lexer_debugging_p within this source file at compile time, when the
712 lexer is not being debugged. */
714 #define LEXER_DEBUGGING_ENABLED_P false
716 /* Returns nonzero if debugging information should be output. */
720 {
725 }
730 {
734 }
738 {
740 }
744 {
746 }
750 {
753 else
755 }
759 {
762 /* Skip past purged tokens. */
764 {
766 tp--;
767 }
770 }
772 /* nonzero if we are presently saving tokens. */
776 {
778 }
780 /* Store the next token from the preprocessor in *TOKEN. Return true
781 if we reach EOF. If LEXER is NULL, assume we are handling an
782 initial #pragma pch_preprocess, and thus want the lexer to return
783 processed strings. */
785 static void
787 {
790 /* Get a new token from the preprocessor. */
791 token->type
798 /* On some systems, some header files are surrounded by an
799 implicit extern "C" block. Set a flag in the token if it
800 comes from such a header. */
805 /* Check to see if this token is a keyword. */
807 {
809 {
810 /* Mark this token as a keyword. */
812 /* Record which keyword. */
814 }
815 else
816 {
820 {
821 /* Warn about the C++0x keyword (but still treat it as
822 an identifier). */
827 /* Clear out the C_RID_CODE so we don't warn about this
828 particular identifier-turned-keyword again. */
830 }
833 }
834 }
836 {
837 /* This only happens in Objective-C++; it must be a keyword. */
840 {
841 /* Replace 'class' with '@class', 'private' with '@private',
842 etc. This prevents confusion with the C++ keyword
843 'class', and makes the tokens consistent with other
844 Objective-C 'AT' keywords. For example '@class' is
845 reported as RID_AT_CLASS which is consistent with
846 '@synchronized', which is reported as
847 RID_AT_SYNCHRONIZED.
848 */
858 }
859 }
860 }
862 /* Update the globals input_location and the input file stack from TOKEN. */
865 {
867 {
869 }
870 }
872 /* Update the globals input_location and the input file stack from LEXER. */
875 {
878 }
880 /* Return a pointer to the next token in the token stream, but do not
881 consume it. */
885 {
887 {
891 }
893 }
895 /* Return true if the next token has the indicated TYPE. */
899 {
901 }
903 /* Return true if the next token does not have the indicated TYPE. */
907 {
909 }
911 /* Return true if the next token is the indicated KEYWORD. */
915 {
917 }
921 {
923 }
927 {
929 }
931 /* Return true if the next token is not the indicated KEYWORD. */
935 {
937 }
939 /* Return true if the next token is a keyword for a decl-specifier. */
941 static bool
943 {
948 {
949 /* auto specifier: storage-class-specifier in C++,
950 simple-type-specifier in C++0x. */
952 /* Storage classes. */
958 /* Elaborated type specifiers. */
964 /* Simple type specifiers. */
978 /* GNU extensions. */
981 /* C++0x extensions. */
992 }
993 }
995 /* Returns TRUE iff the token T begins a decltype type. */
997 static bool
999 {
1002 }
1004 /* Returns TRUE iff the next token begins a decltype type. */
1006 static bool
1008 {
1011 }
1013 /* Called when processing a token with tree_check_value; perform or defer the
1014 associated checks and return the value. */
1016 static tree
1018 {
1019 /* Perform any access checks that were deferred. */
1024 {
1030 }
1031 /* Return the stored value. */
1033 }
1035 /* Return a pointer to the Nth token in the token stream. If N is 1,
1036 then this is precisely equivalent to cp_lexer_peek_token (except
1037 that it is not inline). One would like to disallow that case, but
1038 there is one case (cp_parser_nth_token_starts_template_id) where
1039 the caller passes a variable for N and it might be 1. */
1043 {
1046 /* N is 1-based, not zero-based. */
1057 {
1060 {
1063 }
1067 }
1070 {
1073 }
1076 }
1078 /* Return the next token, and advance the lexer's next_token pointer
1079 to point to the next non-purged token. */
1083 {
1089 do
1090 {
1093 {
1096 }
1098 }
1103 /* Provide debugging output. */
1105 {
1109 }
1112 }
1114 /* Permanently remove the next token from the token stream, and
1115 advance the next_token pointer to refer to the next non-purged
1116 token. */
1118 static void
1120 {
1129 do
1130 {
1131 tok++;
1133 {
1136 }
1137 }
1140 }
1142 /* Permanently remove all tokens after TOK, up to, but not
1143 including, the token that will be returned next by
1144 cp_lexer_peek_token. */
1146 static void
1148 {
1157 {
1162 }
1163 }
1165 /* Begin saving tokens. All tokens consumed after this point will be
1166 preserved. */
1168 static void
1170 {
1171 /* Provide debugging output. */
1176 }
1178 /* Commit to the portion of the token stream most recently saved. */
1180 static void
1182 {
1183 /* Provide debugging output. */
1188 }
1190 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1191 to the token stream. Stop saving tokens. */
1193 static void
1195 {
1196 /* Provide debugging output. */
1201 }
1203 /* RAII wrapper around the above functions, with sanity checking. Creating
1204 a variable saves tokens, which are committed when the variable is
1205 destroyed unless they are explicitly rolled back by calling the rollback
1206 member function. */
1208 struct saved_token_sentinel
1209 {
1214 {
1217 }
1219 {
1222 }
1224 {
1228 }
1229 };
1231 /* Print a representation of the TOKEN on the STREAM. */
1233 static void
1235 {
1236 /* We don't use cpp_type2name here because the parser defines
1237 a few tokens of its own. */
1239 /* cpplib-defined token types */
1240 #define OP(e, s) #e,
1241 #define TK(e, s) #e,
1242 TTYPE_TABLE
1243 #undef OP
1244 #undef TK
1245 /* C++ parser token types - see "Manifest constants", above. */
1249 };
1251 /* For some tokens, print the associated data. */
1253 {
1255 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1256 For example, `struct' is mapped to an INTEGER_CST. */
1259 /* else fall through */
1277 /* If we have a name for the token, print it out. Otherwise, we
1278 simply give the numeric code. */
1281 else
1284 }
1285 }
1287 DEBUG_FUNCTION void
1289 {
1292 }
1294 DEBUG_FUNCTION void
1296 {
1299 else
1301 }
1304 /* Start emitting debugging information. */
1306 static void
1308 {
1315 }
1317 /* Stop emitting debugging information. */
1319 static void
1321 {
1328 }
1330 /* Create a new cp_token_cache, representing a range of tokens. */
1334 {
1339 }
1341 /* Diagnose if #pragma omp declare simd isn't followed immediately
1342 by function declaration or definition. */
1346 {
1348 {
1352 }
1353 }
1355 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1356 and put that into "omp declare simd" attribute. */
1360 {
1362 {
1364 {
1367 }
1369 {
1372 }
1373 }
1374 }
1376 /* Diagnose if #pragma acc routine isn't followed immediately by function
1377 declaration or definition. */
1381 {
1383 {
1390 }
1391 }
1392 \f
1393 /* Decl-specifiers. */
1395 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1397 static void
1399 {
1401 }
1403 /* Declarators. */
1405 /* Nothing other than the parser should be creating declarators;
1406 declarators are a semi-syntactic representation of C++ entities.
1407 Other parts of the front end that need to create entities (like
1408 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1411 (cp_declarator *, tree, cp_cv_quals, cp_virt_specifiers, cp_ref_qualifier, tree, tree, tree, tree);
1421 /* An erroneous declarator. */
1424 /* The obstack on which declarators and related data structures are
1425 allocated. */
1428 /* Alloc BYTES from the declarator memory pool. */
1432 {
1434 }
1436 /* Allocate a declarator of the indicated KIND. Clear fields that are
1437 common to all declarators. */
1441 {
1453 }
1455 /* Make a declarator for a generalized identifier. If
1456 QUALIFYING_SCOPE is non-NULL, the identifier is
1457 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1458 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1459 is, if any. */
1463 special_function_kind sfk)
1464 {
1467 /* It is valid to write:
1469 class C { void f(); };
1470 typedef C D;
1471 void D::f();
1473 The standard is not clear about whether `typedef const C D' is
1474 legal; as of 2002-09-15 the committee is considering that
1475 question. EDG 3.0 allows that syntax. Therefore, we do as
1476 well. */
1490 }
1492 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1493 of modifiers such as const or volatile to apply to the pointer
1494 type, represented as identifiers. ATTRIBUTES represent the attributes that
1495 appertain to the pointer or reference. */
1497 cp_declarator *
1499 tree attributes)
1500 {
1508 {
1512 }
1513 else
1519 }
1521 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1522 represent the attributes that appertain to the pointer or
1523 reference. */
1525 cp_declarator *
1528 {
1536 {
1540 }
1541 else
1547 }
1549 /* Like make_pointer_declarator -- but for a pointer to a non-static
1550 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1551 appertain to the pointer or reference. */
1553 cp_declarator *
1556 tree attributes)
1557 {
1566 {
1569 }
1570 else
1576 }
1578 /* Make a declarator for the function given by TARGET, with the
1579 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1580 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1581 indicates what exceptions can be thrown. */
1583 cp_declarator *
1585 tree parms,
1586 cp_cv_quals cv_qualifiers,
1587 cp_virt_specifiers virt_specifiers,
1588 cp_ref_qualifier ref_qualifier,
1589 tree tx_qualifier,
1590 tree exception_specification,
1591 tree late_return_type,
1592 tree requires_clause)
1593 {
1607 {
1611 }
1612 else
1616 }
1618 /* Make a declarator for an array of BOUNDS elements, each of which is
1619 defined by ELEMENT. */
1621 cp_declarator *
1623 {
1630 {
1634 }
1635 else
1639 }
1641 /* Determine whether the declarator we've seen so far can be a
1642 parameter pack, when followed by an ellipsis. */
1643 static bool
1645 {
1647 /* We already saw an ellipsis. */
1650 /* Search for a declarator name, or any other declarator that goes
1651 after the point where the ellipsis could appear in a parameter
1652 pack. If we find any of these, then this declarator can not be
1653 made into a parameter pack. */
1656 {
1658 {
1670 }
1671 }
1674 }
1678 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1679 DECLARATOR and DEFAULT_ARGUMENT. */
1681 cp_parameter_declarator *
1684 tree default_argument,
1686 {
1694 else
1701 }
1703 /* Returns true iff DECLARATOR is a declaration for a function. */
1705 static bool
1707 {
1709 {
1717 }
1719 }
1721 /* The parser. */
1723 /* Overview
1724 --------
1726 A cp_parser parses the token stream as specified by the C++
1727 grammar. Its job is purely parsing, not semantic analysis. For
1728 example, the parser breaks the token stream into declarators,
1729 expressions, statements, and other similar syntactic constructs.
1730 It does not check that the types of the expressions on either side
1731 of an assignment-statement are compatible, or that a function is
1732 not declared with a parameter of type `void'.
1734 The parser invokes routines elsewhere in the compiler to perform
1735 semantic analysis and to build up the abstract syntax tree for the
1736 code processed.
1738 The parser (and the template instantiation code, which is, in a
1739 way, a close relative of parsing) are the only parts of the
1740 compiler that should be calling push_scope and pop_scope, or
1741 related functions. The parser (and template instantiation code)
1742 keeps track of what scope is presently active; everything else
1743 should simply honor that. (The code that generates static
1744 initializers may also need to set the scope, in order to check
1745 access control correctly when emitting the initializers.)
1747 Methodology
1748 -----------
1750 The parser is of the standard recursive-descent variety. Upcoming
1751 tokens in the token stream are examined in order to determine which
1752 production to use when parsing a non-terminal. Some C++ constructs
1753 require arbitrary look ahead to disambiguate. For example, it is
1754 impossible, in the general case, to tell whether a statement is an
1755 expression or declaration without scanning the entire statement.
1756 Therefore, the parser is capable of "parsing tentatively." When the
1757 parser is not sure what construct comes next, it enters this mode.
1758 Then, while we attempt to parse the construct, the parser queues up
1759 error messages, rather than issuing them immediately, and saves the
1760 tokens it consumes. If the construct is parsed successfully, the
1761 parser "commits", i.e., it issues any queued error messages and
1762 the tokens that were being preserved are permanently discarded.
1763 If, however, the construct is not parsed successfully, the parser
1764 rolls back its state completely so that it can resume parsing using
1765 a different alternative.
1767 Future Improvements
1768 -------------------
1770 The performance of the parser could probably be improved substantially.
1771 We could often eliminate the need to parse tentatively by looking ahead
1772 a little bit. In some places, this approach might not entirely eliminate
1773 the need to parse tentatively, but it might still speed up the average
1774 case. */
1776 /* Flags that are passed to some parsing functions. These values can
1777 be bitwise-ored together. */
1779 enum
1780 {
1781 /* No flags. */
1783 /* The construct is optional. If it is not present, then no error
1784 should be issued. */
1786 /* When parsing a type-specifier, treat user-defined type-names
1787 as non-type identifiers. */
1789 /* When parsing a type-specifier, do not try to parse a class-specifier
1790 or enum-specifier. */
1792 /* When parsing a decl-specifier-seq, only allow type-specifier or
1793 constexpr. */
1795 };
1797 /* This type is used for parameters and variables which hold
1798 combinations of the above flags. */
1801 /* The different kinds of declarators we want to parse. */
1803 enum cp_parser_declarator_kind
1804 {
1805 /* We want an abstract declarator. */
1806 CP_PARSER_DECLARATOR_ABSTRACT,
1807 /* We want a named declarator. */
1808 CP_PARSER_DECLARATOR_NAMED,
1809 /* We don't mind, but the name must be an unqualified-id. */
1810 CP_PARSER_DECLARATOR_EITHER
1811 };
1813 /* The precedence values used to parse binary expressions. The minimum value
1814 of PREC must be 1, because zero is reserved to quickly discriminate
1815 binary operators from other tokens. */
1817 enum cp_parser_prec
1818 {
1819 PREC_NOT_OPERATOR,
1820 PREC_LOGICAL_OR_EXPRESSION,
1821 PREC_LOGICAL_AND_EXPRESSION,
1822 PREC_INCLUSIVE_OR_EXPRESSION,
1823 PREC_EXCLUSIVE_OR_EXPRESSION,
1824 PREC_AND_EXPRESSION,
1825 PREC_EQUALITY_EXPRESSION,
1826 PREC_RELATIONAL_EXPRESSION,
1827 PREC_SHIFT_EXPRESSION,
1828 PREC_ADDITIVE_EXPRESSION,
1829 PREC_MULTIPLICATIVE_EXPRESSION,
1830 PREC_PM_EXPRESSION,
1831 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1832 };
1834 /* A mapping from a token type to a corresponding tree node type, with a
1835 precedence value. */
1837 struct cp_parser_binary_operations_map_node
1838 {
1839 /* The token type. */
1841 /* The corresponding tree code. */
1843 /* The precedence of this operator. */
1845 };
1847 struct cp_parser_expression_stack_entry
1848 {
1849 /* Left hand side of the binary operation we are currently
1850 parsing. */
1851 cp_expr lhs;
1852 /* Original tree code for left hand side, if it was a binary
1853 expression itself (used for -Wparentheses). */
1855 /* Tree code for the binary operation we are parsing. */
1857 /* Precedence of the binary operation we are parsing. */
1859 /* Location of the binary operation we are parsing. */
1860 location_t loc;
1861 };
1863 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1864 entries because precedence levels on the stack are monotonically
1865 increasing. */
1869 /* Prototypes. */
1871 /* Constructors and destructors. */
1876 /* Class variables. */
1880 /* The operator-precedence table used by cp_parser_binary_expression.
1881 Transformed into an associative array (binops_by_token) by
1882 cp_parser_new. */
1915 };
1917 /* The same as binops, but initialized by cp_parser_new so that
1918 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1919 for speed. */
1922 /* Constructors and destructors. */
1924 /* Construct a new context. The context below this one on the stack
1925 is given by NEXT. */
1929 {
1932 /* Allocate the storage. */
1934 {
1935 /* Pull the first entry from the free list. */
1939 }
1940 else
1943 /* No errors have occurred yet in this context. */
1945 /* If this is not the bottommost context, copy information that we
1946 need from the previous context. */
1948 {
1949 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1950 expression, then we are parsing one in this context, too. */
1952 /* Thread the stack. */
1954 }
1957 }
1959 /* Managing the unparsed function queues. */
1961 #define unparsed_funs_with_default_args \
1962 parser->unparsed_queues->last ().funs_with_default_args
1963 #define unparsed_funs_with_definitions \
1964 parser->unparsed_queues->last ().funs_with_definitions
1965 #define unparsed_nsdmis \
1966 parser->unparsed_queues->last ().nsdmis
1967 #define unparsed_classes \
1968 parser->unparsed_queues->last ().classes
1970 static void
1972 {
1975 }
1977 static void
1979 {
1982 }
1984 /* Prototypes. */
1986 /* Constructors and destructors. */
1991 /* Routines to parse various constructs.
1993 Those that return `tree' will return the error_mark_node (rather
1994 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1995 Sometimes, they will return an ordinary node if error-recovery was
1996 attempted, even though a parse error occurred. So, to check
1997 whether or not a parse error occurred, you should always use
1998 cp_parser_error_occurred. If the construct is optional (indicated
1999 either by an `_opt' in the name of the function that does the
2000 parsing or via a FLAGS parameter), then NULL_TREE is returned if
2001 the construct is not present. */
2003 /* Lexical conventions [gram.lex] */
2005 static cp_expr cp_parser_identifier
2007 static cp_expr cp_parser_string_literal
2009 static cp_expr cp_parser_userdef_char_literal
2011 static tree cp_parser_userdef_string_literal
2013 static cp_expr cp_parser_userdef_numeric_literal
2016 /* Basic concepts [gram.basic] */
2018 static bool cp_parser_translation_unit
2021 /* Expressions [gram.expr] */
2023 static cp_expr cp_parser_primary_expression
2025 static cp_expr cp_parser_id_expression
2027 static cp_expr cp_parser_unqualified_id
2029 static tree cp_parser_nested_name_specifier_opt
2031 static tree cp_parser_nested_name_specifier
2033 static tree cp_parser_qualifying_entity
2035 static cp_expr cp_parser_postfix_expression
2037 static tree cp_parser_postfix_open_square_expression
2039 static tree cp_parser_postfix_dot_deref_expression
2043 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
2045 static void cp_parser_pseudo_destructor_name
2047 static cp_expr cp_parser_unary_expression
2049 static enum tree_code cp_parser_unary_operator
2051 static tree cp_parser_new_expression
2055 static tree cp_parser_new_type_id
2063 static tree cp_parser_delete_expression
2065 static cp_expr cp_parser_cast_expression
2067 static cp_expr cp_parser_binary_expression
2069 static tree cp_parser_question_colon_clause
2071 static cp_expr cp_parser_assignment_expression
2073 static enum tree_code cp_parser_assignment_operator_opt
2075 static cp_expr cp_parser_expression
2077 static cp_expr cp_parser_constant_expression
2079 static cp_expr cp_parser_builtin_offsetof
2081 static cp_expr cp_parser_lambda_expression
2083 static void cp_parser_lambda_introducer
2085 static bool cp_parser_lambda_declarator_opt
2087 static void cp_parser_lambda_body
2090 /* Statements [gram.stmt.stmt] */
2092 static void cp_parser_statement
2094 static void cp_parser_label_for_labeled_statement
2096 static tree cp_parser_expression_statement
2098 static tree cp_parser_compound_statement
2100 static void cp_parser_statement_seq_opt
2102 static tree cp_parser_selection_statement
2104 static tree cp_parser_condition
2106 static tree cp_parser_iteration_statement
2108 static bool cp_parser_for_init_statement
2110 static tree cp_parser_for
2112 static tree cp_parser_c_for
2114 static tree cp_parser_range_for
2116 static void do_range_for_auto_deduction
2118 static tree cp_parser_perform_range_for_lookup
2120 static tree cp_parser_range_for_member_function
2122 static tree cp_parser_jump_statement
2124 static void cp_parser_declaration_statement
2127 static tree cp_parser_implicitly_scoped_statement
2129 static void cp_parser_already_scoped_statement
2132 /* Declarations [gram.dcl.dcl] */
2134 static void cp_parser_declaration_seq_opt
2136 static void cp_parser_declaration
2138 static void cp_parser_block_declaration
2140 static void cp_parser_simple_declaration
2142 static void cp_parser_decl_specifier_seq
2144 static tree cp_parser_storage_class_specifier_opt
2146 static tree cp_parser_function_specifier_opt
2148 static tree cp_parser_type_specifier
2151 static tree cp_parser_simple_type_specifier
2153 static tree cp_parser_type_name
2155 static tree cp_parser_type_name
2157 static tree cp_parser_nonclass_name
2159 static tree cp_parser_elaborated_type_specifier
2161 static tree cp_parser_enum_specifier
2163 static void cp_parser_enumerator_list
2165 static void cp_parser_enumerator_definition
2167 static tree cp_parser_namespace_name
2169 static void cp_parser_namespace_definition
2171 static void cp_parser_namespace_body
2173 static tree cp_parser_qualified_namespace_specifier
2175 static void cp_parser_namespace_alias_definition
2177 static bool cp_parser_using_declaration
2179 static void cp_parser_using_directive
2181 static tree cp_parser_alias_declaration
2183 static void cp_parser_asm_definition
2185 static void cp_parser_linkage_specification
2187 static void cp_parser_static_assert
2189 static tree cp_parser_decltype
2192 /* Declarators [gram.dcl.decl] */
2194 static tree cp_parser_init_declarator
2201 static enum tree_code cp_parser_ptr_operator
2203 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2205 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2207 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2209 static tree cp_parser_tx_qualifier_opt
2211 static tree cp_parser_late_return_type_opt
2213 static tree cp_parser_declarator_id
2215 static tree cp_parser_type_id
2217 static tree cp_parser_template_type_arg
2220 static tree cp_parser_type_id_1
2222 static void cp_parser_type_specifier_seq
2224 static tree cp_parser_parameter_declaration_clause
2226 static tree cp_parser_parameter_declaration_list
2230 static tree cp_parser_default_argument
2232 static void cp_parser_function_body
2234 static tree cp_parser_initializer
2236 static cp_expr cp_parser_initializer_clause
2238 static cp_expr cp_parser_braced_list
2243 static bool cp_parser_ctor_initializer_opt_and_function_body
2246 static tree cp_parser_late_parsing_omp_declare_simd
2249 static tree cp_parser_late_parsing_cilk_simd_fn_info
2252 static tree cp_parser_late_parsing_oacc_routine
2255 static tree synthesize_implicit_template_parm
2257 static tree finish_fully_implicit_template
2260 /* Classes [gram.class] */
2262 static tree cp_parser_class_name
2264 static tree cp_parser_class_specifier
2266 static tree cp_parser_class_head
2268 static enum tag_types cp_parser_class_key
2270 static void cp_parser_type_parameter_key
2272 static void cp_parser_member_specification_opt
2274 static void cp_parser_member_declaration
2276 static tree cp_parser_pure_specifier
2278 static tree cp_parser_constant_initializer
2281 /* Derived classes [gram.class.derived] */
2283 static tree cp_parser_base_clause
2285 static tree cp_parser_base_specifier
2288 /* Special member functions [gram.special] */
2290 static tree cp_parser_conversion_function_id
2292 static tree cp_parser_conversion_type_id
2296 static bool cp_parser_ctor_initializer_opt
2298 static void cp_parser_mem_initializer_list
2300 static tree cp_parser_mem_initializer
2302 static tree cp_parser_mem_initializer_id
2305 /* Overloading [gram.over] */
2307 static cp_expr cp_parser_operator_function_id
2309 static cp_expr cp_parser_operator
2312 /* Templates [gram.temp] */
2314 static void cp_parser_template_declaration
2316 static tree cp_parser_template_parameter_list
2318 static tree cp_parser_template_parameter
2320 static tree cp_parser_type_parameter
2322 static tree cp_parser_template_id
2324 static tree cp_parser_template_name
2326 static tree cp_parser_template_argument_list
2328 static tree cp_parser_template_argument
2330 static void cp_parser_explicit_instantiation
2332 static void cp_parser_explicit_specialization
2335 /* Exception handling [gram.exception] */
2337 static tree cp_parser_try_block
2339 static bool cp_parser_function_try_block
2341 static void cp_parser_handler_seq
2343 static void cp_parser_handler
2345 static tree cp_parser_exception_declaration
2347 static tree cp_parser_throw_expression
2349 static tree cp_parser_exception_specification_opt
2351 static tree cp_parser_type_id_list
2354 /* GNU Extensions */
2356 static tree cp_parser_asm_specification_opt
2358 static tree cp_parser_asm_operand_list
2360 static tree cp_parser_asm_clobber_list
2362 static tree cp_parser_asm_label_list
2364 static bool cp_next_tokens_can_be_attribute_p
2366 static bool cp_next_tokens_can_be_gnu_attribute_p
2368 static bool cp_next_tokens_can_be_std_attribute_p
2370 static bool cp_nth_tokens_can_be_std_attribute_p
2372 static bool cp_nth_tokens_can_be_gnu_attribute_p
2374 static bool cp_nth_tokens_can_be_attribute_p
2376 static tree cp_parser_attributes_opt
2378 static tree cp_parser_gnu_attributes_opt
2380 static tree cp_parser_gnu_attribute_list
2382 static tree cp_parser_std_attribute
2384 static tree cp_parser_std_attribute_spec
2386 static tree cp_parser_std_attribute_spec_seq
2388 static bool cp_parser_extension_opt
2390 static void cp_parser_label_declaration
2393 /* Concept Extensions */
2395 static tree cp_parser_requires_clause
2397 static tree cp_parser_requires_clause_opt
2399 static tree cp_parser_requires_expression
2401 static tree cp_parser_requirement_parameter_list
2403 static tree cp_parser_requirement_body
2405 static tree cp_parser_requirement_list
2407 static tree cp_parser_requirement
2409 static tree cp_parser_simple_requirement
2411 static tree cp_parser_compound_requirement
2413 static tree cp_parser_type_requirement
2415 static tree cp_parser_nested_requirement
2418 /* Transactional Memory Extensions */
2420 static tree cp_parser_transaction
2422 static tree cp_parser_transaction_expression
2424 static bool cp_parser_function_transaction
2426 static tree cp_parser_transaction_cancel
2430 pragma_external,
2431 pragma_member,
2432 pragma_objc_icode,
2433 pragma_stmt,
2434 pragma_compound
2435 };
2436 static bool cp_parser_pragma
2439 /* Objective-C++ Productions */
2441 static tree cp_parser_objc_message_receiver
2443 static tree cp_parser_objc_message_args
2445 static tree cp_parser_objc_message_expression
2447 static cp_expr cp_parser_objc_encode_expression
2449 static tree cp_parser_objc_defs_expression
2451 static tree cp_parser_objc_protocol_expression
2453 static tree cp_parser_objc_selector_expression
2455 static cp_expr cp_parser_objc_expression
2457 static bool cp_parser_objc_selector_p
2459 static tree cp_parser_objc_selector
2461 static tree cp_parser_objc_protocol_refs_opt
2463 static void cp_parser_objc_declaration
2465 static tree cp_parser_objc_statement
2467 static bool cp_parser_objc_valid_prefix_attributes
2469 static void cp_parser_objc_at_property_declaration
2471 static void cp_parser_objc_at_synthesize_declaration
2473 static void cp_parser_objc_at_dynamic_declaration
2475 static tree cp_parser_objc_struct_declaration
2478 /* Utility Routines */
2480 static cp_expr cp_parser_lookup_name
2482 static tree cp_parser_lookup_name_simple
2484 static tree cp_parser_maybe_treat_template_as_class
2486 static bool cp_parser_check_declarator_template_parameters
2488 static bool cp_parser_check_template_parameters
2490 static cp_expr cp_parser_simple_cast_expression
2492 static tree cp_parser_global_scope_opt
2494 static bool cp_parser_constructor_declarator_p
2496 static tree cp_parser_function_definition_from_specifiers_and_declarator
2498 static tree cp_parser_function_definition_after_declarator
2500 static bool cp_parser_template_declaration_after_export
2502 static void cp_parser_perform_template_parameter_access_checks
2504 static tree cp_parser_single_declaration
2506 static cp_expr cp_parser_functional_cast
2508 static tree cp_parser_save_member_function_body
2510 static tree cp_parser_save_nsdmi
2512 static tree cp_parser_enclosed_template_argument_list
2514 static void cp_parser_save_default_args
2516 static void cp_parser_late_parsing_for_member
2518 static tree cp_parser_late_parse_one_default_arg
2520 static void cp_parser_late_parsing_nsdmi
2522 static void cp_parser_late_parsing_default_args
2524 static tree cp_parser_sizeof_operand
2526 static tree cp_parser_trait_expr
2528 static bool cp_parser_declares_only_class_p
2530 static void cp_parser_set_storage_class
2532 static void cp_parser_set_decl_spec_type
2534 static void set_and_check_decl_spec_loc
2537 static bool cp_parser_friend_p
2539 static void cp_parser_required_error
2545 static bool cp_parser_token_starts_function_definition_p
2547 static bool cp_parser_next_token_starts_class_definition_p
2549 static bool cp_parser_next_token_ends_template_argument_p
2551 static bool cp_parser_nth_token_starts_template_argument_list_p
2553 static enum tag_types cp_parser_token_is_class_key
2555 static enum tag_types cp_parser_token_is_type_parameter_key
2557 static void cp_parser_check_class_key
2559 static void cp_parser_check_access_in_redeclaration
2561 static bool cp_parser_optional_template_keyword
2563 static void cp_parser_pre_parsed_nested_name_specifier
2565 static bool cp_parser_cache_group
2567 static tree cp_parser_cache_defarg
2569 static void cp_parser_parse_tentatively
2571 static void cp_parser_commit_to_tentative_parse
2573 static void cp_parser_commit_to_topmost_tentative_parse
2575 static void cp_parser_abort_tentative_parse
2577 static bool cp_parser_parse_definitely
2581 static bool cp_parser_uncommitted_to_tentative_parse_p
2583 static void cp_parser_error
2585 static void cp_parser_name_lookup_error
2587 static bool cp_parser_simulate_error
2589 static bool cp_parser_check_type_definition
2591 static void cp_parser_check_for_definition_in_return_type
2593 static void cp_parser_check_for_invalid_template_id
2595 static bool cp_parser_non_integral_constant_expression
2597 static void cp_parser_diagnose_invalid_type_name
2599 static bool cp_parser_parse_and_diagnose_invalid_type_name
2601 static int cp_parser_skip_to_closing_parenthesis
2603 static void cp_parser_skip_to_end_of_statement
2605 static void cp_parser_consume_semicolon_at_end_of_statement
2607 static void cp_parser_skip_to_end_of_block_or_statement
2609 static bool cp_parser_skip_to_closing_brace
2611 static void cp_parser_skip_to_end_of_template_parameter_list
2613 static void cp_parser_skip_to_pragma_eol
2615 static bool cp_parser_error_occurred
2617 static bool cp_parser_allow_gnu_extensions_p
2619 static bool cp_parser_is_pure_string_literal
2621 static bool cp_parser_is_string_literal
2623 static bool cp_parser_is_keyword
2625 static tree cp_parser_make_typename_type
2629 static bool cp_parser_compound_literal_p
2631 static bool cp_parser_array_designator_p
2633 static bool cp_parser_skip_to_closing_square_bracket
2636 /* Concept-related syntactic transformations */
2641 // -------------------------------------------------------------------------- //
2642 // Unevaluated Operand Guard
2643 //
2644 // Implementation of an RAII helper for unevaluated operand parsing.
2646 {
2649 }
2652 {
2655 }
2657 // -------------------------------------------------------------------------- //
2658 // Tentative Parsing
2660 /* Returns nonzero if we are parsing tentatively. */
2664 {
2666 }
2668 /* Returns nonzero if TOKEN is a string literal. */
2670 static bool
2672 {
2678 }
2680 /* Returns nonzero if TOKEN is a string literal
2681 of a user-defined string literal. */
2683 static bool
2685 {
2692 }
2694 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2696 static bool
2698 {
2700 }
2702 /* Return TOKEN's pragma_kind if it is CPP_PRAGMA, otherwise
2703 PRAGMA_NONE. */
2705 static enum pragma_kind
2707 {
2710 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
2712 }
2714 /* Helper function for cp_parser_error.
2715 Having peeked a token of kind TOK1_KIND that might signify
2716 a conflict marker, peek successor tokens to determine
2717 if we actually do have a conflict marker.
2718 Specifically, we consider a run of 7 '<', '=' or '>' characters
2719 at the start of a line as a conflict marker.
2720 These come through the lexer as three pairs and a single,
2721 e.g. three CPP_LSHIFT tokens ("<<") and a CPP_LESS token ('<').
2722 If it returns true, *OUT_LOC is written to with the location/range
2723 of the marker. */
2725 static bool
2728 {
2739 /* It must be at the start of the line. */
2744 /* We have a conflict marker. Construct a location of the form:
2745 <<<<<<<
2746 ^~~~~~~
2747 with start == caret, finishing at the end of the marker. */
2752 }
2754 /* If not parsing tentatively, issue a diagnostic of the form
2755 FILE:LINE: MESSAGE before TOKEN
2756 where TOKEN is the next token in the input stream. MESSAGE
2757 (specified by the caller) is usually of the form "expected
2758 OTHER-TOKEN". */
2760 static void
2762 {
2764 {
2766 /* This diagnostic makes more sense if it is tagged to the line
2767 of the token we just peeked at. */
2771 {
2776 }
2778 /* If this is actually a conflict marker, report it as such. */
2782 {
2783 location_t loc;
2785 {
2788 }
2789 }
2792 /* Because c_parser_error does not understand
2793 CPP_KEYWORD, keywords are treated like
2794 identifiers. */
2797 }
2798 }
2800 /* Issue an error about name-lookup failing. NAME is the
2801 IDENTIFIER_NODE DECL is the result of
2802 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2803 the thing that we hoped to find. */
2805 static void
2807 tree name,
2808 tree decl,
2809 name_lookup_error desired,
2810 location_t location)
2811 {
2812 /* If name lookup completely failed, tell the user that NAME was not
2813 declared. */
2815 {
2828 else
2830 }
2832 {
2834 {
2851 }
2852 }
2854 {
2856 {
2866 name);
2870 }
2871 }
2872 else
2873 {
2875 {
2888 }
2889 }
2890 }
2892 /* If we are parsing tentatively, remember that an error has occurred
2893 during this tentative parse. Returns true if the error was
2894 simulated; false if a message should be issued by the caller. */
2896 static bool
2898 {
2900 {
2903 }
2905 }
2907 /* This function is called when a type is defined. If type
2908 definitions are forbidden at this point, an error message is
2909 issued. */
2911 static bool
2913 {
2914 /* If types are forbidden here, issue a message. */
2916 {
2917 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2918 in the message need to be interpreted. */
2921 }
2923 }
2925 /* This function is called when the DECLARATOR is processed. The TYPE
2926 was a type defined in the decl-specifiers. If it is invalid to
2927 define a type in the decl-specifiers for DECLARATOR, an error is
2928 issued. TYPE_LOCATION is the location of TYPE and is used
2929 for error reporting. */
2931 static void
2934 {
2935 /* [dcl.fct] forbids type definitions in return types.
2936 Unfortunately, it's not easy to know whether or not we are
2937 processing a return type until after the fact. */
2945 {
2950 type);
2951 }
2952 }
2954 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2955 "<" in any valid C++ program. If the next token is indeed "<",
2956 issue a message warning the user about what appears to be an
2957 invalid attempt to form a template-id. LOCATION is the location
2958 of the type-specifier (TYPE) */
2960 static void
2962 tree type,
2964 location_t location)
2965 {
2969 {
2973 {
2976 else
2978 }
2979 else
2981 /* Remember the location of the invalid "<". */
2984 /* Consume the "<". */
2986 /* Parse the template arguments. */
2988 /* Permanently remove the invalid template arguments so that
2989 this error message is not issued again. */
2992 }
2993 }
2995 /* If parsing an integral constant-expression, issue an error message
2996 about the fact that THING appeared and return true. Otherwise,
2997 return false. In either case, set
2998 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
3000 static bool
3002 non_integral_constant thing)
3003 {
3006 {
3008 {
3011 {
3018 "enumeration type cannot appear in a "
3109 }
3113 }
3114 }
3116 }
3118 /* Emit a diagnostic for an invalid type name. This function commits
3119 to the current active tentative parse, if any. (Otherwise, the
3120 problematic construct might be encountered again later, resulting
3121 in duplicate error messages.) LOCATION is the location of ID. */
3123 static void
3125 location_t location)
3126 {
3129 /* Try to lookup the identifier. */
3136 /* If the lookup was ambiguous, an error will already have
3137 been issued. */
3139 /* If the lookup found a template-name, it means that the user forgot
3140 to specify an argument list. Emit a useful error message. */
3142 {
3145 decl);
3147 }
3151 /* Something like 'unsigned A a;' */
3154 {
3155 /* Issue an error message. */
3157 /* If we're in a template class, it's possible that the user was
3158 referring to a type from a base class. For example:
3160 template <typename T> struct A { typedef T X; };
3161 template <typename T> struct B : public A<T> { X x; };
3163 The user should have said "typename A<T>::X". */
3177 {
3178 tree b;
3181 b;
3183 {
3187 {
3188 tree field;
3189 /* Go from a particular instantiation of the
3190 template (which will have an empty TYPE_FIELDs),
3191 to the main version. */
3194 field;
3198 {
3203 }
3206 }
3207 }
3208 }
3209 }
3210 /* Here we diagnose qualified-ids where the scope is actually correct,
3211 but the identifier does not resolve to a valid type name. */
3213 {
3215 {
3220 else
3226 }
3229 {
3230 /* A<T>::A<T>() */
3236 }
3243 {
3248 else
3254 }
3255 else
3257 }
3258 }
3260 /* Check for a common situation where a type-name should be present,
3261 but is not, and issue a sensible error message. Returns true if an
3262 invalid type-name was detected.
3264 The situation handled by this function are variable declarations of the
3265 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3266 Usually, `ID' should name a type, but if we got here it means that it
3267 does not. We try to emit the best possible error message depending on
3268 how exactly the id-expression looks like. */
3270 static bool
3272 {
3273 tree id;
3276 /* Avoid duplicate error about ambiguous lookup. */
3278 {
3282 }
3291 /* If the next token is a (, this is a function with no explicit return
3292 type, i.e. constructor, destructor or conversion op. */
3295 {
3298 }
3302 /* Emit a diagnostic for the invalid type. */
3304 out:
3305 /* If we aren't in the middle of a declarator (i.e. in a
3306 parameter-declaration-clause), skip to the end of the declaration;
3307 there's no point in trying to process it. */
3311 }
3313 /* Consume tokens up to, and including, the next non-nested closing `)'.
3314 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3315 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3316 found an unnested token of that type. */
3318 static int
3321 cpp_ttype or_ttype,
3323 {
3333 {
3336 /* Have we found what we're looking for before the closing paren? */
3342 {
3345 /* If we've run out of tokens, then there is no closing `)'. */
3348 /* This is good for lambda expression capture-lists. */
3358 /* This matches the processing in skip_to_end_of_statement. */
3378 {
3382 }
3387 }
3389 /* Consume the token. */
3391 }
3392 }
3394 /* Consume tokens up to, and including, the next non-nested closing `)'.
3395 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3396 are doing error recovery. Returns -1 if OR_COMMA is true and we
3397 found an unnested token of that type. */
3399 static int
3404 {
3408 }
3410 /* Consume tokens until we reach the end of the current statement.
3411 Normally, that will be just before consuming a `;'. However, if a
3412 non-nested `}' comes first, then we stop before consuming that. */
3414 static void
3416 {
3419 /* Unwind generic function template scope if necessary. */
3424 {
3428 {
3431 /* If we've run out of tokens, stop. */
3435 /* If the next token is a `;', we have reached the end of the
3436 statement. */
3442 /* If this is a non-nested '}', stop before consuming it.
3443 That way, when confronted with something like:
3445 { 3 + }
3447 we stop before consuming the closing '}', even though we
3448 have not yet reached a `;'. */
3452 /* If it is the closing '}' for a block that we have
3453 scanned, stop -- but only after consuming the token.
3454 That way given:
3456 void f g () { ... }
3457 typedef int I;
3459 we will stop after the body of the erroneously declared
3460 function, but before consuming the following `typedef'
3461 declaration. */
3463 {
3466 }
3474 }
3476 /* Consume the token. */
3478 }
3479 }
3481 /* This function is called at the end of a statement or declaration.
3482 If the next token is a semicolon, it is consumed; otherwise, error
3483 recovery is attempted. */
3485 static void
3487 {
3488 /* Look for the trailing `;'. */
3490 {
3491 /* If there is additional (erroneous) input, skip to the end of
3492 the statement. */
3494 /* If the next token is now a `;', consume it. */
3497 }
3498 }
3500 /* Skip tokens until we have consumed an entire block, or until we
3501 have consumed a non-nested `;'. */
3503 static void
3505 {
3508 /* Unwind generic function template scope if necessary. */
3513 {
3517 {
3520 /* If we've run out of tokens, stop. */
3524 /* Stop if this is an unnested ';'. */
3530 /* Stop if this is an unnested '}', or closes the outermost
3531 nesting level. */
3532 nesting_depth--;
3540 /* Nest. */
3541 nesting_depth++;
3546 }
3548 /* Consume the token. */
3550 }
3551 }
3553 /* Skip tokens until a non-nested closing curly brace is the next
3554 token, or there are no more tokens. Return true in the first case,
3555 false otherwise. */
3557 static bool
3559 {
3563 {
3567 {
3570 /* If we've run out of tokens, stop. */
3574 /* If the next token is a non-nested `}', then we have reached
3575 the end of the current block. */
3581 /* If it the next token is a `{', then we are entering a new
3582 block. Consume the entire block. */
3588 }
3590 /* Consume the token. */
3592 }
3593 }
3595 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3596 parameter is the PRAGMA token, allowing us to purge the entire pragma
3597 sequence. */
3599 static void
3601 {
3606 do
3610 /* Ensure that the pragma is not parsed again. */
3612 }
3614 /* Require pragma end of line, resyncing with it as necessary. The
3615 arguments are as for cp_parser_skip_to_pragma_eol. */
3617 static void
3619 {
3623 }
3625 /* This is a simple wrapper around make_typename_type. When the id is
3626 an unresolved identifier node, we can provide a superior diagnostic
3627 using cp_parser_diagnose_invalid_type_name. */
3629 static tree
3631 location_t id_location)
3632 {
3633 tree result;
3635 {
3641 }
3643 }
3645 /* This is a wrapper around the
3646 make_{pointer,ptrmem,reference}_declarator functions that decides
3647 which one to call based on the CODE and CLASS_TYPE arguments. The
3648 CODE argument should be one of the values returned by
3649 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3650 appertain to the pointer or reference. */
3654 cp_cv_quals cv_qualifiers,
3656 tree attributes)
3657 {
3664 else
3674 }
3676 /* Create a new C++ parser. */
3680 {
3685 /* cp_lexer_new_main is called before doing GC allocation because
3686 cp_lexer_new_main might load a PCH file. */
3689 /* Initialize the binops_by_token so that we can get the tree
3690 directly from the token. */
3698 /* For now, we always accept GNU extensions. */
3701 /* The `>' token is a greater-than operator, not the end of a
3702 template-id. */
3707 /* We are not parsing a constant-expression. */
3712 /* Local variable names are not forbidden. */
3715 /* We are not processing an `extern "C"' declaration. */
3718 /* We are not processing a declarator. */
3721 /* We are not processing a template-argument-list. */
3724 /* We are not in an iteration statement. */
3727 /* We are not in a switch statement. */
3730 /* We are not parsing a type-id inside an expression. */
3733 /* Declarations aren't implicitly extern "C". */
3736 /* String literals should be translated to the execution character set. */
3739 /* We are not parsing a function body. */
3742 /* We can correct until told otherwise. */
3745 /* The unparsed function queue is empty. */
3748 /* There are no classes being defined. */
3751 /* No template parameters apply. */
3754 /* Not declaring an implicit function template. */
3760 /* Active OpenACC routine clauses. */
3763 /* Allow constrained-type-specifiers. */
3767 }
3769 /* Create a cp_lexer structure which will emit the tokens in CACHE
3770 and push it onto the parser's lexer stack. This is used for delayed
3771 parsing of in-class method bodies and default arguments, and should
3772 not be confused with tentative parsing. */
3773 static void
3775 {
3780 /* Move the current source position to that of the first token in the
3781 new lexer. */
3783 }
3785 /* Pop the top lexer off the parser stack. This is never used for the
3786 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3787 static void
3789 {
3794 /* Put the current source position back where it was before this
3795 lexer was pushed. */
3797 }
3799 /* Lexical conventions [gram.lex] */
3801 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3802 identifier. */
3804 static cp_expr
3806 {
3809 /* Look for the identifier. */
3811 /* Return the value. */
3814 else
3816 }
3818 /* Parse a sequence of adjacent string constants. Returns a
3819 TREE_STRING representing the combined, nul-terminated string
3820 constant. If TRANSLATE is true, translate the string to the
3821 execution character set. If WIDE_OK is true, a wide string is
3822 invalid here.
3824 C++98 [lex.string] says that if a narrow string literal token is
3825 adjacent to a wide string literal token, the behavior is undefined.
3826 However, C99 6.4.5p4 says that this results in a wide string literal.
3827 We follow C99 here, for consistency with the C front end.
3829 This code is largely lifted from lex_string() in c-lex.c.
3831 FUTURE: ObjC++ will need to handle @-strings here. */
3832 static cp_expr
3835 {
3836 tree value;
3843 tree string_tree;
3849 {
3852 }
3857 {
3861 }
3862 else
3863 {
3866 }
3869 /* Try to avoid the overhead of creating and destroying an obstack
3870 for the common case of just one string. */
3873 {
3881 {
3885 }
3886 else
3890 }
3891 else
3892 {
3893 location_t last_tok_loc;
3897 do
3898 {
3901 count++;
3906 {
3909 {
3912 }
3915 {
3920 }
3922 }
3923 else
3927 {
3932 "unsupported non-standard concatenation "
3934 }
3940 {
3944 }
3945 else
3946 {
3950 }
3951 }
3954 /* A string literal built by concatenation has its caret=start at
3955 the start of the initial string, and its finish at the finish of
3956 the final string literal. */
3960 }
3963 {
3966 }
3970 {
3975 {
3990 }
3995 {
4000 else
4002 }
4003 }
4004 else
4005 /* cpp_interpret_string has issued an error. */
4012 }
4014 /* Look up a literal operator with the name and the exact arguments. */
4016 static tree
4018 {
4025 {
4031 {
4034 {
4044 }
4047 /* May be this should be sufficient_parms_p instead,
4048 depending on how exactly should user-defined literals
4049 work in presence of default arguments on the literal
4050 operator parameters. */
4053 }
4054 }
4057 }
4059 /* Parse a user-defined char constant. Returns a call to a user-defined
4060 literal operator taking the character as an argument. */
4062 static cp_expr
4064 {
4072 /* Build up a call to the user-defined operator */
4073 /* Lookup the name we got back from the id-expression. */
4078 {
4083 }
4087 }
4089 /* A subroutine of cp_parser_userdef_numeric_literal to
4090 create a char... template parameter pack from a string node. */
4092 static tree
4094 {
4095 tree charvec;
4101 /* Fill in CHARVEC with all of the parameters. */
4106 /* Build the argument packs. */
4113 }
4115 /* A subroutine of cp_parser_userdef_numeric_literal to
4116 create a char... template parameter pack from a string node. */
4118 static tree
4120 {
4121 tree charvec;
4132 /* First template parm is character type. */
4135 /* Fill in CHARVEC with all of the parameters. */
4142 /* Build the argument packs. */
4149 }
4151 /* Parse a user-defined numeric constant. returns a call to a user-defined
4152 literal operator. */
4154 static cp_expr
4156 {
4167 /* Look for a literal operator taking the exact type of numeric argument
4168 as the literal value. */
4173 {
4175 tf_warning_or_error);
4178 {
4181 long_long_unsigned_type_node);
4182 }
4183 else
4184 {
4188 long_double_type_node);
4192 }
4196 }
4199 /* If the numeric argument didn't work, look for a raw literal
4200 operator taking a const char* argument consisting of the number
4201 in string format. */
4206 {
4208 tf_warning_or_error);
4211 }
4214 /* If the raw literal didn't work, look for a non-type template
4215 function with parameter pack char.... Call the function with
4216 template parameter characters representing the number. */
4220 {
4224 tf_warning_or_error);
4227 }
4236 }
4238 /* Parse a user-defined string constant. Returns a call to a user-defined
4239 literal operator taking a character pointer and the length of the string
4240 as arguments. */
4242 static tree
4244 {
4253 /* Build up a call to the user-defined operator. */
4254 /* Lookup the name we got back from the id-expression. */
4261 {
4263 tf_warning_or_error);
4266 }
4269 /* Look for a template function with typename parameter CharT
4270 and parameter pack CharT... Call the function with
4271 template parameter characters representing the string. */
4275 {
4279 tf_warning_or_error);
4282 }
4288 }
4291 /* Basic concepts [gram.basic] */
4293 /* Parse a translation-unit.
4295 translation-unit:
4296 declaration-seq [opt]
4298 Returns TRUE if all went well. */
4300 static bool
4302 {
4303 /* The address of the first non-permanent object on the declarator
4304 obstack. */
4309 /* Create the declarator obstack, if necessary. */
4311 {
4313 /* Create the error declarator. */
4315 /* Create the empty parameter list. */
4317 /* Remember where the base of the declarator obstack lies. */
4319 }
4323 /* If there are no tokens left then all went well. */
4325 {
4326 /* Get rid of the token array; we don't need it any more. */
4330 /* This file might have been a context that's implicitly extern
4331 "C". If so, pop the lang context. (Only relevant for PCH.) */
4333 {
4336 }
4338 /* Finish up. */
4342 }
4343 else
4344 {
4347 }
4349 /* Make sure the declarator obstack was fully cleaned up. */
4353 /* All went well. */
4355 }
4357 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4358 decltype context. */
4362 {
4367 }
4369 /* We're about to parse a collection of statements. If we're currently
4370 parsing tentatively, set up a firewall so that any nested
4371 cp_parser_commit_to_tentative_parse won't affect the current context. */
4373 static cp_token_position
4375 {
4382 }
4384 /* We've finished parsing the collection of statements. Wrap up the
4385 firewall and replace the relevant tokens with the parsed form. */
4387 static void
4389 tree expr)
4390 {
4394 /* Finish the firewall level. */
4396 /* And remember the result of the parse for when we try again. */
4402 }
4404 /* Like the above functions, but let the user modify the tokens. Used by
4405 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4406 later parses, so it makes sense to localize the effects of
4407 cp_parser_commit_to_tentative_parse. */
4409 struct tentative_firewall
4410 {
4415 {
4416 /* If we're currently parsing tentatively, start a committed level as a
4417 firewall and then an inner tentative parse. */
4419 {
4423 }
4424 }
4427 {
4429 {
4430 /* Finish the inner tentative parse and the firewall, propagating any
4431 uncommitted error state to the outer tentative parse. */
4437 }
4438 }
4439 };
4441 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4442 enclosing parentheses. */
4444 static cp_expr
4446 {
4449 /* Consume the '('. */
4452 /* Start the statement-expression. */
4454 /* Parse the compound-statement. */
4456 /* Finish up. */
4458 /* Consume the ')'. */
4466 }
4468 /* Expressions [gram.expr] */
4470 /* Parse a fold-operator.
4472 fold-operator:
4473 - * / % ^ & | = < > << >>
4474 = -= *= /= %= ^= &= |= <<= >>=
4475 == != <= >= && || , .* ->*
4477 This returns the tree code corresponding to the matched operator
4478 as an int. When the current token matches a compound assignment
4479 opertor, the resulting tree code is the negative value of the
4480 non-assignment operator. */
4482 static int
4484 {
4486 {
4526 }
4527 }
4529 /* Returns true if CODE indicates a binary expression, which is not allowed in
4530 the LHS of a fold-expression. More codes will need to be added to use this
4531 function in other contexts. */
4533 static bool
4535 {
4537 {
4570 }
4571 }
4573 /* If the next token is a suitable fold operator, consume it and return as
4574 the function above. */
4576 static int
4578 {
4584 }
4586 /* Parse a fold-expression.
4588 fold-expression:
4589 ( ... folding-operator cast-expression)
4590 ( cast-expression folding-operator ... )
4591 ( cast-expression folding operator ... folding-operator cast-expression)
4593 Note that the '(' and ')' are matched in primary expression. */
4595 static cp_expr
4597 {
4598 cp_id_kind pidk;
4600 // Left fold.
4602 {
4606 {
4609 }
4616 }
4621 {
4624 }
4627 {
4630 }
4633 /* The operands of a fold-expression are cast-expressions, so binary or
4634 conditional expressions are not allowed. We check this here to avoid
4635 tentative parsing. */
4643 // Right fold.
4648 {
4651 }
4654 // Binary left or right fold.
4659 }
4661 /* Parse a primary-expression.
4663 primary-expression:
4664 literal
4665 this
4666 ( expression )
4667 id-expression
4668 lambda-expression (C++11)
4670 GNU Extensions:
4672 primary-expression:
4673 ( compound-statement )
4674 __builtin_va_arg ( assignment-expression , type-id )
4675 __builtin_offsetof ( type-id , offsetof-expression )
4677 C++ Extensions:
4678 __has_nothrow_assign ( type-id )
4679 __has_nothrow_constructor ( type-id )
4680 __has_nothrow_copy ( type-id )
4681 __has_trivial_assign ( type-id )
4682 __has_trivial_constructor ( type-id )
4683 __has_trivial_copy ( type-id )
4684 __has_trivial_destructor ( type-id )
4685 __has_virtual_destructor ( type-id )
4686 __is_abstract ( type-id )
4687 __is_base_of ( type-id , type-id )
4688 __is_class ( type-id )
4689 __is_empty ( type-id )
4690 __is_enum ( type-id )
4691 __is_final ( type-id )
4692 __is_literal_type ( type-id )
4693 __is_pod ( type-id )
4694 __is_polymorphic ( type-id )
4695 __is_std_layout ( type-id )
4696 __is_trivial ( type-id )
4697 __is_union ( type-id )
4699 Objective-C++ Extension:
4701 primary-expression:
4702 objc-expression
4704 literal:
4705 __null
4707 ADDRESS_P is true iff this expression was immediately preceded by
4708 "&" and therefore might denote a pointer-to-member. CAST_P is true
4709 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4710 true iff this expression is a template argument.
4712 Returns a representation of the expression. Upon return, *IDK
4713 indicates what kind of id-expression (if any) was present. */
4715 static cp_expr
4722 {
4725 /* Assume the primary expression is not an id-expression. */
4728 /* Peek at the next token. */
4731 {
4732 /* literal:
4733 integer-literal
4734 character-literal
4735 floating-literal
4736 string-literal
4737 boolean-literal
4738 pointer-literal
4739 user-defined-literal */
4751 {
4755 }
4756 /* Floating-point literals are only allowed in an integral
4757 constant expression if they are cast to an integral or
4758 enumeration type. */
4762 {
4763 /* CAST_P will be set even in invalid code like "int(2.7 +
4764 ...)". Therefore, we have to check that the next token
4765 is sure to end the cast. */
4767 {
4772 enumerator-definition. */
4774 /* The curly brace at the end of an enum-specifier. */
4776 /* The end of a statement. */
4778 /* The end of the cast-expression. */
4780 /* The end of an array bound. */
4782 /* The closing ">" in a template-argument-list. */
4785 /* C++0x only: A ">>" treated like two ">" tokens,
4786 in a template-argument-list. */
4791 }
4793 /* If we are within a cast, then the constraint that the
4794 cast is to an integral or enumeration type will be
4795 checked at that point. If we are not within a cast, then
4796 this code is invalid. */
4799 }
4819 /* ??? Should wide strings be allowed when parser->translate_strings_p
4820 is false (i.e. in attributes)? If not, we can kill the third
4821 argument to cp_parser_string_literal. */
4827 /* If we see `( { ' then we are looking at the beginning of
4828 a GNU statement-expression. */
4831 {
4832 /* Statement-expressions are not allowed by the standard. */
4836 /* And they're not allowed outside of a function-body; you
4837 cannot, for example, write:
4839 int i = ({ int j = 3; j + 1; });
4841 at class or namespace scope. */
4844 {
4846 "statement-expressions are not allowed outside "
4852 }
4853 else
4855 }
4856 /* Otherwise it's a normal parenthesized expression. */
4857 {
4858 cp_expr expr;
4863 /* Consume the `('. */
4865 /* Within a parenthesized expression, a `>' token is always
4866 the greater-than operator. */
4867 saved_greater_than_is_operator_p
4872 /* Left fold expression. */
4874 else
4875 /* Parse the parenthesized expression. */
4880 {
4887 }
4888 else
4889 /* Let the front end know that this expression was
4890 enclosed in parentheses. This matters in case, for
4891 example, the expression is of the form `A::B', since
4892 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4893 not. */
4896 /* DR 705: Wrapping an unqualified name in parentheses
4897 suppresses arg-dependent lookup. We want to pass back
4898 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4899 (c++/37862), but none of the others. */
4903 /* The `>' token might be the end of a template-id or
4904 template-parameter-list now. */
4905 parser->greater_than_is_operator_p
4908 /* Consume the `)'. */
4917 }
4920 {
4922 {
4923 /* We might have an Objective-C++ message. */
4926 /* If that works out, we're done ... */
4929 /* ... else, fall though to see if it's a lambda. */
4930 }
4932 /* Don't warn about a failed tentative parse. */
4937 }
4941 /* We have an Objective-C++ string literal. */
4948 {
4949 /* These two are the boolean literals. */
4957 /* The `__null' literal. */
4962 /* The `nullptr' literal. */
4967 /* Recognize the `this' keyword. */
4971 {
4975 }
4976 /* Pointers cannot appear in constant-expressions. */
4981 /* The `operator' keyword can be the beginning of an
4982 id-expression. */
4989 {
4990 non_integral_constant name;
4992 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4993 __func__ are the names of variables -- but they are
4994 treated specially. Therefore, they are handled here,
4995 rather than relying on the generic id-expression logic
4996 below. Grammatically, these names are id-expressions.
4998 Consume the token. */
5002 {
5014 }
5019 /* Look up the name. */
5021 }
5024 {
5025 tree expression;
5026 tree type;
5027 source_location type_location;
5028 location_t start_loc
5030 /* The `__builtin_va_arg' construct is used to handle
5031 `va_arg'. Consume the `__builtin_va_arg' token. */
5033 /* Look for the opening `('. */
5035 /* Now, parse the assignment-expression. */
5037 /* Look for the `,'. */
5040 /* Parse the type-id. */
5041 {
5044 }
5045 /* Look for the closing `)'. */
5046 location_t finish_loc
5049 /* Using `va_arg' in a constant-expression is not
5050 allowed. */
5052 NIC_VA_ARG))
5054 /* Construct a location of the form:
5055 __builtin_va_arg (v, int)
5056 ~~~~~~~~~~~~~~~~~~~~~^~~~
5057 with the caret at the type, ranging from the start of the
5058 "__builtin_va_arg" token to the close paren. */
5059 location_t combined_loc
5062 }
5093 // C++ concepts
5097 /* Objective-C++ expressions. */
5107 {
5112 }
5116 }
5118 /* An id-expression can start with either an identifier, a
5119 `::' as the beginning of a qualified-id, or the "operator"
5120 keyword. */
5125 {
5126 id_expression:
5127 cp_expr id_expression;
5128 cp_expr decl;
5134 /* Parse the id-expression. */
5135 id_expression
5152 /* If we have a template-id, then no further lookup is
5153 required. If the template-id was for a template-class, we
5154 will sometimes have a TYPE_DECL at this point. */
5158 /* Look up the name. */
5159 else
5160 {
5161 tree ambiguous_decls;
5163 /* If we already know that this lookup is ambiguous, then
5164 we've already issued an error message; there's no reason
5165 to check again. */
5168 {
5171 }
5174 none_type,
5175 template_p,
5180 /* If the lookup was ambiguous, an error will already have
5181 been issued. */
5185 /* In Objective-C++, we may have an Objective-C 2.0
5186 dot-syntax for classes here. */
5191 {
5192 tree component;
5199 component);
5200 /* Build a location of the form:
5201 expr.component
5202 ~~~~~^~~~~~~~~
5203 with caret at the start of the component name (at
5204 input_location), ranging from the start of the id_expression
5205 to the end of the component name. */
5206 location_t combined_loc
5211 }
5213 /* In Objective-C++, an instance variable (ivar) may be preferred
5214 to whatever cp_parser_lookup_name() found.
5215 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5216 rest of c-family, we have to do a little extra work to preserve
5217 any location information in cp_expr "decl". Given that
5218 objc_lookup_ivar is implemented in "c-family" and "objc", we
5219 have a trip through the pure "tree" type, rather than cp_expr.
5220 Naively copying it back to "decl" would implicitly give the
5221 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5222 store an EXPR_LOCATION. Hence we only update "decl" (and
5223 hence its location_t) if we get back a different tree node. */
5225 id_expression);
5229 /* If name lookup gives us a SCOPE_REF, then the
5230 qualifying scope was dependent. */
5232 {
5233 /* At this point, we do not know if DECL is a valid
5234 integral constant expression. We assume that it is
5235 in fact such an expression, so that code like:
5237 template <int N> struct A {
5238 int a[B<N>::i];
5239 };
5241 is accepted. At template-instantiation time, we
5242 will check that B<N>::i is actually a constant. */
5244 }
5245 /* Check to see if DECL is a local variable in a context
5246 where that is forbidden. */
5249 {
5250 /* It might be that we only found DECL because we are
5251 trying to be generous with pre-ISO scoping rules.
5252 For example, consider:
5254 int i;
5255 void g() {
5256 for (int i = 0; i < 10; ++i) {}
5257 extern void f(int j = i);
5258 }
5260 Here, name look up will originally find the out
5261 of scope `i'. We need to issue a warning message,
5262 but then use the global `i'. */
5265 {
5270 }
5271 }
5272 }
5274 decl = (finish_id_expression
5276 idk,
5281 template_arg_p,
5288 }
5290 /* Anything else is an error. */
5294 }
5295 }
5303 {
5306 }
5308 /* Parse an id-expression.
5310 id-expression:
5311 unqualified-id
5312 qualified-id
5314 qualified-id:
5315 :: [opt] nested-name-specifier template [opt] unqualified-id
5316 :: identifier
5317 :: operator-function-id
5318 :: template-id
5320 Return a representation of the unqualified portion of the
5321 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5322 a `::' or nested-name-specifier.
5324 Often, if the id-expression was a qualified-id, the caller will
5325 want to make a SCOPE_REF to represent the qualified-id. This
5326 function does not do this in order to avoid wastefully creating
5327 SCOPE_REFs when they are not required.
5329 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5330 `template' keyword.
5332 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5333 uninstantiated templates.
5335 If *TEMPLATE_P is non-NULL, it is set to true iff the
5336 `template' keyword is used to explicitly indicate that the entity
5337 named is a template.
5339 If DECLARATOR_P is true, the id-expression is appearing as part of
5340 a declarator, rather than as part of an expression. */
5342 static cp_expr
5349 {
5353 /* Assume the `template' keyword was not used. */
5357 /* Look for the optional `::' operator. */
5358 global_scope_p
5361 /* Look for the optional nested-name-specifier. */
5362 nested_name_specifier_p
5365 check_dependency_p,
5367 declarator_p)
5369 /* If there is a nested-name-specifier, then we are looking at
5370 the first qualified-id production. */
5372 {
5373 tree saved_scope;
5374 tree saved_object_scope;
5375 tree saved_qualifying_scope;
5376 tree unqualified_id;
5379 /* See if the next token is the `template' keyword. */
5383 /* Name lookup we do during the processing of the
5384 unqualified-id might obliterate SCOPE. */
5388 /* Process the final unqualified-id. */
5390 check_dependency_p,
5391 declarator_p,
5393 /* Restore the SAVED_SCOPE for our caller. */
5399 }
5400 /* Otherwise, if we are in global scope, then we are looking at one
5401 of the other qualified-id productions. */
5403 {
5405 tree id;
5407 /* Peek at the next token. */
5410 /* If it's an identifier, and the next token is not a "<", then
5411 we can avoid the template-id case. This is an optimization
5412 for this common case. */
5414 && !cp_parser_nth_token_starts_template_argument_list_p
5419 /* Try a template-id. */
5423 none_type,
5424 declarator_p);
5425 /* If that worked, we're done. */
5429 /* Peek at the next token. (Changes in the token buffer may
5430 have invalidated the pointer obtained above.) */
5434 {
5441 /* Fall through. */
5446 }
5447 }
5448 else
5451 declarator_p,
5452 optional_p);
5453 }
5455 /* Parse an unqualified-id.
5457 unqualified-id:
5458 identifier
5459 operator-function-id
5460 conversion-function-id
5461 ~ class-name
5462 template-id
5464 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5465 keyword, in a construct like `A::template ...'.
5467 Returns a representation of unqualified-id. For the `identifier'
5468 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5469 production a BIT_NOT_EXPR is returned; the operand of the
5470 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5471 other productions, see the documentation accompanying the
5472 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5473 names are looked up in uninstantiated templates. If DECLARATOR_P
5474 is true, the unqualified-id is appearing as part of a declarator,
5475 rather than as part of an expression. */
5477 static cp_expr
5483 {
5486 /* Peek at the next token. */
5490 {
5492 {
5493 tree id;
5495 /* We don't know yet whether or not this will be a
5496 template-id. */
5498 /* Try a template-id. */
5500 check_dependency_p,
5501 none_type,
5502 declarator_p);
5503 /* If it worked, we're done. */
5506 /* Otherwise, it's an ordinary identifier. */
5508 }
5512 check_dependency_p,
5513 none_type,
5514 declarator_p);
5517 {
5518 tree type_decl;
5519 tree qualifying_scope;
5520 tree object_scope;
5521 tree scope;
5524 /* Consume the `~' token. */
5526 /* Parse the class-name. The standard, as written, seems to
5527 say that:
5529 template <typename T> struct S { ~S (); };
5530 template <typename T> S<T>::~S() {}
5532 is invalid, since `~' must be followed by a class-name, but
5533 `S<T>' is dependent, and so not known to be a class.
5534 That's not right; we need to look in uninstantiated
5535 templates. A further complication arises from:
5537 template <typename T> void f(T t) {
5538 t.T::~T();
5539 }
5541 Here, it is not possible to look up `T' in the scope of `T'
5542 itself. We must look in both the current scope, and the
5543 scope of the containing complete expression.
5545 Yet another issue is:
5547 struct S {
5548 int S;
5549 ~S();
5550 };
5552 S::~S() {}
5554 The standard does not seem to say that the `S' in `~S'
5555 should refer to the type `S' and not the data member
5556 `S::S'. */
5558 /* DR 244 says that we look up the name after the "~" in the
5559 same scope as we looked up the qualifying name. That idea
5560 isn't fully worked out; it's more complicated than that. */
5565 /* Check for invalid scopes. */
5567 {
5571 }
5573 {
5577 scope);
5582 }
5585 /* If the name is of the form "X::~X" it's OK even if X is a
5586 typedef. */
5595 {
5598 }
5600 /* ~auto means the destructor of whatever the object is. */
5602 {
5605 "%<~auto%> only available with "
5609 }
5611 /* If there was an explicit qualification (S::~T), first look
5612 in the scope given by the qualification (i.e., S).
5614 Note: in the calls to cp_parser_class_name below we pass
5615 typename_type so that lookup finds the injected-class-name
5616 rather than the constructor. */
5620 {
5625 typename_type,
5628 declarator_p);
5631 }
5632 /* In "N::S::~S", look in "N" as well. */
5634 {
5639 type_decl
5643 typename_type,
5646 declarator_p);
5649 }
5650 /* In "p->S::~T", look in the scope given by "*p" as well. */
5652 {
5657 type_decl
5661 typename_type,
5664 declarator_p);
5667 }
5668 /* Look in the surrounding context. */
5670 {
5676 type_decl
5680 typename_type,
5683 declarator_p);
5686 {
5687 /* We couldn't find a type with this name. If we're parsing
5688 tentatively, fail and try something else. */
5690 {
5693 }
5694 /* Otherwise, accept it and check for a match at instantiation
5695 time. */
5700 }
5701 }
5702 /* If an error occurred, assume that the name of the
5703 destructor is the same as the name of the qualifying
5704 class. That allows us to keep parsing after running
5705 into ill-formed destructor names. */
5711 /* Check that destructor name and scope match. */
5713 {
5720 }
5722 /* [class.dtor]
5724 A typedef-name that names a class shall not be used as the
5725 identifier in the declarator for a destructor declaration. */
5732 type_decl);
5735 }
5739 {
5740 cp_expr id;
5742 /* This could be a template-id, so we try that first. */
5744 /* Try a template-id. */
5747 none_type,
5748 declarator_p);
5749 /* If that worked, we're done. */
5752 /* We still don't know whether we're looking at an
5753 operator-function-id or a conversion-function-id. */
5755 /* Try an operator-function-id. */
5757 /* If that didn't work, try a conversion-function-id. */
5761 {
5762 /* 17.6.3.3.5 */
5768 }
5771 }
5772 /* Fall through. */
5779 }
5780 }
5782 /* Parse an (optional) nested-name-specifier.
5784 nested-name-specifier: [C++98]
5785 class-or-namespace-name :: nested-name-specifier [opt]
5786 class-or-namespace-name :: template nested-name-specifier [opt]
5788 nested-name-specifier: [C++0x]
5789 type-name ::
5790 namespace-name ::
5791 nested-name-specifier identifier ::
5792 nested-name-specifier template [opt] simple-template-id ::
5794 PARSER->SCOPE should be set appropriately before this function is
5795 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5796 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5797 in name lookups.
5799 Sets PARSER->SCOPE to the class (TYPE) or namespace
5800 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5801 it unchanged if there is no nested-name-specifier. Returns the new
5802 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5804 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5805 part of a declaration and/or decl-specifier. */
5807 static tree
5813 {
5818 /* Remember where the nested-name-specifier starts. */
5820 {
5823 }
5826 {
5827 tree new_scope;
5828 tree old_scope;
5829 tree saved_qualifying_scope;
5832 /* Spot cases that cannot be the beginning of a
5833 nested-name-specifier. */
5836 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5837 the already parsed nested-name-specifier. */
5839 {
5840 /* Grab the nested-name-specifier and continue the loop. */
5842 /* If we originally encountered this nested-name-specifier
5843 with IS_DECLARATION set to false, we will not have
5844 resolved TYPENAME_TYPEs, so we must do so here. */
5847 {
5852 }
5855 }
5857 /* Spot cases that cannot be the beginning of a
5858 nested-name-specifier. On the second and subsequent times
5859 through the loop, we look for the `template' keyword. */
5861 ;
5862 /* A template-id can start a nested-name-specifier. */
5864 ;
5865 /* DR 743: decltype can be used in a nested-name-specifier. */
5867 ;
5868 else
5869 {
5870 /* If the next token is not an identifier, then it is
5871 definitely not a type-name or namespace-name. */
5874 /* If the following token is neither a `<' (to begin a
5875 template-id), nor a `::', then we are not looking at a
5876 nested-name-specifier. */
5882 {
5886 }
5889 && !cp_parser_nth_token_starts_template_argument_list_p
5892 }
5894 /* The nested-name-specifier is optional, so we parse
5895 tentatively. */
5898 /* Look for the optional `template' keyword, if this isn't the
5899 first time through the loop. */
5902 else
5905 /* Save the old scope since the name lookup we are about to do
5906 might destroy it. */
5909 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5910 look up names in "X<T>::I" in order to determine that "Y" is
5911 a template. So, if we have a typename at this point, we make
5912 an effort to look through it. */
5914 && !typename_keyword_p
5919 /* Parse the qualifying entity. */
5920 new_scope
5922 typename_keyword_p,
5923 template_keyword_p,
5924 check_dependency_p,
5925 type_p,
5926 is_declaration);
5927 /* Look for the `::' token. */
5930 /* If we found what we wanted, we keep going; otherwise, we're
5931 done. */
5933 {
5936 /* Restore the OLD_SCOPE since it was valid before the
5937 failed attempt at finding the last
5938 class-or-namespace-name. */
5942 /* If the next token is a decltype, and the one after that is a
5943 `::', then the decltype has failed to resolve to a class or
5944 enumeration type. Give this error even when parsing
5945 tentatively since it can't possibly be valid--and we're going
5946 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5947 won't get another chance.*/
5951 {
5958 /* As below. */
5961 }
5965 {
5966 /* If we have a non-type template-id followed by ::, it can't
5967 possibly be valid. */
5972 {
5975 {
5981 }
5982 else
5983 {
5984 /* Variable template. */
5989 }
5996 /* As below. */
6000 }
6001 }
6005 /* If the next token is an identifier, and the one after
6006 that is a `::', then any valid interpretation would have
6007 found a class-or-namespace-name. */
6013 {
6016 {
6018 {
6019 tree decl;
6020 tree ambiguous_decls;
6023 none_type,
6032 decl);
6034 {
6035 // cp_parser_lookup_name has the same diagnostic,
6036 // thus make sure to emit it at most once.
6039 {
6044 }
6046 }
6047 else
6048 {
6050 cp_parser_name_lookup_error
6053 else
6054 cp_parser_name_lookup_error
6057 }
6058 }
6061 /* Treat this as a successful nested-name-specifier
6062 due to:
6064 [basic.lookup.qual]
6066 If the name found is not a class-name (clause
6067 _class_) or namespace-name (_namespace.def_), the
6068 program is ill-formed. */
6070 }
6072 }
6074 }
6075 /* We've found one valid nested-name-specifier. */
6077 /* Name lookup always gives us a DECL. */
6080 /* Uses of "template" must be followed by actual templates. */
6092 new_scope);
6093 /* If it is a class scope, try to complete it; we are about to
6094 be looking up names inside the class. */
6096 /* Since checking types for dependency can be expensive,
6097 avoid doing it if the type is already complete. */
6099 /* Do not try to complete dependent types. */
6101 {
6103 /* If it is a typedef to current class, use the current
6104 class instead, as the typedef won't have any names inside
6105 it yet. */
6109 }
6110 /* Make sure we look in the right scope the next time through
6111 the loop. */
6113 }
6115 /* If parsing tentatively, replace the sequence of tokens that makes
6116 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6117 token. That way, should we re-parse the token stream, we will
6118 not have to repeat the effort required to do the parse, nor will
6119 we issue duplicate error messages. */
6121 {
6125 /* Reset the contents of the START token. */
6127 /* Retrieve any deferred checks. Do not pop this access checks yet
6128 so the memory will not be reclaimed during token replacing below. */
6136 /* Purge all subsequent tokens. */
6138 }
6144 }
6146 /* Parse a nested-name-specifier. See
6147 cp_parser_nested_name_specifier_opt for details. This function
6148 behaves identically, except that it will an issue an error if no
6149 nested-name-specifier is present. */
6151 static tree
6157 {
6158 tree scope;
6160 /* Look for the nested-name-specifier. */
6162 typename_keyword_p,
6163 check_dependency_p,
6164 type_p,
6165 is_declaration);
6166 /* If it was not present, issue an error message. */
6168 {
6171 }
6174 }
6176 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6177 this is either a class-name or a namespace-name (which corresponds
6178 to the class-or-namespace-name production in the grammar). For
6179 C++0x, it can also be a type-name that refers to an enumeration
6180 type or a simple-template-id.
6182 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6183 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6184 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6185 TYPE_P is TRUE iff the next name should be taken as a class-name,
6186 even the same name is declared to be another entity in the same
6187 scope.
6189 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6190 specified by the class-or-namespace-name. If neither is found the
6191 ERROR_MARK_NODE is returned. */
6193 static tree
6200 {
6201 tree saved_scope;
6202 tree saved_qualifying_scope;
6203 tree saved_object_scope;
6204 tree scope;
6208 /* DR 743: decltype can appear in a nested-name-specifier. */
6210 {
6214 {
6217 }
6221 }
6223 /* Before we try to parse the class-name, we must save away the
6224 current PARSER->SCOPE since cp_parser_class_name will destroy
6225 it. */
6229 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6230 there is no need to look for a namespace-name. */
6231 only_class_p = template_keyword_p
6236 typename_keyword_p,
6237 template_keyword_p,
6239 check_dependency_p,
6241 is_declaration,
6244 /* If that didn't work, try for a namespace-name. */
6246 {
6247 /* Restore the saved scope. */
6251 /* If we are not looking at an identifier followed by the scope
6252 resolution operator, then this is not part of a
6253 nested-name-specifier. (Note that this function is only used
6254 to parse the components of a nested-name-specifier.) */
6259 }
6262 }
6264 /* Return true if we are looking at a compound-literal, false otherwise. */
6266 static bool
6268 {
6269 /* Consume the `('. */
6274 /* Skip tokens until the next token is a closing parenthesis.
6275 If we find the closing `)', and the next token is a `{', then
6276 we are looking at a compound-literal. */
6277 bool compound_literal_p
6282 /* Roll back the tokens we skipped. */
6286 }
6288 /* Parse a postfix-expression.
6290 postfix-expression:
6291 primary-expression
6292 postfix-expression [ expression ]
6293 postfix-expression ( expression-list [opt] )
6294 simple-type-specifier ( expression-list [opt] )
6295 typename :: [opt] nested-name-specifier identifier
6296 ( expression-list [opt] )
6297 typename :: [opt] nested-name-specifier template [opt] template-id
6298 ( expression-list [opt] )
6299 postfix-expression . template [opt] id-expression
6300 postfix-expression -> template [opt] id-expression
6301 postfix-expression . pseudo-destructor-name
6302 postfix-expression -> pseudo-destructor-name
6303 postfix-expression ++
6304 postfix-expression --
6305 dynamic_cast < type-id > ( expression )
6306 static_cast < type-id > ( expression )
6307 reinterpret_cast < type-id > ( expression )
6308 const_cast < type-id > ( expression )
6309 typeid ( expression )
6310 typeid ( type-id )
6312 GNU Extension:
6314 postfix-expression:
6315 ( type-id ) { initializer-list , [opt] }
6317 This extension is a GNU version of the C99 compound-literal
6318 construct. (The C99 grammar uses `type-name' instead of `type-id',
6319 but they are essentially the same concept.)
6321 If ADDRESS_P is true, the postfix expression is the operand of the
6322 `&' operator. CAST_P is true if this expression is the target of a
6323 cast.
6325 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6326 class member access expressions [expr.ref].
6328 Returns a representation of the expression. */
6330 static cp_expr
6334 {
6336 location_t loc;
6343 /* Peek at the next token. */
6348 /* Some of the productions are determined by keywords. */
6351 {
6356 {
6357 tree type;
6358 cp_expr expression;
6362 /* All of these can be handled in the same way from the point
6363 of view of parsing. Begin by consuming the token
6364 identifying the cast. */
6367 /* New types cannot be defined in the cast. */
6369 parser->type_definition_forbidden_message
6372 /* Look for the opening `<'. */
6374 /* Parse the type to which we are casting. */
6379 /* Look for the closing `>'. */
6381 /* Restore the old message. */
6384 bool saved_greater_than_is_operator_p
6388 /* And the expression which is being cast. */
6392 RT_CLOSE_PAREN);
6396 parser->greater_than_is_operator_p
6399 /* Only type conversions to integral or enumeration types
6400 can be used in constant-expressions. */
6406 {
6408 postfix_expression
6412 postfix_expression
6416 postfix_expression
6418 tf_warning_or_error);
6421 postfix_expression
6426 }
6428 /* Construct a location e.g. :
6429 reinterpret_cast <int *> (expr)
6430 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6431 ranging from the start of the "*_cast" token to the final closing
6432 paren, with the caret at the start. */
6435 }
6439 {
6440 tree type;
6444 /* Consume the `typeid' token. */
6446 /* Look for the `(' token. */
6448 /* Types cannot be defined in a `typeid' expression. */
6450 parser->type_definition_forbidden_message
6452 /* We can't be sure yet whether we're looking at a type-id or an
6453 expression. */
6455 /* Try a type-id first. */
6460 /* Look for the `)' token. Otherwise, we can't be sure that
6461 we're not looking at an expression: consider `typeid (int
6462 (3))', for example. */
6464 /* If all went well, simply lookup the type-id. */
6467 /* Otherwise, fall back to the expression variant. */
6468 else
6469 {
6470 tree expression;
6472 /* Look for an expression. */
6474 /* Compute its typeid. */
6476 /* Look for the `)' token. */
6478 }
6479 /* Restore the saved message. */
6481 /* `typeid' may not appear in an integral constant expression. */
6484 }
6488 {
6489 tree type;
6490 /* The syntax permitted here is the same permitted for an
6491 elaborated-type-specifier. */
6498 }
6502 {
6503 location_t cilk_spawn_loc
6508 {
6513 }
6515 {
6520 }
6521 else
6522 {
6523 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6526 }
6528 postfix_expression =
6532 {
6536 }
6538 {
6543 }
6544 else
6545 {
6548 postfix_expression);
6549 /* Build a location of the form:
6550 _Cilk_spawn expr
6551 ~~~~~~~~~~~~^~~~
6552 with caret at the expr, ranging from the start of the
6553 _Cilk_spawn token to the end of the expression. */
6554 location_t combined_loc =
6560 }
6562 }
6565 {
6568 tree p;
6582 tf_warning_or_error);
6585 tf_warning_or_error);
6586 else
6587 {
6591 }
6593 }
6596 {
6597 tree type;
6599 /* If the next thing is a simple-type-specifier, we may be
6600 looking at a functional cast. We could also be looking at
6601 an id-expression. So, we try the functional cast, and if
6602 that doesn't work we fall back to the primary-expression. */
6604 /* Look for the simple-type-specifier. */
6608 CP_PARSER_FLAGS_NONE);
6610 /* Parse the cast itself. */
6612 postfix_expression
6614 /* If that worked, we're done. */
6618 /* If the functional-cast didn't work out, try a
6619 compound-literal. */
6622 {
6627 /* Avoid calling cp_parser_type_id pointlessly, see comment
6628 in cp_parser_cast_expression about c++/29234. */
6631 else
6632 {
6633 /* Parse the type. */
6638 /* Look for the `)'. */
6640 }
6642 /* If things aren't going well, there's no need to
6643 keep going. */
6645 {
6647 /* Parse the brace-enclosed initializer list. */
6650 }
6651 /* If that worked, we're definitely looking at a
6652 compound-literal expression. */
6654 {
6655 /* Warn the user that a compound literal is not
6656 allowed in standard C++. */
6659 /* For simplicity, we disallow compound literals in
6660 constant-expressions. We could
6661 allow compound literals of integer type, whose
6662 initializer was a constant, in constant
6663 expressions. Permitting that usage, as a further
6664 extension, would not change the meaning of any
6665 currently accepted programs. (Of course, as
6666 compound literals are not part of ISO C++, the
6667 standard has nothing to say.) */
6669 NIC_NCC))
6670 {
6673 }
6674 /* Form the representation of the compound-literal. */
6675 postfix_expression
6677 tf_warning_or_error);
6680 }
6681 }
6683 /* It must be a primary-expression. */
6684 postfix_expression
6687 decltype_p,
6689 }
6691 }
6693 /* Note that we don't need to worry about calling build_cplus_new on a
6694 class-valued CALL_EXPR in decltype when it isn't the end of the
6695 postfix-expression; unary_complex_lvalue will take care of that for
6696 all these cases. */
6698 /* Keep looping until the postfix-expression is complete. */
6700 {
6704 /* It is not a Koenig lookup function call. */
6705 postfix_expression
6708 /* Peek at the next token. */
6712 {
6715 {
6717 "two consecutive %<[%> shall "
6720 }
6721 postfix_expression
6723 postfix_expression,
6725 decltype_p);
6734 /* postfix-expression ( expression-list [opt] ) */
6735 {
6746 is_builtin_constant_p
6749 {
6750 /* The whole point of __builtin_constant_p is to allow
6751 non-constant expressions to appear as arguments. */
6752 saved_integral_constant_expression_p
6754 saved_non_integral_constant_expression_p
6757 }
6758 args = (cp_parser_parenthesized_expression_list
6764 {
6765 parser->integral_constant_expression_p
6767 parser->non_integral_constant_expression_p
6769 }
6772 {
6775 }
6777 /* Function calls are not permitted in
6778 constant-expressions. */
6781 NIC_FUNC_CALL))
6782 {
6786 }
6791 {
6793 {
6795 {
6798 postfix_expression
6800 complain);
6801 }
6802 else
6803 postfix_expression
6805 }
6806 /* We do not perform argument-dependent lookup if
6807 normal lookup finds a non-function, in accordance
6808 with the expected resolution of DR 218. */
6811 {
6815 /* Do not do argument dependent lookup if regular
6816 lookup finds a member function or a block-scope
6817 function declaration. [basic.lookup.argdep]/3 */
6820 {
6823 postfix_expression
6825 complain);
6826 }
6827 }
6828 }
6831 {
6841 "%<memset%> used with constant zero length "
6842 "parameter; this could be due to transposed "
6844 }
6847 {
6857 {
6858 postfix_expression
6862 }
6865 {
6866 postfix_expression
6867 = (build_new_method_call
6873 complain));
6874 }
6875 else
6876 postfix_expression
6880 complain);
6881 }
6885 postfix_expression = (build_offset_ref_call_from_tree
6887 complain));
6889 /* A call to a static class member, or a namespace-scope
6890 function. */
6891 postfix_expression
6894 koenig_p,
6895 complain);
6896 else
6897 /* All other function calls. */
6898 postfix_expression
6901 koenig_p,
6902 complain);
6905 {
6907 start_loc,
6908 close_paren_loc);
6910 }
6912 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6916 }
6921 /* postfix-expression . template [opt] id-expression
6922 postfix-expression . pseudo-destructor-name
6923 postfix-expression -> template [opt] id-expression
6924 postfix-expression -> pseudo-destructor-name */
6926 /* Consume the `.' or `->' operator. */
6929 postfix_expression
6931 postfix_expression,
6938 /* postfix-expression ++ */
6939 /* Consume the `++' token. */
6941 /* Generate a representation for the complete expression. */
6942 postfix_expression
6944 POSTINCREMENT_EXPR);
6945 /* Increments may not appear in constant-expressions. */
6953 /* postfix-expression -- */
6954 /* Consume the `--' token. */
6956 /* Generate a representation for the complete expression. */
6957 postfix_expression
6959 POSTDECREMENT_EXPR);
6960 /* Decrements may not appear in constant-expressions. */
6971 return is_member_access
6972 ? postfix_expression
6974 else
6976 }
6977 }
6979 /* We should never get here. */
6982 }
6984 /* This function parses Cilk Plus array notations. If a normal array expr. is
6985 parsed then the array index is passed back to the caller through *INIT_INDEX
6986 and the function returns a NULL_TREE. If array notation expr. is parsed,
6987 then *INIT_INDEX is ignored by the caller and the function returns
6988 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6989 error_mark_node. */
6991 static tree
6993 tree array_value)
6994 {
6998 {
7001 }
7010 {
7013 }
7015 {
7016 /* Consume the ':'. */
7019 /* If we are here, then we have a case like this A[:]. */
7021 {
7025 }
7029 }
7030 else
7031 {
7032 /* If we are here, then there are three valid possibilities:
7033 1. ARRAY [ EXP ]
7034 2. ARRAY [ EXP : EXP ]
7035 3. ARRAY [ EXP : EXP : EXP ] */
7039 {
7040 /* This indicates that we have a normal array expression. */
7043 }
7045 /* Consume the ':'. */
7049 {
7052 }
7053 }
7058 {
7062 }
7068 }
7070 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7071 by cp_parser_builtin_offsetof. We're looking for
7073 postfix-expression [ expression ]
7074 postfix-expression [ braced-init-list ] (C++11)
7076 FOR_OFFSETOF is set if we're being called in that context, which
7077 changes how we deal with integer constant expressions. */
7079 static tree
7081 tree postfix_expression,
7084 {
7089 /* Consume the `[' token. */
7095 /* Parse the index expression. */
7096 /* ??? For offsetof, there is a question of what to allow here. If
7097 offsetof is not being used in an integral constant expression context,
7098 then we *could* get the right answer by computing the value at runtime.
7099 If we are in an integral constant expression context, then we might
7100 could accept any constant expression; hard to say without analysis.
7101 Rather than open the barn door too wide right away, allow only integer
7102 constant expressions here. */
7105 else
7106 {
7108 {
7115 {
7117 "braced list index is not allowed with array "
7121 }
7122 }
7124 {
7125 /* Here are have these two options:
7126 ARRAY[EXP : EXP] - Array notation expr with default
7127 stride of 1.
7128 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7129 stride. */
7131 postfix_expression);
7134 }
7135 else
7137 }
7141 /* Look for the closing `]'. */
7144 /* Build the ARRAY_REF. */
7148 /* When not doing offsetof, array references are not permitted in
7149 constant-expressions. */
7155 }
7157 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7158 by cp_parser_builtin_offsetof. We're looking for
7160 postfix-expression . template [opt] id-expression
7161 postfix-expression . pseudo-destructor-name
7162 postfix-expression -> template [opt] id-expression
7163 postfix-expression -> pseudo-destructor-name
7165 FOR_OFFSETOF is set if we're being called in that context. That sorta
7166 limits what of the above we'll actually accept, but nevermind.
7167 TOKEN_TYPE is the "." or "->" token, which will already have been
7168 removed from the stream. */
7170 static tree
7173 cp_expr postfix_expression,
7175 location_t location)
7176 {
7177 tree name;
7183 /* If this is a `->' operator, dereference the pointer. */
7186 tf_warning_or_error);
7187 /* Check to see whether or not the expression is type-dependent. */
7189 /* The identifier following the `->' or `.' is not qualified. */
7195 /* Enter the scope corresponding to the type of the object
7196 given by the POSTFIX_EXPRESSION. */
7198 {
7200 /* According to the standard, no expression should ever have
7201 reference type. Unfortunately, we do not currently match
7202 the standard in this respect in that our internal representation
7203 of an expression may have reference type even when the standard
7204 says it does not. Therefore, we have to manually obtain the
7205 underlying type here. */
7207 /* The type of the POSTFIX_EXPRESSION must be complete. */
7209 {
7213 }
7214 /* Unlike the object expression in other contexts, *this is not
7215 required to be of complete type for purposes of class member
7216 access (5.2.5) outside the member function body. */
7220 /* Let the name lookup machinery know that we are processing a
7221 class member access expression. */
7223 /* If something went wrong, we want to be able to discern that case,
7224 as opposed to the case where there was no SCOPE due to the type
7225 of expression being dependent. */
7228 /* If the SCOPE was erroneous, make the various semantic analysis
7229 functions exit quickly -- and without issuing additional error
7230 messages. */
7233 }
7235 /* Assume this expression is not a pseudo-destructor access. */
7238 /* If the SCOPE is a scalar type, then, if this is a valid program,
7239 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7240 is type dependent, it can be pseudo-destructor-name or something else.
7241 Try to parse it as pseudo-destructor-name first. */
7243 {
7244 tree s;
7245 tree type;
7248 /* Parse the pseudo-destructor-name. */
7257 {
7259 postfix_expression
7262 }
7263 }
7266 {
7267 /* If the SCOPE is not a scalar type, we are looking at an
7268 ordinary class member access expression, rather than a
7269 pseudo-destructor-name. */
7272 /* Parse the id-expression. */
7273 name = (cp_parser_id_expression
7280 /* In general, build a SCOPE_REF if the member name is qualified.
7281 However, if the name was not dependent and has already been
7282 resolved; there is no need to build the SCOPE_REF. For example;
7284 struct X { void f(); };
7285 template <typename T> void f(T* t) { t->X::f(); }
7287 Even though "t" is dependent, "X::f" is not and has been resolved
7288 to a BASELINK; there is no need to include scope information. */
7290 /* But we do need to remember that there was an explicit scope for
7291 virtual function calls. */
7295 /* If the name is a template-id that names a type, we will get a
7296 TYPE_DECL here. That is invalid code. */
7298 {
7301 }
7302 else
7303 {
7305 {
7307 {
7311 }
7312 else
7315 name,
7316 template_p);
7320 }
7322 adjust_result_of_qualified_name_lookup
7324 postfix_expression
7326 template_p,
7327 tf_warning_or_error);
7328 /* Build a location e.g.:
7329 ptr->access_expr
7330 ~~~^~~~~~~~~~~~~
7331 where the caret is at the deref token, ranging from
7332 the start of postfix_expression to the end of the access expr. */
7333 location_t end_loc
7335 location_t combined_loc
7338 }
7339 }
7341 /* We no longer need to look up names in the scope of the object on
7342 the left-hand side of the `.' or `->' operator. */
7345 /* Outside of offsetof, these operators may not appear in
7346 constant-expressions. */
7348 && (cp_parser_non_integral_constant_expression
7353 }
7355 /* Parse a parenthesized expression-list.
7357 expression-list:
7358 assignment-expression
7359 expression-list, assignment-expression
7361 attribute-list:
7362 expression-list
7363 identifier
7364 identifier, expression-list
7366 CAST_P is true if this expression is the target of a cast.
7368 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7369 argument pack.
7371 Returns a vector of trees. Each element is a representation of an
7372 assignment-expression. NULL is returned if the ( and or ) are
7373 missing. An empty, but allocated, vector is returned on no
7374 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7375 if we are parsing an attribute list for an attribute that wants a
7376 plain identifier argument, normal_attr for an attribute that wants
7377 an expression, or non_attr if we aren't parsing an attribute list. If
7378 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7379 not all of the expressions in the list were constant.
7380 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7381 will be written to with the location of the closing parenthesis. If
7382 an error occurs, it may or may not be written to. */
7391 {
7397 /* Assume all the expressions will be constant. */
7406 /* Within a parenthesized expression, a `>' token is always
7407 the greater-than operator. */
7408 saved_greater_than_is_operator_p
7412 /* Consume expressions until there are no more. */
7415 {
7416 tree expr;
7418 /* At the beginning of attribute lists, check to see if the
7419 next token is an identifier. */
7422 {
7425 /* Consume the identifier. */
7427 /* Save the identifier. */
7429 }
7430 else
7431 {
7434 /* Parse the next assignment-expression. */
7436 {
7437 /* A braced-init-list. */
7443 }
7445 {
7446 expr = (cp_parser_constant_expression
7451 }
7452 else
7454 cast_p);
7459 /* If we have an ellipsis, then this is an expression
7460 expansion. */
7463 {
7464 /* Consume the `...'. */
7467 /* Build the argument pack. */
7469 }
7471 /* Add it to the list. We add error_mark_node
7472 expressions to the list, so that we can still tell if
7473 the correct form for a parenthesized expression-list
7474 is found. That gives better errors. */
7479 }
7481 /* After the first item, attribute lists look the same as
7482 expression lists. */
7485 get_comma:;
7486 /* If the next token isn't a `,', then we are done. */
7490 /* Otherwise, consume the `,' and keep going. */
7492 }
7498 {
7501 skip_comma:;
7502 /* We try and resync to an unnested comma, as that will give the
7503 user better diagnostics. */
7511 {
7512 parser->greater_than_is_operator_p
7515 }
7516 }
7518 parser->greater_than_is_operator_p
7525 }
7527 /* Parse a pseudo-destructor-name.
7529 pseudo-destructor-name:
7530 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7531 :: [opt] nested-name-specifier template template-id :: ~ type-name
7532 :: [opt] nested-name-specifier [opt] ~ type-name
7534 If either of the first two productions is used, sets *SCOPE to the
7535 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7536 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7537 or ERROR_MARK_NODE if the parse fails. */
7539 static void
7541 tree object,
7544 {
7547 /* Handle ~auto. */
7551 {
7554 "%<~auto%> only available with "
7561 }
7563 /* Assume that things will not work out. */
7566 /* Look for the optional `::' operator. */
7568 /* Look for the optional nested-name-specifier. */
7569 nested_name_specifier_p
7576 /* Now, if we saw a nested-name-specifier, we might be doing the
7577 second production. */
7580 {
7581 /* Consume the `template' keyword. */
7583 /* Parse the template-id. */
7587 class_type,
7589 /* Look for the `::' token. */
7591 }
7592 /* If the next token is not a `~', then there might be some
7593 additional qualification. */
7595 {
7596 /* At this point, we're looking for "type-name :: ~". The type-name
7597 must not be a class-name, since this is a pseudo-destructor. So,
7598 it must be either an enum-name, or a typedef-name -- both of which
7599 are just identifiers. So, we peek ahead to check that the "::"
7600 and "~" tokens are present; if they are not, then we can avoid
7601 calling type_name. */
7605 {
7608 }
7610 /* Look for the type-name. */
7615 /* Look for the `::' token. */
7617 }
7618 else
7621 /* Look for the `~'. */
7624 /* Once we see the ~, this has to be a pseudo-destructor. */
7628 /* Look for the type-name again. We are not responsible for
7629 checking that it matches the first type-name. */
7631 }
7633 /* Parse a unary-expression.
7635 unary-expression:
7636 postfix-expression
7637 ++ cast-expression
7638 -- cast-expression
7639 unary-operator cast-expression
7640 sizeof unary-expression
7641 sizeof ( type-id )
7642 alignof ( type-id ) [C++0x]
7643 new-expression
7644 delete-expression
7646 GNU Extensions:
7648 unary-expression:
7649 __extension__ cast-expression
7650 __alignof__ unary-expression
7651 __alignof__ ( type-id )
7652 alignof unary-expression [C++0x]
7653 __real__ cast-expression
7654 __imag__ cast-expression
7655 && identifier
7656 sizeof ( type-id ) { initializer-list , [opt] }
7657 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7658 __alignof__ ( type-id ) { initializer-list , [opt] }
7660 ADDRESS_P is true iff the unary-expression is appearing as the
7661 operand of the `&' operator. CAST_P is true if this expression is
7662 the target of a cast.
7664 Returns a representation of the expression. */
7666 static cp_expr
7669 {
7673 /* Peek at the next token. */
7675 /* Some keywords give away the kind of expression. */
7677 {
7681 {
7684 {
7687 location_t first_loc;
7690 /* Consume the token. */
7693 /* Parse the operand. */
7698 else
7699 {
7700 /* ISO C++ defines alignof only with types, not with
7701 expressions. So pedwarn if alignof is used with a non-
7702 type expression. However, __alignof__ is ok. */
7705 "ISO C++ does not allow %<alignof%> "
7709 }
7710 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7711 SIZEOF_EXPR with the original operand. */
7713 {
7715 {
7717 {
7720 error_mark_node));
7722 }
7723 else
7727 }
7729 }
7731 }
7740 {
7741 /* The saved value of the PEDANTIC flag. */
7743 tree expr;
7745 /* Save away the PEDANTIC flag. */
7747 /* Parse the cast-expression. */
7749 /* Restore the PEDANTIC flag. */
7753 }
7757 {
7758 tree expression;
7760 /* Consume the `__real__' or `__imag__' token. */
7762 /* Parse the cast-expression. */
7764 /* Create the complete representation. */
7768 expression,
7769 tf_warning_or_error);
7770 }
7778 {
7779 tree expr;
7789 parser->type_definition_forbidden_message
7792 saved_integral_constant_expression_p
7794 saved_non_integral_constant_expression_p
7798 saved_greater_than_is_operator_p
7810 parser->greater_than_is_operator_p
7813 parser->integral_constant_expression_p
7815 parser->non_integral_constant_expression_p
7822 }
7826 }
7827 }
7829 /* Look for the `:: new' and `:: delete', which also signal the
7830 beginning of a new-expression, or delete-expression,
7831 respectively. If the next token is `::', then it might be one of
7832 these. */
7834 {
7837 /* See if the token after the `::' is one of the keywords in
7838 which we're interested. */
7840 /* If it's `new', we have a new-expression. */
7843 /* Similarly, for `delete'. */
7846 }
7848 /* Look for a unary operator. */
7850 /* The `++' and `--' operators can be handled similarly, even though
7851 they are not technically unary-operators in the grammar. */
7853 {
7858 /* Handle the GNU address-of-label extension. */
7861 {
7862 tree identifier;
7863 tree expression;
7866 /* Consume the '&&' token. */
7868 /* Look for the identifier. */
7869 location_t finish_loc
7872 /* Construct a location of the form:
7873 &&label
7874 ^~~~~~~
7875 with caret==start at the "&&", finish at the end of the label. */
7876 location_t combined_loc
7878 /* Create an expression representing the address. */
7881 NIC_ADDR_LABEL))
7884 }
7885 }
7887 {
7888 cp_expr cast_expression;
7894 /* Consume the operator token. */
7898 /* Parse the cast-expression. */
7899 cast_expression
7904 pidk);
7906 /* Make a location:
7907 OP_TOKEN CAST_EXPRESSION
7908 ^~~~~~~~~~~~~~~~~~~~~~~~~
7909 with start==caret at the operator token, and
7910 extending to the end of the cast_expression. */
7913 /* Now, build an appropriate representation. */
7915 {
7919 RO_UNARY_STAR,
7920 complain);
7921 /* TODO: build_x_indirect_ref does not always honor the
7922 location, so ensure it is set. */
7928 /* Fall through. */
7931 cast_expression,
7932 complain);
7933 /* TODO: build_x_unary_op does not always honor the location,
7934 so ensure it is set. */
7942 /* Fall through. */
7944 /* Immediately fold negation of a constant, unless the constant is 0
7945 (since -0 == 0) or it would overflow. */
7950 {
7953 cast_expression);
7955 {
7958 }
7959 }
7960 /* Fall through. */
7969 }
7973 non_constant_p))
7977 }
7981 decltype_p,
7982 pidk);
7983 }
7985 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7986 unary-operator, the corresponding tree code is returned. */
7988 static enum tree_code
7990 {
7992 {
8013 }
8014 }
8016 /* Parse a new-expression.
8018 new-expression:
8019 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8020 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8022 Returns a representation of the expression. */
8024 static tree
8026 {
8029 tree type;
8032 tree ret;
8036 /* Look for the optional `::' operator. */
8037 global_scope_p
8041 /* Look for the `new' operator. */
8043 /* There's no easy way to tell a new-placement from the
8044 `( type-id )' construct. */
8046 /* Look for a new-placement. */
8048 /* If that didn't work out, there's no new-placement. */
8050 {
8054 }
8056 /* If the next token is a `(', then we have a parenthesized
8057 type-id. */
8059 {
8063 /* Consume the `('. */
8066 /* Parse the type-id. */
8067 parser->type_definition_forbidden_message
8069 {
8072 }
8075 /* Look for the closing `)'. */
8078 /* There should not be a direct-new-declarator in this production,
8079 but GCC used to allowed this, so we check and emit a sensible error
8080 message for this case. */
8082 {
8088 }
8089 }
8090 /* Otherwise, there must be a new-type-id. */
8091 else
8094 /* If the next token is a `(' or '{', then we have a new-initializer. */
8099 else
8102 /* A new-expression may not appear in an integral constant
8103 expression. */
8106 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8107 of a new-type-id or type-id of a new-expression, the new-expression shall
8108 contain a new-initializer of the form ( assignment-expression )".
8109 Additionally, consistently with the spirit of DR 1467, we want to accept
8110 'new auto { 2 }' too. */
8115 {
8117 "initialization of new-expression for type %<auto%> "
8120 }
8121 else
8122 {
8123 /* Construct a location e.g.:
8124 ptr = new int[100]
8125 ^~~~~~~~~~~~
8126 with caret == start at the start of the "new" token, and the end
8127 at the end of the final token we consumed. */
8132 /* Create a representation of the new-expression. */
8134 tf_warning_or_error);
8136 }
8144 }
8146 /* Parse a new-placement.
8148 new-placement:
8149 ( expression-list )
8151 Returns the same representation as for an expression-list. */
8155 {
8158 /* Parse the expression-list. */
8159 expression_list = (cp_parser_parenthesized_expression_list
8168 }
8170 /* Parse a new-type-id.
8172 new-type-id:
8173 type-specifier-seq new-declarator [opt]
8175 Returns the TYPE allocated. If the new-type-id indicates an array
8176 type, *NELTS is set to the number of elements in the last array
8177 bound; the TYPE will not include the last array bound. */
8179 static tree
8181 {
8182 cp_decl_specifier_seq type_specifier_seq;
8188 /* The type-specifier sequence must not contain type definitions.
8189 (It cannot contain declarations of new types either, but if they
8190 are not definitions we will catch that because they are not
8191 complete.) */
8193 parser->type_definition_forbidden_message
8195 /* Parse the type-specifier-seq. */
8199 /* Restore the old message. */
8205 /* Parse the new-declarator. */
8208 /* Determine the number of elements in the last array dimension, if
8209 any. */
8211 /* Skip down to the last array dimension. */
8216 {
8219 }
8224 {
8227 }
8230 {
8237 else
8239 }
8242 }
8244 /* Parse an (optional) new-declarator.
8246 new-declarator:
8247 ptr-operator new-declarator [opt]
8248 direct-new-declarator
8250 Returns the declarator. */
8254 {
8257 cp_cv_quals cv_quals;
8259 /* We don't know if there's a ptr-operator next, or not. */
8261 /* Look for a ptr-operator. */
8263 /* If that worked, look for more new-declarators. */
8265 {
8268 /* Parse another optional declarator. */
8271 declarator = cp_parser_make_indirect_declarator
8275 }
8277 /* If the next token is a `[', there is a direct-new-declarator. */
8282 }
8284 /* Parse a direct-new-declarator.
8286 direct-new-declarator:
8287 [ expression ]
8288 direct-new-declarator [constant-expression]
8290 */
8294 {
8298 {
8299 tree expression;
8302 /* Look for the opening `['. */
8307 /* The standard requires that the expression have integral
8308 type. DR 74 adds enumeration types. We believe that the
8309 real intent is that these expressions be handled like the
8310 expression in a `switch' condition, which also allows
8311 classes with a single conversion to integral or
8312 enumeration type. */
8314 {
8315 expression
8317 expression,
8320 {
8322 "expression in new-declarator must have integral "
8325 }
8326 }
8328 /* Look for the closing `]'. */
8331 /* Add this bound to the declarator. */
8334 /* If the next token is not a `[', then there are no more
8335 bounds. */
8338 }
8341 }
8343 /* Parse a new-initializer.
8345 new-initializer:
8346 ( expression-list [opt] )
8347 braced-init-list
8349 Returns a representation of the expression-list. */
8353 {
8357 {
8358 tree t;
8365 }
8366 else
8367 expression_list = (cp_parser_parenthesized_expression_list
8373 }
8375 /* Parse a delete-expression.
8377 delete-expression:
8378 :: [opt] delete cast-expression
8379 :: [opt] delete [ ] cast-expression
8381 Returns a representation of the expression. */
8383 static tree
8385 {
8388 tree expression;
8390 /* Look for the optional `::' operator. */
8391 global_scope_p
8395 /* Look for the `delete' keyword. */
8397 /* See if the array syntax is in use. */
8399 {
8400 /* Consume the `[' token. */
8402 /* Look for the `]' token. */
8404 /* Remember that this is the `[]' construct. */
8406 }
8407 else
8410 /* Parse the cast-expression. */
8413 /* A delete-expression may not appear in an integral constant
8414 expression. */
8419 tf_warning_or_error);
8420 }
8422 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8423 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8424 0 otherwise. */
8426 static int
8428 {
8431 {
8473 /* In ((type ()) () the last () isn't a valid cast-expression,
8474 so the whole must be parsed as postfix-expression. */
8479 /* '[' may start a primary-expression in obj-c++ and in C++11,
8480 as a lambda-expression, eg, '(void)[]{}'. */
8487 /* '++' and '--' may or may not start a cast-expression:
8489 struct T { void operator++(int); };
8490 void f() { (T())++; }
8492 vs
8494 int a;
8495 (int)++a; */
8500 }
8501 }
8503 /* Parse a cast-expression.
8505 cast-expression:
8506 unary-expression
8507 ( type-id ) cast-expression
8509 ADDRESS_P is true iff the unary-expression is appearing as the
8510 operand of the `&' operator. CAST_P is true if this expression is
8511 the target of a cast.
8513 Returns a representation of the expression. */
8515 static cp_expr
8518 {
8519 /* If it's a `(', then we might be looking at a cast. */
8521 {
8527 /* There's no way to know yet whether or not this is a cast.
8528 For example, `(int (3))' is a unary-expression, while `(int)
8529 3' is a cast. So, we resort to parsing tentatively. */
8531 /* Types may not be defined in a cast. */
8533 parser->type_definition_forbidden_message
8535 /* Consume the `('. */
8539 /* A very tricky bit is that `(struct S) { 3 }' is a
8540 compound-literal (which we permit in C++ as an extension).
8541 But, that construct is not a cast-expression -- it is a
8542 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8543 is legal; if the compound-literal were a cast-expression,
8544 you'd need an extra set of parentheses.) But, if we parse
8545 the type-id, and it happens to be a class-specifier, then we
8546 will commit to the parse at that point, because we cannot
8547 undo the action that is done when creating a new class. So,
8548 then we cannot back up and do a postfix-expression.
8550 Another tricky case is the following (c++/29234):
8552 struct S { void operator () (); };
8554 void foo ()
8555 {
8556 ( S()() );
8557 }
8559 As a type-id we parse the parenthesized S()() as a function
8560 returning a function, groktypename complains and we cannot
8561 back up in this case either.
8563 Therefore, we scan ahead to the closing `)', and check to see
8564 if the tokens after the `)' can start a cast-expression. Otherwise
8565 we are dealing with an unary-expression, a postfix-expression
8566 or something else.
8568 Yet another tricky case, in C++11, is the following (c++/54891):
8570 (void)[]{};
8572 The issue is that usually, besides the case of lambda-expressions,
8573 the parenthesized type-id cannot be followed by '[', and, eg, we
8574 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8575 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8576 we don't commit, we try a cast-expression, then an unary-expression.
8578 Save tokens so that we can put them back. */
8581 /* We may be looking at a cast-expression. */
8584 cast_expression
8587 /* Roll back the tokens we skipped. */
8589 /* If we aren't looking at a cast-expression, simulate an error so
8590 that the call to cp_parser_error_occurred below returns true. */
8593 else
8594 {
8597 /* Look for the type-id. */
8599 /* Look for the closing `)'. */
8602 }
8604 /* Restore the saved message. */
8607 /* At this point this can only be either a cast or a
8608 parenthesized ctor such as `(T ())' that looks like a cast to
8609 function returning T. */
8611 {
8612 /* Only commit if the cast-expression doesn't start with
8613 '++', '--', or '[' in C++11. */
8621 pidk);
8624 {
8625 /* Warn about old-style casts, if so requested. */
8632 /* Only type conversions to integral or enumeration types
8633 can be used in constant-expressions. */
8636 NIC_CAST))
8639 /* Perform the cast. */
8640 /* Make a location:
8641 (TYPE) EXPR
8642 ^~~~~~~~~~~
8643 with start==caret at the open paren, extending to the
8644 end of "expr". */
8646 open_paren_loc,
8650 }
8651 }
8652 else
8654 }
8656 /* If we get here, then it's not a cast, so it must be a
8657 unary-expression. */
8660 }
8662 /* Parse a binary expression of the general form:
8664 pm-expression:
8665 cast-expression
8666 pm-expression .* cast-expression
8667 pm-expression ->* cast-expression
8669 multiplicative-expression:
8670 pm-expression
8671 multiplicative-expression * pm-expression
8672 multiplicative-expression / pm-expression
8673 multiplicative-expression % pm-expression
8675 additive-expression:
8676 multiplicative-expression
8677 additive-expression + multiplicative-expression
8678 additive-expression - multiplicative-expression
8680 shift-expression:
8681 additive-expression
8682 shift-expression << additive-expression
8683 shift-expression >> additive-expression
8685 relational-expression:
8686 shift-expression
8687 relational-expression < shift-expression
8688 relational-expression > shift-expression
8689 relational-expression <= shift-expression
8690 relational-expression >= shift-expression
8692 GNU Extension:
8694 relational-expression:
8695 relational-expression <? shift-expression
8696 relational-expression >? shift-expression
8698 equality-expression:
8699 relational-expression
8700 equality-expression == relational-expression
8701 equality-expression != relational-expression
8703 and-expression:
8704 equality-expression
8705 and-expression & equality-expression
8707 exclusive-or-expression:
8708 and-expression
8709 exclusive-or-expression ^ and-expression
8711 inclusive-or-expression:
8712 exclusive-or-expression
8713 inclusive-or-expression | exclusive-or-expression
8715 logical-and-expression:
8716 inclusive-or-expression
8717 logical-and-expression && inclusive-or-expression
8719 logical-or-expression:
8720 logical-and-expression
8721 logical-or-expression || logical-and-expression
8723 All these are implemented with a single function like:
8725 binary-expression:
8726 simple-cast-expression
8727 binary-expression <token> binary-expression
8729 CAST_P is true if this expression is the target of a cast.
8731 The binops_by_token map is used to get the tree codes for each <token> type.
8732 binary-expressions are associated according to a precedence table. */
8734 #define TOKEN_PRECEDENCE(token) \
8735 (((token->type == CPP_GREATER \
8736 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8737 && !parser->greater_than_is_operator_p) \
8738 ? PREC_NOT_OPERATOR \
8739 : binops_by_token[token->type].prec)
8741 static cp_expr
8747 {
8748 cp_parser_expression_stack stack;
8750 cp_parser_expression_stack_entry current;
8751 cp_expr rhs;
8755 tree overload;
8757 /* Parse the first expression. */
8768 {
8769 /* Get an operator token. */
8775 {
8777 "%<>>%> operator is treated"
8781 }
8786 /* This is a fold-expression; handle it later. */
8789 /* Popping an entry off the stack means we completed a subexpression:
8790 - either we found a token which is not an operator (`>' where it is not
8791 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8792 will happen repeatedly;
8793 - or, we found an operator which has lower priority. This is the case
8794 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8795 parsing `3 * 4'. */
8797 {
8800 else
8802 }
8804 get_rhs:
8808 /* We used the operator token. */
8811 /* For "false && x" or "true || x", x will never be executed;
8812 disable warnings while evaluating it. */
8814 c_inhibit_evaluation_warnings +=
8817 c_inhibit_evaluation_warnings +=
8820 /* Extract another operand. It may be the RHS of this expression
8821 or the LHS of a new, higher priority expression. */
8826 /* Get another operator token. Look up its precedence to avoid
8827 building a useless (immediately popped) stack entry for common
8828 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8835 {
8836 /* ... and prepare to parse the RHS of the new, higher priority
8837 expression. Since precedence levels on the stack are
8838 monotonically increasing, we do not have to care about
8839 stack overflows. */
8848 pop:
8850 /* If the stack is not empty, we have parsed into LHS the right side
8851 (`4' in the example above) of an expression we had suspended.
8852 We can use the information on the stack to recover the LHS (`3')
8853 from the stack together with the tree code (`MULT_EXPR'), and
8854 the precedence of the higher level subexpression
8855 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8856 which will be used to actually build the additive expression. */
8861 }
8863 /* Undo the disabling of warnings done above. */
8865 c_inhibit_evaluation_warnings -=
8868 c_inhibit_evaluation_warnings -=
8874 /* Avoid warning for !!x == y. */
8879 /* Avoid warning for !b == y where b is boolean. */
8883 /* Avoid warning for !!b == y where b is boolean. */
8896 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8897 ERROR_MARK for everything that is not a binary expression.
8898 This makes warn_about_parentheses miss some warnings that
8899 involve unary operators. For unary expressions we should
8900 pass the correct tree_code unless the unary expression was
8901 surrounded by parentheses.
8902 */
8909 == tcc_comparison
8912 else
8913 {
8918 /* TODO: build_x_binary_op doesn't always honor the location. */
8920 }
8923 /* If the binary operator required the use of an overloaded operator,
8924 then this expression cannot be an integral constant-expression.
8925 An overloaded operator can be used even if both operands are
8926 otherwise permissible in an integral constant-expression if at
8927 least one of the operands is of enumeration type. */
8931 NIC_OVERLOADED))
8933 }
8936 }
8938 static cp_expr
8943 {
8946 }
8948 /* Parse the `? expression : assignment-expression' part of a
8949 conditional-expression. The LOGICAL_OR_EXPR is the
8950 logical-or-expression that started the conditional-expression.
8951 Returns a representation of the entire conditional-expression.
8953 This routine is used by cp_parser_assignment_expression.
8955 ? expression : assignment-expression
8957 GNU Extensions:
8959 ? : assignment-expression */
8961 static tree
8963 {
8965 cp_expr assignment_expr;
8969 /* Consume the `?' token. */
8974 {
8977 /* Implicit true clause. */
8979 c_inhibit_evaluation_warnings +=
8982 }
8983 else
8984 {
8987 /* Parse the expression. */
8988 c_inhibit_evaluation_warnings +=
8991 c_inhibit_evaluation_warnings +=
8995 }
8997 /* The next token should be a `:'. */
8999 /* Parse the assignment-expression. */
9001 c_inhibit_evaluation_warnings -=
9004 /* Make a location:
9005 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9006 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9007 with the caret at the "?", ranging from the start of
9008 the logical_or_expr to the end of the assignment_expr. */
9013 /* Build the conditional-expression. */
9015 expr,
9016 assignment_expr,
9017 tf_warning_or_error);
9018 }
9020 /* Parse an assignment-expression.
9022 assignment-expression:
9023 conditional-expression
9024 logical-or-expression assignment-operator assignment_expression
9025 throw-expression
9027 CAST_P is true if this expression is the target of a cast.
9028 DECLTYPE_P is true if this expression is the operand of decltype.
9030 Returns a representation for the expression. */
9032 static cp_expr
9035 {
9036 cp_expr expr;
9038 /* If the next token is the `throw' keyword, then we're looking at
9039 a throw-expression. */
9042 /* Otherwise, it must be that we are looking at a
9043 logical-or-expression. */
9044 else
9045 {
9046 /* Parse the binary expressions (logical-or-expression). */
9048 decltype_p,
9050 /* If the next token is a `?' then we're actually looking at a
9051 conditional-expression. */
9054 else
9055 {
9058 /* If it's an assignment-operator, we're using the second
9059 production. */
9060 enum tree_code assignment_operator
9063 {
9066 /* Parse the right-hand side of the assignment. */
9073 /* An assignment may not appear in a
9074 constant-expression. */
9076 NIC_ASSIGNMENT))
9078 /* Build the assignment expression. Its default
9079 location:
9080 LHS = RHS
9081 ~~~~^~~~~
9082 is the location of the '=' token as the
9083 caret, ranging from the start of the lhs to the
9084 end of the rhs. */
9089 assignment_operator,
9090 rhs,
9092 /* TODO: build_x_modify_expr doesn't honor the location,
9093 so we must set it here. */
9095 }
9096 }
9097 }
9100 }
9102 /* Parse an (optional) assignment-operator.
9104 assignment-operator: one of
9105 = *= /= %= += -= >>= <<= &= ^= |=
9107 GNU Extension:
9109 assignment-operator: one of
9110 <?= >?=
9112 If the next token is an assignment operator, the corresponding tree
9113 code is returned, and the token is consumed. For example, for
9114 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9115 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9116 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9117 operator, ERROR_MARK is returned. */
9119 static enum tree_code
9121 {
9125 /* Peek at the next token. */
9129 {
9175 /* Nothing else is an assignment operator. */
9177 }
9179 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9184 /* If it was an assignment operator, consume it. */
9189 }
9191 /* Parse an expression.
9193 expression:
9194 assignment-expression
9195 expression , assignment-expression
9197 CAST_P is true if this expression is the target of a cast.
9198 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9199 except possibly parenthesized or on the RHS of a comma (N3276).
9201 Returns a representation of the expression. */
9203 static cp_expr
9206 {
9211 {
9212 cp_expr assignment_expression;
9214 /* Parse the next assignment-expression. */
9215 assignment_expression
9218 /* We don't create a temporary for a call that is the immediate operand
9219 of decltype or on the RHS of a comma. But when we see a comma, we
9220 need to create a temporary for a call on the LHS. */
9225 assignment_expression
9229 /* If this is the first assignment-expression, we can just
9230 save it away. */
9233 else
9234 {
9235 /* Create a location with caret at the comma, ranging
9236 from the start of the LHS to the end of the RHS. */
9241 assignment_expression,
9244 }
9245 /* If the next token is not a comma, or we're in a fold-expression, then
9246 we are done with the expression. */
9250 /* Consume the `,'. */
9253 /* A comma operator cannot appear in a constant-expression. */
9256 }
9259 }
9261 /* Parse a constant-expression.
9263 constant-expression:
9264 conditional-expression
9266 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9267 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9268 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9269 is false, NON_CONSTANT_P should be NULL. */
9271 static cp_expr
9275 {
9279 cp_expr expression;
9281 /* It might seem that we could simply parse the
9282 conditional-expression, and then check to see if it were
9283 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9284 one that the compiler can figure out is constant, possibly after
9285 doing some simplifications or optimizations. The standard has a
9286 precise definition of constant-expression, and we must honor
9287 that, even though it is somewhat more restrictive.
9289 For example:
9291 int i[(2, 3)];
9293 is not a legal declaration, because `(2, 3)' is not a
9294 constant-expression. The `,' operator is forbidden in a
9295 constant-expression. However, GCC's constant-folding machinery
9296 will fold this operation to an INTEGER_CST for `3'. */
9298 /* Save the old settings. */
9300 saved_allow_non_integral_constant_expression_p
9303 /* We are now parsing a constant-expression. */
9305 parser->allow_non_integral_constant_expression_p
9308 /* Although the grammar says "conditional-expression", we parse an
9309 "assignment-expression", which also permits "throw-expression"
9310 and the use of assignment operators. In the case that
9311 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9312 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9313 actually essential that we look for an assignment-expression.
9314 For example, cp_parser_initializer_clauses uses this function to
9315 determine whether a particular assignment-expression is in fact
9316 constant. */
9318 /* Restore the old settings. */
9319 parser->integral_constant_expression_p
9321 parser->allow_non_integral_constant_expression_p
9324 {
9325 /* Require an rvalue constant expression here; that's what our
9326 callers expect. Reference constant expressions are handled
9327 separately in e.g. cp_parser_template_argument. */
9332 }
9335 parser->non_integral_constant_expression_p
9339 }
9341 /* Parse __builtin_offsetof.
9343 offsetof-expression:
9344 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9346 offsetof-member-designator:
9347 id-expression
9348 | offsetof-member-designator "." id-expression
9349 | offsetof-member-designator "[" expression "]"
9350 | offsetof-member-designator "->" id-expression */
9352 static cp_expr
9354 {
9356 tree type;
9357 cp_expr expr;
9358 cp_id_kind dummy;
9360 location_t finish_loc;
9362 /* We're about to accept non-integral-constant things, but will
9363 definitely yield an integral constant expression. Save and
9364 restore these values around our local parsing. */
9370 /* Consume the "__builtin_offsetof" token. */
9372 /* Consume the opening `('. */
9374 /* Parse the type-id. */
9377 /* Look for the `,'. */
9381 /* Build the (type *)null that begins the traditional offsetof macro. */
9383 tf_warning_or_error);
9385 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9389 {
9392 {
9394 /* offsetof-member-designator "[" expression "]" */
9400 /* offsetof-member-designator "->" identifier */
9403 /* FALLTHRU */
9406 /* offsetof-member-designator "." identifier */
9414 /* Consume the ")" token. */
9420 /* Error. We know the following require will fail, but
9421 that gives the proper error message. */
9426 }
9427 }
9429 success:
9430 /* Make a location of the form:
9431 __builtin_offsetof (struct s, f)
9432 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9433 with caret at the type-id, ranging from the start of the
9434 "_builtin_offsetof" token to the close paren. */
9436 /* The result will be an INTEGER_CST, so we need to explicitly
9437 preserve the location. */
9440 failure:
9445 }
9447 /* Parse a trait expression.
9449 Returns a representation of the expression, the underlying type
9450 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9452 static tree
9454 {
9455 cp_trait_kind kind;
9461 {
9549 }
9551 /* Consume the token. */
9556 {
9559 }
9565 {
9568 {
9571 }
9575 }
9577 {
9579 {
9583 {
9586 }
9590 }
9591 }
9595 /* Complete the trait expression, which may mean either processing
9596 the trait expr now or saving it for template instantiation. */
9598 {
9607 }
9608 }
9610 /* Lambdas that appear in variable initializer or default argument scope
9611 get that in their mangling, so we need to record it. We might as well
9612 use the count for function and namespace scopes as well. */
9616 {
9617 tree t;
9619 };
9622 static void
9624 {
9625 tree_int ti;
9627 /* Once we're inside a function, we ignore other scopes and just push
9628 the function again so that popping works properly. */
9635 {
9636 /* Don't reset the count if we're still in the same function. */
9639 }
9640 }
9642 static void
9644 {
9647 }
9649 static void
9651 {
9654 {
9657 }
9659 }
9661 /* Parse a lambda expression.
9663 lambda-expression:
9664 lambda-introducer lambda-declarator [opt] compound-statement
9666 Returns a representation of the expression. */
9668 static cp_expr
9670 {
9672 tree type;
9680 {
9682 {
9686 }
9688 }
9690 {
9692 {
9695 }
9697 }
9699 /* We may be in the middle of deferred access check. Disable
9700 it now. */
9711 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9714 /* Now that we've started the type, add the capture fields for any
9715 explicit captures. */
9718 {
9719 /* Inside the class, surrounding template-parameter-lists do not apply. */
9720 unsigned int saved_num_template_parameter_lists
9724 bool fully_implicit_function_template_p
9728 bool auto_is_implicit_function_template_parm_p
9739 /* By virtue of defining a local class, a lambda expression has access to
9740 the private variables of enclosing classes. */
9745 {
9751 }
9753 {
9756 }
9758 /* The capture list was built up in reverse order; fix that now. */
9770 parser->fully_implicit_function_template_p
9774 parser->auto_is_implicit_function_template_parm_p
9776 }
9780 /* This field is only used during parsing of the lambda. */
9783 /* This lambda shouldn't have any proxies left at this point. */
9785 /* And now that we're done, push proxies for an enclosing lambda. */
9790 else
9796 }
9798 /* Parse the beginning of a lambda expression.
9800 lambda-introducer:
9801 [ lambda-capture [opt] ]
9803 LAMBDA_EXPR is the current representation of the lambda expression. */
9805 static void
9807 {
9808 /* Need commas after the first capture. */
9811 /* Eat the leading `['. */
9814 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9822 {
9825 }
9828 {
9830 tree capture_id;
9831 tree capture_init_expr;
9835 enum capture_kind_type
9836 {
9837 BY_COPY,
9838 BY_REFERENCE
9839 };
9843 {
9846 }
9850 else
9853 /* Possibly capture `this'. */
9855 {
9865 explicit_init_p);
9867 }
9869 /* Remember whether we want to capture as a reference or not. */
9871 {
9874 }
9876 /* Get the identifier. */
9881 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9882 delimiters, but I modified this to stop on unnested ']' as well. It
9883 was already changed to stop on unnested '}', so the
9884 "closing_parenthesis" name is no more misleading with my change. */
9885 {
9891 }
9893 /* Find the initializer for this capture. */
9897 {
9899 /* An explicit initializer exists. */
9902 "lambda capture initializers "
9908 {
9911 }
9912 }
9913 else
9914 {
9917 /* Turn the identifier into an id-expression. */
9918 capture_init_expr
9923 {
9926 }
9930 {
9933 capture_init_expr);
9937 }
9940 {
9943 capture_init_expr))
9947 }
9949 capture_init_expr
9950 = finish_id_expression
9952 capture_init_expr,
9966 {
9969 }
9970 else
9972 }
9976 {
9981 capture_id);
9985 "capture of %qD redundant with by-reference capture "
9987 }
9990 capture_id,
9991 capture_init_expr,
9993 explicit_init_p);
9994 }
9997 }
9999 /* Parse the (optional) middle of a lambda expression.
10001 lambda-declarator:
10002 < template-parameter-list [opt] >
10003 ( parameter-declaration-clause [opt] )
10004 attribute-specifier [opt]
10005 mutable [opt]
10006 exception-specification [opt]
10007 lambda-return-type-clause [opt]
10009 LAMBDA_EXPR is the current representation of the lambda expression. */
10011 static bool
10013 {
10014 /* 5.1.1.4 of the standard says:
10015 If a lambda-expression does not include a lambda-declarator, it is as if
10016 the lambda-declarator were ().
10017 This means an empty parameter list, no attributes, and no exception
10018 specification. */
10025 /* The template-parameter-list is optional, but must begin with
10026 an opening angle if present. */
10028 {
10031 "lambda templates are only available with "
10040 /* We just processed one more parameter list. */
10042 }
10044 /* The parameter-declaration-clause is optional (unless
10045 template-parameter-list was given), but must begin with an
10046 opening parenthesis if present. */
10048 {
10053 /* Parse parameters. */
10056 /* Default arguments shall not be specified in the
10057 parameter-declaration-clause of a lambda-declarator. */
10067 /* Parse optional `mutable' keyword. */
10069 {
10072 }
10076 /* Parse optional exception specification. */
10079 /* Parse optional trailing return type. */
10081 {
10085 }
10087 /* The function parameters must be in scope all the way until after the
10088 trailing-return-type in case of decltype. */
10090 }
10094 /* Create the function call operator.
10096 Messing with declarators like this is no uglier than building up the
10097 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10098 other code. */
10099 {
10100 cp_decl_specifier_seq return_type_specs;
10102 tree fco;
10109 else
10110 /* Maybe we will deduce the return type later. */
10116 sfk_none);
10121 VIRT_SPEC_UNSPECIFIED,
10122 REF_QUAL_NONE,
10123 tx_qual,
10124 exception_spec,
10130 declarator,
10131 attributes);
10133 {
10136 /* Give the object parameter a different name. */
10140 }
10142 {
10146 }
10155 }
10156 }
10158 /* Parse the body of a lambda expression, which is simply
10160 compound-statement
10162 but which requires special handling.
10163 LAMBDA_EXPR is the current representation of the lambda expression. */
10165 static void
10167 {
10172 else
10173 /* Still increment function_depth so that we don't GC in the
10174 middle of an expression. */
10178 /* Clear this in case we're in the middle of a default argument. */
10181 /* Finish the function call operator
10182 - class_specifier
10183 + late_parsing_for_member
10184 + function_definition_after_declarator
10185 + ctor_initializer_opt_and_function_body */
10186 {
10188 tree body;
10190 tree compound_stmt;
10191 tree cap;
10193 /* Let the front end know that we are going to be defining this
10194 function. */
10196 NULL_TREE,
10205 /* Push the proxies for any explicit captures. */
10212 /* 5.1.1.4 of the standard says:
10213 If a lambda-expression does not include a trailing-return-type, it
10214 is as if the trailing-return-type denotes the following type:
10215 * if the compound-statement is of the form
10216 { return attribute-specifier [opt] expression ; }
10217 the type of the returned expression after lvalue-to-rvalue
10218 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10219 (_conv.array_ 4.2), and function-to-pointer conversion
10220 (_conv.func_ 4.3);
10221 * otherwise, void. */
10223 /* In a lambda that has neither a lambda-return-type-clause
10224 nor a deducible form, errors should be reported for return statements
10225 in the body. Since we used void as the placeholder return type, parsing
10226 the body as usual will give such desired behavior. */
10230 {
10234 /* Parse tentatively in case there's more after the initial return
10235 statement. */
10246 {
10248 {
10253 }
10255 /* Will get error here if type not deduced yet. */
10259 }
10260 }
10263 {
10268 }
10272 out:
10276 /* Finish the function and generate code for it if necessary. */
10279 /* Only expand if the call op is not a template. */
10282 }
10288 else
10290 }
10292 /* Statements [gram.stmt.stmt] */
10294 /* Parse a statement.
10296 statement:
10297 labeled-statement
10298 expression-statement
10299 compound-statement
10300 selection-statement
10301 iteration-statement
10302 jump-statement
10303 declaration-statement
10304 try-block
10306 C++11:
10308 statement:
10309 labeled-statement
10310 attribute-specifier-seq (opt) expression-statement
10311 attribute-specifier-seq (opt) compound-statement
10312 attribute-specifier-seq (opt) selection-statement
10313 attribute-specifier-seq (opt) iteration-statement
10314 attribute-specifier-seq (opt) jump-statement
10315 declaration-statement
10316 attribute-specifier-seq (opt) try-block
10318 TM Extension:
10320 statement:
10321 atomic-statement
10323 IN_COMPOUND is true when the statement is nested inside a
10324 cp_parser_compound_statement; this matters for certain pragmas.
10326 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10327 is a (possibly labeled) if statement which is not enclosed in braces
10328 and has an else clause. This is used to implement -Wparentheses.
10330 CHAIN is a vector of if-else-if conditions. */
10332 static void
10335 {
10340 restart:
10343 /* There is no statement yet. */
10349 /* In obj-c++, seeing '[[' might be the either the beginning of
10350 c++11 attributes, or a nested objc-message-expression. So
10351 let's parse the c++11 attributes tentatively. */
10355 {
10358 }
10360 /* Peek at the next token. */
10362 /* Remember the location of the first token in the statement. */
10364 /* If this is a keyword, then that will often determine what kind of
10365 statement we have. */
10367 {
10371 {
10374 /* Looks like a labeled-statement with a case label.
10375 Parse the label, and then use tail recursion to parse
10376 the statement. */
10394 {
10399 }
10400 else
10414 {
10419 }
10420 else
10421 {
10425 }
10429 /* Objective-C++ exception-handling constructs. */
10443 /* This must be a namespace alias definition. */
10459 /* It might be a keyword like `int' that can start a
10460 declaration-statement. */
10462 }
10463 }
10465 {
10466 /* If the next token is a `:', then we are looking at a
10467 labeled-statement. */
10470 {
10471 /* Looks like a labeled-statement with an ordinary label.
10472 Parse the label, and then use tail recursion to parse
10473 the statement. */
10478 }
10479 }
10480 /* Anything that starts with a `{' must be a compound-statement. */
10483 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10484 a statement all its own. */
10486 {
10487 /* Only certain OpenMP pragmas are attached to statements, and thus
10488 are considered statements themselves. All others are not. In
10489 the context of a compound, accept the pragma as a "statement" and
10490 return so that we can check for a close brace. Otherwise we
10491 require a real statement and must go back and read one. */
10497 }
10499 {
10502 }
10504 /* Everything else must be a declaration-statement or an
10505 expression-statement. Try for the declaration-statement
10506 first, unless we are looking at a `;', in which case we know that
10507 we have an expression-statement. */
10509 {
10511 {
10513 {
10514 /* Attributes should be parsed as part of the the
10515 declaration, so let's un-parse them. */
10518 }
10521 /* Try to parse the declaration-statement. */
10523 /* If that worked, we're done. */
10526 }
10527 /* Look for an expression-statement instead. */
10529 }
10531 /* Set the line number for the statement. */
10535 /* Note that for now, we don't do anything with c++11 statements
10536 parsed at this level. */
10539 OPT_Wattributes,
10541 }
10543 /* Parse the label for a labeled-statement, i.e.
10545 identifier :
10546 case constant-expression :
10547 default :
10549 GNU Extension:
10550 case constant-expression ... constant-expression : statement
10552 When a label is parsed without errors, the label is added to the
10553 parse tree by the finish_* functions, so this function doesn't
10554 have to return the label. */
10556 static void
10558 {
10563 /* The next token should be an identifier. */
10567 {
10570 }
10574 {
10576 {
10580 /* Consume the `case' token. */
10582 /* Parse the constant-expression. */
10589 {
10590 /* Consume the `...' token. */
10596 /* We don't need to emit warnings here, as the common code
10597 will do this for us. */
10598 }
10599 else
10604 else
10607 expr);
10608 }
10612 /* Consume the `default' token. */
10617 else
10622 /* Anything else must be an ordinary label. */
10625 }
10627 /* Require the `:' token. */
10630 /* An ordinary label may optionally be followed by attributes.
10631 However, this is only permitted if the attributes are then
10632 followed by a semicolon. This is because, for backward
10633 compatibility, when parsing
10634 lab: __attribute__ ((unused)) int i;
10635 we want the attribute to attach to "i", not "lab". */
10638 {
10639 tree attrs;
10646 ;
10647 else
10649 }
10655 }
10657 /* Parse an expression-statement.
10659 expression-statement:
10660 expression [opt] ;
10662 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10663 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10664 indicates whether this expression-statement is part of an
10665 expression statement. */
10667 static tree
10669 {
10673 /* If the next token is a ';', then there is no expression
10674 statement. */
10676 {
10680 {
10683 }
10684 }
10686 /* Give a helpful message for "A<T>::type t;" and the like. */
10689 {
10696 {
10697 /* A::A a; */
10702 }
10703 }
10705 /* Consume the final `;'. */
10710 /* This is the final expression statement of a statement
10711 expression. */
10717 }
10719 /* Parse a compound-statement.
10721 compound-statement:
10722 { statement-seq [opt] }
10724 GNU extension:
10726 compound-statement:
10727 { label-declaration-seq [opt] statement-seq [opt] }
10729 label-declaration-seq:
10730 label-declaration
10731 label-declaration-seq label-declaration
10733 Returns a tree representing the statement. */
10735 static tree
10738 {
10739 tree compound_stmt;
10741 /* Consume the `{'. */
10748 /* Begin the compound-statement. */
10750 /* If the next keyword is `__label__' we have a label declaration. */
10753 /* Parse an (optional) statement-seq. */
10755 /* Finish the compound-statement. */
10757 /* Consume the `}'. */
10761 }
10763 /* Parse an (optional) statement-seq.
10765 statement-seq:
10766 statement
10767 statement-seq [opt] statement */
10769 static void
10771 {
10772 /* Scan statements until there aren't any more. */
10774 {
10777 /* If we are looking at a `}', then we have run out of
10778 statements; the same is true if we have reached the end
10779 of file, or have stumbled upon a stray '@end'. */
10786 /* If we are in a compound statement and find 'else' then
10787 something went wrong. */
10789 {
10792 else
10793 {
10796 }
10797 }
10799 /* Parse the statement. */
10801 }
10802 }
10804 /* Parse a selection-statement.
10806 selection-statement:
10807 if ( condition ) statement
10808 if ( condition ) statement else statement
10809 switch ( condition ) statement
10811 Returns the new IF_STMT or SWITCH_STMT.
10813 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10814 is a (possibly labeled) if statement which is not enclosed in
10815 braces and has an else clause. This is used to implement
10816 -Wparentheses.
10818 CHAIN is a vector of if-else-if conditions. This is used to implement
10819 -Wduplicated-cond. */
10821 static tree
10824 {
10827 token_indent_info guard_tinfo;
10832 /* Peek at the next token. */
10836 /* See what kind of keyword it is. */
10839 {
10842 {
10843 tree statement;
10844 tree condition;
10846 /* Look for the `('. */
10848 {
10851 }
10853 /* Begin the selection-statement. */
10856 else
10859 /* Parse the condition. */
10861 /* Look for the `)'. */
10867 {
10871 /* Add the condition. */
10878 /* Parse the then-clause. */
10882 guard_tinfo);
10887 /* If the next token is `else', parse the else-clause. */
10889 RID_ELSE))
10890 {
10891 guard_tinfo
10893 /* Consume the `else' keyword. */
10896 {
10898 RID_IF)
10900 {
10901 /* We've got "if (COND) else if (COND2)". Start
10902 the condition chain and add COND as the first
10903 element. */
10907 {
10908 /* Wrap it in a NOP_EXPR so that we can set the
10909 location of the condition. */
10911 condition);
10914 }
10915 }
10917 RID_IF))
10918 {
10919 /* This is if-else without subsequent if. Zap the
10920 condition chain; we would have already warned at
10921 this point. */
10924 }
10925 }
10927 /* Parse the else-clause. */
10933 /* If we are currently parsing a then-clause, then
10934 IF_P will not be NULL. We set it to true to
10935 indicate that this if statement has an else clause.
10936 This may trigger the Wparentheses warning below
10937 when we get back up to the parent if statement. */
10940 }
10941 else
10942 {
10943 /* This if statement does not have an else clause. If
10944 NESTED_IF is true, then the then-clause is an if
10945 statement which does have an else clause. We warn
10946 about the potential ambiguity. */
10949 "suggest explicit braces to avoid ambiguous"
10952 {
10953 /* We don't need the condition chain anymore. */
10956 }
10957 }
10959 /* Now we're all done with the if-statement. */
10961 }
10962 else
10963 {
10967 /* Add the condition. */
10970 /* Parse the body of the switch-statement. */
10976 guard_tinfo);
10980 /* Now we're all done with the switch-statement. */
10982 }
10985 }
10991 }
10992 }
10994 /* Parse a condition.
10996 condition:
10997 expression
10998 type-specifier-seq declarator = initializer-clause
10999 type-specifier-seq declarator braced-init-list
11001 GNU Extension:
11003 condition:
11004 type-specifier-seq declarator asm-specification [opt]
11005 attributes [opt] = assignment-expression
11007 Returns the expression that should be tested. */
11009 static tree
11011 {
11012 cp_decl_specifier_seq type_specifiers;
11016 /* Try the declaration first. */
11018 /* New types are not allowed in the type-specifier-seq for a
11019 condition. */
11021 parser->type_definition_forbidden_message
11023 /* Parse the type-specifier-seq. */
11025 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11028 /* Restore the saved message. */
11030 /* If all is well, we might be looking at a declaration. */
11032 {
11033 tree decl;
11034 tree asm_specification;
11035 tree attributes;
11039 /* Parse the declarator. */
11045 /* Parse the attributes. */
11047 /* Parse the asm-specification. */
11049 /* If the next token is not an `=' or '{', then we might still be
11050 looking at an expression. For example:
11052 if (A(a).x)
11054 looks like a decl-specifier-seq and a declarator -- but then
11055 there is no `=', so this is an expression. */
11060 /* If we did see an `=' or '{', then we are looking at a declaration
11061 for sure. */
11063 {
11064 tree pushed_scope;
11068 /* Create the declaration. */
11074 /* Parse the initializer. */
11076 {
11080 }
11081 else
11082 {
11083 /* Consume the `='. */
11086 }
11090 /* Process the initializer. */
11093 asm_specification,
11094 flags);
11100 }
11101 }
11102 /* If we didn't even get past the declarator successfully, we are
11103 definitely not looking at a declaration. */
11104 else
11107 /* Otherwise, we are looking at an expression. */
11109 }
11111 /* Parses a for-statement or range-for-statement until the closing ')',
11112 not included. */
11114 static tree
11116 {
11120 /* Begin the for-statement. */
11123 /* Parse the initialization. */
11128 else
11130 }
11132 static tree
11134 {
11135 /* Normal for loop */
11138 tree stmt;
11141 /* The for-init-statement has already been parsed in
11142 cp_parser_for_init_statement, so no work is needed here. */
11145 /* If there's a condition, process it. */
11149 {
11153 }
11155 /* Look for the `;'. */
11158 /* If there's an expression, process it. */
11164 }
11166 /* Tries to parse a range-based for-statement:
11168 range-based-for:
11169 decl-specifier-seq declarator : expression
11171 The decl-specifier-seq declarator and the `:' are already parsed by
11172 cp_parser_for_init_statement. If processing_template_decl it returns a
11173 newly created RANGE_FOR_STMT; if not, it is converted to a
11174 regular FOR_STMT. */
11176 static tree
11179 {
11182 /* Get the range declaration momentarily out of the way so that
11183 the range expression doesn't clash with it. */
11188 {
11191 }
11192 else
11195 /* Put the range declaration back into scope. */
11199 /* If in template, STMT is converted to a normal for-statement
11200 at instantiation. If not, it is done just ahead. */
11202 {
11210 /* do_auto_deduction doesn't mess with template init-lists. */
11213 }
11214 else
11215 {
11218 }
11220 }
11222 /* Subroutine of cp_convert_range_for: given the initializer expression,
11223 builds up the range temporary. */
11225 static tree
11227 {
11230 /* Find out the type deduced by the declaration
11231 `auto &&__range = range_expr'. */
11236 /* Create the __range variable. */
11243 }
11245 /* Used by cp_parser_range_for in template context: we aren't going to
11246 do a full conversion yet, but we still need to resolve auto in the
11247 type of the for-range-declaration if present. This is basically
11248 a shortcut version of cp_convert_range_for. */
11250 static void
11252 {
11255 {
11258 iter_type = (cp_parser_perform_range_for_lookup
11261 {
11263 iter_type);
11265 tf_warning_or_error);
11268 }
11269 }
11270 }
11272 /* Converts a range-based for-statement into a normal
11273 for-statement, as per the definition.
11275 for (RANGE_DECL : RANGE_EXPR)
11276 BLOCK
11278 should be equivalent to:
11280 {
11281 auto &&__range = RANGE_EXPR;
11282 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11283 __begin != __end;
11284 ++__begin)
11285 {
11286 RANGE_DECL = *__begin;
11287 BLOCK
11288 }
11289 }
11291 If RANGE_EXPR is an array:
11292 BEGIN_EXPR = __range
11293 END_EXPR = __range + ARRAY_SIZE(__range)
11294 Else if RANGE_EXPR has a member 'begin' or 'end':
11295 BEGIN_EXPR = __range.begin()
11296 END_EXPR = __range.end()
11297 Else:
11298 BEGIN_EXPR = begin(__range)
11299 END_EXPR = end(__range);
11301 If __range has a member 'begin' but not 'end', or vice versa, we must
11302 still use the second alternative (it will surely fail, however).
11303 When calling begin()/end() in the third alternative we must use
11304 argument dependent lookup, but always considering 'std' as an associated
11305 namespace. */
11307 tree
11310 {
11316 /* If an error happened previously do nothing or else a lot of
11317 unhelpful errors would be issued. */
11319 else
11320 {
11321 tree range_temp;
11325 /* Can't bind a reference to an array of runtime bound. */
11327 else
11328 {
11333 LOOKUP_ONLYCONVERTING);
11335 }
11338 }
11340 /* The new for initialization statement. */
11348 LOOKUP_ONLYCONVERTING);
11357 LOOKUP_ONLYCONVERTING);
11361 /* The new for condition. */
11368 /* The new increment expression. */
11371 tf_warning_or_error);
11374 /* The declaration is initialized with *__begin inside the loop body. */
11377 tf_warning_or_error),
11379 LOOKUP_ONLYCONVERTING);
11382 }
11384 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11385 We need to solve both at the same time because the method used
11386 depends on the existence of members begin or end.
11387 Returns the type deduced for the iterator expression. */
11389 static tree
11391 {
11393 {
11396 }
11399 {
11404 }
11406 {
11407 /* If RANGE is an array, we will use pointer arithmetic. */
11410 range,
11414 }
11415 else
11416 {
11417 /* If it is not an array, we must do a bit of magic. */
11427 tf_warning_or_error);
11430 tf_warning_or_error);
11433 {
11434 /* Use the member functions. */
11437 else
11443 else
11446 }
11447 else
11448 {
11449 /* Use global functions with ADL. */
11456 tf_warning_or_error);
11458 tf_warning_or_error);
11460 tf_warning_or_error);
11462 tf_warning_or_error);
11465 }
11467 /* Last common checks. */
11469 {
11470 /* If one of the expressions is an error do no more checks. */
11473 }
11476 /* Can happen, when, eg, in a template context, Koenig lookup
11477 can't resolve begin/end (c++/58503). */
11479 else
11480 {
11482 /* The unqualified type of the __begin and __end temporaries should
11483 be the same, as required by the multiple auto declaration. */
11489 }
11490 }
11491 }
11493 /* Helper function for cp_parser_perform_range_for_lookup.
11494 Builds a tree for RANGE.IDENTIFIER(). */
11496 static tree
11498 {
11511 tf_warning_or_error);
11514 }
11516 /* Parse an iteration-statement.
11518 iteration-statement:
11519 while ( condition ) statement
11520 do statement while ( expression ) ;
11521 for ( for-init-statement condition [opt] ; expression [opt] )
11522 statement
11524 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11526 static tree
11528 {
11531 tree statement;
11533 token_indent_info guard_tinfo;
11535 /* Peek at the next token. */
11542 /* Remember whether or not we are already within an iteration
11543 statement. */
11546 /* See what kind of keyword it is. */
11549 {
11551 {
11552 tree condition;
11554 /* Begin the while-statement. */
11556 /* Look for the `('. */
11558 /* Parse the condition. */
11561 /* Look for the `)'. */
11563 /* Parse the dependent statement. */
11567 /* We're done with the while-statement. */
11569 }
11573 {
11574 tree expression;
11576 /* Begin the do-statement. */
11578 /* Parse the body of the do-statement. */
11583 /* Look for the `while' keyword. */
11585 /* Look for the `('. */
11587 /* Parse the expression. */
11589 /* We're done with the do-statement. */
11591 /* Look for the `)'. */
11593 /* Look for the `;'. */
11595 }
11599 {
11600 /* Look for the `('. */
11605 /* Look for the `)'. */
11608 /* Parse the body of the for-statement. */
11613 /* We're done with the for-statement. */
11615 }
11622 }
11625 }
11627 /* Parse a for-init-statement or the declarator of a range-based-for.
11628 Returns true if a range-based-for declaration is seen.
11630 for-init-statement:
11631 expression-statement
11632 simple-declaration */
11634 static bool
11636 {
11637 /* If the next token is a `;', then we have an empty
11638 expression-statement. Grammatically, this is also a
11639 simple-declaration, but an invalid one, because it does not
11640 declare anything. Therefore, if we did not handle this case
11641 specially, we would issue an error message about an invalid
11642 declaration. */
11644 {
11648 /* A colon is used in range-based for. */
11651 /* We're going to speculatively look for a declaration, falling back
11652 to an expression, if necessary. */
11654 /* Parse the declaration. */
11657 decl);
11660 {
11661 /* It is a range-for, consume the ':' */
11665 {
11667 "range-based %<for%> loops only available with "
11670 }
11671 }
11672 else
11673 /* The ';' is not consumed yet because we told
11674 cp_parser_simple_declaration not to. */
11679 /* If the tentative parse failed, then we shall need to look for an
11680 expression-statement. */
11681 }
11682 /* If we are here, it is an expression-statement. */
11685 }
11687 /* Parse a jump-statement.
11689 jump-statement:
11690 break ;
11691 continue ;
11692 return expression [opt] ;
11693 return braced-init-list ;
11694 goto identifier ;
11696 GNU extension:
11698 jump-statement:
11699 goto * expression ;
11701 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11703 static tree
11705 {
11711 /* Peek at the next token. */
11716 /* See what kind of keyword it is. */
11719 {
11723 {
11743 }
11749 {
11756 /* Fall through. */
11766 }
11771 {
11772 tree expr;
11776 {
11780 }
11783 else
11784 /* If the next token is a `;', then there is no
11785 expression. */
11787 /* Build the return-statement. */
11789 /* Look for the final `;'. */
11791 }
11797 {
11800 }
11802 /* Create the goto-statement. */
11804 {
11805 /* Issue a warning about this use of a GNU extension. */
11807 /* Consume the '*' token. */
11809 /* Parse the dependent expression. */
11811 }
11812 else
11814 /* Look for the final `;'. */
11821 }
11824 }
11826 /* Parse a declaration-statement.
11828 declaration-statement:
11829 block-declaration */
11831 static void
11833 {
11836 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11839 /* Parse the block-declaration. */
11842 /* Free any declarators allocated. */
11844 }
11846 /* Some dependent statements (like `if (cond) statement'), are
11847 implicitly in their own scope. In other words, if the statement is
11848 a single statement (as opposed to a compound-statement), it is
11849 none-the-less treated as if it were enclosed in braces. Any
11850 declarations appearing in the dependent statement are out of scope
11851 after control passes that point. This function parses a statement,
11852 but ensures that is in its own scope, even if it is not a
11853 compound-statement.
11855 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11856 is a (possibly labeled) if statement which is not enclosed in
11857 braces and has an else clause. This is used to implement
11858 -Wparentheses.
11860 CHAIN is a vector of if-else-if conditions. This is used to implement
11861 -Wduplicated-cond.
11863 Returns the new statement. */
11865 static tree
11869 {
11870 tree statement;
11872 token_indent_info body_tinfo
11878 /* Mark if () ; with a special NOP_EXPR. */
11880 {
11891 }
11892 /* if a compound is opened, we simply parse the statement directly. */
11895 /* If the token is not a `{', then we must take special action. */
11896 else
11897 {
11898 /* Create a compound-statement. */
11900 /* Parse the dependent-statement. */
11902 /* Finish the dummy compound-statement. */
11904 }
11906 token_indent_info next_tinfo
11910 /* Return the statement. */
11912 }
11914 /* For some dependent statements (like `while (cond) statement'), we
11915 have already created a scope. Therefore, even if the dependent
11916 statement is a compound-statement, we do not want to create another
11917 scope. */
11919 static void
11922 {
11923 /* If the token is a `{', then we must take special action. */
11925 {
11926 token_indent_info body_tinfo
11930 token_indent_info next_tinfo
11933 }
11934 else
11935 {
11936 /* Avoid calling cp_parser_compound_statement, so that we
11937 don't create a new scope. Do everything else by hand. */
11939 /* If the next keyword is `__label__' we have a label declaration. */
11942 /* Parse an (optional) statement-seq. */
11945 }
11946 }
11948 /* Declarations [gram.dcl.dcl] */
11950 /* Parse an optional declaration-sequence.
11952 declaration-seq:
11953 declaration
11954 declaration-seq declaration */
11956 static void
11958 {
11960 {
11971 {
11972 /* A declaration consisting of a single semicolon is
11973 invalid. Allow it unless we're being pedantic. */
11978 }
11980 /* If we're entering or exiting a region that's implicitly
11981 extern "C", modify the lang context appropriately. */
11983 {
11986 }
11988 {
11991 }
11994 {
11995 /* A top-level declaration can consist solely of a #pragma.
11996 A nested declaration cannot, so this is done here and not
11997 in cp_parser_declaration. (A #pragma at block scope is
11998 handled in cp_parser_statement.) */
12001 }
12003 /* Parse the declaration itself. */
12005 }
12006 }
12008 /* Parse a declaration.
12010 declaration:
12011 block-declaration
12012 function-definition
12013 template-declaration
12014 explicit-instantiation
12015 explicit-specialization
12016 linkage-specification
12017 namespace-definition
12019 GNU extension:
12021 declaration:
12022 __extension__ declaration */
12024 static void
12026 {
12027 cp_token token1;
12028 cp_token token2;
12033 /* Check for the `__extension__' keyword. */
12035 {
12036 /* Parse the qualified declaration. */
12038 /* Restore the PEDANTIC flag. */
12042 }
12044 /* Try to figure out what kind of declaration is present. */
12049 else
12050 {
12053 }
12055 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12058 /* If the next token is `extern' and the following token is a string
12059 literal, then we have a linkage specification. */
12063 /* If the next token is `template', then we have either a template
12064 declaration, an explicit instantiation, or an explicit
12065 specialization. */
12067 {
12068 /* `template <>' indicates a template specialization. */
12072 /* `template <' indicates a template declaration. */
12075 /* Anything else must be an explicit instantiation. */
12076 else
12078 }
12079 /* If the next token is `export', then we have a template
12080 declaration. */
12083 /* If the next token is `extern', 'static' or 'inline' and the one
12084 after that is `template', we have a GNU extended explicit
12085 instantiation directive. */
12092 /* If the next token is `namespace', check for a named or unnamed
12093 namespace definition. */
12102 /* An unnamed namespace definition. */
12106 /* An inline (associated) namespace definition. */
12110 /* Objective-C++ declaration/definition. */
12117 /* At this point we may have a template declared by a concept
12118 introduction. */
12123 else
12124 /* Try to parse a block-declaration, or a function-definition. */
12127 /* Free any declarators allocated. */
12129 }
12131 /* Parse a block-declaration.
12133 block-declaration:
12134 simple-declaration
12135 asm-definition
12136 namespace-alias-definition
12137 using-declaration
12138 using-directive
12140 GNU Extension:
12142 block-declaration:
12143 __extension__ block-declaration
12145 C++0x Extension:
12147 block-declaration:
12148 static_assert-declaration
12150 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12151 part of a declaration-statement. */
12153 static void
12156 {
12160 /* Check for the `__extension__' keyword. */
12162 {
12163 /* Parse the qualified declaration. */
12165 /* Restore the PEDANTIC flag. */
12169 }
12171 /* Peek at the next token to figure out which kind of declaration is
12172 present. */
12175 /* If the next keyword is `asm', we have an asm-definition. */
12177 {
12181 }
12182 /* If the next keyword is `namespace', we have a
12183 namespace-alias-definition. */
12186 /* If the next keyword is `using', we have a
12187 using-declaration, a using-directive, or an alias-declaration. */
12189 {
12194 /* If the token after `using' is `namespace', then we have a
12195 using-directive. */
12199 /* If the second token after 'using' is '=', then we have an
12200 alias-declaration. */
12206 /* Otherwise, it's a using-declaration. */
12207 else
12210 }
12211 /* If the next keyword is `__label__' we have a misplaced label
12212 declaration. */
12214 {
12218 /* If the next token is now a `;', consume it. */
12221 }
12222 /* If the next token is `static_assert' we have a static assertion. */
12225 /* Anything else must be a simple-declaration. */
12226 else
12229 }
12231 /* Parse a simple-declaration.
12233 simple-declaration:
12234 decl-specifier-seq [opt] init-declarator-list [opt] ;
12236 init-declarator-list:
12237 init-declarator
12238 init-declarator-list , init-declarator
12240 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12241 function-definition as a simple-declaration.
12243 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12244 parsed declaration if it is an uninitialized single declarator not followed
12245 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12246 if present, will not be consumed. */
12248 static void
12252 {
12253 cp_decl_specifier_seq decl_specifiers;
12262 /* Defer access checks until we know what is being declared; the
12263 checks for names appearing in the decl-specifier-seq should be
12264 done as if we were in the scope of the thing being declared. */
12267 /* Parse the decl-specifier-seq. We have to keep track of whether
12268 or not the decl-specifier-seq declares a named class or
12269 enumeration type, since that is the only case in which the
12270 init-declarator-list is allowed to be empty.
12272 [dcl.dcl]
12274 In a simple-declaration, the optional init-declarator-list can be
12275 omitted only when declaring a class or enumeration, that is when
12276 the decl-specifier-seq contains either a class-specifier, an
12277 elaborated-type-specifier, or an enum-specifier. */
12279 CP_PARSER_FLAGS_OPTIONAL,
12282 /* We no longer need to defer access checks. */
12285 /* In a block scope, a valid declaration must always have a
12286 decl-specifier-seq. By not trying to parse declarators, we can
12287 resolve the declaration/expression ambiguity more quickly. */
12290 {
12293 }
12295 /* If the next two tokens are both identifiers, the code is
12296 erroneous. The usual cause of this situation is code like:
12298 T t;
12300 where "T" should name a type -- but does not. */
12303 {
12304 /* If parsing tentatively, we should commit; we really are
12305 looking at a declaration. */
12307 /* Give up. */
12309 }
12311 /* If we have seen at least one decl-specifier, and the next token
12312 is not a parenthesis, then we must be looking at a declaration.
12313 (After "int (" we might be looking at a functional cast.) */
12325 /* Keep going until we hit the `;' at the end of the simple
12326 declaration. */
12329 CPP_SEMICOLON))
12330 {
12333 tree decl;
12336 {
12337 /* If we are processing next declarator, comma is expected */
12342 {
12346 }
12347 }
12348 else
12351 /* Parse the init-declarator. */
12354 function_definition_allowed_p,
12356 declares_class_or_enum,
12358 maybe_range_for_decl,
12360 /* If an error occurred while parsing tentatively, exit quickly.
12361 (That usually happens when in the body of a function; each
12362 statement is treated as a declaration-statement until proven
12363 otherwise.) */
12368 {
12371 {
12372 /* If the list of declarators contains more than one declarator,
12373 the type of each declared variable is determined as described
12374 above. If the type deduced for the template parameter U is not
12375 the same in each deduction, the program is ill-formed. */
12380 }
12382 }
12384 /* Handle function definitions specially. */
12386 {
12387 /* If the next token is a `,', then we are probably
12388 processing something like:
12390 void f() {}, *p;
12392 which is erroneous. */
12394 {
12397 "mixing"
12399 }
12400 /* Otherwise, we're done with the list of declarators. */
12401 else
12402 {
12405 }
12406 }
12409 /* The next token should be either a `,' or a `;'. */
12411 /* If it's a `,', there are more declarators to come. */
12414 /* If it's a `;', we are done. */
12417 /* Anything else is an error. */
12418 else
12419 {
12420 /* If we have already issued an error message we don't need
12421 to issue another one. */
12426 /* Skip tokens until we reach the end of the statement. */
12428 /* If the next token is now a `;', consume it. */
12432 }
12433 /* After the first time around, a function-definition is not
12434 allowed -- even if it was OK at first. For example:
12436 int i, f() {}
12438 is not valid. */
12440 }
12442 /* Issue an error message if no declarators are present, and the
12443 decl-specifier-seq does not itself declare a class or
12444 enumeration: [dcl.dcl]/3. */
12446 {
12448 {
12452 /* Ensure an error is issued anyway when finish_decltype_type,
12453 called via cp_parser_decl_specifier_seq, returns a class or
12454 an enumeration (c++/51786). */
12457 }
12458 /* Perform any deferred access checks. */
12460 }
12462 /* Consume the `;'. */
12466 {
12472 }
12474 done:
12476 }
12478 /* Parse a decl-specifier-seq.
12480 decl-specifier-seq:
12481 decl-specifier-seq [opt] decl-specifier
12482 decl-specifier attribute-specifier-seq [opt] (C++11)
12484 decl-specifier:
12485 storage-class-specifier
12486 type-specifier
12487 function-specifier
12488 friend
12489 typedef
12491 GNU Extension:
12493 decl-specifier:
12494 attributes
12496 Concepts Extension:
12498 decl-specifier:
12499 concept
12501 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12503 The parser flags FLAGS is used to control type-specifier parsing.
12505 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12506 flags:
12508 1: one of the decl-specifiers is an elaborated-type-specifier
12509 (i.e., a type declaration)
12510 2: one of the decl-specifiers is an enum-specifier or a
12511 class-specifier (i.e., a type definition)
12513 */
12515 static void
12517 cp_parser_flags flags,
12520 {
12524 cp_decl_spec ds;
12526 /* Clear DECL_SPECS. */
12529 /* Assume no class or enumeration type is declared. */
12532 /* Keep reading specifiers until there are no more to read. */
12534 {
12539 /* Peek at the next token. */
12542 /* Save the first token of the decl spec list for error
12543 reporting. */
12546 /* Handle attributes. */
12548 {
12549 /* Parse the attributes. */
12552 /* In a sequence of declaration specifiers, c++11 attributes
12553 appertain to the type that precede them. In that case
12554 [dcl.spec]/1 says:
12556 The attribute-specifier-seq affects the type only for
12557 the declaration it appears in, not other declarations
12558 involving the same type.
12560 But for now let's force the user to position the
12561 attribute either at the beginning of the declaration or
12562 after the declarator-id, which would clearly mean that it
12563 applies to the declarator. */
12565 {
12567 /* The c++11 attribute is at the beginning of the
12568 declaration. It appertains to the entity being
12570 else
12571 {
12573 {
12574 /* This is an attribute following a
12575 class-specifier. */
12580 }
12581 else
12582 {
12583 decl_specs->std_attributes
12585 attrs);
12588 }
12590 }
12591 }
12593 decl_specs->attributes
12595 attrs);
12599 }
12600 /* Assume we will find a decl-specifier keyword. */
12602 /* If the next token is an appropriate keyword, we can simply
12603 add it to the list. */
12605 {
12606 /* decl-specifier:
12607 friend
12608 constexpr */
12611 {
12614 }
12615 else
12616 {
12618 /* Consume the token. */
12620 }
12633 /* function-specifier:
12634 inline
12635 virtual
12636 explicit */
12643 /* decl-specifier:
12644 typedef */
12647 /* Consume the token. */
12649 /* A constructor declarator cannot appear in a typedef. */
12651 /* The "typedef" keyword can only occur in a declaration; we
12652 may as well commit at this point. */
12659 /* storage-class-specifier:
12660 auto
12661 register
12662 static
12663 extern
12664 mutable
12666 GNU Extension:
12667 thread */
12670 {
12671 /* Consume the token. */
12674 /* Complain about `auto' as a storage specifier, if
12675 we're complaining about C++0x compatibility. */
12679 /* Set the storage class anyway. */
12681 token);
12682 }
12683 else
12684 /* C++0x auto type-specifier. */
12692 /* Consume the token. */
12695 token);
12698 /* Consume the token. */
12704 /* We did not yet find a decl-specifier yet. */
12707 }
12717 /* Constructors are a special case. The `S' in `S()' is not a
12718 decl-specifier; it is the beginning of the declarator. */
12719 constructor_p
12720 = (!found_decl_spec
12721 && constructor_possible_p
12722 && (cp_parser_constructor_declarator_p
12725 /* If we don't have a DECL_SPEC yet, then we must be looking at
12726 a type-specifier. */
12728 {
12731 tree type_spec;
12733 type_spec
12735 decl_specs,
12741 /* If this type-specifier referenced a user-defined type
12742 (a typedef, class-name, etc.), then we can't allow any
12743 more such type-specifiers henceforth.
12745 [dcl.spec]
12747 The longest sequence of decl-specifiers that could
12748 possibly be a type name is taken as the
12749 decl-specifier-seq of a declaration. The sequence shall
12750 be self-consistent as described below.
12752 [dcl.type]
12754 As a general rule, at most one type-specifier is allowed
12755 in the complete decl-specifier-seq of a declaration. The
12756 only exceptions are the following:
12758 -- const or volatile can be combined with any other
12759 type-specifier.
12761 -- signed or unsigned can be combined with char, long,
12762 short, or int.
12764 -- ..
12766 Example:
12768 typedef char* Pc;
12769 void g (const int Pc);
12771 Here, Pc is *not* part of the decl-specifier seq; it's
12772 the declarator. Therefore, once we see a type-specifier
12773 (other than a cv-qualifier), we forbid any additional
12774 user-defined types. We *do* still allow things like `int
12775 int' to be considered a decl-specifier-seq, and issue the
12776 error message later. */
12779 /* A constructor declarator cannot follow a type-specifier. */
12781 {
12786 }
12787 }
12789 /* If we still do not have a DECL_SPEC, then there are no more
12790 decl-specifiers. */
12795 /* After we see one decl-specifier, further decl-specifiers are
12796 always optional. */
12798 }
12800 /* Don't allow a friend specifier with a class definition. */
12805 }
12807 /* Parse an (optional) storage-class-specifier.
12809 storage-class-specifier:
12810 auto
12811 register
12812 static
12813 extern
12814 mutable
12816 GNU Extension:
12818 storage-class-specifier:
12819 thread
12821 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12823 static tree
12825 {
12827 {
12831 /* Fall through for C++98. */
12838 /* Consume the token. */
12843 }
12844 }
12846 /* Parse an (optional) function-specifier.
12848 function-specifier:
12849 inline
12850 virtual
12851 explicit
12853 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12854 Updates DECL_SPECS, if it is non-NULL. */
12856 static tree
12859 {
12862 {
12868 /* 14.5.2.3 [temp.mem]
12870 A member function template shall not be virtual. */
12873 else
12883 }
12885 /* Consume the token. */
12887 }
12889 /* Parse a linkage-specification.
12891 linkage-specification:
12892 extern string-literal { declaration-seq [opt] }
12893 extern string-literal declaration */
12895 static void
12897 {
12898 tree linkage;
12900 /* Look for the `extern' keyword. */
12903 /* Look for the string-literal. */
12906 /* Transform the literal into an identifier. If the literal is a
12907 wide-character string, or contains embedded NULs, then we can't
12908 handle it as the user wants. */
12911 {
12913 /* Assume C++ linkage. */
12915 }
12916 else
12919 /* We're now using the new linkage. */
12922 /* If the next token is a `{', then we're using the first
12923 production. */
12925 {
12929 /* Consume the `{' token. */
12931 /* Parse the declarations. */
12933 /* Look for the closing `}'. */
12935 }
12936 /* Otherwise, there's just one declaration. */
12937 else
12938 {
12941 saved_in_unbraced_linkage_specification_p
12945 parser->in_unbraced_linkage_specification_p
12947 }
12949 /* We're done with the linkage-specification. */
12951 }
12953 /* Parse a static_assert-declaration.
12955 static_assert-declaration:
12956 static_assert ( constant-expression , string-literal ) ;
12957 static_assert ( constant-expression ) ; (C++1Z)
12959 If MEMBER_P, this static_assert is a class member. */
12961 static void
12963 {
12964 tree condition;
12965 tree message;
12967 location_t saved_loc;
12970 /* Peek at the `static_assert' token so we can keep track of exactly
12971 where the static assertion started. */
12975 /* Look for the `static_assert' keyword. */
12977 RT_STATIC_ASSERT))
12980 /* We know we are in a static assertion; commit to any tentative
12981 parse. */
12985 /* Parse the `(' starting the static assertion condition. */
12988 /* Parse the constant-expression. Allow a non-constant expression
12989 here in order to give better diagnostics in finish_static_assert. */
12990 condition =
12996 {
12999 "static_assert without a message "
13001 /* Eat the ')' */
13006 }
13007 else
13008 {
13009 /* Parse the separating `,'. */
13012 /* Parse the string-literal message. */
13017 /* A `)' completes the static assertion. */
13023 }
13025 /* A semicolon terminates the declaration. */
13028 /* Complete the static assertion, which may mean either processing
13029 the static assert now or saving it for template instantiation. */
13031 }
13033 /* Parse the expression in decltype ( expression ). */
13035 static tree
13038 {
13040 tree expr;
13042 /* Since we're going to preserve any side-effects from this parse, set up a
13043 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13044 in the expression. */
13047 /* First, try parsing an id-expression. */
13058 {
13061 cp_id_kind idk;
13065 /* Lookup the name we got back from the id-expression. */
13075 {
13076 /* Complete lookup of the id-expression. */
13077 expr = (finish_id_expression
13090 /* We found an id-expression, but it was something that we
13091 should not have found. This is an error, not something
13092 we can recover from, so note that we found an
13093 id-expression and we'll recover as gracefully as
13094 possible. */
13096 }
13101 /* We have an id-expression. */
13103 }
13106 {
13107 /* Abort the id-expression parse. */
13110 /* Parsing tentatively, again. */
13113 /* Parse a class member access. */
13121 /* We have an id-expression. */
13123 }
13126 /* We have parsed the complete id-expression or member access. */
13128 else
13129 {
13130 /* Abort our attempt to parse an id-expression or member access
13131 expression. */
13134 /* Parse a full expression. */
13137 }
13140 }
13142 /* Parse a `decltype' type. Returns the type.
13144 simple-type-specifier:
13145 decltype ( expression )
13146 C++14 proposal:
13147 decltype ( auto ) */
13149 static tree
13151 {
13152 tree expr;
13161 {
13162 /* Already parsed. */
13165 }
13167 /* Look for the `decltype' token. */
13171 /* Parse the opening `('. */
13175 /* decltype (auto) */
13178 {
13185 }
13187 /* Types cannot be defined in a `decltype' expression. Save away the
13188 old message. */
13191 /* And create the new one. */
13192 parser->type_definition_forbidden_message
13195 /* The restrictions on constant-expressions do not apply inside
13196 decltype expressions. */
13197 saved_integral_constant_expression_p
13199 saved_non_integral_constant_expression_p
13203 /* Within a parenthesized expression, a `>' token is always
13204 the greater-than operator. */
13205 saved_greater_than_is_operator_p
13209 /* Do not actually evaluate the expression. */
13212 /* Do not warn about problems with the expression. */
13217 /* Go back to evaluating expressions. */
13221 /* The `>' token might be the end of a template-id or
13222 template-parameter-list now. */
13223 parser->greater_than_is_operator_p
13226 /* Restore the old message and the integral constant expression
13227 flags. */
13229 parser->integral_constant_expression_p
13231 parser->non_integral_constant_expression_p
13234 /* Parse to the closing `)'. */
13236 {
13240 }
13243 tf_warning_or_error);
13245 rewrite:
13246 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13247 it again. */
13256 }
13258 /* Special member functions [gram.special] */
13260 /* Parse a conversion-function-id.
13262 conversion-function-id:
13263 operator conversion-type-id
13265 Returns an IDENTIFIER_NODE representing the operator. */
13267 static tree
13269 {
13270 tree type;
13271 tree saved_scope;
13272 tree saved_qualifying_scope;
13273 tree saved_object_scope;
13276 /* Look for the `operator' token. */
13279 /* When we parse the conversion-type-id, the current scope will be
13280 reset. However, we need that information in able to look up the
13281 conversion function later, so we save it here. */
13285 /* We must enter the scope of the class so that the names of
13286 entities declared within the class are available in the
13287 conversion-type-id. For example, consider:
13289 struct S {
13290 typedef int I;
13291 operator I();
13292 };
13294 S::operator I() { ... }
13296 In order to see that `I' is a type-name in the definition, we
13297 must be in the scope of `S'. */
13300 /* Parse the conversion-type-id. */
13302 /* Leave the scope of the class, if any. */
13305 /* Restore the saved scope. */
13309 /* If the TYPE is invalid, indicate failure. */
13313 }
13315 /* Parse a conversion-type-id:
13317 conversion-type-id:
13318 type-specifier-seq conversion-declarator [opt]
13320 Returns the TYPE specified. */
13322 static tree
13324 {
13325 tree attributes;
13326 cp_decl_specifier_seq type_specifiers;
13328 tree type_specified;
13331 /* Parse the attributes. */
13335 parser->type_definition_forbidden_message
13338 /* Parse the type-specifiers. */
13345 /* If that didn't work, stop. */
13348 /* Parse the conversion-declarator. */
13356 /* Don't give this error when parsing tentatively. This happens to
13357 work because we always parse this definitively once. */
13360 {
13362 {
13365 }
13369 }
13372 }
13374 /* Parse an (optional) conversion-declarator.
13376 conversion-declarator:
13377 ptr-operator conversion-declarator [opt]
13379 */
13383 {
13386 cp_cv_quals cv_quals;
13388 /* We don't know if there's a ptr-operator next, or not. */
13390 /* Try the ptr-operator. */
13393 /* If it worked, look for more conversion-declarators. */
13395 {
13398 /* Parse another optional declarator. */
13401 declarator = cp_parser_make_indirect_declarator
13405 }
13408 }
13410 /* Parse an (optional) ctor-initializer.
13412 ctor-initializer:
13413 : mem-initializer-list
13415 Returns TRUE iff the ctor-initializer was actually present. */
13417 static bool
13419 {
13420 /* If the next token is not a `:', then there is no
13421 ctor-initializer. */
13423 {
13424 /* Do default initialization of any bases and members. */
13429 }
13431 /* Consume the `:' token. */
13433 /* And the mem-initializer-list. */
13437 }
13439 /* Parse a mem-initializer-list.
13441 mem-initializer-list:
13442 mem-initializer ... [opt]
13443 mem-initializer ... [opt] , mem-initializer-list */
13445 static void
13447 {
13452 /* Let the semantic analysis code know that we are starting the
13453 mem-initializer-list. */
13458 /* Loop through the list. */
13460 {
13461 tree mem_initializer;
13464 /* Parse the mem-initializer. */
13466 /* If the next token is a `...', we're expanding member initializers. */
13468 {
13469 /* Consume the `...'. */
13472 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13473 can be expanded but members cannot. */
13476 {
13481 }
13483 /* Construct the pack expansion type. */
13486 }
13489 {
13493 }
13494 /* Look for a target constructor. */
13498 {
13501 {
13505 }
13507 }
13508 /* Add it to the list, unless it was erroneous. */
13510 {
13513 }
13514 /* If the next token is not a `,', we're done. */
13517 /* Consume the `,' token. */
13519 }
13521 /* Perform semantic analysis. */
13524 }
13526 /* Parse a mem-initializer.
13528 mem-initializer:
13529 mem-initializer-id ( expression-list [opt] )
13530 mem-initializer-id braced-init-list
13532 GNU extension:
13534 mem-initializer:
13535 ( expression-list [opt] )
13537 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13538 class) or FIELD_DECL (for a non-static data member) to initialize;
13539 the TREE_VALUE is the expression-list. An empty initialization
13540 list is represented by void_list_node. */
13542 static tree
13544 {
13545 tree mem_initializer_id;
13546 tree expression_list;
13547 tree member;
13550 /* Find out what is being initialized. */
13552 {
13556 }
13557 else
13558 {
13562 }
13568 {
13575 }
13576 else
13577 {
13587 }
13597 }
13599 /* Parse a mem-initializer-id.
13601 mem-initializer-id:
13602 :: [opt] nested-name-specifier [opt] class-name
13603 decltype-specifier (C++11)
13604 identifier
13606 Returns a TYPE indicating the class to be initialized for the first
13607 production (and the second in C++11). Returns an IDENTIFIER_NODE
13608 indicating the data member to be initialized for the last production. */
13610 static tree
13612 {
13616 tree id;
13620 /* `typename' is not allowed in this context ([temp.res]). */
13622 {
13624 "keyword %<typename%> not allowed in this context (a qualified "
13627 }
13628 /* Look for the optional `::' operator. */
13629 global_scope_p
13633 /* Look for the optional nested-name-specifier. The simplest way to
13634 implement:
13636 [temp.res]
13638 The keyword `typename' is not permitted in a base-specifier or
13639 mem-initializer; in these contexts a qualified name that
13640 depends on a template-parameter is implicitly assumed to be a
13641 type name.
13643 is to assume that we have seen the `typename' keyword at this
13644 point. */
13645 nested_name_specifier_p
13654 /* If there is a `::' operator or a nested-name-specifier, then we
13655 are definitely looking for a class-name. */
13660 typename_type,
13664 /* Otherwise, we could also be looking for an ordinary identifier. */
13667 /* Try a decltype-specifier. */
13669 else
13670 /* Otherwise, try a class-name. */
13674 none_type,
13678 /* If we found one, we're done. */
13681 /* Otherwise, look for an ordinary identifier. */
13683 }
13685 /* Overloading [gram.over] */
13687 /* Parse an operator-function-id.
13689 operator-function-id:
13690 operator operator
13692 Returns an IDENTIFIER_NODE for the operator which is a
13693 human-readable spelling of the identifier, e.g., `operator +'. */
13695 static cp_expr
13697 {
13698 /* Look for the `operator' keyword. */
13701 /* And then the name of the operator itself. */
13703 }
13705 /* Return an identifier node for a user-defined literal operator.
13706 The suffix identifier is chained to the operator name identifier. */
13708 static tree
13710 {
13711 tree identifier;
13718 }
13720 /* Parse an operator.
13722 operator:
13723 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13724 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13725 || ++ -- , ->* -> () []
13727 GNU Extensions:
13729 operator:
13730 <? >? <?= >?=
13732 Returns an IDENTIFIER_NODE for the operator which is a
13733 human-readable spelling of the identifier, e.g., `operator +'. */
13735 static cp_expr
13737 {
13742 /* Peek at the next token. */
13747 /* Figure out which operator we have. */
13749 {
13751 {
13754 /* The keyword should be either `new' or `delete'. */
13759 else
13762 /* Consume the `new' or `delete' token. */
13765 /* Peek at the next token. */
13767 /* If it's a `[' token then this is the array variant of the
13768 operator. */
13770 {
13771 /* Consume the `[' token. */
13773 /* Look for the `]' token. */
13778 }
13779 /* Otherwise, we have the non-array variant. */
13780 else
13786 }
13933 /* Consume the `('. */
13935 /* Look for the matching `)'. */
13940 /* Consume the `['. */
13942 /* Look for the matching `]'. */
13957 {
13964 /* Consume the string. */
13970 {
13973 }
13974 else
13975 {
13977 /* Look for the suffix identifier. */
13982 {
13986 }
13987 else
13988 {
13991 }
13992 }
13997 {
14000 }
14003 {
14006 }
14008 {
14011 }
14013 }
14016 /* Anything else is an error. */
14018 }
14020 /* If we have selected an identifier, we need to consume the
14021 operator token. */
14024 /* Otherwise, no valid operator name was present. */
14025 else
14026 {
14029 }
14032 }
14034 /* Parse a template-declaration.
14036 template-declaration:
14037 export [opt] template < template-parameter-list > declaration
14039 If MEMBER_P is TRUE, this template-declaration occurs within a
14040 class-specifier.
14042 The grammar rule given by the standard isn't correct. What
14043 is really meant is:
14045 template-declaration:
14046 export [opt] template-parameter-list-seq
14047 decl-specifier-seq [opt] init-declarator [opt] ;
14048 export [opt] template-parameter-list-seq
14049 function-definition
14051 template-parameter-list-seq:
14052 template-parameter-list-seq [opt]
14053 template < template-parameter-list >
14055 Concept Extensions:
14057 template-parameter-list-seq:
14058 template < template-parameter-list > requires-clause [opt]
14060 requires-clause:
14061 requires logical-or-expression */
14063 static void
14065 {
14066 /* Check for `export'. */
14068 {
14069 /* Consume the `export' token. */
14071 /* Warn that we do not support `export'. */
14073 }
14076 }
14078 /* Parse a template-parameter-list.
14080 template-parameter-list:
14081 template-parameter
14082 template-parameter-list , template-parameter
14084 Returns a TREE_LIST. Each node represents a template parameter.
14085 The nodes are connected via their TREE_CHAINs. */
14087 static tree
14089 {
14094 /* The loop below parses the template parms. We first need to know
14095 the total number of template parms to be able to compute proper
14096 canonical types of each dependent type. So after the loop, when
14097 we know the total number of template parms,
14098 end_template_parm_list computes the proper canonical types and
14099 fixes up the dependent types accordingly. */
14101 {
14102 tree parameter;
14105 location_t parm_loc;
14107 /* Parse the template-parameter. */
14112 /* Add it to the list. */
14115 parm_loc,
14116 parameter,
14117 is_non_type,
14118 is_parameter_pack);
14119 else
14120 {
14123 }
14125 /* If the next token is not a `,', we're done. */
14128 /* Otherwise, consume the `,' token. */
14130 }
14133 }
14135 /* Parse a introduction-list.
14137 introduction-list:
14138 introduced-parameter
14139 introduction-list , introduced-parameter
14141 introduced-parameter:
14142 ...[opt] identifier
14144 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14145 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14146 WILDCARD_DECL will also have DECL_NAME set and token location in
14147 DECL_SOURCE_LOCATION. */
14149 static tree
14151 {
14155 {
14160 /* Build placeholder. */
14168 /* If the next token is not a `,', we're done. */
14171 /* Otherwise, consume the `,' token. */
14173 }
14175 /* Convert the vec into a TREE_VEC. */
14178 tree parm;
14184 }
14186 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14187 is an abstract declarator. */
14191 {
14196 }
14198 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14199 is an abstract declarator. */
14203 {
14207 else
14209 }
14211 /* Returns true if DECL represents a constrained-parameter. */
14215 {
14220 }
14222 /* Returns true if PARM declares a constrained-parameter. */
14226 {
14228 }
14230 /* Check that the type parameter is only a declarator-id, and that its
14231 type is not cv-qualified. */
14233 bool
14236 {
14241 {
14244 }
14246 /* Don't allow cv-qualified type parameters. */
14249 {
14252 }
14255 }
14257 /* Finish parsing/processing a template type parameter and checking
14258 various restrictions. */
14262 tree id,
14264 {
14267 else
14269 }
14271 static tree
14273 {
14274 /* FIXME: This should probably be copied, and we may need to adjust
14275 the template parameter depths. */
14285 }
14287 /* Finish parsing/processing a template template parameter by borrowing
14288 the template parameter list from the prototype parameter. */
14290 static tree
14292 tree proto,
14293 tree id,
14295 {
14299 }
14301 /* Create a new non-type template parameter from the given PARM
14302 declarator. */
14304 static tree
14307 {
14313 }
14315 /* Build a constrained template parameter based on the PARMDECL
14316 declarator. The type of PARMDECL is the constrained type, which
14317 refers to the prototype template parameter that ultimately
14318 specifies the type of the declared parameter. */
14320 static tree
14325 {
14331 /* A template parameter constrained by a variadic concept shall also
14332 be declared as a template parameter pack. */
14337 /* Build the parameter. Return an error if the declarator was invalid. */
14338 tree parm;
14343 parmdecl);
14344 else
14349 /* Finish the parameter decl and create a node attaching the
14350 default argument and constraint. */
14355 }
14357 /* Returns true if the parsed type actually represents the declaration
14358 of a type template-parameter. */
14362 {
14365 }
14368 /* Returns true if the parsed type actually represents the declaration of
14369 a template template-parameter. */
14371 static bool
14373 {
14376 }
14378 /* Parse a default argument for a type template-parameter.
14379 Note that diagnostics are handled in cp_parser_template_parameter. */
14381 static tree
14383 {
14386 /* Consume the `=' token. */
14391 /* Parse the default-argument. */
14397 {
14401 }
14404 }
14406 /* Parse a default argument for a template template-parameter. */
14408 static tree
14410 {
14415 /* Consume the `='. */
14417 /* Parse the id-expression. */
14419 /* save token before parsing the id-expression, for error
14420 reporting */
14422 tree default_argument
14430 /* If the id-expression was a template-id that refers to
14431 a template-class, we already have the declaration here,
14432 so no further lookup is needed. */
14433 ;
14434 else
14435 /* Look up the name. */
14436 default_argument
14438 none_type,
14444 /* See if the default argument is valid. */
14448 }
14450 /* Parse a template-parameter.
14452 template-parameter:
14453 type-parameter
14454 parameter-declaration
14456 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14457 the parameter. The TREE_PURPOSE is the default value, if any.
14458 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14459 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14460 set to true iff this parameter is a parameter pack. */
14462 static tree
14465 {
14468 tree parm;
14470 /* Assume it is a type parameter or a template parameter. */
14472 /* Assume it not a parameter pack. */
14474 /* Peek at the next token. */
14476 /* If it is `class' or `template', we have a type-parameter. */
14479 /* If it is `class' or `typename' we do not know yet whether it is a
14480 type parameter or a non-type parameter. Consider:
14482 template <typename T, typename T::X X> ...
14484 or:
14486 template <class C, class D*> ...
14488 Here, the first parameter is a type parameter, and the second is
14489 a non-type parameter. We can tell by looking at the token after
14490 the identifier -- if it is a `,', `=', or `>' then we have a type
14491 parameter. */
14493 {
14494 /* Peek at the token after `class' or `typename'. */
14496 /* If it's an ellipsis, we have a template type parameter
14497 pack. */
14500 /* If it's an identifier, skip it. */
14503 /* Now, see if the token looks like the end of a template
14504 parameter. */
14509 }
14511 /* Otherwise, it is a non-type parameter or a constrained parameter.
14513 [temp.param]
14515 When parsing a default template-argument for a non-type
14516 template-parameter, the first non-nested `>' is taken as the end
14517 of the template parameter-list rather than a greater-than
14518 operator. */
14519 parameter_declarator
14526 /* If the parameter declaration is marked as a parameter pack, set
14527 *IS_PARAMETER_PACK to notify the caller. */
14532 {
14533 /* Can happen in some cases of erroneous input (c++/34892). */
14535 /* Consume the `...' for better error recovery. */
14537 }
14539 // The parameter may have been constrained.
14542 parameter_declarator,
14543 is_non_type,
14544 is_parameter_pack);
14546 // Now we're sure that the parameter is a non-type parameter.
14557 }
14559 /* Parse a type-parameter.
14561 type-parameter:
14562 class identifier [opt]
14563 class identifier [opt] = type-id
14564 typename identifier [opt]
14565 typename identifier [opt] = type-id
14566 template < template-parameter-list > class identifier [opt]
14567 template < template-parameter-list > class identifier [opt]
14568 = id-expression
14570 GNU Extension (variadic templates):
14572 type-parameter:
14573 class ... identifier [opt]
14574 typename ... identifier [opt]
14576 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14577 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14578 the declaration of the parameter.
14580 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14582 static tree
14584 {
14586 tree parameter;
14588 /* Look for a keyword to tell us what kind of parameter this is. */
14594 {
14597 {
14598 tree identifier;
14599 tree default_argument;
14601 /* If the next token is an ellipsis, we have a template
14602 argument pack. */
14604 {
14605 /* Consume the `...' token. */
14610 }
14612 /* If the next token is an identifier, then it names the
14613 parameter. */
14616 else
14619 /* Create the parameter. */
14622 /* If the next token is an `=', we have a default argument. */
14624 {
14625 default_argument
14628 /* Template parameter packs cannot have default
14629 arguments. */
14631 {
14634 "template parameter pack %qD cannot have a "
14636 else
14638 "template parameter packs cannot have "
14641 }
14644 }
14645 else
14648 /* Create the combined representation of the parameter and the
14649 default argument. */
14651 }
14655 {
14656 tree identifier;
14657 tree default_argument;
14659 /* Look for the `<'. */
14661 /* Parse the template-parameter-list. */
14663 /* Look for the `>'. */
14666 // If template requirements are present, parse them.
14668 {
14673 }
14675 /* Look for the `class' or 'typename' keywords. */
14677 /* If the next token is an ellipsis, we have a template
14678 argument pack. */
14680 {
14681 /* Consume the `...' token. */
14686 }
14687 /* If the next token is an `=', then there is a
14688 default-argument. If the next token is a `>', we are at
14689 the end of the parameter-list. If the next token is a `,',
14690 then we are at the end of this parameter. */
14694 {
14696 /* Treat invalid names as if the parameter were nameless. */
14699 }
14700 else
14703 /* Create the template parameter. */
14705 identifier);
14707 /* If the next token is an `=', then there is a
14708 default-argument. */
14710 {
14711 default_argument
14714 /* Template parameter packs cannot have default
14715 arguments. */
14717 {
14720 "template parameter pack %qD cannot "
14722 identifier);
14723 else
14727 }
14728 }
14729 else
14732 /* Create the combined representation of the parameter and the
14733 default argument. */
14735 }
14741 }
14744 }
14746 /* Parse a template-id.
14748 template-id:
14749 template-name < template-argument-list [opt] >
14751 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14752 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14753 returned. Otherwise, if the template-name names a function, or set
14754 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14755 names a class, returns a TYPE_DECL for the specialization.
14757 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14758 uninstantiated templates. */
14760 static tree
14766 {
14767 tree templ;
14768 tree arguments;
14769 tree template_id;
14774 /* If the next token corresponds to a template-id, there is no need
14775 to reparse it. */
14778 {
14781 }
14783 /* Avoid performing name lookup if there is no possibility of
14784 finding a template-id. */
14787 && !cp_parser_nth_token_starts_template_argument_list_p
14789 {
14792 }
14794 /* Remember where the template-id starts. */
14800 /* Parse the template-name. */
14803 check_dependency_p,
14804 is_declaration,
14805 tag_type,
14808 {
14811 }
14813 /* Since we're going to preserve any side-effects from this parse, set up a
14814 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14815 in the template arguments. */
14818 /* If we find the sequence `[:' after a template-name, it's probably
14819 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14820 parse correctly the argument list. */
14827 {
14829 /* Change `:' into `::'. */
14831 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14832 CPP_LESS. */
14835 /* Parse the arguments. */
14838 {
14839 /* If we couldn't parse an argument list, then we revert our changes
14840 and return simply an error. Maybe this is not a template-id
14841 after all. */
14846 }
14847 /* Otherwise, emit an error about the invalid digraph, but continue
14848 parsing because we got our argument list. */
14851 {
14854 "%<<:%> is an alternate spelling for %<[%>."
14857 {
14859 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14862 }
14863 }
14864 }
14865 else
14866 {
14867 /* Look for the `<' that starts the template-argument-list. */
14869 {
14872 }
14873 /* Parse the arguments. */
14875 }
14877 /* Build a representation of the specialization. */
14880 TEMPLATE_ID_EXPR,
14884 {
14886 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14887 template (rather than some instantiation thereof) only if
14888 is not nested within some other construct. For example, in
14889 "template <typename T> void f(T) { A<T>::", A<T> is just an
14890 instantiation of A. */
14893 CPP_SCOPE));
14894 template_id
14896 }
14897 /* A template-like identifier may be a partial concept id. */
14903 {
14907 }
14908 else
14909 {
14910 /* If it's not a class-template or a template-template, it should be
14911 a function-template. */
14919 }
14921 /* If parsing tentatively, replace the sequence of tokens that makes
14922 up the template-id with a CPP_TEMPLATE_ID token. That way,
14923 should we re-parse the token stream, we will not have to repeat
14924 the effort required to do the parse, nor will we issue duplicate
14925 error messages about problems during instantiation of the
14926 template. */
14928 /* Don't do this if we had a parse error in a declarator; re-parsing
14929 might succeed if a name changes meaning (60361). */
14933 {
14936 /* Reset the contents of the START_OF_ID token. */
14939 /* Update the location to be of the form:
14940 template-name < template-argument-list [opt] >
14941 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14942 with caret == start at the start of the template-name,
14943 ranging until the closing '>'. */
14944 location_t finish_loc
14946 location_t combined_loc
14950 /* Retrieve any deferred checks. Do not pop this access checks yet
14951 so the memory will not be reclaimed during token replacing below. */
14957 /* Purge all subsequent tokens. */
14960 /* ??? Can we actually assume that, if template_id ==
14961 error_mark_node, we will have issued a diagnostic to the
14962 user, as opposed to simply marking the tentative parse as
14963 failed? */
14966 }
14970 }
14972 /* Parse a template-name.
14974 template-name:
14975 identifier
14977 The standard should actually say:
14979 template-name:
14980 identifier
14981 operator-function-id
14983 A defect report has been filed about this issue.
14985 A conversion-function-id cannot be a template name because they cannot
14986 be part of a template-id. In fact, looking at this code:
14988 a.operator K<int>()
14990 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
14991 It is impossible to call a templated conversion-function-id with an
14992 explicit argument list, since the only allowed template parameter is
14993 the type to which it is converting.
14995 If TEMPLATE_KEYWORD_P is true, then we have just seen the
14996 `template' keyword, in a construction like:
14998 T::template f<3>()
15000 In that case `f' is taken to be a template-name, even though there
15001 is no way of knowing for sure.
15003 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15004 name refers to a set of overloaded functions, at least one of which
15005 is a template, or an IDENTIFIER_NODE with the name of the template,
15006 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15007 names are looked up inside uninstantiated templates. */
15009 static tree
15016 {
15017 tree identifier;
15018 tree decl;
15019 tree fns;
15022 /* If the next token is `operator', then we have either an
15023 operator-function-id or a conversion-function-id. */
15025 {
15026 /* We don't know whether we're looking at an
15027 operator-function-id or a conversion-function-id. */
15029 /* Try an operator-function-id. */
15031 /* If that didn't work, try a conversion-function-id. */
15033 {
15036 }
15037 }
15038 /* Look for the identifier. */
15039 else
15042 /* If we didn't find an identifier, we don't have a template-id. */
15046 /* If the name immediately followed the `template' keyword, then it
15047 is a template-name. However, if the next token is not `<', then
15048 we do not treat it as a template-name, since it is not being used
15049 as part of a template-id. This enables us to handle constructs
15050 like:
15052 template <typename T> struct S { S(); };
15053 template <typename T> S<T>::S();
15055 correctly. We would treat `S' as a template -- if it were `S<T>'
15056 -- but we do not if there is no `<'. */
15060 {
15061 /* In a declaration, in a dependent context, we pretend that the
15062 "template" keyword was present in order to improve error
15063 recovery. For example, given:
15065 template <typename T> void f(T::X<int>);
15067 we want to treat "X<int>" as a template-id. */
15069 && !template_keyword_p
15071 && check_dependency_p
15073 /* Do not do this for dtors (or ctors), since they never
15074 need the template keyword before their name. */
15076 {
15079 /* Explain what went wrong. */
15081 identifier);
15084 /* If parsing tentatively, find the location of the "<" token. */
15087 /* Parse the template arguments so that we can issue error
15088 messages about them. */
15091 /* Skip tokens until we find a good place from which to
15092 continue parsing. */
15097 /* If parsing tentatively, permanently remove the
15098 template argument list. That will prevent duplicate
15099 error messages from being issued about the missing
15100 "template" keyword. */
15106 }
15108 /* If the "template" keyword is present, then there is generally
15109 no point in doing name-lookup, so we just return IDENTIFIER.
15110 But, if the qualifying scope is non-dependent then we can
15111 (and must) do name-lookup normally. */
15117 }
15119 /* Look up the name. */
15121 tag_type,
15124 check_dependency_p,
15130 /* If DECL is a template, then the name was a template-name. */
15132 {
15136 }
15137 else
15138 {
15141 /* The standard does not explicitly indicate whether a name that
15142 names a set of overloaded declarations, some of which are
15143 templates, is a template-name. However, such a name should
15144 be a template-name; otherwise, there is no way to form a
15145 template-id for the overloaded templates. */
15153 {
15154 /* The name does not name a template. */
15157 }
15158 }
15160 /* If DECL is dependent, and refers to a function, then just return
15161 its name; we will look it up again during template instantiation. */
15163 {
15167 }
15170 }
15172 /* Parse a template-argument-list.
15174 template-argument-list:
15175 template-argument ... [opt]
15176 template-argument-list , template-argument ... [opt]
15178 Returns a TREE_VEC containing the arguments. */
15180 static tree
15182 {
15187 tree vec;
15194 /* Even if the template-id appears in an integral
15195 constant-expression, the contents of the argument list do
15196 not. */
15202 /* Parse the arguments. */
15203 do
15204 {
15205 tree argument;
15208 /* Consume the comma. */
15211 /* Parse the template-argument. */
15214 /* If the next token is an ellipsis, we're expanding a template
15215 argument pack. */
15217 {
15219 {
15223 }
15224 /* Consume the `...' token. */
15227 /* Make the argument into a TYPE_PACK_EXPANSION or
15228 EXPR_PACK_EXPANSION. */
15230 }
15233 {
15237 {
15240 }
15241 else
15243 }
15245 }
15261 }
15263 /* Parse a template-argument.
15265 template-argument:
15266 assignment-expression
15267 type-id
15268 id-expression
15270 The representation is that of an assignment-expression, type-id, or
15271 id-expression -- except that the qualified id-expression is
15272 evaluated, so that the value returned is either a DECL or an
15273 OVERLOAD.
15275 Although the standard says "assignment-expression", it forbids
15276 throw-expressions or assignments in the template argument.
15277 Therefore, we use "conditional-expression" instead. */
15279 static tree
15281 {
15282 tree argument;
15288 cp_id_kind idk;
15290 /* There's really no way to know what we're looking at, so we just
15291 try each alternative in order.
15293 [temp.arg]
15295 In a template-argument, an ambiguity between a type-id and an
15296 expression is resolved to a type-id, regardless of the form of
15297 the corresponding template-parameter.
15299 Therefore, we try a type-id first. */
15302 /* If there was no error parsing the type-id but the next token is a
15303 '>>', our behavior depends on which dialect of C++ we're
15304 parsing. In C++98, we probably found a typo for '> >'. But there
15305 are type-id which are also valid expressions. For instance:
15307 struct X { int operator >> (int); };
15308 template <int V> struct Foo {};
15309 Foo<X () >> 5> r;
15311 Here 'X()' is a valid type-id of a function type, but the user just
15312 wanted to write the expression "X() >> 5". Thus, we remember that we
15313 found a valid type-id, but we still try to parse the argument as an
15314 expression to see what happens.
15316 In C++0x, the '>>' will be considered two separate '>'
15317 tokens. */
15321 {
15324 }
15325 else
15326 {
15327 /* If the next token isn't a `,' or a `>', then this argument wasn't
15328 really finished. This means that the argument is not a valid
15329 type-id. */
15332 /* If that worked, we're done. */
15335 }
15336 /* We're still not sure what the argument will be. */
15338 /* Try a template. */
15346 /* If the next token isn't a `,' or a `>', then this argument wasn't
15347 really finished. */
15351 {
15352 /* Figure out what is being referred to. If the id-expression
15353 was for a class template specialization, then we will have a
15354 TYPE_DECL at this point. There is no need to do name lookup
15355 at this point in that case. */
15358 none_type,
15364 /* Handle a constrained-type-specifier for a non-type template
15365 parameter. */
15371 }
15373 {
15377 }
15378 /* It must be a non-type argument. In C++17 any constant-expression is
15379 allowed. */
15383 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15385 -- an integral constant-expression of integral or enumeration
15386 type; or
15388 -- the name of a non-type template-parameter; or
15390 -- the name of an object or function with external linkage...
15392 -- the address of an object or function with external linkage...
15394 -- a pointer to member... */
15395 /* Look for a non-type template parameter. */
15397 {
15409 }
15411 /* If the next token is "&", the argument must be the address of an
15412 object or function with external linkage. */
15415 {
15418 }
15419 /* See if we might have an id-expression. */
15426 {
15429 address_p,
15436 else
15437 {
15438 tree probe;
15441 {
15442 /* Strip the dereference temporarily. */
15445 }
15447 /* If we're in a template, we represent a qualified-id referring
15448 to a static data member as a SCOPE_REF even if the scope isn't
15449 dependent so that we can check access control later. */
15454 {
15455 /* A variable without external linkage might still be a
15456 valid constant-expression, so no error is issued here
15457 if the external-linkage check fails. */
15460 }
15462 /* All overloaded functions are allowed; if the external
15463 linkage test does not pass, an error will be issued
15464 later. */
15465 ;
15469 /* A pointer-to-member. */
15470 ;
15472 ;
15473 else
15477 {
15480 tf_warning_or_error);
15481 else
15484 }
15485 }
15486 }
15487 /* If the argument started with "&", there are no other valid
15488 alternatives at this point. */
15490 {
15493 }
15495 general_expr:
15496 /* If the argument wasn't successfully parsed as a type-id followed
15497 by '>>', the argument can only be a constant expression now.
15498 Otherwise, we try parsing the constant-expression tentatively,
15499 because the argument could really be a type-id. */
15505 else
15506 {
15507 /* With C++17 generalized non-type template arguments we need to handle
15508 lvalue constant expressions, too. */
15511 }
15519 /* We did our best to parse the argument as a non type-id, but that
15520 was the only alternative that matched (albeit with a '>' after
15521 it). We can assume it's just a typo from the user, and a
15522 diagnostic will then be issued. */
15524 }
15526 /* Parse an explicit-instantiation.
15528 explicit-instantiation:
15529 template declaration
15531 Although the standard says `declaration', what it really means is:
15533 explicit-instantiation:
15534 template decl-specifier-seq [opt] declarator [opt] ;
15536 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15537 supposed to be allowed. A defect report has been filed about this
15538 issue.
15540 GNU Extension:
15542 explicit-instantiation:
15543 storage-class-specifier template
15544 decl-specifier-seq [opt] declarator [opt] ;
15545 function-specifier template
15546 decl-specifier-seq [opt] declarator [opt] ; */
15548 static void
15550 {
15552 cp_decl_specifier_seq decl_specifiers;
15557 /* Look for an (optional) storage-class-specifier or
15558 function-specifier. */
15560 {
15561 extension_specifier
15564 extension_specifier
15567 }
15569 /* Look for the `template' keyword. */
15571 /* Let the front end know that we are processing an explicit
15572 instantiation. */
15574 /* [temp.explicit] says that we are supposed to ignore access
15575 control while processing explicit instantiation directives. */
15577 /* Parse a decl-specifier-seq. */
15579 CP_PARSER_FLAGS_OPTIONAL,
15582 /* If there was exactly one decl-specifier, and it declared a class,
15583 and there's no declarator, then we have an explicit type
15584 instantiation. */
15586 {
15587 tree type;
15591 /* Turn access control back on for names used during
15592 template instantiation. */
15597 }
15598 else
15599 {
15601 tree decl;
15603 /* Parse the declarator. */
15604 declarator
15615 {
15618 "explicit instantiation shall not use"
15622 "explicit instantiation shall not use"
15627 /* Turn access control back on for names used during
15628 template instantiation. */
15630 /* Do the explicit instantiation. */
15632 }
15633 else
15634 {
15636 /* Skip the body of the explicit instantiation. */
15638 }
15639 }
15640 /* We're done with the instantiation. */
15646 }
15648 /* Parse an explicit-specialization.
15650 explicit-specialization:
15651 template < > declaration
15653 Although the standard says `declaration', what it really means is:
15655 explicit-specialization:
15656 template <> decl-specifier [opt] init-declarator [opt] ;
15657 template <> function-definition
15658 template <> explicit-specialization
15659 template <> template-declaration */
15661 static void
15663 {
15667 /* Look for the `template' keyword. */
15669 /* Look for the `<'. */
15671 /* Look for the `>'. */
15673 /* We have processed another parameter list. */
15675 /* [temp]
15677 A template ... explicit specialization ... shall not have C
15678 linkage. */
15680 {
15682 /* Give it C++ linkage to avoid confusing other parts of the
15683 front end. */
15686 }
15687 else
15689 /* Let the front end know that we are beginning a specialization. */
15691 {
15694 }
15696 /* If the next keyword is `template', we need to figure out whether
15697 or not we're looking a template-declaration. */
15699 {
15704 else
15706 }
15707 else
15708 /* Parse the dependent declaration. */
15714 /* We're done with the specialization. */
15716 /* For the erroneous case of a template with C linkage, we pushed an
15717 implicit C++ linkage scope; exit that scope now. */
15720 /* We're done with this parameter list. */
15722 }
15724 /* Parse a type-specifier.
15726 type-specifier:
15727 simple-type-specifier
15728 class-specifier
15729 enum-specifier
15730 elaborated-type-specifier
15731 cv-qualifier
15733 GNU Extension:
15735 type-specifier:
15736 __complex__
15738 Returns a representation of the type-specifier. For a
15739 class-specifier, enum-specifier, or elaborated-type-specifier, a
15740 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15742 The parser flags FLAGS is used to control type-specifier parsing.
15744 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15745 in a decl-specifier-seq.
15747 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15748 class-specifier, enum-specifier, or elaborated-type-specifier, then
15749 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15750 if a type is declared; 2 if it is defined. Otherwise, it is set to
15751 zero.
15753 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15754 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15755 is set to FALSE. */
15757 static tree
15759 cp_parser_flags flags,
15764 {
15770 /* Assume this type-specifier does not declare a new type. */
15773 /* And that it does not specify a cv-qualifier. */
15776 /* Peek at the next token. */
15779 /* If we're looking at a keyword, we can use that to guide the
15780 production we choose. */
15783 {
15788 /* Look for the enum-specifier. */
15790 /* If that worked, we're done. */
15792 {
15797 type_spec,
15798 token,
15801 }
15802 else
15805 /* Any of these indicate either a class-specifier, or an
15806 elaborated-type-specifier. */
15813 /* Parse tentatively so that we can back up if we don't find a
15814 class-specifier. */
15816 /* Look for the class-specifier. */
15819 /* If that worked, we're done. */
15821 {
15826 type_spec,
15827 token,
15830 }
15832 /* Fall through. */
15833 elaborated_type_specifier:
15834 /* We're declaring (not defining) a class or enum. */
15838 /* Fall through. */
15840 /* Look for an elaborated-type-specifier. */
15841 type_spec
15842 = (cp_parser_elaborated_type_specifier
15845 is_declaration));
15848 type_spec,
15849 token,
15872 /* The `__complex__' keyword is a GNU extension. */
15878 }
15880 /* Handle simple keywords. */
15882 {
15884 {
15887 }
15889 }
15891 /* If we do not already have a type-specifier, assume we are looking
15892 at a simple-type-specifier. */
15894 decl_specs,
15895 flags);
15897 /* If we didn't find a type-specifier, and a type-specifier was not
15898 optional in this context, issue an error message. */
15900 {
15903 }
15906 }
15908 /* Parse a simple-type-specifier.
15910 simple-type-specifier:
15911 :: [opt] nested-name-specifier [opt] type-name
15912 :: [opt] nested-name-specifier template template-id
15913 char
15914 wchar_t
15915 bool
15916 short
15917 int
15918 long
15919 signed
15920 unsigned
15921 float
15922 double
15923 void
15925 C++0x Extension:
15927 simple-type-specifier:
15928 auto
15929 decltype ( expression )
15930 char16_t
15931 char32_t
15932 __underlying_type ( type-id )
15934 GNU Extension:
15936 simple-type-specifier:
15937 __int128
15938 __typeof__ unary-expression
15939 __typeof__ ( type-id )
15940 __typeof__ ( type-id ) { initializer-list , [opt] }
15942 Concepts Extension:
15944 simple-type-specifier:
15945 constrained-type-specifier
15947 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15948 appropriately updated. */
15950 static tree
15953 cp_parser_flags flags)
15954 {
15959 /* Peek at the next token. */
15962 /* If we're looking at a keyword, things are easy. */
15964 {
15999 {
16002 }
16031 {
16032 /* The 'auto' might be the placeholder return type for a function decl
16033 with trailing return type. */
16042 {
16044 {
16051 }
16054 {
16057 }
16060 }
16064 {
16067 }
16070 {
16073 }
16074 else
16078 {
16081 "use of %<auto%> in lambda parameter declaration "
16082 "only available with "
16084 }
16087 "use of %<auto%> in parameter declaration "
16088 "only available with "
16092 "ISO C++ forbids use of %<auto%> in parameter "
16094 }
16095 else
16100 /* Since DR 743, decltype can either be a simple-type-specifier by
16101 itself or begin a nested-name-specifier. Parsing it will replace
16102 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16103 handling below decide what to do. */
16109 /* Consume the `typeof' token. */
16111 /* Parse the operand to `typeof'. */
16113 /* If it is not already a TYPE, take its type. */
16119 token,
16128 token,
16138 token,
16143 }
16145 /* If token is an already-parsed decltype not followed by ::,
16146 it's a simple-type-specifier. */
16149 {
16152 {
16154 token,
16156 /* Remember that we are handling a decltype in order to
16157 implement the resolution of DR 1510 when the argument
16158 isn't instantiation dependent. */
16160 }
16163 }
16165 /* If the type-specifier was for a built-in type, we're done. */
16167 {
16168 /* Record the type. */
16175 type,
16176 token,
16181 /* Consume the token. */
16187 /* There is no valid C++ program where a non-template type is
16188 followed by a "<". That usually indicates that the user thought
16189 that the type was a template. */
16194 }
16196 /* The type-specifier must be a user-defined type. */
16198 {
16202 /* Don't gobble tokens or issue error messages if this is an
16203 optional type-specifier. */
16207 /* Look for the optional `::' operator. */
16208 global_p
16212 /* Look for the nested-name specifier. */
16213 qualified_p
16221 /* If we have seen a nested-name-specifier, and the next token
16222 is `template', then we are using the template-id production. */
16225 {
16226 /* Look for the template-id. */
16230 none_type,
16232 /* If the template-id did not name a type, we are out of
16233 luck. */
16235 {
16238 }
16239 }
16240 /* Otherwise, look for a type-name. */
16241 else
16243 /* Keep track of all name-lookups performed in class scopes. */
16245 && !global_p
16246 && !qualified_p
16250 /* If it didn't work out, we don't have a TYPE. */
16256 token,
16258 }
16260 /* If we didn't get a type-name, issue an error message. */
16262 {
16265 }
16268 {
16269 /* See if TYPE is an Objective-C type, and if so, parse and
16270 accept any protocol references following it. Do this before
16271 the cp_parser_check_for_invalid_template_id() call, because
16272 Objective-C types can be followed by '<...>' which would
16273 enclose protocol names rather than template arguments, and so
16274 everything is fine. */
16277 {
16281 /* Clobber the "unqualified" type previously entered into
16282 DECL_SPECS with the new, improved protocol-qualified version. */
16287 }
16289 /* There is no valid C++ program where a non-template type is
16290 followed by a "<". That usually indicates that the user
16291 thought that the type was a template. */
16293 none_type,
16295 }
16298 }
16300 /* Parse a type-name.
16302 type-name:
16303 class-name
16304 enum-name
16305 typedef-name
16306 simple-template-id [in c++0x]
16308 enum-name:
16309 identifier
16311 typedef-name:
16312 identifier
16314 Concepts:
16316 type-name:
16317 concept-name
16318 partial-concept-id
16320 concept-name:
16321 identifier
16323 Returns a TYPE_DECL for the type. */
16325 static tree
16327 {
16329 }
16331 /* See above. */
16332 static tree
16334 {
16335 tree type_decl;
16337 /* We can't know yet whether it is a class-name or not. */
16339 /* Try a class-name. */
16341 typename_keyword_p,
16343 none_type,
16347 /* If it's not a class-name, keep looking. */
16349 {
16351 /* It must be a typedef-name or an enum-name. */
16355 /* It is either a simple-template-id representing an
16356 instantiation of an alias template... */
16360 none_type,
16362 /* Note that this must be an instantiation of an alias template
16363 because [temp.names]/6 says:
16365 A template-id that names an alias template specialization
16366 is a type-name.
16368 Whereas [temp.names]/7 says:
16370 A simple-template-id that names a class template
16371 specialization is a class-name.
16373 With concepts, this could also be a partial-concept-id that
16374 declares a non-type template parameter. */
16381 else
16385 /* ... Or a typedef-name or an enum-name. */
16387 }
16390 }
16392 /* Check if DECL and ARGS can form a constrained-type-specifier.
16393 If ARGS is non-null, we try to form a concept check of the
16394 form DECL<?, ARGS> where ? is a wildcard that matches any
16395 kind of template argument. If ARGS is NULL, then we try to
16396 form a concept check of the form DECL<?>. */
16398 static tree
16401 {
16404 /* If we a constrained-type-specifier cannot be deduced. */
16408 /* A constrained type specifier can only be found in an
16409 overload set or as a reference to a template declaration.
16411 FIXME: This might be masking a bug. It's possible that
16412 that the deduction below is causing template specializations
16413 to be formed with the wildcard as an argument. */
16417 /* Try to build a call expression that evaluates the
16418 concept. This can fail if the overload set refers
16419 only to non-templates. */
16425 /* Deduce the checked constraint and the prototype parameter.
16427 FIXME: In certain cases, failure to deduce should be a
16428 diagnosable error. */
16429 tree conc;
16430 tree proto;
16434 /* In template parameter scope, this results in a constrained
16435 parameter. Return a descriptor of that parm. */
16439 /* In a parameter-declaration-clause, constrained-type
16440 specifiers result in invented template parameters. */
16442 {
16445 }
16446 else
16447 {
16448 /* Otherwise, we're in a context where the constrained
16449 type name is deduced and the constraint applies
16450 after deduction. */
16452 }
16455 }
16457 /* If DECL refers to a concept, return a TYPE_DECL representing
16458 the result of using the constrained type specifier in the
16459 current context. DECL refers to a concept if
16461 - it is an overload set containing a function concept taking a single
16462 type argument, or
16464 - it is a variable concept taking a single type argument. */
16466 static tree
16468 {
16474 else
16476 }
16478 /* Check if DECL and ARGS form a partial-concept-id. If so,
16479 assign ID to the resulting constrained placeholder.
16481 Returns true if the partial-concept-id designates a placeholder
16482 and false otherwise. Note that *id is set to NULL_TREE in
16483 this case. */
16485 static tree
16487 {
16489 }
16491 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16492 or a concept-name.
16494 enum-name:
16495 identifier
16497 typedef-name:
16498 identifier
16500 concept-name:
16501 identifier
16503 Returns a TYPE_DECL for the type. */
16505 static tree
16507 {
16508 tree type_decl;
16509 tree identifier;
16516 /* Look up the type-name. */
16521 /* If we found an overload set, then it may refer to a concept-name. */
16527 {
16528 /* See if this is an Objective-C type. */
16533 }
16535 /* Issue an error if we did not find a type-name. */
16537 /* In Objective-C, we have the complication that class names are
16538 normally type names and start declarations (eg, the
16539 "NSObject" in "NSObject *object;"), but can be used in an
16540 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16541 is an expression. So, a classname followed by a dot is not a
16542 valid type-name. */
16545 {
16550 }
16551 /* Remember that the name was used in the definition of the
16552 current class so that we can check later to see if the
16553 meaning would have been different after the class was
16554 entirely defined. */
16560 }
16562 /* Parse an elaborated-type-specifier. Note that the grammar given
16563 here incorporates the resolution to DR68.
16565 elaborated-type-specifier:
16566 class-key :: [opt] nested-name-specifier [opt] identifier
16567 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16568 enum-key :: [opt] nested-name-specifier [opt] identifier
16569 typename :: [opt] nested-name-specifier identifier
16570 typename :: [opt] nested-name-specifier template [opt]
16571 template-id
16573 GNU extension:
16575 elaborated-type-specifier:
16576 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16577 class-key attributes :: [opt] nested-name-specifier [opt]
16578 template [opt] template-id
16579 enum attributes :: [opt] nested-name-specifier [opt] identifier
16581 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16582 declared `friend'. If IS_DECLARATION is TRUE, then this
16583 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16584 something is being declared.
16586 Returns the TYPE specified. */
16588 static tree
16592 {
16594 tree identifier;
16597 tree globalscope;
16600 /* See if we're looking at the `enum' keyword. */
16602 {
16603 /* Consume the `enum' token. */
16605 /* Remember that it's an enumeration type. */
16607 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16608 enums) is used here. */
16611 {
16615 /* Consume the `struct' or `class' and parse it anyway. */
16617 }
16618 /* Parse the attributes. */
16620 }
16621 /* Or, it might be `typename'. */
16623 RID_TYPENAME))
16624 {
16625 /* Consume the `typename' token. */
16627 /* Remember that it's a `typename' type. */
16629 }
16630 /* Otherwise it must be a class-key. */
16631 else
16632 {
16636 /* Parse the attributes. */
16638 }
16640 /* Look for the `::' operator. */
16643 /* Look for the nested-name-specifier. */
16645 {
16650 is_declaration))
16652 }
16653 else
16654 /* Even though `typename' is not present, the proposed resolution
16655 to Core Issue 180 says that in `class A<T>::B', `B' should be
16656 considered a type-name, even if `A<T>' is dependent. */
16661 is_declaration);
16662 /* For everything but enumeration types, consider a template-id.
16663 For an enumeration type, consider only a plain identifier. */
16665 {
16667 tree decl;
16669 /* Allow the `template' keyword. */
16671 /* If we didn't see `template', we don't know if there's a
16672 template-id or not. */
16675 /* Parse the template-id. */
16679 tag_type,
16680 is_declaration);
16681 /* If we didn't find a template-id, look for an ordinary
16682 identifier. */
16684 ;
16685 /* We can get here when cp_parser_template_id, called by
16686 cp_parser_class_name with tag_type == none_type, succeeds
16687 and caches a BASELINK. Then, when called again here,
16688 instead of failing and returning an error_mark_node
16689 returns it (see template/typename17.C in C++11).
16690 ??? Could we diagnose this earlier? */
16692 {
16695 }
16696 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16697 in effect, then we must assume that, upon instantiation, the
16698 template will correspond to a class. */
16702 typename_type,
16704 /* If the `typename' keyword is in effect and DECL is not a type
16705 decl, then type is non existent. */
16707 ;
16713 }
16716 {
16721 {
16724 }
16726 /* For a `typename', we needn't call xref_tag. */
16732 /* Template parameter lists apply only if we are not within a
16733 function parameter list. */
16734 bool template_parm_lists_apply
16743 /* Look up a qualified name in the usual way. */
16745 {
16746 tree decl;
16747 tree ambiguous_decls;
16750 tag_type,
16757 /* If the lookup was ambiguous, an error will already have been
16758 issued. */
16762 /* If we are parsing friend declaration, DECL may be a
16763 TEMPLATE_DECL tree node here. However, we need to check
16764 whether this TEMPLATE_DECL results in valid code. Consider
16765 the following example:
16767 namespace N {
16768 template <class T> class C {};
16769 }
16770 class X {
16771 template <class T> friend class N::C; // #1, valid code
16772 };
16773 template <class T> class Y {
16774 friend class N::C; // #2, invalid code
16775 };
16777 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16778 name lookup of `N::C'. We see that friend declaration must
16779 be template for the code to be valid. Note that
16780 processing_template_decl does not work here since it is
16781 always 1 for the above two cases. */
16783 decl = (cp_parser_maybe_treat_template_as_class
16788 {
16790 identifier,
16793 }
16796 {
16800 allow_template);
16804 }
16806 /* Forward declarations of nested types, such as
16808 class C1::C2;
16809 class C1::C2::C3;
16811 are invalid unless all components preceding the final '::'
16812 are complete. If all enclosing types are complete, these
16813 declarations become merely pointless.
16815 Invalid forward declarations of nested types are errors
16816 caught elsewhere in parsing. Those that are pointless arrive
16817 here. */
16824 }
16825 else
16826 {
16827 /* An elaborated-type-specifier sometimes introduces a new type and
16828 sometimes names an existing type. Normally, the rule is that it
16829 introduces a new type only if there is not an existing type of
16830 the same name already in scope. For example, given:
16832 struct S {};
16833 void f() { struct S s; }
16835 the `struct S' in the body of `f' is the same `struct S' as in
16836 the global scope; the existing definition is used. However, if
16837 there were no global declaration, this would introduce a new
16838 local class named `S'.
16840 An exception to this rule applies to the following code:
16842 namespace N { struct S; }
16844 Here, the elaborated-type-specifier names a new type
16845 unconditionally; even if there is already an `S' in the
16846 containing scope this declaration names a new type.
16847 This exception only applies if the elaborated-type-specifier
16848 forms the complete declaration:
16850 [class.name]
16852 A declaration consisting solely of `class-key identifier ;' is
16853 either a redeclaration of the name in the current scope or a
16854 forward declaration of the identifier as a class name. It
16855 introduces the name into the current scope.
16857 We are in this situation precisely when the next token is a `;'.
16859 An exception to the exception is that a `friend' declaration does
16860 *not* name a new type; i.e., given:
16862 struct S { friend struct T; };
16864 `T' is not a new type in the scope of `S'.
16866 Also, `new struct S' or `sizeof (struct S)' never results in the
16867 definition of a new type; a new type can only be declared in a
16868 declaration context. */
16870 tag_scope ts;
16874 /* Friends have special name lookup rules. */
16878 CPP_SEMICOLON))
16879 /* This is a `class-key identifier ;' */
16881 else
16884 template_p =
16885 (template_parm_lists_apply
16888 /* An unqualified name was used to reference this type, so
16889 there were no qualifying templates. */
16897 }
16898 }
16903 /* Allow attributes on forward declarations of classes. */
16905 {
16915 else
16918 }
16921 {
16922 /* Indicate whether this class was declared as a `class' or as a
16923 `struct'. */
16927 }
16929 /* A "<" cannot follow an elaborated type specifier. If that
16930 happens, the user was probably trying to form a template-id. */
16935 }
16937 /* Parse an enum-specifier.
16939 enum-specifier:
16940 enum-head { enumerator-list [opt] }
16941 enum-head { enumerator-list , } [C++0x]
16943 enum-head:
16944 enum-key identifier [opt] enum-base [opt]
16945 enum-key nested-name-specifier identifier enum-base [opt]
16947 enum-key:
16948 enum
16949 enum class [C++0x]
16950 enum struct [C++0x]
16952 enum-base: [C++0x]
16953 : type-specifier-seq
16955 opaque-enum-specifier:
16956 enum-key identifier enum-base [opt] ;
16958 GNU Extensions:
16959 enum-key attributes[opt] identifier [opt] enum-base [opt]
16960 { enumerator-list [opt] }attributes[opt]
16961 enum-key attributes[opt] identifier [opt] enum-base [opt]
16962 { enumerator-list, }attributes[opt] [C++0x]
16964 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16965 if the token stream isn't an enum-specifier after all. */
16967 static tree
16969 {
16970 tree identifier;
16972 tree prev_scope;
16974 tree attributes;
16987 /* Parse tentatively so that we can back up if we don't find a
16988 enum-specifier. */
16991 /* Caller guarantees that the current token is 'enum', an identifier
16992 possibly follows, and the token after that is an opening brace.
16993 If we don't have an identifier, fabricate an anonymous name for
16994 the enumeration being defined. */
16997 /* Parse the "class" or "struct", which indicates a scoped
16998 enumeration type in C++0x. */
17001 {
17005 /* Consume the `struct' or `class' token. */
17009 }
17013 /* Clear the qualification. */
17018 /* Figure out in what scope the declaration is being placed. */
17024 nested_name_specifier
17032 {
17033 tree name;
17037 enum_type,
17042 input_location);
17044 {
17047 {
17048 /* Are template enums allowed in ISO? */
17052 /* ignore a typename reference, for it will be solved by name
17053 in start_enum. */
17055 }
17056 }
17059 else
17060 {
17065 }
17066 }
17067 else
17068 {
17071 else
17072 {
17078 }
17079 }
17082 /* Check for the `:' that denotes a specified underlying type in C++0x.
17083 Note that a ':' could also indicate a bitfield width, however. */
17085 {
17086 cp_decl_specifier_seq type_specifiers;
17088 /* Consume the `:'. */
17091 /* Parse the type-specifier-seq. */
17096 /* At this point this is surely not elaborated type specifier. */
17105 /* If that didn't work, stop. */
17107 {
17113 }
17114 }
17116 /* Look for the `{' but don't consume it yet. */
17118 {
17120 {
17123 {
17126 }
17127 }
17128 /* An opaque-enum-specifier must have a ';' here. */
17131 {
17134 {
17137 }
17138 }
17139 }
17145 {
17147 {
17151 }
17153 {
17155 }
17156 }
17158 /* Issue an error message if type-definitions are forbidden here. */
17161 else
17162 /* Create the new type. We do this before consuming the opening
17163 brace so the enum will be recorded as being on the line of its
17164 tag (or the 'enum' keyword, if there is no tag). */
17168 /* If the next token is not '{' it is an opaque-enum-specifier or an
17169 elaborated-type-specifier. */
17171 {
17175 {
17176 /* The following catches invalid code such as:
17177 enum class S<int>::E { A, B, C }; */
17185 {
17189 nested_name_specifier);
17191 }
17194 {
17196 "%qT for enum declaration does not name a class "
17199 }
17200 /* If that scope does not contain the scope in which the
17201 class was originally declared, the program is invalid. */
17203 nested_name_specifier))
17204 {
17207 "declaration of %qD in namespace %qD which does not "
17210 else
17212 "declaration of %qD in %qD which does not "
17216 }
17217 }
17222 /* Consume the opening brace. */
17229 {
17233 }
17234 else
17235 {
17241 }
17245 /* If the next token is not '}', then there are some enumerators. */
17247 {
17251 }
17252 else
17255 /* Consume the final '}'. */
17261 }
17262 else
17263 {
17264 /* If a ';' follows, then it is an opaque-enum-specifier
17265 and additional restrictions apply. */
17267 {
17274 }
17275 }
17277 /* Look for trailing attributes to apply to this enumeration, and
17278 apply them if appropriate. */
17280 {
17283 trailing_attr,
17285 }
17287 /* Finish up the enumeration. */
17289 {
17294 }
17297 {
17299 {
17302 }
17304 {
17306 }
17307 }
17308 out:
17311 }
17313 /* Parse an enumerator-list. The enumerators all have the indicated
17314 TYPE.
17316 enumerator-list:
17317 enumerator-definition
17318 enumerator-list , enumerator-definition */
17320 static void
17322 {
17324 {
17325 /* Parse an enumerator-definition. */
17328 /* If the next token is not a ',', we've reached the end of
17329 the list. */
17332 /* Otherwise, consume the `,' and keep going. */
17334 /* If the next token is a `}', there is a trailing comma. */
17336 {
17341 }
17342 }
17343 }
17345 /* Parse an enumerator-definition. The enumerator has the indicated
17346 TYPE.
17348 enumerator-definition:
17349 enumerator
17350 enumerator = constant-expression
17352 enumerator:
17353 identifier
17355 GNU Extensions:
17357 enumerator-definition:
17358 enumerator attributes [opt]
17359 enumerator attributes [opt] = constant-expression */
17361 static void
17363 {
17364 tree identifier;
17365 tree value;
17366 location_t loc;
17368 /* Save the input location because we are interested in the location
17369 of the identifier and not the location of the explicit value. */
17372 /* Look for the identifier. */
17377 /* Parse any specified attributes. */
17380 /* If the next token is an '=', then there is an explicit value. */
17382 {
17383 /* Consume the `=' token. */
17385 /* Parse the value. */
17387 }
17388 else
17391 /* If we are processing a template, make sure the initializer of the
17392 enumerator doesn't contain any bare template parameter pack. */
17396 /* Create the enumerator. */
17398 }
17400 /* Parse a namespace-name.
17402 namespace-name:
17403 original-namespace-name
17404 namespace-alias
17406 Returns the NAMESPACE_DECL for the namespace. */
17408 static tree
17410 {
17411 tree identifier;
17412 tree namespace_decl;
17416 /* Get the name of the namespace. */
17421 /* Look up the identifier in the currently active scope. Look only
17422 for namespaces, due to:
17424 [basic.lookup.udir]
17426 When looking up a namespace-name in a using-directive or alias
17427 definition, only namespace names are considered.
17429 And:
17431 [basic.lookup.qual]
17433 During the lookup of a name preceding the :: scope resolution
17434 operator, object, function, and enumerator names are ignored.
17436 (Note that cp_parser_qualifying_entity only calls this
17437 function if the token after the name is the scope resolution
17438 operator.) */
17440 none_type,
17446 /* If it's not a namespace, issue an error. */
17449 {
17454 }
17457 }
17459 /* Parse a namespace-definition.
17461 namespace-definition:
17462 named-namespace-definition
17463 unnamed-namespace-definition
17465 named-namespace-definition:
17466 original-namespace-definition
17467 extension-namespace-definition
17469 original-namespace-definition:
17470 namespace identifier { namespace-body }
17472 extension-namespace-definition:
17473 namespace original-namespace-name { namespace-body }
17475 unnamed-namespace-definition:
17476 namespace { namespace-body } */
17478 static void
17480 {
17490 {
17494 }
17495 else
17498 /* Look for the `namespace' keyword. */
17501 /* Parse any specified attributes before the identifier. */
17504 /* Get the name of the namespace. We do not attempt to distinguish
17505 between an original-namespace-definition and an
17506 extension-namespace-definition at this point. The semantic
17507 analysis routines are responsible for that. */
17510 else
17513 /* Parse any specified attributes after the identifier. */
17516 {
17519 else
17521 }
17523 /* Start the namespace. */
17526 /* Parse any nested namespace definition. */
17528 {
17533 "nested namespace definitions only available with "
17538 {
17542 else
17543 {
17546 }
17549 }
17550 }
17552 /* Look for the `{' to validate starting the namespace. */
17555 /* "inline namespace" is equivalent to a stub namespace definition
17556 followed by a strong using directive. */
17558 {
17560 /* Set up namespace association. */
17564 /* Import the contents of the inline namespace. */
17568 }
17574 /* Parse the body of the namespace. */
17580 /* Finish the nested namespace definitions. */
17584 /* Finish the namespace. */
17586 /* Look for the final `}'. */
17588 }
17590 /* Parse a namespace-body.
17592 namespace-body:
17593 declaration-seq [opt] */
17595 static void
17597 {
17599 }
17601 /* Parse a namespace-alias-definition.
17603 namespace-alias-definition:
17604 namespace identifier = qualified-namespace-specifier ; */
17606 static void
17608 {
17609 tree identifier;
17610 tree namespace_specifier;
17614 /* Look for the `namespace' keyword. */
17616 /* Look for the identifier. */
17620 /* Look for the `=' token. */
17623 {
17625 /* Skip the definition. */
17630 }
17632 /* Look for the qualified-namespace-specifier. */
17633 namespace_specifier
17635 /* Look for the `;' token. */
17638 /* Register the alias in the symbol table. */
17640 }
17642 /* Parse a qualified-namespace-specifier.
17644 qualified-namespace-specifier:
17645 :: [opt] nested-name-specifier [opt] namespace-name
17647 Returns a NAMESPACE_DECL corresponding to the specified
17648 namespace. */
17650 static tree
17652 {
17653 /* Look for the optional `::'. */
17657 /* Look for the optional nested-name-specifier. */
17665 }
17667 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17668 access declaration.
17670 using-declaration:
17671 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17672 using :: unqualified-id ;
17674 access-declaration:
17675 qualified-id ;
17677 */
17679 static bool
17682 {
17686 tree decl;
17687 tree identifier;
17688 tree qscope;
17693 {
17696 }
17697 else
17698 {
17699 /* Look for the `using' keyword. */
17702 /* Peek at the next token. */
17704 /* See if it's `typename'. */
17706 {
17707 /* Remember that we've seen it. */
17709 /* Consume the `typename' token. */
17711 }
17712 }
17714 /* Look for the optional global scope qualification. */
17715 global_scope_p
17720 /* If we saw `typename', or didn't see `::', then there must be a
17721 nested-name-specifier present. */
17723 {
17729 {
17732 }
17733 }
17734 /* Otherwise, we could be in either of the two productions. In that
17735 case, treat the nested-name-specifier as optional. */
17736 else
17748 /* Something has already gone wrong; there's no need to parse
17749 further. Since an error has occurred, the return value of
17750 cp_parser_parse_definitely will be false, as required. */
17754 /* Parse the unqualified-id. */
17762 {
17767 }
17769 /* The function we call to handle a using-declaration is different
17770 depending on what scope we are in. */
17772 ;
17775 /* [namespace.udecl]
17777 A using declaration shall not name a template-id. */
17780 else
17781 {
17783 {
17784 /* Create the USING_DECL. */
17791 {
17794 }
17795 else
17796 /* Add it to the list of members in this class. */
17798 }
17799 else
17800 {
17802 identifier,
17809 {
17812 }
17815 else
17817 }
17818 }
17820 /* Look for the final `;'. */
17825 "access declarations are deprecated "
17826 "in favour of using-declarations; "
17830 }
17832 /* Parse an alias-declaration.
17834 alias-declaration:
17835 using identifier attribute-specifier-seq [opt] = type-id */
17837 static tree
17839 {
17841 location_t id_location;
17843 cp_decl_specifier_seq decl_specs;
17847 /* Look for the `using' keyword. */
17848 cp_token *using_token
17870 /* Now we are going to parse the type-id of the declaration. */
17872 /*
17873 [dcl.type]/3 says:
17875 "A type-specifier-seq shall not define a class or enumeration
17876 unless it appears in the type-id of an alias-declaration (7.1.3) that
17877 is not the declaration of a template-declaration."
17879 In other words, if we currently are in an alias template, the
17880 type-id should not define a type.
17882 So let's set parser->type_definition_forbidden_message in that
17883 case; cp_parser_check_type_definition (called by
17884 cp_parser_class_specifier) will then emit an error if a type is
17885 defined in the type-id. */
17887 {
17891 }
17895 /* Restore the error message if need be. */
17901 {
17904 }
17906 /* A typedef-name can also be introduced by an alias-declaration. The
17907 identifier following the using keyword becomes a typedef-name. It has
17908 the same semantics as if it were introduced by the typedef
17909 specifier. In particular, it does not define a new type and it shall
17910 not appear in the type-id. */
17915 {
17918 ds_attribute,
17919 attrs_token);
17920 }
17922 ds_typedef,
17923 using_token);
17925 ds_alias,
17926 using_token);
17935 else
17941 // Attach constraints to the alias declaration.
17943 {
17947 }
17954 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17955 added into the symbol table; otherwise, return the TYPE_DECL. */
17959 {
17963 }
17966 }
17968 /* Parse a using-directive.
17970 using-directive:
17971 using namespace :: [opt] nested-name-specifier [opt]
17972 namespace-name ; */
17974 static void
17976 {
17977 tree namespace_decl;
17978 tree attribs;
17980 /* Look for the `using' keyword. */
17982 /* And the `namespace' keyword. */
17984 /* Look for the optional `::' operator. */
17986 /* And the optional nested-name-specifier. */
17992 /* Get the namespace being used. */
17994 /* And any specified attributes. */
17996 /* Update the symbol table. */
17998 /* Look for the final `;'. */
18000 }
18002 /* Parse an asm-definition.
18004 asm-definition:
18005 asm ( string-literal ) ;
18007 GNU Extension:
18009 asm-definition:
18010 asm volatile [opt] ( string-literal ) ;
18011 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18012 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18013 : asm-operand-list [opt] ) ;
18014 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18015 : asm-operand-list [opt]
18016 : asm-clobber-list [opt] ) ;
18017 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18018 : asm-clobber-list [opt]
18019 : asm-goto-list ) ; */
18021 static void
18023 {
18024 tree string;
18029 tree asm_stmt;
18037 /* Look for the `asm' keyword. */
18042 {
18045 }
18047 /* See if the next token is `volatile'. */
18050 {
18051 /* Remember that we saw the `volatile' keyword. */
18053 /* Consume the token. */
18055 }
18059 {
18060 /* Remember that we saw the `goto' keyword. */
18062 /* Consume the token. */
18064 }
18065 /* Look for the opening `('. */
18068 /* Look for the string. */
18071 {
18075 }
18077 /* If we're allowing GNU extensions, check for the extended assembly
18078 syntax. Unfortunately, the `:' tokens need not be separated by
18079 a space in C, and so, for compatibility, we tolerate that here
18080 too. Doing that means that we have to treat the `::' operator as
18081 two `:' tokens. */
18086 {
18091 /* The extended syntax was used. */
18094 /* Look for outputs. */
18096 {
18097 /* Consume the `:'. */
18099 /* Parse the output-operands. */
18101 CPP_COLON)
18103 CPP_SCOPE)
18105 CPP_CLOSE_PAREN)
18107 {
18111 }
18112 }
18113 /* If the next token is `::', there are no outputs, and the
18114 next token is the beginning of the inputs. */
18116 /* The inputs are coming next. */
18119 /* Look for inputs. */
18122 {
18123 /* Consume the `:' or `::'. */
18125 /* Parse the output-operands. */
18127 CPP_COLON)
18129 CPP_SCOPE)
18131 CPP_CLOSE_PAREN))
18132 {
18136 }
18137 }
18139 /* The clobbers are coming next. */
18142 /* Look for clobbers. */
18145 {
18147 /* Consume the `:' or `::'. */
18149 /* Parse the clobbers. */
18151 CPP_COLON)
18153 CPP_CLOSE_PAREN))
18155 }
18158 /* The labels are coming next. */
18161 /* Look for labels. */
18164 {
18166 /* Consume the `:' or `::'. */
18168 /* Parse the labels. */
18170 }
18174 }
18178 /* Look for the closing `)'. */
18186 {
18187 /* Create the ASM_EXPR. */
18189 {
18192 /* If the extended syntax was not used, mark the ASM_EXPR. */
18194 {
18200 }
18201 }
18202 else
18204 }
18205 }
18207 /* Declarators [gram.dcl.decl] */
18209 /* Parse an init-declarator.
18211 init-declarator:
18212 declarator initializer [opt]
18214 GNU Extension:
18216 init-declarator:
18217 declarator asm-specification [opt] attributes [opt] initializer [opt]
18219 function-definition:
18220 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18221 function-body
18222 decl-specifier-seq [opt] declarator function-try-block
18224 GNU Extension:
18226 function-definition:
18227 __extension__ function-definition
18229 TM Extension:
18231 function-definition:
18232 decl-specifier-seq [opt] declarator function-transaction-block
18234 The DECL_SPECIFIERS apply to this declarator. Returns a
18235 representation of the entity declared. If MEMBER_P is TRUE, then
18236 this declarator appears in a class scope. The new DECL created by
18237 this declarator is returned.
18239 The CHECKS are access checks that should be performed once we know
18240 what entity is being declared (and, therefore, what classes have
18241 befriended it).
18243 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18244 for a function-definition here as well. If the declarator is a
18245 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18246 be TRUE upon return. By that point, the function-definition will
18247 have been completely parsed.
18249 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18250 is FALSE.
18252 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18253 parsed declaration if it is an uninitialized single declarator not followed
18254 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18255 if present, will not be consumed. If returned, this declarator will be
18256 created with SD_INITIALIZED but will not call cp_finish_decl.
18258 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18259 and there is an initializer, the pointed location_t is set to the
18260 location of the '=' or `(', or '{' in C++11 token introducing the
18261 initializer. */
18263 static tree
18273 {
18277 tree prefix_attributes;
18279 tree asm_specification;
18280 tree initializer;
18282 tree scope;
18284 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18285 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18286 "(...)". */
18297 /* Gather the attributes that were provided with the
18298 decl-specifiers. */
18301 /* Assume that this is not the declarator for a function
18302 definition. */
18306 /* Default arguments are only permitted for function parameters. */
18310 /* Defer access checks while parsing the declarator; we cannot know
18311 what names are accessible until we know what is being
18312 declared. */
18315 /* Parse the declarator. */
18317 declarator
18322 /* Gather up the deferred checks. */
18327 /* If the DECLARATOR was erroneous, there's no need to go
18328 further. */
18332 /* Check that the number of template-parameter-lists is OK. */
18342 /* Figure out what scope the entity declared by the DECLARATOR is
18343 located in. `grokdeclarator' sometimes changes the scope, so
18344 we compute it now. */
18347 /* Perform any lookups in the declared type which were thought to be
18348 dependent, but are not in the scope of the declarator. */
18349 decl_specifiers->type
18352 /* If we're allowing GNU extensions, look for an
18353 asm-specification. */
18355 {
18356 /* Look for an asm-specification. */
18359 }
18360 else
18363 /* Look for attributes. */
18367 /* Peek at the next token. */
18373 {
18374 /* Check to see if the token indicates the start of a
18375 function-definition. */
18377 {
18379 {
18380 /* If a function-definition should not appear here, issue an
18381 error message. */
18385 }
18387 location_t func_brace_location
18390 /* Neither attributes nor an asm-specification are allowed
18391 on a function-definition. */
18394 "an asm-specification is not allowed "
18398 "attributes are not allowed "
18400 /* This is a function-definition. */
18403 /* Parse the function definition. */
18406 decl_specifiers,
18407 declarator,
18408 prefix_attributes);
18409 else
18410 decl =
18411 (cp_parser_function_definition_from_specifiers_and_declarator
18415 {
18416 /* This is where the prologue starts... */
18419 }
18422 }
18423 }
18425 {
18426 /* A non-template declaration involving a function parameter list
18427 containing an implicit template parameter will be made into a
18428 template. If the resulting declaration is not going to be an
18429 actual function then finish the template scope here to prevent it.
18430 An error message will be issued once we have a decl to talk about.
18432 FIXME probably we should do type deduction rather than create an
18433 implicit template, but the standard currently doesn't allow it. */
18436 }
18438 /* [dcl.dcl]
18440 Only in function declarations for constructors, destructors, and
18441 type conversions can the decl-specifier-seq be omitted.
18443 We explicitly postpone this check past the point where we handle
18444 function-definitions because we tolerate function-definitions
18445 that are missing their return types in some modes. */
18447 {
18451 }
18453 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18457 {
18468 {
18474 }
18475 }
18476 else
18477 {
18478 /* If the init-declarator isn't initialized and isn't followed by a
18479 `,' or `;', it's not a valid init-declarator. */
18482 {
18485 else
18486 {
18490 }
18491 }
18494 }
18496 /* Because start_decl has side-effects, we should only call it if we
18497 know we're going ahead. By this point, we know that we cannot
18498 possibly be looking at any other construct. */
18501 /* Enter the newly declared entry in the symbol table. If we're
18502 processing a declaration in a class-specifier, we wait until
18503 after processing the initializer. */
18505 {
18513 /* Adjust location of decl if declarator->id_loc is more appropriate:
18514 set, and decl wasn't merged with another decl, in which case its
18515 location would be different from input_location, and more accurate. */
18520 }
18522 /* Enter the SCOPE. That way unqualified names appearing in the
18523 initializer will be looked up in SCOPE. */
18526 /* Perform deferred access control checks, now that we know in which
18527 SCOPE the declared entity resides. */
18529 {
18532 /* If the entity being declared is a function, pretend that we
18533 are in its scope. If it is a `friend', it may have access to
18534 things that would not otherwise be accessible. */
18536 {
18539 }
18541 /* Perform access checks for template parameters. */
18544 /* Perform the access control checks for the declarator and the
18545 decl-specifiers. */
18548 /* Restore the saved value. */
18551 }
18553 /* Parse the initializer. */
18558 {
18560 {
18563 else
18564 {
18565 /* If the declaration was erroneous, we don't really
18566 know what the user intended, so just silently
18567 consume the initializer. */
18574 }
18575 }
18576 else
18577 {
18578 /* We want to record the extra mangling scope for in-class
18579 initializers of class members and initializers of static data
18580 member templates. The former involves deferring
18581 parsing of the initializer until end of class as with default
18582 arguments. So right here we only handle the latter. */
18592 }
18593 }
18595 /* The old parser allows attributes to appear after a parenthesized
18596 initializer. Mark Mitchell proposed removing this functionality
18597 on the GCC mailing lists on 2002-08-13. This parser accepts the
18598 attributes -- but ignores them. */
18605 /* And now complain about a non-function implicit template. */
18610 /* For an in-class declaration, use `grokfield' to create the
18611 declaration. */
18613 {
18615 {
18618 }
18627 }
18629 /* Finish processing the declaration. But, skip member
18630 declarations. */
18632 {
18635 asm_specification,
18636 /* If the initializer is in parentheses, then this is
18637 a direct-initialization, which means that an
18638 `explicit' constructor is OK. Otherwise, an
18639 `explicit' constructor cannot be used. */
18642 }
18645 /* Core issue #226 (C++0x only): A default template-argument
18646 shall not be specified in a friend class template
18647 declaration. */
18656 {
18659 else
18661 }
18664 }
18666 /* Parse a declarator.
18668 declarator:
18669 direct-declarator
18670 ptr-operator declarator
18672 abstract-declarator:
18673 ptr-operator abstract-declarator [opt]
18674 direct-abstract-declarator
18676 GNU Extensions:
18678 declarator:
18679 attributes [opt] direct-declarator
18680 attributes [opt] ptr-operator declarator
18682 abstract-declarator:
18683 attributes [opt] ptr-operator abstract-declarator [opt]
18684 attributes [opt] direct-abstract-declarator
18686 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18687 detect constructor, destructor or conversion operators. It is set
18688 to -1 if the declarator is a name, and +1 if it is a
18689 function. Otherwise it is set to zero. Usually you just want to
18690 test for >0, but internally the negative value is used.
18692 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18693 a decl-specifier-seq unless it declares a constructor, destructor,
18694 or conversion. It might seem that we could check this condition in
18695 semantic analysis, rather than parsing, but that makes it difficult
18696 to handle something like `f()'. We want to notice that there are
18697 no decl-specifiers, and therefore realize that this is an
18698 expression, not a declaration.)
18700 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18701 the declarator is a direct-declarator of the form "(...)".
18703 MEMBER_P is true iff this declarator is a member-declarator.
18705 FRIEND_P is true iff this declarator is a friend. */
18709 cp_parser_declarator_kind dcl_kind,
18713 {
18716 cp_cv_quals cv_quals;
18717 tree class_type;
18720 /* Assume this is not a constructor, destructor, or type-conversion
18721 operator. */
18728 /* Check for the ptr-operator production. */
18730 /* Parse the ptr-operator. */
18736 /* If that worked, then we have a ptr-operator. */
18738 {
18739 /* If a ptr-operator was found, then this declarator was not
18740 parenthesized. */
18743 /* The dependent declarator is optional if we are parsing an
18744 abstract-declarator. */
18748 /* Parse the dependent declarator. */
18753 friend_p);
18755 /* If we are parsing an abstract-declarator, we must handle the
18756 case where the dependent declarator is absent. */
18761 declarator = cp_parser_make_indirect_declarator
18763 }
18764 /* Everything else is a direct-declarator. */
18765 else
18766 {
18769 CPP_OPEN_PAREN);
18771 ctor_dtor_or_conv_p,
18773 }
18778 }
18780 /* Parse a direct-declarator or direct-abstract-declarator.
18782 direct-declarator:
18783 declarator-id
18784 direct-declarator ( parameter-declaration-clause )
18785 cv-qualifier-seq [opt]
18786 ref-qualifier [opt]
18787 exception-specification [opt]
18788 direct-declarator [ constant-expression [opt] ]
18789 ( declarator )
18791 direct-abstract-declarator:
18792 direct-abstract-declarator [opt]
18793 ( parameter-declaration-clause )
18794 cv-qualifier-seq [opt]
18795 ref-qualifier [opt]
18796 exception-specification [opt]
18797 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18798 ( abstract-declarator )
18800 Returns a representation of the declarator. DCL_KIND is
18801 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18802 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18803 we are parsing a direct-declarator. It is
18804 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18805 of ambiguity we prefer an abstract declarator, as per
18806 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18807 as for cp_parser_declarator. */
18811 cp_parser_declarator_kind dcl_kind,
18814 {
18824 {
18825 /* Peek at the next token. */
18828 {
18829 /* This is either a parameter-declaration-clause, or a
18830 parenthesized declarator. When we know we are parsing a
18831 named declarator, it must be a parenthesized declarator
18832 if FIRST is true. For instance, `(int)' is a
18833 parameter-declaration-clause, with an omitted
18834 direct-abstract-declarator. But `((*))', is a
18835 parenthesized abstract declarator. Finally, when T is a
18836 template parameter `(T)' is a
18837 parameter-declaration-clause, and not a parenthesized
18838 named declarator.
18840 We first try and parse a parameter-declaration-clause,
18841 and then try a nested declarator (if FIRST is true).
18843 It is not an error for it not to be a
18844 parameter-declaration-clause, even when FIRST is
18845 false. Consider,
18847 int i (int);
18848 int i (3);
18850 The first is the declaration of a function while the
18851 second is the definition of a variable, including its
18852 initializer.
18854 Having seen only the parenthesis, we cannot know which of
18855 these two alternatives should be selected. Even more
18856 complex are examples like:
18858 int i (int (a));
18859 int i (int (3));
18861 The former is a function-declaration; the latter is a
18862 variable initialization.
18864 Thus again, we try a parameter-declaration-clause, and if
18865 that fails, we back out and return. */
18868 {
18869 tree params;
18872 /* In a member-declarator, the only valid interpretation
18873 of a parenthesis is the start of a
18874 parameter-declaration-clause. (It is invalid to
18875 initialize a static data member with a parenthesized
18876 initializer; only the "=" form of initialization is
18877 permitted.) */
18881 /* Consume the `('. */
18884 {
18885 /* If this is going to be an abstract declarator, we're
18886 in a declarator and we can't have default args. */
18889 }
18893 /* Parse the parameter-declaration-clause. */
18896 /* Consume the `)'. */
18899 /* If all went well, parse the cv-qualifier-seq,
18900 ref-qualifier and the exception-specification. */
18902 {
18903 cp_cv_quals cv_quals;
18904 cp_virt_specifiers virt_specifiers;
18905 cp_ref_qualifier ref_qual;
18906 tree exception_specification;
18907 tree late_return;
18908 tree attrs;
18918 /* Parse the cv-qualifier-seq. */
18920 /* Parse the ref-qualifier. */
18922 /* Parse the tx-qualifier. */
18924 /* And the exception-specification. */
18925 exception_specification
18930 /* In here, we handle cases where attribute is used after
18931 the function declaration. For example:
18932 void func (int x) __attribute__((vector(..))); */
18936 {
18940 CPP_SEMICOLON)
18942 CPP_OPEN_BRACE))
18945 ;
18946 else
18948 }
18950 late_return = (cp_parser_late_return_type_opt
18954 /* Parse the virt-specifier-seq. */
18957 /* Create the function-declarator. */
18959 params,
18960 cv_quals,
18961 virt_specifiers,
18962 ref_qual,
18963 tx_qual,
18964 exception_specification,
18965 late_return,
18966 requires_clause);
18969 /* Any subsequent parameter lists are to do with
18970 return type, so are not those of the declared
18971 function. */
18973 }
18975 /* Remove the function parms from scope. */
18979 /* Repeat the main loop. */
18981 }
18983 /* If this is the first, we can try a parenthesized
18984 declarator. */
18986 {
18992 /* Consume the `('. */
18994 /* Parse the nested declarator. */
18997 declarator
19003 /* Expect a `)'. */
19010 }
19011 /* Otherwise, we must be done. */
19012 else
19014 }
19018 {
19019 /* Parse an array-declarator. */
19028 /* Consume the `['. */
19030 /* Peek at the next token. */
19032 /* If the next token is `]', then there is no
19033 constant-expression. */
19035 {
19037 bounds
19047 {
19048 /* Normally, the array bound must be an integral constant
19049 expression. However, as an extension, we allow VLAs
19050 in function scopes as long as they aren't part of a
19051 parameter declaration. */
19055 }
19058 {
19059 /* Remember this wasn't a constant-expression. */
19062 }
19063 }
19064 else
19066 /* Look for the closing `]'. */
19068 {
19071 }
19076 }
19078 {
19079 {
19080 tree qualifying_scope;
19081 tree unqualified_name;
19082 tree attrs;
19083 special_function_kind sfk;
19088 /* Parse a declarator-id */
19091 {
19094 /* If we see an ellipsis, we should be looking at a
19095 parameter pack. */
19097 {
19098 /* Consume the `...' */
19102 }
19103 }
19106 unqualified_name
19110 {
19114 {
19115 /* Check whether an error occurred. */
19118 /* We already consumed the ellipsis to mark a
19119 parameter pack, but we have no way to report it,
19120 so abort the tentative parse. We will be exiting
19121 immediately anyway. */
19123 }
19124 else
19130 && (qualifying_scope
19132 {
19135 }
19136 }
19141 {
19146 }
19152 {
19153 /* In the declaration of a member of a template class
19154 outside of the class itself, the SCOPE will sometimes
19155 be a TYPENAME_TYPE. For example, given:
19157 template <typename T>
19158 int S<T>::R::i = 3;
19160 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19161 this context, we must resolve S<T>::R to an ordinary
19162 type, rather than a typename type.
19164 The reason we normally avoid resolving TYPENAME_TYPEs
19165 is that a specialization of `S' might render
19166 `S<T>::R' not a type. However, if `S' is
19167 specialized, then this `i' will not be used, so there
19168 is no harm in resolving the types here. */
19169 tree type;
19171 /* Resolve the TYPENAME_TYPE. */
19174 /* If that failed, the declarator is invalid. */
19176 {
19179 "cannot define member of dependent typedef "
19181 else
19186 }
19188 }
19193 {
19194 tree class_type;
19199 else
19203 {
19206 {
19209 {
19213 "use %<%T::%D%> instead of %<%T::%D%> to "
19215 class_type,
19220 }
19221 else
19223 }
19224 else
19225 {
19226 /* We do not attempt to print the declarator
19227 here because we do not have enough
19228 information about its original syntactic
19229 form. */
19233 }
19234 }
19237 {
19243 for an anonymous type, even if the type
19244 got a name for linkage purposes. */
19246 /* Handle correctly (c++/19200):
19248 struct S {
19249 struct T{};
19250 friend void S(T);
19251 };
19253 and also:
19255 namespace N {
19256 void S();
19257 }
19259 struct S {
19260 friend void N::S();
19261 }; */
19262 && !(friend_p
19265 class_type))
19266 {
19269 }
19277 }
19278 }
19280 unqualified_name,
19281 sfk);
19288 }
19290 handle_declarator:;
19293 {
19294 /* Any names that appear after the declarator-id for a
19295 member are looked up in the containing scope. */
19297 {
19298 /* But declarations with qualified-ids can't appear in a
19299 function. */
19303 }
19305 }
19309 /* Default args are only allowed on function
19310 declarations. */
19312 else
19316 }
19317 /* We're done. */
19318 else
19320 }
19322 /* For an abstract declarator, we might wind up with nothing at this
19323 point. That's an error; the declarator is not optional. */
19327 /* If we entered a scope, we must exit it now. */
19335 }
19337 /* Parse a ptr-operator.
19339 ptr-operator:
19340 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19341 * cv-qualifier-seq [opt]
19342 &
19343 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19344 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19346 GNU Extension:
19348 ptr-operator:
19349 & cv-qualifier-seq [opt]
19351 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19352 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19353 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19354 filled in with the TYPE containing the member. *CV_QUALS is
19355 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19356 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19357 Note that the tree codes returned by this function have nothing
19358 to do with the types of trees that will be eventually be created
19359 to represent the pointer or reference type being parsed. They are
19360 just constants with suggestive names. */
19361 static enum tree_code
19366 {
19371 /* Assume that it's not a pointer-to-member. */
19373 /* And that there are no cv-qualifiers. */
19376 /* Peek at the next token. */
19379 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19389 {
19390 /* Consume the `*', `&' or `&&'. */
19393 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19394 `&', if we are allowing GNU extensions. (The only qualifier
19395 that can legally appear after `&' is `restrict', but that is
19396 enforced during semantic analysis. */
19404 }
19405 else
19406 {
19407 /* Try the pointer-to-member case. */
19409 /* Look for the optional `::' operator. */
19412 /* Look for the nested-name specifier. */
19419 /* If we found it, and the next token is a `*', then we are
19420 indeed looking at a pointer-to-member operator. */
19423 {
19424 /* Indicate that the `*' operator was used. */
19432 else
19433 {
19434 /* The type of which the member is a member is given by the
19435 current SCOPE. */
19437 /* The next name will not be qualified. */
19441 /* Look for optional c++11 attributes. */
19445 /* Look for the optional cv-qualifier-seq. */
19447 }
19448 }
19449 /* If that didn't work we don't have a ptr-operator. */
19452 }
19455 }
19457 /* Parse an (optional) cv-qualifier-seq.
19459 cv-qualifier-seq:
19460 cv-qualifier cv-qualifier-seq [opt]
19462 cv-qualifier:
19463 const
19464 volatile
19466 GNU Extension:
19468 cv-qualifier:
19469 __restrict__
19471 Returns a bitmask representing the cv-qualifiers. */
19473 static cp_cv_quals
19475 {
19479 {
19481 cp_cv_quals cv_qualifier;
19483 /* Peek at the next token. */
19485 /* See if it's a cv-qualifier. */
19487 {
19503 }
19509 {
19512 }
19513 else
19514 {
19517 }
19518 }
19521 }
19523 /* Parse an (optional) ref-qualifier
19525 ref-qualifier:
19526 &
19527 &&
19529 Returns cp_ref_qualifier representing ref-qualifier. */
19531 static cp_ref_qualifier
19533 {
19536 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19541 {
19546 {
19558 }
19563 {
19566 }
19567 else
19568 {
19571 }
19572 }
19575 }
19577 /* Parse an optional tx-qualifier.
19579 tx-qualifier:
19580 transaction_safe
19581 transaction_safe_dynamic */
19583 static tree
19585 {
19588 {
19593 {
19597 {
19600 {
19603 }
19604 else
19606 }
19607 }
19608 }
19610 }
19612 /* Parse an (optional) virt-specifier-seq.
19614 virt-specifier-seq:
19615 virt-specifier virt-specifier-seq [opt]
19617 virt-specifier:
19618 override
19619 final
19621 Returns a bitmask representing the virt-specifiers. */
19623 static cp_virt_specifiers
19625 {
19629 {
19631 cp_virt_specifiers virt_specifier;
19633 /* Peek at the next token. */
19635 /* See if it's a virt-specifier-qualifier. */
19639 {
19642 }
19644 {
19647 }
19649 {
19651 }
19652 else
19656 {
19659 }
19660 else
19661 {
19664 }
19665 }
19667 }
19669 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19670 is in scope even though it isn't real. */
19672 void
19674 {
19675 tree this_parm;
19678 {
19679 /* We don't clear this between NSDMIs. Is it already what we want? */
19684 }
19687 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19689 current_class_ref
19692 }
19694 /* Return true iff our current scope is a non-static data member
19695 initializer. */
19697 bool
19699 {
19700 /* We recognize NSDMI context by the context-less 'this' pointer set up
19701 by the function above. */
19707 }
19709 /* Parse a late-specified return type, if any. This is not a separate
19710 non-terminal, but part of a function declarator, which looks like
19712 -> trailing-type-specifier-seq abstract-declarator(opt)
19714 Returns the type indicated by the type-id.
19716 In addition to this, parse any queued up omp declare simd
19717 clauses and Cilk Plus SIMD-enabled function's vector attributes.
19719 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19720 function. */
19722 static tree
19725 {
19729 && declarator
19736 && declarator
19739 /* Peek at the next token. */
19741 /* A late-specified return type is indicated by an initial '->'. */
19750 {
19751 /* DR 1207: 'this' is in scope in the trailing return type. */
19753 }
19756 {
19757 /* Consume the ->. */
19761 }
19763 /* Function declarations may be followed by a trailing
19764 requires-clause. */
19768 declarator->attributes
19772 declarator->attributes
19776 declarator->attributes
19781 {
19784 }
19787 }
19789 /* Parse a declarator-id.
19791 declarator-id:
19792 id-expression
19793 :: [opt] nested-name-specifier [opt] type-name
19795 In the `id-expression' case, the value returned is as for
19796 cp_parser_id_expression if the id-expression was an unqualified-id.
19797 If the id-expression was a qualified-id, then a SCOPE_REF is
19798 returned. The first operand is the scope (either a NAMESPACE_DECL
19799 or TREE_TYPE), but the second is still just a representation of an
19800 unqualified-id. */
19802 static tree
19804 {
19805 tree id;
19806 /* The expression must be an id-expression. Assume that qualified
19807 names are the names of types so that:
19809 template <class T>
19810 int S<T>::R::i = 3;
19812 will work; we must treat `S<T>::R' as the name of a type.
19813 Similarly, assume that qualified names are templates, where
19814 required, so that:
19816 template <class T>
19817 int S<T>::R<T>::i = 3;
19819 will work, too. */
19825 optional_p);
19829 }
19831 /* Parse a type-id.
19833 type-id:
19834 type-specifier-seq abstract-declarator [opt]
19836 Returns the TYPE specified. */
19838 static tree
19841 {
19842 cp_decl_specifier_seq type_specifier_seq;
19845 /* Parse the type-specifier-seq. */
19847 is_trailing_return,
19852 /* There might or might not be an abstract declarator. */
19854 /* Look for the declarator. */
19855 abstract_declarator
19860 /* Check to see if there really was a declarator. */
19865 /* The concepts TS allows 'auto' as a type-id. */
19867 /* None of the valid uses of 'auto' in C++14 involve the type-id
19868 nonterminal, but it is valid in a trailing-return-type. */
19871 {
19872 /* A type-id with type 'auto' is only ok if the abstract declarator
19873 is a function declarator with a late-specified return type.
19875 A type-id with 'auto' is also valid in a trailing-return-type
19876 in a compound-requirement. */
19883 else
19884 {
19887 }
19888 }
19891 is_template_arg);
19892 }
19894 static tree
19896 {
19898 }
19900 static tree
19902 {
19903 tree r;
19905 parser->type_definition_forbidden_message
19910 {
19913 }
19915 }
19917 static tree
19919 {
19921 }
19923 /* Parse a type-specifier-seq.
19925 type-specifier-seq:
19926 type-specifier type-specifier-seq [opt]
19928 GNU extension:
19930 type-specifier-seq:
19931 attributes type-specifier-seq [opt]
19933 If IS_DECLARATION is true, we are at the start of a "condition" or
19934 exception-declaration, so we might be followed by a declarator-id.
19936 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
19937 i.e. we've just seen "->".
19939 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
19941 static void
19946 {
19951 /* Clear the TYPE_SPECIFIER_SEQ. */
19954 /* In the context of a trailing return type, enum E { } is an
19955 elaborated-type-specifier followed by a function-body, not an
19956 enum-specifier. */
19960 /* Parse the type-specifiers and attributes. */
19962 {
19963 tree type_specifier;
19966 /* Check for attributes first. */
19968 {
19973 }
19975 /* record the token of the beginning of the type specifier seq,
19976 for error reporting purposes*/
19980 /* Look for the type-specifier. */
19982 flags,
19983 type_specifier_seq,
19985 NULL,
19988 {
19989 /* If the first type-specifier could not be found, this is not a
19990 type-specifier-seq at all. */
19992 {
19993 /* Set in_declarator_p to avoid skipping to the semicolon. */
20005 }
20006 /* If subsequent type-specifiers could not be found, the
20007 type-specifier-seq is complete. */
20009 }
20012 /* The standard says that a condition can be:
20014 type-specifier-seq declarator = assignment-expression
20016 However, given:
20018 struct S {};
20019 if (int S = ...)
20021 we should treat the "S" as a declarator, not as a
20022 type-specifier. The standard doesn't say that explicitly for
20023 type-specifier-seq, but it does say that for
20024 decl-specifier-seq in an ordinary declaration. Perhaps it
20025 would be clearer just to allow a decl-specifier-seq here, and
20026 then add a semantic restriction that if any decl-specifiers
20027 that are not type-specifiers appear, the program is invalid. */
20030 }
20031 }
20033 /* Return whether the function currently being declared has an associated
20034 template parameter list. */
20036 static bool
20038 {
20051 }
20053 /* Parse a parameter-declaration-clause.
20055 parameter-declaration-clause:
20056 parameter-declaration-list [opt] ... [opt]
20057 parameter-declaration-list , ...
20059 Returns a representation for the parameter declarations. A return
20060 value of NULL indicates a parameter-declaration-clause consisting
20061 only of an ellipsis. */
20063 static tree
20065 {
20066 tree parameters;
20075 parser->auto_is_implicit_function_template_parm_p
20077 }
20083 && !processing_template_parmlist
20089 /* Peek at the next token. */
20091 /* Check for trivial parameter-declaration-clauses. */
20093 {
20094 /* Consume the `...' token. */
20097 }
20099 /* There are no parameters. */
20100 {
20101 #ifndef NO_IMPLICIT_EXTERN_C
20106 else
20107 #endif
20109 }
20110 /* Check for `(void)', too, which is a special case. */
20114 {
20115 /* Consume the `void' token. */
20117 /* There are no parameters. */
20119 }
20121 /* Parse the parameter-declaration-list. */
20123 /* If a parse error occurred while parsing the
20124 parameter-declaration-list, then the entire
20125 parameter-declaration-clause is erroneous. */
20129 /* Peek at the next token. */
20131 /* If it's a `,', the clause should terminate with an ellipsis. */
20133 {
20134 /* Consume the `,'. */
20136 /* Expect an ellipsis. */
20137 ellipsis_p
20139 }
20140 /* It might also be `...' if the optional trailing `,' was
20141 omitted. */
20143 {
20144 /* Consume the `...' token. */
20146 /* And remember that we saw it. */
20148 }
20149 else
20152 /* Finish the parameter list. */
20157 }
20159 /* Parse a parameter-declaration-list.
20161 parameter-declaration-list:
20162 parameter-declaration
20163 parameter-declaration-list , parameter-declaration
20165 Returns a representation of the parameter-declaration-list, as for
20166 cp_parser_parameter_declaration_clause. However, the
20167 `void_list_node' is never appended to the list. Upon return,
20168 *IS_ERROR will be true iff an error occurred. */
20170 static tree
20172 {
20178 /* Assume all will go well. */
20180 /* The special considerations that apply to a function within an
20181 unbraced linkage specifications do not apply to the parameters
20182 to the function. */
20183 saved_in_unbraced_linkage_specification_p
20187 /* Look for more parameters. */
20189 {
20197 /* Parse the parameter. */
20198 parameter
20203 /* We don't know yet if the enclosing context is deprecated, so wait
20204 and warn in grokparms if appropriate. */
20208 {
20209 /* If a function parameter pack was specified and an implicit template
20210 parameter was introduced during cp_parser_parameter_declaration,
20211 change any implicit parameters introduced into packs. */
20215 {
20223 }
20227 PARM,
20230 }
20234 /* If a parse error occurred parsing the parameter declaration,
20235 then the entire parameter-declaration-list is erroneous. */
20237 {
20241 }
20251 {
20255 }
20257 /* Add the new parameter to the list. */
20261 /* Peek at the next token. */
20264 /* These are for Objective-C++ */
20267 /* The parameter-declaration-list is complete. */
20270 {
20273 /* Peek at the next token. */
20275 /* If it's an ellipsis, then the list is complete. */
20278 /* Otherwise, there must be more parameters. Consume the
20279 `,'. */
20281 /* When parsing something like:
20283 int i(float f, double d)
20285 we can tell after seeing the declaration for "f" that we
20286 are not looking at an initialization of a variable "i",
20287 but rather at the declaration of a function "i".
20289 Due to the fact that the parsing of template arguments
20290 (as specified to a template-id) requires backtracking we
20291 cannot use this technique when inside a template argument
20292 list. */
20296 /* However, a parameter-declaration of the form
20297 "float(f)" (which is a valid declaration of a
20298 parameter "f") can also be interpreted as an
20299 expression (the conversion of "f" to "float"). */
20302 }
20303 else
20304 {
20312 }
20313 }
20315 parser->in_unbraced_linkage_specification_p
20318 /* Reset implicit_template_scope if we are about to leave the function
20319 parameter list that introduced it. Note that for out-of-line member
20320 definitions, there will be one or more class scopes before we get to
20321 the template parameter scope. */
20325 {
20329 {
20332 }
20333 }
20336 }
20338 /* Parse a parameter declaration.
20340 parameter-declaration:
20341 decl-specifier-seq ... [opt] declarator
20342 decl-specifier-seq declarator = assignment-expression
20343 decl-specifier-seq ... [opt] abstract-declarator [opt]
20344 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20346 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20347 declares a template parameter. (In that case, a non-nested `>'
20348 token encountered during the parsing of the assignment-expression
20349 is not interpreted as a greater-than operator.)
20351 Returns a representation of the parameter, or NULL if an error
20352 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20353 true iff the declarator is of the form "(p)". */
20359 {
20361 cp_decl_specifier_seq decl_specifiers;
20363 tree default_argument;
20368 /* In a template parameter, `>' is not an operator.
20370 [temp.param]
20372 When parsing a default template-argument for a non-type
20373 template-parameter, the first non-nested `>' is taken as the end
20374 of the template parameter-list rather than a greater-than
20375 operator. */
20377 /* Type definitions may not appear in parameter types. */
20379 parser->type_definition_forbidden_message
20382 /* Parse the declaration-specifiers. */
20384 CP_PARSER_FLAGS_NONE,
20388 /* Complain about missing 'typename' or other invalid type names. */
20393 /* If an error occurred, there's no reason to attempt to parse the
20394 rest of the declaration. */
20396 {
20399 }
20401 /* Peek at the next token. */
20404 /* If the next token is a `)', `,', `=', `>', or `...', then there
20405 is no declarator. However, when variadic templates are enabled,
20406 there may be a declarator following `...'. */
20411 {
20415 }
20416 /* Otherwise, there should be a declarator. */
20417 else
20418 {
20422 /* After seeing a decl-specifier-seq, if the next token is not a
20423 "(", there is no possibility that the code is a valid
20424 expression. Therefore, if parsing tentatively, we commit at
20425 this point. */
20427 /* In an expression context, having seen:
20429 (int((char ...
20431 we cannot be sure whether we are looking at a
20432 function-type (taking a "char" as a parameter) or a cast
20433 of some object of type "char" to "int". */
20439 /* Parse the declarator. */
20442 CP_PARSER_DECLARATOR_EITHER,
20444 parenthesized_p,
20448 /* After the declarator, allow more attributes. */
20449 decl_specifiers.attributes
20453 /* If the declarator is a template parameter pack, remember that and
20454 clear the flag in the declarator itself so we don't get errors
20455 from grokdeclarator. */
20457 {
20460 }
20461 }
20463 /* If the next token is an ellipsis, and we have not seen a declarator
20464 name, and if either the type of the declarator contains parameter
20465 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20466 for, eg, abbreviated integral type names), then we actually have a
20467 parameter pack expansion expression. Otherwise, leave the ellipsis
20468 for a C-style variadic function. */
20471 {
20482 {
20483 /* Consume the `...'. */
20487 /* Build a pack expansion type */
20492 else
20494 }
20495 }
20497 /* The restriction on defining new types applies only to the type
20498 of the parameter, not to the default argument. */
20501 /* If the next token is `=', then process a default argument. */
20503 {
20506 /* If we are defining a class, then the tokens that make up the
20507 default argument must be saved and processed later. */
20513 // A constrained-type-specifier may declare a type template-parameter.
20515 default_argument
20518 // A constrained-type-specifier may declare a template-template-parameter.
20520 default_argument
20523 /* Outside of a class definition, we can just parse the
20524 assignment-expression. */
20525 else
20526 default_argument
20530 {
20532 "default arguments are only "
20534 }
20536 || template_parameter_pack_p
20539 {
20540 /* Find the name of the parameter pack. */
20547 template_parm_p
20553 else
20555 template_parm_p
20562 }
20563 }
20564 else
20568 declarator,
20569 default_argument,
20570 template_parameter_pack_p);
20571 }
20573 /* Parse a default argument and return it.
20575 TEMPLATE_PARM_P is true if this is a default argument for a
20576 non-type template parameter. */
20577 static tree
20579 {
20585 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20586 set correctly. */
20589 /* Local variable names (and the `this' keyword) may not
20590 appear in a default argument. */
20593 /* Parse the assignment-expression. */
20598 /* The "this" pointer is not valid in a default argument. */
20600 {
20605 }
20606 default_argument
20608 /* Restore the "this" pointer. */
20610 {
20613 }
20622 }
20624 /* Parse a function-body.
20626 function-body:
20627 compound_statement */
20629 static void
20631 {
20635 }
20637 /* Parse a ctor-initializer-opt followed by a function-body. Return
20638 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20639 is true we are parsing a function-try-block. */
20641 static bool
20644 {
20652 /* Begin the function body. */
20654 /* Parse the optional ctor-initializer. */
20657 /* If we're parsing a constexpr constructor definition, we need
20658 to check that the constructor body is indeed empty. However,
20659 before we get to cp_parser_function_body lot of junk has been
20660 generated, so we can't just check that we have an empty block.
20661 Rather we take a snapshot of the outermost block, and check whether
20662 cp_parser_function_body changed its state. */
20664 {
20668 }
20669 /* Parse the function-body. */
20673 /* Finish the function body. */
20677 }
20679 /* Parse an initializer.
20681 initializer:
20682 = initializer-clause
20683 ( expression-list )
20685 Returns an expression representing the initializer. If no
20686 initializer is present, NULL_TREE is returned.
20688 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20689 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20690 set to TRUE if there is no initializer present. If there is an
20691 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20692 is set to true; otherwise it is set to false. */
20694 static tree
20697 {
20699 tree init;
20701 /* Peek at the next token. */
20704 /* Let our caller know whether or not this initializer was
20705 parenthesized. */
20707 /* Assume that the initializer is constant. */
20711 {
20712 /* Consume the `='. */
20714 /* Parse the initializer-clause. */
20716 }
20718 {
20723 non_constant_p);
20728 }
20730 {
20735 }
20736 else
20737 {
20738 /* Anything else is an error. */
20741 }
20744 }
20746 /* Parse an initializer-clause.
20748 initializer-clause:
20749 assignment-expression
20750 braced-init-list
20752 Returns an expression representing the initializer.
20754 If the `assignment-expression' production is used the value
20755 returned is simply a representation for the expression.
20757 Otherwise, calls cp_parser_braced_list. */
20759 static cp_expr
20761 {
20762 cp_expr initializer;
20764 /* Assume the expression is constant. */
20767 /* If it is not a `{', then we are looking at an
20768 assignment-expression. */
20770 {
20771 initializer
20774 non_constant_p);
20775 }
20776 else
20780 }
20782 /* Parse a brace-enclosed initializer list.
20784 braced-init-list:
20785 { initializer-list , [opt] }
20786 { }
20788 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20789 the elements of the initializer-list (or NULL, if the last
20790 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20791 NULL_TREE. There is no way to detect whether or not the optional
20792 trailing `,' was provided. NON_CONSTANT_P is as for
20793 cp_parser_initializer. */
20795 static cp_expr
20797 {
20798 tree initializer;
20801 /* Consume the `{' token. */
20803 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20805 /* If it's not a `}', then there is a non-trivial initializer. */
20807 {
20808 /* Parse the initializer list. */
20811 /* A trailing `,' token is allowed. */
20814 }
20815 else
20817 /* Now, there should be a trailing `}'. */
20823 /* Build a location of the form:
20824 { ... }
20825 ^~~~~~~
20826 with caret==start at the open brace, finish at the close brace. */
20830 }
20832 /* Consume tokens up to, and including, the next non-nested closing `]'.
20833 Returns true iff we found a closing `]'. */
20835 static bool
20837 {
20841 {
20845 {
20848 /* If we've run out of tokens, then there is no closing `]'. */
20857 {
20860 }
20865 }
20867 /* Consume the token. */
20869 }
20870 }
20872 /* Return true if we are looking at an array-designator, false otherwise. */
20874 static bool
20876 {
20877 /* Consume the `['. */
20882 /* Skip tokens until the next token is a closing square bracket.
20883 If we find the closing `]', and the next token is a `=', then
20884 we are looking at an array designator. */
20885 bool array_designator_p
20889 /* Roll back the tokens we skipped. */
20893 }
20895 /* Parse an initializer-list.
20897 initializer-list:
20898 initializer-clause ... [opt]
20899 initializer-list , initializer-clause ... [opt]
20901 GNU Extension:
20903 initializer-list:
20904 designation initializer-clause ...[opt]
20905 initializer-list , designation initializer-clause ...[opt]
20907 designation:
20908 . identifier =
20909 identifier :
20910 [ constant-expression ] =
20912 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20913 for the initializer. If the INDEX of the elt is non-NULL, it is the
20914 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20915 as for cp_parser_initializer. */
20919 {
20922 /* Assume all of the expressions are constant. */
20925 /* Parse the rest of the list. */
20927 {
20929 tree designator;
20930 tree initializer;
20933 /* If the next token is an identifier and the following one is a
20934 colon, we are looking at the GNU designated-initializer
20935 syntax. */
20939 {
20940 /* Warn the user that they are using an extension. */
20943 /* Consume the identifier. */
20945 /* Consume the `:'. */
20947 }
20948 /* Also handle the C99 syntax, '. id ='. */
20953 {
20954 /* Warn the user that they are using an extension. */
20957 /* Consume the `.'. */
20959 /* Consume the identifier. */
20961 /* Consume the `='. */
20963 }
20964 /* Also handle C99 array designators, '[ const ] ='. */
20968 {
20969 /* In C++11, [ could start a lambda-introducer. */
20975 {
20978 }
20979 else
20980 {
20985 }
20991 }
20992 else
20995 /* Parse the initializer. */
20998 /* If any clause is non-constant, so is the entire initializer. */
21002 /* If we have an ellipsis, this is an initializer pack
21003 expansion. */
21005 {
21006 /* Consume the `...'. */
21009 /* Turn the initializer into an initializer expansion. */
21011 }
21013 /* Add it to the vector. */
21016 /* If the next token is not a comma, we have reached the end of
21017 the list. */
21021 /* Peek at the next token. */
21023 /* If the next token is a `}', then we're still done. An
21024 initializer-clause can have a trailing `,' after the
21025 initializer-list and before the closing `}'. */
21029 /* Consume the `,' token. */
21031 }
21034 }
21036 /* Classes [gram.class] */
21038 /* Parse a class-name.
21040 class-name:
21041 identifier
21042 template-id
21044 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21045 to indicate that names looked up in dependent types should be
21046 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21047 keyword has been used to indicate that the name that appears next
21048 is a template. TAG_TYPE indicates the explicit tag given before
21049 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21050 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21051 is the class being defined in a class-head. If ENUM_OK is TRUE,
21052 enum-names are also accepted.
21054 Returns the TYPE_DECL representing the class. */
21056 static tree
21065 {
21066 tree decl;
21067 tree scope;
21072 /* All class-names start with an identifier. */
21075 {
21078 }
21080 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21081 to a template-id, so we save it here. */
21086 /* Any name names a type if we're following the `typename' keyword
21087 in a qualified name where the enclosing scope is type-dependent. */
21090 /* Handle the common case (an identifier, but not a template-id)
21091 efficiently. */
21094 {
21098 /* Look for the identifier. */
21102 /* If the next token isn't an identifier, we are certainly not
21103 looking at a class-name. */
21106 /* If we know this is a type-name, there's no need to look it
21107 up. */
21110 else
21111 {
21112 tree ambiguous_decls;
21113 /* If we already know that this lookup is ambiguous, then
21114 we've already issued an error message; there's no reason
21115 to check again. */
21117 {
21120 }
21121 /* If the next token is a `::', then the name must be a type
21122 name.
21124 [basic.lookup.qual]
21126 During the lookup for a name preceding the :: scope
21127 resolution operator, object, function, and enumerator
21128 names are ignored. */
21131 /* Look up the name. */
21133 tag_type,
21136 check_dependency_p,
21140 {
21144 }
21145 }
21146 }
21147 else
21148 {
21149 /* Try a template-id. */
21151 check_dependency_p,
21152 tag_type,
21153 is_declaration);
21156 }
21160 /* If this is a typename, create a TYPENAME_TYPE. */
21162 {
21167 }
21171 /* Check to see that it is really the name of a class. */
21175 /* Situations like this:
21177 template <typename T> struct A {
21178 typename T::template X<int>::I i;
21179 };
21181 are problematic. Is `T::template X<int>' a class-name? The
21182 standard does not seem to be definitive, but there is no other
21183 valid interpretation of the following `::'. Therefore, those
21184 names are considered class-names. */
21185 {
21189 }
21194 /* In Objective-C 2.0, a classname followed by '.' starts a
21195 dot-syntax expression, and it's not a type-name. */
21207 }
21209 /* Parse a class-specifier.
21211 class-specifier:
21212 class-head { member-specification [opt] }
21214 Returns the TREE_TYPE representing the class. */
21216 static tree
21218 {
21219 tree type;
21233 /* Parse the class-head. */
21236 /* If the class-head was a semantic disaster, skip the entire body
21237 of the class. */
21239 {
21243 }
21245 /* Look for the `{'. */
21247 {
21250 }
21255 /* Issue an error message if type-definitions are forbidden here. */
21257 /* Remember that we are defining one more class. */
21259 /* Inside the class, surrounding template-parameter-lists do not
21260 apply. */
21261 saved_num_template_parameter_lists
21264 /* We are not in a function body. */
21267 /* Or in a loop. */
21270 /* Or in a switch. */
21273 /* We are not immediately inside an extern "lang" block. */
21274 saved_in_unbraced_linkage_specification_p
21278 // Associate constraints with the type.
21282 /* Start the class. */
21284 {
21287 }
21291 /* If the type is erroneous, skip the entire body of the class. */
21293 else
21294 /* Parse the member-specification. */
21297 /* Look for the trailing `}'. */
21299 /* Look for trailing attributes to apply to this class. */
21307 /* We've finished a type definition. Check for the common syntax
21308 error of forgetting a semicolon after the definition. We need to
21309 be careful, as we can't just check for not-a-semicolon and be done
21310 with it; the user might have typed:
21312 class X { } c = ...;
21313 class X { } *p = ...;
21315 and so forth. Instead, enumerate all the possible tokens that
21316 might follow this production; if we don't see one of them, then
21317 complain and silently insert the semicolon. */
21318 {
21323 /* Don't try to parse c++11 attributes here. As per the
21324 grammar, that should be a task for
21325 cp_parser_decl_specifier_seq. */
21329 {
21340 /* While it's legal for type qualifiers and storage class
21341 specifiers to follow type definitions in the grammar, only
21342 compiler testsuites contain code like that. Assume that if
21343 we see such code, then what we're really seeing is a case
21344 like:
21346 class X { }
21347 const <type> var = ...;
21349 or
21351 class Y { }
21352 static <type> func (...) ...
21354 i.e. the qualifier or specifier applies to the next
21355 declaration. To do so, however, we need to look ahead one
21356 more token to see if *that* token is a type specifier.
21358 This code could be improved to handle:
21360 class Z { }
21361 static const <type> var = ...; */
21364 {
21367 /* Handling user-defined types here would be nice, but very
21368 tricky. */
21369 want_semicolon
21372 }
21376 }
21378 /* If we don't have a type, then something is very wrong and we
21379 shouldn't try to do anything clever. Likewise for not seeing the
21380 closing brace. */
21382 {
21383 cp_token_position prev
21394 else
21397 /* Unget one token and smash it to look as though we encountered
21398 a semicolon in the input stream. */
21403 }
21404 }
21406 /* If this class is not itself within the scope of another class,
21407 then we need to parse the bodies of all of the queued function
21408 definitions. Note that the queued functions defined in a class
21409 are not always processed immediately following the
21410 class-specifier for that class. Consider:
21412 struct A {
21413 struct B { void f() { sizeof (A); } };
21414 };
21416 If `f' were processed before the processing of `A' were
21417 completed, there would be no way to compute the size of `A'.
21418 Note that the nesting we are interested in here is lexical --
21419 not the semantic nesting given by TYPE_CONTEXT. In particular,
21420 for:
21422 struct A { struct B; };
21423 struct A::B { void f() { } };
21425 there is no need to delay the parsing of `A::B::f'. */
21427 {
21428 tree decl;
21435 /* In a first pass, parse default arguments to the functions.
21436 Then, in a second pass, parse the bodies of the functions.
21437 This two-phased approach handles cases like:
21439 struct S {
21440 void f() { g(); }
21441 void g(int i = 3);
21442 };
21444 */
21446 {
21448 /* If there are default arguments that have not yet been processed,
21449 take care of them now. */
21451 {
21456 }
21457 /* Make sure that any template parameters are in scope. */
21459 /* Parse the default argument expressions. */
21461 /* Remove any template parameters from the symbol table. */
21463 }
21465 /* Now parse any NSDMIs. */
21469 {
21471 {
21476 }
21479 }
21486 /* Now do some post-NSDMI bookkeeping. */
21492 /* Now parse the body of the functions. */
21494 {
21495 /* OpenMP UDRs need to be parsed before all other functions. */
21502 }
21503 else
21507 }
21508 else
21511 /* Put back any saved access checks. */
21514 /* Restore saved state. */
21518 parser->num_template_parameter_lists
21520 parser->in_unbraced_linkage_specification_p
21524 }
21526 static tree
21528 {
21529 tree ret;
21534 }
21536 /* Parse a class-head.
21538 class-head:
21539 class-key identifier [opt] base-clause [opt]
21540 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21541 class-key nested-name-specifier [opt] template-id
21542 base-clause [opt]
21544 class-virt-specifier:
21545 final
21547 GNU Extensions:
21548 class-key attributes identifier [opt] base-clause [opt]
21549 class-key attributes nested-name-specifier identifier base-clause [opt]
21550 class-key attributes nested-name-specifier [opt] template-id
21551 base-clause [opt]
21553 Upon return BASES is initialized to the list of base classes (or
21554 NULL, if there are none) in the same form returned by
21555 cp_parser_base_clause.
21557 Returns the TYPE of the indicated class. Sets
21558 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21559 involving a nested-name-specifier was used, and FALSE otherwise.
21561 Returns error_mark_node if this is not a class-head.
21563 Returns NULL_TREE if the class-head is syntactically valid, but
21564 semantically invalid in a way that means we should skip the entire
21565 body of the class. */
21567 static tree
21570 {
21571 tree nested_name_specifier;
21575 tree attributes;
21576 tree bases;
21586 /* Assume no nested-name-specifier will be present. */
21588 /* Assume no template parameter lists will be used in defining the
21589 type. */
21593 /* Look for the class-key. */
21598 /* Parse the attributes. */
21601 /* If the next token is `::', that is invalid -- but sometimes
21602 people do try to write:
21604 struct ::S {};
21606 Handle this gracefully by accepting the extra qualifier, and then
21607 issuing an error about it later if this really is a
21608 class-head. If it turns out just to be an elaborated type
21609 specifier, remain silent. */
21615 /* Determine the name of the class. Begin by looking for an
21616 optional nested-name-specifier. */
21618 nested_name_specifier
21624 /* If there was a nested-name-specifier, then there *must* be an
21625 identifier. */
21627 {
21629 /* Although the grammar says `identifier', it really means
21630 `class-name' or `template-name'. You are only allowed to
21631 define a class that has already been declared with this
21632 syntax.
21634 The proposed resolution for Core Issue 180 says that wherever
21635 you see `class T::X' you should treat `X' as a type-name.
21637 It is OK to define an inaccessible class; for example:
21639 class A { class B; };
21640 class A::B {};
21642 We do not know if we will see a class-name, or a
21643 template-name. We look for a class-name first, in case the
21644 class-name is a template-id; if we looked for the
21645 template-name first we would stop after the template-name. */
21650 class_type,
21654 /* If that didn't work, ignore the nested-name-specifier. */
21656 {
21662 }
21663 /* If we could not find a corresponding TYPE, treat this
21664 declaration like an unqualified declaration. */
21667 /* Otherwise, count the number of templates used in TYPE and its
21668 containing scopes. */
21669 else
21670 {
21671 tree scope;
21683 }
21684 }
21685 /* Otherwise, the identifier is optional. */
21686 else
21687 {
21688 /* We don't know whether what comes next is a template-id,
21689 an identifier, or nothing at all. */
21691 /* Check for a template-id. */
21696 class_key,
21698 /* If that didn't work, it could still be an identifier. */
21700 {
21702 {
21705 }
21706 else
21708 }
21709 else
21710 {
21713 }
21714 }
21719 {
21721 class_key,
21723 }
21726 /* If it's not a `:' or a `{' then we can't really be looking at a
21727 class-head, since a class-head only appears as part of a
21728 class-specifier. We have to detect this situation before calling
21729 xref_tag, since that has irreversible side-effects. */
21731 {
21735 }
21737 /* At this point, we're going ahead with the class-specifier, even
21738 if some other problem occurs. */
21741 {
21746 }
21747 /* Issue the error about the overly-qualified name now. */
21749 {
21754 }
21756 {
21761 }
21763 {
21764 tree scope;
21766 /* Reject typedef-names in class heads. */
21768 {
21771 type);
21774 }
21776 /* Figure out in what scope the declaration is being placed. */
21778 /* If that scope does not contain the scope in which the
21779 class was originally declared, the program is invalid. */
21781 {
21784 "declaration of %qD in namespace %qD which does not "
21787 else
21793 }
21794 /* [dcl.meaning]
21796 A declarator-id shall not be qualified except for the
21797 definition of a ... nested class outside of its class
21798 ... [or] the definition or explicit instantiation of a
21799 class member of a namespace outside of its namespace. */
21801 {
21806 }
21807 }
21808 /* An explicit-specialization must be preceded by "template <>". If
21809 it is not, try to recover gracefully. */
21813 {
21817 /* Take the same action that would have been taken by
21818 cp_parser_explicit_specialization. */
21821 }
21822 /* There must be no "return" statements between this point and the
21823 end of this function; set "type "to the correct return value and
21824 use "goto done;" to return. */
21825 /* Make sure that the right number of template parameters were
21826 present. */
21830 {
21831 /* If something went wrong, there is no point in even trying to
21832 process the class-definition. */
21835 }
21837 /* Look up the type. */
21839 {
21843 {
21847 }
21848 else
21849 {
21852 }
21855 }
21857 {
21858 tree class_type;
21860 /* Given:
21862 template <typename T> struct S { struct T };
21863 template <typename T> struct S<T>::T { };
21865 we will get a TYPENAME_TYPE when processing the definition of
21866 `S::T'. We need to resolve it to the actual type before we
21867 try to define it. */
21869 {
21874 else
21875 {
21878 }
21879 }
21883 {
21886 }
21889 /* Enter the scope indicated by the nested-name-specifier. */
21891 /* Get the canonical version of this type. */
21893 /* Call push_template_decl if it seems like we should be defining a
21894 template either from the template headers or the type we're
21895 defining, so that we diagnose both extra and missing headers. */
21899 {
21902 {
21905 }
21906 }
21910 }
21912 {
21913 /* If the class was unnamed, create a dummy name. */
21918 }
21920 /* Indicate whether this class was declared as a `class' or as a
21921 `struct'. */
21926 /* If this type was already complete, and we see another definition,
21927 that's an error. */
21929 {
21931 type);
21933 type);
21936 }
21941 {
21942 /* Apply attributes now, before any use of the class as a template
21943 argument in its base list. */
21946 }
21948 /* We will have entered the scope containing the class; the names of
21949 base classes should be looked up in that context. For example:
21951 struct A { struct B {}; struct C; };
21952 struct A::C : B {};
21954 is valid. */
21956 /* Get the list of base-classes, if there is one. */
21958 {
21959 /* PR59482: enter the class scope so that base-specifiers are looked
21960 up correctly. */
21964 /* PR59482: get out of the previously pushed class scope so that the
21965 subsequent pops pop the right thing. */
21968 }
21969 else
21972 /* If we're really defining a class, process the base classes.
21973 If they're invalid, fail. */
21978 done:
21979 /* Leave the scope given by the nested-name-specifier. We will
21980 enter the class scope itself while processing the members. */
21985 {
21988 }
21994 out:
21997 }
21999 /* Parse a class-key.
22001 class-key:
22002 class
22003 struct
22004 union
22006 Returns the kind of class-key specified, or none_type to indicate
22007 error. */
22009 static enum tag_types
22011 {
22015 /* Look for the class-key. */
22020 /* Check to see if the TOKEN is a class-key. */
22025 }
22027 /* Parse a type-parameter-key.
22029 type-parameter-key:
22030 class
22031 typename
22032 */
22034 static void
22036 {
22037 /* Look for the type-parameter-key. */
22041 {
22044 /* typename is not allowed in a template template parameter
22045 by the standard until C++1Z. */
22047 "ISO C++ forbids typename key in template template parameter;"
22049 }
22050 else
22054 }
22056 /* Parse an (optional) member-specification.
22058 member-specification:
22059 member-declaration member-specification [opt]
22060 access-specifier : member-specification [opt] */
22062 static void
22064 {
22066 {
22070 /* Peek at the next token. */
22072 /* If it's a `}', or EOF then we've seen all the members. */
22078 /* See if this token is a keyword. */
22081 {
22085 /* Consume the access-specifier. */
22087 /* Remember which access-specifier is active. */
22089 /* Look for the `:'. */
22094 /* Accept #pragmas at class scope. */
22096 {
22099 }
22101 /* Otherwise, the next construction must be a
22102 member-declaration. */
22104 }
22105 }
22106 }
22108 /* Parse a member-declaration.
22110 member-declaration:
22111 decl-specifier-seq [opt] member-declarator-list [opt] ;
22112 function-definition ; [opt]
22113 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22114 using-declaration
22115 template-declaration
22116 alias-declaration
22118 member-declarator-list:
22119 member-declarator
22120 member-declarator-list , member-declarator
22122 member-declarator:
22123 declarator pure-specifier [opt]
22124 declarator constant-initializer [opt]
22125 identifier [opt] : constant-expression
22127 GNU Extensions:
22129 member-declaration:
22130 __extension__ member-declaration
22132 member-declarator:
22133 declarator attributes [opt] pure-specifier [opt]
22134 declarator attributes [opt] constant-initializer [opt]
22135 identifier [opt] attributes [opt] : constant-expression
22137 C++0x Extensions:
22139 member-declaration:
22140 static_assert-declaration */
22142 static void
22144 {
22145 cp_decl_specifier_seq decl_specifiers;
22146 tree prefix_attributes;
22147 tree decl;
22156 /* Check for the `__extension__' keyword. */
22158 {
22159 /* Recurse. */
22161 /* Restore the old value of the PEDANTIC flag. */
22165 }
22167 /* Check for a template-declaration. */
22169 {
22170 /* An explicit specialization here is an error condition, and we
22171 expect the specialization handler to detect and report this. */
22175 else
22179 }
22180 /* Check for a template introduction. */
22184 /* Check for a using-declaration. */
22186 {
22188 {
22189 /* Parse the using-declaration. */
22193 }
22194 else
22195 {
22196 tree decl;
22200 /* Note that if we actually see the '=' token after the
22201 identifier, cp_parser_alias_declaration commits the
22202 tentative parse. In that case, we really expect an
22203 alias-declaration. Otherwise, we expect a using
22204 declaration. */
22205 alias_decl_expected =
22211 else
22215 }
22216 }
22218 /* Check for @defs. */
22220 {
22225 {
22230 }
22232 }
22234 /* If the next token is `static_assert' we have a static assertion. */
22236 {
22239 }
22246 /* Parse the decl-specifier-seq. */
22249 CP_PARSER_FLAGS_OPTIONAL,
22252 /* Check for an invalid type-name. */
22256 /* If there is no declarator, then the decl-specifier-seq should
22257 specify a type. */
22259 {
22260 /* If there was no decl-specifier-seq, and the next token is a
22261 `;', then we have something like:
22263 struct S { ; };
22265 [class.mem]
22267 Each member-declaration shall declare at least one member
22268 name of the class. */
22270 {
22274 }
22275 else
22276 {
22277 tree type;
22279 /* See if this declaration is a friend. */
22281 /* If there were decl-specifiers, check to see if there was
22282 a class-declaration. */
22285 /* Nested classes have already been added to the class, but
22286 a `friend' needs to be explicitly registered. */
22288 {
22289 /* If the `friend' keyword was present, the friend must
22290 be introduced with a class-key. */
22293 "in C++03 a class-key must be used "
22295 /* In this case:
22297 template <typename T> struct A {
22298 friend struct A<T>::B;
22299 };
22301 A<T>::B will be represented by a TYPENAME_TYPE, and
22302 therefore not recognized by check_tag_decl. */
22304 {
22308 }
22311 "friend declaration does not name a class or "
22313 else
22316 }
22317 /* If there is no TYPE, an error message will already have
22318 been issued. */
22320 ;
22321 /* An anonymous aggregate has to be handled specially; such
22322 a declaration really declares a data member (with a
22323 particular type), as opposed to a nested class. */
22325 {
22326 /* C++11 9.5/6. */
22329 "a storage class on an anonymous aggregate "
22332 /* Remove constructors and such from TYPE, now that we
22333 know it is an anonymous aggregate. */
22335 /* And make the corresponding data member. */
22338 /* Add it to the class. */
22340 }
22341 else
22342 cp_parser_check_access_in_redeclaration
22345 }
22346 }
22347 else
22348 {
22351 /* Clear attributes from the decl_specifiers but keep them
22352 around as prefix attributes that apply them to the entity
22353 being declared. */
22357 /* See if these declarations will be friends. */
22360 /* Keep going until we hit the `;' at the end of the
22361 declaration. */
22363 {
22365 tree first_attribute;
22367 /* Peek at the next token. */
22370 /* Check for a bitfield declaration. */
22375 {
22376 tree identifier;
22377 tree width;
22379 /* Get the name of the bitfield. Note that we cannot just
22380 check TOKEN here because it may have been invalidated by
22381 the call to cp_lexer_peek_nth_token above. */
22384 else
22387 /* Consume the `:' token. */
22389 /* Get the width of the bitfield. */
22390 width
22393 /* Look for attributes that apply to the bitfield. */
22395 /* Remember which attributes are prefix attributes and
22396 which are not. */
22398 /* Combine the attributes. */
22401 /* Create the bitfield declaration. */
22404 identifier,
22405 sfk_none)
22408 width,
22409 attributes);
22410 }
22411 else
22412 {
22414 tree initializer;
22415 tree asm_specification;
22418 /* Parse the declarator. */
22419 declarator
22424 friend_p);
22426 /* If something went wrong parsing the declarator, make sure
22427 that we at least consume some tokens. */
22429 {
22430 /* Skip to the end of the statement. */
22432 /* If the next token is not a semicolon, that is
22433 probably because we just skipped over the body of
22434 a function. So, we consume a semicolon if
22435 present, but do not issue an error message if it
22436 is not present. */
22438 CPP_SEMICOLON))
22441 }
22444 cp_parser_check_for_definition_in_return_type
22448 /* Look for an asm-specification. */
22450 /* Look for attributes that apply to the declaration. */
22452 /* Remember which attributes are prefix attributes and
22453 which are not. */
22455 /* Combine the attributes. */
22458 /* If it's an `=', then we have a constant-initializer or a
22459 pure-specifier. It is not correct to parse the
22460 initializer before registering the member declaration
22461 since the member declaration should be in scope while
22462 its initializer is processed. However, the rest of the
22463 front end does not yet provide an interface that allows
22464 us to handle this correctly. */
22466 {
22467 /* In [class.mem]:
22469 A pure-specifier shall be used only in the declaration of
22470 a virtual function.
22472 A member-declarator can contain a constant-initializer
22473 only if it declares a static member of integral or
22474 enumeration type.
22476 Therefore, if the DECLARATOR is for a function, we look
22477 for a pure-specifier; otherwise, we look for a
22478 constant-initializer. When we call `grokfield', it will
22479 perform more stringent semantics checks. */
22491 {
22493 /* Don't require a constant rvalue in C++11, since we
22494 might want a reference constant. We'll enforce
22495 constancy later. */
22497 /* Parse the initializer. */
22500 }
22501 else
22502 /* Parse the initializer. */
22504 }
22507 {
22511 else
22513 }
22514 /* Otherwise, there is no initializer. */
22515 else
22518 /* See if we are probably looking at a function
22519 definition. We are certainly not looking at a
22520 member-declarator. Calling `grokfield' has
22521 side-effects, so we must not do it unless we are sure
22522 that we are looking at a member-declarator. */
22525 {
22526 /* The grammar does not allow a pure-specifier to be
22527 used when a member function is defined. (It is
22528 possible that this fact is an oversight in the
22529 standard, since a pure function may be defined
22530 outside of the class-specifier. */
22536 declarator,
22537 attributes);
22540 /* If the member was not a friend, declare it here. */
22543 /* Peek at the next token. */
22545 /* If the next token is a semicolon, consume it. */
22549 }
22550 else
22553 /* Create the declaration. */
22558 {
22561 else
22563 }
22564 }
22569 /* Reset PREFIX_ATTRIBUTES. */
22575 /* If there is any qualification still in effect, clear it
22576 now; we will be starting fresh with the next declarator. */
22580 /* If it's a `,', then there are more declarators. */
22582 {
22585 {
22589 }
22590 }
22591 /* If the next token isn't a `;', then we have a parse error. */
22593 CPP_SEMICOLON))
22594 {
22595 /* The next token might be a ways away from where the
22596 actual semicolon is missing. Find the previous token
22597 and use that for our error position. */
22602 /* Assume that the user meant to provide a semicolon. If
22603 we were to cp_parser_skip_to_end_of_statement, we might
22604 skip to a semicolon inside a member function definition
22605 and issue nonsensical error messages. */
22607 }
22610 {
22611 /* Add DECL to the list of members. */
22613 /* Explicitly include, eg, NSDMIs, for better error
22614 recovery (c++/58650). */
22623 /* Add DECL to the queue of NSDMI to be parsed later. */
22625 }
22629 }
22630 }
22633 out:
22635 }
22637 /* Parse a pure-specifier.
22639 pure-specifier:
22640 = 0
22642 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22643 Otherwise, ERROR_MARK_NODE is returned. */
22645 static tree
22647 {
22650 /* Look for the `=' token. */
22653 /* Look for the `0' token. */
22662 /* Accept = default or = delete in c++0x mode. */
22665 {
22668 }
22670 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22672 {
22677 }
22679 {
22682 }
22685 }
22687 /* Parse a constant-initializer.
22689 constant-initializer:
22690 = constant-expression
22692 Returns a representation of the constant-expression. */
22694 static tree
22696 {
22697 /* Look for the `=' token. */
22701 /* It is invalid to write:
22703 struct S { static const int i = { 7 }; };
22705 */
22707 {
22710 /* Consume the opening brace. */
22712 /* Skip the initializer. */
22714 /* Look for the trailing `}'. */
22718 }
22721 }
22723 /* Derived classes [gram.class.derived] */
22725 /* Parse a base-clause.
22727 base-clause:
22728 : base-specifier-list
22730 base-specifier-list:
22731 base-specifier ... [opt]
22732 base-specifier-list , base-specifier ... [opt]
22734 Returns a TREE_LIST representing the base-classes, in the order in
22735 which they were declared. The representation of each node is as
22736 described by cp_parser_base_specifier.
22738 In the case that no bases are specified, this function will return
22739 NULL_TREE, not ERROR_MARK_NODE. */
22741 static tree
22743 {
22746 /* Look for the `:' that begins the list. */
22749 /* Scan the base-specifier-list. */
22751 {
22753 tree base;
22756 /* Look for the base-specifier. */
22758 /* Look for the (optional) ellipsis. */
22760 {
22761 /* Consume the `...'. */
22765 }
22767 /* Add BASE to the front of the list. */
22769 {
22771 /* Make this a pack expansion type. */
22775 {
22778 }
22779 }
22780 /* Peek at the next token. */
22782 /* If it's not a comma, then the list is complete. */
22785 /* Consume the `,'. */
22787 }
22789 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22790 base class had a qualified name. However, the next name that
22791 appears is certainly not qualified. */
22797 }
22799 /* Parse a base-specifier.
22801 base-specifier:
22802 :: [opt] nested-name-specifier [opt] class-name
22803 virtual access-specifier [opt] :: [opt] nested-name-specifier
22804 [opt] class-name
22805 access-specifier virtual [opt] :: [opt] nested-name-specifier
22806 [opt] class-name
22808 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22809 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22810 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22811 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22813 static tree
22815 {
22823 tree type;
22825 /* Process the optional `virtual' and `access-specifier'. */
22827 {
22828 /* Peek at the next token. */
22830 /* Process `virtual'. */
22832 {
22834 /* If `virtual' appears more than once, issue an error. */
22836 {
22840 }
22844 /* Consume the `virtual' token. */
22852 /* If more than one access specifier appears, issue an
22853 error. */
22856 {
22860 }
22864 /* Consume the access-specifier. */
22872 }
22873 }
22874 /* It is not uncommon to see programs mechanically, erroneously, use
22875 the 'typename' keyword to denote (dependent) qualified types
22876 as base classes. */
22878 {
22883 else
22885 "keyword %<typename%> not allowed in this context "
22888 }
22890 /* Look for the optional `::' operator. */
22892 /* Look for the nested-name-specifier. The simplest way to
22893 implement:
22895 [temp.res]
22897 The keyword `typename' is not permitted in a base-specifier or
22898 mem-initializer; in these contexts a qualified name that
22899 depends on a template-parameter is implicitly assumed to be a
22900 type name.
22902 is to pretend that we have seen the `typename' keyword at this
22903 point. */
22907 typename_type,
22909 /* If the base class is given by a qualified name, assume that names
22910 we see are type names or templates, as appropriate. */
22916 /* DR 950 allows decltype as a base-specifier. */
22918 else
22919 {
22920 /* Otherwise, look for the class-name. */
22922 class_scope_p,
22923 template_p,
22924 typename_type,
22929 }
22935 }
22937 /* Exception handling [gram.exception] */
22939 /* Parse an (optional) noexcept-specification.
22941 noexcept-specification:
22942 noexcept ( constant-expression ) [opt]
22944 If no noexcept-specification is present, returns NULL_TREE.
22945 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
22946 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
22947 there are no parentheses. CONSUMED_EXPR will be set accordingly.
22948 Otherwise, returns a noexcept specification unless RETURN_COND is true,
22949 in which case a boolean condition is returned instead. */
22951 static tree
22956 {
22960 /* Peek at the next token. */
22963 /* Is it a noexcept-specification? */
22965 {
22966 tree expr;
22970 {
22974 {
22975 /* Types may not be defined in an exception-specification. */
22977 parser->type_definition_forbidden_message
22982 /* Restore the saved message. */
22984 }
22985 else
22986 {
22989 }
22992 }
22993 else
22994 {
22998 }
23000 /* We cannot build a noexcept-spec right away because this will check
23001 that expr is a constexpr. */
23004 else
23006 }
23007 else
23009 }
23011 /* Parse an (optional) exception-specification.
23013 exception-specification:
23014 throw ( type-id-list [opt] )
23016 Returns a TREE_LIST representing the exception-specification. The
23017 TREE_VALUE of each node is a type. */
23019 static tree
23021 {
23023 tree type_id_list;
23026 /* Peek at the next token. */
23029 /* Is it a noexcept-specification? */
23035 /* If it's not `throw', then there's no exception-specification. */
23039 #if 0
23040 /* Enable this once a lot of code has transitioned to noexcept? */
23044 #endif
23046 /* Consume the `throw'. */
23049 /* Look for the `('. */
23052 /* Peek at the next token. */
23054 /* If it's not a `)', then there is a type-id-list. */
23056 {
23057 /* Types may not be defined in an exception-specification. */
23059 parser->type_definition_forbidden_message
23061 /* Parse the type-id-list. */
23063 /* Restore the saved message. */
23065 }
23066 else
23069 /* Look for the `)'. */
23073 }
23075 /* Parse an (optional) type-id-list.
23077 type-id-list:
23078 type-id ... [opt]
23079 type-id-list , type-id ... [opt]
23081 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23082 in the order that the types were presented. */
23084 static tree
23086 {
23090 {
23092 tree type;
23096 /* Get the next type-id. */
23098 /* Check for invalid 'auto'. */
23100 {
23104 }
23105 /* Parse the optional ellipsis. */
23107 {
23108 /* Consume the `...'. */
23111 /* Turn the type into a pack expansion expression. */
23113 }
23114 /* Add it to the list. */
23116 /* Peek at the next token. */
23118 /* If it is not a `,', we are done. */
23121 /* Consume the `,'. */
23123 }
23126 }
23128 /* Parse a try-block.
23130 try-block:
23131 try compound-statement handler-seq */
23133 static tree
23135 {
23136 tree try_block;
23150 }
23152 /* Parse a function-try-block.
23154 function-try-block:
23155 try ctor-initializer [opt] function-body handler-seq */
23157 static bool
23159 {
23160 tree compound_stmt;
23161 tree try_block;
23164 /* Look for the `try' keyword. */
23167 /* Let the rest of the front end know where we are. */
23169 /* Parse the function-body. */
23170 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23172 /* We're done with the `try' part. */
23174 /* Parse the handlers. */
23176 /* We're done with the handlers. */
23180 }
23182 /* Parse a handler-seq.
23184 handler-seq:
23185 handler handler-seq [opt] */
23187 static void
23189 {
23191 {
23194 /* Parse the handler. */
23196 /* Peek at the next token. */
23198 /* If it's not `catch' then there are no more handlers. */
23201 }
23202 }
23204 /* Parse a handler.
23206 handler:
23207 catch ( exception-declaration ) compound-statement */
23209 static void
23211 {
23212 tree handler;
23213 tree declaration;
23223 }
23225 /* Parse an exception-declaration.
23227 exception-declaration:
23228 type-specifier-seq declarator
23229 type-specifier-seq abstract-declarator
23230 type-specifier-seq
23231 ...
23233 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23234 ellipsis variant is used. */
23236 static tree
23238 {
23239 cp_decl_specifier_seq type_specifiers;
23243 /* If it's an ellipsis, it's easy to handle. */
23245 {
23246 /* Consume the `...' token. */
23249 }
23251 /* Types may not be defined in exception-declarations. */
23253 parser->type_definition_forbidden_message
23256 /* Parse the type-specifier-seq. */
23260 /* If it's a `)', then there is no declarator. */
23263 else
23270 /* Restore the saved message. */
23277 }
23279 /* Parse a throw-expression.
23281 throw-expression:
23282 throw assignment-expression [opt]
23284 Returns a THROW_EXPR representing the throw-expression. */
23286 static tree
23288 {
23289 tree expression;
23294 /* Figure out whether or not there is an assignment-expression
23295 following the "throw" keyword. */
23303 else
23307 }
23309 /* GNU Extensions */
23311 /* Parse an (optional) asm-specification.
23313 asm-specification:
23314 asm ( string-literal )
23316 If the asm-specification is present, returns a STRING_CST
23317 corresponding to the string-literal. Otherwise, returns
23318 NULL_TREE. */
23320 static tree
23322 {
23324 tree asm_specification;
23326 /* Peek at the next token. */
23328 /* If the next token isn't the `asm' keyword, then there's no
23329 asm-specification. */
23333 /* Consume the `asm' token. */
23335 /* Look for the `('. */
23338 /* Look for the string-literal. */
23341 /* Look for the `)'. */
23345 }
23347 /* Parse an asm-operand-list.
23349 asm-operand-list:
23350 asm-operand
23351 asm-operand-list , asm-operand
23353 asm-operand:
23354 string-literal ( expression )
23355 [ string-literal ] string-literal ( expression )
23357 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23358 each node is the expression. The TREE_PURPOSE is itself a
23359 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23360 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23361 is a STRING_CST for the string literal before the parenthesis. Returns
23362 ERROR_MARK_NODE if any of the operands are invalid. */
23364 static tree
23366 {
23371 {
23372 tree string_literal;
23373 tree expression;
23374 tree name;
23377 {
23378 /* Consume the `[' token. */
23380 /* Read the operand name. */
23385 /* Look for the closing `]'. */
23387 }
23388 else
23390 /* Look for the string-literal. */
23393 /* Look for the `('. */
23395 /* Parse the expression. */
23397 /* Look for the `)'. */
23405 /* Add this operand to the list. */
23407 expression,
23408 asm_operands);
23409 /* If the next token is not a `,', there are no more
23410 operands. */
23413 /* Consume the `,'. */
23415 }
23418 }
23420 /* Parse an asm-clobber-list.
23422 asm-clobber-list:
23423 string-literal
23424 asm-clobber-list , string-literal
23426 Returns a TREE_LIST, indicating the clobbers in the order that they
23427 appeared. The TREE_VALUE of each node is a STRING_CST. */
23429 static tree
23431 {
23435 {
23436 tree string_literal;
23438 /* Look for the string literal. */
23440 /* Add it to the list. */
23442 /* If the next token is not a `,', then the list is
23443 complete. */
23446 /* Consume the `,' token. */
23448 }
23451 }
23453 /* Parse an asm-label-list.
23455 asm-label-list:
23456 identifier
23457 asm-label-list , identifier
23459 Returns a TREE_LIST, indicating the labels in the order that they
23460 appeared. The TREE_VALUE of each node is a label. */
23462 static tree
23464 {
23468 {
23471 /* Look for the identifier. */
23474 {
23477 {
23483 }
23484 }
23485 /* If the next token is not a `,', then the list is
23486 complete. */
23489 /* Consume the `,' token. */
23491 }
23494 }
23496 /* Return TRUE iff the next tokens in the stream are possibly the
23497 beginning of a GNU extension attribute. */
23499 static bool
23501 {
23503 }
23505 /* Return TRUE iff the next tokens in the stream are possibly the
23506 beginning of a standard C++-11 attribute specifier. */
23508 static bool
23510 {
23512 }
23514 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23515 beginning of a standard C++-11 attribute specifier. */
23517 static bool
23519 {
23527 }
23529 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23530 beginning of a GNU extension attribute. */
23532 static bool
23534 {
23538 }
23540 /* Return true iff the next tokens can be the beginning of either a
23541 GNU attribute list, or a standard C++11 attribute sequence. */
23543 static bool
23545 {
23548 }
23550 /* Return true iff the next Nth tokens can be the beginning of either
23551 a GNU attribute list, or a standard C++11 attribute sequence. */
23553 static bool
23555 {
23558 }
23560 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23561 of GNU attributes, or return NULL. */
23563 static tree
23565 {
23569 }
23571 #define CILK_SIMD_FN_CLAUSE_MASK \
23572 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23573 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23574 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23575 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23576 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23578 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23579 vector [(<clauses>)] */
23581 static void
23583 {
23587 {
23592 }
23595 {
23598 paren_scope++;
23599 }
23601 {
23604 paren_scope++;
23606 paren_scope--;
23607 /* Do not push the last ')' */
23610 }
23619 }
23621 /* Parse an (optional) series of attributes.
23623 attributes:
23624 attributes attribute
23626 attribute:
23627 __attribute__ (( attribute-list [opt] ))
23629 The return value is as for cp_parser_gnu_attribute_list. */
23631 static tree
23633 {
23637 {
23639 tree attribute_list;
23642 /* Peek at the next token. */
23644 /* If it's not `__attribute__', then we're done. */
23648 /* Consume the `__attribute__' keyword. */
23650 /* Look for the two `(' tokens. */
23654 /* Peek at the next token. */
23657 /* Parse the attribute-list. */
23659 else
23660 /* If the next token is a `)', then there is no attribute
23661 list. */
23664 /* Look for the two `)' tokens. */
23672 /* Add these new attributes to the list. */
23674 }
23677 }
23679 /* Parse a GNU attribute-list.
23681 attribute-list:
23682 attribute
23683 attribute-list , attribute
23685 attribute:
23686 identifier
23687 identifier ( identifier )
23688 identifier ( identifier , expression-list )
23689 identifier ( expression-list )
23691 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23692 to an attribute. The TREE_PURPOSE of each node is the identifier
23693 indicating which attribute is in use. The TREE_VALUE represents
23694 the arguments, if any. */
23696 static tree
23698 {
23704 {
23706 tree identifier;
23707 tree attribute;
23709 /* Look for the identifier. We also allow keywords here; for
23710 example `__attribute__ ((const))' is legal. */
23714 {
23717 /* Consume the token, but save it since we need it for the
23718 SIMD enabled function parsing. */
23721 /* Save away the identifier that indicates which attribute
23722 this is. */
23724 /* For keywords, use the canonical spelling, not the
23725 parsed identifier. */
23731 /* Peek at the next token. */
23733 /* If it's an `(', then parse the attribute arguments. */
23735 {
23740 {
23743 }
23744 else
23745 vec = cp_parser_parenthesized_expression_list
23751 else
23752 {
23755 }
23756 /* Save the arguments away. */
23758 }
23760 {
23763 }
23766 {
23767 /* Add this attribute to the list. */
23770 }
23773 }
23774 /* Now, look for more attributes. If the next token isn't a
23775 `,', we're done. */
23779 /* Consume the comma and keep going. */
23781 }
23784 /* We built up the list in reverse order. */
23786 }
23788 /* Parse a standard C++11 attribute.
23790 The returned representation is a TREE_LIST which TREE_PURPOSE is
23791 the scoped name of the attribute, and the TREE_VALUE is its
23792 arguments list.
23794 Note that the scoped name of the attribute is itself a TREE_LIST
23795 which TREE_PURPOSE is the namespace of the attribute, and
23796 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23797 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23798 and which TREE_PURPOSE is directly the attribute name.
23800 Clients of the attribute code should use get_attribute_namespace
23801 and get_attribute_name to get the actual namespace and name of
23802 attributes, regardless of their being GNU or C++11 attributes.
23804 attribute:
23805 attribute-token attribute-argument-clause [opt]
23807 attribute-token:
23808 identifier
23809 attribute-scoped-token
23811 attribute-scoped-token:
23812 attribute-namespace :: identifier
23814 attribute-namespace:
23815 identifier
23817 attribute-argument-clause:
23818 ( balanced-token-seq )
23820 balanced-token-seq:
23821 balanced-token [opt]
23822 balanced-token-seq balanced-token
23824 balanced-token:
23825 ( balanced-token-seq )
23826 [ balanced-token-seq ]
23827 { balanced-token-seq }. */
23829 static tree
23831 {
23835 /* First, parse name of the attribute, a.k.a attribute-token. */
23852 {
23853 /* We are seeing a scoped attribute token. */
23863 else
23864 {
23868 }
23870 NULL_TREE);
23872 }
23873 else
23874 {
23876 NULL_TREE);
23877 /* C++11 noreturn attribute is equivalent to GNU's. */
23880 /* C++14 deprecated attribute is equivalent to GNU's. */
23882 {
23885 "%<deprecated%> is a C++14 feature;"
23888 }
23889 /* Transactional Memory TS optimize_for_synchronized attribute is
23890 equivalent to GNU transaction_callable. */
23894 /* Transactional Memory attributes are GNU attributes. */
23897 }
23899 /* Now parse the optional argument clause of the attribute. */
23904 {
23910 /* A GNU attribute that takes an identifier in parameter. */
23913 vec = cp_parser_parenthesized_expression_list
23919 else
23920 {
23923 }
23927 else
23929 }
23932 }
23934 /* Check that the attribute ATTRIBUTE appears at most once in the
23935 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
23936 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
23937 isn't implemented yet in GCC. */
23939 static void
23941 {
23943 {
23953 }
23954 }
23956 /* Parse a list of standard C++-11 attributes.
23958 attribute-list:
23959 attribute [opt]
23960 attribute-list , attribute[opt]
23961 attribute ...
23962 attribute-list , attribute ...
23963 */
23965 static tree
23967 {
23972 {
23977 {
23981 }
23984 {
23989 }
23993 }
23996 }
23998 /* Parse a standard C++-11 attribute specifier.
24000 attribute-specifier:
24001 [ [ attribute-list ] ]
24002 alignment-specifier
24004 alignment-specifier:
24005 alignas ( type-id ... [opt] )
24006 alignas ( alignment-expression ... [opt] ). */
24008 static tree
24010 {
24016 {
24025 else
24026 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24027 when we are sure that we have actually parsed them. */
24029 }
24030 else
24031 {
24032 tree alignas_expr;
24034 /* Look for an alignment-specifier. */
24046 {
24049 }
24055 {
24059 alignas_expr =
24066 }
24072 {
24075 }
24078 {
24081 }
24083 /* Build the C++-11 representation of an 'aligned'
24084 attribute. */
24085 attributes =
24088 alignas_expr);
24089 }
24092 }
24094 /* Parse a standard C++-11 attribute-specifier-seq.
24096 attribute-specifier-seq:
24097 attribute-specifier-seq [opt] attribute-specifier
24098 */
24100 static tree
24102 {
24106 {
24115 }
24119 }
24121 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24122 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24123 current value of the PEDANTIC flag, regardless of whether or not
24124 the `__extension__' keyword is present. The caller is responsible
24125 for restoring the value of the PEDANTIC flag. */
24127 static bool
24129 {
24130 /* Save the old value of the PEDANTIC flag. */
24134 {
24135 /* Consume the `__extension__' token. */
24137 /* We're not being pedantic while the `__extension__' keyword is
24138 in effect. */
24142 }
24145 }
24147 /* Parse a label declaration.
24149 label-declaration:
24150 __label__ label-declarator-seq ;
24152 label-declarator-seq:
24153 identifier , label-declarator-seq
24154 identifier */
24156 static void
24158 {
24159 /* Look for the `__label__' keyword. */
24163 {
24164 tree identifier;
24166 /* Look for an identifier. */
24168 /* If we failed, stop. */
24171 /* Declare it as a label. */
24173 /* If the next token is a `;', stop. */
24176 /* Look for the `,' separating the label declarations. */
24178 }
24180 /* Look for the final `;'. */
24182 }
24184 // -------------------------------------------------------------------------- //
24185 // Requires Clause
24187 // Parse a requires clause.
24188 //
24189 // requires-clause:
24190 // 'requires' logical-or-expression
24191 //
24192 // The required logical-or-expression must be a constant expression. Note
24193 // that we don't check that the expression is constepxr here. We defer until
24194 // we analyze constraints and then, we only check atomic constraints.
24195 static tree
24197 {
24198 // Parse the requires clause so that it is not automatically folded.
24204 }
24206 // Optionally parse a requires clause:
24207 static tree
24209 {
24214 }
24217 /*---------------------------------------------------------------------------
24218 Requires expressions
24219 ---------------------------------------------------------------------------*/
24221 /* Parse a requires expression
24223 requirement-expression:
24224 'requires' requirement-parameter-list [opt] requirement-body */
24225 static tree
24227 {
24231 /* A requires-expression shall appear only within a concept
24232 definition or a requires-clause.
24234 TODO: Implement this diagnostic correctly. */
24236 {
24240 }
24243 {
24244 /* Local parameters are delared as variables within the scope
24245 of the expression. They are not visible past the end of
24246 the expression. Expressions within the requires-expression
24247 are unevaluated. */
24248 struct scope_sentinel
24249 {
24251 {
24254 }
24257 {
24260 }
24263 /* Parse the optional parameter list. */
24265 {
24269 }
24270 else
24273 /* Parse the requirement body. */
24277 }
24279 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24280 the parm chain. */
24283 }
24285 /* Parse a parameterized requirement.
24287 requirement-parameter-list:
24288 '(' parameter-declaration-clause ')' */
24289 static tree
24291 {
24301 }
24303 /* Parse the body of a requirement.
24305 requirement-body:
24306 '{' requirement-list '}' */
24307 static tree
24309 {
24319 }
24321 /* Parse a list of requirements.
24323 requirement-list:
24324 requirement
24325 requirement-list ';' requirement[opt] */
24326 static tree
24328 {
24331 {
24338 /* If we see a semi-colon, consume it. */
24342 /* Stop processing at the end of the list. */
24345 }
24347 /* Reverse the order of requirements so they are analyzed in
24348 declaration order. */
24350 }
24352 /* Parse a syntactic requirement or type requirement.
24354 requirement:
24355 simple-requirement
24356 compound-requirement
24357 type-requirement
24358 nested-requirement */
24359 static tree
24361 {
24368 else
24370 }
24372 /* Parse a simple requirement.
24374 simple-requirement:
24375 expression ';' */
24376 static tree
24378 {
24387 }
24389 /* Parse a type requirement
24391 type-requirement
24392 nested-name-specifier [opt] required-type-name ';'
24394 required-type-name:
24395 type-name
24396 'template' [opt] simple-template-id */
24397 static tree
24399 {
24402 // Save the scope before parsing name specifiers.
24413 tree type;
24415 {
24424 }
24425 else
24444 }
24446 /* Parse a compound requirement
24448 compound-requirement:
24449 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24450 static tree
24452 {
24453 /* Parse an expression enclosed in '{ }'s. */
24464 /* Parse the optional noexcept. */
24467 {
24470 }
24472 /* Parse the optional trailing return type. */
24475 {
24483 }
24486 }
24488 /* Parse a nested requirement. This is the same as a requires clause.
24490 nested-requirement:
24491 requires-clause */
24492 static tree
24494 {
24500 }
24502 /* Support Functions */
24504 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24505 NAME should have one of the representations used for an
24506 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24507 is returned. If PARSER->SCOPE is a dependent type, then a
24508 SCOPE_REF is returned.
24510 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24511 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24512 was formed. Abstractly, such entities should not be passed to this
24513 function, because they do not need to be looked up, but it is
24514 simpler to check for this special case here, rather than at the
24515 call-sites.
24517 In cases not explicitly covered above, this function returns a
24518 DECL, OVERLOAD, or baselink representing the result of the lookup.
24519 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24520 is returned.
24522 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24523 (e.g., "struct") that was used. In that case bindings that do not
24524 refer to types are ignored.
24526 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24527 ignored.
24529 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24530 are ignored.
24532 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24533 types.
24535 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24536 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24537 NULL_TREE otherwise. */
24539 static cp_expr
24546 location_t name_location)
24547 {
24548 tree decl;
24551 /* Assume that the lookup will be unambiguous. */
24555 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24556 no longer valid. Note that if we are parsing tentatively, and
24557 the parse fails, OBJECT_TYPE will be automatically restored. */
24563 /* A template-id has already been resolved; there is no lookup to
24564 do. */
24568 {
24572 }
24574 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24575 it should already have been checked to make sure that the name
24576 used matches the type being destroyed. */
24578 {
24579 tree type;
24581 /* Figure out to which type this destructor applies. */
24586 else
24588 /* If that's not a class type, there is no destructor. */
24595 /* If it was a class type, return the destructor. */
24597 }
24599 /* By this point, the NAME should be an ordinary identifier. If
24600 the id-expression was a qualified name, the qualifying scope is
24601 stored in PARSER->SCOPE at this point. */
24604 /* Perform the lookup. */
24606 {
24612 /* If the SCOPE is dependent, the lookup must be deferred until
24613 the template is instantiated -- unless we are explicitly
24614 looking up names in uninstantiated templates. Even then, we
24615 cannot look up the name if the scope is not a class type; it
24616 might, for example, be a template type parameter. */
24621 /* Defer lookup. */
24623 else
24624 {
24627 /* If PARSER->SCOPE is a dependent type, then it must be a
24628 class type, and we must not be checking dependencies;
24629 otherwise, we would have processed this lookup above. So
24630 that PARSER->SCOPE is not considered a dependent base by
24631 lookup_member, we must enter the scope here. */
24635 /* If the PARSER->SCOPE is a template specialization, it
24636 may be instantiated during name lookup. In that case,
24637 errors may be issued. Even if we rollback the current
24638 tentative parse, those errors are valid. */
24643 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24644 lookup result and the nested-name-specifier nominates a class C:
24645 * if the name specified after the nested-name-specifier, when
24646 looked up in C, is the injected-class-name of C (Clause 9), or
24647 * if the name specified after the nested-name-specifier is the
24648 same as the identifier or the simple-template-id's template-
24649 name in the last component of the nested-name-specifier,
24650 the name is instead considered to name the constructor of
24651 class C. [ Note: for example, the constructor is not an
24652 acceptable lookup result in an elaborated-type-specifier so
24653 the constructor would not be used in place of the
24654 injected-class-name. --end note ] Such a constructor name
24655 shall be used only in the declarator-id of a declaration that
24656 names a constructor or in a using-declaration. */
24664 /* If we have a single function from a using decl, pull it out. */
24671 }
24673 /* If the scope is a dependent type and either we deferred lookup or
24674 we did lookup but didn't find the name, rememeber the name. */
24677 {
24679 {
24680 tree type;
24682 /* The resolution to Core Issue 180 says that `struct
24683 A::B' should be considered a type-name, even if `A'
24684 is dependent. */
24689 }
24693 CPP_CLOSE_PAREN)))
24697 else
24700 is_template);
24701 }
24704 }
24706 {
24707 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24708 OBJECT_TYPE is not a class. */
24710 /* If the OBJECT_TYPE is a template specialization, it may
24711 be instantiated during name lookup. In that case, errors
24712 may be issued. Even if we rollback the current tentative
24713 parse, those errors are valid. */
24715 name,
24718 tf_warning_or_error);
24719 else
24723 /* Look it up in the enclosing context. */
24729 }
24730 else
24731 {
24737 }
24739 /* If the lookup failed, let our caller know. */
24743 /* Pull out the template from an injected-class-name (or multiple). */
24747 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
24749 {
24752 /* The error message we have to print is too complicated for
24753 cp_parser_error, so we incorporate its actions directly. */
24755 {
24757 name);
24759 }
24761 }
24769 /* If we have resolved the name of a member declaration, check to
24770 see if the declaration is accessible. When the name resolves to
24771 set of overloaded functions, accessibility is checked when
24772 overload resolution is done.
24774 During an explicit instantiation, access is not checked at all,
24775 as per [temp.explicit]. */
24782 }
24784 /* Like cp_parser_lookup_name, but for use in the typical case where
24785 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
24786 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
24788 static tree
24790 {
24792 none_type,
24797 location);
24798 }
24800 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24801 the current context, return the TYPE_DECL. If TAG_NAME_P is
24802 true, the DECL indicates the class being defined in a class-head,
24803 or declared in an elaborated-type-specifier.
24805 Otherwise, return DECL. */
24807 static tree
24809 {
24810 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24811 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24813 struct A {
24814 template <typename T> struct B;
24815 };
24817 template <typename T> struct A::B {};
24819 Similarly, in an elaborated-type-specifier:
24821 namespace N { struct X{}; }
24823 struct A {
24824 template <typename T> friend struct N::X;
24825 };
24827 However, if the DECL refers to a class type, and we are in
24828 the scope of the class, then the name lookup automatically
24829 finds the TYPE_DECL created by build_self_reference rather
24830 than a TEMPLATE_DECL. For example, in:
24832 template <class T> struct S {
24833 S s;
24834 };
24836 there is no need to handle such case. */
24842 }
24844 /* If too many, or too few, template-parameter lists apply to the
24845 declarator, issue an error message. Returns TRUE if all went well,
24846 and FALSE otherwise. */
24848 static bool
24851 location_t declarator_location)
24852 {
24854 {
24856 {
24864 /* If the DECLARATOR has the form `X<y>' then it uses one
24865 additional level of template parameters. */
24868 return cp_parser_check_template_parameters
24870 }
24885 }
24887 }
24889 /* NUM_TEMPLATES were used in the current declaration. If that is
24890 invalid, return FALSE and issue an error messages. Otherwise,
24891 return TRUE. If DECLARATOR is non-NULL, then we are checking a
24892 declarator and we can print more accurate diagnostics. */
24894 static bool
24897 location_t location,
24899 {
24900 /* If there are the same number of template classes and parameter
24901 lists, that's OK. */
24904 /* If there are more, but only one more, then we are referring to a
24905 member template. That's OK too. */
24908 /* If there are more template classes than parameter lists, we have
24909 something like:
24911 template <class T> void S<T>::R<T>::f (); */
24913 {
24923 else
24926 }
24927 /* Otherwise, there are too many template parameter lists. We have
24928 something like:
24930 template <class T> template <class U> void S::f(); */
24933 }
24935 /* Parse an optional `::' token indicating that the following name is
24936 from the global namespace. If so, PARSER->SCOPE is set to the
24937 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
24938 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
24939 Returns the new value of PARSER->SCOPE, if the `::' token is
24940 present, and NULL_TREE otherwise. */
24942 static tree
24944 {
24947 /* Peek at the next token. */
24949 /* If we're looking at a `::' token then we're starting from the
24950 global namespace, not our current location. */
24952 {
24953 /* Consume the `::' token. */
24955 /* Set the SCOPE so that we know where to start the lookup. */
24961 }
24963 {
24967 }
24970 }
24972 /* Returns TRUE if the upcoming token sequence is the start of a
24973 constructor declarator. If FRIEND_P is true, the declarator is
24974 preceded by the `friend' specifier. */
24976 static bool
24978 {
24981 tree nested_name_specifier;
24984 /* The common case is that this is not a constructor declarator, so
24985 try to avoid doing lots of work if at all possible. It's not
24986 valid declare a constructor at function scope. */
24989 /* And only certain tokens can begin a constructor declarator. */
24997 /* Parse tentatively; we are going to roll back all of the tokens
24998 consumed here. */
25000 /* Assume that we are looking at a constructor declarator. */
25003 /* Look for the optional `::' operator. */
25006 /* Look for the nested-name-specifier. */
25007 nested_name_specifier
25018 /* Outside of a class-specifier, there must be a
25019 nested-name-specifier. */
25025 /* If we have a class scope, this is easy; DR 147 says that S::S always
25026 names the constructor, and no other qualified name could. */
25029 {
25039 }
25040 /* If we still think that this might be a constructor-declarator,
25041 look for a class-name. */
25043 {
25044 /* If we have:
25046 template <typename T> struct S {
25047 S();
25048 };
25050 we must recognize that the nested `S' names a class. */
25051 tree type_decl;
25055 none_type,
25059 /* If there was no class-name, then this is not a constructor.
25060 Otherwise, if we are in a class-specifier and we aren't
25061 handling a friend declaration, check that its type matches
25062 current_class_type (c++/38313). Note: error_mark_node
25063 is left alone for error recovery purposes. */
25065 && (outside_class_specifier_p
25070 /* If we're still considering a constructor, we have to see a `(',
25071 to begin the parameter-declaration-clause, followed by either a
25072 `)', an `...', or a decl-specifier. We need to check for a
25073 type-specifier to avoid being fooled into thinking that:
25075 S (f) (int);
25077 is a constructor. (It is actually a function named `f' that
25078 takes one parameter (of type `int') and returns a value of type
25079 `S'. */
25087 /* A parameter declaration begins with a decl-specifier,
25088 which is either the "attribute" keyword, a storage class
25089 specifier, or (usually) a type-specifier. */
25091 {
25092 tree type;
25096 /* Names appearing in the type-specifier should be looked up
25097 in the scope of the class. */
25100 else
25101 {
25104 {
25108 {
25111 }
25112 }
25114 }
25116 /* Inside the constructor parameter list, surrounding
25117 template-parameter-lists do not apply. */
25118 saved_num_template_parameter_lists
25122 /* Look for the type-specifier. */
25124 CP_PARSER_FLAGS_NONE,
25130 parser->num_template_parameter_lists
25133 /* Leave the scope of the class. */
25138 }
25139 }
25141 /* We did not really want to consume any tokens. */
25145 }
25147 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25148 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25149 they must be performed once we are in the scope of the function.
25151 Returns the function defined. */
25153 static tree
25154 cp_parser_function_definition_from_specifiers_and_declarator
25157 tree attributes,
25159 {
25160 tree fn;
25163 /* Begin the function-definition. */
25166 /* The things we're about to see are not directly qualified by any
25167 template headers we've seen thus far. */
25170 /* If there were names looked up in the decl-specifier-seq that we
25171 did not check, check them now. We must wait until we are in the
25172 scope of the function to perform the checks, since the function
25173 might be a friend. */
25177 {
25182 }
25185 {
25186 /* Skip the entire function. */
25189 }
25191 {
25192 /* Seen already, skip it. An error message has already been output. */
25196 /* If this is a function from a class, pop the nested class. */
25199 }
25200 else
25201 {
25202 timevar_id_t tv;
25205 else
25211 }
25214 }
25216 /* Parse the part of a function-definition that follows the
25217 declarator. INLINE_P is TRUE iff this function is an inline
25218 function defined within a class-specifier.
25220 Returns the function defined. */
25222 static tree
25225 {
25226 tree fn;
25232 bool fully_implicit_function_template_p
25235 tree implicit_template_parms
25238 cp_binding_level* implicit_template_scope
25244 /* If the next token is `return', then the code may be trying to
25245 make use of the "named return value" extension that G++ used to
25246 support. */
25249 {
25250 /* Consume the `return' keyword. */
25252 /* Look for the identifier that indicates what value is to be
25253 returned. */
25255 /* Issue an error message. */
25258 /* Skip tokens until we reach the start of the function body. */
25260 {
25267 }
25268 }
25269 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25270 anything declared inside `f'. */
25271 saved_in_unbraced_linkage_specification_p
25274 /* Inside the function, surrounding template-parameter-lists do not
25275 apply. */
25276 saved_num_template_parameter_lists
25282 /* If the next token is `try', `__transaction_atomic', or
25283 `__transaction_relaxed`, then we are looking at either function-try-block
25284 or function-transaction-block. Note that all of these include the
25285 function-body. */
25288 RID_TRANSACTION_ATOMIC);
25290 RID_TRANSACTION_RELAXED))
25292 RID_TRANSACTION_RELAXED);
25295 else
25296 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25301 /* Finish the function. */
25304 /* Generate code for it, if necessary. */
25306 /* Restore the saved values. */
25307 parser->in_unbraced_linkage_specification_p
25309 parser->num_template_parameter_lists
25313 parser->fully_implicit_function_template_p
25315 parser->implicit_template_parms
25317 parser->implicit_template_scope
25324 }
25326 /* Parse a template-declaration body (following argument list). */
25328 static void
25330 tree parameter_list,
25332 {
25336 /* We just processed one more parameter list. */
25339 /* Get the deferred access checks from the parameter list. These
25340 will be checked once we know what is being declared, as for a
25341 member template the checks must be performed in the scope of the
25342 class containing the member. */
25345 /* Tentatively parse for a new template parameter list, which can either be
25346 the template keyword or a template introduction. */
25352 else
25353 {
25354 /* There are no access checks when parsing a template, as we do not
25355 know if a specialization will be a friend. */
25359 checks,
25360 member_p,
25365 /* If this is a member template declaration, let the front
25366 end know. */
25368 {
25373 }
25378 }
25379 /* We are done with the current parameter list. */
25384 /* Finish up. */
25387 /* Check the template arguments for a literal operator template. */
25391 {
25395 else
25396 {
25399 {
25405 }
25407 {
25415 }
25416 else
25418 }
25420 {
25423 " Expected non-type template argument pack <char...>"
25425 decl);
25426 else
25429 decl);
25430 }
25431 }
25433 /* Register member declarations. */
25436 /* If DECL is a function template, we must return to parse it later.
25437 (Even though there is no definition, there might be default
25438 arguments that need handling.) */
25442 }
25444 /* Parse a template introduction header for a template-declaration. Returns
25445 false if tentative parse fails. */
25447 static bool
25449 {
25456 /* Look for the optional `::' operator. */
25459 /* Look for the nested-name-specifier. */
25469 /* Look up the concept for which we will be matching
25470 template parameters. */
25480 /* Look for opening brace for introduction. */
25488 /* Build vector of placeholder parameters and grab
25489 matching identifiers. */
25492 /* The introduction-list shall not be empty. */
25495 {
25498 }
25500 /* Look for closing brace for introduction. */
25505 {
25509 }
25511 /* Build and associate the constraint. */
25514 {
25516 member_p);
25518 }
25522 }
25524 /* Parse a normal template-declaration following the template keyword. */
25526 static void
25528 {
25529 tree parameter_list;
25533 /* Look for the `<' token. */
25537 {
25538 /* 14.5.2.2 [temp.mem]
25540 A local class shall not have member templates. */
25545 }
25546 /* [temp]
25548 A template ... shall not have C linkage. */
25550 {
25552 /* Give it C++ linkage to avoid confusing other parts of the
25553 front end. */
25556 }
25557 else
25560 /* We cannot perform access checks on the template parameter
25561 declarations until we know what is being declared, just as we
25562 cannot check the decl-specifier list. */
25565 /* If the next token is `>', then we have an invalid
25566 specialization. Rather than complain about an invalid template
25567 parameter, issue an error message here. */
25569 {
25573 }
25574 else
25575 {
25576 /* Parse the template parameters. */
25578 }
25580 /* Look for the `>'. */
25583 /* Manage template requirements */
25585 {
25590 }
25593 member_p);
25595 /* For the erroneous case of a template with C linkage, we pushed an
25596 implicit C++ linkage scope; exit that scope now. */
25599 }
25601 /* Parse a template-declaration, assuming that the `export' (and
25602 `extern') keywords, if present, has already been scanned. MEMBER_P
25603 is as for cp_parser_template_declaration. */
25605 static bool
25607 {
25609 {
25613 }
25618 }
25620 /* Perform the deferred access checks from a template-parameter-list.
25621 CHECKS is a TREE_LIST of access checks, as returned by
25622 get_deferred_access_checks. */
25624 static void
25625 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
25626 {
25630 }
25632 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25633 `function-definition' sequence that follows a template header.
25634 If MEMBER_P is true, this declaration appears in a class scope.
25636 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25637 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25639 static tree
25645 {
25648 cp_decl_specifier_seq decl_specifiers;
25652 /* This function is only used when processing a template
25653 declaration. */
25657 /* Defer access checks until we know what is being declared. */
25660 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25661 alternative. */
25664 CP_PARSER_FLAGS_OPTIONAL,
25670 /* There are no template typedefs. */
25672 {
25676 }
25678 /* Gather up the access checks that occurred the
25679 decl-specifier-seq. */
25682 /* Check for the declaration of a template class. */
25684 {
25687 {
25688 // If this is a declaration, but not a definition, associate
25689 // any constraints with the type declaration. Constraints
25690 // are associated with definitions in cp_parser_class_specifier.
25696 /* In this case:
25698 struct C {
25699 friend template <typename T> struct A<T>::B;
25700 };
25702 A<T>::B will be represented by a TYPENAME_TYPE, and
25703 therefore not recognized by shadow_tag. */
25705 && !decl
25712 else
25715 /* Perform access checks for template parameters. */
25718 /* Give a helpful diagnostic for
25719 template <class T> struct A { } a;
25720 if we aren't already recovering from an error. */
25723 {
25725 "a class template declaration must not declare "
25729 }
25730 }
25731 }
25733 /* Complain about missing 'typename' or other invalid type names. */
25736 {
25737 /* cp_parser_parse_and_diagnose_invalid_type_name calls
25738 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
25739 the rest of this declaration. */
25742 }
25744 /* If it's not a template class, try for a template function. If
25745 the next token is a `;', then this declaration does not declare
25746 anything. But, if there were errors in the decl-specifiers, then
25747 the error might well have come from an attempted class-specifier.
25748 In that case, there's no need to warn about a missing declarator. */
25752 {
25755 checks,
25757 member_p,
25758 declares_class_or_enum,
25762 /* 7.1.1-1 [dcl.stc]
25764 A storage-class-specifier shall not be specified in an explicit
25765 specialization... */
25767 && explicit_specialization_p
25769 {
25773 }
25777 }
25779 /* Look for a trailing `;' after the declaration. */
25785 out:
25788 /* Clear any current qualification; whatever comes next is the start
25789 of something new. */
25795 }
25797 /* Parse a cast-expression that is not the operand of a unary "&". */
25799 static cp_expr
25801 {
25804 }
25806 /* Parse a functional cast to TYPE. Returns an expression
25807 representing the cast. */
25809 static cp_expr
25811 {
25813 tree expression_list;
25814 cp_expr cast;
25823 {
25832 tf_warning_or_error);
25833 /* Create a location of the form:
25834 type_name{i, f}
25835 ^~~~~~~~~~~~~~~
25836 with caret == start at the start of the type name,
25837 finishing at the closing brace. */
25838 location_t finish_loc
25841 finish_loc);
25844 }
25853 else
25854 {
25857 }
25860 tf_warning_or_error);
25861 /* [expr.const]/1: In an integral constant expression "only type
25862 conversions to integral or enumeration type can be used". */
25868 NIC_CONSTRUCTOR))
25871 /* Create a location of the form:
25872 float(i)
25873 ^~~~~~~~
25874 with caret == start at the start of the type name,
25875 finishing at the closing paren. */
25876 location_t finish_loc
25881 }
25883 /* Save the tokens that make up the body of a member function defined
25884 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
25885 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
25886 specifiers applied to the declaration. Returns the FUNCTION_DECL
25887 for the member function. */
25889 static tree
25893 tree attributes)
25894 {
25897 tree fn;
25899 /* Create the FUNCTION_DECL. */
25903 /* If something went badly wrong, bail out now. */
25905 {
25906 /* If there's a function-body, skip it. */
25911 }
25913 /* Remember it, if there default args to post process. */
25916 /* Save away the tokens that make up the body of the
25917 function. */
25919 /* Handle function try blocks. */
25922 /* We can have braced-init-list mem-initializers before the fn body. */
25924 {
25927 {
25928 /* cache_group will stop after an un-nested { } pair, too. */
25932 /* variadic mem-inits have ... after the ')'. */
25935 }
25936 }
25938 /* Handle function try blocks. */
25943 /* Save away the inline definition; we will process it when the
25944 class is complete. */
25948 /* We need to know that this was defined in the class, so that
25949 friend templates are handled correctly. */
25952 /* Add FN to the queue of functions to be parsed later. */
25956 }
25958 /* Save the tokens that make up the in-class initializer for a non-static
25959 data member. Returns a DEFAULT_ARG. */
25961 static tree
25963 {
25965 }
25967 /* Parse a template-argument-list, as well as the trailing ">" (but
25968 not the opening "<"). See cp_parser_template_argument_list for the
25969 return value. */
25971 static tree
25973 {
25974 tree arguments;
25975 tree saved_scope;
25976 tree saved_qualifying_scope;
25977 tree saved_object_scope;
25982 /* [temp.names]
25984 When parsing a template-id, the first non-nested `>' is taken as
25985 the end of the template-argument-list rather than a greater-than
25986 operator. */
25987 saved_greater_than_is_operator_p
25990 /* Parsing the argument list may modify SCOPE, so we save it
25991 here. */
25995 /* We need to evaluate the template arguments, even though this
25996 template-id may be nested within a "sizeof". */
26001 /* Parse the template-argument-list itself. */
26005 else
26007 /* Look for the `>' that ends the template-argument-list. If we find
26008 a '>>' instead, it's probably just a typo. */
26010 {
26012 {
26013 /* In C++0x, a `>>' in a template argument list or cast
26014 expression is considered to be two separate `>'
26015 tokens. So, change the current token to a `>', but don't
26016 consume it: it will be consumed later when the outer
26017 template argument list (or cast expression) is parsed.
26018 Note that this replacement of `>' for `>>' is necessary
26019 even if we are parsing tentatively: in the tentative
26020 case, after calling
26021 cp_parser_enclosed_template_argument_list we will always
26022 throw away all of the template arguments and the first
26023 closing `>', either because the template argument list
26024 was erroneous or because we are replacing those tokens
26025 with a CPP_TEMPLATE_ID token. The second `>' (which will
26026 not have been thrown away) is needed either to close an
26027 outer template argument list or to complete a new-style
26028 cast. */
26031 }
26033 {
26034 /* If we're in a nested template argument list, the '>>' has
26035 to be a typo for '> >'. We emit the error message, but we
26036 continue parsing and we push a '>' as next token, so that
26037 the argument list will be parsed correctly. Note that the
26038 global source location is still on the token before the
26039 '>>', so we need to say explicitly where we want it. */
26045 }
26046 else
26047 {
26048 /* If this is not a nested template argument list, the '>>'
26049 is a typo for '>'. Emit an error message and continue.
26050 Same deal about the token location, but here we can get it
26051 right by consuming the '>>' before issuing the diagnostic. */
26054 "spurious %<>>%>, use %<>%> to terminate "
26056 }
26057 }
26058 else
26060 /* The `>' token might be a greater-than operator again now. */
26061 parser->greater_than_is_operator_p
26063 /* Restore the SAVED_SCOPE. */
26071 }
26073 /* MEMBER_FUNCTION is a member function, or a friend. If default
26074 arguments, or the body of the function have not yet been parsed,
26075 parse them now. */
26077 static void
26079 {
26081 /* If this member is a template, get the underlying
26082 FUNCTION_DECL. */
26086 /* There should not be any class definitions in progress at this
26087 point; the bodies of members are only parsed outside of all class
26088 definitions. */
26090 /* While we're parsing the member functions we might encounter more
26091 classes. We want to handle them right away, but we don't want
26092 them getting mixed up with functions that are currently in the
26093 queue. */
26096 /* Make sure that any template parameters are in scope. */
26099 /* If the body of the function has not yet been parsed, parse it
26100 now. */
26102 {
26103 tree function_scope;
26106 /* The function is no longer pending; we are processing it. */
26111 /* If this is a local class, enter the scope of the containing
26112 function. */
26117 /* Push the body of the function onto the lexer stack. */
26120 /* Let the front end know that we going to be defining this
26121 function. */
26125 /* Don't do access checking if it is a templated function. */
26129 /* #pragma omp declare reduction needs special parsing. */
26131 {
26136 }
26137 else
26138 /* Now, parse the body of the function. */
26145 /* Leave the scope of the containing function. */
26149 }
26151 /* Remove any template parameters from the symbol table. */
26154 /* Restore the queue. */
26157 }
26159 /* If DECL contains any default args, remember it on the unparsed
26160 functions queue. */
26162 static void
26164 {
26165 tree probe;
26168 probe;
26171 {
26175 }
26176 }
26178 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26179 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26180 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26181 from the parameter-type-list. */
26183 static tree
26186 {
26188 tree parsed_arg;
26194 /* Push the saved tokens for the default argument onto the parser's
26195 lexer stack. */
26201 /* Parse the default argument. */
26212 {
26213 /* In a non-template class, check conversions now. In a template,
26214 we'll wait and instantiate these as needed. */
26217 tf_warning_or_error);
26218 else
26220 }
26222 /* If the token stream has not been completely used up, then
26223 there was extra junk after the end of the default
26224 argument. */
26226 {
26229 else
26231 }
26233 /* Revert to the main lexer. */
26237 }
26239 /* FIELD is a non-static data member with an initializer which we saved for
26240 later; parse it now. */
26242 static void
26244 {
26245 tree def;
26252 NULL_TREE);
26258 }
26260 /* FN is a FUNCTION_DECL which may contains a parameter with an
26261 unparsed DEFAULT_ARG. Parse the default args now. This function
26262 assumes that the current scope is the scope in which the default
26263 argument should be processed. */
26265 static void
26267 {
26271 /* While we're parsing the default args, we might (due to the
26272 statement expression extension) encounter more classes. We want
26273 to handle them right away, but we don't want them getting mixed
26274 up with default args that are currently in the queue. */
26277 /* Local variable names (and the `this' keyword) may not appear
26278 in a default argument. */
26289 {
26291 tree parsed_arg;
26293 tree copy;
26300 /* This can happen for a friend declaration for a function
26301 already declared with default arguments. */
26304 parsed_arg
26306 default_arg,
26309 {
26311 }
26315 /* Update any instantiations we've already created. */
26319 }
26323 /* Make sure no default arg is missing. */
26326 /* Restore the state of local_variables_forbidden_p. */
26329 /* Restore the queue. */
26331 }
26333 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26335 sizeof ... ( identifier )
26337 where the 'sizeof' token has already been consumed. */
26339 static tree
26341 {
26342 /* Consume the `...'. */
26349 else
26357 /* The name is not qualified. */
26376 }
26378 /* Parse the operand of `sizeof' (or a similar operator). Returns
26379 either a TYPE or an expression, depending on the form of the
26380 input. The KEYWORD indicates which kind of expression we have
26381 encountered. */
26383 static tree
26385 {
26392 /* If it's a `...', then we are computing the length of a parameter
26393 pack. */
26398 /* Types cannot be defined in a `sizeof' expression. Save away the
26399 old message. */
26401 /* And create the new one. */
26407 /* The restrictions on constant-expressions do not apply inside
26408 sizeof expressions. */
26409 saved_integral_constant_expression_p
26411 saved_non_integral_constant_expression_p
26415 /* Do not actually evaluate the expression. */
26418 /* If it's a `(', then we might be looking at the type-id
26419 construction. */
26421 {
26424 /* We can't be sure yet whether we're looking at a type-id or an
26425 expression. */
26427 /* Note: as a GNU Extension, compound literals are considered
26428 postfix-expressions as they are in C99, so they are valid
26429 arguments to sizeof. See comment in cp_parser_cast_expression
26430 for details. */
26433 else
26434 {
26437 /* Look for the type-id. */
26439 /* Look for the closing `)'. */
26442 }
26444 /* If all went well, then we're done. */
26446 {
26447 cp_decl_specifier_seq decl_specs;
26449 /* Build a trivial decl-specifier-seq. */
26453 /* Call grokdeclarator to figure out what type this is. */
26456 TYPENAME,
26459 }
26460 }
26462 /* If the type-id production did not work out, then we must be
26463 looking at the unary-expression production. */
26467 /* Go back to evaluating expressions. */
26471 /* Free the message we created. */
26473 /* And restore the old one. */
26475 parser->integral_constant_expression_p
26477 parser->non_integral_constant_expression_p
26481 }
26483 /* If the current declaration has no declarator, return true. */
26485 static bool
26487 {
26488 /* If the next token is a `;' or a `,' then there is no
26489 declarator. */
26492 }
26494 /* Update the DECL_SPECS to reflect the storage class indicated by
26495 KEYWORD. */
26497 static void
26502 {
26503 cp_storage_class storage_class;
26506 {
26510 }
26512 {
26515 }
26520 {
26523 }
26526 {
26544 }
26548 /* A storage class specifier cannot be applied alongside a typedef
26549 specifier. If there is a typedef specifier present then set
26550 conflicting_specifiers_p which will trigger an error later
26551 on in grokdeclarator. */
26554 }
26556 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26557 is true, the type is a class or enum definition. */
26559 static void
26561 tree type_spec,
26564 {
26567 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26568 (with, for example, in "typedef int wchar_t;") we remember that
26569 this is what happened. In system headers, we ignore these
26570 declarations so that G++ can work with system headers that are not
26571 C++-safe. */
26573 && !type_definition_p
26583 {
26586 ds_redefined_builtin_type_spec,
26587 token);
26589 {
26593 }
26594 }
26597 else
26598 {
26603 }
26604 }
26606 /* True iff TOKEN is the GNU keyword __thread. */
26608 static bool
26610 {
26613 }
26615 /* Set the location for a declarator specifier and check if it is
26616 duplicated.
26618 DECL_SPECS is the sequence of declarator specifiers onto which to
26619 set the location.
26621 DS is the single declarator specifier to set which location is to
26622 be set onto the existing sequence of declarators.
26624 LOCATION is the location for the declarator specifier to
26625 consider. */
26627 static void
26630 {
26639 {
26643 }
26644 else
26645 {
26647 {
26651 else
26652 {
26655 OPT_Wlong_long,
26657 }
26658 }
26660 {
26665 else
26667 }
26668 else
26669 {
26685 "__complex"
26686 };
26689 }
26690 }
26691 }
26693 /* Return true iff the declarator specifier DS is present in the
26694 sequence of declarator specifiers DECL_SPECS. */
26696 bool
26698 cp_decl_spec ds)
26699 {
26706 }
26708 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
26709 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
26711 static bool
26713 {
26715 }
26717 /* Issue an error message indicating that TOKEN_DESC was expected.
26718 If KEYWORD is true, it indicated this function is called by
26719 cp_parser_require_keword and the required token can only be
26720 a indicated keyword. */
26722 static void
26724 required_token token_desc,
26726 {
26728 {
26797 }
26799 {
26801 {
26880 }
26881 }
26882 else
26884 }
26888 /* If the next token is of the indicated TYPE, consume it. Otherwise,
26889 issue an error message indicating that TOKEN_DESC was expected.
26891 Returns the token consumed, if the token had the appropriate type.
26892 Otherwise, returns NULL. */
26897 required_token token_desc)
26898 {
26901 else
26902 {
26903 /* Output the MESSAGE -- unless we're parsing tentatively. */
26907 }
26908 }
26910 /* An error message is produced if the next token is not '>'.
26911 All further tokens are skipped until the desired token is
26912 found or '{', '}', ';' or an unbalanced ')' or ']'. */
26914 static void
26916 {
26917 /* Current level of '< ... >'. */
26919 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
26922 /* Are we ready, yet? If not, issue error message. */
26926 /* Skip tokens until the desired token is found. */
26928 {
26929 /* Peek at the next token. */
26931 {
26939 /* C++0x views the `>>' operator as two `>' tokens, but
26940 C++98 does not. */
26943 {
26944 /* We've hit a `>>' where the first `>' closes the
26945 template argument list, and the second `>' is
26946 spurious. Just consume the `>>' and stop; we've
26947 already produced at least one error. */
26950 }
26951 /* Fall through for C++0x, so we handle the second `>' in
26952 the `>>'. */
26956 {
26957 /* We've reached the token we want, consume it and stop. */
26960 }
26979 /* The '>' was probably forgotten, don't look further. */
26984 }
26986 /* Consume this token. */
26988 }
26989 }
26991 /* If the next token is the indicated keyword, consume it. Otherwise,
26992 issue an error message indicating that TOKEN_DESC was expected.
26994 Returns the token consumed, if the token had the appropriate type.
26995 Otherwise, returns NULL. */
27000 required_token token_desc)
27001 {
27005 {
27008 }
27011 }
27013 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27014 function-definition. */
27016 static bool
27018 {
27021 /* A ctor-initializer begins with a `:'. */
27023 /* A function-try-block begins with `try'. */
27025 /* A function-transaction-block begins with `__transaction_atomic'
27026 or `__transaction_relaxed'. */
27029 /* The named return value extension begins with `return'. */
27031 }
27033 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27034 definition. */
27036 static bool
27038 {
27045 }
27047 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27048 C++0x) ending a template-argument. */
27050 static bool
27052 {
27060 }
27062 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27063 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27065 static bool
27068 {
27074 /* Check for the sequence `<::' in the original code. It would be lexed as
27075 `[:', where `[' is a digraph, and there is no whitespace before
27076 `:'. */
27078 {
27083 }
27085 }
27087 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27088 or none_type otherwise. */
27090 static enum tag_types
27092 {
27094 {
27104 }
27105 }
27107 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27108 or none_type otherwise or if the token is null. */
27110 static enum tag_types
27112 {
27117 {
27125 }
27126 }
27128 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27130 static void
27132 {
27136 {
27140 type))
27143 }
27144 }
27146 /* Issue an error message if DECL is redeclared with different
27147 access than its original declaration [class.access.spec/3].
27148 This applies to nested classes and nested class templates.
27149 [class.mem/1]. */
27151 static void
27153 {
27162 }
27164 /* Look for the `template' keyword, as a syntactic disambiguator.
27165 Return TRUE iff it is present, in which case it will be
27166 consumed. */
27168 static bool
27170 {
27172 {
27173 /* In C++98 the `template' keyword can only be used within templates;
27174 outside templates the parser can always figure out what is a
27175 template and what is not. In C++11, per the resolution of DR 468,
27176 `template' is allowed in cases where it is not strictly necessary. */
27179 {
27182 "in C++98 %<template%> (as a disambiguator) is only "
27184 /* If this part of the token stream is rescanned, the same
27185 error message would be generated. So, we purge the token
27186 from the stream. */
27189 }
27190 else
27191 {
27192 /* Consume the `template' keyword. */
27195 }
27196 }
27198 }
27200 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27201 set PARSER->SCOPE, and perform other related actions. */
27203 static void
27205 {
27208 /* Get the stored value. */
27210 /* Set the scope from the stored value. */
27214 }
27216 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27217 encounter the end of a block before what we were looking for. */
27219 static bool
27223 {
27225 {
27228 /* Abort a parenthesized expression if we encounter a semicolon. */
27232 /* If we've reached the end of the file, stop. */
27238 /* We've hit the end of an enclosing block, so there's been some
27239 kind of syntax error. */
27242 /* Consume the token. */
27244 /* See if it starts a new group. */
27246 {
27248 /* In theory this should probably check end == '}', but
27249 cp_parser_save_member_function_body needs it to exit
27250 after either '}' or ')' when called with ')'. */
27253 }
27255 {
27259 }
27264 }
27265 }
27267 /* Like above, for caching a default argument or NSDMI. Both of these are
27268 terminated by a non-nested comma, but it can be unclear whether or not a
27269 comma is nested in a template argument list unless we do more parsing.
27270 In order to handle this ambiguity, when we encounter a ',' after a '<'
27271 we try to parse what follows as a parameter-declaration-list (in the
27272 case of a default argument) or a member-declarator (in the case of an
27273 NSDMI). If that succeeds, then we stop caching. */
27275 static tree
27277 {
27282 tree default_argument;
27284 /* Add tokens until we have processed the entire default
27285 argument. We add the range [first_token, token). */
27288 {
27289 /* For list-initialization, this is straightforward. */
27292 }
27294 {
27297 /* Peek at the next token. */
27299 /* What we do depends on what token we have. */
27301 {
27302 /* In valid code, a default argument must be
27303 immediately followed by a `,' `)', or `...'. */
27306 {
27307 /* If we've seen a '<', we might be in a
27308 template-argument-list. Until Core issue 325 is
27309 resolved, we don't know how this situation ought
27310 to be handled, so try to DTRT. We check whether
27311 what comes after the comma is a valid parameter
27312 declaration list. If it is, then the comma ends
27313 the default argument; otherwise the default
27314 argument continues. */
27318 /* Set ITALP so cp_parser_parameter_declaration_list
27319 doesn't decide to commit to this parse. */
27326 {
27327 /* Parse declarators until we reach a non-comma or
27328 somthing that cannot be an initializer.
27329 Just checking whether we're looking at a single
27330 declarator is insufficient. Consider:
27331 int var = tuple<T,U>::x;
27332 The template parameter 'U' looks exactly like a
27333 declarator. */
27334 do
27335 {
27346 }
27348 /* If we met an '=' or ';' then the original comma
27349 was the end of the NSDMI. Otherwise assume
27350 we're still in the NSDMI. */
27353 }
27354 else
27355 {
27360 }
27367 }
27370 /* If we run into a non-nested `;', `}', or `]',
27371 then the code is invalid -- but the default
27372 argument is certainly over. */
27377 /* Handle correctly int n = sizeof ... ( p ); */
27380 /* Update DEPTH, if necessary. */
27395 /* This might be the comparison operator, or it might
27396 start a template argument list. */
27403 /* Fall through for C++0x, which treats the `>>'
27404 operator like two `>' tokens in certain
27405 cases. */
27409 {
27410 /* This might be an operator, or it might close a
27411 template argument list. But if a previous '<'
27412 started a template argument list, this will have
27413 closed it, so we can't be in one anymore. */
27417 }
27420 /* If we run out of tokens, issue an error message. */
27429 /* In these cases, we should look for template-ids.
27430 For example, if the default argument is
27431 `X<int, double>()', we need to do name lookup to
27432 figure out whether or not `X' is a template; if
27433 so, the `,' does not end the default argument.
27435 That is not yet done. */
27440 }
27442 /* If we've reached the end, stop. */
27446 /* Add the token to the token block. */
27448 }
27450 /* Create a DEFAULT_ARG to represent the unparsed default
27451 argument. */
27458 }
27460 /* Begin parsing tentatively. We always save tokens while parsing
27461 tentatively so that if the tentative parsing fails we can restore the
27462 tokens. */
27464 static void
27466 {
27467 /* Enter a new parsing context. */
27469 /* Begin saving tokens. */
27471 /* In order to avoid repetitive access control error messages,
27472 access checks are queued up until we are no longer parsing
27473 tentatively. */
27475 }
27477 /* Commit to the currently active tentative parse. */
27479 static void
27481 {
27485 /* Mark all of the levels as committed. */
27488 {
27495 }
27496 }
27498 /* Commit to the topmost currently active tentative parse.
27500 Note that this function shouldn't be called when there are
27501 irreversible side-effects while in a tentative state. For
27502 example, we shouldn't create a permanent entry in the symbol
27503 table, or issue an error message that might not apply if the
27504 tentative parse is aborted. */
27506 static void
27508 {
27513 {
27521 }
27522 }
27524 /* Abort the currently active tentative parse. All consumed tokens
27525 will be rolled back, and no diagnostics will be issued. */
27527 static void
27529 {
27533 /* Now, pretend that we want to see if the construct was
27534 successfully parsed. */
27536 }
27538 /* Stop parsing tentatively. If a parse error has occurred, restore the
27539 token stream. Otherwise, commit to the tokens we have consumed.
27540 Returns true if no error occurred; false otherwise. */
27542 static bool
27544 {
27548 /* Remember whether or not an error occurred, since we are about to
27549 destroy that information. */
27551 /* Remove the topmost context from the stack. */
27554 /* If no parse errors occurred, commit to the tentative parse. */
27556 {
27557 /* Commit to the tokens read tentatively, unless that was
27558 already done. */
27563 }
27564 /* Otherwise, if errors occurred, roll back our state so that things
27565 are just as they were before we began the tentative parse. */
27566 else
27567 {
27570 }
27571 /* Add the context to the front of the free list. */
27576 }
27578 /* Returns true if we are parsing tentatively and are not committed to
27579 this tentative parse. */
27581 static bool
27583 {
27586 }
27588 /* Returns nonzero iff an error has occurred during the most recent
27589 tentative parse. */
27591 static bool
27593 {
27596 }
27598 /* Returns nonzero if GNU extensions are allowed. */
27600 static bool
27602 {
27604 }
27605 \f
27606 /* Objective-C++ Productions */
27609 /* Parse an Objective-C expression, which feeds into a primary-expression
27610 above.
27612 objc-expression:
27613 objc-message-expression
27614 objc-string-literal
27615 objc-encode-expression
27616 objc-protocol-expression
27617 objc-selector-expression
27619 Returns a tree representation of the expression. */
27621 static cp_expr
27623 {
27624 /* Try to figure out what kind of declaration is present. */
27628 {
27638 {
27650 }
27656 }
27659 }
27661 /* Parse an Objective-C message expression.
27663 objc-message-expression:
27664 [ objc-message-receiver objc-message-args ]
27666 Returns a representation of an Objective-C message. */
27668 static tree
27670 {
27682 /* Construct a location e.g.
27683 [self func1:5]
27684 ^~~~~~~~~~~~~~
27685 ranging from the '[' to the ']', with the caret at the start. */
27690 }
27692 /* Parse an objc-message-receiver.
27694 objc-message-receiver:
27695 expression
27696 simple-type-specifier
27698 Returns a representation of the type or expression. */
27700 static tree
27702 {
27703 tree rcv;
27705 /* An Objective-C message receiver may be either (1) a type
27706 or (2) an expression. */
27710 /* If that worked out, fine. */
27717 CP_PARSER_FLAGS_NONE);
27724 }
27726 /* Parse the arguments and selectors comprising an Objective-C message.
27728 objc-message-args:
27729 objc-selector
27730 objc-selector-args
27731 objc-selector-args , objc-comma-args
27733 objc-selector-args:
27734 objc-selector [opt] : assignment-expression
27735 objc-selector-args objc-selector [opt] : assignment-expression
27737 objc-comma-args:
27738 assignment-expression
27739 objc-comma-args , assignment-expression
27741 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
27742 selector arguments and TREE_VALUE containing a list of comma
27743 arguments. */
27745 static tree
27747 {
27753 {
27759 /* Detect if we have a unary selector. */
27768 sel_args
27773 }
27775 /* Handle non-selector arguments, if any. */
27777 {
27778 tree arg;
27783 addl_args
27788 }
27791 {
27794 }
27797 }
27799 /* Parse an Objective-C encode expression.
27801 objc-encode-expression:
27802 @encode objc-typename
27804 Returns an encoded representation of the type argument. */
27806 static cp_expr
27808 {
27809 tree type;
27820 {
27824 }
27826 /* This happens if we find @encode(T) (where T is a template
27827 typename or something dependent on a template typename) when
27828 parsing a template. In that case, we can't compile it
27829 immediately, but we rather create an AT_ENCODE_EXPR which will
27830 need to be instantiated when the template is used.
27831 */
27833 {
27837 }
27840 /* Build a location of the form:
27841 @encode(int)
27842 ^~~~~~~~~~~~
27843 with caret==start at the @ token, finishing at the close paren. */
27844 location_t combined_loc
27849 }
27851 /* Parse an Objective-C @defs expression. */
27853 static tree
27855 {
27856 tree name;
27864 }
27866 /* Parse an Objective-C protocol expression.
27868 objc-protocol-expression:
27869 @protocol ( identifier )
27871 Returns a representation of the protocol expression. */
27873 static tree
27875 {
27876 tree proto;
27884 /* Build a location of the form:
27885 @protocol(prot)
27886 ^~~~~~~~~~~~~~~
27887 with caret==start at the @ token, finishing at the close paren. */
27888 location_t combined_loc
27894 }
27896 /* Parse an Objective-C selector expression.
27898 objc-selector-expression:
27899 @selector ( objc-method-signature )
27901 objc-method-signature:
27902 objc-selector
27903 objc-selector-seq
27905 objc-selector-seq:
27906 objc-selector :
27907 objc-selector-seq objc-selector :
27909 Returns a representation of the method selector. */
27911 static tree
27913 {
27925 {
27934 {
27935 /* Detect if we have a unary selector. */
27937 {
27940 }
27941 else
27942 {
27944 }
27945 }
27950 {
27951 sel_seq
27954 sel_seq
27957 }
27958 else
27959 sel_seq
27964 }
27966 finish_selector:
27970 /* Build a location of the form:
27971 @selector(func)
27972 ^~~~~~~~~~~~~~~
27973 with caret==start at the @ token, finishing at the close paren. */
27974 location_t combined_loc
27978 /* TODO: objc_build_selector_expr doesn't always honor the location. */
27981 }
27983 /* Parse a list of identifiers.
27985 objc-identifier-list:
27986 identifier
27987 objc-identifier-list , identifier
27989 Returns a TREE_LIST of identifier nodes. */
27991 static tree
27993 {
27994 tree identifier;
27995 tree list;
28006 {
28013 identifier));
28015 }
28018 }
28020 /* Parse an Objective-C alias declaration.
28022 objc-alias-declaration:
28023 @compatibility_alias identifier identifier ;
28025 This function registers the alias mapping with the Objective-C front end.
28026 It returns nothing. */
28028 static void
28030 {
28038 }
28040 /* Parse an Objective-C class forward-declaration.
28042 objc-class-declaration:
28043 @class objc-identifier-list ;
28045 The function registers the forward declarations with the Objective-C
28046 front end. It returns nothing. */
28048 static void
28050 {
28053 {
28054 tree id;
28064 else
28066 }
28068 }
28070 /* Parse a list of Objective-C protocol references.
28072 objc-protocol-refs-opt:
28073 objc-protocol-refs [opt]
28075 objc-protocol-refs:
28076 < objc-identifier-list >
28078 Returns a TREE_LIST of identifiers, if any. */
28080 static tree
28082 {
28086 {
28090 }
28093 }
28095 /* Parse a Objective-C visibility specification. */
28097 static void
28099 {
28103 {
28118 }
28120 /* Eat '@private'/'@protected'/'@public'. */
28122 }
28124 /* Parse an Objective-C method type. Return 'true' if it is a class
28125 (+) method, and 'false' if it is an instance (-) method. */
28129 {
28132 else
28134 }
28136 /* Parse an Objective-C protocol qualifier. */
28138 static tree
28140 {
28153 {
28158 }
28161 }
28163 /* Parse an Objective-C typename. */
28165 static tree
28167 {
28171 {
28177 /* An ObjC type name may consist of just protocol qualifiers, in which
28178 case the type shall default to 'id'. */
28180 {
28183 /* If the type could not be parsed, an error has already
28184 been produced. For error recovery, behave as if it had
28185 not been specified, which will use the default type
28186 'id'. */
28188 {
28190 /* We need to skip to the closing parenthesis as
28191 cp_parser_type_id() does not seem to do it for
28192 us. */
28197 }
28198 }
28202 }
28205 }
28207 /* Check to see if TYPE refers to an Objective-C selector name. */
28209 static bool
28211 {
28217 }
28219 /* Parse an Objective-C selector. */
28221 static tree
28223 {
28227 {
28230 }
28232 /* C++ operator names are allowed to appear in ObjC selectors. */
28234 {
28247 }
28248 }
28250 /* Parse an Objective-C params list. */
28252 static tree
28254 {
28260 {
28270 /* Detect if we have a unary selector. */
28273 {
28276 }
28280 {
28281 /* Something went quite wrong. There should be a colon
28282 here, but there is not. Stop parsing parameters. */
28284 }
28286 /* New ObjC allows attributes on parameters too. */
28291 params
28294 type_name,
28295 identifier,
28296 parm_attr));
28299 }
28302 {
28305 }
28307 /* We allow tail attributes for the method. */
28309 {
28317 }
28320 {
28323 }
28325 }
28327 /* Parse the non-keyword Objective-C params. */
28329 static tree
28332 {
28338 {
28340 tree parm;
28346 {
28351 }
28353 /* TODO: parse attributes for tail parameters. */
28362 }
28364 /* We allow tail attributes for the method. */
28366 {
28368 {
28373 }
28374 else
28375 /* We have an error, but parse the attributes, so that we can
28376 carry on. */
28382 }
28385 }
28387 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28389 static void
28391 {
28394 /* If the next token is `extern' and the following token is a string
28395 literal, then we have a linkage specification. */
28397 && cp_parser_is_pure_string_literal
28400 /* Handle #pragma, if any. */
28403 /* Allow stray semicolons. */
28406 /* Mark methods as optional or required, when building protocols. */
28408 {
28411 }
28413 {
28416 }
28419 /* Other stray characters must generate errors. */
28421 {
28425 }
28426 /* Finally, try to parse a block-declaration, or a function-definition. */
28427 else
28429 }
28431 /* Parse a method signature. */
28433 static tree
28435 {
28451 }
28453 static bool
28455 {
28456 tree tattr;
28461 /* If the attributes are followed by a method introducer, this is not allowed.
28462 Dump the attributes and flag the situation. */
28467 /* Otherwise, the attributes introduce some interstitial code, possibly so
28468 rewind to allow that check. */
28471 }
28473 /* Parse an Objective-C method prototype list. */
28475 static void
28477 {
28481 {
28483 {
28488 else
28492 {
28496 }
28499 }
28505 OPT_Wattributes,
28507 else
28508 /* Allow for interspersed non-ObjC++ code. */
28512 }
28516 else
28520 }
28522 /* Parse an Objective-C method definition list. */
28524 static void
28526 {
28530 {
28531 tree meth;
28534 {
28540 else
28545 {
28549 }
28551 NULL_TREE);
28553 /* For historical reasons, we accept an optional semicolon. */
28560 {
28567 }
28568 }
28569 /* The following case will be removed once @synthesize is
28570 completely implemented. */
28581 else
28582 /* Allow for interspersed non-ObjC++ code. */
28586 }
28590 else
28594 }
28596 /* Parse Objective-C ivars. */
28598 static void
28600 {
28611 {
28612 cp_decl_specifier_seq declspecs;
28614 tree prefix_attributes;
28622 CP_PARSER_FLAGS_OPTIONAL,
28626 /* auto, register, static, extern, mutable. */
28628 {
28631 }
28633 /* thread_local. */
28635 {
28638 }
28640 /* typedef. */
28642 {
28645 }
28650 /* Keep going until we hit the `;' at the end of the
28651 declaration. */
28653 {
28658 /* Check for a (possibly unnamed) bitfield declaration. */
28666 {
28667 /* Get the name of the bitfield. */
28670 sfk_none);
28672 eat_colon:
28674 /* Get the width of the bitfield. */
28675 width
28677 }
28678 else
28679 {
28680 /* Parse the declarator. */
28681 declarator
28687 }
28689 /* Look for attributes that apply to the ivar. */
28691 /* Remember which attributes are prefix attributes and
28692 which are not. */
28694 /* Combine the attributes. */
28698 /* Create the bitfield declaration. */
28700 width,
28701 attributes);
28702 else
28707 /* Add the instance variable. */
28711 /* Reset PREFIX_ATTRIBUTES. */
28720 {
28723 }
28725 }
28729 }
28734 /* Do not consume the RID_AT_END, so it will be read again as terminating
28735 the @interface of @implementation. */
28739 /* For historical reasons, we accept an optional semicolon. */
28742 }
28744 /* Parse an Objective-C protocol declaration. */
28746 static void
28748 {
28754 {
28759 }
28761 /* See if we have a forward declaration or a definition. */
28764 /* Try a forward declaration first. */
28766 {
28768 {
28769 tree id;
28779 else
28781 }
28783 }
28785 /* Ok, we got a full-fledged definition (or at least should). */
28786 else
28787 {
28792 }
28793 }
28795 /* Parse an Objective-C superclass or category. */
28797 static void
28802 {
28808 {
28811 }
28813 {
28816 /* If there is no category name, and this is an @interface, we
28817 have a class extension. */
28819 {
28822 }
28823 else
28827 }
28828 }
28830 /* Parse an Objective-C class interface. */
28832 static void
28834 {
28841 {
28842 /* It's hard to recover because even if valid @interface stuff
28843 is to follow, we can't compile it (or validate it) if we
28844 don't even know which class it refers to. Let's assume this
28845 was a stray '@interface' token in the stream and skip it.
28846 */
28848 }
28853 /* We have either a class or a category on our hands. */
28856 else
28857 {
28859 /* Handle instance variable declarations, if any. */
28862 }
28865 }
28867 /* Parse an Objective-C class implementation. */
28869 static void
28871 {
28878 {
28879 /* It's hard to recover because even if valid @implementation
28880 stuff is to follow, we can't compile it (or validate it) if
28881 we don't even know which class it refers to. Let's assume
28882 this was a stray '@implementation' token in the stream and
28883 skip it.
28884 */
28886 }
28890 /* We have either a class or a category on our hands. */
28893 else
28894 {
28896 /* Handle instance variable declarations, if any. */
28899 }
28902 }
28904 /* Consume the @end token and finish off the implementation. */
28906 static void
28908 {
28911 }
28913 /* Parse an Objective-C declaration. */
28915 static void
28917 {
28918 /* Try to figure out what kind of declaration is present. */
28923 {
28939 }
28942 {
28965 }
28966 }
28968 /* Parse an Objective-C try-catch-finally statement.
28970 objc-try-catch-finally-stmt:
28971 @try compound-statement objc-catch-clause-seq [opt]
28972 objc-finally-clause [opt]
28974 objc-catch-clause-seq:
28975 objc-catch-clause objc-catch-clause-seq [opt]
28977 objc-catch-clause:
28978 @catch ( objc-exception-declaration ) compound-statement
28980 objc-finally-clause:
28981 @finally compound-statement
28983 objc-exception-declaration:
28984 parameter-declaration
28985 '...'
28987 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
28989 Returns NULL_TREE.
28991 PS: This function is identical to c_parser_objc_try_catch_finally_statement
28992 for C. Keep them in sync. */
28994 static tree
28996 {
28997 location_t location;
28998 tree stmt;
29003 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29004 node, lest it get absorbed into the surrounding block. */
29010 {
29019 {
29020 /* We have "@catch (...)" (where the '...' are literally
29021 what is in the code). Skip the '...'.
29022 parameter_declaration is set to NULL_TREE, and
29023 objc_being_catch_clauses() knows that that means
29024 '...'. */
29027 }
29028 else
29029 {
29030 /* We have "@catch (NSException *exception)" or something
29031 like that. Parse the parameter declaration. */
29035 else
29040 }
29043 else
29044 {
29045 /* If there was no open parenthesis, we are recovering from
29046 an error, and we are trying to figure out what mistake
29047 the user has made. */
29049 /* If there is an immediate closing parenthesis, the user
29050 probably forgot the opening one (ie, they typed "@catch
29051 NSException *e)". Parse the closing parenthesis and keep
29052 going. */
29056 /* If these is no immediate closing parenthesis, the user
29057 probably doesn't know that parenthesis are required at
29058 all (ie, they typed "@catch NSException *e"). So, just
29059 forget about the closing parenthesis and keep going. */
29060 }
29064 }
29066 {
29069 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29070 node, lest it get absorbed into the surrounding block. */
29074 }
29077 }
29079 /* Parse an Objective-C synchronized statement.
29081 objc-synchronized-stmt:
29082 @synchronized ( expression ) compound-statement
29084 Returns NULL_TREE. */
29086 static tree
29088 {
29089 location_t location;
29100 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29101 node, lest it get absorbed into the surrounding block. */
29106 }
29108 /* Parse an Objective-C throw statement.
29110 objc-throw-stmt:
29111 @throw assignment-expression [opt] ;
29113 Returns a constructed '@throw' statement. */
29115 static tree
29117 {
29129 }
29131 /* Parse an Objective-C statement. */
29133 static tree
29135 {
29136 /* Try to figure out what kind of declaration is present. */
29140 {
29151 }
29154 }
29156 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29157 look ahead to see if an objc keyword follows the attributes. This
29158 is to detect the use of prefix attributes on ObjC @interface and
29159 @protocol. */
29161 static bool
29163 {
29168 {
29171 }
29174 }
29176 /* This routine is a minimal replacement for
29177 c_parser_struct_declaration () used when parsing the list of
29178 types/names or ObjC++ properties. For example, when parsing the
29179 code
29181 @property (readonly) int a, b, c;
29183 this function is responsible for parsing "int a, int b, int c" and
29184 returning the declarations as CHAIN of DECLs.
29186 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29187 similar parsing. */
29188 static tree
29190 {
29192 cp_decl_specifier_seq declspecs;
29194 tree prefix_attributes;
29197 CP_PARSER_FLAGS_NONE,
29204 /* auto, register, static, extern, mutable. */
29206 {
29209 }
29211 /* thread_local. */
29213 {
29216 }
29218 /* typedef. */
29220 {
29223 }
29228 /* Keep going until we hit the `;' at the end of the declaration. */
29230 {
29235 /* Parse the declarator. */
29239 /* Look for attributes that apply to the ivar. */
29241 /* Remember which attributes are prefix attributes and
29242 which are not. */
29244 /* Combine the attributes. */
29254 /* Reset PREFIX_ATTRIBUTES. */
29265 {
29268 }
29269 else
29271 }
29273 }
29275 /* Parse an Objective-C @property declaration. The syntax is:
29277 objc-property-declaration:
29278 '@property' objc-property-attributes[opt] struct-declaration ;
29280 objc-property-attributes:
29281 '(' objc-property-attribute-list ')'
29283 objc-property-attribute-list:
29284 objc-property-attribute
29285 objc-property-attribute-list, objc-property-attribute
29287 objc-property-attribute
29288 'getter' = identifier
29289 'setter' = identifier
29290 'readonly'
29291 'readwrite'
29292 'assign'
29293 'retain'
29294 'copy'
29295 'nonatomic'
29297 For example:
29298 @property NSString *name;
29299 @property (readonly) id object;
29300 @property (retain, nonatomic, getter=getTheName) id name;
29301 @property int a, b, c;
29303 PS: This function is identical to
29304 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29305 static void
29307 {
29308 /* The following variables hold the attributes of the properties as
29309 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29310 seen. When we see an attribute, we set them to 'true' (if they
29311 are boolean properties) or to the identifier (if they have an
29312 argument, ie, for getter and setter). Note that here we only
29313 parse the list of attributes, check the syntax and accumulate the
29314 attributes that we find. objc_add_property_declaration() will
29315 then process the information. */
29325 /* 'properties' is the list of properties that we read. Usually a
29326 single one, but maybe more (eg, in "@property int a, b, c;" there
29327 are three). */
29328 tree properties;
29329 location_t loc;
29335 /* Parse the optional attribute list... */
29337 {
29338 /* Eat the '('. */
29342 {
29348 {
29351 }
29355 {
29366 {
29370 else
29375 }
29378 {
29382 }
29384 {
29386 {
29389 }
29390 else
29394 else
29396 }
29397 else
29398 {
29400 {
29403 }
29404 else
29406 }
29412 }
29419 else
29421 }
29423 /* FIXME: "@property (setter, assign);" will generate a spurious
29424 "error: expected ‘)’ before ‘,’ token". This is because
29425 cp_parser_require, unlike the C counterpart, will produce an
29426 error even if we are in error recovery. */
29428 {
29433 }
29434 }
29436 /* ... and the property declaration(s). */
29440 {
29442 /* If the next token is now a `;', consume it. */
29446 }
29450 else
29451 {
29452 /* Comma-separated properties are chained together in
29453 reverse order; add them one by one. */
29462 }
29465 }
29467 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29469 objc-synthesize-declaration:
29470 @synthesize objc-synthesize-identifier-list ;
29472 objc-synthesize-identifier-list:
29473 objc-synthesize-identifier
29474 objc-synthesize-identifier-list, objc-synthesize-identifier
29476 objc-synthesize-identifier
29477 identifier
29478 identifier = identifier
29480 For example:
29481 @synthesize MyProperty;
29482 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29484 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29485 for C. Keep them in sync.
29486 */
29487 static void
29489 {
29491 location_t loc;
29496 {
29500 {
29503 }
29505 {
29509 {
29512 }
29513 }
29514 else
29519 else
29521 }
29524 }
29526 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29528 objc-dynamic-declaration:
29529 @dynamic identifier-list ;
29531 For example:
29532 @dynamic MyProperty;
29533 @dynamic MyProperty, AnotherProperty;
29535 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29536 for C. Keep them in sync.
29537 */
29538 static void
29540 {
29542 location_t loc;
29547 {
29548 tree property;
29551 {
29554 }
29558 else
29560 }
29563 }
29565 \f
29566 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29568 /* Returns name of the next clause.
29569 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29570 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29571 returned and the token is consumed. */
29573 static pragma_omp_clause
29575 {
29591 {
29596 {
29779 }
29780 }
29786 }
29788 /* Validate that a clause of the given type does not already exist. */
29790 static void
29793 {
29794 tree c;
29798 {
29801 }
29802 }
29804 /* OpenMP 2.5:
29805 variable-list:
29806 identifier
29807 variable-list , identifier
29809 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
29810 colon). An opening parenthesis will have been consumed by the caller.
29812 If KIND is nonzero, create the appropriate node and install the decl
29813 in OMP_CLAUSE_DECL and add the node to the head of the list.
29815 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
29816 return the list created.
29818 COLON can be NULL if only closing parenthesis should end the list,
29819 or pointer to bool which will receive false if the list is terminated
29820 by closing parenthesis or true if the list is terminated by colon. */
29822 static tree
29825 {
29829 {
29832 }
29834 {
29839 && current_class_ptr
29841 {
29847 }
29848 else
29849 {
29862 }
29864 ;
29866 {
29868 {
29871 {
29875 }
29876 /* FALLTHROUGH. */
29881 {
29882 location_t loc
29886 decl
29890 }
29891 /* FALLTHROUGH. */
29895 {
29903 parser->colon_corrects_to_scope_p
29907 else
29908 {
29909 /* Look for `:'. */
29913 CPP_CLOSE_SQUARE))
29915 }
29916 /* Look for the closing `]'. */
29918 RT_CLOSE_SQUARE))
29922 {
29925 {
29929 }
29933 {
29937 }
29938 }
29941 }
29945 }
29951 }
29952 else
29955 get_comma:
29959 }
29965 {
29969 }
29972 {
29975 /* Try to resync to an unnested comma. Copied from
29976 cp_parser_parenthesized_expression_list. */
29977 skip_comma:
29986 }
29989 }
29991 /* Similarly, but expect leading and trailing parenthesis. This is a very
29992 common case for omp clauses. */
29994 static tree
29996 {
30000 }
30002 /* OpenACC 2.0:
30003 copy ( variable-list )
30004 copyin ( variable-list )
30005 copyout ( variable-list )
30006 create ( variable-list )
30007 delete ( variable-list )
30008 present ( variable-list )
30009 present_or_copy ( variable-list )
30010 pcopy ( variable-list )
30011 present_or_copyin ( variable-list )
30012 pcopyin ( variable-list )
30013 present_or_copyout ( variable-list )
30014 pcopyout ( variable-list )
30015 present_or_create ( variable-list )
30016 pcreate ( variable-list ) */
30018 static tree
30020 tree list)
30021 {
30024 {
30070 }
30078 }
30080 /* OpenACC 2.0:
30081 deviceptr ( variable-list ) */
30083 static tree
30085 {
30089 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30090 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30091 variable-list must only allow for pointer variables. */
30094 {
30097 /* FIXME diagnostics: Ideally we should keep individual
30098 locations for all the variables in the var list to make the
30099 following errors more precise. Perhaps
30100 c_parser_omp_var_list_parens should construct a list of
30101 locations to go along with the var list. */
30106 ;
30115 }
30118 }
30120 /* OpenACC 2.0:
30121 auto
30122 independent
30123 nohost
30124 seq */
30126 static tree
30130 {
30135 }
30137 /* OpenACC:
30138 num_gangs ( expression )
30139 num_workers ( expression )
30140 vector_length ( expression ) */
30142 static tree
30145 {
30155 {
30160 }
30168 }
30170 /* OpenACC:
30172 gang [( gang-arg-list )]
30173 worker [( [num:] int-expr )]
30174 vector [( [length:] int-expr )]
30176 where gang-arg is one of:
30178 [num:] int-expr
30179 static: size-expr
30181 and size-expr may be:
30183 *
30184 int-expr
30185 */
30187 static tree
30190 {
30200 {
30203 do
30204 {
30208 /* Gang static argument. */
30211 {
30219 {
30222 }
30224 /* Check for the '*' argument. */
30228 CPP_CLOSE_PAREN)))
30229 {
30234 {
30237 }
30239 }
30240 }
30241 /* Worker num: argument and vector length: arguments. */
30245 {
30248 }
30250 /* Now collect the actual argument. */
30252 {
30255 }
30267 {
30270 }
30272 }
30277 }
30291 cleanup_error:
30294 }
30296 /* OpenACC 2.0:
30297 tile ( size-expr-list ) */
30299 static tree
30301 {
30310 do
30311 {
30315 {
30318 }
30319 else
30329 }
30332 /* Consume the trailing ')'. */
30340 }
30342 /* OpenACC 2.0
30343 Parse wait clause or directive parameters. */
30345 static tree
30347 {
30357 {
30362 }
30369 {
30373 {
30376 else
30377 {
30384 }
30385 }
30386 }
30389 }
30391 /* OpenACC:
30392 wait ( int-expr-list ) */
30394 static tree
30396 {
30405 }
30407 /* OpenMP 3.0:
30408 collapse ( constant-expression ) */
30410 static tree
30412 {
30414 location_t loc;
30415 HOST_WIDE_INT n;
30435 {
30438 }
30446 }
30448 /* OpenMP 2.5:
30449 default ( shared | none )
30451 OpenACC 2.0
30452 default (none) */
30454 static tree
30457 {
30459 tree c;
30464 {
30469 {
30484 }
30487 }
30488 else
30489 {
30490 invalid_kind:
30493 else
30495 }
30511 }
30513 /* OpenMP 3.1:
30514 final ( expression ) */
30516 static tree
30518 {
30539 }
30541 /* OpenMP 2.5:
30542 if ( expression )
30544 OpenMP 4.5:
30545 if ( directive-name-modifier : expression )
30547 directive-name-modifier:
30548 parallel | task | taskloop | target data | target | target update
30549 | target enter data | target exit data */
30551 static tree
30554 {
30562 {
30574 {
30577 {
30590 else
30591 {
30592 location_t loc
30597 }
30600 {
30602 {
30607 }
30609 {
30610 location_t loc
30614 }
30615 }
30616 }
30617 }
30619 {
30621 {
30624 }
30625 else
30626 {
30628 {
30629 location_t loc
30632 }
30634 }
30635 }
30636 }
30648 {
30651 {
30654 {
30664 }
30666 p);
30668 }
30670 {
30673 else
30676 }
30679 {
30683 }
30684 }
30692 }
30694 /* OpenMP 3.1:
30695 mergeable */
30697 static tree
30700 {
30701 tree c;
30704 location);
30709 }
30711 /* OpenMP 2.5:
30712 nowait */
30714 static tree
30717 {
30718 tree c;
30725 }
30727 /* OpenMP 2.5:
30728 num_threads ( expression ) */
30730 static tree
30732 location_t location)
30733 {
30755 }
30757 /* OpenMP 4.5:
30758 num_tasks ( expression ) */
30760 static tree
30762 location_t location)
30763 {
30785 }
30787 /* OpenMP 4.5:
30788 grainsize ( expression ) */
30790 static tree
30792 location_t location)
30793 {
30815 }
30817 /* OpenMP 4.5:
30818 priority ( expression ) */
30820 static tree
30822 location_t location)
30823 {
30845 }
30847 /* OpenMP 4.5:
30848 hint ( expression ) */
30850 static tree
30852 location_t location)
30853 {
30874 }
30876 /* OpenMP 4.5:
30877 defaultmap ( tofrom : scalar ) */
30879 static tree
30881 location_t location)
30882 {
30890 {
30893 }
30897 {
30900 }
30906 {
30909 }
30913 {
30916 }
30922 location);
30928 out_err:
30933 }
30935 /* OpenMP 2.5:
30936 ordered
30938 OpenMP 4.5:
30939 ordered ( constant-expression ) */
30941 static tree
30944 {
30946 HOST_WIDE_INT n;
30952 {
30969 {
30971 "ordered argument needs positive constant integer "
30974 }
30975 }
30981 }
30983 /* OpenMP 2.5:
30984 reduction ( reduction-operator : variable-list )
30986 reduction-operator:
30987 One of: + * - & ^ | && ||
30989 OpenMP 3.1:
30991 reduction-operator:
30992 One of: + * - & ^ | && || min max
30994 OpenMP 4.0:
30996 reduction-operator:
30997 One of: + * - & ^ | && ||
30998 id-expression */
31000 static tree
31002 {
31010 {
31020 }
31024 else
31025 {
31036 {
31066 }
31067 else
31068 {
31070 resync_fail:
31075 }
31076 }
31082 NULL);
31084 {
31087 }
31090 }
31092 /* OpenMP 2.5:
31093 schedule ( schedule-kind )
31094 schedule ( schedule-kind , expression )
31096 schedule-kind:
31097 static | dynamic | guided | runtime | auto
31099 OpenMP 4.5:
31100 schedule ( schedule-modifier : schedule-kind )
31101 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31103 schedule-modifier:
31104 simd
31105 monotonic
31106 nonmonotonic */
31108 static tree
31110 {
31120 {
31129 else
31135 else
31136 {
31139 }
31140 }
31143 {
31148 {
31169 }
31170 }
31175 else
31181 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31183 {
31187 }
31190 {
31205 else
31210 }
31222 invalid_kind:
31224 resync_fail:
31229 }
31231 /* OpenMP 3.0:
31232 untied */
31234 static tree
31237 {
31238 tree c;
31245 }
31247 /* OpenMP 4.0:
31248 inbranch
31249 notinbranch */
31251 static tree
31254 {
31259 }
31261 /* OpenMP 4.0:
31262 parallel
31263 for
31264 sections
31265 taskgroup */
31267 static tree
31271 {
31275 }
31277 /* OpenMP 4.5:
31278 nogroup */
31280 static tree
31283 {
31288 }
31290 /* OpenMP 4.5:
31291 simd
31292 threads */
31294 static tree
31298 {
31303 }
31305 /* OpenMP 4.0:
31306 num_teams ( expression ) */
31308 static tree
31310 location_t location)
31311 {
31333 }
31335 /* OpenMP 4.0:
31336 thread_limit ( expression ) */
31338 static tree
31340 location_t location)
31341 {
31363 }
31365 /* OpenMP 4.0:
31366 aligned ( variable-list )
31367 aligned ( variable-list : constant-expression ) */
31369 static tree
31371 {
31382 {
31392 }
31398 }
31400 /* OpenMP 4.0:
31401 linear ( variable-list )
31402 linear ( variable-list : expression )
31404 OpenMP 4.5:
31405 linear ( modifier ( variable-list ) )
31406 linear ( modifier ( variable-list ) : expression ) */
31408 static tree
31411 {
31421 {
31433 else
31435 }
31440 else
31441 {
31450 }
31453 {
31458 {
31469 {
31472 }
31475 }
31480 {
31483 }
31491 }
31494 {
31497 }
31500 }
31502 /* OpenMP 4.0:
31503 safelen ( constant-expression ) */
31505 static tree
31507 location_t location)
31508 {
31529 }
31531 /* OpenMP 4.0:
31532 simdlen ( constant-expression ) */
31534 static tree
31536 location_t location)
31537 {
31558 }
31560 /* OpenMP 4.5:
31561 vec:
31562 identifier [+/- integer]
31563 vec , identifier [+/- integer]
31564 */
31566 static tree
31568 tree list)
31569 {
31573 {
31576 }
31579 {
31586 else
31587 {
31588 t = cp_parser_lookup_name_simple
31593 id_loc);
31594 }
31600 {
31603 }
31607 {
31610 }
31614 {
31617 }
31620 add_to_vector:
31622 {
31626 }
31632 }
31635 {
31641 }
31643 }
31645 /* OpenMP 4.0:
31646 depend ( depend-kind : variable-list )
31648 depend-kind:
31649 in | out | inout
31651 OpenMP 4.5:
31652 depend ( source )
31654 depend ( sink : vec ) */
31656 static tree
31658 {
31666 {
31680 else
31682 }
31683 else
31689 {
31699 }
31706 else
31707 {
31713 }
31716 invalid_kind:
31718 resync_fail:
31723 }
31725 /* OpenMP 4.0:
31726 map ( map-kind : variable-list )
31727 map ( variable-list )
31729 map-kind:
31730 alloc | to | from | tofrom
31732 OpenMP 4.5:
31733 map-kind:
31734 alloc | to | from | tofrom | release | delete
31736 map ( always [,] map-kind: variable-list ) */
31738 static tree
31740 {
31749 {
31754 {
31757 nth++;
31763 {
31768 }
31769 }
31770 }
31774 {
31788 else
31789 {
31795 }
31798 }
31801 {
31805 }
31808 NULL);
31814 }
31816 /* OpenMP 4.0:
31817 device ( expression ) */
31819 static tree
31821 location_t location)
31822 {
31844 }
31846 /* OpenMP 4.0:
31847 dist_schedule ( static )
31848 dist_schedule ( static , expression ) */
31850 static tree
31852 location_t location)
31853 {
31866 {
31877 }
31882 location);
31886 invalid_kind:
31888 resync_fail:
31893 }
31895 /* OpenMP 4.0:
31896 proc_bind ( proc-bind-kind )
31898 proc-bind-kind:
31899 master | close | spread */
31901 static tree
31903 location_t location)
31904 {
31905 tree c;
31912 {
31922 else
31924 }
31925 else
31934 location);
31939 invalid_kind:
31941 resync_fail:
31946 }
31948 /* OpenACC:
31949 async [( int-expr )] */
31951 static tree
31953 {
31960 {
31969 }
31979 }
31981 /* Parse all OpenACC clauses. The set clauses allowed by the directive
31982 is a bitmask in MASK. Return the list of clauses found. */
31984 static tree
31988 {
31993 {
31994 location_t here;
31995 pragma_omp_clause c_kind;
31996 omp_clause_code code;
32007 {
32059 clauses);
32077 OMP_CLAUSE_INDEPENDENT,
32089 clauses);
32095 clauses);
32119 clauses);
32141 clauses);
32153 clauses);
32167 }
32172 {
32173 /* Remove the invalid clause(s) from the list to avoid
32174 confusing the rest of the compiler. */
32177 }
32178 }
32180 saw_error:
32187 }
32189 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32190 is a bitmask in MASK. Return the list of clauses found; the result
32191 of clause default goes in *pdefault. */
32193 static tree
32197 {
32203 {
32204 pragma_omp_clause c_kind;
32215 {
32227 clauses);
32241 clauses);
32261 clauses);
32266 clauses);
32276 clauses);
32310 clauses);
32324 clauses);
32341 OMP_CLAUSE_NOTINBRANCH,
32350 {
32351 clause_not_first:
32355 }
32385 clauses);
32386 else
32396 clauses);
32414 {
32422 }
32465 clauses
32471 clauses
32483 }
32488 {
32489 /* Remove the invalid clause(s) from the list to avoid
32490 confusing the rest of the compiler. */
32493 }
32494 }
32495 saw_error:
32496 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32497 no reason to skip to the end. */
32501 {
32504 else
32506 }
32508 }
32510 /* OpenMP 2.5:
32511 structured-block:
32512 statement
32514 In practice, we're also interested in adding the statement to an
32515 outer node. So it is convenient if we work around the fact that
32516 cp_parser_statement calls add_stmt. */
32518 static unsigned
32520 {
32523 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32524 This preserves the "not within loop or switch" style error messages
32525 for nonsense cases like
32526 void foo() {
32527 #pragma omp single
32528 break;
32529 }
32530 */
32535 }
32537 static void
32539 {
32541 }
32543 static tree
32545 {
32553 }
32555 /* OpenMP 2.5:
32556 # pragma omp atomic new-line
32557 expression-stmt
32559 expression-stmt:
32560 x binop= expr | x++ | ++x | x-- | --x
32561 binop:
32562 +, *, -, /, &, ^, |, <<, >>
32564 where x is an lvalue expression with scalar type.
32566 OpenMP 3.1:
32567 # pragma omp atomic new-line
32568 update-stmt
32570 # pragma omp atomic read new-line
32571 read-stmt
32573 # pragma omp atomic write new-line
32574 write-stmt
32576 # pragma omp atomic update new-line
32577 update-stmt
32579 # pragma omp atomic capture new-line
32580 capture-stmt
32582 # pragma omp atomic capture new-line
32583 capture-block
32585 read-stmt:
32586 v = x
32587 write-stmt:
32588 x = expr
32589 update-stmt:
32590 expression-stmt | x = x binop expr
32591 capture-stmt:
32592 v = expression-stmt
32593 capture-block:
32594 { v = x; update-stmt; } | { update-stmt; v = x; }
32596 OpenMP 4.0:
32597 update-stmt:
32598 expression-stmt | x = x binop expr | x = expr binop x
32599 capture-stmt:
32600 v = update-stmt
32601 capture-block:
32602 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32604 where x and v are lvalue expressions with scalar type. */
32606 static void
32608 {
32616 {
32621 {
32627 }
32628 }
32630 {
32642 else
32646 }
32648 {
32654 {
32659 {
32662 }
32663 }
32664 }
32668 {
32678 else
32683 {
32684 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32685 opcode. */
32690 }
32694 {
32697 }
32698 else
32699 {
32705 }
32708 }
32710 restart:
32714 {
32721 /* FALLTHROUGH */
32731 /* FALLTHROUGH */
32746 /* Undo effects of boolean_increment for post {in,de}crement. */
32748 /* FALLTHRU */
32752 {
32753 /* Undo effects of boolean_increment. */
32755 {
32756 /* This is pre or post increment. */
32761 && !structured_block
32765 }
32766 }
32767 /* FALLTHRU */
32770 {
32805 {
32809 }
32812 {
32818 {
32823 }
32825 {
32837 {
32839 {
32844 }
32845 else
32847 }
32851 }
32854 {
32861 }
32865 }
32869 {
32872 {
32880 }
32882 {
32887 }
32922 }
32933 /* FALLTHROUGH */
32938 }
32945 }
32946 stmt_done:
32948 {
32959 }
32961 {
32964 }
32965 done:
32971 saw_error:
32974 {
32978 {
32982 }
32983 }
32984 }
32987 /* OpenMP 2.5:
32988 # pragma omp barrier new-line */
32990 static void
32992 {
32995 }
32997 /* OpenMP 2.5:
32998 # pragma omp critical [(name)] new-line
32999 structured-block
33001 OpenMP 4.5:
33002 # pragma omp critical [(name) [hint(expression)]] new-line
33003 structured-block */
33005 #define OMP_CRITICAL_CLAUSE_MASK \
33006 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33008 static tree
33010 {
33014 {
33028 OMP_CRITICAL_CLAUSE_MASK,
33030 }
33031 else
33036 }
33038 /* OpenMP 2.5:
33039 # pragma omp flush flush-vars[opt] new-line
33041 flush-vars:
33042 ( variable-list ) */
33044 static void
33046 {
33052 }
33054 /* Helper function, to parse omp for increment expression. */
33056 static tree
33058 {
33063 {
33066 }
33069 {
33078 /* Fall through: OpenMP disallows NE_EXPR. */
33081 }
33083 /* If decl is an iterator, preserve LHS and RHS of the relational
33084 expr until finish_omp_for. */
33095 }
33097 /* Helper function, to parse omp for increment expression. */
33099 static tree
33101 {
33105 cp_id_kind idk;
33109 {
33118 }
33127 {
33132 }
33139 {
33143 }
33156 do
33157 {
33164 {
33166 {
33169 else
33171 tf_warning_or_error);
33172 }
33173 else
33176 }
33177 }
33181 {
33187 }
33188 else
33192 }
33194 /* Parse the initialization statement of either an OpenMP for loop or
33195 a Cilk Plus for loop.
33197 Return true if the resulting construct should have an
33198 OMP_CLAUSE_PRIVATE added to it. */
33200 static tree
33209 {
33215 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33217 init-expr:
33218 var = lb
33219 integer-type var = lb
33220 random-access-iterator-type var = lb
33221 pointer-type var = lb
33222 */
33223 cp_decl_specifier_seq type_specifiers;
33225 /* First, try to parse as an initialized declaration. See
33226 cp_parser_condition, from whence the bulk of this is copied. */
33233 {
33234 /* If parsing a type specifier seq succeeded, then this
33235 MUST be a initialized declaration. */
33240 CP_PARSER_DECLARATOR_NAMED,
33251 else
33252 {
33262 {
33264 CPP_OPEN_PAREN))
33265 {
33269 else
33272 }
33273 else
33274 /* Trigger an error. */
33279 }
33283 {
33291 {
33294 auto_node);
33299 }
33302 asm_specification,
33303 LOOKUP_ONLYCONVERTING);
33306 {
33309 }
33310 else
33313 }
33314 else
33315 {
33316 /* Consume '='. */
33320 non_class:
33323 else
33326 asm_specification,
33327 LOOKUP_ONLYCONVERTING);
33328 }
33332 }
33333 }
33334 else
33335 {
33336 cp_id_kind idk;
33337 /* If parsing a type specifier sequence failed, then
33338 this MUST be a simple expression. */
33347 && decl
33350 {
33361 {
33366 }
33371 }
33373 && decl
33376 {
33377 tree rhs;
33385 rhs,
33386 tf_warning_or_error));
33389 }
33390 else
33391 {
33396 {
33400 }
33401 }
33402 }
33404 }
33406 /* Parse the restricted form of the for statement allowed by OpenMP. */
33408 static tree
33411 {
33415 location_t loc_first;
33426 {
33429 }
33432 {
33438 }
33440 {
33443 {
33445 "%<linear%> clause may not be specified together "
33448 }
33449 else
33451 }
33464 {
33467 location_t loc;
33471 {
33474 }
33477 {
33480 }
33489 add_private_clause
33496 {
33499 {
33505 }
33506 else
33508 }
33515 {
33520 {
33524 }
33527 {
33528 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33532 {
33535 }
33536 else
33537 {
33540 }
33542 }
33543 else
33544 {
33549 }
33550 }
33553 {
33554 tree c;
33556 {
33565 decl);
33569 decl);
33570 }
33572 {
33577 else
33582 {
33585 /* For linear, signal that we need to fill up
33586 the so far unknown linear step. */
33589 }
33590 }
33591 }
33600 {
33601 /* If decl is an iterator, preserve the operator on decl
33602 until finish_omp_for. */
33604 && ((processing_template_decl
33609 else
33613 }
33625 {
33628 }
33633 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33634 in between the collapsed for loops to be still considered perfectly
33635 nested. Hopefully the final version clarifies this.
33636 For now handle (multiple) {'s and empty statements. */
33638 do
33639 {
33643 {
33645 bracecount++;
33646 }
33650 else
33651 {
33658 }
33659 }
33663 {
33666 }
33667 }
33669 /* Note that we saved the original contents of this flag when we entered
33670 the structured block, and so we don't need to re-save it here. */
33673 else
33676 /* Note that the grammar doesn't call for a structured block here,
33677 though the loop as a whole is a structured block. */
33684 else
33689 {
33691 {
33693 nbraces--;
33694 }
33697 else
33698 {
33700 {
33703 }
33708 }
33709 }
33716 }
33718 /* Helper function for OpenMP parsing, split clauses and call
33719 finish_omp_clauses on each of the set of clauses afterwards. */
33721 static void
33724 {
33730 }
33732 /* OpenMP 4.0:
33733 #pragma omp simd simd-clause[optseq] new-line
33734 for-loop */
33736 #define OMP_SIMD_CLAUSE_MASK \
33737 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
33738 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33739 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33740 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33741 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33742 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33743 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33744 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33746 static tree
33749 {
33760 {
33764 OMP_CLAUSE_ORDERED);
33766 {
33768 "%<ordered%> clause with parameter may not be specified "
33771 }
33772 }
33783 }
33785 /* OpenMP 2.5:
33786 #pragma omp for for-clause[optseq] new-line
33787 for-loop
33789 OpenMP 4.0:
33790 #pragma omp for simd for-simd-clause[optseq] new-line
33791 for-loop */
33793 #define OMP_FOR_CLAUSE_MASK \
33794 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
33800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
33801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
33802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33804 static tree
33807 {
33816 /* Composite distribute parallel for{, simd} disallows ordered clause. */
33821 {
33826 {
33834 cclauses);
33838 cclauses);
33850 }
33851 }
33853 {
33856 }
33858 /* Composite distribute parallel for disallows linear clause. */
33865 {
33868 }
33879 }
33881 /* OpenMP 2.5:
33882 # pragma omp master new-line
33883 structured-block */
33885 static tree
33887 {
33891 }
33893 /* OpenMP 2.5:
33894 # pragma omp ordered new-line
33895 structured-block
33897 OpenMP 4.5:
33898 # pragma omp ordered ordered-clauses new-line
33899 structured-block */
33901 #define OMP_ORDERED_CLAUSE_MASK \
33902 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
33903 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
33905 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
33906 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
33908 static bool
33911 {
33915 {
33919 }
33922 {
33927 {
33929 {
33931 "%<depend%> clause may only be used in compound "
33935 }
33936 tree clauses
33938 OMP_ORDERED_DEPEND_CLAUSE_MASK,
33942 }
33943 }
33945 tree clauses
33951 }
33953 /* OpenMP 2.5:
33955 section-scope:
33956 { section-sequence }
33958 section-sequence:
33959 section-directive[opt] structured-block
33960 section-sequence section-directive structured-block */
33962 static tree
33964 {
33976 {
33980 }
33983 {
33991 {
33995 }
33997 {
34000 }
34005 }
34016 }
34018 /* OpenMP 2.5:
34019 # pragma omp sections sections-clause[optseq] newline
34020 sections-scope */
34022 #define OMP_SECTIONS_CLAUSE_MASK \
34023 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34029 static tree
34032 {
34044 {
34047 }
34054 }
34056 /* OpenMP 2.5:
34057 # pragma omp parallel parallel-clause[optseq] new-line
34058 structured-block
34059 # pragma omp parallel for parallel-for-clause[optseq] new-line
34060 structured-block
34061 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34062 structured-block
34064 OpenMP 4.0:
34065 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34066 structured-block */
34068 #define OMP_PARALLEL_CLAUSE_MASK \
34069 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34072 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34073 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34079 static tree
34082 {
34089 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34095 {
34108 block);
34113 }
34114 /* When combined with distribute, parallel has to be followed by for.
34115 #pragma omp target parallel is allowed though. */
34119 {
34123 }
34125 {
34128 }
34130 {
34134 {
34144 block);
34147 }
34148 }
34152 {
34155 }
34163 }
34165 /* OpenMP 2.5:
34166 # pragma omp single single-clause[optseq] new-line
34167 structured-block */
34169 #define OMP_SINGLE_CLAUSE_MASK \
34170 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34171 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34172 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34173 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34175 static tree
34177 {
34187 }
34189 /* OpenMP 3.0:
34190 # pragma omp task task-clause[optseq] new-line
34191 structured-block */
34193 #define OMP_TASK_CLAUSE_MASK \
34194 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34195 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34196 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34197 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34198 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34199 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34200 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34201 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34202 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34203 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34205 static tree
34207 {
34218 }
34220 /* OpenMP 3.0:
34221 # pragma omp taskwait new-line */
34223 static void
34225 {
34228 }
34230 /* OpenMP 3.1:
34231 # pragma omp taskyield new-line */
34233 static void
34235 {
34238 }
34240 /* OpenMP 4.0:
34241 # pragma omp taskgroup new-line
34242 structured-block */
34244 static tree
34246 {
34250 }
34253 /* OpenMP 2.5:
34254 # pragma omp threadprivate (variable-list) */
34256 static void
34258 {
34259 tree vars;
34265 }
34267 /* OpenMP 4.0:
34268 # pragma omp cancel cancel-clause[optseq] new-line */
34270 #define OMP_CANCEL_CLAUSE_MASK \
34271 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34277 static void
34279 {
34283 }
34285 /* OpenMP 4.0:
34286 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34288 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34289 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34290 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34291 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34292 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34294 static void
34296 {
34297 tree clauses;
34301 {
34306 {
34309 }
34310 }
34312 {
34316 }
34319 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34321 pragma_tok);
34323 }
34325 /* OpenMP 4.0:
34326 #pragma omp distribute distribute-clause[optseq] new-line
34327 for-loop */
34329 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34330 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34336 static tree
34339 {
34348 {
34356 else
34359 {
34365 {
34368 cclauses);
34369 else
34371 cclauses);
34372 }
34377 cclauses);
34378 else
34380 cclauses);
34392 }
34393 }
34395 {
34398 }
34403 {
34406 }
34417 }
34419 /* OpenMP 4.0:
34420 # pragma omp teams teams-clause[optseq] new-line
34421 structured-block */
34423 #define OMP_TEAMS_CLAUSE_MASK \
34424 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34425 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34426 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34427 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34432 static tree
34435 {
34444 {
34448 {
34456 cclauses);
34460 cclauses);
34472 }
34473 }
34475 {
34478 }
34483 {
34486 }
34494 }
34496 /* OpenMP 4.0:
34497 # pragma omp target data target-data-clause[optseq] new-line
34498 structured-block */
34500 #define OMP_TARGET_DATA_CLAUSE_MASK \
34501 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34502 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34506 static tree
34508 {
34509 tree clauses
34514 {
34517 {
34534 "%<#pragma omp target data%> with map-type other "
34535 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34539 }
34541 }
34544 {
34547 "%<#pragma omp target data%> must contain at least "
34550 }
34561 }
34563 /* OpenMP 4.5:
34564 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34565 structured-block */
34567 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34568 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34569 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34570 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34571 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34572 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34574 static tree
34577 {
34580 {
34585 {
34588 }
34589 }
34591 {
34595 }
34598 {
34600 "%<#pragma omp target enter data%> may only be "
34604 }
34606 tree clauses
34611 {
34614 {
34627 "%<#pragma omp target enter data%> with map-type other "
34631 }
34633 }
34636 {
34639 "%<#pragma omp target enter data%> must contain at least "
34642 }
34649 }
34651 /* OpenMP 4.5:
34652 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34653 structured-block */
34655 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34656 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34658 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34659 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34660 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34662 static tree
34665 {
34668 {
34673 {
34676 }
34677 }
34679 {
34683 }
34686 {
34688 "%<#pragma omp target exit data%> may only be "
34692 }
34694 tree clauses
34699 {
34702 {
34716 "%<#pragma omp target exit data%> with map-type other "
34717 "than %<from%>, %<release%> or %<delete%> on %<map%>"
34721 }
34723 }
34726 {
34729 "%<#pragma omp target exit data%> must contain at least "
34732 }
34739 }
34741 /* OpenMP 4.0:
34742 # pragma omp target update target-update-clause[optseq] new-line */
34744 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
34745 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
34746 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
34747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34752 static bool
34755 {
34757 {
34759 "%<#pragma omp target update%> may only be "
34763 }
34765 tree clauses
34770 {
34772 "%<#pragma omp target update%> must contain at least one "
34775 }
34783 }
34785 /* OpenMP 4.0:
34786 # pragma omp target target-clause[optseq] new-line
34787 structured-block */
34789 #define OMP_TARGET_CLAUSE_MASK \
34790 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34791 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34792 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34793 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34794 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34795 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34796 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34797 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
34798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
34800 static bool
34803 {
34807 {
34811 }
34814 {
34826 {
34834 {
34835 tree stmt;
34837 {
34840 OMP_TARGET_CLAUSE_MASK,
34841 cclauses);
34845 OMP_TARGET_CLAUSE_MASK,
34846 cclauses);
34850 OMP_TARGET_CLAUSE_MASK,
34851 cclauses);
34855 }
34857 }
34862 {
34877 }
34883 {
34884 /* For combined target teams, ensure the num_teams and
34885 thread_limit clause expressions are evaluated on the host,
34886 before entering the target construct. */
34887 tree c;
34893 {
34902 OMP_CLAUSE_FIRSTPRIVATE);
34907 }
34908 }
34917 }
34919 {
34922 }
34924 {
34928 }
34930 {
34934 }
34936 {
34940 }
34942 {
34945 }
34946 }
34961 check_clauses:
34963 {
34966 {
34980 "%<#pragma omp target%> with map-type other "
34981 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34985 }
34987 }
34989 }
34991 /* OpenACC 2.0:
34992 # pragma acc cache (variable-list) new-line
34993 */
34995 static tree
34997 {
35012 }
35014 /* OpenACC 2.0:
35015 # pragma acc data oacc-data-clause[optseq] new-line
35016 structured-block */
35018 #define OACC_DATA_CLAUSE_MASK \
35019 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35023 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35024 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35025 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35026 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35027 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35031 static tree
35033 {
35046 }
35048 /* OpenACC 2.0:
35049 # pragma acc host_data <clauses> new-line
35050 structured-block */
35052 #define OACC_HOST_DATA_CLAUSE_MASK \
35053 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35055 static tree
35057 {
35070 }
35072 /* OpenACC 2.0:
35073 # pragma acc declare oacc-data-clause[optseq] new-line
35074 */
35076 #define OACC_DECLARE_CLAUSE_MASK \
35077 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35090 static tree
35092 {
35101 {
35105 }
35108 {
35112 {
35116 }
35119 {
35127 /* Generated by c_finish_omp_clauses from array sections;
35128 avoid spurious diagnostics. */
35135 {
35137 "%qD must be a global variable in"
35139 decl);
35142 }
35147 {
35151 }
35153 {
35155 "invalid use of %<extern%> variable %qD "
35159 }
35161 {
35163 "invalid use of %<global%> variable %qD "
35167 }
35169 }
35174 {
35179 }
35182 {
35183 tree id;
35187 else
35193 {
35196 {
35199 {
35203 }
35204 }
35205 }
35206 }
35207 }
35220 }
35222 /* OpenACC 2.0:
35223 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35225 or
35227 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35229 LOC is the location of the #pragma token.
35230 */
35232 #define OACC_ENTER_DATA_CLAUSE_MASK \
35233 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35234 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35235 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35236 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35241 #define OACC_EXIT_DATA_CLAUSE_MASK \
35242 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35248 static tree
35251 {
35256 {
35262 }
35267 {
35271 }
35278 else
35283 {
35287 }
35295 }
35297 /* OpenACC 2.0:
35298 # pragma acc loop oacc-loop-clause[optseq] new-line
35299 structured-block */
35301 #define OACC_LOOP_CLAUSE_MASK \
35302 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35305 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35306 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35307 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35308 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35309 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35310 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35311 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35313 static tree
35316 {
35323 {
35329 }
35338 }
35340 /* OpenACC 2.0:
35341 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35342 structured-block
35344 or
35346 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35347 structured-block
35348 */
35350 #define OACC_KERNELS_CLAUSE_MASK \
35351 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35353 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35359 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35360 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35361 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35362 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35363 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35366 #define OACC_PARALLEL_CLAUSE_MASK \
35367 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35388 static tree
35391 {
35392 omp_clause_mask mask;
35395 {
35408 }
35411 {
35415 {
35420 tree clauses;
35423 }
35424 }
35433 }
35435 /* OpenACC 2.0:
35436 # pragma acc update oacc-update-clause[optseq] new-line
35437 */
35439 #define OACC_UPDATE_CLAUSE_MASK \
35440 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35443 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35444 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35445 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35447 static tree
35449 {
35456 {
35458 "%<#pragma acc update%> must contain at least one "
35461 }
35469 }
35471 /* OpenACC 2.0:
35472 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35474 LOC is the location of the #pragma token.
35475 */
35477 #define OACC_WAIT_CLAUSE_MASK \
35478 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35480 static tree
35482 {
35496 }
35498 /* OpenMP 4.0:
35499 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35501 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35502 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35503 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35504 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35505 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35506 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35507 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35509 static void
35512 {
35514 cp_omp_declare_simd_data data;
35516 {
35521 }
35532 {
35536 {
35549 }
35554 "%<#pragma omp declare simd%> not immediately followed by "
35558 }
35559 }
35561 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35562 This function is modelled similar to the late parsing of omp declare
35563 simd. */
35565 static tree
35567 {
35574 {
35576 "used in the same function marked as a Cilk Plus SIMD-enabled "
35582 }
35584 {
35588 }
35593 {
35600 NULL);
35614 }
35620 }
35622 /* Finalize #pragma omp declare simd clauses after direct declarator has
35623 been parsed, and put that into "omp declare simd" attribute. */
35625 static tree
35627 {
35633 {
35638 }
35643 {
35661 }
35665 }
35668 /* OpenMP 4.0:
35669 # pragma omp declare target new-line
35670 declarations and definitions
35671 # pragma omp end declare target new-line
35673 OpenMP 4.5:
35674 # pragma omp declare target ( extended-list ) new-line
35676 # pragma omp declare target declare-target-clauses[seq] new-line */
35678 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
35679 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
35682 static void
35684 {
35687 clauses
35691 {
35693 clauses);
35696 }
35697 else
35698 {
35702 }
35705 "%<#pragma omp declare target%> with clauses in between "
35706 "%<#pragma omp declare target%> without clauses and "
35709 {
35715 {
35718 }
35719 else
35722 {
35724 "%qD specified both in declare target %<link%> and %<to%>"
35727 }
35729 {
35733 {
35736 {
35740 }
35741 }
35742 }
35743 }
35744 }
35746 static void
35748 {
35751 {
35754 }
35756 {
35760 {
35763 }
35766 else
35767 {
35771 }
35772 }
35773 else
35774 {
35778 }
35782 "%<#pragma omp end declare target%> without corresponding "
35784 else
35786 }
35788 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
35789 expression and optional initializer clause of
35790 #pragma omp declare reduction. We store the expression(s) as
35791 either 3, 6 or 7 special statements inside of the artificial function's
35792 body. The first two statements are DECL_EXPRs for the artificial
35793 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
35794 expression that uses those variables.
35795 If there was any INITIALIZER clause, this is followed by further statements,
35796 the fourth and fifth statements are DECL_EXPRs for the artificial
35797 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
35798 constructor variant (first token after open paren is not omp_priv),
35799 then the sixth statement is a statement with the function call expression
35800 that uses the OMP_PRIV and optionally OMP_ORIG variable.
35801 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
35802 to initialize the OMP_PRIV artificial variable and there is seventh
35803 statement, a DECL_EXPR of the OMP_PRIV statement again. */
35805 static bool
35807 {
35819 tree combiner;
35834 {
35837 }
35840 {
35847 {
35850 }
35866 {
35870 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
35874 == CPP_CLOSE_PAREN
35877 {
35881 }
35886 }
35887 else
35888 {
35904 {
35909 }
35911 tree arg;
35924 }
35935 }
35941 }
35943 /* OpenMP 4.0
35944 #pragma omp declare reduction (reduction-id : typename-list : expression) \
35945 initializer-clause[opt] new-line
35947 initializer-clause:
35948 initializer (omp_priv initializer)
35949 initializer (function-name (argument-list)) */
35951 static void
35954 {
35964 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
35971 {
36003 }
36015 /* Types may not be defined in declare reduction type list. */
36018 parser->type_definition_forbidden_message
36024 saved_colon_doesnt_start_class_def_p
36029 {
36033 ;
36054 else
36059 else
36061 }
36063 /* Restore the saved message. */
36066 parser->colon_doesnt_start_class_def_p
36071 {
36072 fail:
36075 }
36081 {
36082 tree fntype
36085 NULL_TREE);
36105 {
36110 }
36112 {
36114 {
36123 }
36130 }
36131 else
36132 {
36135 }
36138 else
36141 {
36144 }
36146 {
36149 else
36154 }
36159 else
36160 {
36169 }
36176 }
36180 done:
36181 /* Free any declarators allocated. */
36183 }
36185 /* OpenMP 4.0
36186 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36187 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36188 initializer-clause[opt] new-line
36189 #pragma omp declare target new-line */
36191 static void
36194 {
36196 {
36201 {
36204 context);
36206 }
36209 {
36212 context);
36214 }
36216 {
36219 }
36221 {
36225 }
36226 }
36230 }
36232 /* OpenMP 4.5:
36233 #pragma omp taskloop taskloop-clause[optseq] new-line
36234 for-loop
36236 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36237 for-loop */
36239 #define OMP_TASKLOOP_CLAUSE_MASK \
36240 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36241 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36242 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36243 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36244 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36245 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36250 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36251 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36252 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36255 static tree
36258 {
36267 {
36272 {
36280 cclauses);
36284 cclauses);
36296 }
36297 }
36299 {
36302 }
36307 {
36310 }
36321 }
36324 /* OpenACC 2.0:
36325 # pragma acc routine oacc-routine-clause[optseq] new-line
36326 function-definition
36328 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36329 */
36331 #define OACC_ROUTINE_CLAUSE_MASK \
36332 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36335 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36338 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36339 component, which must resolve to a declared namespace-scope
36340 function. The clauses are either processed directly (for a named
36341 function), or defered until the immediatley following declaration
36342 is parsed. */
36344 static void
36347 {
36350 cp_omp_declare_simd_data data;
36352 {
36358 }
36361 /* Create a dummy claue, to record location. */
36365 {
36370 }
36372 /* Look for optional '( name )'. */
36374 {
36376 {
36385 "%<#pragma acc routine%> not followed by a "
36390 }
36395 /* We parse the name as an id-expression. If it resolves to
36396 anything other than a non-overloaded function at namespace
36397 scope, it's an error. */
36411 {
36415 }
36417 /* Build a chain of clauses. */
36422 cp_lexer_peek_token
36425 /* Force clauses to be non-null, by attaching context to it. */
36431 {
36435 }
36437 /* Perhaps we should use the same rule as declarations in different
36438 namespaces? */
36440 {
36445 }
36448 {
36453 }
36460 }
36461 else
36462 {
36481 {
36482 /* Create an empty list of clauses. */
36484 NULL_TREE);
36495 }
36496 }
36497 }
36499 /* Finalize #pragma acc routine clauses after direct declarator has
36500 been parsed, and put that into "oacc function" attribute. */
36502 static tree
36504 {
36508 location_t loc;
36514 {
36519 }
36536 /* Force clauses to be non-null, by attaching context to it. */
36541 }
36543 /* Apply any saved OpenACC routine clauses to a just-parsed
36544 declaration. */
36546 static void
36548 {
36550 {
36558 {
36561 }
36564 {
36567 }
36570 {
36572 "%<#pragma acc routine%> not followed by a function "
36575 }
36578 {
36580 fndecl);
36582 }
36585 {
36589 }
36591 /* Process for function attrib */
36595 /* Add an "omp target" attribute. */
36599 }
36600 }
36602 /* Main entry point to OpenMP statement pragmas. */
36604 static void
36606 {
36607 tree stmt;
36612 {
36694 }
36697 }
36698 \f
36699 /* Transactional Memory parsing routines. */
36701 /* Parse a transaction attribute.
36703 txn-attribute:
36704 attribute
36705 [ [ identifier ] ]
36707 We use this instead of cp_parser_attributes_opt for transactions to avoid
36708 the pedwarn in C++98 mode. */
36710 static tree
36712 {
36727 {
36731 /* For keywords, use the canonical spelling,
36732 not the parsed identifier. */
36736 }
36737 else
36741 error1:
36744 }
36746 /* Parse a __transaction_atomic or __transaction_relaxed statement.
36748 transaction-statement:
36749 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
36750 compound-statement
36751 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
36752 */
36754 static tree
36756 {
36767 else
36768 {
36772 }
36774 /* Parse a noexcept specification. */
36778 {
36779 /* cancel-and-throw is unimplemented. */
36782 }
36783 else
36786 /* Keep track if we're in the lexical scope of an outer transaction. */
36798 }
36800 /* Parse a __transaction_atomic or __transaction_relaxed expression.
36802 transaction-expression:
36803 __transaction_atomic txn-noexcept-spec[opt] ( expression )
36804 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
36805 */
36807 static tree
36809 {
36822 keyword == RID_TRANSACTION_RELAXED
36836 /* Set this early. This might mean that we allow transaction_cancel in
36837 an expression that we find out later actually has to be a constexpr.
36838 However, we expect that cxx_constant_value will be able to deal with
36839 this; also, if the noexcept has no constexpr, then what we parse next
36840 really is a transaction's body. */
36843 /* Parse a noexcept specification. */
36849 {
36856 }
36857 else
36858 {
36859 /* The only expression that is available got parsed for the noexcept
36860 already. noexcept is true then. */
36863 }
36872 }
36874 /* Parse a function-transaction-block.
36876 function-transaction-block:
36877 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
36878 function-body
36879 __transaction_atomic txn-attribute[opt] function-try-block
36880 __transaction_relaxed ctor-initializer[opt] function-body
36881 __transaction_relaxed function-try-block
36882 */
36884 static bool
36886 {
36902 else
36903 {
36907 }
36915 else
36916 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
36924 }
36926 /* Parse a __transaction_cancel statement.
36928 cancel-statement:
36929 __transaction_cancel txn-attribute[opt] ;
36930 __transaction_cancel txn-attribute[opt] throw-expression ;
36932 ??? Cancel and throw is not yet implemented. */
36934 static tree
36936 {
36942 RT_TRANSACTION_CANCEL);
36949 /* ??? Parse cancel-and-throw here. */
36954 {
36958 }
36960 {
36964 }
36966 {
36969 {
36975 }
36976 }
36978 {
36982 }
36988 }
36989 \f
36990 /* The parser. */
36994 \f
36995 /* Special handling for the first token or line in the file. The first
36996 thing in the file might be #pragma GCC pch_preprocess, which loads a
36997 PCH file, which is a GC collection point. So we need to handle this
36998 first pragma without benefit of an existing lexer structure.
37000 Always returns one token to the caller in *FIRST_TOKEN. This is
37001 either the true first token of the file, or the first token after
37002 the initial pragma. */
37004 static void
37006 {
37015 {
37022 }
37023 else
37026 /* Skip to the end of the pragma. */
37030 /* Now actually load the PCH file. */
37034 /* Read one more token to return to our caller. We have to do this
37035 after reading the PCH file in, since its pointers have to be
37036 live. */
37038 }
37040 /* Parses the grainsize pragma for the _Cilk_for statement.
37041 Syntax:
37042 #pragma cilk grainsize = <VALUE>. */
37044 static void
37046 {
37048 {
37053 {
37056 }
37058 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37061 else
37063 "%<#pragma cilk grainsize%> is not followed by "
37066 }
37068 }
37070 /* Normal parsing of a pragma token. Here we can (and must) use the
37071 regular lexer. */
37073 static bool
37075 {
37078 tree stmt;
37089 {
37097 {
37107 }
37112 {
37122 }
37127 {
37133 "%<#pragma omp taskwait%> may only be "
37138 }
37143 {
37149 "%<#pragma omp taskyield%> may only be "
37154 }
37159 {
37165 "%<#pragma omp cancel%> may only be "
37170 }
37175 {
37181 "%<#pragma omp cancellation point%> may only be "
37186 }
37254 "%<#pragma omp section%> may only be used in "
37259 {
37261 {
37265 }
37272 {
37275 }
37278 }
37282 {
37286 }
37294 {
37298 }
37300 /* Ignore the pragma if Cilk Plus is not enabled. */
37302 {
37305 }
37306 else
37307 {
37311 }
37318 bad_stmt:
37321 }
37325 }
37327 /* The interface the pragma parsers have to the lexer. */
37329 enum cpp_ttype
37331 {
37343 else
37344 {
37348 }
37351 }
37353 \f
37354 /* External interface. */
37356 /* Parse one entire translation unit. */
37358 void
37360 {
37373 }
37375 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37376 vectorlength clause:
37377 Syntax:
37378 vectorlength ( constant-expression ) */
37380 static tree
37383 {
37385 tree expr;
37386 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37387 safelen clause. Thus, vectorlength is represented as OMP 4.0
37388 safelen. For SIMD-enabled function it is represented by OMP 4.0
37389 simdlen. */
37392 loc);
37393 else
37395 loc);
37403 /* If expr == error_mark_node, then don't emit any errors nor
37404 create a clause. if any of the above functions returns
37405 error mark node then they would have emitted an error message. */
37407 ;
37415 else
37416 {
37417 tree c;
37419 {
37424 }
37425 else
37426 {
37431 }
37432 }
37437 }
37439 /* Handles the Cilk Plus #pragma simd linear clause.
37440 Syntax:
37441 linear ( simd-linear-variable-list )
37443 simd-linear-variable-list:
37444 simd-linear-variable
37445 simd-linear-variable-list , simd-linear-variable
37447 simd-linear-variable:
37448 id-expression
37449 id-expression : simd-linear-step
37451 simd-linear-step:
37452 conditional-expression */
37454 static tree
37456 {
37462 {
37466 }
37471 {
37474 {
37478 }
37485 {
37489 }
37490 else
37491 {
37495 /* If present, parse the linear step. Otherwise, assume the default
37496 value of 1. */
37498 {
37505 {
37506 /* If an error has occurred, then the whole pragma is
37507 considered ill-formed. Thus, no reason to keep
37508 parsing. */
37511 }
37519 else
37521 "step size must be an integer constant "
37523 }
37525 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37531 }
37536 else
37537 {
37542 }
37543 }
37547 }
37549 /* Returns the name of the next clause. If the clause is not
37550 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37551 token is not consumed. Otherwise, the appropriate enum from the
37552 pragma_simd_clause is returned and the token is consumed. */
37554 static pragma_omp_clause
37556 {
37557 pragma_omp_clause clause_type;
37574 else
37579 }
37581 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37583 static tree
37585 {
37590 {
37591 pragma_omp_clause c_kind;
37598 /* Use the OpenMP 4.0 equivalent function. */
37601 /* Use the OpenMP 4.0 equivalent function. */
37603 clauses);
37605 /* Use the OMP 4.0 equivalent function. */
37607 clauses);
37609 /* Use the OMP 4.0 equivalent function. */
37611 else
37612 {
37616 }
37617 }
37623 else
37625 }
37627 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37629 static void
37631 {
37638 {
37642 }
37651 }
37653 /* Main entry-point for parsing Cilk Plus _Cilk_for
37654 loops. The return value is error_mark_node
37655 when errors happen and CILK_FOR tree on success. */
37657 static tree
37659 {
37674 else
37680 }
37682 /* Create an identifier for a generic parameter type (a synthesized
37683 template parameter implied by `auto' or a concept identifier). */
37686 static tree
37688 {
37692 }
37694 /* Predicate that behaves as is_auto_or_concept but matches the parent
37695 node of the generic type rather than the generic type itself. This
37696 allows for type transformation in add_implicit_template_parms. */
37700 {
37702 }
37704 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
37705 (creating a new template parameter list if necessary). Returns the newly
37706 created template type parm. */
37708 static tree
37710 {
37713 /* Before committing to modifying any scope, if we're in an
37714 implicit template scope, and we're trying to synthesize a
37715 constrained parameter, try to find a previous parameter with
37716 the same name. This is the same-type rule for abbreviated
37717 function templates. */
37719 {
37722 {
37724 {
37727 /* Return the TEMPLATE_PARM_INDEX. */
37730 }
37732 }
37733 }
37735 /* We are either continuing a function template that already contains implicit
37736 template parameters, creating a new fully-implicit function template, or
37737 extending an existing explicit function template with implicit template
37738 parameters. */
37746 {
37750 }
37751 else
37752 {
37753 /* Roll back to the existing template parameter scope (in the case of
37754 extending an explicit function template) or introduce a new template
37755 parameter scope ahead of the function parameter scope (or class scope
37756 in the case of out-of-line member definitions). The function scope is
37757 added back after template parameter synthesis below. */
37762 {
37765 }
37767 {
37768 /* If not defining a class, then any class scope is a scope level in
37769 an out-of-line member definition. In this case simply wind back
37770 beyond the first such scope to inject the template parameter list.
37771 Otherwise wind back to the class being defined. The latter can
37772 occur in class member friend declarations such as:
37774 class A {
37775 void foo (auto);
37776 };
37777 class B {
37778 friend void A::foo (auto);
37779 };
37781 The template parameter list synthesized for the friend declaration
37782 must be injected in the scope of 'B'. This can also occur in
37783 erroneous cases such as:
37785 struct A {
37786 struct B {
37787 void foo (auto);
37788 };
37789 void B::foo (auto) {}
37790 };
37792 Here the attempted definition of 'B::foo' within 'A' is ill-formed
37793 but, nevertheless, the template parameter list synthesized for the
37794 declarator should be injected into the scope of 'A' as if the
37795 ill-formed template was specified explicitly. */
37798 {
37801 }
37802 }
37808 {
37809 /* Introduce a new template parameter list for implicit template
37810 parameters. */
37814 parser->implicit_template_scope
37821 }
37822 else
37823 {
37824 /* Synthesize implicit template parameters at the end of the explicit
37825 template parameter list. */
37832 parser->implicit_template_parms
37834 }
37835 }
37837 /* Synthesize a new template parameter and track the current template
37838 parameter chain with implicit_template_parms. */
37842 tree synth_tmpl_parm;
37846 synth_tmpl_parm
37849 synth_tmpl_parm
37851 else
37852 {
37856 }
37858 // Attach the constraint to the parm before processing.
37861 tree new_parm
37863 input_location,
37864 node,
37868 // Chain the new parameter to the list of implicit parameters.
37870 parser->implicit_template_parms
37872 else
37877 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
37880 /* If creating a fully implicit function template, start the new implicit
37881 template parameter list with this synthesized type, otherwise grow the
37882 current template parameter list. */
37885 {
37892 }
37893 else
37894 {
37899 }
37901 // If the new parameter was constrained, we need to add that to the
37902 // constraints in the template parameter list.
37904 {
37908 }
37913 }
37915 /* Finish the declaration of a fully implicit function template. Such a
37916 template has no explicit template parameter list so has not been through the
37917 normal template head and tail processing. synthesize_implicit_template_parm
37918 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
37919 provided if the declaration is a class member such that its template
37920 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
37921 form is returned. Otherwise NULL_TREE is returned. */
37923 static tree
37925 {
37930 {
37934 }
37944 }