| blob | 07d182156d6375230fbeca6f5a6023fbd68f87de |
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 /* According to the standard, no expression should ever have
7188 reference type. Unfortunately, we do not currently match
7189 the standard in this respect in that our internal representation
7190 of an expression may have reference type even when the standard
7191 says it does not. Therefore, we have to manually obtain the
7192 underlying type here. */
7194 /* Check to see whether or not the expression is type-dependent and
7195 not the current instantiation. */
7197 /* The identifier following the `->' or `.' is not qualified. */
7203 /* Enter the scope corresponding to the type of the object
7204 given by the POSTFIX_EXPRESSION. */
7206 {
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. */
7218 && !(processing_template_decl
7219 && current_class_type
7220 && (same_type_ignoring_top_level_qualifiers_p
7223 /* Let the name lookup machinery know that we are processing a
7224 class member access expression. */
7226 /* If something went wrong, we want to be able to discern that case,
7227 as opposed to the case where there was no SCOPE due to the type
7228 of expression being dependent. */
7231 /* If the SCOPE was erroneous, make the various semantic analysis
7232 functions exit quickly -- and without issuing additional error
7233 messages. */
7236 }
7237 else
7238 /* Tell cp_parser_lookup_name that there was an object, even though it's
7239 type-dependent. */
7242 /* Assume this expression is not a pseudo-destructor access. */
7245 /* If the SCOPE is a scalar type, then, if this is a valid program,
7246 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7247 is type dependent, it can be pseudo-destructor-name or something else.
7248 Try to parse it as pseudo-destructor-name first. */
7250 {
7251 tree s;
7252 tree type;
7255 /* Parse the pseudo-destructor-name. */
7264 {
7266 postfix_expression
7269 }
7270 }
7273 {
7274 /* If the SCOPE is not a scalar type, we are looking at an
7275 ordinary class member access expression, rather than a
7276 pseudo-destructor-name. */
7279 /* Parse the id-expression. */
7280 name = (cp_parser_id_expression
7287 /* In general, build a SCOPE_REF if the member name is qualified.
7288 However, if the name was not dependent and has already been
7289 resolved; there is no need to build the SCOPE_REF. For example;
7291 struct X { void f(); };
7292 template <typename T> void f(T* t) { t->X::f(); }
7294 Even though "t" is dependent, "X::f" is not and has been resolved
7295 to a BASELINK; there is no need to include scope information. */
7297 /* But we do need to remember that there was an explicit scope for
7298 virtual function calls. */
7302 /* If the name is a template-id that names a type, we will get a
7303 TYPE_DECL here. That is invalid code. */
7305 {
7308 }
7309 else
7310 {
7312 {
7314 {
7318 }
7319 else
7322 name,
7323 template_p);
7327 }
7329 adjust_result_of_qualified_name_lookup
7331 postfix_expression
7333 template_p,
7334 tf_warning_or_error);
7335 /* Build a location e.g.:
7336 ptr->access_expr
7337 ~~~^~~~~~~~~~~~~
7338 where the caret is at the deref token, ranging from
7339 the start of postfix_expression to the end of the access expr. */
7340 location_t end_loc
7342 location_t combined_loc
7345 }
7346 }
7348 /* We no longer need to look up names in the scope of the object on
7349 the left-hand side of the `.' or `->' operator. */
7352 /* Outside of offsetof, these operators may not appear in
7353 constant-expressions. */
7355 && (cp_parser_non_integral_constant_expression
7360 }
7362 /* Parse a parenthesized expression-list.
7364 expression-list:
7365 assignment-expression
7366 expression-list, assignment-expression
7368 attribute-list:
7369 expression-list
7370 identifier
7371 identifier, expression-list
7373 CAST_P is true if this expression is the target of a cast.
7375 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7376 argument pack.
7378 Returns a vector of trees. Each element is a representation of an
7379 assignment-expression. NULL is returned if the ( and or ) are
7380 missing. An empty, but allocated, vector is returned on no
7381 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7382 if we are parsing an attribute list for an attribute that wants a
7383 plain identifier argument, normal_attr for an attribute that wants
7384 an expression, or non_attr if we aren't parsing an attribute list. If
7385 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7386 not all of the expressions in the list were constant.
7387 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7388 will be written to with the location of the closing parenthesis. If
7389 an error occurs, it may or may not be written to. */
7398 {
7404 /* Assume all the expressions will be constant. */
7413 /* Within a parenthesized expression, a `>' token is always
7414 the greater-than operator. */
7415 saved_greater_than_is_operator_p
7419 /* Consume expressions until there are no more. */
7422 {
7423 tree expr;
7425 /* At the beginning of attribute lists, check to see if the
7426 next token is an identifier. */
7429 {
7432 /* Consume the identifier. */
7434 /* Save the identifier. */
7436 }
7437 else
7438 {
7441 /* Parse the next assignment-expression. */
7443 {
7444 /* A braced-init-list. */
7450 }
7452 {
7453 expr = (cp_parser_constant_expression
7458 }
7459 else
7461 cast_p);
7466 /* If we have an ellipsis, then this is an expression
7467 expansion. */
7470 {
7471 /* Consume the `...'. */
7474 /* Build the argument pack. */
7476 }
7478 /* Add it to the list. We add error_mark_node
7479 expressions to the list, so that we can still tell if
7480 the correct form for a parenthesized expression-list
7481 is found. That gives better errors. */
7486 }
7488 /* After the first item, attribute lists look the same as
7489 expression lists. */
7492 get_comma:;
7493 /* If the next token isn't a `,', then we are done. */
7497 /* Otherwise, consume the `,' and keep going. */
7499 }
7505 {
7508 skip_comma:;
7509 /* We try and resync to an unnested comma, as that will give the
7510 user better diagnostics. */
7518 {
7519 parser->greater_than_is_operator_p
7522 }
7523 }
7525 parser->greater_than_is_operator_p
7532 }
7534 /* Parse a pseudo-destructor-name.
7536 pseudo-destructor-name:
7537 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7538 :: [opt] nested-name-specifier template template-id :: ~ type-name
7539 :: [opt] nested-name-specifier [opt] ~ type-name
7541 If either of the first two productions is used, sets *SCOPE to the
7542 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7543 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7544 or ERROR_MARK_NODE if the parse fails. */
7546 static void
7548 tree object,
7551 {
7554 /* Handle ~auto. */
7558 {
7561 "%<~auto%> only available with "
7568 }
7570 /* Assume that things will not work out. */
7573 /* Look for the optional `::' operator. */
7575 /* Look for the optional nested-name-specifier. */
7576 nested_name_specifier_p
7583 /* Now, if we saw a nested-name-specifier, we might be doing the
7584 second production. */
7587 {
7588 /* Consume the `template' keyword. */
7590 /* Parse the template-id. */
7594 class_type,
7596 /* Look for the `::' token. */
7598 }
7599 /* If the next token is not a `~', then there might be some
7600 additional qualification. */
7602 {
7603 /* At this point, we're looking for "type-name :: ~". The type-name
7604 must not be a class-name, since this is a pseudo-destructor. So,
7605 it must be either an enum-name, or a typedef-name -- both of which
7606 are just identifiers. So, we peek ahead to check that the "::"
7607 and "~" tokens are present; if they are not, then we can avoid
7608 calling type_name. */
7612 {
7615 }
7617 /* Look for the type-name. */
7622 /* Look for the `::' token. */
7624 }
7625 else
7628 /* Look for the `~'. */
7631 /* Once we see the ~, this has to be a pseudo-destructor. */
7635 /* Look for the type-name again. We are not responsible for
7636 checking that it matches the first type-name. */
7638 }
7640 /* Parse a unary-expression.
7642 unary-expression:
7643 postfix-expression
7644 ++ cast-expression
7645 -- cast-expression
7646 unary-operator cast-expression
7647 sizeof unary-expression
7648 sizeof ( type-id )
7649 alignof ( type-id ) [C++0x]
7650 new-expression
7651 delete-expression
7653 GNU Extensions:
7655 unary-expression:
7656 __extension__ cast-expression
7657 __alignof__ unary-expression
7658 __alignof__ ( type-id )
7659 alignof unary-expression [C++0x]
7660 __real__ cast-expression
7661 __imag__ cast-expression
7662 && identifier
7663 sizeof ( type-id ) { initializer-list , [opt] }
7664 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7665 __alignof__ ( type-id ) { initializer-list , [opt] }
7667 ADDRESS_P is true iff the unary-expression is appearing as the
7668 operand of the `&' operator. CAST_P is true if this expression is
7669 the target of a cast.
7671 Returns a representation of the expression. */
7673 static cp_expr
7676 {
7680 /* Peek at the next token. */
7682 /* Some keywords give away the kind of expression. */
7684 {
7688 {
7691 {
7694 location_t first_loc;
7697 /* Consume the token. */
7700 /* Parse the operand. */
7705 else
7706 {
7707 /* ISO C++ defines alignof only with types, not with
7708 expressions. So pedwarn if alignof is used with a non-
7709 type expression. However, __alignof__ is ok. */
7712 "ISO C++ does not allow %<alignof%> "
7716 }
7717 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7718 SIZEOF_EXPR with the original operand. */
7720 {
7722 {
7724 {
7727 error_mark_node));
7729 }
7730 else
7734 }
7736 }
7738 }
7747 {
7748 /* The saved value of the PEDANTIC flag. */
7750 tree expr;
7752 /* Save away the PEDANTIC flag. */
7754 /* Parse the cast-expression. */
7756 /* Restore the PEDANTIC flag. */
7760 }
7764 {
7765 tree expression;
7767 /* Consume the `__real__' or `__imag__' token. */
7769 /* Parse the cast-expression. */
7771 /* Create the complete representation. */
7775 expression,
7776 tf_warning_or_error);
7777 }
7785 {
7786 tree expr;
7796 parser->type_definition_forbidden_message
7799 saved_integral_constant_expression_p
7801 saved_non_integral_constant_expression_p
7805 saved_greater_than_is_operator_p
7817 parser->greater_than_is_operator_p
7820 parser->integral_constant_expression_p
7822 parser->non_integral_constant_expression_p
7829 }
7833 }
7834 }
7836 /* Look for the `:: new' and `:: delete', which also signal the
7837 beginning of a new-expression, or delete-expression,
7838 respectively. If the next token is `::', then it might be one of
7839 these. */
7841 {
7844 /* See if the token after the `::' is one of the keywords in
7845 which we're interested. */
7847 /* If it's `new', we have a new-expression. */
7850 /* Similarly, for `delete'. */
7853 }
7855 /* Look for a unary operator. */
7857 /* The `++' and `--' operators can be handled similarly, even though
7858 they are not technically unary-operators in the grammar. */
7860 {
7865 /* Handle the GNU address-of-label extension. */
7868 {
7869 tree identifier;
7870 tree expression;
7873 /* Consume the '&&' token. */
7875 /* Look for the identifier. */
7876 location_t finish_loc
7879 /* Construct a location of the form:
7880 &&label
7881 ^~~~~~~
7882 with caret==start at the "&&", finish at the end of the label. */
7883 location_t combined_loc
7885 /* Create an expression representing the address. */
7888 NIC_ADDR_LABEL))
7891 }
7892 }
7894 {
7895 cp_expr cast_expression;
7901 /* Consume the operator token. */
7905 /* Parse the cast-expression. */
7906 cast_expression
7911 pidk);
7913 /* Make a location:
7914 OP_TOKEN CAST_EXPRESSION
7915 ^~~~~~~~~~~~~~~~~~~~~~~~~
7916 with start==caret at the operator token, and
7917 extending to the end of the cast_expression. */
7920 /* Now, build an appropriate representation. */
7922 {
7926 RO_UNARY_STAR,
7927 complain);
7928 /* TODO: build_x_indirect_ref does not always honor the
7929 location, so ensure it is set. */
7935 /* Fall through. */
7938 cast_expression,
7939 complain);
7940 /* TODO: build_x_unary_op does not always honor the location,
7941 so ensure it is set. */
7949 /* Fall through. */
7951 /* Immediately fold negation of a constant, unless the constant is 0
7952 (since -0 == 0) or it would overflow. */
7957 {
7960 cast_expression);
7962 {
7965 }
7966 }
7967 /* Fall through. */
7976 }
7980 non_constant_p))
7984 }
7988 decltype_p,
7989 pidk);
7990 }
7992 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7993 unary-operator, the corresponding tree code is returned. */
7995 static enum tree_code
7997 {
7999 {
8020 }
8021 }
8023 /* Parse a new-expression.
8025 new-expression:
8026 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8027 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8029 Returns a representation of the expression. */
8031 static tree
8033 {
8036 tree type;
8039 tree ret;
8043 /* Look for the optional `::' operator. */
8044 global_scope_p
8048 /* Look for the `new' operator. */
8050 /* There's no easy way to tell a new-placement from the
8051 `( type-id )' construct. */
8053 /* Look for a new-placement. */
8055 /* If that didn't work out, there's no new-placement. */
8057 {
8061 }
8063 /* If the next token is a `(', then we have a parenthesized
8064 type-id. */
8066 {
8070 /* Consume the `('. */
8073 /* Parse the type-id. */
8074 parser->type_definition_forbidden_message
8076 {
8079 }
8082 /* Look for the closing `)'. */
8085 /* There should not be a direct-new-declarator in this production,
8086 but GCC used to allowed this, so we check and emit a sensible error
8087 message for this case. */
8089 {
8095 }
8096 }
8097 /* Otherwise, there must be a new-type-id. */
8098 else
8101 /* If the next token is a `(' or '{', then we have a new-initializer. */
8106 else
8109 /* A new-expression may not appear in an integral constant
8110 expression. */
8113 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8114 of a new-type-id or type-id of a new-expression, the new-expression shall
8115 contain a new-initializer of the form ( assignment-expression )".
8116 Additionally, consistently with the spirit of DR 1467, we want to accept
8117 'new auto { 2 }' too. */
8122 {
8124 "initialization of new-expression for type %<auto%> "
8127 }
8128 else
8129 {
8130 /* Construct a location e.g.:
8131 ptr = new int[100]
8132 ^~~~~~~~~~~~
8133 with caret == start at the start of the "new" token, and the end
8134 at the end of the final token we consumed. */
8139 /* Create a representation of the new-expression. */
8141 tf_warning_or_error);
8143 }
8151 }
8153 /* Parse a new-placement.
8155 new-placement:
8156 ( expression-list )
8158 Returns the same representation as for an expression-list. */
8162 {
8165 /* Parse the expression-list. */
8166 expression_list = (cp_parser_parenthesized_expression_list
8175 }
8177 /* Parse a new-type-id.
8179 new-type-id:
8180 type-specifier-seq new-declarator [opt]
8182 Returns the TYPE allocated. If the new-type-id indicates an array
8183 type, *NELTS is set to the number of elements in the last array
8184 bound; the TYPE will not include the last array bound. */
8186 static tree
8188 {
8189 cp_decl_specifier_seq type_specifier_seq;
8195 /* The type-specifier sequence must not contain type definitions.
8196 (It cannot contain declarations of new types either, but if they
8197 are not definitions we will catch that because they are not
8198 complete.) */
8200 parser->type_definition_forbidden_message
8202 /* Parse the type-specifier-seq. */
8206 /* Restore the old message. */
8212 /* Parse the new-declarator. */
8215 /* Determine the number of elements in the last array dimension, if
8216 any. */
8218 /* Skip down to the last array dimension. */
8223 {
8226 }
8231 {
8234 }
8237 {
8244 else
8246 }
8249 }
8251 /* Parse an (optional) new-declarator.
8253 new-declarator:
8254 ptr-operator new-declarator [opt]
8255 direct-new-declarator
8257 Returns the declarator. */
8261 {
8264 cp_cv_quals cv_quals;
8266 /* We don't know if there's a ptr-operator next, or not. */
8268 /* Look for a ptr-operator. */
8270 /* If that worked, look for more new-declarators. */
8272 {
8275 /* Parse another optional declarator. */
8278 declarator = cp_parser_make_indirect_declarator
8282 }
8284 /* If the next token is a `[', there is a direct-new-declarator. */
8289 }
8291 /* Parse a direct-new-declarator.
8293 direct-new-declarator:
8294 [ expression ]
8295 direct-new-declarator [constant-expression]
8297 */
8301 {
8305 {
8306 tree expression;
8309 /* Look for the opening `['. */
8314 /* The standard requires that the expression have integral
8315 type. DR 74 adds enumeration types. We believe that the
8316 real intent is that these expressions be handled like the
8317 expression in a `switch' condition, which also allows
8318 classes with a single conversion to integral or
8319 enumeration type. */
8321 {
8322 expression
8324 expression,
8327 {
8329 "expression in new-declarator must have integral "
8332 }
8333 }
8335 /* Look for the closing `]'. */
8338 /* Add this bound to the declarator. */
8341 /* If the next token is not a `[', then there are no more
8342 bounds. */
8345 }
8348 }
8350 /* Parse a new-initializer.
8352 new-initializer:
8353 ( expression-list [opt] )
8354 braced-init-list
8356 Returns a representation of the expression-list. */
8360 {
8364 {
8365 tree t;
8372 }
8373 else
8374 expression_list = (cp_parser_parenthesized_expression_list
8380 }
8382 /* Parse a delete-expression.
8384 delete-expression:
8385 :: [opt] delete cast-expression
8386 :: [opt] delete [ ] cast-expression
8388 Returns a representation of the expression. */
8390 static tree
8392 {
8395 tree expression;
8397 /* Look for the optional `::' operator. */
8398 global_scope_p
8402 /* Look for the `delete' keyword. */
8404 /* See if the array syntax is in use. */
8406 {
8407 /* Consume the `[' token. */
8409 /* Look for the `]' token. */
8411 /* Remember that this is the `[]' construct. */
8413 }
8414 else
8417 /* Parse the cast-expression. */
8420 /* A delete-expression may not appear in an integral constant
8421 expression. */
8426 tf_warning_or_error);
8427 }
8429 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8430 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8431 0 otherwise. */
8433 static int
8435 {
8438 {
8480 /* In ((type ()) () the last () isn't a valid cast-expression,
8481 so the whole must be parsed as postfix-expression. */
8486 /* '[' may start a primary-expression in obj-c++ and in C++11,
8487 as a lambda-expression, eg, '(void)[]{}'. */
8494 /* '++' and '--' may or may not start a cast-expression:
8496 struct T { void operator++(int); };
8497 void f() { (T())++; }
8499 vs
8501 int a;
8502 (int)++a; */
8507 }
8508 }
8510 /* Parse a cast-expression.
8512 cast-expression:
8513 unary-expression
8514 ( type-id ) cast-expression
8516 ADDRESS_P is true iff the unary-expression is appearing as the
8517 operand of the `&' operator. CAST_P is true if this expression is
8518 the target of a cast.
8520 Returns a representation of the expression. */
8522 static cp_expr
8525 {
8526 /* If it's a `(', then we might be looking at a cast. */
8528 {
8534 /* There's no way to know yet whether or not this is a cast.
8535 For example, `(int (3))' is a unary-expression, while `(int)
8536 3' is a cast. So, we resort to parsing tentatively. */
8538 /* Types may not be defined in a cast. */
8540 parser->type_definition_forbidden_message
8542 /* Consume the `('. */
8546 /* A very tricky bit is that `(struct S) { 3 }' is a
8547 compound-literal (which we permit in C++ as an extension).
8548 But, that construct is not a cast-expression -- it is a
8549 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8550 is legal; if the compound-literal were a cast-expression,
8551 you'd need an extra set of parentheses.) But, if we parse
8552 the type-id, and it happens to be a class-specifier, then we
8553 will commit to the parse at that point, because we cannot
8554 undo the action that is done when creating a new class. So,
8555 then we cannot back up and do a postfix-expression.
8557 Another tricky case is the following (c++/29234):
8559 struct S { void operator () (); };
8561 void foo ()
8562 {
8563 ( S()() );
8564 }
8566 As a type-id we parse the parenthesized S()() as a function
8567 returning a function, groktypename complains and we cannot
8568 back up in this case either.
8570 Therefore, we scan ahead to the closing `)', and check to see
8571 if the tokens after the `)' can start a cast-expression. Otherwise
8572 we are dealing with an unary-expression, a postfix-expression
8573 or something else.
8575 Yet another tricky case, in C++11, is the following (c++/54891):
8577 (void)[]{};
8579 The issue is that usually, besides the case of lambda-expressions,
8580 the parenthesized type-id cannot be followed by '[', and, eg, we
8581 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8582 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8583 we don't commit, we try a cast-expression, then an unary-expression.
8585 Save tokens so that we can put them back. */
8588 /* We may be looking at a cast-expression. */
8591 cast_expression
8594 /* Roll back the tokens we skipped. */
8596 /* If we aren't looking at a cast-expression, simulate an error so
8597 that the call to cp_parser_error_occurred below returns true. */
8600 else
8601 {
8604 /* Look for the type-id. */
8606 /* Look for the closing `)'. */
8609 }
8611 /* Restore the saved message. */
8614 /* At this point this can only be either a cast or a
8615 parenthesized ctor such as `(T ())' that looks like a cast to
8616 function returning T. */
8618 {
8619 /* Only commit if the cast-expression doesn't start with
8620 '++', '--', or '[' in C++11. */
8628 pidk);
8631 {
8632 /* Warn about old-style casts, if so requested. */
8639 /* Only type conversions to integral or enumeration types
8640 can be used in constant-expressions. */
8643 NIC_CAST))
8646 /* Perform the cast. */
8647 /* Make a location:
8648 (TYPE) EXPR
8649 ^~~~~~~~~~~
8650 with start==caret at the open paren, extending to the
8651 end of "expr". */
8653 open_paren_loc,
8657 }
8658 }
8659 else
8661 }
8663 /* If we get here, then it's not a cast, so it must be a
8664 unary-expression. */
8667 }
8669 /* Parse a binary expression of the general form:
8671 pm-expression:
8672 cast-expression
8673 pm-expression .* cast-expression
8674 pm-expression ->* cast-expression
8676 multiplicative-expression:
8677 pm-expression
8678 multiplicative-expression * pm-expression
8679 multiplicative-expression / pm-expression
8680 multiplicative-expression % pm-expression
8682 additive-expression:
8683 multiplicative-expression
8684 additive-expression + multiplicative-expression
8685 additive-expression - multiplicative-expression
8687 shift-expression:
8688 additive-expression
8689 shift-expression << additive-expression
8690 shift-expression >> additive-expression
8692 relational-expression:
8693 shift-expression
8694 relational-expression < shift-expression
8695 relational-expression > shift-expression
8696 relational-expression <= shift-expression
8697 relational-expression >= shift-expression
8699 GNU Extension:
8701 relational-expression:
8702 relational-expression <? shift-expression
8703 relational-expression >? shift-expression
8705 equality-expression:
8706 relational-expression
8707 equality-expression == relational-expression
8708 equality-expression != relational-expression
8710 and-expression:
8711 equality-expression
8712 and-expression & equality-expression
8714 exclusive-or-expression:
8715 and-expression
8716 exclusive-or-expression ^ and-expression
8718 inclusive-or-expression:
8719 exclusive-or-expression
8720 inclusive-or-expression | exclusive-or-expression
8722 logical-and-expression:
8723 inclusive-or-expression
8724 logical-and-expression && inclusive-or-expression
8726 logical-or-expression:
8727 logical-and-expression
8728 logical-or-expression || logical-and-expression
8730 All these are implemented with a single function like:
8732 binary-expression:
8733 simple-cast-expression
8734 binary-expression <token> binary-expression
8736 CAST_P is true if this expression is the target of a cast.
8738 The binops_by_token map is used to get the tree codes for each <token> type.
8739 binary-expressions are associated according to a precedence table. */
8741 #define TOKEN_PRECEDENCE(token) \
8742 (((token->type == CPP_GREATER \
8743 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8744 && !parser->greater_than_is_operator_p) \
8745 ? PREC_NOT_OPERATOR \
8746 : binops_by_token[token->type].prec)
8748 static cp_expr
8754 {
8755 cp_parser_expression_stack stack;
8757 cp_parser_expression_stack_entry current;
8758 cp_expr rhs;
8762 tree overload;
8764 /* Parse the first expression. */
8775 {
8776 /* Get an operator token. */
8782 {
8784 "%<>>%> operator is treated"
8788 }
8793 /* This is a fold-expression; handle it later. */
8796 /* Popping an entry off the stack means we completed a subexpression:
8797 - either we found a token which is not an operator (`>' where it is not
8798 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8799 will happen repeatedly;
8800 - or, we found an operator which has lower priority. This is the case
8801 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8802 parsing `3 * 4'. */
8804 {
8807 else
8809 }
8811 get_rhs:
8815 /* We used the operator token. */
8818 /* For "false && x" or "true || x", x will never be executed;
8819 disable warnings while evaluating it. */
8821 c_inhibit_evaluation_warnings +=
8824 c_inhibit_evaluation_warnings +=
8827 /* Extract another operand. It may be the RHS of this expression
8828 or the LHS of a new, higher priority expression. */
8833 /* Get another operator token. Look up its precedence to avoid
8834 building a useless (immediately popped) stack entry for common
8835 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8842 {
8843 /* ... and prepare to parse the RHS of the new, higher priority
8844 expression. Since precedence levels on the stack are
8845 monotonically increasing, we do not have to care about
8846 stack overflows. */
8855 pop:
8857 /* If the stack is not empty, we have parsed into LHS the right side
8858 (`4' in the example above) of an expression we had suspended.
8859 We can use the information on the stack to recover the LHS (`3')
8860 from the stack together with the tree code (`MULT_EXPR'), and
8861 the precedence of the higher level subexpression
8862 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8863 which will be used to actually build the additive expression. */
8868 }
8870 /* Undo the disabling of warnings done above. */
8872 c_inhibit_evaluation_warnings -=
8875 c_inhibit_evaluation_warnings -=
8881 /* Avoid warning for !!x == y. */
8886 /* Avoid warning for !b == y where b is boolean. */
8890 /* Avoid warning for !!b == y where b is boolean. */
8903 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8904 ERROR_MARK for everything that is not a binary expression.
8905 This makes warn_about_parentheses miss some warnings that
8906 involve unary operators. For unary expressions we should
8907 pass the correct tree_code unless the unary expression was
8908 surrounded by parentheses.
8909 */
8916 == tcc_comparison
8919 else
8920 {
8925 /* TODO: build_x_binary_op doesn't always honor the location. */
8927 }
8930 /* If the binary operator required the use of an overloaded operator,
8931 then this expression cannot be an integral constant-expression.
8932 An overloaded operator can be used even if both operands are
8933 otherwise permissible in an integral constant-expression if at
8934 least one of the operands is of enumeration type. */
8938 NIC_OVERLOADED))
8940 }
8943 }
8945 static cp_expr
8950 {
8953 }
8955 /* Parse the `? expression : assignment-expression' part of a
8956 conditional-expression. The LOGICAL_OR_EXPR is the
8957 logical-or-expression that started the conditional-expression.
8958 Returns a representation of the entire conditional-expression.
8960 This routine is used by cp_parser_assignment_expression.
8962 ? expression : assignment-expression
8964 GNU Extensions:
8966 ? : assignment-expression */
8968 static tree
8970 {
8972 cp_expr assignment_expr;
8976 /* Consume the `?' token. */
8981 {
8984 /* Implicit true clause. */
8986 c_inhibit_evaluation_warnings +=
8989 }
8990 else
8991 {
8994 /* Parse the expression. */
8995 c_inhibit_evaluation_warnings +=
8998 c_inhibit_evaluation_warnings +=
9002 }
9004 /* The next token should be a `:'. */
9006 /* Parse the assignment-expression. */
9008 c_inhibit_evaluation_warnings -=
9011 /* Make a location:
9012 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9013 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9014 with the caret at the "?", ranging from the start of
9015 the logical_or_expr to the end of the assignment_expr. */
9020 /* Build the conditional-expression. */
9022 expr,
9023 assignment_expr,
9024 tf_warning_or_error);
9025 }
9027 /* Parse an assignment-expression.
9029 assignment-expression:
9030 conditional-expression
9031 logical-or-expression assignment-operator assignment_expression
9032 throw-expression
9034 CAST_P is true if this expression is the target of a cast.
9035 DECLTYPE_P is true if this expression is the operand of decltype.
9037 Returns a representation for the expression. */
9039 static cp_expr
9042 {
9043 cp_expr expr;
9045 /* If the next token is the `throw' keyword, then we're looking at
9046 a throw-expression. */
9049 /* Otherwise, it must be that we are looking at a
9050 logical-or-expression. */
9051 else
9052 {
9053 /* Parse the binary expressions (logical-or-expression). */
9055 decltype_p,
9057 /* If the next token is a `?' then we're actually looking at a
9058 conditional-expression. */
9061 else
9062 {
9065 /* If it's an assignment-operator, we're using the second
9066 production. */
9067 enum tree_code assignment_operator
9070 {
9073 /* Parse the right-hand side of the assignment. */
9080 /* An assignment may not appear in a
9081 constant-expression. */
9083 NIC_ASSIGNMENT))
9085 /* Build the assignment expression. Its default
9086 location:
9087 LHS = RHS
9088 ~~~~^~~~~
9089 is the location of the '=' token as the
9090 caret, ranging from the start of the lhs to the
9091 end of the rhs. */
9096 assignment_operator,
9097 rhs,
9099 /* TODO: build_x_modify_expr doesn't honor the location,
9100 so we must set it here. */
9102 }
9103 }
9104 }
9107 }
9109 /* Parse an (optional) assignment-operator.
9111 assignment-operator: one of
9112 = *= /= %= += -= >>= <<= &= ^= |=
9114 GNU Extension:
9116 assignment-operator: one of
9117 <?= >?=
9119 If the next token is an assignment operator, the corresponding tree
9120 code is returned, and the token is consumed. For example, for
9121 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9122 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9123 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9124 operator, ERROR_MARK is returned. */
9126 static enum tree_code
9128 {
9132 /* Peek at the next token. */
9136 {
9182 /* Nothing else is an assignment operator. */
9184 }
9186 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9191 /* If it was an assignment operator, consume it. */
9196 }
9198 /* Parse an expression.
9200 expression:
9201 assignment-expression
9202 expression , assignment-expression
9204 CAST_P is true if this expression is the target of a cast.
9205 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9206 except possibly parenthesized or on the RHS of a comma (N3276).
9208 Returns a representation of the expression. */
9210 static cp_expr
9213 {
9218 {
9219 cp_expr assignment_expression;
9221 /* Parse the next assignment-expression. */
9222 assignment_expression
9225 /* We don't create a temporary for a call that is the immediate operand
9226 of decltype or on the RHS of a comma. But when we see a comma, we
9227 need to create a temporary for a call on the LHS. */
9232 assignment_expression
9236 /* If this is the first assignment-expression, we can just
9237 save it away. */
9240 else
9241 {
9242 /* Create a location with caret at the comma, ranging
9243 from the start of the LHS to the end of the RHS. */
9248 assignment_expression,
9251 }
9252 /* If the next token is not a comma, or we're in a fold-expression, then
9253 we are done with the expression. */
9257 /* Consume the `,'. */
9260 /* A comma operator cannot appear in a constant-expression. */
9263 }
9266 }
9268 /* Parse a constant-expression.
9270 constant-expression:
9271 conditional-expression
9273 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9274 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9275 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9276 is false, NON_CONSTANT_P should be NULL. */
9278 static cp_expr
9282 {
9286 cp_expr expression;
9288 /* It might seem that we could simply parse the
9289 conditional-expression, and then check to see if it were
9290 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9291 one that the compiler can figure out is constant, possibly after
9292 doing some simplifications or optimizations. The standard has a
9293 precise definition of constant-expression, and we must honor
9294 that, even though it is somewhat more restrictive.
9296 For example:
9298 int i[(2, 3)];
9300 is not a legal declaration, because `(2, 3)' is not a
9301 constant-expression. The `,' operator is forbidden in a
9302 constant-expression. However, GCC's constant-folding machinery
9303 will fold this operation to an INTEGER_CST for `3'. */
9305 /* Save the old settings. */
9307 saved_allow_non_integral_constant_expression_p
9310 /* We are now parsing a constant-expression. */
9312 parser->allow_non_integral_constant_expression_p
9315 /* Although the grammar says "conditional-expression", we parse an
9316 "assignment-expression", which also permits "throw-expression"
9317 and the use of assignment operators. In the case that
9318 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9319 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9320 actually essential that we look for an assignment-expression.
9321 For example, cp_parser_initializer_clauses uses this function to
9322 determine whether a particular assignment-expression is in fact
9323 constant. */
9325 /* Restore the old settings. */
9326 parser->integral_constant_expression_p
9328 parser->allow_non_integral_constant_expression_p
9331 {
9332 /* Require an rvalue constant expression here; that's what our
9333 callers expect. Reference constant expressions are handled
9334 separately in e.g. cp_parser_template_argument. */
9339 }
9342 parser->non_integral_constant_expression_p
9346 }
9348 /* Parse __builtin_offsetof.
9350 offsetof-expression:
9351 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9353 offsetof-member-designator:
9354 id-expression
9355 | offsetof-member-designator "." id-expression
9356 | offsetof-member-designator "[" expression "]"
9357 | offsetof-member-designator "->" id-expression */
9359 static cp_expr
9361 {
9363 tree type;
9364 cp_expr expr;
9365 cp_id_kind dummy;
9367 location_t finish_loc;
9369 /* We're about to accept non-integral-constant things, but will
9370 definitely yield an integral constant expression. Save and
9371 restore these values around our local parsing. */
9377 /* Consume the "__builtin_offsetof" token. */
9379 /* Consume the opening `('. */
9381 /* Parse the type-id. */
9384 /* Look for the `,'. */
9388 /* Build the (type *)null that begins the traditional offsetof macro. */
9390 tf_warning_or_error);
9392 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9396 {
9399 {
9401 /* offsetof-member-designator "[" expression "]" */
9407 /* offsetof-member-designator "->" identifier */
9410 /* FALLTHRU */
9413 /* offsetof-member-designator "." identifier */
9421 /* Consume the ")" token. */
9427 /* Error. We know the following require will fail, but
9428 that gives the proper error message. */
9433 }
9434 }
9436 success:
9437 /* Make a location of the form:
9438 __builtin_offsetof (struct s, f)
9439 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9440 with caret at the type-id, ranging from the start of the
9441 "_builtin_offsetof" token to the close paren. */
9443 /* The result will be an INTEGER_CST, so we need to explicitly
9444 preserve the location. */
9447 failure:
9452 }
9454 /* Parse a trait expression.
9456 Returns a representation of the expression, the underlying type
9457 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9459 static tree
9461 {
9462 cp_trait_kind kind;
9468 {
9556 }
9558 /* Consume the token. */
9563 {
9566 }
9572 {
9575 {
9578 }
9582 }
9584 {
9586 {
9590 {
9593 }
9597 }
9598 }
9602 /* Complete the trait expression, which may mean either processing
9603 the trait expr now or saving it for template instantiation. */
9605 {
9614 }
9615 }
9617 /* Lambdas that appear in variable initializer or default argument scope
9618 get that in their mangling, so we need to record it. We might as well
9619 use the count for function and namespace scopes as well. */
9623 {
9624 tree t;
9626 };
9629 static void
9631 {
9632 tree_int ti;
9634 /* Once we're inside a function, we ignore other scopes and just push
9635 the function again so that popping works properly. */
9642 {
9643 /* Don't reset the count if we're still in the same function. */
9646 }
9647 }
9649 static void
9651 {
9654 }
9656 static void
9658 {
9661 {
9664 }
9666 }
9668 /* Parse a lambda expression.
9670 lambda-expression:
9671 lambda-introducer lambda-declarator [opt] compound-statement
9673 Returns a representation of the expression. */
9675 static cp_expr
9677 {
9679 tree type;
9687 {
9689 {
9693 }
9695 }
9697 {
9699 {
9702 }
9704 }
9706 /* We may be in the middle of deferred access check. Disable
9707 it now. */
9718 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9721 /* Now that we've started the type, add the capture fields for any
9722 explicit captures. */
9725 {
9726 /* Inside the class, surrounding template-parameter-lists do not apply. */
9727 unsigned int saved_num_template_parameter_lists
9731 bool fully_implicit_function_template_p
9735 bool auto_is_implicit_function_template_parm_p
9746 /* By virtue of defining a local class, a lambda expression has access to
9747 the private variables of enclosing classes. */
9752 {
9758 }
9760 {
9763 }
9765 /* The capture list was built up in reverse order; fix that now. */
9777 parser->fully_implicit_function_template_p
9781 parser->auto_is_implicit_function_template_parm_p
9783 }
9787 /* This field is only used during parsing of the lambda. */
9790 /* This lambda shouldn't have any proxies left at this point. */
9792 /* And now that we're done, push proxies for an enclosing lambda. */
9797 else
9803 }
9805 /* Parse the beginning of a lambda expression.
9807 lambda-introducer:
9808 [ lambda-capture [opt] ]
9810 LAMBDA_EXPR is the current representation of the lambda expression. */
9812 static void
9814 {
9815 /* Need commas after the first capture. */
9818 /* Eat the leading `['. */
9821 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9829 {
9832 }
9835 {
9837 tree capture_id;
9838 tree capture_init_expr;
9842 enum capture_kind_type
9843 {
9844 BY_COPY,
9845 BY_REFERENCE
9846 };
9850 {
9853 }
9857 else
9860 /* Possibly capture `this'. */
9862 {
9872 explicit_init_p);
9874 }
9876 /* Remember whether we want to capture as a reference or not. */
9878 {
9881 }
9883 /* Get the identifier. */
9888 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9889 delimiters, but I modified this to stop on unnested ']' as well. It
9890 was already changed to stop on unnested '}', so the
9891 "closing_parenthesis" name is no more misleading with my change. */
9892 {
9898 }
9900 /* Find the initializer for this capture. */
9904 {
9906 /* An explicit initializer exists. */
9909 "lambda capture initializers "
9915 {
9918 }
9919 }
9920 else
9921 {
9924 /* Turn the identifier into an id-expression. */
9925 capture_init_expr
9930 {
9933 }
9937 {
9940 capture_init_expr);
9944 }
9947 {
9950 capture_init_expr))
9954 }
9956 capture_init_expr
9957 = finish_id_expression
9959 capture_init_expr,
9973 {
9976 }
9977 else
9979 }
9983 {
9988 capture_id);
9992 "capture of %qD redundant with by-reference capture "
9994 }
9997 capture_id,
9998 capture_init_expr,
10000 explicit_init_p);
10001 }
10004 }
10006 /* Parse the (optional) middle of a lambda expression.
10008 lambda-declarator:
10009 < template-parameter-list [opt] >
10010 ( parameter-declaration-clause [opt] )
10011 attribute-specifier [opt]
10012 mutable [opt]
10013 exception-specification [opt]
10014 lambda-return-type-clause [opt]
10016 LAMBDA_EXPR is the current representation of the lambda expression. */
10018 static bool
10020 {
10021 /* 5.1.1.4 of the standard says:
10022 If a lambda-expression does not include a lambda-declarator, it is as if
10023 the lambda-declarator were ().
10024 This means an empty parameter list, no attributes, and no exception
10025 specification. */
10032 /* The template-parameter-list is optional, but must begin with
10033 an opening angle if present. */
10035 {
10038 "lambda templates are only available with "
10047 /* We just processed one more parameter list. */
10049 }
10051 /* The parameter-declaration-clause is optional (unless
10052 template-parameter-list was given), but must begin with an
10053 opening parenthesis if present. */
10055 {
10060 /* Parse parameters. */
10063 /* Default arguments shall not be specified in the
10064 parameter-declaration-clause of a lambda-declarator. */
10074 /* Parse optional `mutable' keyword. */
10076 {
10079 }
10083 /* Parse optional exception specification. */
10086 /* Parse optional trailing return type. */
10088 {
10092 }
10094 /* The function parameters must be in scope all the way until after the
10095 trailing-return-type in case of decltype. */
10097 }
10101 /* Create the function call operator.
10103 Messing with declarators like this is no uglier than building up the
10104 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10105 other code. */
10106 {
10107 cp_decl_specifier_seq return_type_specs;
10109 tree fco;
10116 else
10117 /* Maybe we will deduce the return type later. */
10123 sfk_none);
10128 VIRT_SPEC_UNSPECIFIED,
10129 REF_QUAL_NONE,
10130 tx_qual,
10131 exception_spec,
10137 declarator,
10138 attributes);
10140 {
10143 /* Give the object parameter a different name. */
10147 }
10149 {
10153 }
10162 }
10163 }
10165 /* Parse the body of a lambda expression, which is simply
10167 compound-statement
10169 but which requires special handling.
10170 LAMBDA_EXPR is the current representation of the lambda expression. */
10172 static void
10174 {
10179 else
10180 /* Still increment function_depth so that we don't GC in the
10181 middle of an expression. */
10185 /* Clear this in case we're in the middle of a default argument. */
10188 /* Finish the function call operator
10189 - class_specifier
10190 + late_parsing_for_member
10191 + function_definition_after_declarator
10192 + ctor_initializer_opt_and_function_body */
10193 {
10195 tree body;
10197 tree compound_stmt;
10198 tree cap;
10200 /* Let the front end know that we are going to be defining this
10201 function. */
10203 NULL_TREE,
10212 /* Push the proxies for any explicit captures. */
10219 /* 5.1.1.4 of the standard says:
10220 If a lambda-expression does not include a trailing-return-type, it
10221 is as if the trailing-return-type denotes the following type:
10222 * if the compound-statement is of the form
10223 { return attribute-specifier [opt] expression ; }
10224 the type of the returned expression after lvalue-to-rvalue
10225 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10226 (_conv.array_ 4.2), and function-to-pointer conversion
10227 (_conv.func_ 4.3);
10228 * otherwise, void. */
10230 /* In a lambda that has neither a lambda-return-type-clause
10231 nor a deducible form, errors should be reported for return statements
10232 in the body. Since we used void as the placeholder return type, parsing
10233 the body as usual will give such desired behavior. */
10237 {
10241 /* Parse tentatively in case there's more after the initial return
10242 statement. */
10253 {
10255 {
10260 }
10262 /* Will get error here if type not deduced yet. */
10266 }
10267 }
10270 {
10275 }
10279 out:
10283 /* Finish the function and generate code for it if necessary. */
10286 /* Only expand if the call op is not a template. */
10289 }
10295 else
10297 }
10299 /* Statements [gram.stmt.stmt] */
10301 /* Parse a statement.
10303 statement:
10304 labeled-statement
10305 expression-statement
10306 compound-statement
10307 selection-statement
10308 iteration-statement
10309 jump-statement
10310 declaration-statement
10311 try-block
10313 C++11:
10315 statement:
10316 labeled-statement
10317 attribute-specifier-seq (opt) expression-statement
10318 attribute-specifier-seq (opt) compound-statement
10319 attribute-specifier-seq (opt) selection-statement
10320 attribute-specifier-seq (opt) iteration-statement
10321 attribute-specifier-seq (opt) jump-statement
10322 declaration-statement
10323 attribute-specifier-seq (opt) try-block
10325 TM Extension:
10327 statement:
10328 atomic-statement
10330 IN_COMPOUND is true when the statement is nested inside a
10331 cp_parser_compound_statement; this matters for certain pragmas.
10333 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10334 is a (possibly labeled) if statement which is not enclosed in braces
10335 and has an else clause. This is used to implement -Wparentheses.
10337 CHAIN is a vector of if-else-if conditions. */
10339 static void
10342 {
10347 restart:
10350 /* There is no statement yet. */
10356 /* In obj-c++, seeing '[[' might be the either the beginning of
10357 c++11 attributes, or a nested objc-message-expression. So
10358 let's parse the c++11 attributes tentatively. */
10362 {
10365 }
10367 /* Peek at the next token. */
10369 /* Remember the location of the first token in the statement. */
10371 /* If this is a keyword, then that will often determine what kind of
10372 statement we have. */
10374 {
10378 {
10381 /* Looks like a labeled-statement with a case label.
10382 Parse the label, and then use tail recursion to parse
10383 the statement. */
10401 {
10406 }
10407 else
10421 {
10426 }
10427 else
10428 {
10432 }
10436 /* Objective-C++ exception-handling constructs. */
10450 /* This must be a namespace alias definition. */
10466 /* It might be a keyword like `int' that can start a
10467 declaration-statement. */
10469 }
10470 }
10472 {
10473 /* If the next token is a `:', then we are looking at a
10474 labeled-statement. */
10477 {
10478 /* Looks like a labeled-statement with an ordinary label.
10479 Parse the label, and then use tail recursion to parse
10480 the statement. */
10485 }
10486 }
10487 /* Anything that starts with a `{' must be a compound-statement. */
10490 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10491 a statement all its own. */
10493 {
10494 /* Only certain OpenMP pragmas are attached to statements, and thus
10495 are considered statements themselves. All others are not. In
10496 the context of a compound, accept the pragma as a "statement" and
10497 return so that we can check for a close brace. Otherwise we
10498 require a real statement and must go back and read one. */
10504 }
10506 {
10509 }
10511 /* Everything else must be a declaration-statement or an
10512 expression-statement. Try for the declaration-statement
10513 first, unless we are looking at a `;', in which case we know that
10514 we have an expression-statement. */
10516 {
10518 {
10520 {
10521 /* Attributes should be parsed as part of the the
10522 declaration, so let's un-parse them. */
10525 }
10528 /* Try to parse the declaration-statement. */
10530 /* If that worked, we're done. */
10533 }
10534 /* Look for an expression-statement instead. */
10536 }
10538 /* Set the line number for the statement. */
10542 /* Note that for now, we don't do anything with c++11 statements
10543 parsed at this level. */
10546 OPT_Wattributes,
10548 }
10550 /* Parse the label for a labeled-statement, i.e.
10552 identifier :
10553 case constant-expression :
10554 default :
10556 GNU Extension:
10557 case constant-expression ... constant-expression : statement
10559 When a label is parsed without errors, the label is added to the
10560 parse tree by the finish_* functions, so this function doesn't
10561 have to return the label. */
10563 static void
10565 {
10570 /* The next token should be an identifier. */
10574 {
10577 }
10581 {
10583 {
10587 /* Consume the `case' token. */
10589 /* Parse the constant-expression. */
10596 {
10597 /* Consume the `...' token. */
10603 /* We don't need to emit warnings here, as the common code
10604 will do this for us. */
10605 }
10606 else
10611 else
10614 expr);
10615 }
10619 /* Consume the `default' token. */
10624 else
10629 /* Anything else must be an ordinary label. */
10632 }
10634 /* Require the `:' token. */
10637 /* An ordinary label may optionally be followed by attributes.
10638 However, this is only permitted if the attributes are then
10639 followed by a semicolon. This is because, for backward
10640 compatibility, when parsing
10641 lab: __attribute__ ((unused)) int i;
10642 we want the attribute to attach to "i", not "lab". */
10645 {
10646 tree attrs;
10653 ;
10654 else
10656 }
10662 }
10664 /* Parse an expression-statement.
10666 expression-statement:
10667 expression [opt] ;
10669 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10670 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10671 indicates whether this expression-statement is part of an
10672 expression statement. */
10674 static tree
10676 {
10680 /* If the next token is a ';', then there is no expression
10681 statement. */
10683 {
10687 {
10690 }
10691 }
10693 /* Give a helpful message for "A<T>::type t;" and the like. */
10696 {
10703 {
10704 /* A::A a; */
10709 }
10710 }
10712 /* Consume the final `;'. */
10717 /* This is the final expression statement of a statement
10718 expression. */
10724 }
10726 /* Parse a compound-statement.
10728 compound-statement:
10729 { statement-seq [opt] }
10731 GNU extension:
10733 compound-statement:
10734 { label-declaration-seq [opt] statement-seq [opt] }
10736 label-declaration-seq:
10737 label-declaration
10738 label-declaration-seq label-declaration
10740 Returns a tree representing the statement. */
10742 static tree
10745 {
10746 tree compound_stmt;
10748 /* Consume the `{'. */
10755 /* Begin the compound-statement. */
10757 /* If the next keyword is `__label__' we have a label declaration. */
10760 /* Parse an (optional) statement-seq. */
10762 /* Finish the compound-statement. */
10764 /* Consume the `}'. */
10768 }
10770 /* Parse an (optional) statement-seq.
10772 statement-seq:
10773 statement
10774 statement-seq [opt] statement */
10776 static void
10778 {
10779 /* Scan statements until there aren't any more. */
10781 {
10784 /* If we are looking at a `}', then we have run out of
10785 statements; the same is true if we have reached the end
10786 of file, or have stumbled upon a stray '@end'. */
10793 /* If we are in a compound statement and find 'else' then
10794 something went wrong. */
10796 {
10799 else
10800 {
10803 }
10804 }
10806 /* Parse the statement. */
10808 }
10809 }
10811 /* Parse a selection-statement.
10813 selection-statement:
10814 if ( condition ) statement
10815 if ( condition ) statement else statement
10816 switch ( condition ) statement
10818 Returns the new IF_STMT or SWITCH_STMT.
10820 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10821 is a (possibly labeled) if statement which is not enclosed in
10822 braces and has an else clause. This is used to implement
10823 -Wparentheses.
10825 CHAIN is a vector of if-else-if conditions. This is used to implement
10826 -Wduplicated-cond. */
10828 static tree
10831 {
10834 token_indent_info guard_tinfo;
10839 /* Peek at the next token. */
10843 /* See what kind of keyword it is. */
10846 {
10849 {
10850 tree statement;
10851 tree condition;
10853 /* Look for the `('. */
10855 {
10858 }
10860 /* Begin the selection-statement. */
10863 else
10866 /* Parse the condition. */
10868 /* Look for the `)'. */
10874 {
10878 /* Add the condition. */
10885 /* Parse the then-clause. */
10889 guard_tinfo);
10894 /* If the next token is `else', parse the else-clause. */
10896 RID_ELSE))
10897 {
10898 guard_tinfo
10900 /* Consume the `else' keyword. */
10903 {
10905 RID_IF)
10907 {
10908 /* We've got "if (COND) else if (COND2)". Start
10909 the condition chain and add COND as the first
10910 element. */
10914 {
10915 /* Wrap it in a NOP_EXPR so that we can set the
10916 location of the condition. */
10918 condition);
10921 }
10922 }
10924 RID_IF))
10925 {
10926 /* This is if-else without subsequent if. Zap the
10927 condition chain; we would have already warned at
10928 this point. */
10931 }
10932 }
10934 /* Parse the else-clause. */
10940 /* If we are currently parsing a then-clause, then
10941 IF_P will not be NULL. We set it to true to
10942 indicate that this if statement has an else clause.
10943 This may trigger the Wparentheses warning below
10944 when we get back up to the parent if statement. */
10947 }
10948 else
10949 {
10950 /* This if statement does not have an else clause. If
10951 NESTED_IF is true, then the then-clause is an if
10952 statement which does have an else clause. We warn
10953 about the potential ambiguity. */
10956 "suggest explicit braces to avoid ambiguous"
10959 {
10960 /* We don't need the condition chain anymore. */
10963 }
10964 }
10966 /* Now we're all done with the if-statement. */
10968 }
10969 else
10970 {
10974 /* Add the condition. */
10977 /* Parse the body of the switch-statement. */
10983 guard_tinfo);
10987 /* Now we're all done with the switch-statement. */
10989 }
10992 }
10998 }
10999 }
11001 /* Parse a condition.
11003 condition:
11004 expression
11005 type-specifier-seq declarator = initializer-clause
11006 type-specifier-seq declarator braced-init-list
11008 GNU Extension:
11010 condition:
11011 type-specifier-seq declarator asm-specification [opt]
11012 attributes [opt] = assignment-expression
11014 Returns the expression that should be tested. */
11016 static tree
11018 {
11019 cp_decl_specifier_seq type_specifiers;
11023 /* Try the declaration first. */
11025 /* New types are not allowed in the type-specifier-seq for a
11026 condition. */
11028 parser->type_definition_forbidden_message
11030 /* Parse the type-specifier-seq. */
11032 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11035 /* Restore the saved message. */
11037 /* If all is well, we might be looking at a declaration. */
11039 {
11040 tree decl;
11041 tree asm_specification;
11042 tree attributes;
11046 /* Parse the declarator. */
11052 /* Parse the attributes. */
11054 /* Parse the asm-specification. */
11056 /* If the next token is not an `=' or '{', then we might still be
11057 looking at an expression. For example:
11059 if (A(a).x)
11061 looks like a decl-specifier-seq and a declarator -- but then
11062 there is no `=', so this is an expression. */
11067 /* If we did see an `=' or '{', then we are looking at a declaration
11068 for sure. */
11070 {
11071 tree pushed_scope;
11075 /* Create the declaration. */
11081 /* Parse the initializer. */
11083 {
11087 }
11088 else
11089 {
11090 /* Consume the `='. */
11093 }
11097 /* Process the initializer. */
11100 asm_specification,
11101 flags);
11107 }
11108 }
11109 /* If we didn't even get past the declarator successfully, we are
11110 definitely not looking at a declaration. */
11111 else
11114 /* Otherwise, we are looking at an expression. */
11116 }
11118 /* Parses a for-statement or range-for-statement until the closing ')',
11119 not included. */
11121 static tree
11123 {
11127 /* Begin the for-statement. */
11130 /* Parse the initialization. */
11135 else
11137 }
11139 static tree
11141 {
11142 /* Normal for loop */
11145 tree stmt;
11148 /* The for-init-statement has already been parsed in
11149 cp_parser_for_init_statement, so no work is needed here. */
11152 /* If there's a condition, process it. */
11156 {
11160 }
11162 /* Look for the `;'. */
11165 /* If there's an expression, process it. */
11171 }
11173 /* Tries to parse a range-based for-statement:
11175 range-based-for:
11176 decl-specifier-seq declarator : expression
11178 The decl-specifier-seq declarator and the `:' are already parsed by
11179 cp_parser_for_init_statement. If processing_template_decl it returns a
11180 newly created RANGE_FOR_STMT; if not, it is converted to a
11181 regular FOR_STMT. */
11183 static tree
11186 {
11189 /* Get the range declaration momentarily out of the way so that
11190 the range expression doesn't clash with it. */
11195 {
11198 }
11199 else
11202 /* Put the range declaration back into scope. */
11206 /* If in template, STMT is converted to a normal for-statement
11207 at instantiation. If not, it is done just ahead. */
11209 {
11217 /* do_auto_deduction doesn't mess with template init-lists. */
11220 }
11221 else
11222 {
11225 }
11227 }
11229 /* Subroutine of cp_convert_range_for: given the initializer expression,
11230 builds up the range temporary. */
11232 static tree
11234 {
11237 /* Find out the type deduced by the declaration
11238 `auto &&__range = range_expr'. */
11243 /* Create the __range variable. */
11250 }
11252 /* Used by cp_parser_range_for in template context: we aren't going to
11253 do a full conversion yet, but we still need to resolve auto in the
11254 type of the for-range-declaration if present. This is basically
11255 a shortcut version of cp_convert_range_for. */
11257 static void
11259 {
11262 {
11265 iter_type = (cp_parser_perform_range_for_lookup
11268 {
11270 iter_type);
11272 tf_warning_or_error);
11275 }
11276 }
11277 }
11279 /* Converts a range-based for-statement into a normal
11280 for-statement, as per the definition.
11282 for (RANGE_DECL : RANGE_EXPR)
11283 BLOCK
11285 should be equivalent to:
11287 {
11288 auto &&__range = RANGE_EXPR;
11289 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11290 __begin != __end;
11291 ++__begin)
11292 {
11293 RANGE_DECL = *__begin;
11294 BLOCK
11295 }
11296 }
11298 If RANGE_EXPR is an array:
11299 BEGIN_EXPR = __range
11300 END_EXPR = __range + ARRAY_SIZE(__range)
11301 Else if RANGE_EXPR has a member 'begin' or 'end':
11302 BEGIN_EXPR = __range.begin()
11303 END_EXPR = __range.end()
11304 Else:
11305 BEGIN_EXPR = begin(__range)
11306 END_EXPR = end(__range);
11308 If __range has a member 'begin' but not 'end', or vice versa, we must
11309 still use the second alternative (it will surely fail, however).
11310 When calling begin()/end() in the third alternative we must use
11311 argument dependent lookup, but always considering 'std' as an associated
11312 namespace. */
11314 tree
11317 {
11323 /* If an error happened previously do nothing or else a lot of
11324 unhelpful errors would be issued. */
11326 else
11327 {
11328 tree range_temp;
11332 /* Can't bind a reference to an array of runtime bound. */
11334 else
11335 {
11340 LOOKUP_ONLYCONVERTING);
11342 }
11345 }
11347 /* The new for initialization statement. */
11355 LOOKUP_ONLYCONVERTING);
11364 LOOKUP_ONLYCONVERTING);
11368 /* The new for condition. */
11375 /* The new increment expression. */
11378 tf_warning_or_error);
11381 /* The declaration is initialized with *__begin inside the loop body. */
11384 tf_warning_or_error),
11386 LOOKUP_ONLYCONVERTING);
11389 }
11391 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11392 We need to solve both at the same time because the method used
11393 depends on the existence of members begin or end.
11394 Returns the type deduced for the iterator expression. */
11396 static tree
11398 {
11400 {
11403 }
11406 {
11411 }
11413 {
11414 /* If RANGE is an array, we will use pointer arithmetic. */
11417 range,
11421 }
11422 else
11423 {
11424 /* If it is not an array, we must do a bit of magic. */
11434 tf_warning_or_error);
11437 tf_warning_or_error);
11440 {
11441 /* Use the member functions. */
11444 else
11450 else
11453 }
11454 else
11455 {
11456 /* Use global functions with ADL. */
11463 tf_warning_or_error);
11465 tf_warning_or_error);
11467 tf_warning_or_error);
11469 tf_warning_or_error);
11472 }
11474 /* Last common checks. */
11476 {
11477 /* If one of the expressions is an error do no more checks. */
11480 }
11483 /* Can happen, when, eg, in a template context, Koenig lookup
11484 can't resolve begin/end (c++/58503). */
11486 else
11487 {
11489 /* The unqualified type of the __begin and __end temporaries should
11490 be the same, as required by the multiple auto declaration. */
11496 }
11497 }
11498 }
11500 /* Helper function for cp_parser_perform_range_for_lookup.
11501 Builds a tree for RANGE.IDENTIFIER(). */
11503 static tree
11505 {
11518 tf_warning_or_error);
11521 }
11523 /* Parse an iteration-statement.
11525 iteration-statement:
11526 while ( condition ) statement
11527 do statement while ( expression ) ;
11528 for ( for-init-statement condition [opt] ; expression [opt] )
11529 statement
11531 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11533 static tree
11535 {
11538 tree statement;
11540 token_indent_info guard_tinfo;
11542 /* Peek at the next token. */
11549 /* Remember whether or not we are already within an iteration
11550 statement. */
11553 /* See what kind of keyword it is. */
11556 {
11558 {
11559 tree condition;
11561 /* Begin the while-statement. */
11563 /* Look for the `('. */
11565 /* Parse the condition. */
11568 /* Look for the `)'. */
11570 /* Parse the dependent statement. */
11574 /* We're done with the while-statement. */
11576 }
11580 {
11581 tree expression;
11583 /* Begin the do-statement. */
11585 /* Parse the body of the do-statement. */
11590 /* Look for the `while' keyword. */
11592 /* Look for the `('. */
11594 /* Parse the expression. */
11596 /* We're done with the do-statement. */
11598 /* Look for the `)'. */
11600 /* Look for the `;'. */
11602 }
11606 {
11607 /* Look for the `('. */
11612 /* Look for the `)'. */
11615 /* Parse the body of the for-statement. */
11620 /* We're done with the for-statement. */
11622 }
11629 }
11632 }
11634 /* Parse a for-init-statement or the declarator of a range-based-for.
11635 Returns true if a range-based-for declaration is seen.
11637 for-init-statement:
11638 expression-statement
11639 simple-declaration */
11641 static bool
11643 {
11644 /* If the next token is a `;', then we have an empty
11645 expression-statement. Grammatically, this is also a
11646 simple-declaration, but an invalid one, because it does not
11647 declare anything. Therefore, if we did not handle this case
11648 specially, we would issue an error message about an invalid
11649 declaration. */
11651 {
11655 /* A colon is used in range-based for. */
11658 /* We're going to speculatively look for a declaration, falling back
11659 to an expression, if necessary. */
11661 /* Parse the declaration. */
11664 decl);
11667 {
11668 /* It is a range-for, consume the ':' */
11672 {
11674 "range-based %<for%> loops only available with "
11677 }
11678 }
11679 else
11680 /* The ';' is not consumed yet because we told
11681 cp_parser_simple_declaration not to. */
11686 /* If the tentative parse failed, then we shall need to look for an
11687 expression-statement. */
11688 }
11689 /* If we are here, it is an expression-statement. */
11692 }
11694 /* Parse a jump-statement.
11696 jump-statement:
11697 break ;
11698 continue ;
11699 return expression [opt] ;
11700 return braced-init-list ;
11701 goto identifier ;
11703 GNU extension:
11705 jump-statement:
11706 goto * expression ;
11708 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11710 static tree
11712 {
11718 /* Peek at the next token. */
11723 /* See what kind of keyword it is. */
11726 {
11730 {
11750 }
11756 {
11763 /* Fall through. */
11773 }
11778 {
11779 tree expr;
11783 {
11787 }
11790 else
11791 /* If the next token is a `;', then there is no
11792 expression. */
11794 /* Build the return-statement. */
11796 /* Look for the final `;'. */
11798 }
11804 {
11807 }
11809 /* Create the goto-statement. */
11811 {
11812 /* Issue a warning about this use of a GNU extension. */
11814 /* Consume the '*' token. */
11816 /* Parse the dependent expression. */
11818 }
11819 else
11821 /* Look for the final `;'. */
11828 }
11831 }
11833 /* Parse a declaration-statement.
11835 declaration-statement:
11836 block-declaration */
11838 static void
11840 {
11843 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11846 /* Parse the block-declaration. */
11849 /* Free any declarators allocated. */
11851 }
11853 /* Some dependent statements (like `if (cond) statement'), are
11854 implicitly in their own scope. In other words, if the statement is
11855 a single statement (as opposed to a compound-statement), it is
11856 none-the-less treated as if it were enclosed in braces. Any
11857 declarations appearing in the dependent statement are out of scope
11858 after control passes that point. This function parses a statement,
11859 but ensures that is in its own scope, even if it is not a
11860 compound-statement.
11862 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11863 is a (possibly labeled) if statement which is not enclosed in
11864 braces and has an else clause. This is used to implement
11865 -Wparentheses.
11867 CHAIN is a vector of if-else-if conditions. This is used to implement
11868 -Wduplicated-cond.
11870 Returns the new statement. */
11872 static tree
11876 {
11877 tree statement;
11879 token_indent_info body_tinfo
11885 /* Mark if () ; with a special NOP_EXPR. */
11887 {
11898 }
11899 /* if a compound is opened, we simply parse the statement directly. */
11902 /* If the token is not a `{', then we must take special action. */
11903 else
11904 {
11905 /* Create a compound-statement. */
11907 /* Parse the dependent-statement. */
11909 /* Finish the dummy compound-statement. */
11911 }
11913 token_indent_info next_tinfo
11917 /* Return the statement. */
11919 }
11921 /* For some dependent statements (like `while (cond) statement'), we
11922 have already created a scope. Therefore, even if the dependent
11923 statement is a compound-statement, we do not want to create another
11924 scope. */
11926 static void
11929 {
11930 /* If the token is a `{', then we must take special action. */
11932 {
11933 token_indent_info body_tinfo
11937 token_indent_info next_tinfo
11940 }
11941 else
11942 {
11943 /* Avoid calling cp_parser_compound_statement, so that we
11944 don't create a new scope. Do everything else by hand. */
11946 /* If the next keyword is `__label__' we have a label declaration. */
11949 /* Parse an (optional) statement-seq. */
11952 }
11953 }
11955 /* Declarations [gram.dcl.dcl] */
11957 /* Parse an optional declaration-sequence.
11959 declaration-seq:
11960 declaration
11961 declaration-seq declaration */
11963 static void
11965 {
11967 {
11978 {
11979 /* A declaration consisting of a single semicolon is
11980 invalid. Allow it unless we're being pedantic. */
11985 }
11987 /* If we're entering or exiting a region that's implicitly
11988 extern "C", modify the lang context appropriately. */
11990 {
11993 }
11995 {
11998 }
12001 {
12002 /* A top-level declaration can consist solely of a #pragma.
12003 A nested declaration cannot, so this is done here and not
12004 in cp_parser_declaration. (A #pragma at block scope is
12005 handled in cp_parser_statement.) */
12008 }
12010 /* Parse the declaration itself. */
12012 }
12013 }
12015 /* Parse a declaration.
12017 declaration:
12018 block-declaration
12019 function-definition
12020 template-declaration
12021 explicit-instantiation
12022 explicit-specialization
12023 linkage-specification
12024 namespace-definition
12026 GNU extension:
12028 declaration:
12029 __extension__ declaration */
12031 static void
12033 {
12034 cp_token token1;
12035 cp_token token2;
12040 /* Check for the `__extension__' keyword. */
12042 {
12043 /* Parse the qualified declaration. */
12045 /* Restore the PEDANTIC flag. */
12049 }
12051 /* Try to figure out what kind of declaration is present. */
12056 else
12057 {
12060 }
12062 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12065 /* If the next token is `extern' and the following token is a string
12066 literal, then we have a linkage specification. */
12070 /* If the next token is `template', then we have either a template
12071 declaration, an explicit instantiation, or an explicit
12072 specialization. */
12074 {
12075 /* `template <>' indicates a template specialization. */
12079 /* `template <' indicates a template declaration. */
12082 /* Anything else must be an explicit instantiation. */
12083 else
12085 }
12086 /* If the next token is `export', then we have a template
12087 declaration. */
12090 /* If the next token is `extern', 'static' or 'inline' and the one
12091 after that is `template', we have a GNU extended explicit
12092 instantiation directive. */
12099 /* If the next token is `namespace', check for a named or unnamed
12100 namespace definition. */
12109 /* An unnamed namespace definition. */
12113 /* An inline (associated) namespace definition. */
12117 /* Objective-C++ declaration/definition. */
12124 /* At this point we may have a template declared by a concept
12125 introduction. */
12130 else
12131 /* Try to parse a block-declaration, or a function-definition. */
12134 /* Free any declarators allocated. */
12136 }
12138 /* Parse a block-declaration.
12140 block-declaration:
12141 simple-declaration
12142 asm-definition
12143 namespace-alias-definition
12144 using-declaration
12145 using-directive
12147 GNU Extension:
12149 block-declaration:
12150 __extension__ block-declaration
12152 C++0x Extension:
12154 block-declaration:
12155 static_assert-declaration
12157 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12158 part of a declaration-statement. */
12160 static void
12163 {
12167 /* Check for the `__extension__' keyword. */
12169 {
12170 /* Parse the qualified declaration. */
12172 /* Restore the PEDANTIC flag. */
12176 }
12178 /* Peek at the next token to figure out which kind of declaration is
12179 present. */
12182 /* If the next keyword is `asm', we have an asm-definition. */
12184 {
12188 }
12189 /* If the next keyword is `namespace', we have a
12190 namespace-alias-definition. */
12193 /* If the next keyword is `using', we have a
12194 using-declaration, a using-directive, or an alias-declaration. */
12196 {
12201 /* If the token after `using' is `namespace', then we have a
12202 using-directive. */
12206 /* If the second token after 'using' is '=', then we have an
12207 alias-declaration. */
12213 /* Otherwise, it's a using-declaration. */
12214 else
12217 }
12218 /* If the next keyword is `__label__' we have a misplaced label
12219 declaration. */
12221 {
12225 /* If the next token is now a `;', consume it. */
12228 }
12229 /* If the next token is `static_assert' we have a static assertion. */
12232 /* Anything else must be a simple-declaration. */
12233 else
12236 }
12238 /* Parse a simple-declaration.
12240 simple-declaration:
12241 decl-specifier-seq [opt] init-declarator-list [opt] ;
12243 init-declarator-list:
12244 init-declarator
12245 init-declarator-list , init-declarator
12247 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12248 function-definition as a simple-declaration.
12250 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12251 parsed declaration if it is an uninitialized single declarator not followed
12252 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12253 if present, will not be consumed. */
12255 static void
12259 {
12260 cp_decl_specifier_seq decl_specifiers;
12269 /* Defer access checks until we know what is being declared; the
12270 checks for names appearing in the decl-specifier-seq should be
12271 done as if we were in the scope of the thing being declared. */
12274 /* Parse the decl-specifier-seq. We have to keep track of whether
12275 or not the decl-specifier-seq declares a named class or
12276 enumeration type, since that is the only case in which the
12277 init-declarator-list is allowed to be empty.
12279 [dcl.dcl]
12281 In a simple-declaration, the optional init-declarator-list can be
12282 omitted only when declaring a class or enumeration, that is when
12283 the decl-specifier-seq contains either a class-specifier, an
12284 elaborated-type-specifier, or an enum-specifier. */
12286 CP_PARSER_FLAGS_OPTIONAL,
12289 /* We no longer need to defer access checks. */
12292 /* In a block scope, a valid declaration must always have a
12293 decl-specifier-seq. By not trying to parse declarators, we can
12294 resolve the declaration/expression ambiguity more quickly. */
12297 {
12300 }
12302 /* If the next two tokens are both identifiers, the code is
12303 erroneous. The usual cause of this situation is code like:
12305 T t;
12307 where "T" should name a type -- but does not. */
12310 {
12311 /* If parsing tentatively, we should commit; we really are
12312 looking at a declaration. */
12314 /* Give up. */
12316 }
12318 /* If we have seen at least one decl-specifier, and the next token
12319 is not a parenthesis, then we must be looking at a declaration.
12320 (After "int (" we might be looking at a functional cast.) */
12332 /* Keep going until we hit the `;' at the end of the simple
12333 declaration. */
12336 CPP_SEMICOLON))
12337 {
12340 tree decl;
12343 {
12344 /* If we are processing next declarator, comma is expected */
12349 {
12353 }
12354 }
12355 else
12358 /* Parse the init-declarator. */
12361 function_definition_allowed_p,
12363 declares_class_or_enum,
12365 maybe_range_for_decl,
12367 /* If an error occurred while parsing tentatively, exit quickly.
12368 (That usually happens when in the body of a function; each
12369 statement is treated as a declaration-statement until proven
12370 otherwise.) */
12375 {
12378 {
12379 /* If the list of declarators contains more than one declarator,
12380 the type of each declared variable is determined as described
12381 above. If the type deduced for the template parameter U is not
12382 the same in each deduction, the program is ill-formed. */
12387 }
12389 }
12391 /* Handle function definitions specially. */
12393 {
12394 /* If the next token is a `,', then we are probably
12395 processing something like:
12397 void f() {}, *p;
12399 which is erroneous. */
12401 {
12404 "mixing"
12406 }
12407 /* Otherwise, we're done with the list of declarators. */
12408 else
12409 {
12412 }
12413 }
12416 /* The next token should be either a `,' or a `;'. */
12418 /* If it's a `,', there are more declarators to come. */
12421 /* If it's a `;', we are done. */
12424 /* Anything else is an error. */
12425 else
12426 {
12427 /* If we have already issued an error message we don't need
12428 to issue another one. */
12433 /* Skip tokens until we reach the end of the statement. */
12435 /* If the next token is now a `;', consume it. */
12439 }
12440 /* After the first time around, a function-definition is not
12441 allowed -- even if it was OK at first. For example:
12443 int i, f() {}
12445 is not valid. */
12447 }
12449 /* Issue an error message if no declarators are present, and the
12450 decl-specifier-seq does not itself declare a class or
12451 enumeration: [dcl.dcl]/3. */
12453 {
12455 {
12459 /* Ensure an error is issued anyway when finish_decltype_type,
12460 called via cp_parser_decl_specifier_seq, returns a class or
12461 an enumeration (c++/51786). */
12464 }
12465 /* Perform any deferred access checks. */
12467 }
12469 /* Consume the `;'. */
12473 {
12479 }
12481 done:
12483 }
12485 /* Parse a decl-specifier-seq.
12487 decl-specifier-seq:
12488 decl-specifier-seq [opt] decl-specifier
12489 decl-specifier attribute-specifier-seq [opt] (C++11)
12491 decl-specifier:
12492 storage-class-specifier
12493 type-specifier
12494 function-specifier
12495 friend
12496 typedef
12498 GNU Extension:
12500 decl-specifier:
12501 attributes
12503 Concepts Extension:
12505 decl-specifier:
12506 concept
12508 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12510 The parser flags FLAGS is used to control type-specifier parsing.
12512 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12513 flags:
12515 1: one of the decl-specifiers is an elaborated-type-specifier
12516 (i.e., a type declaration)
12517 2: one of the decl-specifiers is an enum-specifier or a
12518 class-specifier (i.e., a type definition)
12520 */
12522 static void
12524 cp_parser_flags flags,
12527 {
12531 cp_decl_spec ds;
12533 /* Clear DECL_SPECS. */
12536 /* Assume no class or enumeration type is declared. */
12539 /* Keep reading specifiers until there are no more to read. */
12541 {
12546 /* Peek at the next token. */
12549 /* Save the first token of the decl spec list for error
12550 reporting. */
12553 /* Handle attributes. */
12555 {
12556 /* Parse the attributes. */
12559 /* In a sequence of declaration specifiers, c++11 attributes
12560 appertain to the type that precede them. In that case
12561 [dcl.spec]/1 says:
12563 The attribute-specifier-seq affects the type only for
12564 the declaration it appears in, not other declarations
12565 involving the same type.
12567 But for now let's force the user to position the
12568 attribute either at the beginning of the declaration or
12569 after the declarator-id, which would clearly mean that it
12570 applies to the declarator. */
12572 {
12574 /* The c++11 attribute is at the beginning of the
12575 declaration. It appertains to the entity being
12577 else
12578 {
12580 {
12581 /* This is an attribute following a
12582 class-specifier. */
12587 }
12588 else
12589 {
12590 decl_specs->std_attributes
12592 attrs);
12595 }
12597 }
12598 }
12600 decl_specs->attributes
12602 attrs);
12606 }
12607 /* Assume we will find a decl-specifier keyword. */
12609 /* If the next token is an appropriate keyword, we can simply
12610 add it to the list. */
12612 {
12613 /* decl-specifier:
12614 friend
12615 constexpr */
12618 {
12621 }
12622 else
12623 {
12625 /* Consume the token. */
12627 }
12640 /* function-specifier:
12641 inline
12642 virtual
12643 explicit */
12650 /* decl-specifier:
12651 typedef */
12654 /* Consume the token. */
12656 /* A constructor declarator cannot appear in a typedef. */
12658 /* The "typedef" keyword can only occur in a declaration; we
12659 may as well commit at this point. */
12666 /* storage-class-specifier:
12667 auto
12668 register
12669 static
12670 extern
12671 mutable
12673 GNU Extension:
12674 thread */
12677 {
12678 /* Consume the token. */
12681 /* Complain about `auto' as a storage specifier, if
12682 we're complaining about C++0x compatibility. */
12686 /* Set the storage class anyway. */
12688 token);
12689 }
12690 else
12691 /* C++0x auto type-specifier. */
12699 /* Consume the token. */
12702 token);
12705 /* Consume the token. */
12711 /* We did not yet find a decl-specifier yet. */
12714 }
12724 /* Constructors are a special case. The `S' in `S()' is not a
12725 decl-specifier; it is the beginning of the declarator. */
12726 constructor_p
12727 = (!found_decl_spec
12728 && constructor_possible_p
12729 && (cp_parser_constructor_declarator_p
12732 /* If we don't have a DECL_SPEC yet, then we must be looking at
12733 a type-specifier. */
12735 {
12738 tree type_spec;
12740 type_spec
12742 decl_specs,
12748 /* If this type-specifier referenced a user-defined type
12749 (a typedef, class-name, etc.), then we can't allow any
12750 more such type-specifiers henceforth.
12752 [dcl.spec]
12754 The longest sequence of decl-specifiers that could
12755 possibly be a type name is taken as the
12756 decl-specifier-seq of a declaration. The sequence shall
12757 be self-consistent as described below.
12759 [dcl.type]
12761 As a general rule, at most one type-specifier is allowed
12762 in the complete decl-specifier-seq of a declaration. The
12763 only exceptions are the following:
12765 -- const or volatile can be combined with any other
12766 type-specifier.
12768 -- signed or unsigned can be combined with char, long,
12769 short, or int.
12771 -- ..
12773 Example:
12775 typedef char* Pc;
12776 void g (const int Pc);
12778 Here, Pc is *not* part of the decl-specifier seq; it's
12779 the declarator. Therefore, once we see a type-specifier
12780 (other than a cv-qualifier), we forbid any additional
12781 user-defined types. We *do* still allow things like `int
12782 int' to be considered a decl-specifier-seq, and issue the
12783 error message later. */
12786 /* A constructor declarator cannot follow a type-specifier. */
12788 {
12793 }
12794 }
12796 /* If we still do not have a DECL_SPEC, then there are no more
12797 decl-specifiers. */
12802 /* After we see one decl-specifier, further decl-specifiers are
12803 always optional. */
12805 }
12807 /* Don't allow a friend specifier with a class definition. */
12812 }
12814 /* Parse an (optional) storage-class-specifier.
12816 storage-class-specifier:
12817 auto
12818 register
12819 static
12820 extern
12821 mutable
12823 GNU Extension:
12825 storage-class-specifier:
12826 thread
12828 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12830 static tree
12832 {
12834 {
12838 /* Fall through for C++98. */
12845 /* Consume the token. */
12850 }
12851 }
12853 /* Parse an (optional) function-specifier.
12855 function-specifier:
12856 inline
12857 virtual
12858 explicit
12860 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12861 Updates DECL_SPECS, if it is non-NULL. */
12863 static tree
12866 {
12869 {
12875 /* 14.5.2.3 [temp.mem]
12877 A member function template shall not be virtual. */
12880 else
12890 }
12892 /* Consume the token. */
12894 }
12896 /* Parse a linkage-specification.
12898 linkage-specification:
12899 extern string-literal { declaration-seq [opt] }
12900 extern string-literal declaration */
12902 static void
12904 {
12905 tree linkage;
12907 /* Look for the `extern' keyword. */
12910 /* Look for the string-literal. */
12913 /* Transform the literal into an identifier. If the literal is a
12914 wide-character string, or contains embedded NULs, then we can't
12915 handle it as the user wants. */
12918 {
12920 /* Assume C++ linkage. */
12922 }
12923 else
12926 /* We're now using the new linkage. */
12929 /* If the next token is a `{', then we're using the first
12930 production. */
12932 {
12936 /* Consume the `{' token. */
12938 /* Parse the declarations. */
12940 /* Look for the closing `}'. */
12942 }
12943 /* Otherwise, there's just one declaration. */
12944 else
12945 {
12948 saved_in_unbraced_linkage_specification_p
12952 parser->in_unbraced_linkage_specification_p
12954 }
12956 /* We're done with the linkage-specification. */
12958 }
12960 /* Parse a static_assert-declaration.
12962 static_assert-declaration:
12963 static_assert ( constant-expression , string-literal ) ;
12964 static_assert ( constant-expression ) ; (C++1Z)
12966 If MEMBER_P, this static_assert is a class member. */
12968 static void
12970 {
12971 tree condition;
12972 tree message;
12974 location_t saved_loc;
12977 /* Peek at the `static_assert' token so we can keep track of exactly
12978 where the static assertion started. */
12982 /* Look for the `static_assert' keyword. */
12984 RT_STATIC_ASSERT))
12987 /* We know we are in a static assertion; commit to any tentative
12988 parse. */
12992 /* Parse the `(' starting the static assertion condition. */
12995 /* Parse the constant-expression. Allow a non-constant expression
12996 here in order to give better diagnostics in finish_static_assert. */
12997 condition =
13003 {
13006 "static_assert without a message "
13008 /* Eat the ')' */
13013 }
13014 else
13015 {
13016 /* Parse the separating `,'. */
13019 /* Parse the string-literal message. */
13024 /* A `)' completes the static assertion. */
13030 }
13032 /* A semicolon terminates the declaration. */
13035 /* Complete the static assertion, which may mean either processing
13036 the static assert now or saving it for template instantiation. */
13038 }
13040 /* Parse the expression in decltype ( expression ). */
13042 static tree
13045 {
13047 tree expr;
13049 /* Since we're going to preserve any side-effects from this parse, set up a
13050 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13051 in the expression. */
13054 /* First, try parsing an id-expression. */
13065 {
13068 cp_id_kind idk;
13072 /* Lookup the name we got back from the id-expression. */
13082 {
13083 /* Complete lookup of the id-expression. */
13084 expr = (finish_id_expression
13097 /* We found an id-expression, but it was something that we
13098 should not have found. This is an error, not something
13099 we can recover from, so note that we found an
13100 id-expression and we'll recover as gracefully as
13101 possible. */
13103 }
13108 /* We have an id-expression. */
13110 }
13113 {
13114 /* Abort the id-expression parse. */
13117 /* Parsing tentatively, again. */
13120 /* Parse a class member access. */
13128 /* We have an id-expression. */
13130 }
13133 /* We have parsed the complete id-expression or member access. */
13135 else
13136 {
13137 /* Abort our attempt to parse an id-expression or member access
13138 expression. */
13141 /* Parse a full expression. */
13144 }
13147 }
13149 /* Parse a `decltype' type. Returns the type.
13151 simple-type-specifier:
13152 decltype ( expression )
13153 C++14 proposal:
13154 decltype ( auto ) */
13156 static tree
13158 {
13159 tree expr;
13168 {
13169 /* Already parsed. */
13172 }
13174 /* Look for the `decltype' token. */
13178 /* Parse the opening `('. */
13182 /* decltype (auto) */
13185 {
13192 }
13194 /* Types cannot be defined in a `decltype' expression. Save away the
13195 old message. */
13198 /* And create the new one. */
13199 parser->type_definition_forbidden_message
13202 /* The restrictions on constant-expressions do not apply inside
13203 decltype expressions. */
13204 saved_integral_constant_expression_p
13206 saved_non_integral_constant_expression_p
13210 /* Within a parenthesized expression, a `>' token is always
13211 the greater-than operator. */
13212 saved_greater_than_is_operator_p
13216 /* Do not actually evaluate the expression. */
13219 /* Do not warn about problems with the expression. */
13224 /* Go back to evaluating expressions. */
13228 /* The `>' token might be the end of a template-id or
13229 template-parameter-list now. */
13230 parser->greater_than_is_operator_p
13233 /* Restore the old message and the integral constant expression
13234 flags. */
13236 parser->integral_constant_expression_p
13238 parser->non_integral_constant_expression_p
13241 /* Parse to the closing `)'. */
13243 {
13247 }
13250 tf_warning_or_error);
13252 rewrite:
13253 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13254 it again. */
13263 }
13265 /* Special member functions [gram.special] */
13267 /* Parse a conversion-function-id.
13269 conversion-function-id:
13270 operator conversion-type-id
13272 Returns an IDENTIFIER_NODE representing the operator. */
13274 static tree
13276 {
13277 tree type;
13278 tree saved_scope;
13279 tree saved_qualifying_scope;
13280 tree saved_object_scope;
13283 /* Look for the `operator' token. */
13286 /* When we parse the conversion-type-id, the current scope will be
13287 reset. However, we need that information in able to look up the
13288 conversion function later, so we save it here. */
13292 /* We must enter the scope of the class so that the names of
13293 entities declared within the class are available in the
13294 conversion-type-id. For example, consider:
13296 struct S {
13297 typedef int I;
13298 operator I();
13299 };
13301 S::operator I() { ... }
13303 In order to see that `I' is a type-name in the definition, we
13304 must be in the scope of `S'. */
13307 /* Parse the conversion-type-id. */
13309 /* Leave the scope of the class, if any. */
13312 /* Restore the saved scope. */
13316 /* If the TYPE is invalid, indicate failure. */
13320 }
13322 /* Parse a conversion-type-id:
13324 conversion-type-id:
13325 type-specifier-seq conversion-declarator [opt]
13327 Returns the TYPE specified. */
13329 static tree
13331 {
13332 tree attributes;
13333 cp_decl_specifier_seq type_specifiers;
13335 tree type_specified;
13338 /* Parse the attributes. */
13342 parser->type_definition_forbidden_message
13345 /* Parse the type-specifiers. */
13352 /* If that didn't work, stop. */
13355 /* Parse the conversion-declarator. */
13363 /* Don't give this error when parsing tentatively. This happens to
13364 work because we always parse this definitively once. */
13367 {
13369 {
13372 }
13376 }
13379 }
13381 /* Parse an (optional) conversion-declarator.
13383 conversion-declarator:
13384 ptr-operator conversion-declarator [opt]
13386 */
13390 {
13393 cp_cv_quals cv_quals;
13395 /* We don't know if there's a ptr-operator next, or not. */
13397 /* Try the ptr-operator. */
13400 /* If it worked, look for more conversion-declarators. */
13402 {
13405 /* Parse another optional declarator. */
13408 declarator = cp_parser_make_indirect_declarator
13412 }
13415 }
13417 /* Parse an (optional) ctor-initializer.
13419 ctor-initializer:
13420 : mem-initializer-list
13422 Returns TRUE iff the ctor-initializer was actually present. */
13424 static bool
13426 {
13427 /* If the next token is not a `:', then there is no
13428 ctor-initializer. */
13430 {
13431 /* Do default initialization of any bases and members. */
13436 }
13438 /* Consume the `:' token. */
13440 /* And the mem-initializer-list. */
13444 }
13446 /* Parse a mem-initializer-list.
13448 mem-initializer-list:
13449 mem-initializer ... [opt]
13450 mem-initializer ... [opt] , mem-initializer-list */
13452 static void
13454 {
13459 /* Let the semantic analysis code know that we are starting the
13460 mem-initializer-list. */
13465 /* Loop through the list. */
13467 {
13468 tree mem_initializer;
13471 /* Parse the mem-initializer. */
13473 /* If the next token is a `...', we're expanding member initializers. */
13475 {
13476 /* Consume the `...'. */
13479 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13480 can be expanded but members cannot. */
13483 {
13488 }
13490 /* Construct the pack expansion type. */
13493 }
13496 {
13500 }
13501 /* Look for a target constructor. */
13505 {
13508 {
13512 }
13514 }
13515 /* Add it to the list, unless it was erroneous. */
13517 {
13520 }
13521 /* If the next token is not a `,', we're done. */
13524 /* Consume the `,' token. */
13526 }
13528 /* Perform semantic analysis. */
13531 }
13533 /* Parse a mem-initializer.
13535 mem-initializer:
13536 mem-initializer-id ( expression-list [opt] )
13537 mem-initializer-id braced-init-list
13539 GNU extension:
13541 mem-initializer:
13542 ( expression-list [opt] )
13544 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13545 class) or FIELD_DECL (for a non-static data member) to initialize;
13546 the TREE_VALUE is the expression-list. An empty initialization
13547 list is represented by void_list_node. */
13549 static tree
13551 {
13552 tree mem_initializer_id;
13553 tree expression_list;
13554 tree member;
13557 /* Find out what is being initialized. */
13559 {
13563 }
13564 else
13565 {
13569 }
13575 {
13582 }
13583 else
13584 {
13594 }
13604 }
13606 /* Parse a mem-initializer-id.
13608 mem-initializer-id:
13609 :: [opt] nested-name-specifier [opt] class-name
13610 decltype-specifier (C++11)
13611 identifier
13613 Returns a TYPE indicating the class to be initialized for the first
13614 production (and the second in C++11). Returns an IDENTIFIER_NODE
13615 indicating the data member to be initialized for the last production. */
13617 static tree
13619 {
13623 tree id;
13627 /* `typename' is not allowed in this context ([temp.res]). */
13629 {
13631 "keyword %<typename%> not allowed in this context (a qualified "
13634 }
13635 /* Look for the optional `::' operator. */
13636 global_scope_p
13640 /* Look for the optional nested-name-specifier. The simplest way to
13641 implement:
13643 [temp.res]
13645 The keyword `typename' is not permitted in a base-specifier or
13646 mem-initializer; in these contexts a qualified name that
13647 depends on a template-parameter is implicitly assumed to be a
13648 type name.
13650 is to assume that we have seen the `typename' keyword at this
13651 point. */
13652 nested_name_specifier_p
13661 /* If there is a `::' operator or a nested-name-specifier, then we
13662 are definitely looking for a class-name. */
13667 typename_type,
13671 /* Otherwise, we could also be looking for an ordinary identifier. */
13674 /* Try a decltype-specifier. */
13676 else
13677 /* Otherwise, try a class-name. */
13681 none_type,
13685 /* If we found one, we're done. */
13688 /* Otherwise, look for an ordinary identifier. */
13690 }
13692 /* Overloading [gram.over] */
13694 /* Parse an operator-function-id.
13696 operator-function-id:
13697 operator operator
13699 Returns an IDENTIFIER_NODE for the operator which is a
13700 human-readable spelling of the identifier, e.g., `operator +'. */
13702 static cp_expr
13704 {
13705 /* Look for the `operator' keyword. */
13708 /* And then the name of the operator itself. */
13710 }
13712 /* Return an identifier node for a user-defined literal operator.
13713 The suffix identifier is chained to the operator name identifier. */
13715 static tree
13717 {
13718 tree identifier;
13725 }
13727 /* Parse an operator.
13729 operator:
13730 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13731 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13732 || ++ -- , ->* -> () []
13734 GNU Extensions:
13736 operator:
13737 <? >? <?= >?=
13739 Returns an IDENTIFIER_NODE for the operator which is a
13740 human-readable spelling of the identifier, e.g., `operator +'. */
13742 static cp_expr
13744 {
13749 /* Peek at the next token. */
13754 /* Figure out which operator we have. */
13756 {
13758 {
13761 /* The keyword should be either `new' or `delete'. */
13766 else
13769 /* Consume the `new' or `delete' token. */
13772 /* Peek at the next token. */
13774 /* If it's a `[' token then this is the array variant of the
13775 operator. */
13777 {
13778 /* Consume the `[' token. */
13780 /* Look for the `]' token. */
13785 }
13786 /* Otherwise, we have the non-array variant. */
13787 else
13793 }
13940 /* Consume the `('. */
13942 /* Look for the matching `)'. */
13947 /* Consume the `['. */
13949 /* Look for the matching `]'. */
13964 {
13971 /* Consume the string. */
13977 {
13980 }
13981 else
13982 {
13984 /* Look for the suffix identifier. */
13989 {
13993 }
13994 else
13995 {
13998 }
13999 }
14004 {
14007 }
14010 {
14013 }
14015 {
14018 }
14020 }
14023 /* Anything else is an error. */
14025 }
14027 /* If we have selected an identifier, we need to consume the
14028 operator token. */
14031 /* Otherwise, no valid operator name was present. */
14032 else
14033 {
14036 }
14039 }
14041 /* Parse a template-declaration.
14043 template-declaration:
14044 export [opt] template < template-parameter-list > declaration
14046 If MEMBER_P is TRUE, this template-declaration occurs within a
14047 class-specifier.
14049 The grammar rule given by the standard isn't correct. What
14050 is really meant is:
14052 template-declaration:
14053 export [opt] template-parameter-list-seq
14054 decl-specifier-seq [opt] init-declarator [opt] ;
14055 export [opt] template-parameter-list-seq
14056 function-definition
14058 template-parameter-list-seq:
14059 template-parameter-list-seq [opt]
14060 template < template-parameter-list >
14062 Concept Extensions:
14064 template-parameter-list-seq:
14065 template < template-parameter-list > requires-clause [opt]
14067 requires-clause:
14068 requires logical-or-expression */
14070 static void
14072 {
14073 /* Check for `export'. */
14075 {
14076 /* Consume the `export' token. */
14078 /* Warn that we do not support `export'. */
14080 }
14083 }
14085 /* Parse a template-parameter-list.
14087 template-parameter-list:
14088 template-parameter
14089 template-parameter-list , template-parameter
14091 Returns a TREE_LIST. Each node represents a template parameter.
14092 The nodes are connected via their TREE_CHAINs. */
14094 static tree
14096 {
14101 /* The loop below parses the template parms. We first need to know
14102 the total number of template parms to be able to compute proper
14103 canonical types of each dependent type. So after the loop, when
14104 we know the total number of template parms,
14105 end_template_parm_list computes the proper canonical types and
14106 fixes up the dependent types accordingly. */
14108 {
14109 tree parameter;
14112 location_t parm_loc;
14114 /* Parse the template-parameter. */
14119 /* Add it to the list. */
14122 parm_loc,
14123 parameter,
14124 is_non_type,
14125 is_parameter_pack);
14126 else
14127 {
14130 }
14132 /* If the next token is not a `,', we're done. */
14135 /* Otherwise, consume the `,' token. */
14137 }
14140 }
14142 /* Parse a introduction-list.
14144 introduction-list:
14145 introduced-parameter
14146 introduction-list , introduced-parameter
14148 introduced-parameter:
14149 ...[opt] identifier
14151 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14152 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14153 WILDCARD_DECL will also have DECL_NAME set and token location in
14154 DECL_SOURCE_LOCATION. */
14156 static tree
14158 {
14162 {
14167 /* Build placeholder. */
14175 /* If the next token is not a `,', we're done. */
14178 /* Otherwise, consume the `,' token. */
14180 }
14182 /* Convert the vec into a TREE_VEC. */
14185 tree parm;
14191 }
14193 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14194 is an abstract declarator. */
14198 {
14203 }
14205 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14206 is an abstract declarator. */
14210 {
14214 else
14216 }
14218 /* Returns true if DECL represents a constrained-parameter. */
14222 {
14227 }
14229 /* Returns true if PARM declares a constrained-parameter. */
14233 {
14235 }
14237 /* Check that the type parameter is only a declarator-id, and that its
14238 type is not cv-qualified. */
14240 bool
14243 {
14248 {
14251 }
14253 /* Don't allow cv-qualified type parameters. */
14256 {
14259 }
14262 }
14264 /* Finish parsing/processing a template type parameter and checking
14265 various restrictions. */
14269 tree id,
14271 {
14274 else
14276 }
14278 static tree
14280 {
14281 /* FIXME: This should probably be copied, and we may need to adjust
14282 the template parameter depths. */
14292 }
14294 /* Finish parsing/processing a template template parameter by borrowing
14295 the template parameter list from the prototype parameter. */
14297 static tree
14299 tree proto,
14300 tree id,
14302 {
14306 }
14308 /* Create a new non-type template parameter from the given PARM
14309 declarator. */
14311 static tree
14314 {
14320 }
14322 /* Build a constrained template parameter based on the PARMDECL
14323 declarator. The type of PARMDECL is the constrained type, which
14324 refers to the prototype template parameter that ultimately
14325 specifies the type of the declared parameter. */
14327 static tree
14332 {
14338 /* A template parameter constrained by a variadic concept shall also
14339 be declared as a template parameter pack. */
14344 /* Build the parameter. Return an error if the declarator was invalid. */
14345 tree parm;
14350 parmdecl);
14351 else
14356 /* Finish the parameter decl and create a node attaching the
14357 default argument and constraint. */
14362 }
14364 /* Returns true if the parsed type actually represents the declaration
14365 of a type template-parameter. */
14369 {
14372 }
14375 /* Returns true if the parsed type actually represents the declaration of
14376 a template template-parameter. */
14378 static bool
14380 {
14383 }
14385 /* Parse a default argument for a type template-parameter.
14386 Note that diagnostics are handled in cp_parser_template_parameter. */
14388 static tree
14390 {
14393 /* Consume the `=' token. */
14398 /* Parse the default-argument. */
14404 {
14408 }
14411 }
14413 /* Parse a default argument for a template template-parameter. */
14415 static tree
14417 {
14422 /* Consume the `='. */
14424 /* Parse the id-expression. */
14426 /* save token before parsing the id-expression, for error
14427 reporting */
14429 tree default_argument
14437 /* If the id-expression was a template-id that refers to
14438 a template-class, we already have the declaration here,
14439 so no further lookup is needed. */
14440 ;
14441 else
14442 /* Look up the name. */
14443 default_argument
14445 none_type,
14451 /* See if the default argument is valid. */
14455 }
14457 /* Parse a template-parameter.
14459 template-parameter:
14460 type-parameter
14461 parameter-declaration
14463 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14464 the parameter. The TREE_PURPOSE is the default value, if any.
14465 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14466 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14467 set to true iff this parameter is a parameter pack. */
14469 static tree
14472 {
14475 tree parm;
14477 /* Assume it is a type parameter or a template parameter. */
14479 /* Assume it not a parameter pack. */
14481 /* Peek at the next token. */
14483 /* If it is `class' or `template', we have a type-parameter. */
14486 /* If it is `class' or `typename' we do not know yet whether it is a
14487 type parameter or a non-type parameter. Consider:
14489 template <typename T, typename T::X X> ...
14491 or:
14493 template <class C, class D*> ...
14495 Here, the first parameter is a type parameter, and the second is
14496 a non-type parameter. We can tell by looking at the token after
14497 the identifier -- if it is a `,', `=', or `>' then we have a type
14498 parameter. */
14500 {
14501 /* Peek at the token after `class' or `typename'. */
14503 /* If it's an ellipsis, we have a template type parameter
14504 pack. */
14507 /* If it's an identifier, skip it. */
14510 /* Now, see if the token looks like the end of a template
14511 parameter. */
14516 }
14518 /* Otherwise, it is a non-type parameter or a constrained parameter.
14520 [temp.param]
14522 When parsing a default template-argument for a non-type
14523 template-parameter, the first non-nested `>' is taken as the end
14524 of the template parameter-list rather than a greater-than
14525 operator. */
14526 parameter_declarator
14533 /* If the parameter declaration is marked as a parameter pack, set
14534 *IS_PARAMETER_PACK to notify the caller. */
14539 {
14540 /* Can happen in some cases of erroneous input (c++/34892). */
14542 /* Consume the `...' for better error recovery. */
14544 }
14546 // The parameter may have been constrained.
14549 parameter_declarator,
14550 is_non_type,
14551 is_parameter_pack);
14553 // Now we're sure that the parameter is a non-type parameter.
14564 }
14566 /* Parse a type-parameter.
14568 type-parameter:
14569 class identifier [opt]
14570 class identifier [opt] = type-id
14571 typename identifier [opt]
14572 typename identifier [opt] = type-id
14573 template < template-parameter-list > class identifier [opt]
14574 template < template-parameter-list > class identifier [opt]
14575 = id-expression
14577 GNU Extension (variadic templates):
14579 type-parameter:
14580 class ... identifier [opt]
14581 typename ... identifier [opt]
14583 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14584 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14585 the declaration of the parameter.
14587 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14589 static tree
14591 {
14593 tree parameter;
14595 /* Look for a keyword to tell us what kind of parameter this is. */
14601 {
14604 {
14605 tree identifier;
14606 tree default_argument;
14608 /* If the next token is an ellipsis, we have a template
14609 argument pack. */
14611 {
14612 /* Consume the `...' token. */
14617 }
14619 /* If the next token is an identifier, then it names the
14620 parameter. */
14623 else
14626 /* Create the parameter. */
14629 /* If the next token is an `=', we have a default argument. */
14631 {
14632 default_argument
14635 /* Template parameter packs cannot have default
14636 arguments. */
14638 {
14641 "template parameter pack %qD cannot have a "
14643 else
14645 "template parameter packs cannot have "
14648 }
14651 }
14652 else
14655 /* Create the combined representation of the parameter and the
14656 default argument. */
14658 }
14662 {
14663 tree identifier;
14664 tree default_argument;
14666 /* Look for the `<'. */
14668 /* Parse the template-parameter-list. */
14670 /* Look for the `>'. */
14673 // If template requirements are present, parse them.
14675 {
14680 }
14682 /* Look for the `class' or 'typename' keywords. */
14684 /* If the next token is an ellipsis, we have a template
14685 argument pack. */
14687 {
14688 /* Consume the `...' token. */
14693 }
14694 /* If the next token is an `=', then there is a
14695 default-argument. If the next token is a `>', we are at
14696 the end of the parameter-list. If the next token is a `,',
14697 then we are at the end of this parameter. */
14701 {
14703 /* Treat invalid names as if the parameter were nameless. */
14706 }
14707 else
14710 /* Create the template parameter. */
14712 identifier);
14714 /* If the next token is an `=', then there is a
14715 default-argument. */
14717 {
14718 default_argument
14721 /* Template parameter packs cannot have default
14722 arguments. */
14724 {
14727 "template parameter pack %qD cannot "
14729 identifier);
14730 else
14734 }
14735 }
14736 else
14739 /* Create the combined representation of the parameter and the
14740 default argument. */
14742 }
14748 }
14751 }
14753 /* Parse a template-id.
14755 template-id:
14756 template-name < template-argument-list [opt] >
14758 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14759 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14760 returned. Otherwise, if the template-name names a function, or set
14761 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14762 names a class, returns a TYPE_DECL for the specialization.
14764 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14765 uninstantiated templates. */
14767 static tree
14773 {
14774 tree templ;
14775 tree arguments;
14776 tree template_id;
14781 /* If the next token corresponds to a template-id, there is no need
14782 to reparse it. */
14785 {
14788 }
14790 /* Avoid performing name lookup if there is no possibility of
14791 finding a template-id. */
14794 && !cp_parser_nth_token_starts_template_argument_list_p
14796 {
14799 }
14801 /* Remember where the template-id starts. */
14807 /* Parse the template-name. */
14810 check_dependency_p,
14811 is_declaration,
14812 tag_type,
14815 {
14818 }
14820 /* Since we're going to preserve any side-effects from this parse, set up a
14821 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14822 in the template arguments. */
14825 /* If we find the sequence `[:' after a template-name, it's probably
14826 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14827 parse correctly the argument list. */
14834 {
14836 /* Change `:' into `::'. */
14838 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14839 CPP_LESS. */
14842 /* Parse the arguments. */
14845 {
14846 /* If we couldn't parse an argument list, then we revert our changes
14847 and return simply an error. Maybe this is not a template-id
14848 after all. */
14853 }
14854 /* Otherwise, emit an error about the invalid digraph, but continue
14855 parsing because we got our argument list. */
14858 {
14861 "%<<:%> is an alternate spelling for %<[%>."
14864 {
14866 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14869 }
14870 }
14871 }
14872 else
14873 {
14874 /* Look for the `<' that starts the template-argument-list. */
14876 {
14879 }
14880 /* Parse the arguments. */
14882 }
14884 /* Build a representation of the specialization. */
14887 TEMPLATE_ID_EXPR,
14891 {
14893 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14894 template (rather than some instantiation thereof) only if
14895 is not nested within some other construct. For example, in
14896 "template <typename T> void f(T) { A<T>::", A<T> is just an
14897 instantiation of A. */
14900 CPP_SCOPE));
14901 template_id
14903 }
14904 /* A template-like identifier may be a partial concept id. */
14910 {
14914 }
14915 else
14916 {
14917 /* If it's not a class-template or a template-template, it should be
14918 a function-template. */
14926 }
14928 /* If parsing tentatively, replace the sequence of tokens that makes
14929 up the template-id with a CPP_TEMPLATE_ID token. That way,
14930 should we re-parse the token stream, we will not have to repeat
14931 the effort required to do the parse, nor will we issue duplicate
14932 error messages about problems during instantiation of the
14933 template. */
14935 /* Don't do this if we had a parse error in a declarator; re-parsing
14936 might succeed if a name changes meaning (60361). */
14940 {
14943 /* Reset the contents of the START_OF_ID token. */
14946 /* Update the location to be of the form:
14947 template-name < template-argument-list [opt] >
14948 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14949 with caret == start at the start of the template-name,
14950 ranging until the closing '>'. */
14951 location_t finish_loc
14953 location_t combined_loc
14957 /* Retrieve any deferred checks. Do not pop this access checks yet
14958 so the memory will not be reclaimed during token replacing below. */
14964 /* Purge all subsequent tokens. */
14967 /* ??? Can we actually assume that, if template_id ==
14968 error_mark_node, we will have issued a diagnostic to the
14969 user, as opposed to simply marking the tentative parse as
14970 failed? */
14973 }
14977 }
14979 /* Parse a template-name.
14981 template-name:
14982 identifier
14984 The standard should actually say:
14986 template-name:
14987 identifier
14988 operator-function-id
14990 A defect report has been filed about this issue.
14992 A conversion-function-id cannot be a template name because they cannot
14993 be part of a template-id. In fact, looking at this code:
14995 a.operator K<int>()
14997 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
14998 It is impossible to call a templated conversion-function-id with an
14999 explicit argument list, since the only allowed template parameter is
15000 the type to which it is converting.
15002 If TEMPLATE_KEYWORD_P is true, then we have just seen the
15003 `template' keyword, in a construction like:
15005 T::template f<3>()
15007 In that case `f' is taken to be a template-name, even though there
15008 is no way of knowing for sure.
15010 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15011 name refers to a set of overloaded functions, at least one of which
15012 is a template, or an IDENTIFIER_NODE with the name of the template,
15013 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15014 names are looked up inside uninstantiated templates. */
15016 static tree
15023 {
15024 tree identifier;
15025 tree decl;
15026 tree fns;
15029 /* If the next token is `operator', then we have either an
15030 operator-function-id or a conversion-function-id. */
15032 {
15033 /* We don't know whether we're looking at an
15034 operator-function-id or a conversion-function-id. */
15036 /* Try an operator-function-id. */
15038 /* If that didn't work, try a conversion-function-id. */
15040 {
15043 }
15044 }
15045 /* Look for the identifier. */
15046 else
15049 /* If we didn't find an identifier, we don't have a template-id. */
15053 /* If the name immediately followed the `template' keyword, then it
15054 is a template-name. However, if the next token is not `<', then
15055 we do not treat it as a template-name, since it is not being used
15056 as part of a template-id. This enables us to handle constructs
15057 like:
15059 template <typename T> struct S { S(); };
15060 template <typename T> S<T>::S();
15062 correctly. We would treat `S' as a template -- if it were `S<T>'
15063 -- but we do not if there is no `<'. */
15067 {
15068 /* In a declaration, in a dependent context, we pretend that the
15069 "template" keyword was present in order to improve error
15070 recovery. For example, given:
15072 template <typename T> void f(T::X<int>);
15074 we want to treat "X<int>" as a template-id. */
15076 && !template_keyword_p
15078 && check_dependency_p
15080 /* Do not do this for dtors (or ctors), since they never
15081 need the template keyword before their name. */
15083 {
15086 /* Explain what went wrong. */
15088 identifier);
15091 /* If parsing tentatively, find the location of the "<" token. */
15094 /* Parse the template arguments so that we can issue error
15095 messages about them. */
15098 /* Skip tokens until we find a good place from which to
15099 continue parsing. */
15104 /* If parsing tentatively, permanently remove the
15105 template argument list. That will prevent duplicate
15106 error messages from being issued about the missing
15107 "template" keyword. */
15113 }
15115 /* If the "template" keyword is present, then there is generally
15116 no point in doing name-lookup, so we just return IDENTIFIER.
15117 But, if the qualifying scope is non-dependent then we can
15118 (and must) do name-lookup normally. */
15124 }
15126 /* Look up the name. */
15128 tag_type,
15131 check_dependency_p,
15137 /* If DECL is a template, then the name was a template-name. */
15139 {
15143 }
15144 else
15145 {
15148 /* The standard does not explicitly indicate whether a name that
15149 names a set of overloaded declarations, some of which are
15150 templates, is a template-name. However, such a name should
15151 be a template-name; otherwise, there is no way to form a
15152 template-id for the overloaded templates. */
15160 {
15161 /* The name does not name a template. */
15164 }
15165 }
15167 /* If DECL is dependent, and refers to a function, then just return
15168 its name; we will look it up again during template instantiation. */
15170 {
15174 }
15177 }
15179 /* Parse a template-argument-list.
15181 template-argument-list:
15182 template-argument ... [opt]
15183 template-argument-list , template-argument ... [opt]
15185 Returns a TREE_VEC containing the arguments. */
15187 static tree
15189 {
15194 tree vec;
15201 /* Even if the template-id appears in an integral
15202 constant-expression, the contents of the argument list do
15203 not. */
15209 /* Parse the arguments. */
15210 do
15211 {
15212 tree argument;
15215 /* Consume the comma. */
15218 /* Parse the template-argument. */
15221 /* If the next token is an ellipsis, we're expanding a template
15222 argument pack. */
15224 {
15226 {
15230 }
15231 /* Consume the `...' token. */
15234 /* Make the argument into a TYPE_PACK_EXPANSION or
15235 EXPR_PACK_EXPANSION. */
15237 }
15240 {
15244 {
15247 }
15248 else
15250 }
15252 }
15268 }
15270 /* Parse a template-argument.
15272 template-argument:
15273 assignment-expression
15274 type-id
15275 id-expression
15277 The representation is that of an assignment-expression, type-id, or
15278 id-expression -- except that the qualified id-expression is
15279 evaluated, so that the value returned is either a DECL or an
15280 OVERLOAD.
15282 Although the standard says "assignment-expression", it forbids
15283 throw-expressions or assignments in the template argument.
15284 Therefore, we use "conditional-expression" instead. */
15286 static tree
15288 {
15289 tree argument;
15295 cp_id_kind idk;
15297 /* There's really no way to know what we're looking at, so we just
15298 try each alternative in order.
15300 [temp.arg]
15302 In a template-argument, an ambiguity between a type-id and an
15303 expression is resolved to a type-id, regardless of the form of
15304 the corresponding template-parameter.
15306 Therefore, we try a type-id first. */
15309 /* If there was no error parsing the type-id but the next token is a
15310 '>>', our behavior depends on which dialect of C++ we're
15311 parsing. In C++98, we probably found a typo for '> >'. But there
15312 are type-id which are also valid expressions. For instance:
15314 struct X { int operator >> (int); };
15315 template <int V> struct Foo {};
15316 Foo<X () >> 5> r;
15318 Here 'X()' is a valid type-id of a function type, but the user just
15319 wanted to write the expression "X() >> 5". Thus, we remember that we
15320 found a valid type-id, but we still try to parse the argument as an
15321 expression to see what happens.
15323 In C++0x, the '>>' will be considered two separate '>'
15324 tokens. */
15328 {
15331 }
15332 else
15333 {
15334 /* If the next token isn't a `,' or a `>', then this argument wasn't
15335 really finished. This means that the argument is not a valid
15336 type-id. */
15339 /* If that worked, we're done. */
15342 }
15343 /* We're still not sure what the argument will be. */
15345 /* Try a template. */
15353 /* If the next token isn't a `,' or a `>', then this argument wasn't
15354 really finished. */
15358 {
15359 /* Figure out what is being referred to. If the id-expression
15360 was for a class template specialization, then we will have a
15361 TYPE_DECL at this point. There is no need to do name lookup
15362 at this point in that case. */
15365 none_type,
15371 /* Handle a constrained-type-specifier for a non-type template
15372 parameter. */
15378 }
15380 {
15384 }
15385 /* It must be a non-type argument. In C++17 any constant-expression is
15386 allowed. */
15390 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15392 -- an integral constant-expression of integral or enumeration
15393 type; or
15395 -- the name of a non-type template-parameter; or
15397 -- the name of an object or function with external linkage...
15399 -- the address of an object or function with external linkage...
15401 -- a pointer to member... */
15402 /* Look for a non-type template parameter. */
15404 {
15416 }
15418 /* If the next token is "&", the argument must be the address of an
15419 object or function with external linkage. */
15422 {
15425 }
15426 /* See if we might have an id-expression. */
15433 {
15436 address_p,
15443 else
15444 {
15445 tree probe;
15448 {
15449 /* Strip the dereference temporarily. */
15452 }
15454 /* If we're in a template, we represent a qualified-id referring
15455 to a static data member as a SCOPE_REF even if the scope isn't
15456 dependent so that we can check access control later. */
15461 {
15462 /* A variable without external linkage might still be a
15463 valid constant-expression, so no error is issued here
15464 if the external-linkage check fails. */
15467 }
15469 /* All overloaded functions are allowed; if the external
15470 linkage test does not pass, an error will be issued
15471 later. */
15472 ;
15476 /* A pointer-to-member. */
15477 ;
15479 ;
15480 else
15484 {
15487 tf_warning_or_error);
15488 else
15491 }
15492 }
15493 }
15494 /* If the argument started with "&", there are no other valid
15495 alternatives at this point. */
15497 {
15500 }
15502 general_expr:
15503 /* If the argument wasn't successfully parsed as a type-id followed
15504 by '>>', the argument can only be a constant expression now.
15505 Otherwise, we try parsing the constant-expression tentatively,
15506 because the argument could really be a type-id. */
15512 else
15513 {
15514 /* With C++17 generalized non-type template arguments we need to handle
15515 lvalue constant expressions, too. */
15518 }
15526 /* We did our best to parse the argument as a non type-id, but that
15527 was the only alternative that matched (albeit with a '>' after
15528 it). We can assume it's just a typo from the user, and a
15529 diagnostic will then be issued. */
15531 }
15533 /* Parse an explicit-instantiation.
15535 explicit-instantiation:
15536 template declaration
15538 Although the standard says `declaration', what it really means is:
15540 explicit-instantiation:
15541 template decl-specifier-seq [opt] declarator [opt] ;
15543 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15544 supposed to be allowed. A defect report has been filed about this
15545 issue.
15547 GNU Extension:
15549 explicit-instantiation:
15550 storage-class-specifier template
15551 decl-specifier-seq [opt] declarator [opt] ;
15552 function-specifier template
15553 decl-specifier-seq [opt] declarator [opt] ; */
15555 static void
15557 {
15559 cp_decl_specifier_seq decl_specifiers;
15564 /* Look for an (optional) storage-class-specifier or
15565 function-specifier. */
15567 {
15568 extension_specifier
15571 extension_specifier
15574 }
15576 /* Look for the `template' keyword. */
15578 /* Let the front end know that we are processing an explicit
15579 instantiation. */
15581 /* [temp.explicit] says that we are supposed to ignore access
15582 control while processing explicit instantiation directives. */
15584 /* Parse a decl-specifier-seq. */
15586 CP_PARSER_FLAGS_OPTIONAL,
15589 /* If there was exactly one decl-specifier, and it declared a class,
15590 and there's no declarator, then we have an explicit type
15591 instantiation. */
15593 {
15594 tree type;
15598 /* Turn access control back on for names used during
15599 template instantiation. */
15604 }
15605 else
15606 {
15608 tree decl;
15610 /* Parse the declarator. */
15611 declarator
15622 {
15625 "explicit instantiation shall not use"
15629 "explicit instantiation shall not use"
15634 /* Turn access control back on for names used during
15635 template instantiation. */
15637 /* Do the explicit instantiation. */
15639 }
15640 else
15641 {
15643 /* Skip the body of the explicit instantiation. */
15645 }
15646 }
15647 /* We're done with the instantiation. */
15653 }
15655 /* Parse an explicit-specialization.
15657 explicit-specialization:
15658 template < > declaration
15660 Although the standard says `declaration', what it really means is:
15662 explicit-specialization:
15663 template <> decl-specifier [opt] init-declarator [opt] ;
15664 template <> function-definition
15665 template <> explicit-specialization
15666 template <> template-declaration */
15668 static void
15670 {
15674 /* Look for the `template' keyword. */
15676 /* Look for the `<'. */
15678 /* Look for the `>'. */
15680 /* We have processed another parameter list. */
15682 /* [temp]
15684 A template ... explicit specialization ... shall not have C
15685 linkage. */
15687 {
15689 /* Give it C++ linkage to avoid confusing other parts of the
15690 front end. */
15693 }
15694 else
15696 /* Let the front end know that we are beginning a specialization. */
15698 {
15701 }
15703 /* If the next keyword is `template', we need to figure out whether
15704 or not we're looking a template-declaration. */
15706 {
15711 else
15713 }
15714 else
15715 /* Parse the dependent declaration. */
15721 /* We're done with the specialization. */
15723 /* For the erroneous case of a template with C linkage, we pushed an
15724 implicit C++ linkage scope; exit that scope now. */
15727 /* We're done with this parameter list. */
15729 }
15731 /* Parse a type-specifier.
15733 type-specifier:
15734 simple-type-specifier
15735 class-specifier
15736 enum-specifier
15737 elaborated-type-specifier
15738 cv-qualifier
15740 GNU Extension:
15742 type-specifier:
15743 __complex__
15745 Returns a representation of the type-specifier. For a
15746 class-specifier, enum-specifier, or elaborated-type-specifier, a
15747 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15749 The parser flags FLAGS is used to control type-specifier parsing.
15751 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15752 in a decl-specifier-seq.
15754 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15755 class-specifier, enum-specifier, or elaborated-type-specifier, then
15756 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15757 if a type is declared; 2 if it is defined. Otherwise, it is set to
15758 zero.
15760 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15761 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15762 is set to FALSE. */
15764 static tree
15766 cp_parser_flags flags,
15771 {
15777 /* Assume this type-specifier does not declare a new type. */
15780 /* And that it does not specify a cv-qualifier. */
15783 /* Peek at the next token. */
15786 /* If we're looking at a keyword, we can use that to guide the
15787 production we choose. */
15790 {
15795 /* Look for the enum-specifier. */
15797 /* If that worked, we're done. */
15799 {
15804 type_spec,
15805 token,
15808 }
15809 else
15812 /* Any of these indicate either a class-specifier, or an
15813 elaborated-type-specifier. */
15820 /* Parse tentatively so that we can back up if we don't find a
15821 class-specifier. */
15823 /* Look for the class-specifier. */
15826 /* If that worked, we're done. */
15828 {
15833 type_spec,
15834 token,
15837 }
15839 /* Fall through. */
15840 elaborated_type_specifier:
15841 /* We're declaring (not defining) a class or enum. */
15845 /* Fall through. */
15847 /* Look for an elaborated-type-specifier. */
15848 type_spec
15849 = (cp_parser_elaborated_type_specifier
15852 is_declaration));
15855 type_spec,
15856 token,
15879 /* The `__complex__' keyword is a GNU extension. */
15885 }
15887 /* Handle simple keywords. */
15889 {
15891 {
15894 }
15896 }
15898 /* If we do not already have a type-specifier, assume we are looking
15899 at a simple-type-specifier. */
15901 decl_specs,
15902 flags);
15904 /* If we didn't find a type-specifier, and a type-specifier was not
15905 optional in this context, issue an error message. */
15907 {
15910 }
15913 }
15915 /* Parse a simple-type-specifier.
15917 simple-type-specifier:
15918 :: [opt] nested-name-specifier [opt] type-name
15919 :: [opt] nested-name-specifier template template-id
15920 char
15921 wchar_t
15922 bool
15923 short
15924 int
15925 long
15926 signed
15927 unsigned
15928 float
15929 double
15930 void
15932 C++0x Extension:
15934 simple-type-specifier:
15935 auto
15936 decltype ( expression )
15937 char16_t
15938 char32_t
15939 __underlying_type ( type-id )
15941 GNU Extension:
15943 simple-type-specifier:
15944 __int128
15945 __typeof__ unary-expression
15946 __typeof__ ( type-id )
15947 __typeof__ ( type-id ) { initializer-list , [opt] }
15949 Concepts Extension:
15951 simple-type-specifier:
15952 constrained-type-specifier
15954 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15955 appropriately updated. */
15957 static tree
15960 cp_parser_flags flags)
15961 {
15966 /* Peek at the next token. */
15969 /* If we're looking at a keyword, things are easy. */
15971 {
16006 {
16009 }
16038 {
16039 /* The 'auto' might be the placeholder return type for a function decl
16040 with trailing return type. */
16049 {
16051 {
16058 }
16061 {
16064 }
16067 }
16071 {
16074 }
16077 {
16080 }
16081 else
16085 {
16088 "use of %<auto%> in lambda parameter declaration "
16089 "only available with "
16091 }
16094 "use of %<auto%> in parameter declaration "
16095 "only available with "
16099 "ISO C++ forbids use of %<auto%> in parameter "
16101 }
16102 else
16107 /* Since DR 743, decltype can either be a simple-type-specifier by
16108 itself or begin a nested-name-specifier. Parsing it will replace
16109 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16110 handling below decide what to do. */
16116 /* Consume the `typeof' token. */
16118 /* Parse the operand to `typeof'. */
16120 /* If it is not already a TYPE, take its type. */
16126 token,
16135 token,
16145 token,
16150 }
16152 /* If token is an already-parsed decltype not followed by ::,
16153 it's a simple-type-specifier. */
16156 {
16159 {
16161 token,
16163 /* Remember that we are handling a decltype in order to
16164 implement the resolution of DR 1510 when the argument
16165 isn't instantiation dependent. */
16167 }
16170 }
16172 /* If the type-specifier was for a built-in type, we're done. */
16174 {
16175 /* Record the type. */
16182 type,
16183 token,
16188 /* Consume the token. */
16194 /* There is no valid C++ program where a non-template type is
16195 followed by a "<". That usually indicates that the user thought
16196 that the type was a template. */
16201 }
16203 /* The type-specifier must be a user-defined type. */
16205 {
16209 /* Don't gobble tokens or issue error messages if this is an
16210 optional type-specifier. */
16214 /* Look for the optional `::' operator. */
16215 global_p
16219 /* Look for the nested-name specifier. */
16220 qualified_p
16228 /* If we have seen a nested-name-specifier, and the next token
16229 is `template', then we are using the template-id production. */
16232 {
16233 /* Look for the template-id. */
16237 none_type,
16239 /* If the template-id did not name a type, we are out of
16240 luck. */
16242 {
16245 }
16246 }
16247 /* Otherwise, look for a type-name. */
16248 else
16250 /* Keep track of all name-lookups performed in class scopes. */
16252 && !global_p
16253 && !qualified_p
16257 /* If it didn't work out, we don't have a TYPE. */
16263 token,
16265 }
16267 /* If we didn't get a type-name, issue an error message. */
16269 {
16272 }
16275 {
16276 /* See if TYPE is an Objective-C type, and if so, parse and
16277 accept any protocol references following it. Do this before
16278 the cp_parser_check_for_invalid_template_id() call, because
16279 Objective-C types can be followed by '<...>' which would
16280 enclose protocol names rather than template arguments, and so
16281 everything is fine. */
16284 {
16288 /* Clobber the "unqualified" type previously entered into
16289 DECL_SPECS with the new, improved protocol-qualified version. */
16294 }
16296 /* There is no valid C++ program where a non-template type is
16297 followed by a "<". That usually indicates that the user
16298 thought that the type was a template. */
16300 none_type,
16302 }
16305 }
16307 /* Parse a type-name.
16309 type-name:
16310 class-name
16311 enum-name
16312 typedef-name
16313 simple-template-id [in c++0x]
16315 enum-name:
16316 identifier
16318 typedef-name:
16319 identifier
16321 Concepts:
16323 type-name:
16324 concept-name
16325 partial-concept-id
16327 concept-name:
16328 identifier
16330 Returns a TYPE_DECL for the type. */
16332 static tree
16334 {
16336 }
16338 /* See above. */
16339 static tree
16341 {
16342 tree type_decl;
16344 /* We can't know yet whether it is a class-name or not. */
16346 /* Try a class-name. */
16348 typename_keyword_p,
16350 none_type,
16354 /* If it's not a class-name, keep looking. */
16356 {
16358 /* It must be a typedef-name or an enum-name. */
16362 /* It is either a simple-template-id representing an
16363 instantiation of an alias template... */
16367 none_type,
16369 /* Note that this must be an instantiation of an alias template
16370 because [temp.names]/6 says:
16372 A template-id that names an alias template specialization
16373 is a type-name.
16375 Whereas [temp.names]/7 says:
16377 A simple-template-id that names a class template
16378 specialization is a class-name.
16380 With concepts, this could also be a partial-concept-id that
16381 declares a non-type template parameter. */
16388 else
16392 /* ... Or a typedef-name or an enum-name. */
16394 }
16397 }
16399 /* Check if DECL and ARGS can form a constrained-type-specifier.
16400 If ARGS is non-null, we try to form a concept check of the
16401 form DECL<?, ARGS> where ? is a wildcard that matches any
16402 kind of template argument. If ARGS is NULL, then we try to
16403 form a concept check of the form DECL<?>. */
16405 static tree
16408 {
16411 /* If we a constrained-type-specifier cannot be deduced. */
16415 /* A constrained type specifier can only be found in an
16416 overload set or as a reference to a template declaration.
16418 FIXME: This might be masking a bug. It's possible that
16419 that the deduction below is causing template specializations
16420 to be formed with the wildcard as an argument. */
16424 /* Try to build a call expression that evaluates the
16425 concept. This can fail if the overload set refers
16426 only to non-templates. */
16432 /* Deduce the checked constraint and the prototype parameter.
16434 FIXME: In certain cases, failure to deduce should be a
16435 diagnosable error. */
16436 tree conc;
16437 tree proto;
16441 /* In template parameter scope, this results in a constrained
16442 parameter. Return a descriptor of that parm. */
16446 /* In a parameter-declaration-clause, constrained-type
16447 specifiers result in invented template parameters. */
16449 {
16452 }
16453 else
16454 {
16455 /* Otherwise, we're in a context where the constrained
16456 type name is deduced and the constraint applies
16457 after deduction. */
16459 }
16462 }
16464 /* If DECL refers to a concept, return a TYPE_DECL representing
16465 the result of using the constrained type specifier in the
16466 current context. DECL refers to a concept if
16468 - it is an overload set containing a function concept taking a single
16469 type argument, or
16471 - it is a variable concept taking a single type argument. */
16473 static tree
16475 {
16481 else
16483 }
16485 /* Check if DECL and ARGS form a partial-concept-id. If so,
16486 assign ID to the resulting constrained placeholder.
16488 Returns true if the partial-concept-id designates a placeholder
16489 and false otherwise. Note that *id is set to NULL_TREE in
16490 this case. */
16492 static tree
16494 {
16496 }
16498 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16499 or a concept-name.
16501 enum-name:
16502 identifier
16504 typedef-name:
16505 identifier
16507 concept-name:
16508 identifier
16510 Returns a TYPE_DECL for the type. */
16512 static tree
16514 {
16515 tree type_decl;
16516 tree identifier;
16523 /* Look up the type-name. */
16528 /* If we found an overload set, then it may refer to a concept-name. */
16534 {
16535 /* See if this is an Objective-C type. */
16540 }
16542 /* Issue an error if we did not find a type-name. */
16544 /* In Objective-C, we have the complication that class names are
16545 normally type names and start declarations (eg, the
16546 "NSObject" in "NSObject *object;"), but can be used in an
16547 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16548 is an expression. So, a classname followed by a dot is not a
16549 valid type-name. */
16552 {
16557 }
16558 /* Remember that the name was used in the definition of the
16559 current class so that we can check later to see if the
16560 meaning would have been different after the class was
16561 entirely defined. */
16567 }
16569 /* Parse an elaborated-type-specifier. Note that the grammar given
16570 here incorporates the resolution to DR68.
16572 elaborated-type-specifier:
16573 class-key :: [opt] nested-name-specifier [opt] identifier
16574 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16575 enum-key :: [opt] nested-name-specifier [opt] identifier
16576 typename :: [opt] nested-name-specifier identifier
16577 typename :: [opt] nested-name-specifier template [opt]
16578 template-id
16580 GNU extension:
16582 elaborated-type-specifier:
16583 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16584 class-key attributes :: [opt] nested-name-specifier [opt]
16585 template [opt] template-id
16586 enum attributes :: [opt] nested-name-specifier [opt] identifier
16588 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16589 declared `friend'. If IS_DECLARATION is TRUE, then this
16590 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16591 something is being declared.
16593 Returns the TYPE specified. */
16595 static tree
16599 {
16601 tree identifier;
16604 tree globalscope;
16607 /* See if we're looking at the `enum' keyword. */
16609 {
16610 /* Consume the `enum' token. */
16612 /* Remember that it's an enumeration type. */
16614 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16615 enums) is used here. */
16618 {
16622 /* Consume the `struct' or `class' and parse it anyway. */
16624 }
16625 /* Parse the attributes. */
16627 }
16628 /* Or, it might be `typename'. */
16630 RID_TYPENAME))
16631 {
16632 /* Consume the `typename' token. */
16634 /* Remember that it's a `typename' type. */
16636 }
16637 /* Otherwise it must be a class-key. */
16638 else
16639 {
16643 /* Parse the attributes. */
16645 }
16647 /* Look for the `::' operator. */
16650 /* Look for the nested-name-specifier. */
16652 {
16657 is_declaration))
16659 }
16660 else
16661 /* Even though `typename' is not present, the proposed resolution
16662 to Core Issue 180 says that in `class A<T>::B', `B' should be
16663 considered a type-name, even if `A<T>' is dependent. */
16668 is_declaration);
16669 /* For everything but enumeration types, consider a template-id.
16670 For an enumeration type, consider only a plain identifier. */
16672 {
16674 tree decl;
16676 /* Allow the `template' keyword. */
16678 /* If we didn't see `template', we don't know if there's a
16679 template-id or not. */
16682 /* Parse the template-id. */
16686 tag_type,
16687 is_declaration);
16688 /* If we didn't find a template-id, look for an ordinary
16689 identifier. */
16691 ;
16692 /* We can get here when cp_parser_template_id, called by
16693 cp_parser_class_name with tag_type == none_type, succeeds
16694 and caches a BASELINK. Then, when called again here,
16695 instead of failing and returning an error_mark_node
16696 returns it (see template/typename17.C in C++11).
16697 ??? Could we diagnose this earlier? */
16699 {
16702 }
16703 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16704 in effect, then we must assume that, upon instantiation, the
16705 template will correspond to a class. */
16709 typename_type,
16711 /* If the `typename' keyword is in effect and DECL is not a type
16712 decl, then type is non existent. */
16714 ;
16720 }
16723 {
16728 {
16731 }
16733 /* For a `typename', we needn't call xref_tag. */
16739 /* Template parameter lists apply only if we are not within a
16740 function parameter list. */
16741 bool template_parm_lists_apply
16750 /* Look up a qualified name in the usual way. */
16752 {
16753 tree decl;
16754 tree ambiguous_decls;
16757 tag_type,
16764 /* If the lookup was ambiguous, an error will already have been
16765 issued. */
16769 /* If we are parsing friend declaration, DECL may be a
16770 TEMPLATE_DECL tree node here. However, we need to check
16771 whether this TEMPLATE_DECL results in valid code. Consider
16772 the following example:
16774 namespace N {
16775 template <class T> class C {};
16776 }
16777 class X {
16778 template <class T> friend class N::C; // #1, valid code
16779 };
16780 template <class T> class Y {
16781 friend class N::C; // #2, invalid code
16782 };
16784 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16785 name lookup of `N::C'. We see that friend declaration must
16786 be template for the code to be valid. Note that
16787 processing_template_decl does not work here since it is
16788 always 1 for the above two cases. */
16790 decl = (cp_parser_maybe_treat_template_as_class
16795 {
16797 identifier,
16800 }
16803 {
16807 allow_template);
16811 }
16813 /* Forward declarations of nested types, such as
16815 class C1::C2;
16816 class C1::C2::C3;
16818 are invalid unless all components preceding the final '::'
16819 are complete. If all enclosing types are complete, these
16820 declarations become merely pointless.
16822 Invalid forward declarations of nested types are errors
16823 caught elsewhere in parsing. Those that are pointless arrive
16824 here. */
16831 }
16832 else
16833 {
16834 /* An elaborated-type-specifier sometimes introduces a new type and
16835 sometimes names an existing type. Normally, the rule is that it
16836 introduces a new type only if there is not an existing type of
16837 the same name already in scope. For example, given:
16839 struct S {};
16840 void f() { struct S s; }
16842 the `struct S' in the body of `f' is the same `struct S' as in
16843 the global scope; the existing definition is used. However, if
16844 there were no global declaration, this would introduce a new
16845 local class named `S'.
16847 An exception to this rule applies to the following code:
16849 namespace N { struct S; }
16851 Here, the elaborated-type-specifier names a new type
16852 unconditionally; even if there is already an `S' in the
16853 containing scope this declaration names a new type.
16854 This exception only applies if the elaborated-type-specifier
16855 forms the complete declaration:
16857 [class.name]
16859 A declaration consisting solely of `class-key identifier ;' is
16860 either a redeclaration of the name in the current scope or a
16861 forward declaration of the identifier as a class name. It
16862 introduces the name into the current scope.
16864 We are in this situation precisely when the next token is a `;'.
16866 An exception to the exception is that a `friend' declaration does
16867 *not* name a new type; i.e., given:
16869 struct S { friend struct T; };
16871 `T' is not a new type in the scope of `S'.
16873 Also, `new struct S' or `sizeof (struct S)' never results in the
16874 definition of a new type; a new type can only be declared in a
16875 declaration context. */
16877 tag_scope ts;
16881 /* Friends have special name lookup rules. */
16885 CPP_SEMICOLON))
16886 /* This is a `class-key identifier ;' */
16888 else
16891 template_p =
16892 (template_parm_lists_apply
16895 /* An unqualified name was used to reference this type, so
16896 there were no qualifying templates. */
16904 }
16905 }
16910 /* Allow attributes on forward declarations of classes. */
16912 {
16922 else
16925 }
16928 {
16929 /* Indicate whether this class was declared as a `class' or as a
16930 `struct'. */
16934 }
16936 /* A "<" cannot follow an elaborated type specifier. If that
16937 happens, the user was probably trying to form a template-id. */
16942 }
16944 /* Parse an enum-specifier.
16946 enum-specifier:
16947 enum-head { enumerator-list [opt] }
16948 enum-head { enumerator-list , } [C++0x]
16950 enum-head:
16951 enum-key identifier [opt] enum-base [opt]
16952 enum-key nested-name-specifier identifier enum-base [opt]
16954 enum-key:
16955 enum
16956 enum class [C++0x]
16957 enum struct [C++0x]
16959 enum-base: [C++0x]
16960 : type-specifier-seq
16962 opaque-enum-specifier:
16963 enum-key identifier enum-base [opt] ;
16965 GNU Extensions:
16966 enum-key attributes[opt] identifier [opt] enum-base [opt]
16967 { enumerator-list [opt] }attributes[opt]
16968 enum-key attributes[opt] identifier [opt] enum-base [opt]
16969 { enumerator-list, }attributes[opt] [C++0x]
16971 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16972 if the token stream isn't an enum-specifier after all. */
16974 static tree
16976 {
16977 tree identifier;
16979 tree prev_scope;
16981 tree attributes;
16994 /* Parse tentatively so that we can back up if we don't find a
16995 enum-specifier. */
16998 /* Caller guarantees that the current token is 'enum', an identifier
16999 possibly follows, and the token after that is an opening brace.
17000 If we don't have an identifier, fabricate an anonymous name for
17001 the enumeration being defined. */
17004 /* Parse the "class" or "struct", which indicates a scoped
17005 enumeration type in C++0x. */
17008 {
17012 /* Consume the `struct' or `class' token. */
17016 }
17020 /* Clear the qualification. */
17025 /* Figure out in what scope the declaration is being placed. */
17031 nested_name_specifier
17039 {
17040 tree name;
17044 enum_type,
17049 input_location);
17051 {
17054 {
17055 /* Are template enums allowed in ISO? */
17059 /* ignore a typename reference, for it will be solved by name
17060 in start_enum. */
17062 }
17063 }
17066 else
17067 {
17072 }
17073 }
17074 else
17075 {
17078 else
17079 {
17085 }
17086 }
17089 /* Check for the `:' that denotes a specified underlying type in C++0x.
17090 Note that a ':' could also indicate a bitfield width, however. */
17092 {
17093 cp_decl_specifier_seq type_specifiers;
17095 /* Consume the `:'. */
17098 /* Parse the type-specifier-seq. */
17103 /* At this point this is surely not elaborated type specifier. */
17112 /* If that didn't work, stop. */
17114 {
17120 }
17121 }
17123 /* Look for the `{' but don't consume it yet. */
17125 {
17127 {
17130 {
17133 }
17134 }
17135 /* An opaque-enum-specifier must have a ';' here. */
17138 {
17141 {
17144 }
17145 }
17146 }
17152 {
17154 {
17158 }
17160 {
17162 }
17163 }
17165 /* Issue an error message if type-definitions are forbidden here. */
17168 else
17169 /* Create the new type. We do this before consuming the opening
17170 brace so the enum will be recorded as being on the line of its
17171 tag (or the 'enum' keyword, if there is no tag). */
17175 /* If the next token is not '{' it is an opaque-enum-specifier or an
17176 elaborated-type-specifier. */
17178 {
17182 {
17183 /* The following catches invalid code such as:
17184 enum class S<int>::E { A, B, C }; */
17192 {
17196 nested_name_specifier);
17198 }
17201 {
17203 "%qT for enum declaration does not name a class "
17206 }
17207 /* If that scope does not contain the scope in which the
17208 class was originally declared, the program is invalid. */
17210 nested_name_specifier))
17211 {
17214 "declaration of %qD in namespace %qD which does not "
17217 else
17219 "declaration of %qD in %qD which does not "
17223 }
17224 }
17229 /* Consume the opening brace. */
17236 {
17240 }
17241 else
17242 {
17248 }
17252 /* If the next token is not '}', then there are some enumerators. */
17254 {
17258 }
17259 else
17262 /* Consume the final '}'. */
17268 }
17269 else
17270 {
17271 /* If a ';' follows, then it is an opaque-enum-specifier
17272 and additional restrictions apply. */
17274 {
17281 }
17282 }
17284 /* Look for trailing attributes to apply to this enumeration, and
17285 apply them if appropriate. */
17287 {
17290 trailing_attr,
17292 }
17294 /* Finish up the enumeration. */
17296 {
17301 }
17304 {
17306 {
17309 }
17311 {
17313 }
17314 }
17315 out:
17318 }
17320 /* Parse an enumerator-list. The enumerators all have the indicated
17321 TYPE.
17323 enumerator-list:
17324 enumerator-definition
17325 enumerator-list , enumerator-definition */
17327 static void
17329 {
17331 {
17332 /* Parse an enumerator-definition. */
17335 /* If the next token is not a ',', we've reached the end of
17336 the list. */
17339 /* Otherwise, consume the `,' and keep going. */
17341 /* If the next token is a `}', there is a trailing comma. */
17343 {
17348 }
17349 }
17350 }
17352 /* Parse an enumerator-definition. The enumerator has the indicated
17353 TYPE.
17355 enumerator-definition:
17356 enumerator
17357 enumerator = constant-expression
17359 enumerator:
17360 identifier
17362 GNU Extensions:
17364 enumerator-definition:
17365 enumerator attributes [opt]
17366 enumerator attributes [opt] = constant-expression */
17368 static void
17370 {
17371 tree identifier;
17372 tree value;
17373 location_t loc;
17375 /* Save the input location because we are interested in the location
17376 of the identifier and not the location of the explicit value. */
17379 /* Look for the identifier. */
17384 /* Parse any specified attributes. */
17387 /* If the next token is an '=', then there is an explicit value. */
17389 {
17390 /* Consume the `=' token. */
17392 /* Parse the value. */
17394 }
17395 else
17398 /* If we are processing a template, make sure the initializer of the
17399 enumerator doesn't contain any bare template parameter pack. */
17403 /* Create the enumerator. */
17405 }
17407 /* Parse a namespace-name.
17409 namespace-name:
17410 original-namespace-name
17411 namespace-alias
17413 Returns the NAMESPACE_DECL for the namespace. */
17415 static tree
17417 {
17418 tree identifier;
17419 tree namespace_decl;
17423 /* Get the name of the namespace. */
17428 /* Look up the identifier in the currently active scope. Look only
17429 for namespaces, due to:
17431 [basic.lookup.udir]
17433 When looking up a namespace-name in a using-directive or alias
17434 definition, only namespace names are considered.
17436 And:
17438 [basic.lookup.qual]
17440 During the lookup of a name preceding the :: scope resolution
17441 operator, object, function, and enumerator names are ignored.
17443 (Note that cp_parser_qualifying_entity only calls this
17444 function if the token after the name is the scope resolution
17445 operator.) */
17447 none_type,
17453 /* If it's not a namespace, issue an error. */
17456 {
17461 }
17464 }
17466 /* Parse a namespace-definition.
17468 namespace-definition:
17469 named-namespace-definition
17470 unnamed-namespace-definition
17472 named-namespace-definition:
17473 original-namespace-definition
17474 extension-namespace-definition
17476 original-namespace-definition:
17477 namespace identifier { namespace-body }
17479 extension-namespace-definition:
17480 namespace original-namespace-name { namespace-body }
17482 unnamed-namespace-definition:
17483 namespace { namespace-body } */
17485 static void
17487 {
17497 {
17501 }
17502 else
17505 /* Look for the `namespace' keyword. */
17508 /* Parse any specified attributes before the identifier. */
17511 /* Get the name of the namespace. We do not attempt to distinguish
17512 between an original-namespace-definition and an
17513 extension-namespace-definition at this point. The semantic
17514 analysis routines are responsible for that. */
17517 else
17520 /* Parse any specified attributes after the identifier. */
17523 {
17526 else
17528 }
17530 /* Start the namespace. */
17533 /* Parse any nested namespace definition. */
17535 {
17540 "nested namespace definitions only available with "
17545 {
17549 else
17550 {
17553 }
17556 }
17557 }
17559 /* Look for the `{' to validate starting the namespace. */
17562 /* "inline namespace" is equivalent to a stub namespace definition
17563 followed by a strong using directive. */
17565 {
17567 /* Set up namespace association. */
17571 /* Import the contents of the inline namespace. */
17575 }
17581 /* Parse the body of the namespace. */
17587 /* Finish the nested namespace definitions. */
17591 /* Finish the namespace. */
17593 /* Look for the final `}'. */
17595 }
17597 /* Parse a namespace-body.
17599 namespace-body:
17600 declaration-seq [opt] */
17602 static void
17604 {
17606 }
17608 /* Parse a namespace-alias-definition.
17610 namespace-alias-definition:
17611 namespace identifier = qualified-namespace-specifier ; */
17613 static void
17615 {
17616 tree identifier;
17617 tree namespace_specifier;
17621 /* Look for the `namespace' keyword. */
17623 /* Look for the identifier. */
17627 /* Look for the `=' token. */
17630 {
17632 /* Skip the definition. */
17637 }
17639 /* Look for the qualified-namespace-specifier. */
17640 namespace_specifier
17642 /* Look for the `;' token. */
17645 /* Register the alias in the symbol table. */
17647 }
17649 /* Parse a qualified-namespace-specifier.
17651 qualified-namespace-specifier:
17652 :: [opt] nested-name-specifier [opt] namespace-name
17654 Returns a NAMESPACE_DECL corresponding to the specified
17655 namespace. */
17657 static tree
17659 {
17660 /* Look for the optional `::'. */
17664 /* Look for the optional nested-name-specifier. */
17672 }
17674 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17675 access declaration.
17677 using-declaration:
17678 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17679 using :: unqualified-id ;
17681 access-declaration:
17682 qualified-id ;
17684 */
17686 static bool
17689 {
17693 tree decl;
17694 tree identifier;
17695 tree qscope;
17700 {
17703 }
17704 else
17705 {
17706 /* Look for the `using' keyword. */
17709 /* Peek at the next token. */
17711 /* See if it's `typename'. */
17713 {
17714 /* Remember that we've seen it. */
17716 /* Consume the `typename' token. */
17718 }
17719 }
17721 /* Look for the optional global scope qualification. */
17722 global_scope_p
17727 /* If we saw `typename', or didn't see `::', then there must be a
17728 nested-name-specifier present. */
17730 {
17736 {
17739 }
17740 }
17741 /* Otherwise, we could be in either of the two productions. In that
17742 case, treat the nested-name-specifier as optional. */
17743 else
17755 /* Something has already gone wrong; there's no need to parse
17756 further. Since an error has occurred, the return value of
17757 cp_parser_parse_definitely will be false, as required. */
17761 /* Parse the unqualified-id. */
17769 {
17774 }
17776 /* The function we call to handle a using-declaration is different
17777 depending on what scope we are in. */
17779 ;
17782 /* [namespace.udecl]
17784 A using declaration shall not name a template-id. */
17787 else
17788 {
17790 {
17791 /* Create the USING_DECL. */
17798 {
17801 }
17802 else
17803 /* Add it to the list of members in this class. */
17805 }
17806 else
17807 {
17809 identifier,
17816 {
17819 }
17822 else
17824 }
17825 }
17827 /* Look for the final `;'. */
17832 "access declarations are deprecated "
17833 "in favour of using-declarations; "
17837 }
17839 /* Parse an alias-declaration.
17841 alias-declaration:
17842 using identifier attribute-specifier-seq [opt] = type-id */
17844 static tree
17846 {
17848 location_t id_location;
17850 cp_decl_specifier_seq decl_specs;
17854 /* Look for the `using' keyword. */
17855 cp_token *using_token
17877 /* Now we are going to parse the type-id of the declaration. */
17879 /*
17880 [dcl.type]/3 says:
17882 "A type-specifier-seq shall not define a class or enumeration
17883 unless it appears in the type-id of an alias-declaration (7.1.3) that
17884 is not the declaration of a template-declaration."
17886 In other words, if we currently are in an alias template, the
17887 type-id should not define a type.
17889 So let's set parser->type_definition_forbidden_message in that
17890 case; cp_parser_check_type_definition (called by
17891 cp_parser_class_specifier) will then emit an error if a type is
17892 defined in the type-id. */
17894 {
17898 }
17902 /* Restore the error message if need be. */
17908 {
17911 }
17913 /* A typedef-name can also be introduced by an alias-declaration. The
17914 identifier following the using keyword becomes a typedef-name. It has
17915 the same semantics as if it were introduced by the typedef
17916 specifier. In particular, it does not define a new type and it shall
17917 not appear in the type-id. */
17922 {
17925 ds_attribute,
17926 attrs_token);
17927 }
17929 ds_typedef,
17930 using_token);
17932 ds_alias,
17933 using_token);
17942 else
17948 // Attach constraints to the alias declaration.
17950 {
17954 }
17961 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17962 added into the symbol table; otherwise, return the TYPE_DECL. */
17966 {
17970 }
17973 }
17975 /* Parse a using-directive.
17977 using-directive:
17978 using namespace :: [opt] nested-name-specifier [opt]
17979 namespace-name ; */
17981 static void
17983 {
17984 tree namespace_decl;
17985 tree attribs;
17987 /* Look for the `using' keyword. */
17989 /* And the `namespace' keyword. */
17991 /* Look for the optional `::' operator. */
17993 /* And the optional nested-name-specifier. */
17999 /* Get the namespace being used. */
18001 /* And any specified attributes. */
18003 /* Update the symbol table. */
18005 /* Look for the final `;'. */
18007 }
18009 /* Parse an asm-definition.
18011 asm-definition:
18012 asm ( string-literal ) ;
18014 GNU Extension:
18016 asm-definition:
18017 asm volatile [opt] ( string-literal ) ;
18018 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18019 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18020 : asm-operand-list [opt] ) ;
18021 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18022 : asm-operand-list [opt]
18023 : asm-clobber-list [opt] ) ;
18024 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18025 : asm-clobber-list [opt]
18026 : asm-goto-list ) ; */
18028 static void
18030 {
18031 tree string;
18036 tree asm_stmt;
18044 /* Look for the `asm' keyword. */
18049 {
18052 }
18054 /* See if the next token is `volatile'. */
18057 {
18058 /* Remember that we saw the `volatile' keyword. */
18060 /* Consume the token. */
18062 }
18066 {
18067 /* Remember that we saw the `goto' keyword. */
18069 /* Consume the token. */
18071 }
18072 /* Look for the opening `('. */
18075 /* Look for the string. */
18078 {
18082 }
18084 /* If we're allowing GNU extensions, check for the extended assembly
18085 syntax. Unfortunately, the `:' tokens need not be separated by
18086 a space in C, and so, for compatibility, we tolerate that here
18087 too. Doing that means that we have to treat the `::' operator as
18088 two `:' tokens. */
18093 {
18098 /* The extended syntax was used. */
18101 /* Look for outputs. */
18103 {
18104 /* Consume the `:'. */
18106 /* Parse the output-operands. */
18108 CPP_COLON)
18110 CPP_SCOPE)
18112 CPP_CLOSE_PAREN)
18114 {
18118 }
18119 }
18120 /* If the next token is `::', there are no outputs, and the
18121 next token is the beginning of the inputs. */
18123 /* The inputs are coming next. */
18126 /* Look for inputs. */
18129 {
18130 /* Consume the `:' or `::'. */
18132 /* Parse the output-operands. */
18134 CPP_COLON)
18136 CPP_SCOPE)
18138 CPP_CLOSE_PAREN))
18139 {
18143 }
18144 }
18146 /* The clobbers are coming next. */
18149 /* Look for clobbers. */
18152 {
18154 /* Consume the `:' or `::'. */
18156 /* Parse the clobbers. */
18158 CPP_COLON)
18160 CPP_CLOSE_PAREN))
18162 }
18165 /* The labels are coming next. */
18168 /* Look for labels. */
18171 {
18173 /* Consume the `:' or `::'. */
18175 /* Parse the labels. */
18177 }
18181 }
18185 /* Look for the closing `)'. */
18193 {
18194 /* Create the ASM_EXPR. */
18196 {
18199 /* If the extended syntax was not used, mark the ASM_EXPR. */
18201 {
18207 }
18208 }
18209 else
18211 }
18212 }
18214 /* Declarators [gram.dcl.decl] */
18216 /* Parse an init-declarator.
18218 init-declarator:
18219 declarator initializer [opt]
18221 GNU Extension:
18223 init-declarator:
18224 declarator asm-specification [opt] attributes [opt] initializer [opt]
18226 function-definition:
18227 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18228 function-body
18229 decl-specifier-seq [opt] declarator function-try-block
18231 GNU Extension:
18233 function-definition:
18234 __extension__ function-definition
18236 TM Extension:
18238 function-definition:
18239 decl-specifier-seq [opt] declarator function-transaction-block
18241 The DECL_SPECIFIERS apply to this declarator. Returns a
18242 representation of the entity declared. If MEMBER_P is TRUE, then
18243 this declarator appears in a class scope. The new DECL created by
18244 this declarator is returned.
18246 The CHECKS are access checks that should be performed once we know
18247 what entity is being declared (and, therefore, what classes have
18248 befriended it).
18250 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18251 for a function-definition here as well. If the declarator is a
18252 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18253 be TRUE upon return. By that point, the function-definition will
18254 have been completely parsed.
18256 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18257 is FALSE.
18259 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18260 parsed declaration if it is an uninitialized single declarator not followed
18261 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18262 if present, will not be consumed. If returned, this declarator will be
18263 created with SD_INITIALIZED but will not call cp_finish_decl.
18265 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18266 and there is an initializer, the pointed location_t is set to the
18267 location of the '=' or `(', or '{' in C++11 token introducing the
18268 initializer. */
18270 static tree
18280 {
18284 tree prefix_attributes;
18286 tree asm_specification;
18287 tree initializer;
18289 tree scope;
18291 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18292 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18293 "(...)". */
18304 /* Gather the attributes that were provided with the
18305 decl-specifiers. */
18308 /* Assume that this is not the declarator for a function
18309 definition. */
18313 /* Default arguments are only permitted for function parameters. */
18317 /* Defer access checks while parsing the declarator; we cannot know
18318 what names are accessible until we know what is being
18319 declared. */
18322 /* Parse the declarator. */
18324 declarator
18329 /* Gather up the deferred checks. */
18334 /* If the DECLARATOR was erroneous, there's no need to go
18335 further. */
18339 /* Check that the number of template-parameter-lists is OK. */
18349 /* Figure out what scope the entity declared by the DECLARATOR is
18350 located in. `grokdeclarator' sometimes changes the scope, so
18351 we compute it now. */
18354 /* Perform any lookups in the declared type which were thought to be
18355 dependent, but are not in the scope of the declarator. */
18356 decl_specifiers->type
18359 /* If we're allowing GNU extensions, look for an
18360 asm-specification. */
18362 {
18363 /* Look for an asm-specification. */
18366 }
18367 else
18370 /* Look for attributes. */
18374 /* Peek at the next token. */
18380 {
18381 /* Check to see if the token indicates the start of a
18382 function-definition. */
18384 {
18386 {
18387 /* If a function-definition should not appear here, issue an
18388 error message. */
18392 }
18394 location_t func_brace_location
18397 /* Neither attributes nor an asm-specification are allowed
18398 on a function-definition. */
18401 "an asm-specification is not allowed "
18405 "attributes are not allowed "
18407 /* This is a function-definition. */
18410 /* Parse the function definition. */
18413 decl_specifiers,
18414 declarator,
18415 prefix_attributes);
18416 else
18417 decl =
18418 (cp_parser_function_definition_from_specifiers_and_declarator
18422 {
18423 /* This is where the prologue starts... */
18426 }
18429 }
18430 }
18432 {
18433 /* A non-template declaration involving a function parameter list
18434 containing an implicit template parameter will be made into a
18435 template. If the resulting declaration is not going to be an
18436 actual function then finish the template scope here to prevent it.
18437 An error message will be issued once we have a decl to talk about.
18439 FIXME probably we should do type deduction rather than create an
18440 implicit template, but the standard currently doesn't allow it. */
18443 }
18445 /* [dcl.dcl]
18447 Only in function declarations for constructors, destructors, and
18448 type conversions can the decl-specifier-seq be omitted.
18450 We explicitly postpone this check past the point where we handle
18451 function-definitions because we tolerate function-definitions
18452 that are missing their return types in some modes. */
18454 {
18458 }
18460 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18464 {
18475 {
18481 }
18482 }
18483 else
18484 {
18485 /* If the init-declarator isn't initialized and isn't followed by a
18486 `,' or `;', it's not a valid init-declarator. */
18489 {
18492 else
18493 {
18497 }
18498 }
18501 }
18503 /* Because start_decl has side-effects, we should only call it if we
18504 know we're going ahead. By this point, we know that we cannot
18505 possibly be looking at any other construct. */
18508 /* Enter the newly declared entry in the symbol table. If we're
18509 processing a declaration in a class-specifier, we wait until
18510 after processing the initializer. */
18512 {
18520 /* Adjust location of decl if declarator->id_loc is more appropriate:
18521 set, and decl wasn't merged with another decl, in which case its
18522 location would be different from input_location, and more accurate. */
18527 }
18529 /* Enter the SCOPE. That way unqualified names appearing in the
18530 initializer will be looked up in SCOPE. */
18533 /* Perform deferred access control checks, now that we know in which
18534 SCOPE the declared entity resides. */
18536 {
18539 /* If the entity being declared is a function, pretend that we
18540 are in its scope. If it is a `friend', it may have access to
18541 things that would not otherwise be accessible. */
18543 {
18546 }
18548 /* Perform access checks for template parameters. */
18551 /* Perform the access control checks for the declarator and the
18552 decl-specifiers. */
18555 /* Restore the saved value. */
18558 }
18560 /* Parse the initializer. */
18565 {
18567 {
18570 else
18571 {
18572 /* If the declaration was erroneous, we don't really
18573 know what the user intended, so just silently
18574 consume the initializer. */
18581 }
18582 }
18583 else
18584 {
18585 /* We want to record the extra mangling scope for in-class
18586 initializers of class members and initializers of static data
18587 member templates. The former involves deferring
18588 parsing of the initializer until end of class as with default
18589 arguments. So right here we only handle the latter. */
18599 }
18600 }
18602 /* The old parser allows attributes to appear after a parenthesized
18603 initializer. Mark Mitchell proposed removing this functionality
18604 on the GCC mailing lists on 2002-08-13. This parser accepts the
18605 attributes -- but ignores them. */
18612 /* And now complain about a non-function implicit template. */
18617 /* For an in-class declaration, use `grokfield' to create the
18618 declaration. */
18620 {
18622 {
18625 }
18634 }
18636 /* Finish processing the declaration. But, skip member
18637 declarations. */
18639 {
18642 asm_specification,
18643 /* If the initializer is in parentheses, then this is
18644 a direct-initialization, which means that an
18645 `explicit' constructor is OK. Otherwise, an
18646 `explicit' constructor cannot be used. */
18649 }
18652 /* Core issue #226 (C++0x only): A default template-argument
18653 shall not be specified in a friend class template
18654 declaration. */
18663 {
18666 else
18668 }
18671 }
18673 /* Parse a declarator.
18675 declarator:
18676 direct-declarator
18677 ptr-operator declarator
18679 abstract-declarator:
18680 ptr-operator abstract-declarator [opt]
18681 direct-abstract-declarator
18683 GNU Extensions:
18685 declarator:
18686 attributes [opt] direct-declarator
18687 attributes [opt] ptr-operator declarator
18689 abstract-declarator:
18690 attributes [opt] ptr-operator abstract-declarator [opt]
18691 attributes [opt] direct-abstract-declarator
18693 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18694 detect constructor, destructor or conversion operators. It is set
18695 to -1 if the declarator is a name, and +1 if it is a
18696 function. Otherwise it is set to zero. Usually you just want to
18697 test for >0, but internally the negative value is used.
18699 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18700 a decl-specifier-seq unless it declares a constructor, destructor,
18701 or conversion. It might seem that we could check this condition in
18702 semantic analysis, rather than parsing, but that makes it difficult
18703 to handle something like `f()'. We want to notice that there are
18704 no decl-specifiers, and therefore realize that this is an
18705 expression, not a declaration.)
18707 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18708 the declarator is a direct-declarator of the form "(...)".
18710 MEMBER_P is true iff this declarator is a member-declarator.
18712 FRIEND_P is true iff this declarator is a friend. */
18716 cp_parser_declarator_kind dcl_kind,
18720 {
18723 cp_cv_quals cv_quals;
18724 tree class_type;
18727 /* Assume this is not a constructor, destructor, or type-conversion
18728 operator. */
18735 /* Check for the ptr-operator production. */
18737 /* Parse the ptr-operator. */
18743 /* If that worked, then we have a ptr-operator. */
18745 {
18746 /* If a ptr-operator was found, then this declarator was not
18747 parenthesized. */
18750 /* The dependent declarator is optional if we are parsing an
18751 abstract-declarator. */
18755 /* Parse the dependent declarator. */
18760 friend_p);
18762 /* If we are parsing an abstract-declarator, we must handle the
18763 case where the dependent declarator is absent. */
18768 declarator = cp_parser_make_indirect_declarator
18770 }
18771 /* Everything else is a direct-declarator. */
18772 else
18773 {
18776 CPP_OPEN_PAREN);
18778 ctor_dtor_or_conv_p,
18780 }
18785 }
18787 /* Parse a direct-declarator or direct-abstract-declarator.
18789 direct-declarator:
18790 declarator-id
18791 direct-declarator ( parameter-declaration-clause )
18792 cv-qualifier-seq [opt]
18793 ref-qualifier [opt]
18794 exception-specification [opt]
18795 direct-declarator [ constant-expression [opt] ]
18796 ( declarator )
18798 direct-abstract-declarator:
18799 direct-abstract-declarator [opt]
18800 ( parameter-declaration-clause )
18801 cv-qualifier-seq [opt]
18802 ref-qualifier [opt]
18803 exception-specification [opt]
18804 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18805 ( abstract-declarator )
18807 Returns a representation of the declarator. DCL_KIND is
18808 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18809 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18810 we are parsing a direct-declarator. It is
18811 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18812 of ambiguity we prefer an abstract declarator, as per
18813 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18814 as for cp_parser_declarator. */
18818 cp_parser_declarator_kind dcl_kind,
18821 {
18831 {
18832 /* Peek at the next token. */
18835 {
18836 /* This is either a parameter-declaration-clause, or a
18837 parenthesized declarator. When we know we are parsing a
18838 named declarator, it must be a parenthesized declarator
18839 if FIRST is true. For instance, `(int)' is a
18840 parameter-declaration-clause, with an omitted
18841 direct-abstract-declarator. But `((*))', is a
18842 parenthesized abstract declarator. Finally, when T is a
18843 template parameter `(T)' is a
18844 parameter-declaration-clause, and not a parenthesized
18845 named declarator.
18847 We first try and parse a parameter-declaration-clause,
18848 and then try a nested declarator (if FIRST is true).
18850 It is not an error for it not to be a
18851 parameter-declaration-clause, even when FIRST is
18852 false. Consider,
18854 int i (int);
18855 int i (3);
18857 The first is the declaration of a function while the
18858 second is the definition of a variable, including its
18859 initializer.
18861 Having seen only the parenthesis, we cannot know which of
18862 these two alternatives should be selected. Even more
18863 complex are examples like:
18865 int i (int (a));
18866 int i (int (3));
18868 The former is a function-declaration; the latter is a
18869 variable initialization.
18871 Thus again, we try a parameter-declaration-clause, and if
18872 that fails, we back out and return. */
18875 {
18876 tree params;
18879 /* In a member-declarator, the only valid interpretation
18880 of a parenthesis is the start of a
18881 parameter-declaration-clause. (It is invalid to
18882 initialize a static data member with a parenthesized
18883 initializer; only the "=" form of initialization is
18884 permitted.) */
18888 /* Consume the `('. */
18891 {
18892 /* If this is going to be an abstract declarator, we're
18893 in a declarator and we can't have default args. */
18896 }
18900 /* Parse the parameter-declaration-clause. */
18903 /* Consume the `)'. */
18906 /* If all went well, parse the cv-qualifier-seq,
18907 ref-qualifier and the exception-specification. */
18909 {
18910 cp_cv_quals cv_quals;
18911 cp_virt_specifiers virt_specifiers;
18912 cp_ref_qualifier ref_qual;
18913 tree exception_specification;
18914 tree late_return;
18915 tree attrs;
18925 /* Parse the cv-qualifier-seq. */
18927 /* Parse the ref-qualifier. */
18929 /* Parse the tx-qualifier. */
18931 /* And the exception-specification. */
18932 exception_specification
18937 /* In here, we handle cases where attribute is used after
18938 the function declaration. For example:
18939 void func (int x) __attribute__((vector(..))); */
18943 {
18947 CPP_SEMICOLON)
18949 CPP_OPEN_BRACE))
18952 ;
18953 else
18955 }
18957 late_return = (cp_parser_late_return_type_opt
18961 /* Parse the virt-specifier-seq. */
18964 /* Create the function-declarator. */
18966 params,
18967 cv_quals,
18968 virt_specifiers,
18969 ref_qual,
18970 tx_qual,
18971 exception_specification,
18972 late_return,
18973 requires_clause);
18976 /* Any subsequent parameter lists are to do with
18977 return type, so are not those of the declared
18978 function. */
18980 }
18982 /* Remove the function parms from scope. */
18986 /* Repeat the main loop. */
18988 }
18990 /* If this is the first, we can try a parenthesized
18991 declarator. */
18993 {
18999 /* Consume the `('. */
19001 /* Parse the nested declarator. */
19004 declarator
19010 /* Expect a `)'. */
19017 }
19018 /* Otherwise, we must be done. */
19019 else
19021 }
19025 {
19026 /* Parse an array-declarator. */
19035 /* Consume the `['. */
19037 /* Peek at the next token. */
19039 /* If the next token is `]', then there is no
19040 constant-expression. */
19042 {
19044 bounds
19054 {
19055 /* Normally, the array bound must be an integral constant
19056 expression. However, as an extension, we allow VLAs
19057 in function scopes as long as they aren't part of a
19058 parameter declaration. */
19062 }
19065 {
19066 /* Remember this wasn't a constant-expression. */
19069 }
19070 }
19071 else
19073 /* Look for the closing `]'. */
19075 {
19078 }
19083 }
19085 {
19086 {
19087 tree qualifying_scope;
19088 tree unqualified_name;
19089 tree attrs;
19090 special_function_kind sfk;
19095 /* Parse a declarator-id */
19098 {
19101 /* If we see an ellipsis, we should be looking at a
19102 parameter pack. */
19104 {
19105 /* Consume the `...' */
19109 }
19110 }
19113 unqualified_name
19117 {
19121 {
19122 /* Check whether an error occurred. */
19125 /* We already consumed the ellipsis to mark a
19126 parameter pack, but we have no way to report it,
19127 so abort the tentative parse. We will be exiting
19128 immediately anyway. */
19130 }
19131 else
19137 && (qualifying_scope
19139 {
19142 }
19143 }
19148 {
19153 }
19159 {
19160 /* In the declaration of a member of a template class
19161 outside of the class itself, the SCOPE will sometimes
19162 be a TYPENAME_TYPE. For example, given:
19164 template <typename T>
19165 int S<T>::R::i = 3;
19167 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19168 this context, we must resolve S<T>::R to an ordinary
19169 type, rather than a typename type.
19171 The reason we normally avoid resolving TYPENAME_TYPEs
19172 is that a specialization of `S' might render
19173 `S<T>::R' not a type. However, if `S' is
19174 specialized, then this `i' will not be used, so there
19175 is no harm in resolving the types here. */
19176 tree type;
19178 /* Resolve the TYPENAME_TYPE. */
19181 /* If that failed, the declarator is invalid. */
19183 {
19186 "cannot define member of dependent typedef "
19188 else
19193 }
19195 }
19200 {
19201 tree class_type;
19206 else
19210 {
19213 {
19216 {
19220 "use %<%T::%D%> instead of %<%T::%D%> to "
19222 class_type,
19227 }
19228 else
19230 }
19231 else
19232 {
19233 /* We do not attempt to print the declarator
19234 here because we do not have enough
19235 information about its original syntactic
19236 form. */
19240 }
19241 }
19244 {
19250 for an anonymous type, even if the type
19251 got a name for linkage purposes. */
19253 /* Handle correctly (c++/19200):
19255 struct S {
19256 struct T{};
19257 friend void S(T);
19258 };
19260 and also:
19262 namespace N {
19263 void S();
19264 }
19266 struct S {
19267 friend void N::S();
19268 }; */
19269 && !(friend_p
19272 class_type))
19273 {
19276 }
19284 }
19285 }
19287 unqualified_name,
19288 sfk);
19295 }
19297 handle_declarator:;
19300 {
19301 /* Any names that appear after the declarator-id for a
19302 member are looked up in the containing scope. */
19304 {
19305 /* But declarations with qualified-ids can't appear in a
19306 function. */
19310 }
19312 }
19316 /* Default args are only allowed on function
19317 declarations. */
19319 else
19323 }
19324 /* We're done. */
19325 else
19327 }
19329 /* For an abstract declarator, we might wind up with nothing at this
19330 point. That's an error; the declarator is not optional. */
19334 /* If we entered a scope, we must exit it now. */
19342 }
19344 /* Parse a ptr-operator.
19346 ptr-operator:
19347 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19348 * cv-qualifier-seq [opt]
19349 &
19350 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19351 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19353 GNU Extension:
19355 ptr-operator:
19356 & cv-qualifier-seq [opt]
19358 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19359 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19360 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19361 filled in with the TYPE containing the member. *CV_QUALS is
19362 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19363 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19364 Note that the tree codes returned by this function have nothing
19365 to do with the types of trees that will be eventually be created
19366 to represent the pointer or reference type being parsed. They are
19367 just constants with suggestive names. */
19368 static enum tree_code
19373 {
19378 /* Assume that it's not a pointer-to-member. */
19380 /* And that there are no cv-qualifiers. */
19383 /* Peek at the next token. */
19386 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19396 {
19397 /* Consume the `*', `&' or `&&'. */
19400 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19401 `&', if we are allowing GNU extensions. (The only qualifier
19402 that can legally appear after `&' is `restrict', but that is
19403 enforced during semantic analysis. */
19411 }
19412 else
19413 {
19414 /* Try the pointer-to-member case. */
19416 /* Look for the optional `::' operator. */
19419 /* Look for the nested-name specifier. */
19426 /* If we found it, and the next token is a `*', then we are
19427 indeed looking at a pointer-to-member operator. */
19430 {
19431 /* Indicate that the `*' operator was used. */
19439 else
19440 {
19441 /* The type of which the member is a member is given by the
19442 current SCOPE. */
19444 /* The next name will not be qualified. */
19448 /* Look for optional c++11 attributes. */
19452 /* Look for the optional cv-qualifier-seq. */
19454 }
19455 }
19456 /* If that didn't work we don't have a ptr-operator. */
19459 }
19462 }
19464 /* Parse an (optional) cv-qualifier-seq.
19466 cv-qualifier-seq:
19467 cv-qualifier cv-qualifier-seq [opt]
19469 cv-qualifier:
19470 const
19471 volatile
19473 GNU Extension:
19475 cv-qualifier:
19476 __restrict__
19478 Returns a bitmask representing the cv-qualifiers. */
19480 static cp_cv_quals
19482 {
19486 {
19488 cp_cv_quals cv_qualifier;
19490 /* Peek at the next token. */
19492 /* See if it's a cv-qualifier. */
19494 {
19510 }
19516 {
19519 }
19520 else
19521 {
19524 }
19525 }
19528 }
19530 /* Parse an (optional) ref-qualifier
19532 ref-qualifier:
19533 &
19534 &&
19536 Returns cp_ref_qualifier representing ref-qualifier. */
19538 static cp_ref_qualifier
19540 {
19543 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19548 {
19553 {
19565 }
19570 {
19573 }
19574 else
19575 {
19578 }
19579 }
19582 }
19584 /* Parse an optional tx-qualifier.
19586 tx-qualifier:
19587 transaction_safe
19588 transaction_safe_dynamic */
19590 static tree
19592 {
19595 {
19600 {
19604 {
19607 {
19610 }
19611 else
19613 }
19614 }
19615 }
19617 }
19619 /* Parse an (optional) virt-specifier-seq.
19621 virt-specifier-seq:
19622 virt-specifier virt-specifier-seq [opt]
19624 virt-specifier:
19625 override
19626 final
19628 Returns a bitmask representing the virt-specifiers. */
19630 static cp_virt_specifiers
19632 {
19636 {
19638 cp_virt_specifiers virt_specifier;
19640 /* Peek at the next token. */
19642 /* See if it's a virt-specifier-qualifier. */
19646 {
19649 }
19651 {
19654 }
19656 {
19658 }
19659 else
19663 {
19666 }
19667 else
19668 {
19671 }
19672 }
19674 }
19676 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19677 is in scope even though it isn't real. */
19679 void
19681 {
19682 tree this_parm;
19685 {
19686 /* We don't clear this between NSDMIs. Is it already what we want? */
19691 }
19694 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19696 current_class_ref
19699 }
19701 /* Return true iff our current scope is a non-static data member
19702 initializer. */
19704 bool
19706 {
19707 /* We recognize NSDMI context by the context-less 'this' pointer set up
19708 by the function above. */
19714 }
19716 /* Parse a late-specified return type, if any. This is not a separate
19717 non-terminal, but part of a function declarator, which looks like
19719 -> trailing-type-specifier-seq abstract-declarator(opt)
19721 Returns the type indicated by the type-id.
19723 In addition to this, parse any queued up omp declare simd
19724 clauses and Cilk Plus SIMD-enabled function's vector attributes.
19726 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19727 function. */
19729 static tree
19732 {
19736 && declarator
19743 && declarator
19746 /* Peek at the next token. */
19748 /* A late-specified return type is indicated by an initial '->'. */
19757 {
19758 /* DR 1207: 'this' is in scope in the trailing return type. */
19760 }
19763 {
19764 /* Consume the ->. */
19768 }
19770 /* Function declarations may be followed by a trailing
19771 requires-clause. */
19775 declarator->attributes
19779 declarator->attributes
19783 declarator->attributes
19788 {
19791 }
19794 }
19796 /* Parse a declarator-id.
19798 declarator-id:
19799 id-expression
19800 :: [opt] nested-name-specifier [opt] type-name
19802 In the `id-expression' case, the value returned is as for
19803 cp_parser_id_expression if the id-expression was an unqualified-id.
19804 If the id-expression was a qualified-id, then a SCOPE_REF is
19805 returned. The first operand is the scope (either a NAMESPACE_DECL
19806 or TREE_TYPE), but the second is still just a representation of an
19807 unqualified-id. */
19809 static tree
19811 {
19812 tree id;
19813 /* The expression must be an id-expression. Assume that qualified
19814 names are the names of types so that:
19816 template <class T>
19817 int S<T>::R::i = 3;
19819 will work; we must treat `S<T>::R' as the name of a type.
19820 Similarly, assume that qualified names are templates, where
19821 required, so that:
19823 template <class T>
19824 int S<T>::R<T>::i = 3;
19826 will work, too. */
19832 optional_p);
19836 }
19838 /* Parse a type-id.
19840 type-id:
19841 type-specifier-seq abstract-declarator [opt]
19843 Returns the TYPE specified. */
19845 static tree
19848 {
19849 cp_decl_specifier_seq type_specifier_seq;
19852 /* Parse the type-specifier-seq. */
19854 is_trailing_return,
19859 /* There might or might not be an abstract declarator. */
19861 /* Look for the declarator. */
19862 abstract_declarator
19867 /* Check to see if there really was a declarator. */
19872 /* The concepts TS allows 'auto' as a type-id. */
19874 /* None of the valid uses of 'auto' in C++14 involve the type-id
19875 nonterminal, but it is valid in a trailing-return-type. */
19878 {
19879 /* A type-id with type 'auto' is only ok if the abstract declarator
19880 is a function declarator with a late-specified return type.
19882 A type-id with 'auto' is also valid in a trailing-return-type
19883 in a compound-requirement. */
19890 else
19891 {
19894 }
19895 }
19898 is_template_arg);
19899 }
19901 static tree
19903 {
19905 }
19907 static tree
19909 {
19910 tree r;
19912 parser->type_definition_forbidden_message
19917 {
19920 }
19922 }
19924 static tree
19926 {
19928 }
19930 /* Parse a type-specifier-seq.
19932 type-specifier-seq:
19933 type-specifier type-specifier-seq [opt]
19935 GNU extension:
19937 type-specifier-seq:
19938 attributes type-specifier-seq [opt]
19940 If IS_DECLARATION is true, we are at the start of a "condition" or
19941 exception-declaration, so we might be followed by a declarator-id.
19943 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
19944 i.e. we've just seen "->".
19946 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
19948 static void
19953 {
19958 /* Clear the TYPE_SPECIFIER_SEQ. */
19961 /* In the context of a trailing return type, enum E { } is an
19962 elaborated-type-specifier followed by a function-body, not an
19963 enum-specifier. */
19967 /* Parse the type-specifiers and attributes. */
19969 {
19970 tree type_specifier;
19973 /* Check for attributes first. */
19975 {
19980 }
19982 /* record the token of the beginning of the type specifier seq,
19983 for error reporting purposes*/
19987 /* Look for the type-specifier. */
19989 flags,
19990 type_specifier_seq,
19992 NULL,
19995 {
19996 /* If the first type-specifier could not be found, this is not a
19997 type-specifier-seq at all. */
19999 {
20000 /* Set in_declarator_p to avoid skipping to the semicolon. */
20012 }
20013 /* If subsequent type-specifiers could not be found, the
20014 type-specifier-seq is complete. */
20016 }
20019 /* The standard says that a condition can be:
20021 type-specifier-seq declarator = assignment-expression
20023 However, given:
20025 struct S {};
20026 if (int S = ...)
20028 we should treat the "S" as a declarator, not as a
20029 type-specifier. The standard doesn't say that explicitly for
20030 type-specifier-seq, but it does say that for
20031 decl-specifier-seq in an ordinary declaration. Perhaps it
20032 would be clearer just to allow a decl-specifier-seq here, and
20033 then add a semantic restriction that if any decl-specifiers
20034 that are not type-specifiers appear, the program is invalid. */
20037 }
20038 }
20040 /* Return whether the function currently being declared has an associated
20041 template parameter list. */
20043 static bool
20045 {
20058 }
20060 /* Parse a parameter-declaration-clause.
20062 parameter-declaration-clause:
20063 parameter-declaration-list [opt] ... [opt]
20064 parameter-declaration-list , ...
20066 Returns a representation for the parameter declarations. A return
20067 value of NULL indicates a parameter-declaration-clause consisting
20068 only of an ellipsis. */
20070 static tree
20072 {
20073 tree parameters;
20082 parser->auto_is_implicit_function_template_parm_p
20084 }
20090 && !processing_template_parmlist
20096 /* Peek at the next token. */
20098 /* Check for trivial parameter-declaration-clauses. */
20100 {
20101 /* Consume the `...' token. */
20104 }
20106 /* There are no parameters. */
20107 {
20108 #ifndef NO_IMPLICIT_EXTERN_C
20113 else
20114 #endif
20116 }
20117 /* Check for `(void)', too, which is a special case. */
20121 {
20122 /* Consume the `void' token. */
20124 /* There are no parameters. */
20126 }
20128 /* Parse the parameter-declaration-list. */
20130 /* If a parse error occurred while parsing the
20131 parameter-declaration-list, then the entire
20132 parameter-declaration-clause is erroneous. */
20136 /* Peek at the next token. */
20138 /* If it's a `,', the clause should terminate with an ellipsis. */
20140 {
20141 /* Consume the `,'. */
20143 /* Expect an ellipsis. */
20144 ellipsis_p
20146 }
20147 /* It might also be `...' if the optional trailing `,' was
20148 omitted. */
20150 {
20151 /* Consume the `...' token. */
20153 /* And remember that we saw it. */
20155 }
20156 else
20159 /* Finish the parameter list. */
20164 }
20166 /* Parse a parameter-declaration-list.
20168 parameter-declaration-list:
20169 parameter-declaration
20170 parameter-declaration-list , parameter-declaration
20172 Returns a representation of the parameter-declaration-list, as for
20173 cp_parser_parameter_declaration_clause. However, the
20174 `void_list_node' is never appended to the list. Upon return,
20175 *IS_ERROR will be true iff an error occurred. */
20177 static tree
20179 {
20185 /* Assume all will go well. */
20187 /* The special considerations that apply to a function within an
20188 unbraced linkage specifications do not apply to the parameters
20189 to the function. */
20190 saved_in_unbraced_linkage_specification_p
20194 /* Look for more parameters. */
20196 {
20204 /* Parse the parameter. */
20205 parameter
20210 /* We don't know yet if the enclosing context is deprecated, so wait
20211 and warn in grokparms if appropriate. */
20215 {
20216 /* If a function parameter pack was specified and an implicit template
20217 parameter was introduced during cp_parser_parameter_declaration,
20218 change any implicit parameters introduced into packs. */
20222 {
20230 }
20234 PARM,
20237 }
20241 /* If a parse error occurred parsing the parameter declaration,
20242 then the entire parameter-declaration-list is erroneous. */
20244 {
20248 }
20258 {
20262 }
20264 /* Add the new parameter to the list. */
20268 /* Peek at the next token. */
20271 /* These are for Objective-C++ */
20274 /* The parameter-declaration-list is complete. */
20277 {
20280 /* Peek at the next token. */
20282 /* If it's an ellipsis, then the list is complete. */
20285 /* Otherwise, there must be more parameters. Consume the
20286 `,'. */
20288 /* When parsing something like:
20290 int i(float f, double d)
20292 we can tell after seeing the declaration for "f" that we
20293 are not looking at an initialization of a variable "i",
20294 but rather at the declaration of a function "i".
20296 Due to the fact that the parsing of template arguments
20297 (as specified to a template-id) requires backtracking we
20298 cannot use this technique when inside a template argument
20299 list. */
20303 /* However, a parameter-declaration of the form
20304 "float(f)" (which is a valid declaration of a
20305 parameter "f") can also be interpreted as an
20306 expression (the conversion of "f" to "float"). */
20309 }
20310 else
20311 {
20319 }
20320 }
20322 parser->in_unbraced_linkage_specification_p
20325 /* Reset implicit_template_scope if we are about to leave the function
20326 parameter list that introduced it. Note that for out-of-line member
20327 definitions, there will be one or more class scopes before we get to
20328 the template parameter scope. */
20332 {
20336 {
20339 }
20340 }
20343 }
20345 /* Parse a parameter declaration.
20347 parameter-declaration:
20348 decl-specifier-seq ... [opt] declarator
20349 decl-specifier-seq declarator = assignment-expression
20350 decl-specifier-seq ... [opt] abstract-declarator [opt]
20351 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20353 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20354 declares a template parameter. (In that case, a non-nested `>'
20355 token encountered during the parsing of the assignment-expression
20356 is not interpreted as a greater-than operator.)
20358 Returns a representation of the parameter, or NULL if an error
20359 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20360 true iff the declarator is of the form "(p)". */
20366 {
20368 cp_decl_specifier_seq decl_specifiers;
20370 tree default_argument;
20375 /* In a template parameter, `>' is not an operator.
20377 [temp.param]
20379 When parsing a default template-argument for a non-type
20380 template-parameter, the first non-nested `>' is taken as the end
20381 of the template parameter-list rather than a greater-than
20382 operator. */
20384 /* Type definitions may not appear in parameter types. */
20386 parser->type_definition_forbidden_message
20389 /* Parse the declaration-specifiers. */
20391 CP_PARSER_FLAGS_NONE,
20395 /* Complain about missing 'typename' or other invalid type names. */
20400 /* If an error occurred, there's no reason to attempt to parse the
20401 rest of the declaration. */
20403 {
20406 }
20408 /* Peek at the next token. */
20411 /* If the next token is a `)', `,', `=', `>', or `...', then there
20412 is no declarator. However, when variadic templates are enabled,
20413 there may be a declarator following `...'. */
20418 {
20422 }
20423 /* Otherwise, there should be a declarator. */
20424 else
20425 {
20429 /* After seeing a decl-specifier-seq, if the next token is not a
20430 "(", there is no possibility that the code is a valid
20431 expression. Therefore, if parsing tentatively, we commit at
20432 this point. */
20434 /* In an expression context, having seen:
20436 (int((char ...
20438 we cannot be sure whether we are looking at a
20439 function-type (taking a "char" as a parameter) or a cast
20440 of some object of type "char" to "int". */
20446 /* Parse the declarator. */
20449 CP_PARSER_DECLARATOR_EITHER,
20451 parenthesized_p,
20455 /* After the declarator, allow more attributes. */
20456 decl_specifiers.attributes
20460 /* If the declarator is a template parameter pack, remember that and
20461 clear the flag in the declarator itself so we don't get errors
20462 from grokdeclarator. */
20464 {
20467 }
20468 }
20470 /* If the next token is an ellipsis, and we have not seen a declarator
20471 name, and if either the type of the declarator contains parameter
20472 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20473 for, eg, abbreviated integral type names), then we actually have a
20474 parameter pack expansion expression. Otherwise, leave the ellipsis
20475 for a C-style variadic function. */
20478 {
20489 {
20490 /* Consume the `...'. */
20494 /* Build a pack expansion type */
20499 else
20501 }
20502 }
20504 /* The restriction on defining new types applies only to the type
20505 of the parameter, not to the default argument. */
20508 /* If the next token is `=', then process a default argument. */
20510 {
20513 /* If we are defining a class, then the tokens that make up the
20514 default argument must be saved and processed later. */
20520 // A constrained-type-specifier may declare a type template-parameter.
20522 default_argument
20525 // A constrained-type-specifier may declare a template-template-parameter.
20527 default_argument
20530 /* Outside of a class definition, we can just parse the
20531 assignment-expression. */
20532 else
20533 default_argument
20537 {
20539 "default arguments are only "
20541 }
20543 || template_parameter_pack_p
20546 {
20547 /* Find the name of the parameter pack. */
20554 template_parm_p
20560 else
20562 template_parm_p
20569 }
20570 }
20571 else
20575 declarator,
20576 default_argument,
20577 template_parameter_pack_p);
20578 }
20580 /* Parse a default argument and return it.
20582 TEMPLATE_PARM_P is true if this is a default argument for a
20583 non-type template parameter. */
20584 static tree
20586 {
20592 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20593 set correctly. */
20596 /* Local variable names (and the `this' keyword) may not
20597 appear in a default argument. */
20600 /* Parse the assignment-expression. */
20605 /* The "this" pointer is not valid in a default argument. */
20607 {
20612 }
20613 default_argument
20615 /* Restore the "this" pointer. */
20617 {
20620 }
20629 }
20631 /* Parse a function-body.
20633 function-body:
20634 compound_statement */
20636 static void
20638 {
20642 }
20644 /* Parse a ctor-initializer-opt followed by a function-body. Return
20645 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20646 is true we are parsing a function-try-block. */
20648 static bool
20651 {
20659 /* Begin the function body. */
20661 /* Parse the optional ctor-initializer. */
20664 /* If we're parsing a constexpr constructor definition, we need
20665 to check that the constructor body is indeed empty. However,
20666 before we get to cp_parser_function_body lot of junk has been
20667 generated, so we can't just check that we have an empty block.
20668 Rather we take a snapshot of the outermost block, and check whether
20669 cp_parser_function_body changed its state. */
20671 {
20675 }
20676 /* Parse the function-body. */
20680 /* Finish the function body. */
20684 }
20686 /* Parse an initializer.
20688 initializer:
20689 = initializer-clause
20690 ( expression-list )
20692 Returns an expression representing the initializer. If no
20693 initializer is present, NULL_TREE is returned.
20695 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20696 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20697 set to TRUE if there is no initializer present. If there is an
20698 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20699 is set to true; otherwise it is set to false. */
20701 static tree
20704 {
20706 tree init;
20708 /* Peek at the next token. */
20711 /* Let our caller know whether or not this initializer was
20712 parenthesized. */
20714 /* Assume that the initializer is constant. */
20718 {
20719 /* Consume the `='. */
20721 /* Parse the initializer-clause. */
20723 }
20725 {
20730 non_constant_p);
20735 }
20737 {
20742 }
20743 else
20744 {
20745 /* Anything else is an error. */
20748 }
20751 }
20753 /* Parse an initializer-clause.
20755 initializer-clause:
20756 assignment-expression
20757 braced-init-list
20759 Returns an expression representing the initializer.
20761 If the `assignment-expression' production is used the value
20762 returned is simply a representation for the expression.
20764 Otherwise, calls cp_parser_braced_list. */
20766 static cp_expr
20768 {
20769 cp_expr initializer;
20771 /* Assume the expression is constant. */
20774 /* If it is not a `{', then we are looking at an
20775 assignment-expression. */
20777 {
20778 initializer
20781 non_constant_p);
20782 }
20783 else
20787 }
20789 /* Parse a brace-enclosed initializer list.
20791 braced-init-list:
20792 { initializer-list , [opt] }
20793 { }
20795 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20796 the elements of the initializer-list (or NULL, if the last
20797 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20798 NULL_TREE. There is no way to detect whether or not the optional
20799 trailing `,' was provided. NON_CONSTANT_P is as for
20800 cp_parser_initializer. */
20802 static cp_expr
20804 {
20805 tree initializer;
20808 /* Consume the `{' token. */
20810 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20812 /* If it's not a `}', then there is a non-trivial initializer. */
20814 {
20815 /* Parse the initializer list. */
20818 /* A trailing `,' token is allowed. */
20821 }
20822 else
20824 /* Now, there should be a trailing `}'. */
20830 /* Build a location of the form:
20831 { ... }
20832 ^~~~~~~
20833 with caret==start at the open brace, finish at the close brace. */
20837 }
20839 /* Consume tokens up to, and including, the next non-nested closing `]'.
20840 Returns true iff we found a closing `]'. */
20842 static bool
20844 {
20848 {
20852 {
20855 /* If we've run out of tokens, then there is no closing `]'. */
20864 {
20867 }
20872 }
20874 /* Consume the token. */
20876 }
20877 }
20879 /* Return true if we are looking at an array-designator, false otherwise. */
20881 static bool
20883 {
20884 /* Consume the `['. */
20889 /* Skip tokens until the next token is a closing square bracket.
20890 If we find the closing `]', and the next token is a `=', then
20891 we are looking at an array designator. */
20892 bool array_designator_p
20896 /* Roll back the tokens we skipped. */
20900 }
20902 /* Parse an initializer-list.
20904 initializer-list:
20905 initializer-clause ... [opt]
20906 initializer-list , initializer-clause ... [opt]
20908 GNU Extension:
20910 initializer-list:
20911 designation initializer-clause ...[opt]
20912 initializer-list , designation initializer-clause ...[opt]
20914 designation:
20915 . identifier =
20916 identifier :
20917 [ constant-expression ] =
20919 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20920 for the initializer. If the INDEX of the elt is non-NULL, it is the
20921 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20922 as for cp_parser_initializer. */
20926 {
20929 /* Assume all of the expressions are constant. */
20932 /* Parse the rest of the list. */
20934 {
20936 tree designator;
20937 tree initializer;
20940 /* If the next token is an identifier and the following one is a
20941 colon, we are looking at the GNU designated-initializer
20942 syntax. */
20946 {
20947 /* Warn the user that they are using an extension. */
20950 /* Consume the identifier. */
20952 /* Consume the `:'. */
20954 }
20955 /* Also handle the C99 syntax, '. id ='. */
20960 {
20961 /* Warn the user that they are using an extension. */
20964 /* Consume the `.'. */
20966 /* Consume the identifier. */
20968 /* Consume the `='. */
20970 }
20971 /* Also handle C99 array designators, '[ const ] ='. */
20975 {
20976 /* In C++11, [ could start a lambda-introducer. */
20982 {
20985 }
20986 else
20987 {
20992 }
20998 }
20999 else
21002 /* Parse the initializer. */
21005 /* If any clause is non-constant, so is the entire initializer. */
21009 /* If we have an ellipsis, this is an initializer pack
21010 expansion. */
21012 {
21013 /* Consume the `...'. */
21016 /* Turn the initializer into an initializer expansion. */
21018 }
21020 /* Add it to the vector. */
21023 /* If the next token is not a comma, we have reached the end of
21024 the list. */
21028 /* Peek at the next token. */
21030 /* If the next token is a `}', then we're still done. An
21031 initializer-clause can have a trailing `,' after the
21032 initializer-list and before the closing `}'. */
21036 /* Consume the `,' token. */
21038 }
21041 }
21043 /* Classes [gram.class] */
21045 /* Parse a class-name.
21047 class-name:
21048 identifier
21049 template-id
21051 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21052 to indicate that names looked up in dependent types should be
21053 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21054 keyword has been used to indicate that the name that appears next
21055 is a template. TAG_TYPE indicates the explicit tag given before
21056 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21057 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21058 is the class being defined in a class-head. If ENUM_OK is TRUE,
21059 enum-names are also accepted.
21061 Returns the TYPE_DECL representing the class. */
21063 static tree
21072 {
21073 tree decl;
21074 tree scope;
21079 /* All class-names start with an identifier. */
21082 {
21085 }
21087 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21088 to a template-id, so we save it here. */
21093 /* Any name names a type if we're following the `typename' keyword
21094 in a qualified name where the enclosing scope is type-dependent. */
21097 /* Handle the common case (an identifier, but not a template-id)
21098 efficiently. */
21101 {
21105 /* Look for the identifier. */
21109 /* If the next token isn't an identifier, we are certainly not
21110 looking at a class-name. */
21113 /* If we know this is a type-name, there's no need to look it
21114 up. */
21117 else
21118 {
21119 tree ambiguous_decls;
21120 /* If we already know that this lookup is ambiguous, then
21121 we've already issued an error message; there's no reason
21122 to check again. */
21124 {
21127 }
21128 /* If the next token is a `::', then the name must be a type
21129 name.
21131 [basic.lookup.qual]
21133 During the lookup for a name preceding the :: scope
21134 resolution operator, object, function, and enumerator
21135 names are ignored. */
21138 /* Look up the name. */
21140 tag_type,
21143 check_dependency_p,
21147 {
21151 }
21152 }
21153 }
21154 else
21155 {
21156 /* Try a template-id. */
21158 check_dependency_p,
21159 tag_type,
21160 is_declaration);
21163 }
21167 /* If this is a typename, create a TYPENAME_TYPE. */
21169 {
21174 }
21178 /* Check to see that it is really the name of a class. */
21182 /* Situations like this:
21184 template <typename T> struct A {
21185 typename T::template X<int>::I i;
21186 };
21188 are problematic. Is `T::template X<int>' a class-name? The
21189 standard does not seem to be definitive, but there is no other
21190 valid interpretation of the following `::'. Therefore, those
21191 names are considered class-names. */
21192 {
21196 }
21201 /* In Objective-C 2.0, a classname followed by '.' starts a
21202 dot-syntax expression, and it's not a type-name. */
21214 }
21216 /* Parse a class-specifier.
21218 class-specifier:
21219 class-head { member-specification [opt] }
21221 Returns the TREE_TYPE representing the class. */
21223 static tree
21225 {
21226 tree type;
21240 /* Parse the class-head. */
21243 /* If the class-head was a semantic disaster, skip the entire body
21244 of the class. */
21246 {
21250 }
21252 /* Look for the `{'. */
21254 {
21257 }
21262 /* Issue an error message if type-definitions are forbidden here. */
21264 /* Remember that we are defining one more class. */
21266 /* Inside the class, surrounding template-parameter-lists do not
21267 apply. */
21268 saved_num_template_parameter_lists
21271 /* We are not in a function body. */
21274 /* Or in a loop. */
21277 /* Or in a switch. */
21280 /* We are not immediately inside an extern "lang" block. */
21281 saved_in_unbraced_linkage_specification_p
21285 // Associate constraints with the type.
21289 /* Start the class. */
21291 {
21294 }
21298 /* If the type is erroneous, skip the entire body of the class. */
21300 else
21301 /* Parse the member-specification. */
21304 /* Look for the trailing `}'. */
21306 /* Look for trailing attributes to apply to this class. */
21314 /* We've finished a type definition. Check for the common syntax
21315 error of forgetting a semicolon after the definition. We need to
21316 be careful, as we can't just check for not-a-semicolon and be done
21317 with it; the user might have typed:
21319 class X { } c = ...;
21320 class X { } *p = ...;
21322 and so forth. Instead, enumerate all the possible tokens that
21323 might follow this production; if we don't see one of them, then
21324 complain and silently insert the semicolon. */
21325 {
21330 /* Don't try to parse c++11 attributes here. As per the
21331 grammar, that should be a task for
21332 cp_parser_decl_specifier_seq. */
21336 {
21347 /* While it's legal for type qualifiers and storage class
21348 specifiers to follow type definitions in the grammar, only
21349 compiler testsuites contain code like that. Assume that if
21350 we see such code, then what we're really seeing is a case
21351 like:
21353 class X { }
21354 const <type> var = ...;
21356 or
21358 class Y { }
21359 static <type> func (...) ...
21361 i.e. the qualifier or specifier applies to the next
21362 declaration. To do so, however, we need to look ahead one
21363 more token to see if *that* token is a type specifier.
21365 This code could be improved to handle:
21367 class Z { }
21368 static const <type> var = ...; */
21371 {
21374 /* Handling user-defined types here would be nice, but very
21375 tricky. */
21376 want_semicolon
21379 }
21383 }
21385 /* If we don't have a type, then something is very wrong and we
21386 shouldn't try to do anything clever. Likewise for not seeing the
21387 closing brace. */
21389 {
21390 cp_token_position prev
21401 else
21404 /* Unget one token and smash it to look as though we encountered
21405 a semicolon in the input stream. */
21410 }
21411 }
21413 /* If this class is not itself within the scope of another class,
21414 then we need to parse the bodies of all of the queued function
21415 definitions. Note that the queued functions defined in a class
21416 are not always processed immediately following the
21417 class-specifier for that class. Consider:
21419 struct A {
21420 struct B { void f() { sizeof (A); } };
21421 };
21423 If `f' were processed before the processing of `A' were
21424 completed, there would be no way to compute the size of `A'.
21425 Note that the nesting we are interested in here is lexical --
21426 not the semantic nesting given by TYPE_CONTEXT. In particular,
21427 for:
21429 struct A { struct B; };
21430 struct A::B { void f() { } };
21432 there is no need to delay the parsing of `A::B::f'. */
21434 {
21435 tree decl;
21442 /* In a first pass, parse default arguments to the functions.
21443 Then, in a second pass, parse the bodies of the functions.
21444 This two-phased approach handles cases like:
21446 struct S {
21447 void f() { g(); }
21448 void g(int i = 3);
21449 };
21451 */
21453 {
21455 /* If there are default arguments that have not yet been processed,
21456 take care of them now. */
21458 {
21463 }
21464 /* Make sure that any template parameters are in scope. */
21466 /* Parse the default argument expressions. */
21468 /* Remove any template parameters from the symbol table. */
21470 }
21472 /* Now parse any NSDMIs. */
21476 {
21478 {
21483 }
21486 }
21493 /* Now do some post-NSDMI bookkeeping. */
21499 /* Now parse the body of the functions. */
21501 {
21502 /* OpenMP UDRs need to be parsed before all other functions. */
21509 }
21510 else
21514 }
21515 else
21518 /* Put back any saved access checks. */
21521 /* Restore saved state. */
21525 parser->num_template_parameter_lists
21527 parser->in_unbraced_linkage_specification_p
21531 }
21533 static tree
21535 {
21536 tree ret;
21541 }
21543 /* Parse a class-head.
21545 class-head:
21546 class-key identifier [opt] base-clause [opt]
21547 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21548 class-key nested-name-specifier [opt] template-id
21549 base-clause [opt]
21551 class-virt-specifier:
21552 final
21554 GNU Extensions:
21555 class-key attributes identifier [opt] base-clause [opt]
21556 class-key attributes nested-name-specifier identifier base-clause [opt]
21557 class-key attributes nested-name-specifier [opt] template-id
21558 base-clause [opt]
21560 Upon return BASES is initialized to the list of base classes (or
21561 NULL, if there are none) in the same form returned by
21562 cp_parser_base_clause.
21564 Returns the TYPE of the indicated class. Sets
21565 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21566 involving a nested-name-specifier was used, and FALSE otherwise.
21568 Returns error_mark_node if this is not a class-head.
21570 Returns NULL_TREE if the class-head is syntactically valid, but
21571 semantically invalid in a way that means we should skip the entire
21572 body of the class. */
21574 static tree
21577 {
21578 tree nested_name_specifier;
21582 tree attributes;
21583 tree bases;
21593 /* Assume no nested-name-specifier will be present. */
21595 /* Assume no template parameter lists will be used in defining the
21596 type. */
21600 /* Look for the class-key. */
21605 /* Parse the attributes. */
21608 /* If the next token is `::', that is invalid -- but sometimes
21609 people do try to write:
21611 struct ::S {};
21613 Handle this gracefully by accepting the extra qualifier, and then
21614 issuing an error about it later if this really is a
21615 class-head. If it turns out just to be an elaborated type
21616 specifier, remain silent. */
21622 /* Determine the name of the class. Begin by looking for an
21623 optional nested-name-specifier. */
21625 nested_name_specifier
21631 /* If there was a nested-name-specifier, then there *must* be an
21632 identifier. */
21634 {
21636 /* Although the grammar says `identifier', it really means
21637 `class-name' or `template-name'. You are only allowed to
21638 define a class that has already been declared with this
21639 syntax.
21641 The proposed resolution for Core Issue 180 says that wherever
21642 you see `class T::X' you should treat `X' as a type-name.
21644 It is OK to define an inaccessible class; for example:
21646 class A { class B; };
21647 class A::B {};
21649 We do not know if we will see a class-name, or a
21650 template-name. We look for a class-name first, in case the
21651 class-name is a template-id; if we looked for the
21652 template-name first we would stop after the template-name. */
21657 class_type,
21661 /* If that didn't work, ignore the nested-name-specifier. */
21663 {
21669 }
21670 /* If we could not find a corresponding TYPE, treat this
21671 declaration like an unqualified declaration. */
21674 /* Otherwise, count the number of templates used in TYPE and its
21675 containing scopes. */
21676 else
21677 {
21678 tree scope;
21690 }
21691 }
21692 /* Otherwise, the identifier is optional. */
21693 else
21694 {
21695 /* We don't know whether what comes next is a template-id,
21696 an identifier, or nothing at all. */
21698 /* Check for a template-id. */
21703 class_key,
21705 /* If that didn't work, it could still be an identifier. */
21707 {
21709 {
21712 }
21713 else
21715 }
21716 else
21717 {
21720 }
21721 }
21726 {
21728 class_key,
21730 }
21733 /* If it's not a `:' or a `{' then we can't really be looking at a
21734 class-head, since a class-head only appears as part of a
21735 class-specifier. We have to detect this situation before calling
21736 xref_tag, since that has irreversible side-effects. */
21738 {
21742 }
21744 /* At this point, we're going ahead with the class-specifier, even
21745 if some other problem occurs. */
21748 {
21753 }
21754 /* Issue the error about the overly-qualified name now. */
21756 {
21761 }
21763 {
21768 }
21770 {
21771 tree scope;
21773 /* Reject typedef-names in class heads. */
21775 {
21778 type);
21781 }
21783 /* Figure out in what scope the declaration is being placed. */
21785 /* If that scope does not contain the scope in which the
21786 class was originally declared, the program is invalid. */
21788 {
21791 "declaration of %qD in namespace %qD which does not "
21794 else
21800 }
21801 /* [dcl.meaning]
21803 A declarator-id shall not be qualified except for the
21804 definition of a ... nested class outside of its class
21805 ... [or] the definition or explicit instantiation of a
21806 class member of a namespace outside of its namespace. */
21808 {
21813 }
21814 }
21815 /* An explicit-specialization must be preceded by "template <>". If
21816 it is not, try to recover gracefully. */
21820 {
21824 /* Take the same action that would have been taken by
21825 cp_parser_explicit_specialization. */
21828 }
21829 /* There must be no "return" statements between this point and the
21830 end of this function; set "type "to the correct return value and
21831 use "goto done;" to return. */
21832 /* Make sure that the right number of template parameters were
21833 present. */
21837 {
21838 /* If something went wrong, there is no point in even trying to
21839 process the class-definition. */
21842 }
21844 /* Look up the type. */
21846 {
21850 {
21854 }
21855 else
21856 {
21859 }
21862 }
21864 {
21865 tree class_type;
21867 /* Given:
21869 template <typename T> struct S { struct T };
21870 template <typename T> struct S<T>::T { };
21872 we will get a TYPENAME_TYPE when processing the definition of
21873 `S::T'. We need to resolve it to the actual type before we
21874 try to define it. */
21876 {
21881 else
21882 {
21885 }
21886 }
21890 {
21893 }
21896 /* Enter the scope indicated by the nested-name-specifier. */
21898 /* Get the canonical version of this type. */
21900 /* Call push_template_decl if it seems like we should be defining a
21901 template either from the template headers or the type we're
21902 defining, so that we diagnose both extra and missing headers. */
21906 {
21909 {
21912 }
21913 }
21917 }
21919 {
21920 /* If the class was unnamed, create a dummy name. */
21925 }
21927 /* Indicate whether this class was declared as a `class' or as a
21928 `struct'. */
21933 /* If this type was already complete, and we see another definition,
21934 that's an error. */
21936 {
21938 type);
21940 type);
21943 }
21948 {
21949 /* Apply attributes now, before any use of the class as a template
21950 argument in its base list. */
21953 }
21955 /* We will have entered the scope containing the class; the names of
21956 base classes should be looked up in that context. For example:
21958 struct A { struct B {}; struct C; };
21959 struct A::C : B {};
21961 is valid. */
21963 /* Get the list of base-classes, if there is one. */
21965 {
21966 /* PR59482: enter the class scope so that base-specifiers are looked
21967 up correctly. */
21971 /* PR59482: get out of the previously pushed class scope so that the
21972 subsequent pops pop the right thing. */
21975 }
21976 else
21979 /* If we're really defining a class, process the base classes.
21980 If they're invalid, fail. */
21985 done:
21986 /* Leave the scope given by the nested-name-specifier. We will
21987 enter the class scope itself while processing the members. */
21992 {
21995 }
22001 out:
22004 }
22006 /* Parse a class-key.
22008 class-key:
22009 class
22010 struct
22011 union
22013 Returns the kind of class-key specified, or none_type to indicate
22014 error. */
22016 static enum tag_types
22018 {
22022 /* Look for the class-key. */
22027 /* Check to see if the TOKEN is a class-key. */
22032 }
22034 /* Parse a type-parameter-key.
22036 type-parameter-key:
22037 class
22038 typename
22039 */
22041 static void
22043 {
22044 /* Look for the type-parameter-key. */
22048 {
22051 /* typename is not allowed in a template template parameter
22052 by the standard until C++1Z. */
22054 "ISO C++ forbids typename key in template template parameter;"
22056 }
22057 else
22061 }
22063 /* Parse an (optional) member-specification.
22065 member-specification:
22066 member-declaration member-specification [opt]
22067 access-specifier : member-specification [opt] */
22069 static void
22071 {
22073 {
22077 /* Peek at the next token. */
22079 /* If it's a `}', or EOF then we've seen all the members. */
22085 /* See if this token is a keyword. */
22088 {
22092 /* Consume the access-specifier. */
22094 /* Remember which access-specifier is active. */
22096 /* Look for the `:'. */
22101 /* Accept #pragmas at class scope. */
22103 {
22106 }
22108 /* Otherwise, the next construction must be a
22109 member-declaration. */
22111 }
22112 }
22113 }
22115 /* Parse a member-declaration.
22117 member-declaration:
22118 decl-specifier-seq [opt] member-declarator-list [opt] ;
22119 function-definition ; [opt]
22120 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22121 using-declaration
22122 template-declaration
22123 alias-declaration
22125 member-declarator-list:
22126 member-declarator
22127 member-declarator-list , member-declarator
22129 member-declarator:
22130 declarator pure-specifier [opt]
22131 declarator constant-initializer [opt]
22132 identifier [opt] : constant-expression
22134 GNU Extensions:
22136 member-declaration:
22137 __extension__ member-declaration
22139 member-declarator:
22140 declarator attributes [opt] pure-specifier [opt]
22141 declarator attributes [opt] constant-initializer [opt]
22142 identifier [opt] attributes [opt] : constant-expression
22144 C++0x Extensions:
22146 member-declaration:
22147 static_assert-declaration */
22149 static void
22151 {
22152 cp_decl_specifier_seq decl_specifiers;
22153 tree prefix_attributes;
22154 tree decl;
22163 /* Check for the `__extension__' keyword. */
22165 {
22166 /* Recurse. */
22168 /* Restore the old value of the PEDANTIC flag. */
22172 }
22174 /* Check for a template-declaration. */
22176 {
22177 /* An explicit specialization here is an error condition, and we
22178 expect the specialization handler to detect and report this. */
22182 else
22186 }
22187 /* Check for a template introduction. */
22191 /* Check for a using-declaration. */
22193 {
22195 {
22196 /* Parse the using-declaration. */
22200 }
22201 else
22202 {
22203 tree decl;
22207 /* Note that if we actually see the '=' token after the
22208 identifier, cp_parser_alias_declaration commits the
22209 tentative parse. In that case, we really expect an
22210 alias-declaration. Otherwise, we expect a using
22211 declaration. */
22212 alias_decl_expected =
22218 else
22222 }
22223 }
22225 /* Check for @defs. */
22227 {
22232 {
22237 }
22239 }
22241 /* If the next token is `static_assert' we have a static assertion. */
22243 {
22246 }
22253 /* Parse the decl-specifier-seq. */
22256 CP_PARSER_FLAGS_OPTIONAL,
22259 /* Check for an invalid type-name. */
22263 /* If there is no declarator, then the decl-specifier-seq should
22264 specify a type. */
22266 {
22267 /* If there was no decl-specifier-seq, and the next token is a
22268 `;', then we have something like:
22270 struct S { ; };
22272 [class.mem]
22274 Each member-declaration shall declare at least one member
22275 name of the class. */
22277 {
22281 }
22282 else
22283 {
22284 tree type;
22286 /* See if this declaration is a friend. */
22288 /* If there were decl-specifiers, check to see if there was
22289 a class-declaration. */
22292 /* Nested classes have already been added to the class, but
22293 a `friend' needs to be explicitly registered. */
22295 {
22296 /* If the `friend' keyword was present, the friend must
22297 be introduced with a class-key. */
22300 "in C++03 a class-key must be used "
22302 /* In this case:
22304 template <typename T> struct A {
22305 friend struct A<T>::B;
22306 };
22308 A<T>::B will be represented by a TYPENAME_TYPE, and
22309 therefore not recognized by check_tag_decl. */
22311 {
22315 }
22318 "friend declaration does not name a class or "
22320 else
22323 }
22324 /* If there is no TYPE, an error message will already have
22325 been issued. */
22327 ;
22328 /* An anonymous aggregate has to be handled specially; such
22329 a declaration really declares a data member (with a
22330 particular type), as opposed to a nested class. */
22332 {
22333 /* C++11 9.5/6. */
22336 "a storage class on an anonymous aggregate "
22339 /* Remove constructors and such from TYPE, now that we
22340 know it is an anonymous aggregate. */
22342 /* And make the corresponding data member. */
22345 /* Add it to the class. */
22347 }
22348 else
22349 cp_parser_check_access_in_redeclaration
22352 }
22353 }
22354 else
22355 {
22358 /* Clear attributes from the decl_specifiers but keep them
22359 around as prefix attributes that apply them to the entity
22360 being declared. */
22364 /* See if these declarations will be friends. */
22367 /* Keep going until we hit the `;' at the end of the
22368 declaration. */
22370 {
22372 tree first_attribute;
22374 /* Peek at the next token. */
22377 /* Check for a bitfield declaration. */
22382 {
22383 tree identifier;
22384 tree width;
22386 /* Get the name of the bitfield. Note that we cannot just
22387 check TOKEN here because it may have been invalidated by
22388 the call to cp_lexer_peek_nth_token above. */
22391 else
22394 /* Consume the `:' token. */
22396 /* Get the width of the bitfield. */
22397 width
22400 /* Look for attributes that apply to the bitfield. */
22402 /* Remember which attributes are prefix attributes and
22403 which are not. */
22405 /* Combine the attributes. */
22408 /* Create the bitfield declaration. */
22411 identifier,
22412 sfk_none)
22415 width,
22416 attributes);
22417 }
22418 else
22419 {
22421 tree initializer;
22422 tree asm_specification;
22425 /* Parse the declarator. */
22426 declarator
22431 friend_p);
22433 /* If something went wrong parsing the declarator, make sure
22434 that we at least consume some tokens. */
22436 {
22437 /* Skip to the end of the statement. */
22439 /* If the next token is not a semicolon, that is
22440 probably because we just skipped over the body of
22441 a function. So, we consume a semicolon if
22442 present, but do not issue an error message if it
22443 is not present. */
22445 CPP_SEMICOLON))
22448 }
22451 cp_parser_check_for_definition_in_return_type
22455 /* Look for an asm-specification. */
22457 /* Look for attributes that apply to the declaration. */
22459 /* Remember which attributes are prefix attributes and
22460 which are not. */
22462 /* Combine the attributes. */
22465 /* If it's an `=', then we have a constant-initializer or a
22466 pure-specifier. It is not correct to parse the
22467 initializer before registering the member declaration
22468 since the member declaration should be in scope while
22469 its initializer is processed. However, the rest of the
22470 front end does not yet provide an interface that allows
22471 us to handle this correctly. */
22473 {
22474 /* In [class.mem]:
22476 A pure-specifier shall be used only in the declaration of
22477 a virtual function.
22479 A member-declarator can contain a constant-initializer
22480 only if it declares a static member of integral or
22481 enumeration type.
22483 Therefore, if the DECLARATOR is for a function, we look
22484 for a pure-specifier; otherwise, we look for a
22485 constant-initializer. When we call `grokfield', it will
22486 perform more stringent semantics checks. */
22498 {
22500 /* Don't require a constant rvalue in C++11, since we
22501 might want a reference constant. We'll enforce
22502 constancy later. */
22504 /* Parse the initializer. */
22507 }
22508 else
22509 /* Parse the initializer. */
22511 }
22514 {
22518 else
22520 }
22521 /* Otherwise, there is no initializer. */
22522 else
22525 /* See if we are probably looking at a function
22526 definition. We are certainly not looking at a
22527 member-declarator. Calling `grokfield' has
22528 side-effects, so we must not do it unless we are sure
22529 that we are looking at a member-declarator. */
22532 {
22533 /* The grammar does not allow a pure-specifier to be
22534 used when a member function is defined. (It is
22535 possible that this fact is an oversight in the
22536 standard, since a pure function may be defined
22537 outside of the class-specifier. */
22543 declarator,
22544 attributes);
22547 /* If the member was not a friend, declare it here. */
22550 /* Peek at the next token. */
22552 /* If the next token is a semicolon, consume it. */
22556 }
22557 else
22560 /* Create the declaration. */
22565 {
22568 else
22570 }
22571 }
22576 /* Reset PREFIX_ATTRIBUTES. */
22582 /* If there is any qualification still in effect, clear it
22583 now; we will be starting fresh with the next declarator. */
22587 /* If it's a `,', then there are more declarators. */
22589 {
22592 {
22596 }
22597 }
22598 /* If the next token isn't a `;', then we have a parse error. */
22600 CPP_SEMICOLON))
22601 {
22602 /* The next token might be a ways away from where the
22603 actual semicolon is missing. Find the previous token
22604 and use that for our error position. */
22609 /* Assume that the user meant to provide a semicolon. If
22610 we were to cp_parser_skip_to_end_of_statement, we might
22611 skip to a semicolon inside a member function definition
22612 and issue nonsensical error messages. */
22614 }
22617 {
22618 /* Add DECL to the list of members. */
22620 /* Explicitly include, eg, NSDMIs, for better error
22621 recovery (c++/58650). */
22630 /* Add DECL to the queue of NSDMI to be parsed later. */
22632 }
22636 }
22637 }
22640 out:
22642 }
22644 /* Parse a pure-specifier.
22646 pure-specifier:
22647 = 0
22649 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22650 Otherwise, ERROR_MARK_NODE is returned. */
22652 static tree
22654 {
22657 /* Look for the `=' token. */
22660 /* Look for the `0' token. */
22669 /* Accept = default or = delete in c++0x mode. */
22672 {
22675 }
22677 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22679 {
22684 }
22686 {
22689 }
22692 }
22694 /* Parse a constant-initializer.
22696 constant-initializer:
22697 = constant-expression
22699 Returns a representation of the constant-expression. */
22701 static tree
22703 {
22704 /* Look for the `=' token. */
22708 /* It is invalid to write:
22710 struct S { static const int i = { 7 }; };
22712 */
22714 {
22717 /* Consume the opening brace. */
22719 /* Skip the initializer. */
22721 /* Look for the trailing `}'. */
22725 }
22728 }
22730 /* Derived classes [gram.class.derived] */
22732 /* Parse a base-clause.
22734 base-clause:
22735 : base-specifier-list
22737 base-specifier-list:
22738 base-specifier ... [opt]
22739 base-specifier-list , base-specifier ... [opt]
22741 Returns a TREE_LIST representing the base-classes, in the order in
22742 which they were declared. The representation of each node is as
22743 described by cp_parser_base_specifier.
22745 In the case that no bases are specified, this function will return
22746 NULL_TREE, not ERROR_MARK_NODE. */
22748 static tree
22750 {
22753 /* Look for the `:' that begins the list. */
22756 /* Scan the base-specifier-list. */
22758 {
22760 tree base;
22763 /* Look for the base-specifier. */
22765 /* Look for the (optional) ellipsis. */
22767 {
22768 /* Consume the `...'. */
22772 }
22774 /* Add BASE to the front of the list. */
22776 {
22778 /* Make this a pack expansion type. */
22782 {
22785 }
22786 }
22787 /* Peek at the next token. */
22789 /* If it's not a comma, then the list is complete. */
22792 /* Consume the `,'. */
22794 }
22796 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22797 base class had a qualified name. However, the next name that
22798 appears is certainly not qualified. */
22804 }
22806 /* Parse a base-specifier.
22808 base-specifier:
22809 :: [opt] nested-name-specifier [opt] class-name
22810 virtual access-specifier [opt] :: [opt] nested-name-specifier
22811 [opt] class-name
22812 access-specifier virtual [opt] :: [opt] nested-name-specifier
22813 [opt] class-name
22815 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22816 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22817 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22818 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22820 static tree
22822 {
22830 tree type;
22832 /* Process the optional `virtual' and `access-specifier'. */
22834 {
22835 /* Peek at the next token. */
22837 /* Process `virtual'. */
22839 {
22841 /* If `virtual' appears more than once, issue an error. */
22843 {
22847 }
22851 /* Consume the `virtual' token. */
22859 /* If more than one access specifier appears, issue an
22860 error. */
22863 {
22867 }
22871 /* Consume the access-specifier. */
22879 }
22880 }
22881 /* It is not uncommon to see programs mechanically, erroneously, use
22882 the 'typename' keyword to denote (dependent) qualified types
22883 as base classes. */
22885 {
22890 else
22892 "keyword %<typename%> not allowed in this context "
22895 }
22897 /* Look for the optional `::' operator. */
22899 /* Look for the nested-name-specifier. The simplest way to
22900 implement:
22902 [temp.res]
22904 The keyword `typename' is not permitted in a base-specifier or
22905 mem-initializer; in these contexts a qualified name that
22906 depends on a template-parameter is implicitly assumed to be a
22907 type name.
22909 is to pretend that we have seen the `typename' keyword at this
22910 point. */
22914 typename_type,
22916 /* If the base class is given by a qualified name, assume that names
22917 we see are type names or templates, as appropriate. */
22923 /* DR 950 allows decltype as a base-specifier. */
22925 else
22926 {
22927 /* Otherwise, look for the class-name. */
22929 class_scope_p,
22930 template_p,
22931 typename_type,
22936 }
22942 }
22944 /* Exception handling [gram.exception] */
22946 /* Parse an (optional) noexcept-specification.
22948 noexcept-specification:
22949 noexcept ( constant-expression ) [opt]
22951 If no noexcept-specification is present, returns NULL_TREE.
22952 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
22953 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
22954 there are no parentheses. CONSUMED_EXPR will be set accordingly.
22955 Otherwise, returns a noexcept specification unless RETURN_COND is true,
22956 in which case a boolean condition is returned instead. */
22958 static tree
22963 {
22967 /* Peek at the next token. */
22970 /* Is it a noexcept-specification? */
22972 {
22973 tree expr;
22977 {
22981 {
22982 /* Types may not be defined in an exception-specification. */
22984 parser->type_definition_forbidden_message
22989 /* Restore the saved message. */
22991 }
22992 else
22993 {
22996 }
22999 }
23000 else
23001 {
23005 }
23007 /* We cannot build a noexcept-spec right away because this will check
23008 that expr is a constexpr. */
23011 else
23013 }
23014 else
23016 }
23018 /* Parse an (optional) exception-specification.
23020 exception-specification:
23021 throw ( type-id-list [opt] )
23023 Returns a TREE_LIST representing the exception-specification. The
23024 TREE_VALUE of each node is a type. */
23026 static tree
23028 {
23030 tree type_id_list;
23033 /* Peek at the next token. */
23036 /* Is it a noexcept-specification? */
23042 /* If it's not `throw', then there's no exception-specification. */
23046 #if 0
23047 /* Enable this once a lot of code has transitioned to noexcept? */
23051 #endif
23053 /* Consume the `throw'. */
23056 /* Look for the `('. */
23059 /* Peek at the next token. */
23061 /* If it's not a `)', then there is a type-id-list. */
23063 {
23064 /* Types may not be defined in an exception-specification. */
23066 parser->type_definition_forbidden_message
23068 /* Parse the type-id-list. */
23070 /* Restore the saved message. */
23072 }
23073 else
23076 /* Look for the `)'. */
23080 }
23082 /* Parse an (optional) type-id-list.
23084 type-id-list:
23085 type-id ... [opt]
23086 type-id-list , type-id ... [opt]
23088 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23089 in the order that the types were presented. */
23091 static tree
23093 {
23097 {
23099 tree type;
23103 /* Get the next type-id. */
23105 /* Check for invalid 'auto'. */
23107 {
23111 }
23112 /* Parse the optional ellipsis. */
23114 {
23115 /* Consume the `...'. */
23118 /* Turn the type into a pack expansion expression. */
23120 }
23121 /* Add it to the list. */
23123 /* Peek at the next token. */
23125 /* If it is not a `,', we are done. */
23128 /* Consume the `,'. */
23130 }
23133 }
23135 /* Parse a try-block.
23137 try-block:
23138 try compound-statement handler-seq */
23140 static tree
23142 {
23143 tree try_block;
23157 }
23159 /* Parse a function-try-block.
23161 function-try-block:
23162 try ctor-initializer [opt] function-body handler-seq */
23164 static bool
23166 {
23167 tree compound_stmt;
23168 tree try_block;
23171 /* Look for the `try' keyword. */
23174 /* Let the rest of the front end know where we are. */
23176 /* Parse the function-body. */
23177 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23179 /* We're done with the `try' part. */
23181 /* Parse the handlers. */
23183 /* We're done with the handlers. */
23187 }
23189 /* Parse a handler-seq.
23191 handler-seq:
23192 handler handler-seq [opt] */
23194 static void
23196 {
23198 {
23201 /* Parse the handler. */
23203 /* Peek at the next token. */
23205 /* If it's not `catch' then there are no more handlers. */
23208 }
23209 }
23211 /* Parse a handler.
23213 handler:
23214 catch ( exception-declaration ) compound-statement */
23216 static void
23218 {
23219 tree handler;
23220 tree declaration;
23230 }
23232 /* Parse an exception-declaration.
23234 exception-declaration:
23235 type-specifier-seq declarator
23236 type-specifier-seq abstract-declarator
23237 type-specifier-seq
23238 ...
23240 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23241 ellipsis variant is used. */
23243 static tree
23245 {
23246 cp_decl_specifier_seq type_specifiers;
23250 /* If it's an ellipsis, it's easy to handle. */
23252 {
23253 /* Consume the `...' token. */
23256 }
23258 /* Types may not be defined in exception-declarations. */
23260 parser->type_definition_forbidden_message
23263 /* Parse the type-specifier-seq. */
23267 /* If it's a `)', then there is no declarator. */
23270 else
23277 /* Restore the saved message. */
23284 }
23286 /* Parse a throw-expression.
23288 throw-expression:
23289 throw assignment-expression [opt]
23291 Returns a THROW_EXPR representing the throw-expression. */
23293 static tree
23295 {
23296 tree expression;
23301 /* Figure out whether or not there is an assignment-expression
23302 following the "throw" keyword. */
23310 else
23314 }
23316 /* GNU Extensions */
23318 /* Parse an (optional) asm-specification.
23320 asm-specification:
23321 asm ( string-literal )
23323 If the asm-specification is present, returns a STRING_CST
23324 corresponding to the string-literal. Otherwise, returns
23325 NULL_TREE. */
23327 static tree
23329 {
23331 tree asm_specification;
23333 /* Peek at the next token. */
23335 /* If the next token isn't the `asm' keyword, then there's no
23336 asm-specification. */
23340 /* Consume the `asm' token. */
23342 /* Look for the `('. */
23345 /* Look for the string-literal. */
23348 /* Look for the `)'. */
23352 }
23354 /* Parse an asm-operand-list.
23356 asm-operand-list:
23357 asm-operand
23358 asm-operand-list , asm-operand
23360 asm-operand:
23361 string-literal ( expression )
23362 [ string-literal ] string-literal ( expression )
23364 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23365 each node is the expression. The TREE_PURPOSE is itself a
23366 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23367 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23368 is a STRING_CST for the string literal before the parenthesis. Returns
23369 ERROR_MARK_NODE if any of the operands are invalid. */
23371 static tree
23373 {
23378 {
23379 tree string_literal;
23380 tree expression;
23381 tree name;
23384 {
23385 /* Consume the `[' token. */
23387 /* Read the operand name. */
23392 /* Look for the closing `]'. */
23394 }
23395 else
23397 /* Look for the string-literal. */
23400 /* Look for the `('. */
23402 /* Parse the expression. */
23404 /* Look for the `)'. */
23412 /* Add this operand to the list. */
23414 expression,
23415 asm_operands);
23416 /* If the next token is not a `,', there are no more
23417 operands. */
23420 /* Consume the `,'. */
23422 }
23425 }
23427 /* Parse an asm-clobber-list.
23429 asm-clobber-list:
23430 string-literal
23431 asm-clobber-list , string-literal
23433 Returns a TREE_LIST, indicating the clobbers in the order that they
23434 appeared. The TREE_VALUE of each node is a STRING_CST. */
23436 static tree
23438 {
23442 {
23443 tree string_literal;
23445 /* Look for the string literal. */
23447 /* Add it to the list. */
23449 /* If the next token is not a `,', then the list is
23450 complete. */
23453 /* Consume the `,' token. */
23455 }
23458 }
23460 /* Parse an asm-label-list.
23462 asm-label-list:
23463 identifier
23464 asm-label-list , identifier
23466 Returns a TREE_LIST, indicating the labels in the order that they
23467 appeared. The TREE_VALUE of each node is a label. */
23469 static tree
23471 {
23475 {
23478 /* Look for the identifier. */
23481 {
23484 {
23490 }
23491 }
23492 /* If the next token is not a `,', then the list is
23493 complete. */
23496 /* Consume the `,' token. */
23498 }
23501 }
23503 /* Return TRUE iff the next tokens in the stream are possibly the
23504 beginning of a GNU extension attribute. */
23506 static bool
23508 {
23510 }
23512 /* Return TRUE iff the next tokens in the stream are possibly the
23513 beginning of a standard C++-11 attribute specifier. */
23515 static bool
23517 {
23519 }
23521 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23522 beginning of a standard C++-11 attribute specifier. */
23524 static bool
23526 {
23534 }
23536 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23537 beginning of a GNU extension attribute. */
23539 static bool
23541 {
23545 }
23547 /* Return true iff the next tokens can be the beginning of either a
23548 GNU attribute list, or a standard C++11 attribute sequence. */
23550 static bool
23552 {
23555 }
23557 /* Return true iff the next Nth tokens can be the beginning of either
23558 a GNU attribute list, or a standard C++11 attribute sequence. */
23560 static bool
23562 {
23565 }
23567 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23568 of GNU attributes, or return NULL. */
23570 static tree
23572 {
23576 }
23578 #define CILK_SIMD_FN_CLAUSE_MASK \
23579 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23580 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23581 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23582 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23583 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23585 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23586 vector [(<clauses>)] */
23588 static void
23590 {
23594 {
23599 }
23602 {
23605 paren_scope++;
23606 }
23608 {
23611 paren_scope++;
23613 paren_scope--;
23614 /* Do not push the last ')' */
23617 }
23626 }
23628 /* Parse an (optional) series of attributes.
23630 attributes:
23631 attributes attribute
23633 attribute:
23634 __attribute__ (( attribute-list [opt] ))
23636 The return value is as for cp_parser_gnu_attribute_list. */
23638 static tree
23640 {
23644 {
23646 tree attribute_list;
23649 /* Peek at the next token. */
23651 /* If it's not `__attribute__', then we're done. */
23655 /* Consume the `__attribute__' keyword. */
23657 /* Look for the two `(' tokens. */
23661 /* Peek at the next token. */
23664 /* Parse the attribute-list. */
23666 else
23667 /* If the next token is a `)', then there is no attribute
23668 list. */
23671 /* Look for the two `)' tokens. */
23679 /* Add these new attributes to the list. */
23681 }
23684 }
23686 /* Parse a GNU attribute-list.
23688 attribute-list:
23689 attribute
23690 attribute-list , attribute
23692 attribute:
23693 identifier
23694 identifier ( identifier )
23695 identifier ( identifier , expression-list )
23696 identifier ( expression-list )
23698 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23699 to an attribute. The TREE_PURPOSE of each node is the identifier
23700 indicating which attribute is in use. The TREE_VALUE represents
23701 the arguments, if any. */
23703 static tree
23705 {
23711 {
23713 tree identifier;
23714 tree attribute;
23716 /* Look for the identifier. We also allow keywords here; for
23717 example `__attribute__ ((const))' is legal. */
23721 {
23724 /* Consume the token, but save it since we need it for the
23725 SIMD enabled function parsing. */
23728 /* Save away the identifier that indicates which attribute
23729 this is. */
23731 /* For keywords, use the canonical spelling, not the
23732 parsed identifier. */
23738 /* Peek at the next token. */
23740 /* If it's an `(', then parse the attribute arguments. */
23742 {
23747 {
23750 }
23751 else
23752 vec = cp_parser_parenthesized_expression_list
23758 else
23759 {
23762 }
23763 /* Save the arguments away. */
23765 }
23767 {
23770 }
23773 {
23774 /* Add this attribute to the list. */
23777 }
23780 }
23781 /* Now, look for more attributes. If the next token isn't a
23782 `,', we're done. */
23786 /* Consume the comma and keep going. */
23788 }
23791 /* We built up the list in reverse order. */
23793 }
23795 /* Parse a standard C++11 attribute.
23797 The returned representation is a TREE_LIST which TREE_PURPOSE is
23798 the scoped name of the attribute, and the TREE_VALUE is its
23799 arguments list.
23801 Note that the scoped name of the attribute is itself a TREE_LIST
23802 which TREE_PURPOSE is the namespace of the attribute, and
23803 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23804 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23805 and which TREE_PURPOSE is directly the attribute name.
23807 Clients of the attribute code should use get_attribute_namespace
23808 and get_attribute_name to get the actual namespace and name of
23809 attributes, regardless of their being GNU or C++11 attributes.
23811 attribute:
23812 attribute-token attribute-argument-clause [opt]
23814 attribute-token:
23815 identifier
23816 attribute-scoped-token
23818 attribute-scoped-token:
23819 attribute-namespace :: identifier
23821 attribute-namespace:
23822 identifier
23824 attribute-argument-clause:
23825 ( balanced-token-seq )
23827 balanced-token-seq:
23828 balanced-token [opt]
23829 balanced-token-seq balanced-token
23831 balanced-token:
23832 ( balanced-token-seq )
23833 [ balanced-token-seq ]
23834 { balanced-token-seq }. */
23836 static tree
23838 {
23842 /* First, parse name of the attribute, a.k.a attribute-token. */
23859 {
23860 /* We are seeing a scoped attribute token. */
23870 else
23871 {
23875 }
23877 NULL_TREE);
23879 }
23880 else
23881 {
23883 NULL_TREE);
23884 /* C++11 noreturn attribute is equivalent to GNU's. */
23887 /* C++14 deprecated attribute is equivalent to GNU's. */
23889 {
23892 "%<deprecated%> is a C++14 feature;"
23895 }
23896 /* Transactional Memory TS optimize_for_synchronized attribute is
23897 equivalent to GNU transaction_callable. */
23901 /* Transactional Memory attributes are GNU attributes. */
23904 }
23906 /* Now parse the optional argument clause of the attribute. */
23911 {
23917 /* A GNU attribute that takes an identifier in parameter. */
23920 vec = cp_parser_parenthesized_expression_list
23926 else
23927 {
23930 }
23934 else
23936 }
23939 }
23941 /* Check that the attribute ATTRIBUTE appears at most once in the
23942 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
23943 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
23944 isn't implemented yet in GCC. */
23946 static void
23948 {
23950 {
23960 }
23961 }
23963 /* Parse a list of standard C++-11 attributes.
23965 attribute-list:
23966 attribute [opt]
23967 attribute-list , attribute[opt]
23968 attribute ...
23969 attribute-list , attribute ...
23970 */
23972 static tree
23974 {
23979 {
23984 {
23988 }
23991 {
23996 }
24000 }
24003 }
24005 /* Parse a standard C++-11 attribute specifier.
24007 attribute-specifier:
24008 [ [ attribute-list ] ]
24009 alignment-specifier
24011 alignment-specifier:
24012 alignas ( type-id ... [opt] )
24013 alignas ( alignment-expression ... [opt] ). */
24015 static tree
24017 {
24023 {
24032 else
24033 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24034 when we are sure that we have actually parsed them. */
24036 }
24037 else
24038 {
24039 tree alignas_expr;
24041 /* Look for an alignment-specifier. */
24053 {
24056 }
24062 {
24066 alignas_expr =
24073 }
24079 {
24082 }
24085 {
24088 }
24090 /* Build the C++-11 representation of an 'aligned'
24091 attribute. */
24092 attributes =
24095 alignas_expr);
24096 }
24099 }
24101 /* Parse a standard C++-11 attribute-specifier-seq.
24103 attribute-specifier-seq:
24104 attribute-specifier-seq [opt] attribute-specifier
24105 */
24107 static tree
24109 {
24113 {
24122 }
24126 }
24128 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24129 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24130 current value of the PEDANTIC flag, regardless of whether or not
24131 the `__extension__' keyword is present. The caller is responsible
24132 for restoring the value of the PEDANTIC flag. */
24134 static bool
24136 {
24137 /* Save the old value of the PEDANTIC flag. */
24141 {
24142 /* Consume the `__extension__' token. */
24144 /* We're not being pedantic while the `__extension__' keyword is
24145 in effect. */
24149 }
24152 }
24154 /* Parse a label declaration.
24156 label-declaration:
24157 __label__ label-declarator-seq ;
24159 label-declarator-seq:
24160 identifier , label-declarator-seq
24161 identifier */
24163 static void
24165 {
24166 /* Look for the `__label__' keyword. */
24170 {
24171 tree identifier;
24173 /* Look for an identifier. */
24175 /* If we failed, stop. */
24178 /* Declare it as a label. */
24180 /* If the next token is a `;', stop. */
24183 /* Look for the `,' separating the label declarations. */
24185 }
24187 /* Look for the final `;'. */
24189 }
24191 // -------------------------------------------------------------------------- //
24192 // Requires Clause
24194 // Parse a requires clause.
24195 //
24196 // requires-clause:
24197 // 'requires' logical-or-expression
24198 //
24199 // The required logical-or-expression must be a constant expression. Note
24200 // that we don't check that the expression is constepxr here. We defer until
24201 // we analyze constraints and then, we only check atomic constraints.
24202 static tree
24204 {
24205 // Parse the requires clause so that it is not automatically folded.
24211 }
24213 // Optionally parse a requires clause:
24214 static tree
24216 {
24221 }
24224 /*---------------------------------------------------------------------------
24225 Requires expressions
24226 ---------------------------------------------------------------------------*/
24228 /* Parse a requires expression
24230 requirement-expression:
24231 'requires' requirement-parameter-list [opt] requirement-body */
24232 static tree
24234 {
24238 /* A requires-expression shall appear only within a concept
24239 definition or a requires-clause.
24241 TODO: Implement this diagnostic correctly. */
24243 {
24247 }
24250 {
24251 /* Local parameters are delared as variables within the scope
24252 of the expression. They are not visible past the end of
24253 the expression. Expressions within the requires-expression
24254 are unevaluated. */
24255 struct scope_sentinel
24256 {
24258 {
24261 }
24264 {
24267 }
24270 /* Parse the optional parameter list. */
24272 {
24276 }
24277 else
24280 /* Parse the requirement body. */
24284 }
24286 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24287 the parm chain. */
24290 }
24292 /* Parse a parameterized requirement.
24294 requirement-parameter-list:
24295 '(' parameter-declaration-clause ')' */
24296 static tree
24298 {
24308 }
24310 /* Parse the body of a requirement.
24312 requirement-body:
24313 '{' requirement-list '}' */
24314 static tree
24316 {
24326 }
24328 /* Parse a list of requirements.
24330 requirement-list:
24331 requirement
24332 requirement-list ';' requirement[opt] */
24333 static tree
24335 {
24338 {
24345 /* If we see a semi-colon, consume it. */
24349 /* Stop processing at the end of the list. */
24352 }
24354 /* Reverse the order of requirements so they are analyzed in
24355 declaration order. */
24357 }
24359 /* Parse a syntactic requirement or type requirement.
24361 requirement:
24362 simple-requirement
24363 compound-requirement
24364 type-requirement
24365 nested-requirement */
24366 static tree
24368 {
24375 else
24377 }
24379 /* Parse a simple requirement.
24381 simple-requirement:
24382 expression ';' */
24383 static tree
24385 {
24394 }
24396 /* Parse a type requirement
24398 type-requirement
24399 nested-name-specifier [opt] required-type-name ';'
24401 required-type-name:
24402 type-name
24403 'template' [opt] simple-template-id */
24404 static tree
24406 {
24409 // Save the scope before parsing name specifiers.
24420 tree type;
24422 {
24431 }
24432 else
24451 }
24453 /* Parse a compound requirement
24455 compound-requirement:
24456 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24457 static tree
24459 {
24460 /* Parse an expression enclosed in '{ }'s. */
24471 /* Parse the optional noexcept. */
24474 {
24477 }
24479 /* Parse the optional trailing return type. */
24482 {
24490 }
24493 }
24495 /* Parse a nested requirement. This is the same as a requires clause.
24497 nested-requirement:
24498 requires-clause */
24499 static tree
24501 {
24507 }
24509 /* Support Functions */
24511 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24512 NAME should have one of the representations used for an
24513 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24514 is returned. If PARSER->SCOPE is a dependent type, then a
24515 SCOPE_REF is returned.
24517 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24518 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24519 was formed. Abstractly, such entities should not be passed to this
24520 function, because they do not need to be looked up, but it is
24521 simpler to check for this special case here, rather than at the
24522 call-sites.
24524 In cases not explicitly covered above, this function returns a
24525 DECL, OVERLOAD, or baselink representing the result of the lookup.
24526 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24527 is returned.
24529 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24530 (e.g., "struct") that was used. In that case bindings that do not
24531 refer to types are ignored.
24533 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24534 ignored.
24536 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24537 are ignored.
24539 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24540 types.
24542 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24543 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24544 NULL_TREE otherwise. */
24546 static cp_expr
24553 location_t name_location)
24554 {
24555 tree decl;
24558 /* Assume that the lookup will be unambiguous. */
24562 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24563 no longer valid. Note that if we are parsing tentatively, and
24564 the parse fails, OBJECT_TYPE will be automatically restored. */
24570 /* A template-id has already been resolved; there is no lookup to
24571 do. */
24575 {
24579 }
24581 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24582 it should already have been checked to make sure that the name
24583 used matches the type being destroyed. */
24585 {
24586 tree type;
24588 /* Figure out to which type this destructor applies. */
24593 else
24595 /* If that's not a class type, there is no destructor. */
24602 /* If it was a class type, return the destructor. */
24604 }
24606 /* By this point, the NAME should be an ordinary identifier. If
24607 the id-expression was a qualified name, the qualifying scope is
24608 stored in PARSER->SCOPE at this point. */
24611 /* Perform the lookup. */
24613 {
24619 /* If the SCOPE is dependent, the lookup must be deferred until
24620 the template is instantiated -- unless we are explicitly
24621 looking up names in uninstantiated templates. Even then, we
24622 cannot look up the name if the scope is not a class type; it
24623 might, for example, be a template type parameter. */
24628 /* Defer lookup. */
24630 else
24631 {
24634 /* If PARSER->SCOPE is a dependent type, then it must be a
24635 class type, and we must not be checking dependencies;
24636 otherwise, we would have processed this lookup above. So
24637 that PARSER->SCOPE is not considered a dependent base by
24638 lookup_member, we must enter the scope here. */
24642 /* If the PARSER->SCOPE is a template specialization, it
24643 may be instantiated during name lookup. In that case,
24644 errors may be issued. Even if we rollback the current
24645 tentative parse, those errors are valid. */
24650 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24651 lookup result and the nested-name-specifier nominates a class C:
24652 * if the name specified after the nested-name-specifier, when
24653 looked up in C, is the injected-class-name of C (Clause 9), or
24654 * if the name specified after the nested-name-specifier is the
24655 same as the identifier or the simple-template-id's template-
24656 name in the last component of the nested-name-specifier,
24657 the name is instead considered to name the constructor of
24658 class C. [ Note: for example, the constructor is not an
24659 acceptable lookup result in an elaborated-type-specifier so
24660 the constructor would not be used in place of the
24661 injected-class-name. --end note ] Such a constructor name
24662 shall be used only in the declarator-id of a declaration that
24663 names a constructor or in a using-declaration. */
24671 /* If we have a single function from a using decl, pull it out. */
24678 }
24680 /* If the scope is a dependent type and either we deferred lookup or
24681 we did lookup but didn't find the name, rememeber the name. */
24684 {
24686 {
24687 tree type;
24689 /* The resolution to Core Issue 180 says that `struct
24690 A::B' should be considered a type-name, even if `A'
24691 is dependent. */
24696 }
24700 CPP_CLOSE_PAREN)))
24704 else
24707 is_template);
24708 }
24711 }
24713 {
24714 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24715 OBJECT_TYPE is not a class. */
24717 /* If the OBJECT_TYPE is a template specialization, it may
24718 be instantiated during name lookup. In that case, errors
24719 may be issued. Even if we rollback the current tentative
24720 parse, those errors are valid. */
24722 name,
24725 tf_warning_or_error);
24726 else
24730 /* Look it up in the enclosing context. DR 141: When looking for a
24731 template-name after -> or ., only consider class templates. */
24736 /* The object is type-dependent, so we can't look anything up; we used
24737 this to get the DR 141 behavior. */
24741 }
24742 else
24743 {
24749 }
24751 /* If the lookup failed, let our caller know. */
24755 /* Pull out the template from an injected-class-name (or multiple). */
24759 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
24761 {
24764 /* The error message we have to print is too complicated for
24765 cp_parser_error, so we incorporate its actions directly. */
24767 {
24769 name);
24771 }
24773 }
24781 /* If we have resolved the name of a member declaration, check to
24782 see if the declaration is accessible. When the name resolves to
24783 set of overloaded functions, accessibility is checked when
24784 overload resolution is done.
24786 During an explicit instantiation, access is not checked at all,
24787 as per [temp.explicit]. */
24794 }
24796 /* Like cp_parser_lookup_name, but for use in the typical case where
24797 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
24798 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
24800 static tree
24802 {
24804 none_type,
24809 location);
24810 }
24812 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24813 the current context, return the TYPE_DECL. If TAG_NAME_P is
24814 true, the DECL indicates the class being defined in a class-head,
24815 or declared in an elaborated-type-specifier.
24817 Otherwise, return DECL. */
24819 static tree
24821 {
24822 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24823 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24825 struct A {
24826 template <typename T> struct B;
24827 };
24829 template <typename T> struct A::B {};
24831 Similarly, in an elaborated-type-specifier:
24833 namespace N { struct X{}; }
24835 struct A {
24836 template <typename T> friend struct N::X;
24837 };
24839 However, if the DECL refers to a class type, and we are in
24840 the scope of the class, then the name lookup automatically
24841 finds the TYPE_DECL created by build_self_reference rather
24842 than a TEMPLATE_DECL. For example, in:
24844 template <class T> struct S {
24845 S s;
24846 };
24848 there is no need to handle such case. */
24854 }
24856 /* If too many, or too few, template-parameter lists apply to the
24857 declarator, issue an error message. Returns TRUE if all went well,
24858 and FALSE otherwise. */
24860 static bool
24863 location_t declarator_location)
24864 {
24866 {
24868 {
24876 /* If the DECLARATOR has the form `X<y>' then it uses one
24877 additional level of template parameters. */
24880 return cp_parser_check_template_parameters
24882 }
24897 }
24899 }
24901 /* NUM_TEMPLATES were used in the current declaration. If that is
24902 invalid, return FALSE and issue an error messages. Otherwise,
24903 return TRUE. If DECLARATOR is non-NULL, then we are checking a
24904 declarator and we can print more accurate diagnostics. */
24906 static bool
24909 location_t location,
24911 {
24912 /* If there are the same number of template classes and parameter
24913 lists, that's OK. */
24916 /* If there are more, but only one more, then we are referring to a
24917 member template. That's OK too. */
24920 /* If there are more template classes than parameter lists, we have
24921 something like:
24923 template <class T> void S<T>::R<T>::f (); */
24925 {
24935 else
24938 }
24939 /* Otherwise, there are too many template parameter lists. We have
24940 something like:
24942 template <class T> template <class U> void S::f(); */
24945 }
24947 /* Parse an optional `::' token indicating that the following name is
24948 from the global namespace. If so, PARSER->SCOPE is set to the
24949 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
24950 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
24951 Returns the new value of PARSER->SCOPE, if the `::' token is
24952 present, and NULL_TREE otherwise. */
24954 static tree
24956 {
24959 /* Peek at the next token. */
24961 /* If we're looking at a `::' token then we're starting from the
24962 global namespace, not our current location. */
24964 {
24965 /* Consume the `::' token. */
24967 /* Set the SCOPE so that we know where to start the lookup. */
24973 }
24975 {
24979 }
24982 }
24984 /* Returns TRUE if the upcoming token sequence is the start of a
24985 constructor declarator. If FRIEND_P is true, the declarator is
24986 preceded by the `friend' specifier. */
24988 static bool
24990 {
24993 tree nested_name_specifier;
24996 /* The common case is that this is not a constructor declarator, so
24997 try to avoid doing lots of work if at all possible. It's not
24998 valid declare a constructor at function scope. */
25001 /* And only certain tokens can begin a constructor declarator. */
25009 /* Parse tentatively; we are going to roll back all of the tokens
25010 consumed here. */
25012 /* Assume that we are looking at a constructor declarator. */
25015 /* Look for the optional `::' operator. */
25018 /* Look for the nested-name-specifier. */
25019 nested_name_specifier
25030 /* Outside of a class-specifier, there must be a
25031 nested-name-specifier. */
25037 /* If we have a class scope, this is easy; DR 147 says that S::S always
25038 names the constructor, and no other qualified name could. */
25041 {
25051 }
25052 /* If we still think that this might be a constructor-declarator,
25053 look for a class-name. */
25055 {
25056 /* If we have:
25058 template <typename T> struct S {
25059 S();
25060 };
25062 we must recognize that the nested `S' names a class. */
25063 tree type_decl;
25067 none_type,
25071 /* If there was no class-name, then this is not a constructor.
25072 Otherwise, if we are in a class-specifier and we aren't
25073 handling a friend declaration, check that its type matches
25074 current_class_type (c++/38313). Note: error_mark_node
25075 is left alone for error recovery purposes. */
25077 && (outside_class_specifier_p
25082 /* If we're still considering a constructor, we have to see a `(',
25083 to begin the parameter-declaration-clause, followed by either a
25084 `)', an `...', or a decl-specifier. We need to check for a
25085 type-specifier to avoid being fooled into thinking that:
25087 S (f) (int);
25089 is a constructor. (It is actually a function named `f' that
25090 takes one parameter (of type `int') and returns a value of type
25091 `S'. */
25099 /* A parameter declaration begins with a decl-specifier,
25100 which is either the "attribute" keyword, a storage class
25101 specifier, or (usually) a type-specifier. */
25103 {
25104 tree type;
25108 /* Names appearing in the type-specifier should be looked up
25109 in the scope of the class. */
25112 else
25113 {
25116 {
25120 {
25123 }
25124 }
25126 }
25128 /* Inside the constructor parameter list, surrounding
25129 template-parameter-lists do not apply. */
25130 saved_num_template_parameter_lists
25134 /* Look for the type-specifier. */
25136 CP_PARSER_FLAGS_NONE,
25142 parser->num_template_parameter_lists
25145 /* Leave the scope of the class. */
25150 }
25151 }
25153 /* We did not really want to consume any tokens. */
25157 }
25159 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25160 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25161 they must be performed once we are in the scope of the function.
25163 Returns the function defined. */
25165 static tree
25166 cp_parser_function_definition_from_specifiers_and_declarator
25169 tree attributes,
25171 {
25172 tree fn;
25175 /* Begin the function-definition. */
25178 /* The things we're about to see are not directly qualified by any
25179 template headers we've seen thus far. */
25182 /* If there were names looked up in the decl-specifier-seq that we
25183 did not check, check them now. We must wait until we are in the
25184 scope of the function to perform the checks, since the function
25185 might be a friend. */
25189 {
25194 }
25197 {
25198 /* Skip the entire function. */
25201 }
25203 {
25204 /* Seen already, skip it. An error message has already been output. */
25208 /* If this is a function from a class, pop the nested class. */
25211 }
25212 else
25213 {
25214 timevar_id_t tv;
25217 else
25223 }
25226 }
25228 /* Parse the part of a function-definition that follows the
25229 declarator. INLINE_P is TRUE iff this function is an inline
25230 function defined within a class-specifier.
25232 Returns the function defined. */
25234 static tree
25237 {
25238 tree fn;
25244 bool fully_implicit_function_template_p
25247 tree implicit_template_parms
25250 cp_binding_level* implicit_template_scope
25256 /* If the next token is `return', then the code may be trying to
25257 make use of the "named return value" extension that G++ used to
25258 support. */
25261 {
25262 /* Consume the `return' keyword. */
25264 /* Look for the identifier that indicates what value is to be
25265 returned. */
25267 /* Issue an error message. */
25270 /* Skip tokens until we reach the start of the function body. */
25272 {
25279 }
25280 }
25281 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25282 anything declared inside `f'. */
25283 saved_in_unbraced_linkage_specification_p
25286 /* Inside the function, surrounding template-parameter-lists do not
25287 apply. */
25288 saved_num_template_parameter_lists
25294 /* If the next token is `try', `__transaction_atomic', or
25295 `__transaction_relaxed`, then we are looking at either function-try-block
25296 or function-transaction-block. Note that all of these include the
25297 function-body. */
25300 RID_TRANSACTION_ATOMIC);
25302 RID_TRANSACTION_RELAXED))
25304 RID_TRANSACTION_RELAXED);
25307 else
25308 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25313 /* Finish the function. */
25316 /* Generate code for it, if necessary. */
25318 /* Restore the saved values. */
25319 parser->in_unbraced_linkage_specification_p
25321 parser->num_template_parameter_lists
25325 parser->fully_implicit_function_template_p
25327 parser->implicit_template_parms
25329 parser->implicit_template_scope
25336 }
25338 /* Parse a template-declaration body (following argument list). */
25340 static void
25342 tree parameter_list,
25344 {
25348 /* We just processed one more parameter list. */
25351 /* Get the deferred access checks from the parameter list. These
25352 will be checked once we know what is being declared, as for a
25353 member template the checks must be performed in the scope of the
25354 class containing the member. */
25357 /* Tentatively parse for a new template parameter list, which can either be
25358 the template keyword or a template introduction. */
25364 else
25365 {
25366 /* There are no access checks when parsing a template, as we do not
25367 know if a specialization will be a friend. */
25371 checks,
25372 member_p,
25377 /* If this is a member template declaration, let the front
25378 end know. */
25380 {
25385 }
25390 }
25391 /* We are done with the current parameter list. */
25396 /* Finish up. */
25399 /* Check the template arguments for a literal operator template. */
25403 {
25407 else
25408 {
25411 {
25417 }
25419 {
25427 }
25428 else
25430 }
25432 {
25435 " Expected non-type template argument pack <char...>"
25437 decl);
25438 else
25441 decl);
25442 }
25443 }
25445 /* Register member declarations. */
25448 /* If DECL is a function template, we must return to parse it later.
25449 (Even though there is no definition, there might be default
25450 arguments that need handling.) */
25454 }
25456 /* Parse a template introduction header for a template-declaration. Returns
25457 false if tentative parse fails. */
25459 static bool
25461 {
25468 /* Look for the optional `::' operator. */
25471 /* Look for the nested-name-specifier. */
25481 /* Look up the concept for which we will be matching
25482 template parameters. */
25492 /* Look for opening brace for introduction. */
25500 /* Build vector of placeholder parameters and grab
25501 matching identifiers. */
25504 /* The introduction-list shall not be empty. */
25507 {
25510 }
25512 /* Look for closing brace for introduction. */
25517 {
25521 }
25523 /* Build and associate the constraint. */
25526 {
25528 member_p);
25530 }
25534 }
25536 /* Parse a normal template-declaration following the template keyword. */
25538 static void
25540 {
25541 tree parameter_list;
25545 /* Look for the `<' token. */
25549 {
25550 /* 14.5.2.2 [temp.mem]
25552 A local class shall not have member templates. */
25557 }
25558 /* [temp]
25560 A template ... shall not have C linkage. */
25562 {
25564 /* Give it C++ linkage to avoid confusing other parts of the
25565 front end. */
25568 }
25569 else
25572 /* We cannot perform access checks on the template parameter
25573 declarations until we know what is being declared, just as we
25574 cannot check the decl-specifier list. */
25577 /* If the next token is `>', then we have an invalid
25578 specialization. Rather than complain about an invalid template
25579 parameter, issue an error message here. */
25581 {
25585 }
25586 else
25587 {
25588 /* Parse the template parameters. */
25590 }
25592 /* Look for the `>'. */
25595 /* Manage template requirements */
25597 {
25602 }
25605 member_p);
25607 /* For the erroneous case of a template with C linkage, we pushed an
25608 implicit C++ linkage scope; exit that scope now. */
25611 }
25613 /* Parse a template-declaration, assuming that the `export' (and
25614 `extern') keywords, if present, has already been scanned. MEMBER_P
25615 is as for cp_parser_template_declaration. */
25617 static bool
25619 {
25621 {
25625 }
25630 }
25632 /* Perform the deferred access checks from a template-parameter-list.
25633 CHECKS is a TREE_LIST of access checks, as returned by
25634 get_deferred_access_checks. */
25636 static void
25637 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
25638 {
25642 }
25644 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25645 `function-definition' sequence that follows a template header.
25646 If MEMBER_P is true, this declaration appears in a class scope.
25648 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25649 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25651 static tree
25657 {
25660 cp_decl_specifier_seq decl_specifiers;
25664 /* This function is only used when processing a template
25665 declaration. */
25669 /* Defer access checks until we know what is being declared. */
25672 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25673 alternative. */
25676 CP_PARSER_FLAGS_OPTIONAL,
25682 /* There are no template typedefs. */
25684 {
25688 }
25690 /* Gather up the access checks that occurred the
25691 decl-specifier-seq. */
25694 /* Check for the declaration of a template class. */
25696 {
25699 {
25700 // If this is a declaration, but not a definition, associate
25701 // any constraints with the type declaration. Constraints
25702 // are associated with definitions in cp_parser_class_specifier.
25708 /* In this case:
25710 struct C {
25711 friend template <typename T> struct A<T>::B;
25712 };
25714 A<T>::B will be represented by a TYPENAME_TYPE, and
25715 therefore not recognized by shadow_tag. */
25717 && !decl
25724 else
25727 /* Perform access checks for template parameters. */
25730 /* Give a helpful diagnostic for
25731 template <class T> struct A { } a;
25732 if we aren't already recovering from an error. */
25735 {
25737 "a class template declaration must not declare "
25741 }
25742 }
25743 }
25745 /* Complain about missing 'typename' or other invalid type names. */
25748 {
25749 /* cp_parser_parse_and_diagnose_invalid_type_name calls
25750 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
25751 the rest of this declaration. */
25754 }
25756 /* If it's not a template class, try for a template function. If
25757 the next token is a `;', then this declaration does not declare
25758 anything. But, if there were errors in the decl-specifiers, then
25759 the error might well have come from an attempted class-specifier.
25760 In that case, there's no need to warn about a missing declarator. */
25764 {
25767 checks,
25769 member_p,
25770 declares_class_or_enum,
25774 /* 7.1.1-1 [dcl.stc]
25776 A storage-class-specifier shall not be specified in an explicit
25777 specialization... */
25779 && explicit_specialization_p
25781 {
25785 }
25789 }
25791 /* Look for a trailing `;' after the declaration. */
25797 out:
25800 /* Clear any current qualification; whatever comes next is the start
25801 of something new. */
25807 }
25809 /* Parse a cast-expression that is not the operand of a unary "&". */
25811 static cp_expr
25813 {
25816 }
25818 /* Parse a functional cast to TYPE. Returns an expression
25819 representing the cast. */
25821 static cp_expr
25823 {
25825 tree expression_list;
25826 cp_expr cast;
25835 {
25844 tf_warning_or_error);
25845 /* Create a location of the form:
25846 type_name{i, f}
25847 ^~~~~~~~~~~~~~~
25848 with caret == start at the start of the type name,
25849 finishing at the closing brace. */
25850 location_t finish_loc
25853 finish_loc);
25856 }
25865 else
25866 {
25869 }
25872 tf_warning_or_error);
25873 /* [expr.const]/1: In an integral constant expression "only type
25874 conversions to integral or enumeration type can be used". */
25880 NIC_CONSTRUCTOR))
25883 /* Create a location of the form:
25884 float(i)
25885 ^~~~~~~~
25886 with caret == start at the start of the type name,
25887 finishing at the closing paren. */
25888 location_t finish_loc
25893 }
25895 /* Save the tokens that make up the body of a member function defined
25896 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
25897 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
25898 specifiers applied to the declaration. Returns the FUNCTION_DECL
25899 for the member function. */
25901 static tree
25905 tree attributes)
25906 {
25909 tree fn;
25911 /* Create the FUNCTION_DECL. */
25915 /* If something went badly wrong, bail out now. */
25917 {
25918 /* If there's a function-body, skip it. */
25923 }
25925 /* Remember it, if there default args to post process. */
25928 /* Save away the tokens that make up the body of the
25929 function. */
25931 /* Handle function try blocks. */
25934 /* We can have braced-init-list mem-initializers before the fn body. */
25936 {
25939 {
25940 /* cache_group will stop after an un-nested { } pair, too. */
25944 /* variadic mem-inits have ... after the ')'. */
25947 }
25948 }
25950 /* Handle function try blocks. */
25955 /* Save away the inline definition; we will process it when the
25956 class is complete. */
25960 /* We need to know that this was defined in the class, so that
25961 friend templates are handled correctly. */
25964 /* Add FN to the queue of functions to be parsed later. */
25968 }
25970 /* Save the tokens that make up the in-class initializer for a non-static
25971 data member. Returns a DEFAULT_ARG. */
25973 static tree
25975 {
25977 }
25979 /* Parse a template-argument-list, as well as the trailing ">" (but
25980 not the opening "<"). See cp_parser_template_argument_list for the
25981 return value. */
25983 static tree
25985 {
25986 tree arguments;
25987 tree saved_scope;
25988 tree saved_qualifying_scope;
25989 tree saved_object_scope;
25994 /* [temp.names]
25996 When parsing a template-id, the first non-nested `>' is taken as
25997 the end of the template-argument-list rather than a greater-than
25998 operator. */
25999 saved_greater_than_is_operator_p
26002 /* Parsing the argument list may modify SCOPE, so we save it
26003 here. */
26007 /* We need to evaluate the template arguments, even though this
26008 template-id may be nested within a "sizeof". */
26013 /* Parse the template-argument-list itself. */
26017 else
26019 /* Look for the `>' that ends the template-argument-list. If we find
26020 a '>>' instead, it's probably just a typo. */
26022 {
26024 {
26025 /* In C++0x, a `>>' in a template argument list or cast
26026 expression is considered to be two separate `>'
26027 tokens. So, change the current token to a `>', but don't
26028 consume it: it will be consumed later when the outer
26029 template argument list (or cast expression) is parsed.
26030 Note that this replacement of `>' for `>>' is necessary
26031 even if we are parsing tentatively: in the tentative
26032 case, after calling
26033 cp_parser_enclosed_template_argument_list we will always
26034 throw away all of the template arguments and the first
26035 closing `>', either because the template argument list
26036 was erroneous or because we are replacing those tokens
26037 with a CPP_TEMPLATE_ID token. The second `>' (which will
26038 not have been thrown away) is needed either to close an
26039 outer template argument list or to complete a new-style
26040 cast. */
26043 }
26045 {
26046 /* If we're in a nested template argument list, the '>>' has
26047 to be a typo for '> >'. We emit the error message, but we
26048 continue parsing and we push a '>' as next token, so that
26049 the argument list will be parsed correctly. Note that the
26050 global source location is still on the token before the
26051 '>>', so we need to say explicitly where we want it. */
26057 }
26058 else
26059 {
26060 /* If this is not a nested template argument list, the '>>'
26061 is a typo for '>'. Emit an error message and continue.
26062 Same deal about the token location, but here we can get it
26063 right by consuming the '>>' before issuing the diagnostic. */
26066 "spurious %<>>%>, use %<>%> to terminate "
26068 }
26069 }
26070 else
26072 /* The `>' token might be a greater-than operator again now. */
26073 parser->greater_than_is_operator_p
26075 /* Restore the SAVED_SCOPE. */
26083 }
26085 /* MEMBER_FUNCTION is a member function, or a friend. If default
26086 arguments, or the body of the function have not yet been parsed,
26087 parse them now. */
26089 static void
26091 {
26093 /* If this member is a template, get the underlying
26094 FUNCTION_DECL. */
26098 /* There should not be any class definitions in progress at this
26099 point; the bodies of members are only parsed outside of all class
26100 definitions. */
26102 /* While we're parsing the member functions we might encounter more
26103 classes. We want to handle them right away, but we don't want
26104 them getting mixed up with functions that are currently in the
26105 queue. */
26108 /* Make sure that any template parameters are in scope. */
26111 /* If the body of the function has not yet been parsed, parse it
26112 now. */
26114 {
26115 tree function_scope;
26118 /* The function is no longer pending; we are processing it. */
26123 /* If this is a local class, enter the scope of the containing
26124 function. */
26129 /* Push the body of the function onto the lexer stack. */
26132 /* Let the front end know that we going to be defining this
26133 function. */
26137 /* Don't do access checking if it is a templated function. */
26141 /* #pragma omp declare reduction needs special parsing. */
26143 {
26148 }
26149 else
26150 /* Now, parse the body of the function. */
26157 /* Leave the scope of the containing function. */
26161 }
26163 /* Remove any template parameters from the symbol table. */
26166 /* Restore the queue. */
26169 }
26171 /* If DECL contains any default args, remember it on the unparsed
26172 functions queue. */
26174 static void
26176 {
26177 tree probe;
26180 probe;
26183 {
26187 }
26188 }
26190 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26191 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26192 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26193 from the parameter-type-list. */
26195 static tree
26198 {
26200 tree parsed_arg;
26206 /* Push the saved tokens for the default argument onto the parser's
26207 lexer stack. */
26213 /* Parse the default argument. */
26224 {
26225 /* In a non-template class, check conversions now. In a template,
26226 we'll wait and instantiate these as needed. */
26229 tf_warning_or_error);
26230 else
26232 }
26234 /* If the token stream has not been completely used up, then
26235 there was extra junk after the end of the default
26236 argument. */
26238 {
26241 else
26243 }
26245 /* Revert to the main lexer. */
26249 }
26251 /* FIELD is a non-static data member with an initializer which we saved for
26252 later; parse it now. */
26254 static void
26256 {
26257 tree def;
26264 NULL_TREE);
26270 }
26272 /* FN is a FUNCTION_DECL which may contains a parameter with an
26273 unparsed DEFAULT_ARG. Parse the default args now. This function
26274 assumes that the current scope is the scope in which the default
26275 argument should be processed. */
26277 static void
26279 {
26283 /* While we're parsing the default args, we might (due to the
26284 statement expression extension) encounter more classes. We want
26285 to handle them right away, but we don't want them getting mixed
26286 up with default args that are currently in the queue. */
26289 /* Local variable names (and the `this' keyword) may not appear
26290 in a default argument. */
26301 {
26303 tree parsed_arg;
26305 tree copy;
26312 /* This can happen for a friend declaration for a function
26313 already declared with default arguments. */
26316 parsed_arg
26318 default_arg,
26321 {
26323 }
26327 /* Update any instantiations we've already created. */
26331 }
26335 /* Make sure no default arg is missing. */
26338 /* Restore the state of local_variables_forbidden_p. */
26341 /* Restore the queue. */
26343 }
26345 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26347 sizeof ... ( identifier )
26349 where the 'sizeof' token has already been consumed. */
26351 static tree
26353 {
26354 /* Consume the `...'. */
26361 else
26369 /* The name is not qualified. */
26388 }
26390 /* Parse the operand of `sizeof' (or a similar operator). Returns
26391 either a TYPE or an expression, depending on the form of the
26392 input. The KEYWORD indicates which kind of expression we have
26393 encountered. */
26395 static tree
26397 {
26404 /* If it's a `...', then we are computing the length of a parameter
26405 pack. */
26410 /* Types cannot be defined in a `sizeof' expression. Save away the
26411 old message. */
26413 /* And create the new one. */
26419 /* The restrictions on constant-expressions do not apply inside
26420 sizeof expressions. */
26421 saved_integral_constant_expression_p
26423 saved_non_integral_constant_expression_p
26427 /* Do not actually evaluate the expression. */
26430 /* If it's a `(', then we might be looking at the type-id
26431 construction. */
26433 {
26436 /* We can't be sure yet whether we're looking at a type-id or an
26437 expression. */
26439 /* Note: as a GNU Extension, compound literals are considered
26440 postfix-expressions as they are in C99, so they are valid
26441 arguments to sizeof. See comment in cp_parser_cast_expression
26442 for details. */
26445 else
26446 {
26449 /* Look for the type-id. */
26451 /* Look for the closing `)'. */
26454 }
26456 /* If all went well, then we're done. */
26458 {
26459 cp_decl_specifier_seq decl_specs;
26461 /* Build a trivial decl-specifier-seq. */
26465 /* Call grokdeclarator to figure out what type this is. */
26468 TYPENAME,
26471 }
26472 }
26474 /* If the type-id production did not work out, then we must be
26475 looking at the unary-expression production. */
26479 /* Go back to evaluating expressions. */
26483 /* Free the message we created. */
26485 /* And restore the old one. */
26487 parser->integral_constant_expression_p
26489 parser->non_integral_constant_expression_p
26493 }
26495 /* If the current declaration has no declarator, return true. */
26497 static bool
26499 {
26500 /* If the next token is a `;' or a `,' then there is no
26501 declarator. */
26504 }
26506 /* Update the DECL_SPECS to reflect the storage class indicated by
26507 KEYWORD. */
26509 static void
26514 {
26515 cp_storage_class storage_class;
26518 {
26522 }
26524 {
26527 }
26532 {
26535 }
26538 {
26556 }
26560 /* A storage class specifier cannot be applied alongside a typedef
26561 specifier. If there is a typedef specifier present then set
26562 conflicting_specifiers_p which will trigger an error later
26563 on in grokdeclarator. */
26566 }
26568 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26569 is true, the type is a class or enum definition. */
26571 static void
26573 tree type_spec,
26576 {
26579 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26580 (with, for example, in "typedef int wchar_t;") we remember that
26581 this is what happened. In system headers, we ignore these
26582 declarations so that G++ can work with system headers that are not
26583 C++-safe. */
26585 && !type_definition_p
26595 {
26598 ds_redefined_builtin_type_spec,
26599 token);
26601 {
26605 }
26606 }
26609 else
26610 {
26615 }
26616 }
26618 /* True iff TOKEN is the GNU keyword __thread. */
26620 static bool
26622 {
26625 }
26627 /* Set the location for a declarator specifier and check if it is
26628 duplicated.
26630 DECL_SPECS is the sequence of declarator specifiers onto which to
26631 set the location.
26633 DS is the single declarator specifier to set which location is to
26634 be set onto the existing sequence of declarators.
26636 LOCATION is the location for the declarator specifier to
26637 consider. */
26639 static void
26642 {
26651 {
26655 }
26656 else
26657 {
26659 {
26663 else
26664 {
26667 OPT_Wlong_long,
26669 }
26670 }
26672 {
26677 else
26679 }
26680 else
26681 {
26697 "__complex"
26698 };
26701 }
26702 }
26703 }
26705 /* Return true iff the declarator specifier DS is present in the
26706 sequence of declarator specifiers DECL_SPECS. */
26708 bool
26710 cp_decl_spec ds)
26711 {
26718 }
26720 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
26721 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
26723 static bool
26725 {
26727 }
26729 /* Issue an error message indicating that TOKEN_DESC was expected.
26730 If KEYWORD is true, it indicated this function is called by
26731 cp_parser_require_keword and the required token can only be
26732 a indicated keyword. */
26734 static void
26736 required_token token_desc,
26738 {
26740 {
26809 }
26811 {
26813 {
26892 }
26893 }
26894 else
26896 }
26900 /* If the next token is of the indicated TYPE, consume it. Otherwise,
26901 issue an error message indicating that TOKEN_DESC was expected.
26903 Returns the token consumed, if the token had the appropriate type.
26904 Otherwise, returns NULL. */
26909 required_token token_desc)
26910 {
26913 else
26914 {
26915 /* Output the MESSAGE -- unless we're parsing tentatively. */
26919 }
26920 }
26922 /* An error message is produced if the next token is not '>'.
26923 All further tokens are skipped until the desired token is
26924 found or '{', '}', ';' or an unbalanced ')' or ']'. */
26926 static void
26928 {
26929 /* Current level of '< ... >'. */
26931 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
26934 /* Are we ready, yet? If not, issue error message. */
26938 /* Skip tokens until the desired token is found. */
26940 {
26941 /* Peek at the next token. */
26943 {
26951 /* C++0x views the `>>' operator as two `>' tokens, but
26952 C++98 does not. */
26955 {
26956 /* We've hit a `>>' where the first `>' closes the
26957 template argument list, and the second `>' is
26958 spurious. Just consume the `>>' and stop; we've
26959 already produced at least one error. */
26962 }
26963 /* Fall through for C++0x, so we handle the second `>' in
26964 the `>>'. */
26968 {
26969 /* We've reached the token we want, consume it and stop. */
26972 }
26991 /* The '>' was probably forgotten, don't look further. */
26996 }
26998 /* Consume this token. */
27000 }
27001 }
27003 /* If the next token is the indicated keyword, consume it. Otherwise,
27004 issue an error message indicating that TOKEN_DESC was expected.
27006 Returns the token consumed, if the token had the appropriate type.
27007 Otherwise, returns NULL. */
27012 required_token token_desc)
27013 {
27017 {
27020 }
27023 }
27025 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27026 function-definition. */
27028 static bool
27030 {
27033 /* A ctor-initializer begins with a `:'. */
27035 /* A function-try-block begins with `try'. */
27037 /* A function-transaction-block begins with `__transaction_atomic'
27038 or `__transaction_relaxed'. */
27041 /* The named return value extension begins with `return'. */
27043 }
27045 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27046 definition. */
27048 static bool
27050 {
27057 }
27059 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27060 C++0x) ending a template-argument. */
27062 static bool
27064 {
27072 }
27074 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27075 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27077 static bool
27080 {
27086 /* Check for the sequence `<::' in the original code. It would be lexed as
27087 `[:', where `[' is a digraph, and there is no whitespace before
27088 `:'. */
27090 {
27095 }
27097 }
27099 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27100 or none_type otherwise. */
27102 static enum tag_types
27104 {
27106 {
27116 }
27117 }
27119 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27120 or none_type otherwise or if the token is null. */
27122 static enum tag_types
27124 {
27129 {
27137 }
27138 }
27140 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27142 static void
27144 {
27148 {
27152 type))
27155 }
27156 }
27158 /* Issue an error message if DECL is redeclared with different
27159 access than its original declaration [class.access.spec/3].
27160 This applies to nested classes and nested class templates.
27161 [class.mem/1]. */
27163 static void
27165 {
27174 }
27176 /* Look for the `template' keyword, as a syntactic disambiguator.
27177 Return TRUE iff it is present, in which case it will be
27178 consumed. */
27180 static bool
27182 {
27184 {
27185 /* In C++98 the `template' keyword can only be used within templates;
27186 outside templates the parser can always figure out what is a
27187 template and what is not. In C++11, per the resolution of DR 468,
27188 `template' is allowed in cases where it is not strictly necessary. */
27191 {
27194 "in C++98 %<template%> (as a disambiguator) is only "
27196 /* If this part of the token stream is rescanned, the same
27197 error message would be generated. So, we purge the token
27198 from the stream. */
27201 }
27202 else
27203 {
27204 /* Consume the `template' keyword. */
27207 }
27208 }
27210 }
27212 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27213 set PARSER->SCOPE, and perform other related actions. */
27215 static void
27217 {
27220 /* Get the stored value. */
27222 /* Set the scope from the stored value. */
27226 }
27228 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27229 encounter the end of a block before what we were looking for. */
27231 static bool
27235 {
27237 {
27240 /* Abort a parenthesized expression if we encounter a semicolon. */
27244 /* If we've reached the end of the file, stop. */
27250 /* We've hit the end of an enclosing block, so there's been some
27251 kind of syntax error. */
27254 /* Consume the token. */
27256 /* See if it starts a new group. */
27258 {
27260 /* In theory this should probably check end == '}', but
27261 cp_parser_save_member_function_body needs it to exit
27262 after either '}' or ')' when called with ')'. */
27265 }
27267 {
27271 }
27276 }
27277 }
27279 /* Like above, for caching a default argument or NSDMI. Both of these are
27280 terminated by a non-nested comma, but it can be unclear whether or not a
27281 comma is nested in a template argument list unless we do more parsing.
27282 In order to handle this ambiguity, when we encounter a ',' after a '<'
27283 we try to parse what follows as a parameter-declaration-list (in the
27284 case of a default argument) or a member-declarator (in the case of an
27285 NSDMI). If that succeeds, then we stop caching. */
27287 static tree
27289 {
27294 tree default_argument;
27296 /* Add tokens until we have processed the entire default
27297 argument. We add the range [first_token, token). */
27300 {
27301 /* For list-initialization, this is straightforward. */
27304 }
27306 {
27309 /* Peek at the next token. */
27311 /* What we do depends on what token we have. */
27313 {
27314 /* In valid code, a default argument must be
27315 immediately followed by a `,' `)', or `...'. */
27318 {
27319 /* If we've seen a '<', we might be in a
27320 template-argument-list. Until Core issue 325 is
27321 resolved, we don't know how this situation ought
27322 to be handled, so try to DTRT. We check whether
27323 what comes after the comma is a valid parameter
27324 declaration list. If it is, then the comma ends
27325 the default argument; otherwise the default
27326 argument continues. */
27330 /* Set ITALP so cp_parser_parameter_declaration_list
27331 doesn't decide to commit to this parse. */
27338 {
27339 /* Parse declarators until we reach a non-comma or
27340 somthing that cannot be an initializer.
27341 Just checking whether we're looking at a single
27342 declarator is insufficient. Consider:
27343 int var = tuple<T,U>::x;
27344 The template parameter 'U' looks exactly like a
27345 declarator. */
27346 do
27347 {
27358 }
27360 /* If we met an '=' or ';' then the original comma
27361 was the end of the NSDMI. Otherwise assume
27362 we're still in the NSDMI. */
27365 }
27366 else
27367 {
27372 }
27379 }
27382 /* If we run into a non-nested `;', `}', or `]',
27383 then the code is invalid -- but the default
27384 argument is certainly over. */
27389 /* Handle correctly int n = sizeof ... ( p ); */
27392 /* Update DEPTH, if necessary. */
27407 /* This might be the comparison operator, or it might
27408 start a template argument list. */
27415 /* Fall through for C++0x, which treats the `>>'
27416 operator like two `>' tokens in certain
27417 cases. */
27421 {
27422 /* This might be an operator, or it might close a
27423 template argument list. But if a previous '<'
27424 started a template argument list, this will have
27425 closed it, so we can't be in one anymore. */
27429 }
27432 /* If we run out of tokens, issue an error message. */
27441 /* In these cases, we should look for template-ids.
27442 For example, if the default argument is
27443 `X<int, double>()', we need to do name lookup to
27444 figure out whether or not `X' is a template; if
27445 so, the `,' does not end the default argument.
27447 That is not yet done. */
27452 }
27454 /* If we've reached the end, stop. */
27458 /* Add the token to the token block. */
27460 }
27462 /* Create a DEFAULT_ARG to represent the unparsed default
27463 argument. */
27470 }
27472 /* Begin parsing tentatively. We always save tokens while parsing
27473 tentatively so that if the tentative parsing fails we can restore the
27474 tokens. */
27476 static void
27478 {
27479 /* Enter a new parsing context. */
27481 /* Begin saving tokens. */
27483 /* In order to avoid repetitive access control error messages,
27484 access checks are queued up until we are no longer parsing
27485 tentatively. */
27487 }
27489 /* Commit to the currently active tentative parse. */
27491 static void
27493 {
27497 /* Mark all of the levels as committed. */
27500 {
27507 }
27508 }
27510 /* Commit to the topmost currently active tentative parse.
27512 Note that this function shouldn't be called when there are
27513 irreversible side-effects while in a tentative state. For
27514 example, we shouldn't create a permanent entry in the symbol
27515 table, or issue an error message that might not apply if the
27516 tentative parse is aborted. */
27518 static void
27520 {
27525 {
27533 }
27534 }
27536 /* Abort the currently active tentative parse. All consumed tokens
27537 will be rolled back, and no diagnostics will be issued. */
27539 static void
27541 {
27545 /* Now, pretend that we want to see if the construct was
27546 successfully parsed. */
27548 }
27550 /* Stop parsing tentatively. If a parse error has occurred, restore the
27551 token stream. Otherwise, commit to the tokens we have consumed.
27552 Returns true if no error occurred; false otherwise. */
27554 static bool
27556 {
27560 /* Remember whether or not an error occurred, since we are about to
27561 destroy that information. */
27563 /* Remove the topmost context from the stack. */
27566 /* If no parse errors occurred, commit to the tentative parse. */
27568 {
27569 /* Commit to the tokens read tentatively, unless that was
27570 already done. */
27575 }
27576 /* Otherwise, if errors occurred, roll back our state so that things
27577 are just as they were before we began the tentative parse. */
27578 else
27579 {
27582 }
27583 /* Add the context to the front of the free list. */
27588 }
27590 /* Returns true if we are parsing tentatively and are not committed to
27591 this tentative parse. */
27593 static bool
27595 {
27598 }
27600 /* Returns nonzero iff an error has occurred during the most recent
27601 tentative parse. */
27603 static bool
27605 {
27608 }
27610 /* Returns nonzero if GNU extensions are allowed. */
27612 static bool
27614 {
27616 }
27617 \f
27618 /* Objective-C++ Productions */
27621 /* Parse an Objective-C expression, which feeds into a primary-expression
27622 above.
27624 objc-expression:
27625 objc-message-expression
27626 objc-string-literal
27627 objc-encode-expression
27628 objc-protocol-expression
27629 objc-selector-expression
27631 Returns a tree representation of the expression. */
27633 static cp_expr
27635 {
27636 /* Try to figure out what kind of declaration is present. */
27640 {
27650 {
27662 }
27668 }
27671 }
27673 /* Parse an Objective-C message expression.
27675 objc-message-expression:
27676 [ objc-message-receiver objc-message-args ]
27678 Returns a representation of an Objective-C message. */
27680 static tree
27682 {
27694 /* Construct a location e.g.
27695 [self func1:5]
27696 ^~~~~~~~~~~~~~
27697 ranging from the '[' to the ']', with the caret at the start. */
27702 }
27704 /* Parse an objc-message-receiver.
27706 objc-message-receiver:
27707 expression
27708 simple-type-specifier
27710 Returns a representation of the type or expression. */
27712 static tree
27714 {
27715 tree rcv;
27717 /* An Objective-C message receiver may be either (1) a type
27718 or (2) an expression. */
27722 /* If that worked out, fine. */
27729 CP_PARSER_FLAGS_NONE);
27736 }
27738 /* Parse the arguments and selectors comprising an Objective-C message.
27740 objc-message-args:
27741 objc-selector
27742 objc-selector-args
27743 objc-selector-args , objc-comma-args
27745 objc-selector-args:
27746 objc-selector [opt] : assignment-expression
27747 objc-selector-args objc-selector [opt] : assignment-expression
27749 objc-comma-args:
27750 assignment-expression
27751 objc-comma-args , assignment-expression
27753 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
27754 selector arguments and TREE_VALUE containing a list of comma
27755 arguments. */
27757 static tree
27759 {
27765 {
27771 /* Detect if we have a unary selector. */
27780 sel_args
27785 }
27787 /* Handle non-selector arguments, if any. */
27789 {
27790 tree arg;
27795 addl_args
27800 }
27803 {
27806 }
27809 }
27811 /* Parse an Objective-C encode expression.
27813 objc-encode-expression:
27814 @encode objc-typename
27816 Returns an encoded representation of the type argument. */
27818 static cp_expr
27820 {
27821 tree type;
27832 {
27836 }
27838 /* This happens if we find @encode(T) (where T is a template
27839 typename or something dependent on a template typename) when
27840 parsing a template. In that case, we can't compile it
27841 immediately, but we rather create an AT_ENCODE_EXPR which will
27842 need to be instantiated when the template is used.
27843 */
27845 {
27849 }
27852 /* Build a location of the form:
27853 @encode(int)
27854 ^~~~~~~~~~~~
27855 with caret==start at the @ token, finishing at the close paren. */
27856 location_t combined_loc
27861 }
27863 /* Parse an Objective-C @defs expression. */
27865 static tree
27867 {
27868 tree name;
27876 }
27878 /* Parse an Objective-C protocol expression.
27880 objc-protocol-expression:
27881 @protocol ( identifier )
27883 Returns a representation of the protocol expression. */
27885 static tree
27887 {
27888 tree proto;
27896 /* Build a location of the form:
27897 @protocol(prot)
27898 ^~~~~~~~~~~~~~~
27899 with caret==start at the @ token, finishing at the close paren. */
27900 location_t combined_loc
27906 }
27908 /* Parse an Objective-C selector expression.
27910 objc-selector-expression:
27911 @selector ( objc-method-signature )
27913 objc-method-signature:
27914 objc-selector
27915 objc-selector-seq
27917 objc-selector-seq:
27918 objc-selector :
27919 objc-selector-seq objc-selector :
27921 Returns a representation of the method selector. */
27923 static tree
27925 {
27937 {
27946 {
27947 /* Detect if we have a unary selector. */
27949 {
27952 }
27953 else
27954 {
27956 }
27957 }
27962 {
27963 sel_seq
27966 sel_seq
27969 }
27970 else
27971 sel_seq
27976 }
27978 finish_selector:
27982 /* Build a location of the form:
27983 @selector(func)
27984 ^~~~~~~~~~~~~~~
27985 with caret==start at the @ token, finishing at the close paren. */
27986 location_t combined_loc
27990 /* TODO: objc_build_selector_expr doesn't always honor the location. */
27993 }
27995 /* Parse a list of identifiers.
27997 objc-identifier-list:
27998 identifier
27999 objc-identifier-list , identifier
28001 Returns a TREE_LIST of identifier nodes. */
28003 static tree
28005 {
28006 tree identifier;
28007 tree list;
28018 {
28025 identifier));
28027 }
28030 }
28032 /* Parse an Objective-C alias declaration.
28034 objc-alias-declaration:
28035 @compatibility_alias identifier identifier ;
28037 This function registers the alias mapping with the Objective-C front end.
28038 It returns nothing. */
28040 static void
28042 {
28050 }
28052 /* Parse an Objective-C class forward-declaration.
28054 objc-class-declaration:
28055 @class objc-identifier-list ;
28057 The function registers the forward declarations with the Objective-C
28058 front end. It returns nothing. */
28060 static void
28062 {
28065 {
28066 tree id;
28076 else
28078 }
28080 }
28082 /* Parse a list of Objective-C protocol references.
28084 objc-protocol-refs-opt:
28085 objc-protocol-refs [opt]
28087 objc-protocol-refs:
28088 < objc-identifier-list >
28090 Returns a TREE_LIST of identifiers, if any. */
28092 static tree
28094 {
28098 {
28102 }
28105 }
28107 /* Parse a Objective-C visibility specification. */
28109 static void
28111 {
28115 {
28130 }
28132 /* Eat '@private'/'@protected'/'@public'. */
28134 }
28136 /* Parse an Objective-C method type. Return 'true' if it is a class
28137 (+) method, and 'false' if it is an instance (-) method. */
28141 {
28144 else
28146 }
28148 /* Parse an Objective-C protocol qualifier. */
28150 static tree
28152 {
28165 {
28170 }
28173 }
28175 /* Parse an Objective-C typename. */
28177 static tree
28179 {
28183 {
28189 /* An ObjC type name may consist of just protocol qualifiers, in which
28190 case the type shall default to 'id'. */
28192 {
28195 /* If the type could not be parsed, an error has already
28196 been produced. For error recovery, behave as if it had
28197 not been specified, which will use the default type
28198 'id'. */
28200 {
28202 /* We need to skip to the closing parenthesis as
28203 cp_parser_type_id() does not seem to do it for
28204 us. */
28209 }
28210 }
28214 }
28217 }
28219 /* Check to see if TYPE refers to an Objective-C selector name. */
28221 static bool
28223 {
28229 }
28231 /* Parse an Objective-C selector. */
28233 static tree
28235 {
28239 {
28242 }
28244 /* C++ operator names are allowed to appear in ObjC selectors. */
28246 {
28259 }
28260 }
28262 /* Parse an Objective-C params list. */
28264 static tree
28266 {
28272 {
28282 /* Detect if we have a unary selector. */
28285 {
28288 }
28292 {
28293 /* Something went quite wrong. There should be a colon
28294 here, but there is not. Stop parsing parameters. */
28296 }
28298 /* New ObjC allows attributes on parameters too. */
28303 params
28306 type_name,
28307 identifier,
28308 parm_attr));
28311 }
28314 {
28317 }
28319 /* We allow tail attributes for the method. */
28321 {
28329 }
28332 {
28335 }
28337 }
28339 /* Parse the non-keyword Objective-C params. */
28341 static tree
28344 {
28350 {
28352 tree parm;
28358 {
28363 }
28365 /* TODO: parse attributes for tail parameters. */
28374 }
28376 /* We allow tail attributes for the method. */
28378 {
28380 {
28385 }
28386 else
28387 /* We have an error, but parse the attributes, so that we can
28388 carry on. */
28394 }
28397 }
28399 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28401 static void
28403 {
28406 /* If the next token is `extern' and the following token is a string
28407 literal, then we have a linkage specification. */
28409 && cp_parser_is_pure_string_literal
28412 /* Handle #pragma, if any. */
28415 /* Allow stray semicolons. */
28418 /* Mark methods as optional or required, when building protocols. */
28420 {
28423 }
28425 {
28428 }
28431 /* Other stray characters must generate errors. */
28433 {
28437 }
28438 /* Finally, try to parse a block-declaration, or a function-definition. */
28439 else
28441 }
28443 /* Parse a method signature. */
28445 static tree
28447 {
28463 }
28465 static bool
28467 {
28468 tree tattr;
28473 /* If the attributes are followed by a method introducer, this is not allowed.
28474 Dump the attributes and flag the situation. */
28479 /* Otherwise, the attributes introduce some interstitial code, possibly so
28480 rewind to allow that check. */
28483 }
28485 /* Parse an Objective-C method prototype list. */
28487 static void
28489 {
28493 {
28495 {
28500 else
28504 {
28508 }
28511 }
28517 OPT_Wattributes,
28519 else
28520 /* Allow for interspersed non-ObjC++ code. */
28524 }
28528 else
28532 }
28534 /* Parse an Objective-C method definition list. */
28536 static void
28538 {
28542 {
28543 tree meth;
28546 {
28552 else
28557 {
28561 }
28563 NULL_TREE);
28565 /* For historical reasons, we accept an optional semicolon. */
28572 {
28579 }
28580 }
28581 /* The following case will be removed once @synthesize is
28582 completely implemented. */
28593 else
28594 /* Allow for interspersed non-ObjC++ code. */
28598 }
28602 else
28606 }
28608 /* Parse Objective-C ivars. */
28610 static void
28612 {
28623 {
28624 cp_decl_specifier_seq declspecs;
28626 tree prefix_attributes;
28634 CP_PARSER_FLAGS_OPTIONAL,
28638 /* auto, register, static, extern, mutable. */
28640 {
28643 }
28645 /* thread_local. */
28647 {
28650 }
28652 /* typedef. */
28654 {
28657 }
28662 /* Keep going until we hit the `;' at the end of the
28663 declaration. */
28665 {
28670 /* Check for a (possibly unnamed) bitfield declaration. */
28678 {
28679 /* Get the name of the bitfield. */
28682 sfk_none);
28684 eat_colon:
28686 /* Get the width of the bitfield. */
28687 width
28689 }
28690 else
28691 {
28692 /* Parse the declarator. */
28693 declarator
28699 }
28701 /* Look for attributes that apply to the ivar. */
28703 /* Remember which attributes are prefix attributes and
28704 which are not. */
28706 /* Combine the attributes. */
28710 /* Create the bitfield declaration. */
28712 width,
28713 attributes);
28714 else
28719 /* Add the instance variable. */
28723 /* Reset PREFIX_ATTRIBUTES. */
28732 {
28735 }
28737 }
28741 }
28746 /* Do not consume the RID_AT_END, so it will be read again as terminating
28747 the @interface of @implementation. */
28751 /* For historical reasons, we accept an optional semicolon. */
28754 }
28756 /* Parse an Objective-C protocol declaration. */
28758 static void
28760 {
28766 {
28771 }
28773 /* See if we have a forward declaration or a definition. */
28776 /* Try a forward declaration first. */
28778 {
28780 {
28781 tree id;
28791 else
28793 }
28795 }
28797 /* Ok, we got a full-fledged definition (or at least should). */
28798 else
28799 {
28804 }
28805 }
28807 /* Parse an Objective-C superclass or category. */
28809 static void
28814 {
28820 {
28823 }
28825 {
28828 /* If there is no category name, and this is an @interface, we
28829 have a class extension. */
28831 {
28834 }
28835 else
28839 }
28840 }
28842 /* Parse an Objective-C class interface. */
28844 static void
28846 {
28853 {
28854 /* It's hard to recover because even if valid @interface stuff
28855 is to follow, we can't compile it (or validate it) if we
28856 don't even know which class it refers to. Let's assume this
28857 was a stray '@interface' token in the stream and skip it.
28858 */
28860 }
28865 /* We have either a class or a category on our hands. */
28868 else
28869 {
28871 /* Handle instance variable declarations, if any. */
28874 }
28877 }
28879 /* Parse an Objective-C class implementation. */
28881 static void
28883 {
28890 {
28891 /* It's hard to recover because even if valid @implementation
28892 stuff is to follow, we can't compile it (or validate it) if
28893 we don't even know which class it refers to. Let's assume
28894 this was a stray '@implementation' token in the stream and
28895 skip it.
28896 */
28898 }
28902 /* We have either a class or a category on our hands. */
28905 else
28906 {
28908 /* Handle instance variable declarations, if any. */
28911 }
28914 }
28916 /* Consume the @end token and finish off the implementation. */
28918 static void
28920 {
28923 }
28925 /* Parse an Objective-C declaration. */
28927 static void
28929 {
28930 /* Try to figure out what kind of declaration is present. */
28935 {
28951 }
28954 {
28977 }
28978 }
28980 /* Parse an Objective-C try-catch-finally statement.
28982 objc-try-catch-finally-stmt:
28983 @try compound-statement objc-catch-clause-seq [opt]
28984 objc-finally-clause [opt]
28986 objc-catch-clause-seq:
28987 objc-catch-clause objc-catch-clause-seq [opt]
28989 objc-catch-clause:
28990 @catch ( objc-exception-declaration ) compound-statement
28992 objc-finally-clause:
28993 @finally compound-statement
28995 objc-exception-declaration:
28996 parameter-declaration
28997 '...'
28999 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29001 Returns NULL_TREE.
29003 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29004 for C. Keep them in sync. */
29006 static tree
29008 {
29009 location_t location;
29010 tree stmt;
29015 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29016 node, lest it get absorbed into the surrounding block. */
29022 {
29031 {
29032 /* We have "@catch (...)" (where the '...' are literally
29033 what is in the code). Skip the '...'.
29034 parameter_declaration is set to NULL_TREE, and
29035 objc_being_catch_clauses() knows that that means
29036 '...'. */
29039 }
29040 else
29041 {
29042 /* We have "@catch (NSException *exception)" or something
29043 like that. Parse the parameter declaration. */
29047 else
29052 }
29055 else
29056 {
29057 /* If there was no open parenthesis, we are recovering from
29058 an error, and we are trying to figure out what mistake
29059 the user has made. */
29061 /* If there is an immediate closing parenthesis, the user
29062 probably forgot the opening one (ie, they typed "@catch
29063 NSException *e)". Parse the closing parenthesis and keep
29064 going. */
29068 /* If these is no immediate closing parenthesis, the user
29069 probably doesn't know that parenthesis are required at
29070 all (ie, they typed "@catch NSException *e"). So, just
29071 forget about the closing parenthesis and keep going. */
29072 }
29076 }
29078 {
29081 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29082 node, lest it get absorbed into the surrounding block. */
29086 }
29089 }
29091 /* Parse an Objective-C synchronized statement.
29093 objc-synchronized-stmt:
29094 @synchronized ( expression ) compound-statement
29096 Returns NULL_TREE. */
29098 static tree
29100 {
29101 location_t location;
29112 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29113 node, lest it get absorbed into the surrounding block. */
29118 }
29120 /* Parse an Objective-C throw statement.
29122 objc-throw-stmt:
29123 @throw assignment-expression [opt] ;
29125 Returns a constructed '@throw' statement. */
29127 static tree
29129 {
29141 }
29143 /* Parse an Objective-C statement. */
29145 static tree
29147 {
29148 /* Try to figure out what kind of declaration is present. */
29152 {
29163 }
29166 }
29168 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29169 look ahead to see if an objc keyword follows the attributes. This
29170 is to detect the use of prefix attributes on ObjC @interface and
29171 @protocol. */
29173 static bool
29175 {
29180 {
29183 }
29186 }
29188 /* This routine is a minimal replacement for
29189 c_parser_struct_declaration () used when parsing the list of
29190 types/names or ObjC++ properties. For example, when parsing the
29191 code
29193 @property (readonly) int a, b, c;
29195 this function is responsible for parsing "int a, int b, int c" and
29196 returning the declarations as CHAIN of DECLs.
29198 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29199 similar parsing. */
29200 static tree
29202 {
29204 cp_decl_specifier_seq declspecs;
29206 tree prefix_attributes;
29209 CP_PARSER_FLAGS_NONE,
29216 /* auto, register, static, extern, mutable. */
29218 {
29221 }
29223 /* thread_local. */
29225 {
29228 }
29230 /* typedef. */
29232 {
29235 }
29240 /* Keep going until we hit the `;' at the end of the declaration. */
29242 {
29247 /* Parse the declarator. */
29251 /* Look for attributes that apply to the ivar. */
29253 /* Remember which attributes are prefix attributes and
29254 which are not. */
29256 /* Combine the attributes. */
29266 /* Reset PREFIX_ATTRIBUTES. */
29277 {
29280 }
29281 else
29283 }
29285 }
29287 /* Parse an Objective-C @property declaration. The syntax is:
29289 objc-property-declaration:
29290 '@property' objc-property-attributes[opt] struct-declaration ;
29292 objc-property-attributes:
29293 '(' objc-property-attribute-list ')'
29295 objc-property-attribute-list:
29296 objc-property-attribute
29297 objc-property-attribute-list, objc-property-attribute
29299 objc-property-attribute
29300 'getter' = identifier
29301 'setter' = identifier
29302 'readonly'
29303 'readwrite'
29304 'assign'
29305 'retain'
29306 'copy'
29307 'nonatomic'
29309 For example:
29310 @property NSString *name;
29311 @property (readonly) id object;
29312 @property (retain, nonatomic, getter=getTheName) id name;
29313 @property int a, b, c;
29315 PS: This function is identical to
29316 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29317 static void
29319 {
29320 /* The following variables hold the attributes of the properties as
29321 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29322 seen. When we see an attribute, we set them to 'true' (if they
29323 are boolean properties) or to the identifier (if they have an
29324 argument, ie, for getter and setter). Note that here we only
29325 parse the list of attributes, check the syntax and accumulate the
29326 attributes that we find. objc_add_property_declaration() will
29327 then process the information. */
29337 /* 'properties' is the list of properties that we read. Usually a
29338 single one, but maybe more (eg, in "@property int a, b, c;" there
29339 are three). */
29340 tree properties;
29341 location_t loc;
29347 /* Parse the optional attribute list... */
29349 {
29350 /* Eat the '('. */
29354 {
29360 {
29363 }
29367 {
29378 {
29382 else
29387 }
29390 {
29394 }
29396 {
29398 {
29401 }
29402 else
29406 else
29408 }
29409 else
29410 {
29412 {
29415 }
29416 else
29418 }
29424 }
29431 else
29433 }
29435 /* FIXME: "@property (setter, assign);" will generate a spurious
29436 "error: expected ‘)’ before ‘,’ token". This is because
29437 cp_parser_require, unlike the C counterpart, will produce an
29438 error even if we are in error recovery. */
29440 {
29445 }
29446 }
29448 /* ... and the property declaration(s). */
29452 {
29454 /* If the next token is now a `;', consume it. */
29458 }
29462 else
29463 {
29464 /* Comma-separated properties are chained together in
29465 reverse order; add them one by one. */
29474 }
29477 }
29479 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29481 objc-synthesize-declaration:
29482 @synthesize objc-synthesize-identifier-list ;
29484 objc-synthesize-identifier-list:
29485 objc-synthesize-identifier
29486 objc-synthesize-identifier-list, objc-synthesize-identifier
29488 objc-synthesize-identifier
29489 identifier
29490 identifier = identifier
29492 For example:
29493 @synthesize MyProperty;
29494 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29496 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29497 for C. Keep them in sync.
29498 */
29499 static void
29501 {
29503 location_t loc;
29508 {
29512 {
29515 }
29517 {
29521 {
29524 }
29525 }
29526 else
29531 else
29533 }
29536 }
29538 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29540 objc-dynamic-declaration:
29541 @dynamic identifier-list ;
29543 For example:
29544 @dynamic MyProperty;
29545 @dynamic MyProperty, AnotherProperty;
29547 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29548 for C. Keep them in sync.
29549 */
29550 static void
29552 {
29554 location_t loc;
29559 {
29560 tree property;
29563 {
29566 }
29570 else
29572 }
29575 }
29577 \f
29578 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29580 /* Returns name of the next clause.
29581 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29582 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29583 returned and the token is consumed. */
29585 static pragma_omp_clause
29587 {
29603 {
29608 {
29791 }
29792 }
29798 }
29800 /* Validate that a clause of the given type does not already exist. */
29802 static void
29805 {
29806 tree c;
29810 {
29813 }
29814 }
29816 /* OpenMP 2.5:
29817 variable-list:
29818 identifier
29819 variable-list , identifier
29821 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
29822 colon). An opening parenthesis will have been consumed by the caller.
29824 If KIND is nonzero, create the appropriate node and install the decl
29825 in OMP_CLAUSE_DECL and add the node to the head of the list.
29827 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
29828 return the list created.
29830 COLON can be NULL if only closing parenthesis should end the list,
29831 or pointer to bool which will receive false if the list is terminated
29832 by closing parenthesis or true if the list is terminated by colon. */
29834 static tree
29837 {
29841 {
29844 }
29846 {
29851 && current_class_ptr
29853 {
29859 }
29860 else
29861 {
29874 }
29876 ;
29878 {
29880 {
29883 {
29887 }
29888 /* FALLTHROUGH. */
29893 {
29894 location_t loc
29898 decl
29902 }
29903 /* FALLTHROUGH. */
29907 {
29915 parser->colon_corrects_to_scope_p
29919 else
29920 {
29921 /* Look for `:'. */
29925 CPP_CLOSE_SQUARE))
29927 }
29928 /* Look for the closing `]'. */
29930 RT_CLOSE_SQUARE))
29934 {
29937 {
29941 }
29945 {
29949 }
29950 }
29953 }
29957 }
29963 }
29964 else
29967 get_comma:
29971 }
29977 {
29981 }
29984 {
29987 /* Try to resync to an unnested comma. Copied from
29988 cp_parser_parenthesized_expression_list. */
29989 skip_comma:
29998 }
30001 }
30003 /* Similarly, but expect leading and trailing parenthesis. This is a very
30004 common case for omp clauses. */
30006 static tree
30008 {
30012 }
30014 /* OpenACC 2.0:
30015 copy ( variable-list )
30016 copyin ( variable-list )
30017 copyout ( variable-list )
30018 create ( variable-list )
30019 delete ( variable-list )
30020 present ( variable-list )
30021 present_or_copy ( variable-list )
30022 pcopy ( variable-list )
30023 present_or_copyin ( variable-list )
30024 pcopyin ( variable-list )
30025 present_or_copyout ( variable-list )
30026 pcopyout ( variable-list )
30027 present_or_create ( variable-list )
30028 pcreate ( variable-list ) */
30030 static tree
30032 tree list)
30033 {
30036 {
30082 }
30090 }
30092 /* OpenACC 2.0:
30093 deviceptr ( variable-list ) */
30095 static tree
30097 {
30101 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30102 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30103 variable-list must only allow for pointer variables. */
30106 {
30109 /* FIXME diagnostics: Ideally we should keep individual
30110 locations for all the variables in the var list to make the
30111 following errors more precise. Perhaps
30112 c_parser_omp_var_list_parens should construct a list of
30113 locations to go along with the var list. */
30118 ;
30127 }
30130 }
30132 /* OpenACC 2.0:
30133 auto
30134 independent
30135 nohost
30136 seq */
30138 static tree
30142 {
30147 }
30149 /* OpenACC:
30150 num_gangs ( expression )
30151 num_workers ( expression )
30152 vector_length ( expression ) */
30154 static tree
30157 {
30167 {
30172 }
30180 }
30182 /* OpenACC:
30184 gang [( gang-arg-list )]
30185 worker [( [num:] int-expr )]
30186 vector [( [length:] int-expr )]
30188 where gang-arg is one of:
30190 [num:] int-expr
30191 static: size-expr
30193 and size-expr may be:
30195 *
30196 int-expr
30197 */
30199 static tree
30202 {
30212 {
30215 do
30216 {
30220 /* Gang static argument. */
30223 {
30231 {
30234 }
30236 /* Check for the '*' argument. */
30240 CPP_CLOSE_PAREN)))
30241 {
30246 {
30249 }
30251 }
30252 }
30253 /* Worker num: argument and vector length: arguments. */
30257 {
30260 }
30262 /* Now collect the actual argument. */
30264 {
30267 }
30279 {
30282 }
30284 }
30289 }
30303 cleanup_error:
30306 }
30308 /* OpenACC 2.0:
30309 tile ( size-expr-list ) */
30311 static tree
30313 {
30322 do
30323 {
30327 {
30330 }
30331 else
30341 }
30344 /* Consume the trailing ')'. */
30352 }
30354 /* OpenACC 2.0
30355 Parse wait clause or directive parameters. */
30357 static tree
30359 {
30369 {
30374 }
30381 {
30385 {
30388 else
30389 {
30396 }
30397 }
30398 }
30401 }
30403 /* OpenACC:
30404 wait ( int-expr-list ) */
30406 static tree
30408 {
30417 }
30419 /* OpenMP 3.0:
30420 collapse ( constant-expression ) */
30422 static tree
30424 {
30426 location_t loc;
30427 HOST_WIDE_INT n;
30447 {
30450 }
30458 }
30460 /* OpenMP 2.5:
30461 default ( shared | none )
30463 OpenACC 2.0
30464 default (none) */
30466 static tree
30469 {
30471 tree c;
30476 {
30481 {
30496 }
30499 }
30500 else
30501 {
30502 invalid_kind:
30505 else
30507 }
30523 }
30525 /* OpenMP 3.1:
30526 final ( expression ) */
30528 static tree
30530 {
30551 }
30553 /* OpenMP 2.5:
30554 if ( expression )
30556 OpenMP 4.5:
30557 if ( directive-name-modifier : expression )
30559 directive-name-modifier:
30560 parallel | task | taskloop | target data | target | target update
30561 | target enter data | target exit data */
30563 static tree
30566 {
30574 {
30586 {
30589 {
30602 else
30603 {
30604 location_t loc
30609 }
30612 {
30614 {
30619 }
30621 {
30622 location_t loc
30626 }
30627 }
30628 }
30629 }
30631 {
30633 {
30636 }
30637 else
30638 {
30640 {
30641 location_t loc
30644 }
30646 }
30647 }
30648 }
30660 {
30663 {
30666 {
30676 }
30678 p);
30680 }
30682 {
30685 else
30688 }
30691 {
30695 }
30696 }
30704 }
30706 /* OpenMP 3.1:
30707 mergeable */
30709 static tree
30712 {
30713 tree c;
30716 location);
30721 }
30723 /* OpenMP 2.5:
30724 nowait */
30726 static tree
30729 {
30730 tree c;
30737 }
30739 /* OpenMP 2.5:
30740 num_threads ( expression ) */
30742 static tree
30744 location_t location)
30745 {
30767 }
30769 /* OpenMP 4.5:
30770 num_tasks ( expression ) */
30772 static tree
30774 location_t location)
30775 {
30797 }
30799 /* OpenMP 4.5:
30800 grainsize ( expression ) */
30802 static tree
30804 location_t location)
30805 {
30827 }
30829 /* OpenMP 4.5:
30830 priority ( expression ) */
30832 static tree
30834 location_t location)
30835 {
30857 }
30859 /* OpenMP 4.5:
30860 hint ( expression ) */
30862 static tree
30864 location_t location)
30865 {
30886 }
30888 /* OpenMP 4.5:
30889 defaultmap ( tofrom : scalar ) */
30891 static tree
30893 location_t location)
30894 {
30902 {
30905 }
30909 {
30912 }
30918 {
30921 }
30925 {
30928 }
30934 location);
30940 out_err:
30945 }
30947 /* OpenMP 2.5:
30948 ordered
30950 OpenMP 4.5:
30951 ordered ( constant-expression ) */
30953 static tree
30956 {
30958 HOST_WIDE_INT n;
30964 {
30981 {
30983 "ordered argument needs positive constant integer "
30986 }
30987 }
30993 }
30995 /* OpenMP 2.5:
30996 reduction ( reduction-operator : variable-list )
30998 reduction-operator:
30999 One of: + * - & ^ | && ||
31001 OpenMP 3.1:
31003 reduction-operator:
31004 One of: + * - & ^ | && || min max
31006 OpenMP 4.0:
31008 reduction-operator:
31009 One of: + * - & ^ | && ||
31010 id-expression */
31012 static tree
31014 {
31022 {
31032 }
31036 else
31037 {
31048 {
31078 }
31079 else
31080 {
31082 resync_fail:
31087 }
31088 }
31094 NULL);
31096 {
31099 }
31102 }
31104 /* OpenMP 2.5:
31105 schedule ( schedule-kind )
31106 schedule ( schedule-kind , expression )
31108 schedule-kind:
31109 static | dynamic | guided | runtime | auto
31111 OpenMP 4.5:
31112 schedule ( schedule-modifier : schedule-kind )
31113 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31115 schedule-modifier:
31116 simd
31117 monotonic
31118 nonmonotonic */
31120 static tree
31122 {
31132 {
31141 else
31147 else
31148 {
31151 }
31152 }
31155 {
31160 {
31181 }
31182 }
31187 else
31193 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31195 {
31199 }
31202 {
31217 else
31222 }
31234 invalid_kind:
31236 resync_fail:
31241 }
31243 /* OpenMP 3.0:
31244 untied */
31246 static tree
31249 {
31250 tree c;
31257 }
31259 /* OpenMP 4.0:
31260 inbranch
31261 notinbranch */
31263 static tree
31266 {
31271 }
31273 /* OpenMP 4.0:
31274 parallel
31275 for
31276 sections
31277 taskgroup */
31279 static tree
31283 {
31287 }
31289 /* OpenMP 4.5:
31290 nogroup */
31292 static tree
31295 {
31300 }
31302 /* OpenMP 4.5:
31303 simd
31304 threads */
31306 static tree
31310 {
31315 }
31317 /* OpenMP 4.0:
31318 num_teams ( expression ) */
31320 static tree
31322 location_t location)
31323 {
31345 }
31347 /* OpenMP 4.0:
31348 thread_limit ( expression ) */
31350 static tree
31352 location_t location)
31353 {
31375 }
31377 /* OpenMP 4.0:
31378 aligned ( variable-list )
31379 aligned ( variable-list : constant-expression ) */
31381 static tree
31383 {
31394 {
31404 }
31410 }
31412 /* OpenMP 4.0:
31413 linear ( variable-list )
31414 linear ( variable-list : expression )
31416 OpenMP 4.5:
31417 linear ( modifier ( variable-list ) )
31418 linear ( modifier ( variable-list ) : expression ) */
31420 static tree
31423 {
31433 {
31445 else
31447 }
31452 else
31453 {
31462 }
31465 {
31470 {
31481 {
31484 }
31487 }
31492 {
31495 }
31503 }
31506 {
31509 }
31512 }
31514 /* OpenMP 4.0:
31515 safelen ( constant-expression ) */
31517 static tree
31519 location_t location)
31520 {
31541 }
31543 /* OpenMP 4.0:
31544 simdlen ( constant-expression ) */
31546 static tree
31548 location_t location)
31549 {
31570 }
31572 /* OpenMP 4.5:
31573 vec:
31574 identifier [+/- integer]
31575 vec , identifier [+/- integer]
31576 */
31578 static tree
31580 tree list)
31581 {
31585 {
31588 }
31591 {
31598 else
31599 {
31600 t = cp_parser_lookup_name_simple
31605 id_loc);
31606 }
31612 {
31615 }
31619 {
31622 }
31626 {
31629 }
31632 add_to_vector:
31634 {
31638 }
31644 }
31647 {
31653 }
31655 }
31657 /* OpenMP 4.0:
31658 depend ( depend-kind : variable-list )
31660 depend-kind:
31661 in | out | inout
31663 OpenMP 4.5:
31664 depend ( source )
31666 depend ( sink : vec ) */
31668 static tree
31670 {
31678 {
31692 else
31694 }
31695 else
31701 {
31711 }
31718 else
31719 {
31725 }
31728 invalid_kind:
31730 resync_fail:
31735 }
31737 /* OpenMP 4.0:
31738 map ( map-kind : variable-list )
31739 map ( variable-list )
31741 map-kind:
31742 alloc | to | from | tofrom
31744 OpenMP 4.5:
31745 map-kind:
31746 alloc | to | from | tofrom | release | delete
31748 map ( always [,] map-kind: variable-list ) */
31750 static tree
31752 {
31761 {
31766 {
31769 nth++;
31775 {
31780 }
31781 }
31782 }
31786 {
31800 else
31801 {
31807 }
31810 }
31813 {
31817 }
31820 NULL);
31826 }
31828 /* OpenMP 4.0:
31829 device ( expression ) */
31831 static tree
31833 location_t location)
31834 {
31856 }
31858 /* OpenMP 4.0:
31859 dist_schedule ( static )
31860 dist_schedule ( static , expression ) */
31862 static tree
31864 location_t location)
31865 {
31878 {
31889 }
31894 location);
31898 invalid_kind:
31900 resync_fail:
31905 }
31907 /* OpenMP 4.0:
31908 proc_bind ( proc-bind-kind )
31910 proc-bind-kind:
31911 master | close | spread */
31913 static tree
31915 location_t location)
31916 {
31917 tree c;
31924 {
31934 else
31936 }
31937 else
31946 location);
31951 invalid_kind:
31953 resync_fail:
31958 }
31960 /* OpenACC:
31961 async [( int-expr )] */
31963 static tree
31965 {
31972 {
31981 }
31991 }
31993 /* Parse all OpenACC clauses. The set clauses allowed by the directive
31994 is a bitmask in MASK. Return the list of clauses found. */
31996 static tree
32000 {
32005 {
32006 location_t here;
32007 pragma_omp_clause c_kind;
32008 omp_clause_code code;
32019 {
32071 clauses);
32089 OMP_CLAUSE_INDEPENDENT,
32101 clauses);
32107 clauses);
32131 clauses);
32153 clauses);
32165 clauses);
32179 }
32184 {
32185 /* Remove the invalid clause(s) from the list to avoid
32186 confusing the rest of the compiler. */
32189 }
32190 }
32192 saw_error:
32199 }
32201 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32202 is a bitmask in MASK. Return the list of clauses found; the result
32203 of clause default goes in *pdefault. */
32205 static tree
32209 {
32215 {
32216 pragma_omp_clause c_kind;
32227 {
32239 clauses);
32253 clauses);
32273 clauses);
32278 clauses);
32288 clauses);
32322 clauses);
32336 clauses);
32353 OMP_CLAUSE_NOTINBRANCH,
32362 {
32363 clause_not_first:
32367 }
32397 clauses);
32398 else
32408 clauses);
32426 {
32434 }
32477 clauses
32483 clauses
32495 }
32500 {
32501 /* Remove the invalid clause(s) from the list to avoid
32502 confusing the rest of the compiler. */
32505 }
32506 }
32507 saw_error:
32508 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32509 no reason to skip to the end. */
32513 {
32516 else
32518 }
32520 }
32522 /* OpenMP 2.5:
32523 structured-block:
32524 statement
32526 In practice, we're also interested in adding the statement to an
32527 outer node. So it is convenient if we work around the fact that
32528 cp_parser_statement calls add_stmt. */
32530 static unsigned
32532 {
32535 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32536 This preserves the "not within loop or switch" style error messages
32537 for nonsense cases like
32538 void foo() {
32539 #pragma omp single
32540 break;
32541 }
32542 */
32547 }
32549 static void
32551 {
32553 }
32555 static tree
32557 {
32565 }
32567 /* OpenMP 2.5:
32568 # pragma omp atomic new-line
32569 expression-stmt
32571 expression-stmt:
32572 x binop= expr | x++ | ++x | x-- | --x
32573 binop:
32574 +, *, -, /, &, ^, |, <<, >>
32576 where x is an lvalue expression with scalar type.
32578 OpenMP 3.1:
32579 # pragma omp atomic new-line
32580 update-stmt
32582 # pragma omp atomic read new-line
32583 read-stmt
32585 # pragma omp atomic write new-line
32586 write-stmt
32588 # pragma omp atomic update new-line
32589 update-stmt
32591 # pragma omp atomic capture new-line
32592 capture-stmt
32594 # pragma omp atomic capture new-line
32595 capture-block
32597 read-stmt:
32598 v = x
32599 write-stmt:
32600 x = expr
32601 update-stmt:
32602 expression-stmt | x = x binop expr
32603 capture-stmt:
32604 v = expression-stmt
32605 capture-block:
32606 { v = x; update-stmt; } | { update-stmt; v = x; }
32608 OpenMP 4.0:
32609 update-stmt:
32610 expression-stmt | x = x binop expr | x = expr binop x
32611 capture-stmt:
32612 v = update-stmt
32613 capture-block:
32614 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32616 where x and v are lvalue expressions with scalar type. */
32618 static void
32620 {
32628 {
32633 {
32639 }
32640 }
32642 {
32654 else
32658 }
32660 {
32666 {
32671 {
32674 }
32675 }
32676 }
32680 {
32690 else
32695 {
32696 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32697 opcode. */
32702 }
32706 {
32709 }
32710 else
32711 {
32717 }
32720 }
32722 restart:
32726 {
32733 /* FALLTHROUGH */
32743 /* FALLTHROUGH */
32758 /* Undo effects of boolean_increment for post {in,de}crement. */
32760 /* FALLTHRU */
32764 {
32765 /* Undo effects of boolean_increment. */
32767 {
32768 /* This is pre or post increment. */
32773 && !structured_block
32777 }
32778 }
32779 /* FALLTHRU */
32782 {
32817 {
32821 }
32824 {
32830 {
32835 }
32837 {
32849 {
32851 {
32856 }
32857 else
32859 }
32863 }
32866 {
32873 }
32877 }
32881 {
32884 {
32892 }
32894 {
32899 }
32934 }
32945 /* FALLTHROUGH */
32950 }
32957 }
32958 stmt_done:
32960 {
32971 }
32973 {
32976 }
32977 done:
32983 saw_error:
32986 {
32990 {
32994 }
32995 }
32996 }
32999 /* OpenMP 2.5:
33000 # pragma omp barrier new-line */
33002 static void
33004 {
33007 }
33009 /* OpenMP 2.5:
33010 # pragma omp critical [(name)] new-line
33011 structured-block
33013 OpenMP 4.5:
33014 # pragma omp critical [(name) [hint(expression)]] new-line
33015 structured-block */
33017 #define OMP_CRITICAL_CLAUSE_MASK \
33018 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33020 static tree
33022 {
33026 {
33040 OMP_CRITICAL_CLAUSE_MASK,
33042 }
33043 else
33048 }
33050 /* OpenMP 2.5:
33051 # pragma omp flush flush-vars[opt] new-line
33053 flush-vars:
33054 ( variable-list ) */
33056 static void
33058 {
33064 }
33066 /* Helper function, to parse omp for increment expression. */
33068 static tree
33070 {
33075 {
33078 }
33081 {
33090 /* Fall through: OpenMP disallows NE_EXPR. */
33093 }
33095 /* If decl is an iterator, preserve LHS and RHS of the relational
33096 expr until finish_omp_for. */
33107 }
33109 /* Helper function, to parse omp for increment expression. */
33111 static tree
33113 {
33117 cp_id_kind idk;
33121 {
33130 }
33139 {
33144 }
33151 {
33155 }
33168 do
33169 {
33176 {
33178 {
33181 else
33183 tf_warning_or_error);
33184 }
33185 else
33188 }
33189 }
33193 {
33199 }
33200 else
33204 }
33206 /* Parse the initialization statement of either an OpenMP for loop or
33207 a Cilk Plus for loop.
33209 Return true if the resulting construct should have an
33210 OMP_CLAUSE_PRIVATE added to it. */
33212 static tree
33221 {
33227 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33229 init-expr:
33230 var = lb
33231 integer-type var = lb
33232 random-access-iterator-type var = lb
33233 pointer-type var = lb
33234 */
33235 cp_decl_specifier_seq type_specifiers;
33237 /* First, try to parse as an initialized declaration. See
33238 cp_parser_condition, from whence the bulk of this is copied. */
33245 {
33246 /* If parsing a type specifier seq succeeded, then this
33247 MUST be a initialized declaration. */
33252 CP_PARSER_DECLARATOR_NAMED,
33263 else
33264 {
33274 {
33276 CPP_OPEN_PAREN))
33277 {
33281 else
33284 }
33285 else
33286 /* Trigger an error. */
33291 }
33295 {
33303 {
33306 auto_node);
33311 }
33314 asm_specification,
33315 LOOKUP_ONLYCONVERTING);
33318 {
33321 }
33322 else
33325 }
33326 else
33327 {
33328 /* Consume '='. */
33332 non_class:
33335 else
33338 asm_specification,
33339 LOOKUP_ONLYCONVERTING);
33340 }
33344 }
33345 }
33346 else
33347 {
33348 cp_id_kind idk;
33349 /* If parsing a type specifier sequence failed, then
33350 this MUST be a simple expression. */
33359 && decl
33362 {
33373 {
33378 }
33383 }
33385 && decl
33388 {
33389 tree rhs;
33397 rhs,
33398 tf_warning_or_error));
33401 }
33402 else
33403 {
33408 {
33412 }
33413 }
33414 }
33416 }
33418 /* Parse the restricted form of the for statement allowed by OpenMP. */
33420 static tree
33423 {
33427 location_t loc_first;
33438 {
33441 }
33444 {
33450 }
33452 {
33455 {
33457 "%<linear%> clause may not be specified together "
33460 }
33461 else
33463 }
33476 {
33479 location_t loc;
33483 {
33486 }
33489 {
33492 }
33501 add_private_clause
33508 {
33511 {
33517 }
33518 else
33520 }
33527 {
33532 {
33536 }
33539 {
33540 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33544 {
33547 }
33548 else
33549 {
33552 }
33554 }
33555 else
33556 {
33561 }
33562 }
33565 {
33566 tree c;
33568 {
33577 decl);
33581 decl);
33582 }
33584 {
33589 else
33594 {
33597 /* For linear, signal that we need to fill up
33598 the so far unknown linear step. */
33601 }
33602 }
33603 }
33612 {
33613 /* If decl is an iterator, preserve the operator on decl
33614 until finish_omp_for. */
33616 && ((processing_template_decl
33621 else
33625 }
33637 {
33640 }
33645 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33646 in between the collapsed for loops to be still considered perfectly
33647 nested. Hopefully the final version clarifies this.
33648 For now handle (multiple) {'s and empty statements. */
33650 do
33651 {
33655 {
33657 bracecount++;
33658 }
33662 else
33663 {
33670 }
33671 }
33675 {
33678 }
33679 }
33681 /* Note that we saved the original contents of this flag when we entered
33682 the structured block, and so we don't need to re-save it here. */
33685 else
33688 /* Note that the grammar doesn't call for a structured block here,
33689 though the loop as a whole is a structured block. */
33696 else
33701 {
33703 {
33705 nbraces--;
33706 }
33709 else
33710 {
33712 {
33715 }
33720 }
33721 }
33728 }
33730 /* Helper function for OpenMP parsing, split clauses and call
33731 finish_omp_clauses on each of the set of clauses afterwards. */
33733 static void
33736 {
33742 }
33744 /* OpenMP 4.0:
33745 #pragma omp simd simd-clause[optseq] new-line
33746 for-loop */
33748 #define OMP_SIMD_CLAUSE_MASK \
33749 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
33750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33752 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33758 static tree
33761 {
33772 {
33776 OMP_CLAUSE_ORDERED);
33778 {
33780 "%<ordered%> clause with parameter may not be specified "
33783 }
33784 }
33795 }
33797 /* OpenMP 2.5:
33798 #pragma omp for for-clause[optseq] new-line
33799 for-loop
33801 OpenMP 4.0:
33802 #pragma omp for simd for-simd-clause[optseq] new-line
33803 for-loop */
33805 #define OMP_FOR_CLAUSE_MASK \
33806 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
33812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
33813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
33814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33816 static tree
33819 {
33828 /* Composite distribute parallel for{, simd} disallows ordered clause. */
33833 {
33838 {
33846 cclauses);
33850 cclauses);
33862 }
33863 }
33865 {
33868 }
33870 /* Composite distribute parallel for disallows linear clause. */
33877 {
33880 }
33891 }
33893 /* OpenMP 2.5:
33894 # pragma omp master new-line
33895 structured-block */
33897 static tree
33899 {
33903 }
33905 /* OpenMP 2.5:
33906 # pragma omp ordered new-line
33907 structured-block
33909 OpenMP 4.5:
33910 # pragma omp ordered ordered-clauses new-line
33911 structured-block */
33913 #define OMP_ORDERED_CLAUSE_MASK \
33914 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
33915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
33917 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
33918 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
33920 static bool
33923 {
33927 {
33931 }
33934 {
33939 {
33941 {
33943 "%<depend%> clause may only be used in compound "
33947 }
33948 tree clauses
33950 OMP_ORDERED_DEPEND_CLAUSE_MASK,
33954 }
33955 }
33957 tree clauses
33963 }
33965 /* OpenMP 2.5:
33967 section-scope:
33968 { section-sequence }
33970 section-sequence:
33971 section-directive[opt] structured-block
33972 section-sequence section-directive structured-block */
33974 static tree
33976 {
33988 {
33992 }
33995 {
34003 {
34007 }
34009 {
34012 }
34017 }
34028 }
34030 /* OpenMP 2.5:
34031 # pragma omp sections sections-clause[optseq] newline
34032 sections-scope */
34034 #define OMP_SECTIONS_CLAUSE_MASK \
34035 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34041 static tree
34044 {
34056 {
34059 }
34066 }
34068 /* OpenMP 2.5:
34069 # pragma omp parallel parallel-clause[optseq] new-line
34070 structured-block
34071 # pragma omp parallel for parallel-for-clause[optseq] new-line
34072 structured-block
34073 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34074 structured-block
34076 OpenMP 4.0:
34077 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34078 structured-block */
34080 #define OMP_PARALLEL_CLAUSE_MASK \
34081 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34082 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34083 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34084 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34085 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34086 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34087 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34088 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34089 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34091 static tree
34094 {
34101 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34107 {
34120 block);
34125 }
34126 /* When combined with distribute, parallel has to be followed by for.
34127 #pragma omp target parallel is allowed though. */
34131 {
34135 }
34137 {
34140 }
34142 {
34146 {
34156 block);
34159 }
34160 }
34164 {
34167 }
34175 }
34177 /* OpenMP 2.5:
34178 # pragma omp single single-clause[optseq] new-line
34179 structured-block */
34181 #define OMP_SINGLE_CLAUSE_MASK \
34182 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34187 static tree
34189 {
34199 }
34201 /* OpenMP 3.0:
34202 # pragma omp task task-clause[optseq] new-line
34203 structured-block */
34205 #define OMP_TASK_CLAUSE_MASK \
34206 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34207 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34208 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34209 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34210 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34211 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34212 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34213 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34214 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34215 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34217 static tree
34219 {
34230 }
34232 /* OpenMP 3.0:
34233 # pragma omp taskwait new-line */
34235 static void
34237 {
34240 }
34242 /* OpenMP 3.1:
34243 # pragma omp taskyield new-line */
34245 static void
34247 {
34250 }
34252 /* OpenMP 4.0:
34253 # pragma omp taskgroup new-line
34254 structured-block */
34256 static tree
34258 {
34262 }
34265 /* OpenMP 2.5:
34266 # pragma omp threadprivate (variable-list) */
34268 static void
34270 {
34271 tree vars;
34277 }
34279 /* OpenMP 4.0:
34280 # pragma omp cancel cancel-clause[optseq] new-line */
34282 #define OMP_CANCEL_CLAUSE_MASK \
34283 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34284 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34285 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34286 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34287 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34289 static void
34291 {
34295 }
34297 /* OpenMP 4.0:
34298 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34300 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34301 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34306 static void
34308 {
34309 tree clauses;
34313 {
34318 {
34321 }
34322 }
34324 {
34328 }
34331 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34333 pragma_tok);
34335 }
34337 /* OpenMP 4.0:
34338 #pragma omp distribute distribute-clause[optseq] new-line
34339 for-loop */
34341 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34342 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34343 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34344 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34348 static tree
34351 {
34360 {
34368 else
34371 {
34377 {
34380 cclauses);
34381 else
34383 cclauses);
34384 }
34389 cclauses);
34390 else
34392 cclauses);
34404 }
34405 }
34407 {
34410 }
34415 {
34418 }
34429 }
34431 /* OpenMP 4.0:
34432 # pragma omp teams teams-clause[optseq] new-line
34433 structured-block */
34435 #define OMP_TEAMS_CLAUSE_MASK \
34436 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34437 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34438 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34439 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34440 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34441 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34442 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34444 static tree
34447 {
34456 {
34460 {
34468 cclauses);
34472 cclauses);
34484 }
34485 }
34487 {
34490 }
34495 {
34498 }
34506 }
34508 /* OpenMP 4.0:
34509 # pragma omp target data target-data-clause[optseq] new-line
34510 structured-block */
34512 #define OMP_TARGET_DATA_CLAUSE_MASK \
34513 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34514 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34518 static tree
34520 {
34521 tree clauses
34526 {
34529 {
34546 "%<#pragma omp target data%> with map-type other "
34547 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34551 }
34553 }
34556 {
34559 "%<#pragma omp target data%> must contain at least "
34562 }
34573 }
34575 /* OpenMP 4.5:
34576 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34577 structured-block */
34579 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34580 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34581 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34582 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34583 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34584 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34586 static tree
34589 {
34592 {
34597 {
34600 }
34601 }
34603 {
34607 }
34610 {
34612 "%<#pragma omp target enter data%> may only be "
34616 }
34618 tree clauses
34623 {
34626 {
34639 "%<#pragma omp target enter data%> with map-type other "
34643 }
34645 }
34648 {
34651 "%<#pragma omp target enter data%> must contain at least "
34654 }
34661 }
34663 /* OpenMP 4.5:
34664 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34665 structured-block */
34667 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34668 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34674 static tree
34677 {
34680 {
34685 {
34688 }
34689 }
34691 {
34695 }
34698 {
34700 "%<#pragma omp target exit data%> may only be "
34704 }
34706 tree clauses
34711 {
34714 {
34728 "%<#pragma omp target exit data%> with map-type other "
34729 "than %<from%>, %<release%> or %<delete%> on %<map%>"
34733 }
34735 }
34738 {
34741 "%<#pragma omp target exit data%> must contain at least "
34744 }
34751 }
34753 /* OpenMP 4.0:
34754 # pragma omp target update target-update-clause[optseq] new-line */
34756 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
34757 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
34758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
34759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34764 static bool
34767 {
34769 {
34771 "%<#pragma omp target update%> may only be "
34775 }
34777 tree clauses
34782 {
34784 "%<#pragma omp target update%> must contain at least one "
34787 }
34795 }
34797 /* OpenMP 4.0:
34798 # pragma omp target target-clause[optseq] new-line
34799 structured-block */
34801 #define OMP_TARGET_CLAUSE_MASK \
34802 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34803 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34804 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34805 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34806 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34807 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
34810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
34812 static bool
34815 {
34819 {
34823 }
34826 {
34838 {
34846 {
34847 tree stmt;
34849 {
34852 OMP_TARGET_CLAUSE_MASK,
34853 cclauses);
34857 OMP_TARGET_CLAUSE_MASK,
34858 cclauses);
34862 OMP_TARGET_CLAUSE_MASK,
34863 cclauses);
34867 }
34869 }
34874 {
34889 }
34895 {
34896 /* For combined target teams, ensure the num_teams and
34897 thread_limit clause expressions are evaluated on the host,
34898 before entering the target construct. */
34899 tree c;
34905 {
34914 OMP_CLAUSE_FIRSTPRIVATE);
34919 }
34920 }
34929 }
34931 {
34934 }
34936 {
34940 }
34942 {
34946 }
34948 {
34952 }
34954 {
34957 }
34958 }
34973 check_clauses:
34975 {
34978 {
34992 "%<#pragma omp target%> with map-type other "
34993 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34997 }
34999 }
35001 }
35003 /* OpenACC 2.0:
35004 # pragma acc cache (variable-list) new-line
35005 */
35007 static tree
35009 {
35024 }
35026 /* OpenACC 2.0:
35027 # pragma acc data oacc-data-clause[optseq] new-line
35028 structured-block */
35030 #define OACC_DATA_CLAUSE_MASK \
35031 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35032 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35033 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35034 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35035 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35036 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35037 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35038 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35039 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35040 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35041 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35043 static tree
35045 {
35058 }
35060 /* OpenACC 2.0:
35061 # pragma acc host_data <clauses> new-line
35062 structured-block */
35064 #define OACC_HOST_DATA_CLAUSE_MASK \
35065 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35067 static tree
35069 {
35082 }
35084 /* OpenACC 2.0:
35085 # pragma acc declare oacc-data-clause[optseq] new-line
35086 */
35088 #define OACC_DECLARE_CLAUSE_MASK \
35089 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35090 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35102 static tree
35104 {
35113 {
35117 }
35120 {
35124 {
35128 }
35131 {
35139 /* Generated by c_finish_omp_clauses from array sections;
35140 avoid spurious diagnostics. */
35147 {
35149 "%qD must be a global variable in"
35151 decl);
35154 }
35159 {
35163 }
35165 {
35167 "invalid use of %<extern%> variable %qD "
35171 }
35173 {
35175 "invalid use of %<global%> variable %qD "
35179 }
35181 }
35186 {
35191 }
35194 {
35195 tree id;
35199 else
35205 {
35208 {
35211 {
35215 }
35216 }
35217 }
35218 }
35219 }
35232 }
35234 /* OpenACC 2.0:
35235 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35237 or
35239 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35241 LOC is the location of the #pragma token.
35242 */
35244 #define OACC_ENTER_DATA_CLAUSE_MASK \
35245 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35246 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35247 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35248 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35249 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35250 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35251 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35253 #define OACC_EXIT_DATA_CLAUSE_MASK \
35254 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35260 static tree
35263 {
35268 {
35274 }
35279 {
35283 }
35290 else
35295 {
35299 }
35307 }
35309 /* OpenACC 2.0:
35310 # pragma acc loop oacc-loop-clause[optseq] new-line
35311 structured-block */
35313 #define OACC_LOOP_CLAUSE_MASK \
35314 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35316 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35317 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35318 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35319 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35320 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35325 static tree
35328 {
35335 {
35341 }
35350 }
35352 /* OpenACC 2.0:
35353 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35354 structured-block
35356 or
35358 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35359 structured-block
35360 */
35362 #define OACC_KERNELS_CLAUSE_MASK \
35363 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35364 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35365 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35366 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35367 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35368 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35373 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35378 #define OACC_PARALLEL_CLAUSE_MASK \
35379 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35400 static tree
35403 {
35404 omp_clause_mask mask;
35407 {
35420 }
35423 {
35427 {
35432 tree clauses;
35435 }
35436 }
35445 }
35447 /* OpenACC 2.0:
35448 # pragma acc update oacc-update-clause[optseq] new-line
35449 */
35451 #define OACC_UPDATE_CLAUSE_MASK \
35452 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35454 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35455 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35456 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35457 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35459 static tree
35461 {
35468 {
35470 "%<#pragma acc update%> must contain at least one "
35473 }
35481 }
35483 /* OpenACC 2.0:
35484 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35486 LOC is the location of the #pragma token.
35487 */
35489 #define OACC_WAIT_CLAUSE_MASK \
35490 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35492 static tree
35494 {
35508 }
35510 /* OpenMP 4.0:
35511 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35513 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35514 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35518 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35519 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35521 static void
35524 {
35526 cp_omp_declare_simd_data data;
35528 {
35533 }
35544 {
35548 {
35561 }
35566 "%<#pragma omp declare simd%> not immediately followed by "
35570 }
35571 }
35573 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35574 This function is modelled similar to the late parsing of omp declare
35575 simd. */
35577 static tree
35579 {
35586 {
35588 "used in the same function marked as a Cilk Plus SIMD-enabled "
35594 }
35596 {
35600 }
35605 {
35612 NULL);
35626 }
35632 }
35634 /* Finalize #pragma omp declare simd clauses after direct declarator has
35635 been parsed, and put that into "omp declare simd" attribute. */
35637 static tree
35639 {
35645 {
35650 }
35655 {
35673 }
35677 }
35680 /* OpenMP 4.0:
35681 # pragma omp declare target new-line
35682 declarations and definitions
35683 # pragma omp end declare target new-line
35685 OpenMP 4.5:
35686 # pragma omp declare target ( extended-list ) new-line
35688 # pragma omp declare target declare-target-clauses[seq] new-line */
35690 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
35691 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35692 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
35694 static void
35696 {
35699 clauses
35703 {
35705 clauses);
35708 }
35709 else
35710 {
35714 }
35717 "%<#pragma omp declare target%> with clauses in between "
35718 "%<#pragma omp declare target%> without clauses and "
35721 {
35727 {
35730 }
35731 else
35734 {
35736 "%qD specified both in declare target %<link%> and %<to%>"
35739 }
35741 {
35745 {
35748 {
35752 }
35753 }
35754 }
35755 }
35756 }
35758 static void
35760 {
35763 {
35766 }
35768 {
35772 {
35775 }
35778 else
35779 {
35783 }
35784 }
35785 else
35786 {
35790 }
35794 "%<#pragma omp end declare target%> without corresponding "
35796 else
35798 }
35800 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
35801 expression and optional initializer clause of
35802 #pragma omp declare reduction. We store the expression(s) as
35803 either 3, 6 or 7 special statements inside of the artificial function's
35804 body. The first two statements are DECL_EXPRs for the artificial
35805 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
35806 expression that uses those variables.
35807 If there was any INITIALIZER clause, this is followed by further statements,
35808 the fourth and fifth statements are DECL_EXPRs for the artificial
35809 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
35810 constructor variant (first token after open paren is not omp_priv),
35811 then the sixth statement is a statement with the function call expression
35812 that uses the OMP_PRIV and optionally OMP_ORIG variable.
35813 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
35814 to initialize the OMP_PRIV artificial variable and there is seventh
35815 statement, a DECL_EXPR of the OMP_PRIV statement again. */
35817 static bool
35819 {
35831 tree combiner;
35846 {
35849 }
35852 {
35859 {
35862 }
35878 {
35882 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
35886 == CPP_CLOSE_PAREN
35889 {
35893 }
35898 }
35899 else
35900 {
35916 {
35921 }
35923 tree arg;
35936 }
35947 }
35953 }
35955 /* OpenMP 4.0
35956 #pragma omp declare reduction (reduction-id : typename-list : expression) \
35957 initializer-clause[opt] new-line
35959 initializer-clause:
35960 initializer (omp_priv initializer)
35961 initializer (function-name (argument-list)) */
35963 static void
35966 {
35976 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
35983 {
36015 }
36027 /* Types may not be defined in declare reduction type list. */
36030 parser->type_definition_forbidden_message
36036 saved_colon_doesnt_start_class_def_p
36041 {
36045 ;
36066 else
36071 else
36073 }
36075 /* Restore the saved message. */
36078 parser->colon_doesnt_start_class_def_p
36083 {
36084 fail:
36087 }
36093 {
36094 tree fntype
36097 NULL_TREE);
36117 {
36122 }
36124 {
36126 {
36135 }
36142 }
36143 else
36144 {
36147 }
36150 else
36153 {
36156 }
36158 {
36161 else
36166 }
36171 else
36172 {
36181 }
36188 }
36192 done:
36193 /* Free any declarators allocated. */
36195 }
36197 /* OpenMP 4.0
36198 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36199 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36200 initializer-clause[opt] new-line
36201 #pragma omp declare target new-line */
36203 static void
36206 {
36208 {
36213 {
36216 context);
36218 }
36221 {
36224 context);
36226 }
36228 {
36231 }
36233 {
36237 }
36238 }
36242 }
36244 /* OpenMP 4.5:
36245 #pragma omp taskloop taskloop-clause[optseq] new-line
36246 for-loop
36248 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36249 for-loop */
36251 #define OMP_TASKLOOP_CLAUSE_MASK \
36252 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36253 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36254 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36267 static tree
36270 {
36279 {
36284 {
36292 cclauses);
36296 cclauses);
36308 }
36309 }
36311 {
36314 }
36319 {
36322 }
36333 }
36336 /* OpenACC 2.0:
36337 # pragma acc routine oacc-routine-clause[optseq] new-line
36338 function-definition
36340 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36341 */
36343 #define OACC_ROUTINE_CLAUSE_MASK \
36344 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36345 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36346 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36347 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36350 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36351 component, which must resolve to a declared namespace-scope
36352 function. The clauses are either processed directly (for a named
36353 function), or defered until the immediatley following declaration
36354 is parsed. */
36356 static void
36359 {
36362 cp_omp_declare_simd_data data;
36364 {
36370 }
36373 /* Create a dummy claue, to record location. */
36377 {
36382 }
36384 /* Look for optional '( name )'. */
36386 {
36388 {
36397 "%<#pragma acc routine%> not followed by a "
36402 }
36407 /* We parse the name as an id-expression. If it resolves to
36408 anything other than a non-overloaded function at namespace
36409 scope, it's an error. */
36423 {
36427 }
36429 /* Build a chain of clauses. */
36434 cp_lexer_peek_token
36437 /* Force clauses to be non-null, by attaching context to it. */
36443 {
36447 }
36449 /* Perhaps we should use the same rule as declarations in different
36450 namespaces? */
36452 {
36457 }
36460 {
36465 }
36472 }
36473 else
36474 {
36493 {
36494 /* Create an empty list of clauses. */
36496 NULL_TREE);
36507 }
36508 }
36509 }
36511 /* Finalize #pragma acc routine clauses after direct declarator has
36512 been parsed, and put that into "oacc function" attribute. */
36514 static tree
36516 {
36520 location_t loc;
36526 {
36531 }
36548 /* Force clauses to be non-null, by attaching context to it. */
36553 }
36555 /* Apply any saved OpenACC routine clauses to a just-parsed
36556 declaration. */
36558 static void
36560 {
36562 {
36570 {
36573 }
36576 {
36579 }
36582 {
36584 "%<#pragma acc routine%> not followed by a function "
36587 }
36590 {
36592 fndecl);
36594 }
36597 {
36601 }
36603 /* Process for function attrib */
36607 /* Add an "omp target" attribute. */
36611 }
36612 }
36614 /* Main entry point to OpenMP statement pragmas. */
36616 static void
36618 {
36619 tree stmt;
36624 {
36706 }
36709 }
36710 \f
36711 /* Transactional Memory parsing routines. */
36713 /* Parse a transaction attribute.
36715 txn-attribute:
36716 attribute
36717 [ [ identifier ] ]
36719 We use this instead of cp_parser_attributes_opt for transactions to avoid
36720 the pedwarn in C++98 mode. */
36722 static tree
36724 {
36739 {
36743 /* For keywords, use the canonical spelling,
36744 not the parsed identifier. */
36748 }
36749 else
36753 error1:
36756 }
36758 /* Parse a __transaction_atomic or __transaction_relaxed statement.
36760 transaction-statement:
36761 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
36762 compound-statement
36763 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
36764 */
36766 static tree
36768 {
36779 else
36780 {
36784 }
36786 /* Parse a noexcept specification. */
36790 {
36791 /* cancel-and-throw is unimplemented. */
36794 }
36795 else
36798 /* Keep track if we're in the lexical scope of an outer transaction. */
36810 }
36812 /* Parse a __transaction_atomic or __transaction_relaxed expression.
36814 transaction-expression:
36815 __transaction_atomic txn-noexcept-spec[opt] ( expression )
36816 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
36817 */
36819 static tree
36821 {
36834 keyword == RID_TRANSACTION_RELAXED
36848 /* Set this early. This might mean that we allow transaction_cancel in
36849 an expression that we find out later actually has to be a constexpr.
36850 However, we expect that cxx_constant_value will be able to deal with
36851 this; also, if the noexcept has no constexpr, then what we parse next
36852 really is a transaction's body. */
36855 /* Parse a noexcept specification. */
36861 {
36868 }
36869 else
36870 {
36871 /* The only expression that is available got parsed for the noexcept
36872 already. noexcept is true then. */
36875 }
36884 }
36886 /* Parse a function-transaction-block.
36888 function-transaction-block:
36889 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
36890 function-body
36891 __transaction_atomic txn-attribute[opt] function-try-block
36892 __transaction_relaxed ctor-initializer[opt] function-body
36893 __transaction_relaxed function-try-block
36894 */
36896 static bool
36898 {
36914 else
36915 {
36919 }
36927 else
36928 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
36936 }
36938 /* Parse a __transaction_cancel statement.
36940 cancel-statement:
36941 __transaction_cancel txn-attribute[opt] ;
36942 __transaction_cancel txn-attribute[opt] throw-expression ;
36944 ??? Cancel and throw is not yet implemented. */
36946 static tree
36948 {
36954 RT_TRANSACTION_CANCEL);
36961 /* ??? Parse cancel-and-throw here. */
36966 {
36970 }
36972 {
36976 }
36978 {
36981 {
36987 }
36988 }
36990 {
36994 }
37000 }
37001 \f
37002 /* The parser. */
37006 \f
37007 /* Special handling for the first token or line in the file. The first
37008 thing in the file might be #pragma GCC pch_preprocess, which loads a
37009 PCH file, which is a GC collection point. So we need to handle this
37010 first pragma without benefit of an existing lexer structure.
37012 Always returns one token to the caller in *FIRST_TOKEN. This is
37013 either the true first token of the file, or the first token after
37014 the initial pragma. */
37016 static void
37018 {
37027 {
37034 }
37035 else
37038 /* Skip to the end of the pragma. */
37042 /* Now actually load the PCH file. */
37046 /* Read one more token to return to our caller. We have to do this
37047 after reading the PCH file in, since its pointers have to be
37048 live. */
37050 }
37052 /* Parses the grainsize pragma for the _Cilk_for statement.
37053 Syntax:
37054 #pragma cilk grainsize = <VALUE>. */
37056 static void
37058 {
37060 {
37065 {
37068 }
37070 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37073 else
37075 "%<#pragma cilk grainsize%> is not followed by "
37078 }
37080 }
37082 /* Normal parsing of a pragma token. Here we can (and must) use the
37083 regular lexer. */
37085 static bool
37087 {
37090 tree stmt;
37101 {
37109 {
37119 }
37124 {
37134 }
37139 {
37145 "%<#pragma omp taskwait%> may only be "
37150 }
37155 {
37161 "%<#pragma omp taskyield%> may only be "
37166 }
37171 {
37177 "%<#pragma omp cancel%> may only be "
37182 }
37187 {
37193 "%<#pragma omp cancellation point%> may only be "
37198 }
37266 "%<#pragma omp section%> may only be used in "
37271 {
37273 {
37277 }
37284 {
37287 }
37290 }
37294 {
37298 }
37306 {
37310 }
37312 /* Ignore the pragma if Cilk Plus is not enabled. */
37314 {
37317 }
37318 else
37319 {
37323 }
37330 bad_stmt:
37333 }
37337 }
37339 /* The interface the pragma parsers have to the lexer. */
37341 enum cpp_ttype
37343 {
37355 else
37356 {
37360 }
37363 }
37365 \f
37366 /* External interface. */
37368 /* Parse one entire translation unit. */
37370 void
37372 {
37385 }
37387 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37388 vectorlength clause:
37389 Syntax:
37390 vectorlength ( constant-expression ) */
37392 static tree
37395 {
37397 tree expr;
37398 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37399 safelen clause. Thus, vectorlength is represented as OMP 4.0
37400 safelen. For SIMD-enabled function it is represented by OMP 4.0
37401 simdlen. */
37404 loc);
37405 else
37407 loc);
37415 /* If expr == error_mark_node, then don't emit any errors nor
37416 create a clause. if any of the above functions returns
37417 error mark node then they would have emitted an error message. */
37419 ;
37427 else
37428 {
37429 tree c;
37431 {
37436 }
37437 else
37438 {
37443 }
37444 }
37449 }
37451 /* Handles the Cilk Plus #pragma simd linear clause.
37452 Syntax:
37453 linear ( simd-linear-variable-list )
37455 simd-linear-variable-list:
37456 simd-linear-variable
37457 simd-linear-variable-list , simd-linear-variable
37459 simd-linear-variable:
37460 id-expression
37461 id-expression : simd-linear-step
37463 simd-linear-step:
37464 conditional-expression */
37466 static tree
37468 {
37474 {
37478 }
37483 {
37486 {
37490 }
37497 {
37501 }
37502 else
37503 {
37507 /* If present, parse the linear step. Otherwise, assume the default
37508 value of 1. */
37510 {
37517 {
37518 /* If an error has occurred, then the whole pragma is
37519 considered ill-formed. Thus, no reason to keep
37520 parsing. */
37523 }
37531 else
37533 "step size must be an integer constant "
37535 }
37537 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37543 }
37548 else
37549 {
37554 }
37555 }
37559 }
37561 /* Returns the name of the next clause. If the clause is not
37562 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37563 token is not consumed. Otherwise, the appropriate enum from the
37564 pragma_simd_clause is returned and the token is consumed. */
37566 static pragma_omp_clause
37568 {
37569 pragma_omp_clause clause_type;
37586 else
37591 }
37593 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37595 static tree
37597 {
37602 {
37603 pragma_omp_clause c_kind;
37610 /* Use the OpenMP 4.0 equivalent function. */
37613 /* Use the OpenMP 4.0 equivalent function. */
37615 clauses);
37617 /* Use the OMP 4.0 equivalent function. */
37619 clauses);
37621 /* Use the OMP 4.0 equivalent function. */
37623 else
37624 {
37628 }
37629 }
37635 else
37637 }
37639 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37641 static void
37643 {
37650 {
37654 }
37663 }
37665 /* Main entry-point for parsing Cilk Plus _Cilk_for
37666 loops. The return value is error_mark_node
37667 when errors happen and CILK_FOR tree on success. */
37669 static tree
37671 {
37686 else
37692 }
37694 /* Create an identifier for a generic parameter type (a synthesized
37695 template parameter implied by `auto' or a concept identifier). */
37698 static tree
37700 {
37704 }
37706 /* Predicate that behaves as is_auto_or_concept but matches the parent
37707 node of the generic type rather than the generic type itself. This
37708 allows for type transformation in add_implicit_template_parms. */
37712 {
37714 }
37716 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
37717 (creating a new template parameter list if necessary). Returns the newly
37718 created template type parm. */
37720 static tree
37722 {
37725 /* Before committing to modifying any scope, if we're in an
37726 implicit template scope, and we're trying to synthesize a
37727 constrained parameter, try to find a previous parameter with
37728 the same name. This is the same-type rule for abbreviated
37729 function templates. */
37731 {
37734 {
37736 {
37739 /* Return the TEMPLATE_PARM_INDEX. */
37742 }
37744 }
37745 }
37747 /* We are either continuing a function template that already contains implicit
37748 template parameters, creating a new fully-implicit function template, or
37749 extending an existing explicit function template with implicit template
37750 parameters. */
37758 {
37762 }
37763 else
37764 {
37765 /* Roll back to the existing template parameter scope (in the case of
37766 extending an explicit function template) or introduce a new template
37767 parameter scope ahead of the function parameter scope (or class scope
37768 in the case of out-of-line member definitions). The function scope is
37769 added back after template parameter synthesis below. */
37774 {
37777 }
37779 {
37780 /* If not defining a class, then any class scope is a scope level in
37781 an out-of-line member definition. In this case simply wind back
37782 beyond the first such scope to inject the template parameter list.
37783 Otherwise wind back to the class being defined. The latter can
37784 occur in class member friend declarations such as:
37786 class A {
37787 void foo (auto);
37788 };
37789 class B {
37790 friend void A::foo (auto);
37791 };
37793 The template parameter list synthesized for the friend declaration
37794 must be injected in the scope of 'B'. This can also occur in
37795 erroneous cases such as:
37797 struct A {
37798 struct B {
37799 void foo (auto);
37800 };
37801 void B::foo (auto) {}
37802 };
37804 Here the attempted definition of 'B::foo' within 'A' is ill-formed
37805 but, nevertheless, the template parameter list synthesized for the
37806 declarator should be injected into the scope of 'A' as if the
37807 ill-formed template was specified explicitly. */
37810 {
37813 }
37814 }
37820 {
37821 /* Introduce a new template parameter list for implicit template
37822 parameters. */
37826 parser->implicit_template_scope
37833 }
37834 else
37835 {
37836 /* Synthesize implicit template parameters at the end of the explicit
37837 template parameter list. */
37844 parser->implicit_template_parms
37846 }
37847 }
37849 /* Synthesize a new template parameter and track the current template
37850 parameter chain with implicit_template_parms. */
37854 tree synth_tmpl_parm;
37858 synth_tmpl_parm
37861 synth_tmpl_parm
37863 else
37864 {
37868 }
37870 // Attach the constraint to the parm before processing.
37873 tree new_parm
37875 input_location,
37876 node,
37880 // Chain the new parameter to the list of implicit parameters.
37882 parser->implicit_template_parms
37884 else
37889 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
37892 /* If creating a fully implicit function template, start the new implicit
37893 template parameter list with this synthesized type, otherwise grow the
37894 current template parameter list. */
37897 {
37904 }
37905 else
37906 {
37911 }
37913 // If the new parameter was constrained, we need to add that to the
37914 // constraints in the template parameter list.
37916 {
37920 }
37925 }
37927 /* Finish the declaration of a fully implicit function template. Such a
37928 template has no explicit template parameter list so has not been through the
37929 normal template head and tail processing. synthesize_implicit_template_parm
37930 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
37931 provided if the declaration is a class member such that its template
37932 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
37933 form is returned. Otherwise NULL_TREE is returned. */
37935 static tree
37937 {
37942 {
37946 }
37956 }