| blob | 6ae45b0ca1add9b05c92c00e945e2116d6f2688f |
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". */
3179 {
3180 tree b;
3183 b;
3185 {
3189 {
3190 tree field;
3191 /* Go from a particular instantiation of the
3192 template (which will have an empty TYPE_FIELDs),
3193 to the main version. */
3196 field;
3200 {
3205 }
3208 }
3209 }
3210 }
3211 }
3212 /* Here we diagnose qualified-ids where the scope is actually correct,
3213 but the identifier does not resolve to a valid type name. */
3215 {
3217 {
3222 else
3228 }
3231 {
3232 /* A<T>::A<T>() */
3238 }
3245 {
3250 else
3256 }
3257 else
3259 }
3260 }
3262 /* Check for a common situation where a type-name should be present,
3263 but is not, and issue a sensible error message. Returns true if an
3264 invalid type-name was detected.
3266 The situation handled by this function are variable declarations of the
3267 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3268 Usually, `ID' should name a type, but if we got here it means that it
3269 does not. We try to emit the best possible error message depending on
3270 how exactly the id-expression looks like. */
3272 static bool
3274 {
3275 tree id;
3278 /* Avoid duplicate error about ambiguous lookup. */
3280 {
3284 }
3293 /* If the next token is a (, this is a function with no explicit return
3294 type, i.e. constructor, destructor or conversion op. */
3297 {
3300 }
3304 /* Emit a diagnostic for the invalid type. */
3306 out:
3307 /* If we aren't in the middle of a declarator (i.e. in a
3308 parameter-declaration-clause), skip to the end of the declaration;
3309 there's no point in trying to process it. */
3313 }
3315 /* Consume tokens up to, and including, the next non-nested closing `)'.
3316 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3317 are doing error recovery. Returns -1 if OR_TTYPE is not CPP_EOF and we
3318 found an unnested token of that type. */
3320 static int
3323 cpp_ttype or_ttype,
3325 {
3335 {
3338 /* Have we found what we're looking for before the closing paren? */
3344 {
3347 /* If we've run out of tokens, then there is no closing `)'. */
3350 /* This is good for lambda expression capture-lists. */
3360 /* This matches the processing in skip_to_end_of_statement. */
3380 {
3384 }
3389 }
3391 /* Consume the token. */
3393 }
3394 }
3396 /* Consume tokens up to, and including, the next non-nested closing `)'.
3397 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3398 are doing error recovery. Returns -1 if OR_COMMA is true and we
3399 found an unnested token of that type. */
3401 static int
3406 {
3410 }
3412 /* Consume tokens until we reach the end of the current statement.
3413 Normally, that will be just before consuming a `;'. However, if a
3414 non-nested `}' comes first, then we stop before consuming that. */
3416 static void
3418 {
3421 /* Unwind generic function template scope if necessary. */
3426 {
3430 {
3433 /* If we've run out of tokens, stop. */
3437 /* If the next token is a `;', we have reached the end of the
3438 statement. */
3444 /* If this is a non-nested '}', stop before consuming it.
3445 That way, when confronted with something like:
3447 { 3 + }
3449 we stop before consuming the closing '}', even though we
3450 have not yet reached a `;'. */
3454 /* If it is the closing '}' for a block that we have
3455 scanned, stop -- but only after consuming the token.
3456 That way given:
3458 void f g () { ... }
3459 typedef int I;
3461 we will stop after the body of the erroneously declared
3462 function, but before consuming the following `typedef'
3463 declaration. */
3465 {
3468 }
3476 }
3478 /* Consume the token. */
3480 }
3481 }
3483 /* This function is called at the end of a statement or declaration.
3484 If the next token is a semicolon, it is consumed; otherwise, error
3485 recovery is attempted. */
3487 static void
3489 {
3490 /* Look for the trailing `;'. */
3492 {
3493 /* If there is additional (erroneous) input, skip to the end of
3494 the statement. */
3496 /* If the next token is now a `;', consume it. */
3499 }
3500 }
3502 /* Skip tokens until we have consumed an entire block, or until we
3503 have consumed a non-nested `;'. */
3505 static void
3507 {
3510 /* Unwind generic function template scope if necessary. */
3515 {
3519 {
3522 /* If we've run out of tokens, stop. */
3526 /* Stop if this is an unnested ';'. */
3532 /* Stop if this is an unnested '}', or closes the outermost
3533 nesting level. */
3534 nesting_depth--;
3542 /* Nest. */
3543 nesting_depth++;
3548 }
3550 /* Consume the token. */
3552 }
3553 }
3555 /* Skip tokens until a non-nested closing curly brace is the next
3556 token, or there are no more tokens. Return true in the first case,
3557 false otherwise. */
3559 static bool
3561 {
3565 {
3569 {
3572 /* If we've run out of tokens, stop. */
3576 /* If the next token is a non-nested `}', then we have reached
3577 the end of the current block. */
3583 /* If it the next token is a `{', then we are entering a new
3584 block. Consume the entire block. */
3590 }
3592 /* Consume the token. */
3594 }
3595 }
3597 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3598 parameter is the PRAGMA token, allowing us to purge the entire pragma
3599 sequence. */
3601 static void
3603 {
3608 do
3612 /* Ensure that the pragma is not parsed again. */
3614 }
3616 /* Require pragma end of line, resyncing with it as necessary. The
3617 arguments are as for cp_parser_skip_to_pragma_eol. */
3619 static void
3621 {
3625 }
3627 /* This is a simple wrapper around make_typename_type. When the id is
3628 an unresolved identifier node, we can provide a superior diagnostic
3629 using cp_parser_diagnose_invalid_type_name. */
3631 static tree
3633 location_t id_location)
3634 {
3635 tree result;
3637 {
3643 }
3645 }
3647 /* This is a wrapper around the
3648 make_{pointer,ptrmem,reference}_declarator functions that decides
3649 which one to call based on the CODE and CLASS_TYPE arguments. The
3650 CODE argument should be one of the values returned by
3651 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3652 appertain to the pointer or reference. */
3656 cp_cv_quals cv_qualifiers,
3658 tree attributes)
3659 {
3666 else
3676 }
3678 /* Create a new C++ parser. */
3682 {
3687 /* cp_lexer_new_main is called before doing GC allocation because
3688 cp_lexer_new_main might load a PCH file. */
3691 /* Initialize the binops_by_token so that we can get the tree
3692 directly from the token. */
3700 /* For now, we always accept GNU extensions. */
3703 /* The `>' token is a greater-than operator, not the end of a
3704 template-id. */
3709 /* We are not parsing a constant-expression. */
3714 /* Local variable names are not forbidden. */
3717 /* We are not processing an `extern "C"' declaration. */
3720 /* We are not processing a declarator. */
3723 /* We are not processing a template-argument-list. */
3726 /* We are not in an iteration statement. */
3729 /* We are not in a switch statement. */
3732 /* We are not parsing a type-id inside an expression. */
3735 /* Declarations aren't implicitly extern "C". */
3738 /* String literals should be translated to the execution character set. */
3741 /* We are not parsing a function body. */
3744 /* We can correct until told otherwise. */
3747 /* The unparsed function queue is empty. */
3750 /* There are no classes being defined. */
3753 /* No template parameters apply. */
3756 /* Not declaring an implicit function template. */
3762 /* Active OpenACC routine clauses. */
3765 /* Allow constrained-type-specifiers. */
3769 }
3771 /* Create a cp_lexer structure which will emit the tokens in CACHE
3772 and push it onto the parser's lexer stack. This is used for delayed
3773 parsing of in-class method bodies and default arguments, and should
3774 not be confused with tentative parsing. */
3775 static void
3777 {
3782 /* Move the current source position to that of the first token in the
3783 new lexer. */
3785 }
3787 /* Pop the top lexer off the parser stack. This is never used for the
3788 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3789 static void
3791 {
3796 /* Put the current source position back where it was before this
3797 lexer was pushed. */
3799 }
3801 /* Lexical conventions [gram.lex] */
3803 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3804 identifier. */
3806 static cp_expr
3808 {
3811 /* Look for the identifier. */
3813 /* Return the value. */
3816 else
3818 }
3820 /* Parse a sequence of adjacent string constants. Returns a
3821 TREE_STRING representing the combined, nul-terminated string
3822 constant. If TRANSLATE is true, translate the string to the
3823 execution character set. If WIDE_OK is true, a wide string is
3824 invalid here.
3826 C++98 [lex.string] says that if a narrow string literal token is
3827 adjacent to a wide string literal token, the behavior is undefined.
3828 However, C99 6.4.5p4 says that this results in a wide string literal.
3829 We follow C99 here, for consistency with the C front end.
3831 This code is largely lifted from lex_string() in c-lex.c.
3833 FUTURE: ObjC++ will need to handle @-strings here. */
3834 static cp_expr
3837 {
3838 tree value;
3845 tree string_tree;
3851 {
3854 }
3859 {
3863 }
3864 else
3865 {
3868 }
3871 /* Try to avoid the overhead of creating and destroying an obstack
3872 for the common case of just one string. */
3875 {
3883 {
3887 }
3888 else
3892 }
3893 else
3894 {
3895 location_t last_tok_loc;
3899 do
3900 {
3903 count++;
3908 {
3911 {
3914 }
3917 {
3922 }
3924 }
3925 else
3929 {
3934 "unsupported non-standard concatenation "
3936 }
3942 {
3946 }
3947 else
3948 {
3952 }
3953 }
3956 /* A string literal built by concatenation has its caret=start at
3957 the start of the initial string, and its finish at the finish of
3958 the final string literal. */
3962 }
3965 {
3968 }
3972 {
3977 {
3992 }
3997 {
4002 else
4004 }
4005 }
4006 else
4007 /* cpp_interpret_string has issued an error. */
4014 }
4016 /* Look up a literal operator with the name and the exact arguments. */
4018 static tree
4020 {
4027 {
4033 {
4036 {
4046 }
4049 /* May be this should be sufficient_parms_p instead,
4050 depending on how exactly should user-defined literals
4051 work in presence of default arguments on the literal
4052 operator parameters. */
4055 }
4056 }
4059 }
4061 /* Parse a user-defined char constant. Returns a call to a user-defined
4062 literal operator taking the character as an argument. */
4064 static cp_expr
4066 {
4074 /* Build up a call to the user-defined operator */
4075 /* Lookup the name we got back from the id-expression. */
4080 {
4085 }
4089 }
4091 /* A subroutine of cp_parser_userdef_numeric_literal to
4092 create a char... template parameter pack from a string node. */
4094 static tree
4096 {
4097 tree charvec;
4103 /* Fill in CHARVEC with all of the parameters. */
4108 /* Build the argument packs. */
4115 }
4117 /* A subroutine of cp_parser_userdef_numeric_literal to
4118 create a char... template parameter pack from a string node. */
4120 static tree
4122 {
4123 tree charvec;
4134 /* First template parm is character type. */
4137 /* Fill in CHARVEC with all of the parameters. */
4144 /* Build the argument packs. */
4151 }
4153 /* Parse a user-defined numeric constant. returns a call to a user-defined
4154 literal operator. */
4156 static cp_expr
4158 {
4169 /* Look for a literal operator taking the exact type of numeric argument
4170 as the literal value. */
4175 {
4177 tf_warning_or_error);
4180 {
4183 long_long_unsigned_type_node);
4184 }
4185 else
4186 {
4190 long_double_type_node);
4194 }
4198 }
4201 /* If the numeric argument didn't work, look for a raw literal
4202 operator taking a const char* argument consisting of the number
4203 in string format. */
4208 {
4210 tf_warning_or_error);
4213 }
4216 /* If the raw literal didn't work, look for a non-type template
4217 function with parameter pack char.... Call the function with
4218 template parameter characters representing the number. */
4222 {
4226 tf_warning_or_error);
4229 }
4238 }
4240 /* Parse a user-defined string constant. Returns a call to a user-defined
4241 literal operator taking a character pointer and the length of the string
4242 as arguments. */
4244 static tree
4246 {
4255 /* Build up a call to the user-defined operator. */
4256 /* Lookup the name we got back from the id-expression. */
4263 {
4265 tf_warning_or_error);
4268 }
4271 /* Look for a template function with typename parameter CharT
4272 and parameter pack CharT... Call the function with
4273 template parameter characters representing the string. */
4277 {
4281 tf_warning_or_error);
4284 }
4290 }
4293 /* Basic concepts [gram.basic] */
4295 /* Parse a translation-unit.
4297 translation-unit:
4298 declaration-seq [opt]
4300 Returns TRUE if all went well. */
4302 static bool
4304 {
4305 /* The address of the first non-permanent object on the declarator
4306 obstack. */
4311 /* Create the declarator obstack, if necessary. */
4313 {
4315 /* Create the error declarator. */
4317 /* Create the empty parameter list. */
4319 /* Remember where the base of the declarator obstack lies. */
4321 }
4325 /* If there are no tokens left then all went well. */
4327 {
4328 /* Get rid of the token array; we don't need it any more. */
4332 /* This file might have been a context that's implicitly extern
4333 "C". If so, pop the lang context. (Only relevant for PCH.) */
4335 {
4338 }
4340 /* Finish up. */
4344 }
4345 else
4346 {
4349 }
4351 /* Make sure the declarator obstack was fully cleaned up. */
4355 /* All went well. */
4357 }
4359 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4360 decltype context. */
4364 {
4369 }
4371 /* We're about to parse a collection of statements. If we're currently
4372 parsing tentatively, set up a firewall so that any nested
4373 cp_parser_commit_to_tentative_parse won't affect the current context. */
4375 static cp_token_position
4377 {
4384 }
4386 /* We've finished parsing the collection of statements. Wrap up the
4387 firewall and replace the relevant tokens with the parsed form. */
4389 static void
4391 tree expr)
4392 {
4396 /* Finish the firewall level. */
4398 /* And remember the result of the parse for when we try again. */
4404 }
4406 /* Like the above functions, but let the user modify the tokens. Used by
4407 CPP_DECLTYPE and CPP_TEMPLATE_ID, where we are saving the side-effects for
4408 later parses, so it makes sense to localize the effects of
4409 cp_parser_commit_to_tentative_parse. */
4411 struct tentative_firewall
4412 {
4417 {
4418 /* If we're currently parsing tentatively, start a committed level as a
4419 firewall and then an inner tentative parse. */
4421 {
4425 }
4426 }
4429 {
4431 {
4432 /* Finish the inner tentative parse and the firewall, propagating any
4433 uncommitted error state to the outer tentative parse. */
4439 }
4440 }
4441 };
4443 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4444 enclosing parentheses. */
4446 static cp_expr
4448 {
4451 /* Consume the '('. */
4454 /* Start the statement-expression. */
4456 /* Parse the compound-statement. */
4458 /* Finish up. */
4460 /* Consume the ')'. */
4468 }
4470 /* Expressions [gram.expr] */
4472 /* Parse a fold-operator.
4474 fold-operator:
4475 - * / % ^ & | = < > << >>
4476 = -= *= /= %= ^= &= |= <<= >>=
4477 == != <= >= && || , .* ->*
4479 This returns the tree code corresponding to the matched operator
4480 as an int. When the current token matches a compound assignment
4481 opertor, the resulting tree code is the negative value of the
4482 non-assignment operator. */
4484 static int
4486 {
4488 {
4528 }
4529 }
4531 /* Returns true if CODE indicates a binary expression, which is not allowed in
4532 the LHS of a fold-expression. More codes will need to be added to use this
4533 function in other contexts. */
4535 static bool
4537 {
4539 {
4572 }
4573 }
4575 /* If the next token is a suitable fold operator, consume it and return as
4576 the function above. */
4578 static int
4580 {
4586 }
4588 /* Parse a fold-expression.
4590 fold-expression:
4591 ( ... folding-operator cast-expression)
4592 ( cast-expression folding-operator ... )
4593 ( cast-expression folding operator ... folding-operator cast-expression)
4595 Note that the '(' and ')' are matched in primary expression. */
4597 static cp_expr
4599 {
4600 cp_id_kind pidk;
4602 // Left fold.
4604 {
4608 {
4611 }
4618 }
4623 {
4626 }
4629 {
4632 }
4635 /* The operands of a fold-expression are cast-expressions, so binary or
4636 conditional expressions are not allowed. We check this here to avoid
4637 tentative parsing. */
4645 // Right fold.
4650 {
4653 }
4656 // Binary left or right fold.
4661 }
4663 /* Parse a primary-expression.
4665 primary-expression:
4666 literal
4667 this
4668 ( expression )
4669 id-expression
4670 lambda-expression (C++11)
4672 GNU Extensions:
4674 primary-expression:
4675 ( compound-statement )
4676 __builtin_va_arg ( assignment-expression , type-id )
4677 __builtin_offsetof ( type-id , offsetof-expression )
4679 C++ Extensions:
4680 __has_nothrow_assign ( type-id )
4681 __has_nothrow_constructor ( type-id )
4682 __has_nothrow_copy ( type-id )
4683 __has_trivial_assign ( type-id )
4684 __has_trivial_constructor ( type-id )
4685 __has_trivial_copy ( type-id )
4686 __has_trivial_destructor ( type-id )
4687 __has_virtual_destructor ( type-id )
4688 __is_abstract ( type-id )
4689 __is_base_of ( type-id , type-id )
4690 __is_class ( type-id )
4691 __is_empty ( type-id )
4692 __is_enum ( type-id )
4693 __is_final ( type-id )
4694 __is_literal_type ( type-id )
4695 __is_pod ( type-id )
4696 __is_polymorphic ( type-id )
4697 __is_std_layout ( type-id )
4698 __is_trivial ( type-id )
4699 __is_union ( type-id )
4701 Objective-C++ Extension:
4703 primary-expression:
4704 objc-expression
4706 literal:
4707 __null
4709 ADDRESS_P is true iff this expression was immediately preceded by
4710 "&" and therefore might denote a pointer-to-member. CAST_P is true
4711 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4712 true iff this expression is a template argument.
4714 Returns a representation of the expression. Upon return, *IDK
4715 indicates what kind of id-expression (if any) was present. */
4717 static cp_expr
4724 {
4727 /* Assume the primary expression is not an id-expression. */
4730 /* Peek at the next token. */
4733 {
4734 /* literal:
4735 integer-literal
4736 character-literal
4737 floating-literal
4738 string-literal
4739 boolean-literal
4740 pointer-literal
4741 user-defined-literal */
4753 {
4757 }
4758 /* Floating-point literals are only allowed in an integral
4759 constant expression if they are cast to an integral or
4760 enumeration type. */
4764 {
4765 /* CAST_P will be set even in invalid code like "int(2.7 +
4766 ...)". Therefore, we have to check that the next token
4767 is sure to end the cast. */
4769 {
4774 enumerator-definition. */
4776 /* The curly brace at the end of an enum-specifier. */
4778 /* The end of a statement. */
4780 /* The end of the cast-expression. */
4782 /* The end of an array bound. */
4784 /* The closing ">" in a template-argument-list. */
4787 /* C++0x only: A ">>" treated like two ">" tokens,
4788 in a template-argument-list. */
4793 }
4795 /* If we are within a cast, then the constraint that the
4796 cast is to an integral or enumeration type will be
4797 checked at that point. If we are not within a cast, then
4798 this code is invalid. */
4801 }
4821 /* ??? Should wide strings be allowed when parser->translate_strings_p
4822 is false (i.e. in attributes)? If not, we can kill the third
4823 argument to cp_parser_string_literal. */
4829 /* If we see `( { ' then we are looking at the beginning of
4830 a GNU statement-expression. */
4833 {
4834 /* Statement-expressions are not allowed by the standard. */
4838 /* And they're not allowed outside of a function-body; you
4839 cannot, for example, write:
4841 int i = ({ int j = 3; j + 1; });
4843 at class or namespace scope. */
4846 {
4848 "statement-expressions are not allowed outside "
4854 }
4855 else
4857 }
4858 /* Otherwise it's a normal parenthesized expression. */
4859 {
4860 cp_expr expr;
4865 /* Consume the `('. */
4867 /* Within a parenthesized expression, a `>' token is always
4868 the greater-than operator. */
4869 saved_greater_than_is_operator_p
4874 /* Left fold expression. */
4876 else
4877 /* Parse the parenthesized expression. */
4882 {
4889 }
4890 else
4891 /* Let the front end know that this expression was
4892 enclosed in parentheses. This matters in case, for
4893 example, the expression is of the form `A::B', since
4894 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4895 not. */
4898 /* DR 705: Wrapping an unqualified name in parentheses
4899 suppresses arg-dependent lookup. We want to pass back
4900 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4901 (c++/37862), but none of the others. */
4905 /* The `>' token might be the end of a template-id or
4906 template-parameter-list now. */
4907 parser->greater_than_is_operator_p
4910 /* Consume the `)'. */
4919 }
4922 {
4924 {
4925 /* We might have an Objective-C++ message. */
4928 /* If that works out, we're done ... */
4931 /* ... else, fall though to see if it's a lambda. */
4932 }
4934 /* Don't warn about a failed tentative parse. */
4939 }
4943 /* We have an Objective-C++ string literal. */
4950 {
4951 /* These two are the boolean literals. */
4959 /* The `__null' literal. */
4964 /* The `nullptr' literal. */
4969 /* Recognize the `this' keyword. */
4973 {
4977 }
4978 /* Pointers cannot appear in constant-expressions. */
4983 /* The `operator' keyword can be the beginning of an
4984 id-expression. */
4991 {
4992 non_integral_constant name;
4994 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4995 __func__ are the names of variables -- but they are
4996 treated specially. Therefore, they are handled here,
4997 rather than relying on the generic id-expression logic
4998 below. Grammatically, these names are id-expressions.
5000 Consume the token. */
5004 {
5016 }
5021 /* Look up the name. */
5023 }
5026 {
5027 tree expression;
5028 tree type;
5029 source_location type_location;
5030 location_t start_loc
5032 /* The `__builtin_va_arg' construct is used to handle
5033 `va_arg'. Consume the `__builtin_va_arg' token. */
5035 /* Look for the opening `('. */
5037 /* Now, parse the assignment-expression. */
5039 /* Look for the `,'. */
5042 /* Parse the type-id. */
5043 {
5046 }
5047 /* Look for the closing `)'. */
5048 location_t finish_loc
5051 /* Using `va_arg' in a constant-expression is not
5052 allowed. */
5054 NIC_VA_ARG))
5056 /* Construct a location of the form:
5057 __builtin_va_arg (v, int)
5058 ~~~~~~~~~~~~~~~~~~~~~^~~~
5059 with the caret at the type, ranging from the start of the
5060 "__builtin_va_arg" token to the close paren. */
5061 location_t combined_loc
5064 }
5095 // C++ concepts
5099 /* Objective-C++ expressions. */
5109 {
5114 }
5118 }
5120 /* An id-expression can start with either an identifier, a
5121 `::' as the beginning of a qualified-id, or the "operator"
5122 keyword. */
5127 {
5128 id_expression:
5129 cp_expr id_expression;
5130 cp_expr decl;
5136 /* Parse the id-expression. */
5137 id_expression
5154 /* If we have a template-id, then no further lookup is
5155 required. If the template-id was for a template-class, we
5156 will sometimes have a TYPE_DECL at this point. */
5160 /* Look up the name. */
5161 else
5162 {
5163 tree ambiguous_decls;
5165 /* If we already know that this lookup is ambiguous, then
5166 we've already issued an error message; there's no reason
5167 to check again. */
5170 {
5173 }
5176 none_type,
5177 template_p,
5182 /* If the lookup was ambiguous, an error will already have
5183 been issued. */
5187 /* In Objective-C++, we may have an Objective-C 2.0
5188 dot-syntax for classes here. */
5193 {
5194 tree component;
5201 component);
5202 /* Build a location of the form:
5203 expr.component
5204 ~~~~~^~~~~~~~~
5205 with caret at the start of the component name (at
5206 input_location), ranging from the start of the id_expression
5207 to the end of the component name. */
5208 location_t combined_loc
5213 }
5215 /* In Objective-C++, an instance variable (ivar) may be preferred
5216 to whatever cp_parser_lookup_name() found.
5217 Call objc_lookup_ivar. To avoid exposing cp_expr to the
5218 rest of c-family, we have to do a little extra work to preserve
5219 any location information in cp_expr "decl". Given that
5220 objc_lookup_ivar is implemented in "c-family" and "objc", we
5221 have a trip through the pure "tree" type, rather than cp_expr.
5222 Naively copying it back to "decl" would implicitly give the
5223 new cp_expr value an UNKNOWN_LOCATION for nodes that don't
5224 store an EXPR_LOCATION. Hence we only update "decl" (and
5225 hence its location_t) if we get back a different tree node. */
5227 id_expression);
5231 /* If name lookup gives us a SCOPE_REF, then the
5232 qualifying scope was dependent. */
5234 {
5235 /* At this point, we do not know if DECL is a valid
5236 integral constant expression. We assume that it is
5237 in fact such an expression, so that code like:
5239 template <int N> struct A {
5240 int a[B<N>::i];
5241 };
5243 is accepted. At template-instantiation time, we
5244 will check that B<N>::i is actually a constant. */
5246 }
5247 /* Check to see if DECL is a local variable in a context
5248 where that is forbidden. */
5251 {
5252 /* It might be that we only found DECL because we are
5253 trying to be generous with pre-ISO scoping rules.
5254 For example, consider:
5256 int i;
5257 void g() {
5258 for (int i = 0; i < 10; ++i) {}
5259 extern void f(int j = i);
5260 }
5262 Here, name look up will originally find the out
5263 of scope `i'. We need to issue a warning message,
5264 but then use the global `i'. */
5267 {
5272 }
5273 }
5274 }
5276 decl = (finish_id_expression
5278 idk,
5283 template_arg_p,
5290 }
5292 /* Anything else is an error. */
5296 }
5297 }
5305 {
5308 }
5310 /* Parse an id-expression.
5312 id-expression:
5313 unqualified-id
5314 qualified-id
5316 qualified-id:
5317 :: [opt] nested-name-specifier template [opt] unqualified-id
5318 :: identifier
5319 :: operator-function-id
5320 :: template-id
5322 Return a representation of the unqualified portion of the
5323 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
5324 a `::' or nested-name-specifier.
5326 Often, if the id-expression was a qualified-id, the caller will
5327 want to make a SCOPE_REF to represent the qualified-id. This
5328 function does not do this in order to avoid wastefully creating
5329 SCOPE_REFs when they are not required.
5331 If TEMPLATE_KEYWORD_P is true, then we have just seen the
5332 `template' keyword.
5334 If CHECK_DEPENDENCY_P is false, then names are looked up inside
5335 uninstantiated templates.
5337 If *TEMPLATE_P is non-NULL, it is set to true iff the
5338 `template' keyword is used to explicitly indicate that the entity
5339 named is a template.
5341 If DECLARATOR_P is true, the id-expression is appearing as part of
5342 a declarator, rather than as part of an expression. */
5344 static cp_expr
5351 {
5355 /* Assume the `template' keyword was not used. */
5359 /* Look for the optional `::' operator. */
5360 global_scope_p
5363 /* Look for the optional nested-name-specifier. */
5364 nested_name_specifier_p
5367 check_dependency_p,
5369 declarator_p)
5371 /* If there is a nested-name-specifier, then we are looking at
5372 the first qualified-id production. */
5374 {
5375 tree saved_scope;
5376 tree saved_object_scope;
5377 tree saved_qualifying_scope;
5378 tree unqualified_id;
5381 /* See if the next token is the `template' keyword. */
5385 /* Name lookup we do during the processing of the
5386 unqualified-id might obliterate SCOPE. */
5390 /* Process the final unqualified-id. */
5392 check_dependency_p,
5393 declarator_p,
5395 /* Restore the SAVED_SCOPE for our caller. */
5401 }
5402 /* Otherwise, if we are in global scope, then we are looking at one
5403 of the other qualified-id productions. */
5405 {
5407 tree id;
5409 /* Peek at the next token. */
5412 /* If it's an identifier, and the next token is not a "<", then
5413 we can avoid the template-id case. This is an optimization
5414 for this common case. */
5416 && !cp_parser_nth_token_starts_template_argument_list_p
5421 /* Try a template-id. */
5425 none_type,
5426 declarator_p);
5427 /* If that worked, we're done. */
5431 /* Peek at the next token. (Changes in the token buffer may
5432 have invalidated the pointer obtained above.) */
5436 {
5443 /* Fall through. */
5448 }
5449 }
5450 else
5453 declarator_p,
5454 optional_p);
5455 }
5457 /* Parse an unqualified-id.
5459 unqualified-id:
5460 identifier
5461 operator-function-id
5462 conversion-function-id
5463 ~ class-name
5464 template-id
5466 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
5467 keyword, in a construct like `A::template ...'.
5469 Returns a representation of unqualified-id. For the `identifier'
5470 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
5471 production a BIT_NOT_EXPR is returned; the operand of the
5472 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
5473 other productions, see the documentation accompanying the
5474 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
5475 names are looked up in uninstantiated templates. If DECLARATOR_P
5476 is true, the unqualified-id is appearing as part of a declarator,
5477 rather than as part of an expression. */
5479 static cp_expr
5485 {
5488 /* Peek at the next token. */
5492 {
5494 {
5495 tree id;
5497 /* We don't know yet whether or not this will be a
5498 template-id. */
5500 /* Try a template-id. */
5502 check_dependency_p,
5503 none_type,
5504 declarator_p);
5505 /* If it worked, we're done. */
5508 /* Otherwise, it's an ordinary identifier. */
5510 }
5514 check_dependency_p,
5515 none_type,
5516 declarator_p);
5519 {
5520 tree type_decl;
5521 tree qualifying_scope;
5522 tree object_scope;
5523 tree scope;
5526 /* Consume the `~' token. */
5528 /* Parse the class-name. The standard, as written, seems to
5529 say that:
5531 template <typename T> struct S { ~S (); };
5532 template <typename T> S<T>::~S() {}
5534 is invalid, since `~' must be followed by a class-name, but
5535 `S<T>' is dependent, and so not known to be a class.
5536 That's not right; we need to look in uninstantiated
5537 templates. A further complication arises from:
5539 template <typename T> void f(T t) {
5540 t.T::~T();
5541 }
5543 Here, it is not possible to look up `T' in the scope of `T'
5544 itself. We must look in both the current scope, and the
5545 scope of the containing complete expression.
5547 Yet another issue is:
5549 struct S {
5550 int S;
5551 ~S();
5552 };
5554 S::~S() {}
5556 The standard does not seem to say that the `S' in `~S'
5557 should refer to the type `S' and not the data member
5558 `S::S'. */
5560 /* DR 244 says that we look up the name after the "~" in the
5561 same scope as we looked up the qualifying name. That idea
5562 isn't fully worked out; it's more complicated than that. */
5567 /* Check for invalid scopes. */
5569 {
5573 }
5575 {
5579 scope);
5584 }
5587 /* If the name is of the form "X::~X" it's OK even if X is a
5588 typedef. */
5597 {
5600 }
5602 /* ~auto means the destructor of whatever the object is. */
5604 {
5607 "%<~auto%> only available with "
5611 }
5613 /* If there was an explicit qualification (S::~T), first look
5614 in the scope given by the qualification (i.e., S).
5616 Note: in the calls to cp_parser_class_name below we pass
5617 typename_type so that lookup finds the injected-class-name
5618 rather than the constructor. */
5622 {
5627 typename_type,
5630 declarator_p);
5633 }
5634 /* In "N::S::~S", look in "N" as well. */
5636 {
5641 type_decl
5645 typename_type,
5648 declarator_p);
5651 }
5652 /* In "p->S::~T", look in the scope given by "*p" as well. */
5654 {
5659 type_decl
5663 typename_type,
5666 declarator_p);
5669 }
5670 /* Look in the surrounding context. */
5672 {
5678 type_decl
5682 typename_type,
5685 declarator_p);
5688 {
5689 /* We couldn't find a type with this name. If we're parsing
5690 tentatively, fail and try something else. */
5692 {
5695 }
5696 /* Otherwise, accept it and check for a match at instantiation
5697 time. */
5702 }
5703 }
5704 /* If an error occurred, assume that the name of the
5705 destructor is the same as the name of the qualifying
5706 class. That allows us to keep parsing after running
5707 into ill-formed destructor names. */
5713 /* Check that destructor name and scope match. */
5715 {
5722 }
5724 /* [class.dtor]
5726 A typedef-name that names a class shall not be used as the
5727 identifier in the declarator for a destructor declaration. */
5734 type_decl);
5737 }
5741 {
5742 cp_expr id;
5744 /* This could be a template-id, so we try that first. */
5746 /* Try a template-id. */
5749 none_type,
5750 declarator_p);
5751 /* If that worked, we're done. */
5754 /* We still don't know whether we're looking at an
5755 operator-function-id or a conversion-function-id. */
5757 /* Try an operator-function-id. */
5759 /* If that didn't work, try a conversion-function-id. */
5763 {
5764 /* 17.6.3.3.5 */
5770 }
5773 }
5774 /* Fall through. */
5781 }
5782 }
5784 /* Parse an (optional) nested-name-specifier.
5786 nested-name-specifier: [C++98]
5787 class-or-namespace-name :: nested-name-specifier [opt]
5788 class-or-namespace-name :: template nested-name-specifier [opt]
5790 nested-name-specifier: [C++0x]
5791 type-name ::
5792 namespace-name ::
5793 nested-name-specifier identifier ::
5794 nested-name-specifier template [opt] simple-template-id ::
5796 PARSER->SCOPE should be set appropriately before this function is
5797 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5798 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5799 in name lookups.
5801 Sets PARSER->SCOPE to the class (TYPE) or namespace
5802 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5803 it unchanged if there is no nested-name-specifier. Returns the new
5804 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5806 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5807 part of a declaration and/or decl-specifier. */
5809 static tree
5815 {
5820 /* Remember where the nested-name-specifier starts. */
5822 {
5825 }
5828 {
5829 tree new_scope;
5830 tree old_scope;
5831 tree saved_qualifying_scope;
5834 /* Spot cases that cannot be the beginning of a
5835 nested-name-specifier. */
5838 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5839 the already parsed nested-name-specifier. */
5841 {
5842 /* Grab the nested-name-specifier and continue the loop. */
5844 /* If we originally encountered this nested-name-specifier
5845 with IS_DECLARATION set to false, we will not have
5846 resolved TYPENAME_TYPEs, so we must do so here. */
5849 {
5854 }
5857 }
5859 /* Spot cases that cannot be the beginning of a
5860 nested-name-specifier. On the second and subsequent times
5861 through the loop, we look for the `template' keyword. */
5863 ;
5864 /* A template-id can start a nested-name-specifier. */
5866 ;
5867 /* DR 743: decltype can be used in a nested-name-specifier. */
5869 ;
5870 else
5871 {
5872 /* If the next token is not an identifier, then it is
5873 definitely not a type-name or namespace-name. */
5876 /* If the following token is neither a `<' (to begin a
5877 template-id), nor a `::', then we are not looking at a
5878 nested-name-specifier. */
5884 {
5888 }
5891 && !cp_parser_nth_token_starts_template_argument_list_p
5894 }
5896 /* The nested-name-specifier is optional, so we parse
5897 tentatively. */
5900 /* Look for the optional `template' keyword, if this isn't the
5901 first time through the loop. */
5904 else
5907 /* Save the old scope since the name lookup we are about to do
5908 might destroy it. */
5911 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5912 look up names in "X<T>::I" in order to determine that "Y" is
5913 a template. So, if we have a typename at this point, we make
5914 an effort to look through it. */
5916 && !typename_keyword_p
5921 /* Parse the qualifying entity. */
5922 new_scope
5924 typename_keyword_p,
5925 template_keyword_p,
5926 check_dependency_p,
5927 type_p,
5928 is_declaration);
5929 /* Look for the `::' token. */
5932 /* If we found what we wanted, we keep going; otherwise, we're
5933 done. */
5935 {
5938 /* Restore the OLD_SCOPE since it was valid before the
5939 failed attempt at finding the last
5940 class-or-namespace-name. */
5944 /* If the next token is a decltype, and the one after that is a
5945 `::', then the decltype has failed to resolve to a class or
5946 enumeration type. Give this error even when parsing
5947 tentatively since it can't possibly be valid--and we're going
5948 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5949 won't get another chance.*/
5953 {
5960 /* As below. */
5963 }
5967 {
5968 /* If we have a non-type template-id followed by ::, it can't
5969 possibly be valid. */
5974 {
5977 {
5983 }
5984 else
5985 {
5986 /* Variable template. */
5991 }
5998 /* As below. */
6002 }
6003 }
6007 /* If the next token is an identifier, and the one after
6008 that is a `::', then any valid interpretation would have
6009 found a class-or-namespace-name. */
6015 {
6018 {
6020 {
6021 tree decl;
6022 tree ambiguous_decls;
6025 none_type,
6034 decl);
6036 {
6037 // cp_parser_lookup_name has the same diagnostic,
6038 // thus make sure to emit it at most once.
6041 {
6046 }
6048 }
6049 else
6050 {
6052 cp_parser_name_lookup_error
6055 else
6056 cp_parser_name_lookup_error
6059 }
6060 }
6063 /* Treat this as a successful nested-name-specifier
6064 due to:
6066 [basic.lookup.qual]
6068 If the name found is not a class-name (clause
6069 _class_) or namespace-name (_namespace.def_), the
6070 program is ill-formed. */
6072 }
6074 }
6076 }
6077 /* We've found one valid nested-name-specifier. */
6079 /* Name lookup always gives us a DECL. */
6082 /* Uses of "template" must be followed by actual templates. */
6094 new_scope);
6095 /* If it is a class scope, try to complete it; we are about to
6096 be looking up names inside the class. */
6098 /* Since checking types for dependency can be expensive,
6099 avoid doing it if the type is already complete. */
6101 /* Do not try to complete dependent types. */
6103 {
6105 /* If it is a typedef to current class, use the current
6106 class instead, as the typedef won't have any names inside
6107 it yet. */
6111 }
6112 /* Make sure we look in the right scope the next time through
6113 the loop. */
6115 }
6117 /* If parsing tentatively, replace the sequence of tokens that makes
6118 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
6119 token. That way, should we re-parse the token stream, we will
6120 not have to repeat the effort required to do the parse, nor will
6121 we issue duplicate error messages. */
6123 {
6127 /* Reset the contents of the START token. */
6129 /* Retrieve any deferred checks. Do not pop this access checks yet
6130 so the memory will not be reclaimed during token replacing below. */
6138 /* Purge all subsequent tokens. */
6140 }
6146 }
6148 /* Parse a nested-name-specifier. See
6149 cp_parser_nested_name_specifier_opt for details. This function
6150 behaves identically, except that it will an issue an error if no
6151 nested-name-specifier is present. */
6153 static tree
6159 {
6160 tree scope;
6162 /* Look for the nested-name-specifier. */
6164 typename_keyword_p,
6165 check_dependency_p,
6166 type_p,
6167 is_declaration);
6168 /* If it was not present, issue an error message. */
6170 {
6173 }
6176 }
6178 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
6179 this is either a class-name or a namespace-name (which corresponds
6180 to the class-or-namespace-name production in the grammar). For
6181 C++0x, it can also be a type-name that refers to an enumeration
6182 type or a simple-template-id.
6184 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
6185 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
6186 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
6187 TYPE_P is TRUE iff the next name should be taken as a class-name,
6188 even the same name is declared to be another entity in the same
6189 scope.
6191 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
6192 specified by the class-or-namespace-name. If neither is found the
6193 ERROR_MARK_NODE is returned. */
6195 static tree
6202 {
6203 tree saved_scope;
6204 tree saved_qualifying_scope;
6205 tree saved_object_scope;
6206 tree scope;
6210 /* DR 743: decltype can appear in a nested-name-specifier. */
6212 {
6216 {
6219 }
6223 }
6225 /* Before we try to parse the class-name, we must save away the
6226 current PARSER->SCOPE since cp_parser_class_name will destroy
6227 it. */
6231 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
6232 there is no need to look for a namespace-name. */
6233 only_class_p = template_keyword_p
6238 typename_keyword_p,
6239 template_keyword_p,
6241 check_dependency_p,
6243 is_declaration,
6246 /* If that didn't work, try for a namespace-name. */
6248 {
6249 /* Restore the saved scope. */
6253 /* If we are not looking at an identifier followed by the scope
6254 resolution operator, then this is not part of a
6255 nested-name-specifier. (Note that this function is only used
6256 to parse the components of a nested-name-specifier.) */
6261 }
6264 }
6266 /* Return true if we are looking at a compound-literal, false otherwise. */
6268 static bool
6270 {
6271 /* Consume the `('. */
6276 /* Skip tokens until the next token is a closing parenthesis.
6277 If we find the closing `)', and the next token is a `{', then
6278 we are looking at a compound-literal. */
6279 bool compound_literal_p
6284 /* Roll back the tokens we skipped. */
6288 }
6290 /* Parse a postfix-expression.
6292 postfix-expression:
6293 primary-expression
6294 postfix-expression [ expression ]
6295 postfix-expression ( expression-list [opt] )
6296 simple-type-specifier ( expression-list [opt] )
6297 typename :: [opt] nested-name-specifier identifier
6298 ( expression-list [opt] )
6299 typename :: [opt] nested-name-specifier template [opt] template-id
6300 ( expression-list [opt] )
6301 postfix-expression . template [opt] id-expression
6302 postfix-expression -> template [opt] id-expression
6303 postfix-expression . pseudo-destructor-name
6304 postfix-expression -> pseudo-destructor-name
6305 postfix-expression ++
6306 postfix-expression --
6307 dynamic_cast < type-id > ( expression )
6308 static_cast < type-id > ( expression )
6309 reinterpret_cast < type-id > ( expression )
6310 const_cast < type-id > ( expression )
6311 typeid ( expression )
6312 typeid ( type-id )
6314 GNU Extension:
6316 postfix-expression:
6317 ( type-id ) { initializer-list , [opt] }
6319 This extension is a GNU version of the C99 compound-literal
6320 construct. (The C99 grammar uses `type-name' instead of `type-id',
6321 but they are essentially the same concept.)
6323 If ADDRESS_P is true, the postfix expression is the operand of the
6324 `&' operator. CAST_P is true if this expression is the target of a
6325 cast.
6327 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
6328 class member access expressions [expr.ref].
6330 Returns a representation of the expression. */
6332 static cp_expr
6336 {
6338 location_t loc;
6345 /* Peek at the next token. */
6350 /* Some of the productions are determined by keywords. */
6353 {
6358 {
6359 tree type;
6360 cp_expr expression;
6364 /* All of these can be handled in the same way from the point
6365 of view of parsing. Begin by consuming the token
6366 identifying the cast. */
6369 /* New types cannot be defined in the cast. */
6371 parser->type_definition_forbidden_message
6374 /* Look for the opening `<'. */
6376 /* Parse the type to which we are casting. */
6381 /* Look for the closing `>'. */
6383 /* Restore the old message. */
6386 bool saved_greater_than_is_operator_p
6390 /* And the expression which is being cast. */
6394 RT_CLOSE_PAREN);
6398 parser->greater_than_is_operator_p
6401 /* Only type conversions to integral or enumeration types
6402 can be used in constant-expressions. */
6408 {
6410 postfix_expression
6414 postfix_expression
6418 postfix_expression
6420 tf_warning_or_error);
6423 postfix_expression
6428 }
6430 /* Construct a location e.g. :
6431 reinterpret_cast <int *> (expr)
6432 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
6433 ranging from the start of the "*_cast" token to the final closing
6434 paren, with the caret at the start. */
6437 }
6441 {
6442 tree type;
6446 /* Consume the `typeid' token. */
6448 /* Look for the `(' token. */
6450 /* Types cannot be defined in a `typeid' expression. */
6452 parser->type_definition_forbidden_message
6454 /* We can't be sure yet whether we're looking at a type-id or an
6455 expression. */
6457 /* Try a type-id first. */
6462 /* Look for the `)' token. Otherwise, we can't be sure that
6463 we're not looking at an expression: consider `typeid (int
6464 (3))', for example. */
6466 /* If all went well, simply lookup the type-id. */
6469 /* Otherwise, fall back to the expression variant. */
6470 else
6471 {
6472 tree expression;
6474 /* Look for an expression. */
6476 /* Compute its typeid. */
6478 /* Look for the `)' token. */
6480 }
6481 /* Restore the saved message. */
6483 /* `typeid' may not appear in an integral constant expression. */
6486 }
6490 {
6491 tree type;
6492 /* The syntax permitted here is the same permitted for an
6493 elaborated-type-specifier. */
6500 }
6504 {
6505 location_t cilk_spawn_loc
6510 {
6515 }
6517 {
6522 }
6523 else
6524 {
6525 /* Consecutive _Cilk_spawns are not allowed in a statement. */
6528 }
6530 postfix_expression =
6534 {
6538 }
6540 {
6545 }
6546 else
6547 {
6550 postfix_expression);
6551 /* Build a location of the form:
6552 _Cilk_spawn expr
6553 ~~~~~~~~~~~~^~~~
6554 with caret at the expr, ranging from the start of the
6555 _Cilk_spawn token to the end of the expression. */
6556 location_t combined_loc =
6562 }
6564 }
6567 {
6570 tree p;
6584 tf_warning_or_error);
6587 tf_warning_or_error);
6588 else
6589 {
6593 }
6595 }
6598 {
6599 tree type;
6601 /* If the next thing is a simple-type-specifier, we may be
6602 looking at a functional cast. We could also be looking at
6603 an id-expression. So, we try the functional cast, and if
6604 that doesn't work we fall back to the primary-expression. */
6606 /* Look for the simple-type-specifier. */
6610 CP_PARSER_FLAGS_NONE);
6612 /* Parse the cast itself. */
6614 postfix_expression
6616 /* If that worked, we're done. */
6620 /* If the functional-cast didn't work out, try a
6621 compound-literal. */
6624 {
6629 /* Avoid calling cp_parser_type_id pointlessly, see comment
6630 in cp_parser_cast_expression about c++/29234. */
6633 else
6634 {
6635 /* Parse the type. */
6640 /* Look for the `)'. */
6642 }
6644 /* If things aren't going well, there's no need to
6645 keep going. */
6647 {
6649 /* Parse the brace-enclosed initializer list. */
6652 }
6653 /* If that worked, we're definitely looking at a
6654 compound-literal expression. */
6656 {
6657 /* Warn the user that a compound literal is not
6658 allowed in standard C++. */
6661 /* For simplicity, we disallow compound literals in
6662 constant-expressions. We could
6663 allow compound literals of integer type, whose
6664 initializer was a constant, in constant
6665 expressions. Permitting that usage, as a further
6666 extension, would not change the meaning of any
6667 currently accepted programs. (Of course, as
6668 compound literals are not part of ISO C++, the
6669 standard has nothing to say.) */
6671 NIC_NCC))
6672 {
6675 }
6676 /* Form the representation of the compound-literal. */
6677 postfix_expression
6679 tf_warning_or_error);
6682 }
6683 }
6685 /* It must be a primary-expression. */
6686 postfix_expression
6689 decltype_p,
6691 }
6693 }
6695 /* Note that we don't need to worry about calling build_cplus_new on a
6696 class-valued CALL_EXPR in decltype when it isn't the end of the
6697 postfix-expression; unary_complex_lvalue will take care of that for
6698 all these cases. */
6700 /* Keep looping until the postfix-expression is complete. */
6702 {
6706 /* It is not a Koenig lookup function call. */
6707 postfix_expression
6710 /* Peek at the next token. */
6714 {
6717 {
6719 "two consecutive %<[%> shall "
6722 }
6723 postfix_expression
6725 postfix_expression,
6727 decltype_p);
6736 /* postfix-expression ( expression-list [opt] ) */
6737 {
6748 is_builtin_constant_p
6751 {
6752 /* The whole point of __builtin_constant_p is to allow
6753 non-constant expressions to appear as arguments. */
6754 saved_integral_constant_expression_p
6756 saved_non_integral_constant_expression_p
6759 }
6760 args = (cp_parser_parenthesized_expression_list
6766 {
6767 parser->integral_constant_expression_p
6769 parser->non_integral_constant_expression_p
6771 }
6774 {
6777 }
6779 /* Function calls are not permitted in
6780 constant-expressions. */
6783 NIC_FUNC_CALL))
6784 {
6788 }
6793 {
6795 {
6797 {
6800 postfix_expression
6802 complain);
6803 }
6804 else
6805 postfix_expression
6807 }
6808 /* We do not perform argument-dependent lookup if
6809 normal lookup finds a non-function, in accordance
6810 with the expected resolution of DR 218. */
6813 {
6817 /* Do not do argument dependent lookup if regular
6818 lookup finds a member function or a block-scope
6819 function declaration. [basic.lookup.argdep]/3 */
6822 {
6825 postfix_expression
6827 complain);
6828 }
6829 }
6830 }
6833 {
6843 "%<memset%> used with constant zero length "
6844 "parameter; this could be due to transposed "
6846 }
6849 {
6859 {
6860 postfix_expression
6864 }
6867 {
6868 postfix_expression
6869 = (build_new_method_call
6875 complain));
6876 }
6877 else
6878 postfix_expression
6882 complain);
6883 }
6887 postfix_expression = (build_offset_ref_call_from_tree
6889 complain));
6891 /* A call to a static class member, or a namespace-scope
6892 function. */
6893 postfix_expression
6896 koenig_p,
6897 complain);
6898 else
6899 /* All other function calls. */
6900 postfix_expression
6903 koenig_p,
6904 complain);
6907 {
6909 start_loc,
6910 close_paren_loc);
6912 }
6914 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6918 }
6923 /* postfix-expression . template [opt] id-expression
6924 postfix-expression . pseudo-destructor-name
6925 postfix-expression -> template [opt] id-expression
6926 postfix-expression -> pseudo-destructor-name */
6928 /* Consume the `.' or `->' operator. */
6931 postfix_expression
6933 postfix_expression,
6940 /* postfix-expression ++ */
6941 /* Consume the `++' token. */
6943 /* Generate a representation for the complete expression. */
6944 postfix_expression
6946 POSTINCREMENT_EXPR);
6947 /* Increments may not appear in constant-expressions. */
6955 /* postfix-expression -- */
6956 /* Consume the `--' token. */
6958 /* Generate a representation for the complete expression. */
6959 postfix_expression
6961 POSTDECREMENT_EXPR);
6962 /* Decrements may not appear in constant-expressions. */
6973 return is_member_access
6974 ? postfix_expression
6976 else
6978 }
6979 }
6981 /* We should never get here. */
6984 }
6986 /* This function parses Cilk Plus array notations. If a normal array expr. is
6987 parsed then the array index is passed back to the caller through *INIT_INDEX
6988 and the function returns a NULL_TREE. If array notation expr. is parsed,
6989 then *INIT_INDEX is ignored by the caller and the function returns
6990 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6991 error_mark_node. */
6993 static tree
6995 tree array_value)
6996 {
7000 {
7003 }
7012 {
7015 }
7017 {
7018 /* Consume the ':'. */
7021 /* If we are here, then we have a case like this A[:]. */
7023 {
7027 }
7031 }
7032 else
7033 {
7034 /* If we are here, then there are three valid possibilities:
7035 1. ARRAY [ EXP ]
7036 2. ARRAY [ EXP : EXP ]
7037 3. ARRAY [ EXP : EXP : EXP ] */
7041 {
7042 /* This indicates that we have a normal array expression. */
7045 }
7047 /* Consume the ':'. */
7051 {
7054 }
7055 }
7060 {
7064 }
7070 }
7072 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7073 by cp_parser_builtin_offsetof. We're looking for
7075 postfix-expression [ expression ]
7076 postfix-expression [ braced-init-list ] (C++11)
7078 FOR_OFFSETOF is set if we're being called in that context, which
7079 changes how we deal with integer constant expressions. */
7081 static tree
7083 tree postfix_expression,
7086 {
7091 /* Consume the `[' token. */
7097 /* Parse the index expression. */
7098 /* ??? For offsetof, there is a question of what to allow here. If
7099 offsetof is not being used in an integral constant expression context,
7100 then we *could* get the right answer by computing the value at runtime.
7101 If we are in an integral constant expression context, then we might
7102 could accept any constant expression; hard to say without analysis.
7103 Rather than open the barn door too wide right away, allow only integer
7104 constant expressions here. */
7107 else
7108 {
7110 {
7117 {
7119 "braced list index is not allowed with array "
7123 }
7124 }
7126 {
7127 /* Here are have these two options:
7128 ARRAY[EXP : EXP] - Array notation expr with default
7129 stride of 1.
7130 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
7131 stride. */
7133 postfix_expression);
7136 }
7137 else
7139 }
7143 /* Look for the closing `]'. */
7146 /* Build the ARRAY_REF. */
7150 /* When not doing offsetof, array references are not permitted in
7151 constant-expressions. */
7157 }
7159 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
7160 by cp_parser_builtin_offsetof. We're looking for
7162 postfix-expression . template [opt] id-expression
7163 postfix-expression . pseudo-destructor-name
7164 postfix-expression -> template [opt] id-expression
7165 postfix-expression -> pseudo-destructor-name
7167 FOR_OFFSETOF is set if we're being called in that context. That sorta
7168 limits what of the above we'll actually accept, but nevermind.
7169 TOKEN_TYPE is the "." or "->" token, which will already have been
7170 removed from the stream. */
7172 static tree
7175 cp_expr postfix_expression,
7177 location_t location)
7178 {
7179 tree name;
7185 /* If this is a `->' operator, dereference the pointer. */
7188 tf_warning_or_error);
7189 /* Check to see whether or not the expression is type-dependent. */
7191 /* The identifier following the `->' or `.' is not qualified. */
7197 /* Enter the scope corresponding to the type of the object
7198 given by the POSTFIX_EXPRESSION. */
7200 {
7202 /* According to the standard, no expression should ever have
7203 reference type. Unfortunately, we do not currently match
7204 the standard in this respect in that our internal representation
7205 of an expression may have reference type even when the standard
7206 says it does not. Therefore, we have to manually obtain the
7207 underlying type here. */
7209 /* The type of the POSTFIX_EXPRESSION must be complete. */
7211 {
7215 }
7216 /* Unlike the object expression in other contexts, *this is not
7217 required to be of complete type for purposes of class member
7218 access (5.2.5) outside the member function body. */
7222 /* Let the name lookup machinery know that we are processing a
7223 class member access expression. */
7225 /* If something went wrong, we want to be able to discern that case,
7226 as opposed to the case where there was no SCOPE due to the type
7227 of expression being dependent. */
7230 /* If the SCOPE was erroneous, make the various semantic analysis
7231 functions exit quickly -- and without issuing additional error
7232 messages. */
7235 }
7236 else
7237 /* Tell cp_parser_lookup_name that there was an object, even though it's
7238 type-dependent. */
7241 /* Assume this expression is not a pseudo-destructor access. */
7244 /* If the SCOPE is a scalar type, then, if this is a valid program,
7245 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
7246 is type dependent, it can be pseudo-destructor-name or something else.
7247 Try to parse it as pseudo-destructor-name first. */
7249 {
7250 tree s;
7251 tree type;
7254 /* Parse the pseudo-destructor-name. */
7263 {
7265 postfix_expression
7268 }
7269 }
7272 {
7273 /* If the SCOPE is not a scalar type, we are looking at an
7274 ordinary class member access expression, rather than a
7275 pseudo-destructor-name. */
7278 /* Parse the id-expression. */
7279 name = (cp_parser_id_expression
7286 /* In general, build a SCOPE_REF if the member name is qualified.
7287 However, if the name was not dependent and has already been
7288 resolved; there is no need to build the SCOPE_REF. For example;
7290 struct X { void f(); };
7291 template <typename T> void f(T* t) { t->X::f(); }
7293 Even though "t" is dependent, "X::f" is not and has been resolved
7294 to a BASELINK; there is no need to include scope information. */
7296 /* But we do need to remember that there was an explicit scope for
7297 virtual function calls. */
7301 /* If the name is a template-id that names a type, we will get a
7302 TYPE_DECL here. That is invalid code. */
7304 {
7307 }
7308 else
7309 {
7311 {
7313 {
7317 }
7318 else
7321 name,
7322 template_p);
7326 }
7328 adjust_result_of_qualified_name_lookup
7330 postfix_expression
7332 template_p,
7333 tf_warning_or_error);
7334 /* Build a location e.g.:
7335 ptr->access_expr
7336 ~~~^~~~~~~~~~~~~
7337 where the caret is at the deref token, ranging from
7338 the start of postfix_expression to the end of the access expr. */
7339 location_t end_loc
7341 location_t combined_loc
7344 }
7345 }
7347 /* We no longer need to look up names in the scope of the object on
7348 the left-hand side of the `.' or `->' operator. */
7351 /* Outside of offsetof, these operators may not appear in
7352 constant-expressions. */
7354 && (cp_parser_non_integral_constant_expression
7359 }
7361 /* Parse a parenthesized expression-list.
7363 expression-list:
7364 assignment-expression
7365 expression-list, assignment-expression
7367 attribute-list:
7368 expression-list
7369 identifier
7370 identifier, expression-list
7372 CAST_P is true if this expression is the target of a cast.
7374 ALLOW_EXPANSION_P is true if this expression allows expansion of an
7375 argument pack.
7377 Returns a vector of trees. Each element is a representation of an
7378 assignment-expression. NULL is returned if the ( and or ) are
7379 missing. An empty, but allocated, vector is returned on no
7380 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
7381 if we are parsing an attribute list for an attribute that wants a
7382 plain identifier argument, normal_attr for an attribute that wants
7383 an expression, or non_attr if we aren't parsing an attribute list. If
7384 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
7385 not all of the expressions in the list were constant.
7386 If CLOSE_PAREN_LOC is non-NULL, and no errors occur, then *CLOSE_PAREN_LOC
7387 will be written to with the location of the closing parenthesis. If
7388 an error occurs, it may or may not be written to. */
7397 {
7403 /* Assume all the expressions will be constant. */
7412 /* Within a parenthesized expression, a `>' token is always
7413 the greater-than operator. */
7414 saved_greater_than_is_operator_p
7418 /* Consume expressions until there are no more. */
7421 {
7422 tree expr;
7424 /* At the beginning of attribute lists, check to see if the
7425 next token is an identifier. */
7428 {
7431 /* Consume the identifier. */
7433 /* Save the identifier. */
7435 }
7436 else
7437 {
7440 /* Parse the next assignment-expression. */
7442 {
7443 /* A braced-init-list. */
7449 }
7451 {
7452 expr = (cp_parser_constant_expression
7457 }
7458 else
7460 cast_p);
7465 /* If we have an ellipsis, then this is an expression
7466 expansion. */
7469 {
7470 /* Consume the `...'. */
7473 /* Build the argument pack. */
7475 }
7477 /* Add it to the list. We add error_mark_node
7478 expressions to the list, so that we can still tell if
7479 the correct form for a parenthesized expression-list
7480 is found. That gives better errors. */
7485 }
7487 /* After the first item, attribute lists look the same as
7488 expression lists. */
7491 get_comma:;
7492 /* If the next token isn't a `,', then we are done. */
7496 /* Otherwise, consume the `,' and keep going. */
7498 }
7504 {
7507 skip_comma:;
7508 /* We try and resync to an unnested comma, as that will give the
7509 user better diagnostics. */
7517 {
7518 parser->greater_than_is_operator_p
7521 }
7522 }
7524 parser->greater_than_is_operator_p
7531 }
7533 /* Parse a pseudo-destructor-name.
7535 pseudo-destructor-name:
7536 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7537 :: [opt] nested-name-specifier template template-id :: ~ type-name
7538 :: [opt] nested-name-specifier [opt] ~ type-name
7540 If either of the first two productions is used, sets *SCOPE to the
7541 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7542 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7543 or ERROR_MARK_NODE if the parse fails. */
7545 static void
7547 tree object,
7550 {
7553 /* Handle ~auto. */
7557 {
7560 "%<~auto%> only available with "
7567 }
7569 /* Assume that things will not work out. */
7572 /* Look for the optional `::' operator. */
7574 /* Look for the optional nested-name-specifier. */
7575 nested_name_specifier_p
7582 /* Now, if we saw a nested-name-specifier, we might be doing the
7583 second production. */
7586 {
7587 /* Consume the `template' keyword. */
7589 /* Parse the template-id. */
7593 class_type,
7595 /* Look for the `::' token. */
7597 }
7598 /* If the next token is not a `~', then there might be some
7599 additional qualification. */
7601 {
7602 /* At this point, we're looking for "type-name :: ~". The type-name
7603 must not be a class-name, since this is a pseudo-destructor. So,
7604 it must be either an enum-name, or a typedef-name -- both of which
7605 are just identifiers. So, we peek ahead to check that the "::"
7606 and "~" tokens are present; if they are not, then we can avoid
7607 calling type_name. */
7611 {
7614 }
7616 /* Look for the type-name. */
7621 /* Look for the `::' token. */
7623 }
7624 else
7627 /* Look for the `~'. */
7630 /* Once we see the ~, this has to be a pseudo-destructor. */
7634 /* Look for the type-name again. We are not responsible for
7635 checking that it matches the first type-name. */
7637 }
7639 /* Parse a unary-expression.
7641 unary-expression:
7642 postfix-expression
7643 ++ cast-expression
7644 -- cast-expression
7645 unary-operator cast-expression
7646 sizeof unary-expression
7647 sizeof ( type-id )
7648 alignof ( type-id ) [C++0x]
7649 new-expression
7650 delete-expression
7652 GNU Extensions:
7654 unary-expression:
7655 __extension__ cast-expression
7656 __alignof__ unary-expression
7657 __alignof__ ( type-id )
7658 alignof unary-expression [C++0x]
7659 __real__ cast-expression
7660 __imag__ cast-expression
7661 && identifier
7662 sizeof ( type-id ) { initializer-list , [opt] }
7663 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7664 __alignof__ ( type-id ) { initializer-list , [opt] }
7666 ADDRESS_P is true iff the unary-expression is appearing as the
7667 operand of the `&' operator. CAST_P is true if this expression is
7668 the target of a cast.
7670 Returns a representation of the expression. */
7672 static cp_expr
7675 {
7679 /* Peek at the next token. */
7681 /* Some keywords give away the kind of expression. */
7683 {
7687 {
7690 {
7693 location_t first_loc;
7696 /* Consume the token. */
7699 /* Parse the operand. */
7704 else
7705 {
7706 /* ISO C++ defines alignof only with types, not with
7707 expressions. So pedwarn if alignof is used with a non-
7708 type expression. However, __alignof__ is ok. */
7711 "ISO C++ does not allow %<alignof%> "
7715 }
7716 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7717 SIZEOF_EXPR with the original operand. */
7719 {
7721 {
7723 {
7726 error_mark_node));
7728 }
7729 else
7733 }
7735 }
7737 }
7746 {
7747 /* The saved value of the PEDANTIC flag. */
7749 tree expr;
7751 /* Save away the PEDANTIC flag. */
7753 /* Parse the cast-expression. */
7755 /* Restore the PEDANTIC flag. */
7759 }
7763 {
7764 tree expression;
7766 /* Consume the `__real__' or `__imag__' token. */
7768 /* Parse the cast-expression. */
7770 /* Create the complete representation. */
7774 expression,
7775 tf_warning_or_error);
7776 }
7784 {
7785 tree expr;
7795 parser->type_definition_forbidden_message
7798 saved_integral_constant_expression_p
7800 saved_non_integral_constant_expression_p
7804 saved_greater_than_is_operator_p
7816 parser->greater_than_is_operator_p
7819 parser->integral_constant_expression_p
7821 parser->non_integral_constant_expression_p
7828 }
7832 }
7833 }
7835 /* Look for the `:: new' and `:: delete', which also signal the
7836 beginning of a new-expression, or delete-expression,
7837 respectively. If the next token is `::', then it might be one of
7838 these. */
7840 {
7843 /* See if the token after the `::' is one of the keywords in
7844 which we're interested. */
7846 /* If it's `new', we have a new-expression. */
7849 /* Similarly, for `delete'. */
7852 }
7854 /* Look for a unary operator. */
7856 /* The `++' and `--' operators can be handled similarly, even though
7857 they are not technically unary-operators in the grammar. */
7859 {
7864 /* Handle the GNU address-of-label extension. */
7867 {
7868 tree identifier;
7869 tree expression;
7872 /* Consume the '&&' token. */
7874 /* Look for the identifier. */
7875 location_t finish_loc
7878 /* Construct a location of the form:
7879 &&label
7880 ^~~~~~~
7881 with caret==start at the "&&", finish at the end of the label. */
7882 location_t combined_loc
7884 /* Create an expression representing the address. */
7887 NIC_ADDR_LABEL))
7890 }
7891 }
7893 {
7894 cp_expr cast_expression;
7900 /* Consume the operator token. */
7904 /* Parse the cast-expression. */
7905 cast_expression
7910 pidk);
7912 /* Make a location:
7913 OP_TOKEN CAST_EXPRESSION
7914 ^~~~~~~~~~~~~~~~~~~~~~~~~
7915 with start==caret at the operator token, and
7916 extending to the end of the cast_expression. */
7919 /* Now, build an appropriate representation. */
7921 {
7925 RO_UNARY_STAR,
7926 complain);
7927 /* TODO: build_x_indirect_ref does not always honor the
7928 location, so ensure it is set. */
7934 /* Fall through. */
7937 cast_expression,
7938 complain);
7939 /* TODO: build_x_unary_op does not always honor the location,
7940 so ensure it is set. */
7948 /* Fall through. */
7950 /* Immediately fold negation of a constant, unless the constant is 0
7951 (since -0 == 0) or it would overflow. */
7956 {
7959 cast_expression);
7961 {
7964 }
7965 }
7966 /* Fall through. */
7975 }
7979 non_constant_p))
7983 }
7987 decltype_p,
7988 pidk);
7989 }
7991 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7992 unary-operator, the corresponding tree code is returned. */
7994 static enum tree_code
7996 {
7998 {
8019 }
8020 }
8022 /* Parse a new-expression.
8024 new-expression:
8025 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
8026 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
8028 Returns a representation of the expression. */
8030 static tree
8032 {
8035 tree type;
8038 tree ret;
8042 /* Look for the optional `::' operator. */
8043 global_scope_p
8047 /* Look for the `new' operator. */
8049 /* There's no easy way to tell a new-placement from the
8050 `( type-id )' construct. */
8052 /* Look for a new-placement. */
8054 /* If that didn't work out, there's no new-placement. */
8056 {
8060 }
8062 /* If the next token is a `(', then we have a parenthesized
8063 type-id. */
8065 {
8069 /* Consume the `('. */
8072 /* Parse the type-id. */
8073 parser->type_definition_forbidden_message
8075 {
8078 }
8081 /* Look for the closing `)'. */
8084 /* There should not be a direct-new-declarator in this production,
8085 but GCC used to allowed this, so we check and emit a sensible error
8086 message for this case. */
8088 {
8094 }
8095 }
8096 /* Otherwise, there must be a new-type-id. */
8097 else
8100 /* If the next token is a `(' or '{', then we have a new-initializer. */
8105 else
8108 /* A new-expression may not appear in an integral constant
8109 expression. */
8112 /* 5.3.4/2: "If the auto type-specifier appears in the type-specifier-seq
8113 of a new-type-id or type-id of a new-expression, the new-expression shall
8114 contain a new-initializer of the form ( assignment-expression )".
8115 Additionally, consistently with the spirit of DR 1467, we want to accept
8116 'new auto { 2 }' too. */
8121 {
8123 "initialization of new-expression for type %<auto%> "
8126 }
8127 else
8128 {
8129 /* Construct a location e.g.:
8130 ptr = new int[100]
8131 ^~~~~~~~~~~~
8132 with caret == start at the start of the "new" token, and the end
8133 at the end of the final token we consumed. */
8138 /* Create a representation of the new-expression. */
8140 tf_warning_or_error);
8142 }
8150 }
8152 /* Parse a new-placement.
8154 new-placement:
8155 ( expression-list )
8157 Returns the same representation as for an expression-list. */
8161 {
8164 /* Parse the expression-list. */
8165 expression_list = (cp_parser_parenthesized_expression_list
8174 }
8176 /* Parse a new-type-id.
8178 new-type-id:
8179 type-specifier-seq new-declarator [opt]
8181 Returns the TYPE allocated. If the new-type-id indicates an array
8182 type, *NELTS is set to the number of elements in the last array
8183 bound; the TYPE will not include the last array bound. */
8185 static tree
8187 {
8188 cp_decl_specifier_seq type_specifier_seq;
8194 /* The type-specifier sequence must not contain type definitions.
8195 (It cannot contain declarations of new types either, but if they
8196 are not definitions we will catch that because they are not
8197 complete.) */
8199 parser->type_definition_forbidden_message
8201 /* Parse the type-specifier-seq. */
8205 /* Restore the old message. */
8211 /* Parse the new-declarator. */
8214 /* Determine the number of elements in the last array dimension, if
8215 any. */
8217 /* Skip down to the last array dimension. */
8222 {
8225 }
8230 {
8233 }
8236 {
8243 else
8245 }
8248 }
8250 /* Parse an (optional) new-declarator.
8252 new-declarator:
8253 ptr-operator new-declarator [opt]
8254 direct-new-declarator
8256 Returns the declarator. */
8260 {
8263 cp_cv_quals cv_quals;
8265 /* We don't know if there's a ptr-operator next, or not. */
8267 /* Look for a ptr-operator. */
8269 /* If that worked, look for more new-declarators. */
8271 {
8274 /* Parse another optional declarator. */
8277 declarator = cp_parser_make_indirect_declarator
8281 }
8283 /* If the next token is a `[', there is a direct-new-declarator. */
8288 }
8290 /* Parse a direct-new-declarator.
8292 direct-new-declarator:
8293 [ expression ]
8294 direct-new-declarator [constant-expression]
8296 */
8300 {
8304 {
8305 tree expression;
8308 /* Look for the opening `['. */
8313 /* The standard requires that the expression have integral
8314 type. DR 74 adds enumeration types. We believe that the
8315 real intent is that these expressions be handled like the
8316 expression in a `switch' condition, which also allows
8317 classes with a single conversion to integral or
8318 enumeration type. */
8320 {
8321 expression
8323 expression,
8326 {
8328 "expression in new-declarator must have integral "
8331 }
8332 }
8334 /* Look for the closing `]'. */
8337 /* Add this bound to the declarator. */
8340 /* If the next token is not a `[', then there are no more
8341 bounds. */
8344 }
8347 }
8349 /* Parse a new-initializer.
8351 new-initializer:
8352 ( expression-list [opt] )
8353 braced-init-list
8355 Returns a representation of the expression-list. */
8359 {
8363 {
8364 tree t;
8371 }
8372 else
8373 expression_list = (cp_parser_parenthesized_expression_list
8379 }
8381 /* Parse a delete-expression.
8383 delete-expression:
8384 :: [opt] delete cast-expression
8385 :: [opt] delete [ ] cast-expression
8387 Returns a representation of the expression. */
8389 static tree
8391 {
8394 tree expression;
8396 /* Look for the optional `::' operator. */
8397 global_scope_p
8401 /* Look for the `delete' keyword. */
8403 /* See if the array syntax is in use. */
8405 {
8406 /* Consume the `[' token. */
8408 /* Look for the `]' token. */
8410 /* Remember that this is the `[]' construct. */
8412 }
8413 else
8416 /* Parse the cast-expression. */
8419 /* A delete-expression may not appear in an integral constant
8420 expression. */
8425 tf_warning_or_error);
8426 }
8428 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
8429 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
8430 0 otherwise. */
8432 static int
8434 {
8437 {
8479 /* In ((type ()) () the last () isn't a valid cast-expression,
8480 so the whole must be parsed as postfix-expression. */
8485 /* '[' may start a primary-expression in obj-c++ and in C++11,
8486 as a lambda-expression, eg, '(void)[]{}'. */
8493 /* '++' and '--' may or may not start a cast-expression:
8495 struct T { void operator++(int); };
8496 void f() { (T())++; }
8498 vs
8500 int a;
8501 (int)++a; */
8506 }
8507 }
8509 /* Parse a cast-expression.
8511 cast-expression:
8512 unary-expression
8513 ( type-id ) cast-expression
8515 ADDRESS_P is true iff the unary-expression is appearing as the
8516 operand of the `&' operator. CAST_P is true if this expression is
8517 the target of a cast.
8519 Returns a representation of the expression. */
8521 static cp_expr
8524 {
8525 /* If it's a `(', then we might be looking at a cast. */
8527 {
8533 /* There's no way to know yet whether or not this is a cast.
8534 For example, `(int (3))' is a unary-expression, while `(int)
8535 3' is a cast. So, we resort to parsing tentatively. */
8537 /* Types may not be defined in a cast. */
8539 parser->type_definition_forbidden_message
8541 /* Consume the `('. */
8545 /* A very tricky bit is that `(struct S) { 3 }' is a
8546 compound-literal (which we permit in C++ as an extension).
8547 But, that construct is not a cast-expression -- it is a
8548 postfix-expression. (The reason is that `(struct S) { 3 }.i'
8549 is legal; if the compound-literal were a cast-expression,
8550 you'd need an extra set of parentheses.) But, if we parse
8551 the type-id, and it happens to be a class-specifier, then we
8552 will commit to the parse at that point, because we cannot
8553 undo the action that is done when creating a new class. So,
8554 then we cannot back up and do a postfix-expression.
8556 Another tricky case is the following (c++/29234):
8558 struct S { void operator () (); };
8560 void foo ()
8561 {
8562 ( S()() );
8563 }
8565 As a type-id we parse the parenthesized S()() as a function
8566 returning a function, groktypename complains and we cannot
8567 back up in this case either.
8569 Therefore, we scan ahead to the closing `)', and check to see
8570 if the tokens after the `)' can start a cast-expression. Otherwise
8571 we are dealing with an unary-expression, a postfix-expression
8572 or something else.
8574 Yet another tricky case, in C++11, is the following (c++/54891):
8576 (void)[]{};
8578 The issue is that usually, besides the case of lambda-expressions,
8579 the parenthesized type-id cannot be followed by '[', and, eg, we
8580 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
8581 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
8582 we don't commit, we try a cast-expression, then an unary-expression.
8584 Save tokens so that we can put them back. */
8587 /* We may be looking at a cast-expression. */
8590 cast_expression
8593 /* Roll back the tokens we skipped. */
8595 /* If we aren't looking at a cast-expression, simulate an error so
8596 that the call to cp_parser_error_occurred below returns true. */
8599 else
8600 {
8603 /* Look for the type-id. */
8605 /* Look for the closing `)'. */
8608 }
8610 /* Restore the saved message. */
8613 /* At this point this can only be either a cast or a
8614 parenthesized ctor such as `(T ())' that looks like a cast to
8615 function returning T. */
8617 {
8618 /* Only commit if the cast-expression doesn't start with
8619 '++', '--', or '[' in C++11. */
8627 pidk);
8630 {
8631 /* Warn about old-style casts, if so requested. */
8638 /* Only type conversions to integral or enumeration types
8639 can be used in constant-expressions. */
8642 NIC_CAST))
8645 /* Perform the cast. */
8646 /* Make a location:
8647 (TYPE) EXPR
8648 ^~~~~~~~~~~
8649 with start==caret at the open paren, extending to the
8650 end of "expr". */
8652 open_paren_loc,
8656 }
8657 }
8658 else
8660 }
8662 /* If we get here, then it's not a cast, so it must be a
8663 unary-expression. */
8666 }
8668 /* Parse a binary expression of the general form:
8670 pm-expression:
8671 cast-expression
8672 pm-expression .* cast-expression
8673 pm-expression ->* cast-expression
8675 multiplicative-expression:
8676 pm-expression
8677 multiplicative-expression * pm-expression
8678 multiplicative-expression / pm-expression
8679 multiplicative-expression % pm-expression
8681 additive-expression:
8682 multiplicative-expression
8683 additive-expression + multiplicative-expression
8684 additive-expression - multiplicative-expression
8686 shift-expression:
8687 additive-expression
8688 shift-expression << additive-expression
8689 shift-expression >> additive-expression
8691 relational-expression:
8692 shift-expression
8693 relational-expression < shift-expression
8694 relational-expression > shift-expression
8695 relational-expression <= shift-expression
8696 relational-expression >= shift-expression
8698 GNU Extension:
8700 relational-expression:
8701 relational-expression <? shift-expression
8702 relational-expression >? shift-expression
8704 equality-expression:
8705 relational-expression
8706 equality-expression == relational-expression
8707 equality-expression != relational-expression
8709 and-expression:
8710 equality-expression
8711 and-expression & equality-expression
8713 exclusive-or-expression:
8714 and-expression
8715 exclusive-or-expression ^ and-expression
8717 inclusive-or-expression:
8718 exclusive-or-expression
8719 inclusive-or-expression | exclusive-or-expression
8721 logical-and-expression:
8722 inclusive-or-expression
8723 logical-and-expression && inclusive-or-expression
8725 logical-or-expression:
8726 logical-and-expression
8727 logical-or-expression || logical-and-expression
8729 All these are implemented with a single function like:
8731 binary-expression:
8732 simple-cast-expression
8733 binary-expression <token> binary-expression
8735 CAST_P is true if this expression is the target of a cast.
8737 The binops_by_token map is used to get the tree codes for each <token> type.
8738 binary-expressions are associated according to a precedence table. */
8740 #define TOKEN_PRECEDENCE(token) \
8741 (((token->type == CPP_GREATER \
8742 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8743 && !parser->greater_than_is_operator_p) \
8744 ? PREC_NOT_OPERATOR \
8745 : binops_by_token[token->type].prec)
8747 static cp_expr
8753 {
8754 cp_parser_expression_stack stack;
8756 cp_parser_expression_stack_entry current;
8757 cp_expr rhs;
8761 tree overload;
8763 /* Parse the first expression. */
8774 {
8775 /* Get an operator token. */
8781 {
8783 "%<>>%> operator is treated"
8787 }
8792 /* This is a fold-expression; handle it later. */
8795 /* Popping an entry off the stack means we completed a subexpression:
8796 - either we found a token which is not an operator (`>' where it is not
8797 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8798 will happen repeatedly;
8799 - or, we found an operator which has lower priority. This is the case
8800 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8801 parsing `3 * 4'. */
8803 {
8806 else
8808 }
8810 get_rhs:
8814 /* We used the operator token. */
8817 /* For "false && x" or "true || x", x will never be executed;
8818 disable warnings while evaluating it. */
8820 c_inhibit_evaluation_warnings +=
8823 c_inhibit_evaluation_warnings +=
8826 /* Extract another operand. It may be the RHS of this expression
8827 or the LHS of a new, higher priority expression. */
8832 /* Get another operator token. Look up its precedence to avoid
8833 building a useless (immediately popped) stack entry for common
8834 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8841 {
8842 /* ... and prepare to parse the RHS of the new, higher priority
8843 expression. Since precedence levels on the stack are
8844 monotonically increasing, we do not have to care about
8845 stack overflows. */
8854 pop:
8856 /* If the stack is not empty, we have parsed into LHS the right side
8857 (`4' in the example above) of an expression we had suspended.
8858 We can use the information on the stack to recover the LHS (`3')
8859 from the stack together with the tree code (`MULT_EXPR'), and
8860 the precedence of the higher level subexpression
8861 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8862 which will be used to actually build the additive expression. */
8867 }
8869 /* Undo the disabling of warnings done above. */
8871 c_inhibit_evaluation_warnings -=
8874 c_inhibit_evaluation_warnings -=
8880 /* Avoid warning for !!x == y. */
8885 /* Avoid warning for !b == y where b is boolean. */
8889 /* Avoid warning for !!b == y where b is boolean. */
8902 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8903 ERROR_MARK for everything that is not a binary expression.
8904 This makes warn_about_parentheses miss some warnings that
8905 involve unary operators. For unary expressions we should
8906 pass the correct tree_code unless the unary expression was
8907 surrounded by parentheses.
8908 */
8915 == tcc_comparison
8918 else
8919 {
8924 /* TODO: build_x_binary_op doesn't always honor the location. */
8926 }
8929 /* If the binary operator required the use of an overloaded operator,
8930 then this expression cannot be an integral constant-expression.
8931 An overloaded operator can be used even if both operands are
8932 otherwise permissible in an integral constant-expression if at
8933 least one of the operands is of enumeration type. */
8937 NIC_OVERLOADED))
8939 }
8942 }
8944 static cp_expr
8949 {
8952 }
8954 /* Parse the `? expression : assignment-expression' part of a
8955 conditional-expression. The LOGICAL_OR_EXPR is the
8956 logical-or-expression that started the conditional-expression.
8957 Returns a representation of the entire conditional-expression.
8959 This routine is used by cp_parser_assignment_expression.
8961 ? expression : assignment-expression
8963 GNU Extensions:
8965 ? : assignment-expression */
8967 static tree
8969 {
8971 cp_expr assignment_expr;
8975 /* Consume the `?' token. */
8980 {
8983 /* Implicit true clause. */
8985 c_inhibit_evaluation_warnings +=
8988 }
8989 else
8990 {
8993 /* Parse the expression. */
8994 c_inhibit_evaluation_warnings +=
8997 c_inhibit_evaluation_warnings +=
9001 }
9003 /* The next token should be a `:'. */
9005 /* Parse the assignment-expression. */
9007 c_inhibit_evaluation_warnings -=
9010 /* Make a location:
9011 LOGICAL_OR_EXPR ? EXPR : ASSIGNMENT_EXPR
9012 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
9013 with the caret at the "?", ranging from the start of
9014 the logical_or_expr to the end of the assignment_expr. */
9019 /* Build the conditional-expression. */
9021 expr,
9022 assignment_expr,
9023 tf_warning_or_error);
9024 }
9026 /* Parse an assignment-expression.
9028 assignment-expression:
9029 conditional-expression
9030 logical-or-expression assignment-operator assignment_expression
9031 throw-expression
9033 CAST_P is true if this expression is the target of a cast.
9034 DECLTYPE_P is true if this expression is the operand of decltype.
9036 Returns a representation for the expression. */
9038 static cp_expr
9041 {
9042 cp_expr expr;
9044 /* If the next token is the `throw' keyword, then we're looking at
9045 a throw-expression. */
9048 /* Otherwise, it must be that we are looking at a
9049 logical-or-expression. */
9050 else
9051 {
9052 /* Parse the binary expressions (logical-or-expression). */
9054 decltype_p,
9056 /* If the next token is a `?' then we're actually looking at a
9057 conditional-expression. */
9060 else
9061 {
9064 /* If it's an assignment-operator, we're using the second
9065 production. */
9066 enum tree_code assignment_operator
9069 {
9072 /* Parse the right-hand side of the assignment. */
9079 /* An assignment may not appear in a
9080 constant-expression. */
9082 NIC_ASSIGNMENT))
9084 /* Build the assignment expression. Its default
9085 location:
9086 LHS = RHS
9087 ~~~~^~~~~
9088 is the location of the '=' token as the
9089 caret, ranging from the start of the lhs to the
9090 end of the rhs. */
9095 assignment_operator,
9096 rhs,
9098 /* TODO: build_x_modify_expr doesn't honor the location,
9099 so we must set it here. */
9101 }
9102 }
9103 }
9106 }
9108 /* Parse an (optional) assignment-operator.
9110 assignment-operator: one of
9111 = *= /= %= += -= >>= <<= &= ^= |=
9113 GNU Extension:
9115 assignment-operator: one of
9116 <?= >?=
9118 If the next token is an assignment operator, the corresponding tree
9119 code is returned, and the token is consumed. For example, for
9120 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
9121 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
9122 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
9123 operator, ERROR_MARK is returned. */
9125 static enum tree_code
9127 {
9131 /* Peek at the next token. */
9135 {
9181 /* Nothing else is an assignment operator. */
9183 }
9185 /* An operator followed by ... is a fold-expression, handled elsewhere. */
9190 /* If it was an assignment operator, consume it. */
9195 }
9197 /* Parse an expression.
9199 expression:
9200 assignment-expression
9201 expression , assignment-expression
9203 CAST_P is true if this expression is the target of a cast.
9204 DECLTYPE_P is true if this expression is the immediate operand of decltype,
9205 except possibly parenthesized or on the RHS of a comma (N3276).
9207 Returns a representation of the expression. */
9209 static cp_expr
9212 {
9217 {
9218 cp_expr assignment_expression;
9220 /* Parse the next assignment-expression. */
9221 assignment_expression
9224 /* We don't create a temporary for a call that is the immediate operand
9225 of decltype or on the RHS of a comma. But when we see a comma, we
9226 need to create a temporary for a call on the LHS. */
9231 assignment_expression
9235 /* If this is the first assignment-expression, we can just
9236 save it away. */
9239 else
9240 {
9241 /* Create a location with caret at the comma, ranging
9242 from the start of the LHS to the end of the RHS. */
9247 assignment_expression,
9250 }
9251 /* If the next token is not a comma, or we're in a fold-expression, then
9252 we are done with the expression. */
9256 /* Consume the `,'. */
9259 /* A comma operator cannot appear in a constant-expression. */
9262 }
9265 }
9267 /* Parse a constant-expression.
9269 constant-expression:
9270 conditional-expression
9272 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
9273 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
9274 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
9275 is false, NON_CONSTANT_P should be NULL. */
9277 static cp_expr
9281 {
9285 cp_expr expression;
9287 /* It might seem that we could simply parse the
9288 conditional-expression, and then check to see if it were
9289 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
9290 one that the compiler can figure out is constant, possibly after
9291 doing some simplifications or optimizations. The standard has a
9292 precise definition of constant-expression, and we must honor
9293 that, even though it is somewhat more restrictive.
9295 For example:
9297 int i[(2, 3)];
9299 is not a legal declaration, because `(2, 3)' is not a
9300 constant-expression. The `,' operator is forbidden in a
9301 constant-expression. However, GCC's constant-folding machinery
9302 will fold this operation to an INTEGER_CST for `3'. */
9304 /* Save the old settings. */
9306 saved_allow_non_integral_constant_expression_p
9309 /* We are now parsing a constant-expression. */
9311 parser->allow_non_integral_constant_expression_p
9314 /* Although the grammar says "conditional-expression", we parse an
9315 "assignment-expression", which also permits "throw-expression"
9316 and the use of assignment operators. In the case that
9317 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
9318 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
9319 actually essential that we look for an assignment-expression.
9320 For example, cp_parser_initializer_clauses uses this function to
9321 determine whether a particular assignment-expression is in fact
9322 constant. */
9324 /* Restore the old settings. */
9325 parser->integral_constant_expression_p
9327 parser->allow_non_integral_constant_expression_p
9330 {
9331 /* Require an rvalue constant expression here; that's what our
9332 callers expect. Reference constant expressions are handled
9333 separately in e.g. cp_parser_template_argument. */
9338 }
9341 parser->non_integral_constant_expression_p
9345 }
9347 /* Parse __builtin_offsetof.
9349 offsetof-expression:
9350 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
9352 offsetof-member-designator:
9353 id-expression
9354 | offsetof-member-designator "." id-expression
9355 | offsetof-member-designator "[" expression "]"
9356 | offsetof-member-designator "->" id-expression */
9358 static cp_expr
9360 {
9362 tree type;
9363 cp_expr expr;
9364 cp_id_kind dummy;
9366 location_t finish_loc;
9368 /* We're about to accept non-integral-constant things, but will
9369 definitely yield an integral constant expression. Save and
9370 restore these values around our local parsing. */
9376 /* Consume the "__builtin_offsetof" token. */
9378 /* Consume the opening `('. */
9380 /* Parse the type-id. */
9383 /* Look for the `,'. */
9387 /* Build the (type *)null that begins the traditional offsetof macro. */
9389 tf_warning_or_error);
9391 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
9395 {
9398 {
9400 /* offsetof-member-designator "[" expression "]" */
9406 /* offsetof-member-designator "->" identifier */
9409 /* FALLTHRU */
9412 /* offsetof-member-designator "." identifier */
9420 /* Consume the ")" token. */
9426 /* Error. We know the following require will fail, but
9427 that gives the proper error message. */
9432 }
9433 }
9435 success:
9436 /* Make a location of the form:
9437 __builtin_offsetof (struct s, f)
9438 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
9439 with caret at the type-id, ranging from the start of the
9440 "_builtin_offsetof" token to the close paren. */
9442 /* The result will be an INTEGER_CST, so we need to explicitly
9443 preserve the location. */
9446 failure:
9451 }
9453 /* Parse a trait expression.
9455 Returns a representation of the expression, the underlying type
9456 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
9458 static tree
9460 {
9461 cp_trait_kind kind;
9467 {
9555 }
9557 /* Consume the token. */
9562 {
9565 }
9571 {
9574 {
9577 }
9581 }
9583 {
9585 {
9589 {
9592 }
9596 }
9597 }
9601 /* Complete the trait expression, which may mean either processing
9602 the trait expr now or saving it for template instantiation. */
9604 {
9613 }
9614 }
9616 /* Lambdas that appear in variable initializer or default argument scope
9617 get that in their mangling, so we need to record it. We might as well
9618 use the count for function and namespace scopes as well. */
9622 {
9623 tree t;
9625 };
9628 static void
9630 {
9631 tree_int ti;
9633 /* Once we're inside a function, we ignore other scopes and just push
9634 the function again so that popping works properly. */
9641 {
9642 /* Don't reset the count if we're still in the same function. */
9645 }
9646 }
9648 static void
9650 {
9653 }
9655 static void
9657 {
9660 {
9663 }
9665 }
9667 /* Parse a lambda expression.
9669 lambda-expression:
9670 lambda-introducer lambda-declarator [opt] compound-statement
9672 Returns a representation of the expression. */
9674 static cp_expr
9676 {
9678 tree type;
9686 {
9688 {
9692 }
9694 }
9696 {
9698 {
9701 }
9703 }
9705 /* We may be in the middle of deferred access check. Disable
9706 it now. */
9717 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9720 /* Now that we've started the type, add the capture fields for any
9721 explicit captures. */
9724 {
9725 /* Inside the class, surrounding template-parameter-lists do not apply. */
9726 unsigned int saved_num_template_parameter_lists
9730 bool fully_implicit_function_template_p
9734 bool auto_is_implicit_function_template_parm_p
9745 /* By virtue of defining a local class, a lambda expression has access to
9746 the private variables of enclosing classes. */
9751 {
9757 }
9759 {
9762 }
9764 /* The capture list was built up in reverse order; fix that now. */
9776 parser->fully_implicit_function_template_p
9780 parser->auto_is_implicit_function_template_parm_p
9782 }
9786 /* This field is only used during parsing of the lambda. */
9789 /* This lambda shouldn't have any proxies left at this point. */
9791 /* And now that we're done, push proxies for an enclosing lambda. */
9796 else
9802 }
9804 /* Parse the beginning of a lambda expression.
9806 lambda-introducer:
9807 [ lambda-capture [opt] ]
9809 LAMBDA_EXPR is the current representation of the lambda expression. */
9811 static void
9813 {
9814 /* Need commas after the first capture. */
9817 /* Eat the leading `['. */
9820 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9828 {
9831 }
9834 {
9836 tree capture_id;
9837 tree capture_init_expr;
9841 enum capture_kind_type
9842 {
9843 BY_COPY,
9844 BY_REFERENCE
9845 };
9849 {
9852 }
9856 else
9859 /* Possibly capture `this'. */
9861 {
9871 explicit_init_p);
9873 }
9875 /* Remember whether we want to capture as a reference or not. */
9877 {
9880 }
9882 /* Get the identifier. */
9887 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9888 delimiters, but I modified this to stop on unnested ']' as well. It
9889 was already changed to stop on unnested '}', so the
9890 "closing_parenthesis" name is no more misleading with my change. */
9891 {
9897 }
9899 /* Find the initializer for this capture. */
9903 {
9905 /* An explicit initializer exists. */
9908 "lambda capture initializers "
9914 {
9917 }
9918 }
9919 else
9920 {
9923 /* Turn the identifier into an id-expression. */
9924 capture_init_expr
9929 {
9932 }
9936 {
9939 capture_init_expr);
9943 }
9946 {
9949 capture_init_expr))
9953 }
9955 capture_init_expr
9956 = finish_id_expression
9958 capture_init_expr,
9972 {
9975 }
9976 else
9978 }
9982 {
9987 capture_id);
9991 "capture of %qD redundant with by-reference capture "
9993 }
9996 capture_id,
9997 capture_init_expr,
9999 explicit_init_p);
10000 }
10003 }
10005 /* Parse the (optional) middle of a lambda expression.
10007 lambda-declarator:
10008 < template-parameter-list [opt] >
10009 ( parameter-declaration-clause [opt] )
10010 attribute-specifier [opt]
10011 mutable [opt]
10012 exception-specification [opt]
10013 lambda-return-type-clause [opt]
10015 LAMBDA_EXPR is the current representation of the lambda expression. */
10017 static bool
10019 {
10020 /* 5.1.1.4 of the standard says:
10021 If a lambda-expression does not include a lambda-declarator, it is as if
10022 the lambda-declarator were ().
10023 This means an empty parameter list, no attributes, and no exception
10024 specification. */
10031 /* The template-parameter-list is optional, but must begin with
10032 an opening angle if present. */
10034 {
10037 "lambda templates are only available with "
10046 /* We just processed one more parameter list. */
10048 }
10050 /* The parameter-declaration-clause is optional (unless
10051 template-parameter-list was given), but must begin with an
10052 opening parenthesis if present. */
10054 {
10059 /* Parse parameters. */
10062 /* Default arguments shall not be specified in the
10063 parameter-declaration-clause of a lambda-declarator. */
10073 /* Parse optional `mutable' keyword. */
10075 {
10078 }
10082 /* Parse optional exception specification. */
10085 /* Parse optional trailing return type. */
10087 {
10091 }
10093 /* The function parameters must be in scope all the way until after the
10094 trailing-return-type in case of decltype. */
10096 }
10100 /* Create the function call operator.
10102 Messing with declarators like this is no uglier than building up the
10103 FUNCTION_DECL by hand, and this is less likely to get out of sync with
10104 other code. */
10105 {
10106 cp_decl_specifier_seq return_type_specs;
10108 tree fco;
10115 else
10116 /* Maybe we will deduce the return type later. */
10122 sfk_none);
10127 VIRT_SPEC_UNSPECIFIED,
10128 REF_QUAL_NONE,
10129 tx_qual,
10130 exception_spec,
10136 declarator,
10137 attributes);
10139 {
10142 /* Give the object parameter a different name. */
10146 }
10148 {
10152 }
10161 }
10162 }
10164 /* Parse the body of a lambda expression, which is simply
10166 compound-statement
10168 but which requires special handling.
10169 LAMBDA_EXPR is the current representation of the lambda expression. */
10171 static void
10173 {
10178 else
10179 /* Still increment function_depth so that we don't GC in the
10180 middle of an expression. */
10184 /* Clear this in case we're in the middle of a default argument. */
10187 /* Finish the function call operator
10188 - class_specifier
10189 + late_parsing_for_member
10190 + function_definition_after_declarator
10191 + ctor_initializer_opt_and_function_body */
10192 {
10194 tree body;
10196 tree compound_stmt;
10197 tree cap;
10199 /* Let the front end know that we are going to be defining this
10200 function. */
10202 NULL_TREE,
10211 /* Push the proxies for any explicit captures. */
10218 /* 5.1.1.4 of the standard says:
10219 If a lambda-expression does not include a trailing-return-type, it
10220 is as if the trailing-return-type denotes the following type:
10221 * if the compound-statement is of the form
10222 { return attribute-specifier [opt] expression ; }
10223 the type of the returned expression after lvalue-to-rvalue
10224 conversion (_conv.lval_ 4.1), array-to-pointer conversion
10225 (_conv.array_ 4.2), and function-to-pointer conversion
10226 (_conv.func_ 4.3);
10227 * otherwise, void. */
10229 /* In a lambda that has neither a lambda-return-type-clause
10230 nor a deducible form, errors should be reported for return statements
10231 in the body. Since we used void as the placeholder return type, parsing
10232 the body as usual will give such desired behavior. */
10236 {
10240 /* Parse tentatively in case there's more after the initial return
10241 statement. */
10252 {
10254 {
10259 }
10261 /* Will get error here if type not deduced yet. */
10265 }
10266 }
10269 {
10274 }
10278 out:
10282 /* Finish the function and generate code for it if necessary. */
10285 /* Only expand if the call op is not a template. */
10288 }
10294 else
10296 }
10298 /* Statements [gram.stmt.stmt] */
10300 /* Parse a statement.
10302 statement:
10303 labeled-statement
10304 expression-statement
10305 compound-statement
10306 selection-statement
10307 iteration-statement
10308 jump-statement
10309 declaration-statement
10310 try-block
10312 C++11:
10314 statement:
10315 labeled-statement
10316 attribute-specifier-seq (opt) expression-statement
10317 attribute-specifier-seq (opt) compound-statement
10318 attribute-specifier-seq (opt) selection-statement
10319 attribute-specifier-seq (opt) iteration-statement
10320 attribute-specifier-seq (opt) jump-statement
10321 declaration-statement
10322 attribute-specifier-seq (opt) try-block
10324 TM Extension:
10326 statement:
10327 atomic-statement
10329 IN_COMPOUND is true when the statement is nested inside a
10330 cp_parser_compound_statement; this matters for certain pragmas.
10332 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10333 is a (possibly labeled) if statement which is not enclosed in braces
10334 and has an else clause. This is used to implement -Wparentheses.
10336 CHAIN is a vector of if-else-if conditions. */
10338 static void
10341 {
10346 restart:
10349 /* There is no statement yet. */
10355 /* In obj-c++, seeing '[[' might be the either the beginning of
10356 c++11 attributes, or a nested objc-message-expression. So
10357 let's parse the c++11 attributes tentatively. */
10361 {
10364 }
10366 /* Peek at the next token. */
10368 /* Remember the location of the first token in the statement. */
10370 /* If this is a keyword, then that will often determine what kind of
10371 statement we have. */
10373 {
10377 {
10380 /* Looks like a labeled-statement with a case label.
10381 Parse the label, and then use tail recursion to parse
10382 the statement. */
10400 {
10405 }
10406 else
10420 {
10425 }
10426 else
10427 {
10431 }
10435 /* Objective-C++ exception-handling constructs. */
10449 /* This must be a namespace alias definition. */
10465 /* It might be a keyword like `int' that can start a
10466 declaration-statement. */
10468 }
10469 }
10471 {
10472 /* If the next token is a `:', then we are looking at a
10473 labeled-statement. */
10476 {
10477 /* Looks like a labeled-statement with an ordinary label.
10478 Parse the label, and then use tail recursion to parse
10479 the statement. */
10484 }
10485 }
10486 /* Anything that starts with a `{' must be a compound-statement. */
10489 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
10490 a statement all its own. */
10492 {
10493 /* Only certain OpenMP pragmas are attached to statements, and thus
10494 are considered statements themselves. All others are not. In
10495 the context of a compound, accept the pragma as a "statement" and
10496 return so that we can check for a close brace. Otherwise we
10497 require a real statement and must go back and read one. */
10503 }
10505 {
10508 }
10510 /* Everything else must be a declaration-statement or an
10511 expression-statement. Try for the declaration-statement
10512 first, unless we are looking at a `;', in which case we know that
10513 we have an expression-statement. */
10515 {
10517 {
10519 {
10520 /* Attributes should be parsed as part of the the
10521 declaration, so let's un-parse them. */
10524 }
10527 /* Try to parse the declaration-statement. */
10529 /* If that worked, we're done. */
10532 }
10533 /* Look for an expression-statement instead. */
10535 }
10537 /* Set the line number for the statement. */
10541 /* Note that for now, we don't do anything with c++11 statements
10542 parsed at this level. */
10545 OPT_Wattributes,
10547 }
10549 /* Parse the label for a labeled-statement, i.e.
10551 identifier :
10552 case constant-expression :
10553 default :
10555 GNU Extension:
10556 case constant-expression ... constant-expression : statement
10558 When a label is parsed without errors, the label is added to the
10559 parse tree by the finish_* functions, so this function doesn't
10560 have to return the label. */
10562 static void
10564 {
10569 /* The next token should be an identifier. */
10573 {
10576 }
10580 {
10582 {
10586 /* Consume the `case' token. */
10588 /* Parse the constant-expression. */
10595 {
10596 /* Consume the `...' token. */
10602 /* We don't need to emit warnings here, as the common code
10603 will do this for us. */
10604 }
10605 else
10610 else
10613 expr);
10614 }
10618 /* Consume the `default' token. */
10623 else
10628 /* Anything else must be an ordinary label. */
10631 }
10633 /* Require the `:' token. */
10636 /* An ordinary label may optionally be followed by attributes.
10637 However, this is only permitted if the attributes are then
10638 followed by a semicolon. This is because, for backward
10639 compatibility, when parsing
10640 lab: __attribute__ ((unused)) int i;
10641 we want the attribute to attach to "i", not "lab". */
10644 {
10645 tree attrs;
10652 ;
10653 else
10655 }
10661 }
10663 /* Parse an expression-statement.
10665 expression-statement:
10666 expression [opt] ;
10668 Returns the new EXPR_STMT -- or NULL_TREE if the expression
10669 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
10670 indicates whether this expression-statement is part of an
10671 expression statement. */
10673 static tree
10675 {
10679 /* If the next token is a ';', then there is no expression
10680 statement. */
10682 {
10686 {
10689 }
10690 }
10692 /* Give a helpful message for "A<T>::type t;" and the like. */
10695 {
10702 {
10703 /* A::A a; */
10708 }
10709 }
10711 /* Consume the final `;'. */
10716 /* This is the final expression statement of a statement
10717 expression. */
10723 }
10725 /* Parse a compound-statement.
10727 compound-statement:
10728 { statement-seq [opt] }
10730 GNU extension:
10732 compound-statement:
10733 { label-declaration-seq [opt] statement-seq [opt] }
10735 label-declaration-seq:
10736 label-declaration
10737 label-declaration-seq label-declaration
10739 Returns a tree representing the statement. */
10741 static tree
10744 {
10745 tree compound_stmt;
10747 /* Consume the `{'. */
10754 /* Begin the compound-statement. */
10756 /* If the next keyword is `__label__' we have a label declaration. */
10759 /* Parse an (optional) statement-seq. */
10761 /* Finish the compound-statement. */
10763 /* Consume the `}'. */
10767 }
10769 /* Parse an (optional) statement-seq.
10771 statement-seq:
10772 statement
10773 statement-seq [opt] statement */
10775 static void
10777 {
10778 /* Scan statements until there aren't any more. */
10780 {
10783 /* If we are looking at a `}', then we have run out of
10784 statements; the same is true if we have reached the end
10785 of file, or have stumbled upon a stray '@end'. */
10792 /* If we are in a compound statement and find 'else' then
10793 something went wrong. */
10795 {
10798 else
10799 {
10802 }
10803 }
10805 /* Parse the statement. */
10807 }
10808 }
10810 /* Parse a selection-statement.
10812 selection-statement:
10813 if ( condition ) statement
10814 if ( condition ) statement else statement
10815 switch ( condition ) statement
10817 Returns the new IF_STMT or SWITCH_STMT.
10819 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10820 is a (possibly labeled) if statement which is not enclosed in
10821 braces and has an else clause. This is used to implement
10822 -Wparentheses.
10824 CHAIN is a vector of if-else-if conditions. This is used to implement
10825 -Wduplicated-cond. */
10827 static tree
10830 {
10833 token_indent_info guard_tinfo;
10838 /* Peek at the next token. */
10842 /* See what kind of keyword it is. */
10845 {
10848 {
10849 tree statement;
10850 tree condition;
10852 /* Look for the `('. */
10854 {
10857 }
10859 /* Begin the selection-statement. */
10862 else
10865 /* Parse the condition. */
10867 /* Look for the `)'. */
10873 {
10877 /* Add the condition. */
10884 /* Parse the then-clause. */
10888 guard_tinfo);
10893 /* If the next token is `else', parse the else-clause. */
10895 RID_ELSE))
10896 {
10897 guard_tinfo
10899 /* Consume the `else' keyword. */
10902 {
10904 RID_IF)
10906 {
10907 /* We've got "if (COND) else if (COND2)". Start
10908 the condition chain and add COND as the first
10909 element. */
10913 {
10914 /* Wrap it in a NOP_EXPR so that we can set the
10915 location of the condition. */
10917 condition);
10920 }
10921 }
10923 RID_IF))
10924 {
10925 /* This is if-else without subsequent if. Zap the
10926 condition chain; we would have already warned at
10927 this point. */
10930 }
10931 }
10933 /* Parse the else-clause. */
10939 /* If we are currently parsing a then-clause, then
10940 IF_P will not be NULL. We set it to true to
10941 indicate that this if statement has an else clause.
10942 This may trigger the Wparentheses warning below
10943 when we get back up to the parent if statement. */
10946 }
10947 else
10948 {
10949 /* This if statement does not have an else clause. If
10950 NESTED_IF is true, then the then-clause is an if
10951 statement which does have an else clause. We warn
10952 about the potential ambiguity. */
10955 "suggest explicit braces to avoid ambiguous"
10958 {
10959 /* We don't need the condition chain anymore. */
10962 }
10963 }
10965 /* Now we're all done with the if-statement. */
10967 }
10968 else
10969 {
10973 /* Add the condition. */
10976 /* Parse the body of the switch-statement. */
10982 guard_tinfo);
10986 /* Now we're all done with the switch-statement. */
10988 }
10991 }
10997 }
10998 }
11000 /* Parse a condition.
11002 condition:
11003 expression
11004 type-specifier-seq declarator = initializer-clause
11005 type-specifier-seq declarator braced-init-list
11007 GNU Extension:
11009 condition:
11010 type-specifier-seq declarator asm-specification [opt]
11011 attributes [opt] = assignment-expression
11013 Returns the expression that should be tested. */
11015 static tree
11017 {
11018 cp_decl_specifier_seq type_specifiers;
11022 /* Try the declaration first. */
11024 /* New types are not allowed in the type-specifier-seq for a
11025 condition. */
11027 parser->type_definition_forbidden_message
11029 /* Parse the type-specifier-seq. */
11031 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
11034 /* Restore the saved message. */
11036 /* If all is well, we might be looking at a declaration. */
11038 {
11039 tree decl;
11040 tree asm_specification;
11041 tree attributes;
11045 /* Parse the declarator. */
11051 /* Parse the attributes. */
11053 /* Parse the asm-specification. */
11055 /* If the next token is not an `=' or '{', then we might still be
11056 looking at an expression. For example:
11058 if (A(a).x)
11060 looks like a decl-specifier-seq and a declarator -- but then
11061 there is no `=', so this is an expression. */
11066 /* If we did see an `=' or '{', then we are looking at a declaration
11067 for sure. */
11069 {
11070 tree pushed_scope;
11074 /* Create the declaration. */
11080 /* Parse the initializer. */
11082 {
11086 }
11087 else
11088 {
11089 /* Consume the `='. */
11092 }
11096 /* Process the initializer. */
11099 asm_specification,
11100 flags);
11106 }
11107 }
11108 /* If we didn't even get past the declarator successfully, we are
11109 definitely not looking at a declaration. */
11110 else
11113 /* Otherwise, we are looking at an expression. */
11115 }
11117 /* Parses a for-statement or range-for-statement until the closing ')',
11118 not included. */
11120 static tree
11122 {
11126 /* Begin the for-statement. */
11129 /* Parse the initialization. */
11134 else
11136 }
11138 static tree
11140 {
11141 /* Normal for loop */
11144 tree stmt;
11147 /* The for-init-statement has already been parsed in
11148 cp_parser_for_init_statement, so no work is needed here. */
11151 /* If there's a condition, process it. */
11155 {
11159 }
11161 /* Look for the `;'. */
11164 /* If there's an expression, process it. */
11170 }
11172 /* Tries to parse a range-based for-statement:
11174 range-based-for:
11175 decl-specifier-seq declarator : expression
11177 The decl-specifier-seq declarator and the `:' are already parsed by
11178 cp_parser_for_init_statement. If processing_template_decl it returns a
11179 newly created RANGE_FOR_STMT; if not, it is converted to a
11180 regular FOR_STMT. */
11182 static tree
11185 {
11188 /* Get the range declaration momentarily out of the way so that
11189 the range expression doesn't clash with it. */
11194 {
11197 }
11198 else
11201 /* Put the range declaration back into scope. */
11205 /* If in template, STMT is converted to a normal for-statement
11206 at instantiation. If not, it is done just ahead. */
11208 {
11216 /* do_auto_deduction doesn't mess with template init-lists. */
11219 }
11220 else
11221 {
11224 }
11226 }
11228 /* Subroutine of cp_convert_range_for: given the initializer expression,
11229 builds up the range temporary. */
11231 static tree
11233 {
11236 /* Find out the type deduced by the declaration
11237 `auto &&__range = range_expr'. */
11242 /* Create the __range variable. */
11249 }
11251 /* Used by cp_parser_range_for in template context: we aren't going to
11252 do a full conversion yet, but we still need to resolve auto in the
11253 type of the for-range-declaration if present. This is basically
11254 a shortcut version of cp_convert_range_for. */
11256 static void
11258 {
11261 {
11264 iter_type = (cp_parser_perform_range_for_lookup
11267 {
11269 iter_type);
11271 tf_warning_or_error);
11274 }
11275 }
11276 }
11278 /* Converts a range-based for-statement into a normal
11279 for-statement, as per the definition.
11281 for (RANGE_DECL : RANGE_EXPR)
11282 BLOCK
11284 should be equivalent to:
11286 {
11287 auto &&__range = RANGE_EXPR;
11288 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
11289 __begin != __end;
11290 ++__begin)
11291 {
11292 RANGE_DECL = *__begin;
11293 BLOCK
11294 }
11295 }
11297 If RANGE_EXPR is an array:
11298 BEGIN_EXPR = __range
11299 END_EXPR = __range + ARRAY_SIZE(__range)
11300 Else if RANGE_EXPR has a member 'begin' or 'end':
11301 BEGIN_EXPR = __range.begin()
11302 END_EXPR = __range.end()
11303 Else:
11304 BEGIN_EXPR = begin(__range)
11305 END_EXPR = end(__range);
11307 If __range has a member 'begin' but not 'end', or vice versa, we must
11308 still use the second alternative (it will surely fail, however).
11309 When calling begin()/end() in the third alternative we must use
11310 argument dependent lookup, but always considering 'std' as an associated
11311 namespace. */
11313 tree
11316 {
11322 /* If an error happened previously do nothing or else a lot of
11323 unhelpful errors would be issued. */
11325 else
11326 {
11327 tree range_temp;
11331 /* Can't bind a reference to an array of runtime bound. */
11333 else
11334 {
11339 LOOKUP_ONLYCONVERTING);
11341 }
11344 }
11346 /* The new for initialization statement. */
11354 LOOKUP_ONLYCONVERTING);
11363 LOOKUP_ONLYCONVERTING);
11367 /* The new for condition. */
11374 /* The new increment expression. */
11377 tf_warning_or_error);
11380 /* The declaration is initialized with *__begin inside the loop body. */
11383 tf_warning_or_error),
11385 LOOKUP_ONLYCONVERTING);
11388 }
11390 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
11391 We need to solve both at the same time because the method used
11392 depends on the existence of members begin or end.
11393 Returns the type deduced for the iterator expression. */
11395 static tree
11397 {
11399 {
11402 }
11405 {
11410 }
11412 {
11413 /* If RANGE is an array, we will use pointer arithmetic. */
11416 range,
11420 }
11421 else
11422 {
11423 /* If it is not an array, we must do a bit of magic. */
11433 tf_warning_or_error);
11436 tf_warning_or_error);
11439 {
11440 /* Use the member functions. */
11443 else
11449 else
11452 }
11453 else
11454 {
11455 /* Use global functions with ADL. */
11462 tf_warning_or_error);
11464 tf_warning_or_error);
11466 tf_warning_or_error);
11468 tf_warning_or_error);
11471 }
11473 /* Last common checks. */
11475 {
11476 /* If one of the expressions is an error do no more checks. */
11479 }
11482 /* Can happen, when, eg, in a template context, Koenig lookup
11483 can't resolve begin/end (c++/58503). */
11485 else
11486 {
11488 /* The unqualified type of the __begin and __end temporaries should
11489 be the same, as required by the multiple auto declaration. */
11495 }
11496 }
11497 }
11499 /* Helper function for cp_parser_perform_range_for_lookup.
11500 Builds a tree for RANGE.IDENTIFIER(). */
11502 static tree
11504 {
11517 tf_warning_or_error);
11520 }
11522 /* Parse an iteration-statement.
11524 iteration-statement:
11525 while ( condition ) statement
11526 do statement while ( expression ) ;
11527 for ( for-init-statement condition [opt] ; expression [opt] )
11528 statement
11530 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
11532 static tree
11534 {
11537 tree statement;
11539 token_indent_info guard_tinfo;
11541 /* Peek at the next token. */
11548 /* Remember whether or not we are already within an iteration
11549 statement. */
11552 /* See what kind of keyword it is. */
11555 {
11557 {
11558 tree condition;
11560 /* Begin the while-statement. */
11562 /* Look for the `('. */
11564 /* Parse the condition. */
11567 /* Look for the `)'. */
11569 /* Parse the dependent statement. */
11573 /* We're done with the while-statement. */
11575 }
11579 {
11580 tree expression;
11582 /* Begin the do-statement. */
11584 /* Parse the body of the do-statement. */
11589 /* Look for the `while' keyword. */
11591 /* Look for the `('. */
11593 /* Parse the expression. */
11595 /* We're done with the do-statement. */
11597 /* Look for the `)'. */
11599 /* Look for the `;'. */
11601 }
11605 {
11606 /* Look for the `('. */
11611 /* Look for the `)'. */
11614 /* Parse the body of the for-statement. */
11619 /* We're done with the for-statement. */
11621 }
11628 }
11631 }
11633 /* Parse a for-init-statement or the declarator of a range-based-for.
11634 Returns true if a range-based-for declaration is seen.
11636 for-init-statement:
11637 expression-statement
11638 simple-declaration */
11640 static bool
11642 {
11643 /* If the next token is a `;', then we have an empty
11644 expression-statement. Grammatically, this is also a
11645 simple-declaration, but an invalid one, because it does not
11646 declare anything. Therefore, if we did not handle this case
11647 specially, we would issue an error message about an invalid
11648 declaration. */
11650 {
11654 /* A colon is used in range-based for. */
11657 /* We're going to speculatively look for a declaration, falling back
11658 to an expression, if necessary. */
11660 /* Parse the declaration. */
11663 decl);
11666 {
11667 /* It is a range-for, consume the ':' */
11671 {
11673 "range-based %<for%> loops only available with "
11676 }
11677 }
11678 else
11679 /* The ';' is not consumed yet because we told
11680 cp_parser_simple_declaration not to. */
11685 /* If the tentative parse failed, then we shall need to look for an
11686 expression-statement. */
11687 }
11688 /* If we are here, it is an expression-statement. */
11691 }
11693 /* Parse a jump-statement.
11695 jump-statement:
11696 break ;
11697 continue ;
11698 return expression [opt] ;
11699 return braced-init-list ;
11700 goto identifier ;
11702 GNU extension:
11704 jump-statement:
11705 goto * expression ;
11707 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
11709 static tree
11711 {
11717 /* Peek at the next token. */
11722 /* See what kind of keyword it is. */
11725 {
11729 {
11749 }
11755 {
11762 /* Fall through. */
11772 }
11777 {
11778 tree expr;
11782 {
11786 }
11789 else
11790 /* If the next token is a `;', then there is no
11791 expression. */
11793 /* Build the return-statement. */
11795 /* Look for the final `;'. */
11797 }
11803 {
11806 }
11808 /* Create the goto-statement. */
11810 {
11811 /* Issue a warning about this use of a GNU extension. */
11813 /* Consume the '*' token. */
11815 /* Parse the dependent expression. */
11817 }
11818 else
11820 /* Look for the final `;'. */
11827 }
11830 }
11832 /* Parse a declaration-statement.
11834 declaration-statement:
11835 block-declaration */
11837 static void
11839 {
11842 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11845 /* Parse the block-declaration. */
11848 /* Free any declarators allocated. */
11850 }
11852 /* Some dependent statements (like `if (cond) statement'), are
11853 implicitly in their own scope. In other words, if the statement is
11854 a single statement (as opposed to a compound-statement), it is
11855 none-the-less treated as if it were enclosed in braces. Any
11856 declarations appearing in the dependent statement are out of scope
11857 after control passes that point. This function parses a statement,
11858 but ensures that is in its own scope, even if it is not a
11859 compound-statement.
11861 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11862 is a (possibly labeled) if statement which is not enclosed in
11863 braces and has an else clause. This is used to implement
11864 -Wparentheses.
11866 CHAIN is a vector of if-else-if conditions. This is used to implement
11867 -Wduplicated-cond.
11869 Returns the new statement. */
11871 static tree
11875 {
11876 tree statement;
11878 token_indent_info body_tinfo
11884 /* Mark if () ; with a special NOP_EXPR. */
11886 {
11897 }
11898 /* if a compound is opened, we simply parse the statement directly. */
11901 /* If the token is not a `{', then we must take special action. */
11902 else
11903 {
11904 /* Create a compound-statement. */
11906 /* Parse the dependent-statement. */
11908 /* Finish the dummy compound-statement. */
11910 }
11912 token_indent_info next_tinfo
11916 /* Return the statement. */
11918 }
11920 /* For some dependent statements (like `while (cond) statement'), we
11921 have already created a scope. Therefore, even if the dependent
11922 statement is a compound-statement, we do not want to create another
11923 scope. */
11925 static void
11928 {
11929 /* If the token is a `{', then we must take special action. */
11931 {
11932 token_indent_info body_tinfo
11936 token_indent_info next_tinfo
11939 }
11940 else
11941 {
11942 /* Avoid calling cp_parser_compound_statement, so that we
11943 don't create a new scope. Do everything else by hand. */
11945 /* If the next keyword is `__label__' we have a label declaration. */
11948 /* Parse an (optional) statement-seq. */
11951 }
11952 }
11954 /* Declarations [gram.dcl.dcl] */
11956 /* Parse an optional declaration-sequence.
11958 declaration-seq:
11959 declaration
11960 declaration-seq declaration */
11962 static void
11964 {
11966 {
11977 {
11978 /* A declaration consisting of a single semicolon is
11979 invalid. Allow it unless we're being pedantic. */
11984 }
11986 /* If we're entering or exiting a region that's implicitly
11987 extern "C", modify the lang context appropriately. */
11989 {
11992 }
11994 {
11997 }
12000 {
12001 /* A top-level declaration can consist solely of a #pragma.
12002 A nested declaration cannot, so this is done here and not
12003 in cp_parser_declaration. (A #pragma at block scope is
12004 handled in cp_parser_statement.) */
12007 }
12009 /* Parse the declaration itself. */
12011 }
12012 }
12014 /* Parse a declaration.
12016 declaration:
12017 block-declaration
12018 function-definition
12019 template-declaration
12020 explicit-instantiation
12021 explicit-specialization
12022 linkage-specification
12023 namespace-definition
12025 GNU extension:
12027 declaration:
12028 __extension__ declaration */
12030 static void
12032 {
12033 cp_token token1;
12034 cp_token token2;
12039 /* Check for the `__extension__' keyword. */
12041 {
12042 /* Parse the qualified declaration. */
12044 /* Restore the PEDANTIC flag. */
12048 }
12050 /* Try to figure out what kind of declaration is present. */
12055 else
12056 {
12059 }
12061 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
12064 /* If the next token is `extern' and the following token is a string
12065 literal, then we have a linkage specification. */
12069 /* If the next token is `template', then we have either a template
12070 declaration, an explicit instantiation, or an explicit
12071 specialization. */
12073 {
12074 /* `template <>' indicates a template specialization. */
12078 /* `template <' indicates a template declaration. */
12081 /* Anything else must be an explicit instantiation. */
12082 else
12084 }
12085 /* If the next token is `export', then we have a template
12086 declaration. */
12089 /* If the next token is `extern', 'static' or 'inline' and the one
12090 after that is `template', we have a GNU extended explicit
12091 instantiation directive. */
12098 /* If the next token is `namespace', check for a named or unnamed
12099 namespace definition. */
12108 /* An unnamed namespace definition. */
12112 /* An inline (associated) namespace definition. */
12116 /* Objective-C++ declaration/definition. */
12123 /* At this point we may have a template declared by a concept
12124 introduction. */
12129 else
12130 /* Try to parse a block-declaration, or a function-definition. */
12133 /* Free any declarators allocated. */
12135 }
12137 /* Parse a block-declaration.
12139 block-declaration:
12140 simple-declaration
12141 asm-definition
12142 namespace-alias-definition
12143 using-declaration
12144 using-directive
12146 GNU Extension:
12148 block-declaration:
12149 __extension__ block-declaration
12151 C++0x Extension:
12153 block-declaration:
12154 static_assert-declaration
12156 If STATEMENT_P is TRUE, then this block-declaration is occurring as
12157 part of a declaration-statement. */
12159 static void
12162 {
12166 /* Check for the `__extension__' keyword. */
12168 {
12169 /* Parse the qualified declaration. */
12171 /* Restore the PEDANTIC flag. */
12175 }
12177 /* Peek at the next token to figure out which kind of declaration is
12178 present. */
12181 /* If the next keyword is `asm', we have an asm-definition. */
12183 {
12187 }
12188 /* If the next keyword is `namespace', we have a
12189 namespace-alias-definition. */
12192 /* If the next keyword is `using', we have a
12193 using-declaration, a using-directive, or an alias-declaration. */
12195 {
12200 /* If the token after `using' is `namespace', then we have a
12201 using-directive. */
12205 /* If the second token after 'using' is '=', then we have an
12206 alias-declaration. */
12212 /* Otherwise, it's a using-declaration. */
12213 else
12216 }
12217 /* If the next keyword is `__label__' we have a misplaced label
12218 declaration. */
12220 {
12224 /* If the next token is now a `;', consume it. */
12227 }
12228 /* If the next token is `static_assert' we have a static assertion. */
12231 /* Anything else must be a simple-declaration. */
12232 else
12235 }
12237 /* Parse a simple-declaration.
12239 simple-declaration:
12240 decl-specifier-seq [opt] init-declarator-list [opt] ;
12242 init-declarator-list:
12243 init-declarator
12244 init-declarator-list , init-declarator
12246 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
12247 function-definition as a simple-declaration.
12249 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
12250 parsed declaration if it is an uninitialized single declarator not followed
12251 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
12252 if present, will not be consumed. */
12254 static void
12258 {
12259 cp_decl_specifier_seq decl_specifiers;
12268 /* Defer access checks until we know what is being declared; the
12269 checks for names appearing in the decl-specifier-seq should be
12270 done as if we were in the scope of the thing being declared. */
12273 /* Parse the decl-specifier-seq. We have to keep track of whether
12274 or not the decl-specifier-seq declares a named class or
12275 enumeration type, since that is the only case in which the
12276 init-declarator-list is allowed to be empty.
12278 [dcl.dcl]
12280 In a simple-declaration, the optional init-declarator-list can be
12281 omitted only when declaring a class or enumeration, that is when
12282 the decl-specifier-seq contains either a class-specifier, an
12283 elaborated-type-specifier, or an enum-specifier. */
12285 CP_PARSER_FLAGS_OPTIONAL,
12288 /* We no longer need to defer access checks. */
12291 /* In a block scope, a valid declaration must always have a
12292 decl-specifier-seq. By not trying to parse declarators, we can
12293 resolve the declaration/expression ambiguity more quickly. */
12296 {
12299 }
12301 /* If the next two tokens are both identifiers, the code is
12302 erroneous. The usual cause of this situation is code like:
12304 T t;
12306 where "T" should name a type -- but does not. */
12309 {
12310 /* If parsing tentatively, we should commit; we really are
12311 looking at a declaration. */
12313 /* Give up. */
12315 }
12317 /* If we have seen at least one decl-specifier, and the next token
12318 is not a parenthesis, then we must be looking at a declaration.
12319 (After "int (" we might be looking at a functional cast.) */
12331 /* Keep going until we hit the `;' at the end of the simple
12332 declaration. */
12335 CPP_SEMICOLON))
12336 {
12339 tree decl;
12342 {
12343 /* If we are processing next declarator, comma is expected */
12348 {
12352 }
12353 }
12354 else
12357 /* Parse the init-declarator. */
12360 function_definition_allowed_p,
12362 declares_class_or_enum,
12364 maybe_range_for_decl,
12366 /* If an error occurred while parsing tentatively, exit quickly.
12367 (That usually happens when in the body of a function; each
12368 statement is treated as a declaration-statement until proven
12369 otherwise.) */
12374 {
12377 {
12378 /* If the list of declarators contains more than one declarator,
12379 the type of each declared variable is determined as described
12380 above. If the type deduced for the template parameter U is not
12381 the same in each deduction, the program is ill-formed. */
12386 }
12388 }
12390 /* Handle function definitions specially. */
12392 {
12393 /* If the next token is a `,', then we are probably
12394 processing something like:
12396 void f() {}, *p;
12398 which is erroneous. */
12400 {
12403 "mixing"
12405 }
12406 /* Otherwise, we're done with the list of declarators. */
12407 else
12408 {
12411 }
12412 }
12415 /* The next token should be either a `,' or a `;'. */
12417 /* If it's a `,', there are more declarators to come. */
12420 /* If it's a `;', we are done. */
12423 /* Anything else is an error. */
12424 else
12425 {
12426 /* If we have already issued an error message we don't need
12427 to issue another one. */
12432 /* Skip tokens until we reach the end of the statement. */
12434 /* If the next token is now a `;', consume it. */
12438 }
12439 /* After the first time around, a function-definition is not
12440 allowed -- even if it was OK at first. For example:
12442 int i, f() {}
12444 is not valid. */
12446 }
12448 /* Issue an error message if no declarators are present, and the
12449 decl-specifier-seq does not itself declare a class or
12450 enumeration: [dcl.dcl]/3. */
12452 {
12454 {
12458 /* Ensure an error is issued anyway when finish_decltype_type,
12459 called via cp_parser_decl_specifier_seq, returns a class or
12460 an enumeration (c++/51786). */
12463 }
12464 /* Perform any deferred access checks. */
12466 }
12468 /* Consume the `;'. */
12472 {
12478 }
12480 done:
12482 }
12484 /* Parse a decl-specifier-seq.
12486 decl-specifier-seq:
12487 decl-specifier-seq [opt] decl-specifier
12488 decl-specifier attribute-specifier-seq [opt] (C++11)
12490 decl-specifier:
12491 storage-class-specifier
12492 type-specifier
12493 function-specifier
12494 friend
12495 typedef
12497 GNU Extension:
12499 decl-specifier:
12500 attributes
12502 Concepts Extension:
12504 decl-specifier:
12505 concept
12507 Set *DECL_SPECS to a representation of the decl-specifier-seq.
12509 The parser flags FLAGS is used to control type-specifier parsing.
12511 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
12512 flags:
12514 1: one of the decl-specifiers is an elaborated-type-specifier
12515 (i.e., a type declaration)
12516 2: one of the decl-specifiers is an enum-specifier or a
12517 class-specifier (i.e., a type definition)
12519 */
12521 static void
12523 cp_parser_flags flags,
12526 {
12530 cp_decl_spec ds;
12532 /* Clear DECL_SPECS. */
12535 /* Assume no class or enumeration type is declared. */
12538 /* Keep reading specifiers until there are no more to read. */
12540 {
12545 /* Peek at the next token. */
12548 /* Save the first token of the decl spec list for error
12549 reporting. */
12552 /* Handle attributes. */
12554 {
12555 /* Parse the attributes. */
12558 /* In a sequence of declaration specifiers, c++11 attributes
12559 appertain to the type that precede them. In that case
12560 [dcl.spec]/1 says:
12562 The attribute-specifier-seq affects the type only for
12563 the declaration it appears in, not other declarations
12564 involving the same type.
12566 But for now let's force the user to position the
12567 attribute either at the beginning of the declaration or
12568 after the declarator-id, which would clearly mean that it
12569 applies to the declarator. */
12571 {
12573 /* The c++11 attribute is at the beginning of the
12574 declaration. It appertains to the entity being
12576 else
12577 {
12579 {
12580 /* This is an attribute following a
12581 class-specifier. */
12586 }
12587 else
12588 {
12589 decl_specs->std_attributes
12591 attrs);
12594 }
12596 }
12597 }
12599 decl_specs->attributes
12601 attrs);
12605 }
12606 /* Assume we will find a decl-specifier keyword. */
12608 /* If the next token is an appropriate keyword, we can simply
12609 add it to the list. */
12611 {
12612 /* decl-specifier:
12613 friend
12614 constexpr */
12617 {
12620 }
12621 else
12622 {
12624 /* Consume the token. */
12626 }
12639 /* function-specifier:
12640 inline
12641 virtual
12642 explicit */
12649 /* decl-specifier:
12650 typedef */
12653 /* Consume the token. */
12655 /* A constructor declarator cannot appear in a typedef. */
12657 /* The "typedef" keyword can only occur in a declaration; we
12658 may as well commit at this point. */
12665 /* storage-class-specifier:
12666 auto
12667 register
12668 static
12669 extern
12670 mutable
12672 GNU Extension:
12673 thread */
12676 {
12677 /* Consume the token. */
12680 /* Complain about `auto' as a storage specifier, if
12681 we're complaining about C++0x compatibility. */
12685 /* Set the storage class anyway. */
12687 token);
12688 }
12689 else
12690 /* C++0x auto type-specifier. */
12698 /* Consume the token. */
12701 token);
12704 /* Consume the token. */
12710 /* We did not yet find a decl-specifier yet. */
12713 }
12723 /* Constructors are a special case. The `S' in `S()' is not a
12724 decl-specifier; it is the beginning of the declarator. */
12725 constructor_p
12726 = (!found_decl_spec
12727 && constructor_possible_p
12728 && (cp_parser_constructor_declarator_p
12731 /* If we don't have a DECL_SPEC yet, then we must be looking at
12732 a type-specifier. */
12734 {
12737 tree type_spec;
12739 type_spec
12741 decl_specs,
12747 /* If this type-specifier referenced a user-defined type
12748 (a typedef, class-name, etc.), then we can't allow any
12749 more such type-specifiers henceforth.
12751 [dcl.spec]
12753 The longest sequence of decl-specifiers that could
12754 possibly be a type name is taken as the
12755 decl-specifier-seq of a declaration. The sequence shall
12756 be self-consistent as described below.
12758 [dcl.type]
12760 As a general rule, at most one type-specifier is allowed
12761 in the complete decl-specifier-seq of a declaration. The
12762 only exceptions are the following:
12764 -- const or volatile can be combined with any other
12765 type-specifier.
12767 -- signed or unsigned can be combined with char, long,
12768 short, or int.
12770 -- ..
12772 Example:
12774 typedef char* Pc;
12775 void g (const int Pc);
12777 Here, Pc is *not* part of the decl-specifier seq; it's
12778 the declarator. Therefore, once we see a type-specifier
12779 (other than a cv-qualifier), we forbid any additional
12780 user-defined types. We *do* still allow things like `int
12781 int' to be considered a decl-specifier-seq, and issue the
12782 error message later. */
12785 /* A constructor declarator cannot follow a type-specifier. */
12787 {
12792 }
12793 }
12795 /* If we still do not have a DECL_SPEC, then there are no more
12796 decl-specifiers. */
12801 /* After we see one decl-specifier, further decl-specifiers are
12802 always optional. */
12804 }
12806 /* Don't allow a friend specifier with a class definition. */
12811 }
12813 /* Parse an (optional) storage-class-specifier.
12815 storage-class-specifier:
12816 auto
12817 register
12818 static
12819 extern
12820 mutable
12822 GNU Extension:
12824 storage-class-specifier:
12825 thread
12827 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12829 static tree
12831 {
12833 {
12837 /* Fall through for C++98. */
12844 /* Consume the token. */
12849 }
12850 }
12852 /* Parse an (optional) function-specifier.
12854 function-specifier:
12855 inline
12856 virtual
12857 explicit
12859 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12860 Updates DECL_SPECS, if it is non-NULL. */
12862 static tree
12865 {
12868 {
12874 /* 14.5.2.3 [temp.mem]
12876 A member function template shall not be virtual. */
12879 else
12889 }
12891 /* Consume the token. */
12893 }
12895 /* Parse a linkage-specification.
12897 linkage-specification:
12898 extern string-literal { declaration-seq [opt] }
12899 extern string-literal declaration */
12901 static void
12903 {
12904 tree linkage;
12906 /* Look for the `extern' keyword. */
12909 /* Look for the string-literal. */
12912 /* Transform the literal into an identifier. If the literal is a
12913 wide-character string, or contains embedded NULs, then we can't
12914 handle it as the user wants. */
12917 {
12919 /* Assume C++ linkage. */
12921 }
12922 else
12925 /* We're now using the new linkage. */
12928 /* If the next token is a `{', then we're using the first
12929 production. */
12931 {
12935 /* Consume the `{' token. */
12937 /* Parse the declarations. */
12939 /* Look for the closing `}'. */
12941 }
12942 /* Otherwise, there's just one declaration. */
12943 else
12944 {
12947 saved_in_unbraced_linkage_specification_p
12951 parser->in_unbraced_linkage_specification_p
12953 }
12955 /* We're done with the linkage-specification. */
12957 }
12959 /* Parse a static_assert-declaration.
12961 static_assert-declaration:
12962 static_assert ( constant-expression , string-literal ) ;
12963 static_assert ( constant-expression ) ; (C++1Z)
12965 If MEMBER_P, this static_assert is a class member. */
12967 static void
12969 {
12970 tree condition;
12971 tree message;
12973 location_t saved_loc;
12976 /* Peek at the `static_assert' token so we can keep track of exactly
12977 where the static assertion started. */
12981 /* Look for the `static_assert' keyword. */
12983 RT_STATIC_ASSERT))
12986 /* We know we are in a static assertion; commit to any tentative
12987 parse. */
12991 /* Parse the `(' starting the static assertion condition. */
12994 /* Parse the constant-expression. Allow a non-constant expression
12995 here in order to give better diagnostics in finish_static_assert. */
12996 condition =
13002 {
13005 "static_assert without a message "
13007 /* Eat the ')' */
13012 }
13013 else
13014 {
13015 /* Parse the separating `,'. */
13018 /* Parse the string-literal message. */
13023 /* A `)' completes the static assertion. */
13029 }
13031 /* A semicolon terminates the declaration. */
13034 /* Complete the static assertion, which may mean either processing
13035 the static assert now or saving it for template instantiation. */
13037 }
13039 /* Parse the expression in decltype ( expression ). */
13041 static tree
13044 {
13046 tree expr;
13048 /* Since we're going to preserve any side-effects from this parse, set up a
13049 firewall to protect our callers from cp_parser_commit_to_tentative_parse
13050 in the expression. */
13053 /* First, try parsing an id-expression. */
13064 {
13067 cp_id_kind idk;
13071 /* Lookup the name we got back from the id-expression. */
13081 {
13082 /* Complete lookup of the id-expression. */
13083 expr = (finish_id_expression
13096 /* We found an id-expression, but it was something that we
13097 should not have found. This is an error, not something
13098 we can recover from, so note that we found an
13099 id-expression and we'll recover as gracefully as
13100 possible. */
13102 }
13107 /* We have an id-expression. */
13109 }
13112 {
13113 /* Abort the id-expression parse. */
13116 /* Parsing tentatively, again. */
13119 /* Parse a class member access. */
13127 /* We have an id-expression. */
13129 }
13132 /* We have parsed the complete id-expression or member access. */
13134 else
13135 {
13136 /* Abort our attempt to parse an id-expression or member access
13137 expression. */
13140 /* Parse a full expression. */
13143 }
13146 }
13148 /* Parse a `decltype' type. Returns the type.
13150 simple-type-specifier:
13151 decltype ( expression )
13152 C++14 proposal:
13153 decltype ( auto ) */
13155 static tree
13157 {
13158 tree expr;
13167 {
13168 /* Already parsed. */
13171 }
13173 /* Look for the `decltype' token. */
13177 /* Parse the opening `('. */
13181 /* decltype (auto) */
13184 {
13191 }
13193 /* Types cannot be defined in a `decltype' expression. Save away the
13194 old message. */
13197 /* And create the new one. */
13198 parser->type_definition_forbidden_message
13201 /* The restrictions on constant-expressions do not apply inside
13202 decltype expressions. */
13203 saved_integral_constant_expression_p
13205 saved_non_integral_constant_expression_p
13209 /* Within a parenthesized expression, a `>' token is always
13210 the greater-than operator. */
13211 saved_greater_than_is_operator_p
13215 /* Do not actually evaluate the expression. */
13218 /* Do not warn about problems with the expression. */
13223 /* Go back to evaluating expressions. */
13227 /* The `>' token might be the end of a template-id or
13228 template-parameter-list now. */
13229 parser->greater_than_is_operator_p
13232 /* Restore the old message and the integral constant expression
13233 flags. */
13235 parser->integral_constant_expression_p
13237 parser->non_integral_constant_expression_p
13240 /* Parse to the closing `)'. */
13242 {
13246 }
13249 tf_warning_or_error);
13251 rewrite:
13252 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
13253 it again. */
13262 }
13264 /* Special member functions [gram.special] */
13266 /* Parse a conversion-function-id.
13268 conversion-function-id:
13269 operator conversion-type-id
13271 Returns an IDENTIFIER_NODE representing the operator. */
13273 static tree
13275 {
13276 tree type;
13277 tree saved_scope;
13278 tree saved_qualifying_scope;
13279 tree saved_object_scope;
13282 /* Look for the `operator' token. */
13285 /* When we parse the conversion-type-id, the current scope will be
13286 reset. However, we need that information in able to look up the
13287 conversion function later, so we save it here. */
13291 /* We must enter the scope of the class so that the names of
13292 entities declared within the class are available in the
13293 conversion-type-id. For example, consider:
13295 struct S {
13296 typedef int I;
13297 operator I();
13298 };
13300 S::operator I() { ... }
13302 In order to see that `I' is a type-name in the definition, we
13303 must be in the scope of `S'. */
13306 /* Parse the conversion-type-id. */
13308 /* Leave the scope of the class, if any. */
13311 /* Restore the saved scope. */
13315 /* If the TYPE is invalid, indicate failure. */
13319 }
13321 /* Parse a conversion-type-id:
13323 conversion-type-id:
13324 type-specifier-seq conversion-declarator [opt]
13326 Returns the TYPE specified. */
13328 static tree
13330 {
13331 tree attributes;
13332 cp_decl_specifier_seq type_specifiers;
13334 tree type_specified;
13337 /* Parse the attributes. */
13341 parser->type_definition_forbidden_message
13344 /* Parse the type-specifiers. */
13351 /* If that didn't work, stop. */
13354 /* Parse the conversion-declarator. */
13362 /* Don't give this error when parsing tentatively. This happens to
13363 work because we always parse this definitively once. */
13366 {
13368 {
13371 }
13375 }
13378 }
13380 /* Parse an (optional) conversion-declarator.
13382 conversion-declarator:
13383 ptr-operator conversion-declarator [opt]
13385 */
13389 {
13392 cp_cv_quals cv_quals;
13394 /* We don't know if there's a ptr-operator next, or not. */
13396 /* Try the ptr-operator. */
13399 /* If it worked, look for more conversion-declarators. */
13401 {
13404 /* Parse another optional declarator. */
13407 declarator = cp_parser_make_indirect_declarator
13411 }
13414 }
13416 /* Parse an (optional) ctor-initializer.
13418 ctor-initializer:
13419 : mem-initializer-list
13421 Returns TRUE iff the ctor-initializer was actually present. */
13423 static bool
13425 {
13426 /* If the next token is not a `:', then there is no
13427 ctor-initializer. */
13429 {
13430 /* Do default initialization of any bases and members. */
13435 }
13437 /* Consume the `:' token. */
13439 /* And the mem-initializer-list. */
13443 }
13445 /* Parse a mem-initializer-list.
13447 mem-initializer-list:
13448 mem-initializer ... [opt]
13449 mem-initializer ... [opt] , mem-initializer-list */
13451 static void
13453 {
13458 /* Let the semantic analysis code know that we are starting the
13459 mem-initializer-list. */
13464 /* Loop through the list. */
13466 {
13467 tree mem_initializer;
13470 /* Parse the mem-initializer. */
13472 /* If the next token is a `...', we're expanding member initializers. */
13474 {
13475 /* Consume the `...'. */
13478 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
13479 can be expanded but members cannot. */
13482 {
13487 }
13489 /* Construct the pack expansion type. */
13492 }
13495 {
13499 }
13500 /* Look for a target constructor. */
13504 {
13507 {
13511 }
13513 }
13514 /* Add it to the list, unless it was erroneous. */
13516 {
13519 }
13520 /* If the next token is not a `,', we're done. */
13523 /* Consume the `,' token. */
13525 }
13527 /* Perform semantic analysis. */
13530 }
13532 /* Parse a mem-initializer.
13534 mem-initializer:
13535 mem-initializer-id ( expression-list [opt] )
13536 mem-initializer-id braced-init-list
13538 GNU extension:
13540 mem-initializer:
13541 ( expression-list [opt] )
13543 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
13544 class) or FIELD_DECL (for a non-static data member) to initialize;
13545 the TREE_VALUE is the expression-list. An empty initialization
13546 list is represented by void_list_node. */
13548 static tree
13550 {
13551 tree mem_initializer_id;
13552 tree expression_list;
13553 tree member;
13556 /* Find out what is being initialized. */
13558 {
13562 }
13563 else
13564 {
13568 }
13574 {
13581 }
13582 else
13583 {
13593 }
13603 }
13605 /* Parse a mem-initializer-id.
13607 mem-initializer-id:
13608 :: [opt] nested-name-specifier [opt] class-name
13609 decltype-specifier (C++11)
13610 identifier
13612 Returns a TYPE indicating the class to be initialized for the first
13613 production (and the second in C++11). Returns an IDENTIFIER_NODE
13614 indicating the data member to be initialized for the last production. */
13616 static tree
13618 {
13622 tree id;
13626 /* `typename' is not allowed in this context ([temp.res]). */
13628 {
13630 "keyword %<typename%> not allowed in this context (a qualified "
13633 }
13634 /* Look for the optional `::' operator. */
13635 global_scope_p
13639 /* Look for the optional nested-name-specifier. The simplest way to
13640 implement:
13642 [temp.res]
13644 The keyword `typename' is not permitted in a base-specifier or
13645 mem-initializer; in these contexts a qualified name that
13646 depends on a template-parameter is implicitly assumed to be a
13647 type name.
13649 is to assume that we have seen the `typename' keyword at this
13650 point. */
13651 nested_name_specifier_p
13660 /* If there is a `::' operator or a nested-name-specifier, then we
13661 are definitely looking for a class-name. */
13666 typename_type,
13670 /* Otherwise, we could also be looking for an ordinary identifier. */
13673 /* Try a decltype-specifier. */
13675 else
13676 /* Otherwise, try a class-name. */
13680 none_type,
13684 /* If we found one, we're done. */
13687 /* Otherwise, look for an ordinary identifier. */
13689 }
13691 /* Overloading [gram.over] */
13693 /* Parse an operator-function-id.
13695 operator-function-id:
13696 operator operator
13698 Returns an IDENTIFIER_NODE for the operator which is a
13699 human-readable spelling of the identifier, e.g., `operator +'. */
13701 static cp_expr
13703 {
13704 /* Look for the `operator' keyword. */
13707 /* And then the name of the operator itself. */
13709 }
13711 /* Return an identifier node for a user-defined literal operator.
13712 The suffix identifier is chained to the operator name identifier. */
13714 static tree
13716 {
13717 tree identifier;
13724 }
13726 /* Parse an operator.
13728 operator:
13729 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
13730 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
13731 || ++ -- , ->* -> () []
13733 GNU Extensions:
13735 operator:
13736 <? >? <?= >?=
13738 Returns an IDENTIFIER_NODE for the operator which is a
13739 human-readable spelling of the identifier, e.g., `operator +'. */
13741 static cp_expr
13743 {
13748 /* Peek at the next token. */
13753 /* Figure out which operator we have. */
13755 {
13757 {
13760 /* The keyword should be either `new' or `delete'. */
13765 else
13768 /* Consume the `new' or `delete' token. */
13771 /* Peek at the next token. */
13773 /* If it's a `[' token then this is the array variant of the
13774 operator. */
13776 {
13777 /* Consume the `[' token. */
13779 /* Look for the `]' token. */
13784 }
13785 /* Otherwise, we have the non-array variant. */
13786 else
13792 }
13939 /* Consume the `('. */
13941 /* Look for the matching `)'. */
13946 /* Consume the `['. */
13948 /* Look for the matching `]'. */
13963 {
13970 /* Consume the string. */
13976 {
13979 }
13980 else
13981 {
13983 /* Look for the suffix identifier. */
13988 {
13992 }
13993 else
13994 {
13997 }
13998 }
14003 {
14006 }
14009 {
14012 }
14014 {
14017 }
14019 }
14022 /* Anything else is an error. */
14024 }
14026 /* If we have selected an identifier, we need to consume the
14027 operator token. */
14030 /* Otherwise, no valid operator name was present. */
14031 else
14032 {
14035 }
14038 }
14040 /* Parse a template-declaration.
14042 template-declaration:
14043 export [opt] template < template-parameter-list > declaration
14045 If MEMBER_P is TRUE, this template-declaration occurs within a
14046 class-specifier.
14048 The grammar rule given by the standard isn't correct. What
14049 is really meant is:
14051 template-declaration:
14052 export [opt] template-parameter-list-seq
14053 decl-specifier-seq [opt] init-declarator [opt] ;
14054 export [opt] template-parameter-list-seq
14055 function-definition
14057 template-parameter-list-seq:
14058 template-parameter-list-seq [opt]
14059 template < template-parameter-list >
14061 Concept Extensions:
14063 template-parameter-list-seq:
14064 template < template-parameter-list > requires-clause [opt]
14066 requires-clause:
14067 requires logical-or-expression */
14069 static void
14071 {
14072 /* Check for `export'. */
14074 {
14075 /* Consume the `export' token. */
14077 /* Warn that we do not support `export'. */
14079 }
14082 }
14084 /* Parse a template-parameter-list.
14086 template-parameter-list:
14087 template-parameter
14088 template-parameter-list , template-parameter
14090 Returns a TREE_LIST. Each node represents a template parameter.
14091 The nodes are connected via their TREE_CHAINs. */
14093 static tree
14095 {
14100 /* The loop below parses the template parms. We first need to know
14101 the total number of template parms to be able to compute proper
14102 canonical types of each dependent type. So after the loop, when
14103 we know the total number of template parms,
14104 end_template_parm_list computes the proper canonical types and
14105 fixes up the dependent types accordingly. */
14107 {
14108 tree parameter;
14111 location_t parm_loc;
14113 /* Parse the template-parameter. */
14118 /* Add it to the list. */
14121 parm_loc,
14122 parameter,
14123 is_non_type,
14124 is_parameter_pack);
14125 else
14126 {
14129 }
14131 /* If the next token is not a `,', we're done. */
14134 /* Otherwise, consume the `,' token. */
14136 }
14139 }
14141 /* Parse a introduction-list.
14143 introduction-list:
14144 introduced-parameter
14145 introduction-list , introduced-parameter
14147 introduced-parameter:
14148 ...[opt] identifier
14150 Returns a TREE_VEC of WILDCARD_DECLs. If the parameter is a pack
14151 then the introduced parm will have WILDCARD_PACK_P set. In addition, the
14152 WILDCARD_DECL will also have DECL_NAME set and token location in
14153 DECL_SOURCE_LOCATION. */
14155 static tree
14157 {
14161 {
14166 /* Build placeholder. */
14174 /* If the next token is not a `,', we're done. */
14177 /* Otherwise, consume the `,' token. */
14179 }
14181 /* Convert the vec into a TREE_VEC. */
14184 tree parm;
14190 }
14192 /* Given a declarator, get the declarator-id part, or NULL_TREE if this
14193 is an abstract declarator. */
14197 {
14202 }
14204 /* Get the unqualified-id from the DECLARATOR or NULL_TREE if this
14205 is an abstract declarator. */
14209 {
14213 else
14215 }
14217 /* Returns true if DECL represents a constrained-parameter. */
14221 {
14226 }
14228 /* Returns true if PARM declares a constrained-parameter. */
14232 {
14234 }
14236 /* Check that the type parameter is only a declarator-id, and that its
14237 type is not cv-qualified. */
14239 bool
14242 {
14247 {
14250 }
14252 /* Don't allow cv-qualified type parameters. */
14255 {
14258 }
14261 }
14263 /* Finish parsing/processing a template type parameter and checking
14264 various restrictions. */
14268 tree id,
14270 {
14273 else
14275 }
14277 static tree
14279 {
14280 /* FIXME: This should probably be copied, and we may need to adjust
14281 the template parameter depths. */
14291 }
14293 /* Finish parsing/processing a template template parameter by borrowing
14294 the template parameter list from the prototype parameter. */
14296 static tree
14298 tree proto,
14299 tree id,
14301 {
14305 }
14307 /* Create a new non-type template parameter from the given PARM
14308 declarator. */
14310 static tree
14313 {
14319 }
14321 /* Build a constrained template parameter based on the PARMDECL
14322 declarator. The type of PARMDECL is the constrained type, which
14323 refers to the prototype template parameter that ultimately
14324 specifies the type of the declared parameter. */
14326 static tree
14331 {
14337 /* A template parameter constrained by a variadic concept shall also
14338 be declared as a template parameter pack. */
14343 /* Build the parameter. Return an error if the declarator was invalid. */
14344 tree parm;
14349 parmdecl);
14350 else
14355 /* Finish the parameter decl and create a node attaching the
14356 default argument and constraint. */
14361 }
14363 /* Returns true if the parsed type actually represents the declaration
14364 of a type template-parameter. */
14368 {
14371 }
14374 /* Returns true if the parsed type actually represents the declaration of
14375 a template template-parameter. */
14377 static bool
14379 {
14382 }
14384 /* Parse a default argument for a type template-parameter.
14385 Note that diagnostics are handled in cp_parser_template_parameter. */
14387 static tree
14389 {
14392 /* Consume the `=' token. */
14397 /* Parse the default-argument. */
14403 {
14407 }
14410 }
14412 /* Parse a default argument for a template template-parameter. */
14414 static tree
14416 {
14421 /* Consume the `='. */
14423 /* Parse the id-expression. */
14425 /* save token before parsing the id-expression, for error
14426 reporting */
14428 tree default_argument
14436 /* If the id-expression was a template-id that refers to
14437 a template-class, we already have the declaration here,
14438 so no further lookup is needed. */
14439 ;
14440 else
14441 /* Look up the name. */
14442 default_argument
14444 none_type,
14450 /* See if the default argument is valid. */
14454 }
14456 /* Parse a template-parameter.
14458 template-parameter:
14459 type-parameter
14460 parameter-declaration
14462 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
14463 the parameter. The TREE_PURPOSE is the default value, if any.
14464 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
14465 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
14466 set to true iff this parameter is a parameter pack. */
14468 static tree
14471 {
14474 tree parm;
14476 /* Assume it is a type parameter or a template parameter. */
14478 /* Assume it not a parameter pack. */
14480 /* Peek at the next token. */
14482 /* If it is `class' or `template', we have a type-parameter. */
14485 /* If it is `class' or `typename' we do not know yet whether it is a
14486 type parameter or a non-type parameter. Consider:
14488 template <typename T, typename T::X X> ...
14490 or:
14492 template <class C, class D*> ...
14494 Here, the first parameter is a type parameter, and the second is
14495 a non-type parameter. We can tell by looking at the token after
14496 the identifier -- if it is a `,', `=', or `>' then we have a type
14497 parameter. */
14499 {
14500 /* Peek at the token after `class' or `typename'. */
14502 /* If it's an ellipsis, we have a template type parameter
14503 pack. */
14506 /* If it's an identifier, skip it. */
14509 /* Now, see if the token looks like the end of a template
14510 parameter. */
14515 }
14517 /* Otherwise, it is a non-type parameter or a constrained parameter.
14519 [temp.param]
14521 When parsing a default template-argument for a non-type
14522 template-parameter, the first non-nested `>' is taken as the end
14523 of the template parameter-list rather than a greater-than
14524 operator. */
14525 parameter_declarator
14532 /* If the parameter declaration is marked as a parameter pack, set
14533 *IS_PARAMETER_PACK to notify the caller. */
14538 {
14539 /* Can happen in some cases of erroneous input (c++/34892). */
14541 /* Consume the `...' for better error recovery. */
14543 }
14545 // The parameter may have been constrained.
14548 parameter_declarator,
14549 is_non_type,
14550 is_parameter_pack);
14552 // Now we're sure that the parameter is a non-type parameter.
14563 }
14565 /* Parse a type-parameter.
14567 type-parameter:
14568 class identifier [opt]
14569 class identifier [opt] = type-id
14570 typename identifier [opt]
14571 typename identifier [opt] = type-id
14572 template < template-parameter-list > class identifier [opt]
14573 template < template-parameter-list > class identifier [opt]
14574 = id-expression
14576 GNU Extension (variadic templates):
14578 type-parameter:
14579 class ... identifier [opt]
14580 typename ... identifier [opt]
14582 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
14583 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
14584 the declaration of the parameter.
14586 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
14588 static tree
14590 {
14592 tree parameter;
14594 /* Look for a keyword to tell us what kind of parameter this is. */
14600 {
14603 {
14604 tree identifier;
14605 tree default_argument;
14607 /* If the next token is an ellipsis, we have a template
14608 argument pack. */
14610 {
14611 /* Consume the `...' token. */
14616 }
14618 /* If the next token is an identifier, then it names the
14619 parameter. */
14622 else
14625 /* Create the parameter. */
14628 /* If the next token is an `=', we have a default argument. */
14630 {
14631 default_argument
14634 /* Template parameter packs cannot have default
14635 arguments. */
14637 {
14640 "template parameter pack %qD cannot have a "
14642 else
14644 "template parameter packs cannot have "
14647 }
14650 }
14651 else
14654 /* Create the combined representation of the parameter and the
14655 default argument. */
14657 }
14661 {
14662 tree identifier;
14663 tree default_argument;
14665 /* Look for the `<'. */
14667 /* Parse the template-parameter-list. */
14669 /* Look for the `>'. */
14672 // If template requirements are present, parse them.
14678 /* Look for the `class' or 'typename' keywords. */
14680 /* If the next token is an ellipsis, we have a template
14681 argument pack. */
14683 {
14684 /* Consume the `...' token. */
14689 }
14690 /* If the next token is an `=', then there is a
14691 default-argument. If the next token is a `>', we are at
14692 the end of the parameter-list. If the next token is a `,',
14693 then we are at the end of this parameter. */
14697 {
14699 /* Treat invalid names as if the parameter were nameless. */
14702 }
14703 else
14706 /* Create the template parameter. */
14708 identifier);
14710 /* If the next token is an `=', then there is a
14711 default-argument. */
14713 {
14714 default_argument
14717 /* Template parameter packs cannot have default
14718 arguments. */
14720 {
14723 "template parameter pack %qD cannot "
14725 identifier);
14726 else
14730 }
14731 }
14732 else
14735 /* Create the combined representation of the parameter and the
14736 default argument. */
14738 }
14744 }
14747 }
14749 /* Parse a template-id.
14751 template-id:
14752 template-name < template-argument-list [opt] >
14754 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
14755 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
14756 returned. Otherwise, if the template-name names a function, or set
14757 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
14758 names a class, returns a TYPE_DECL for the specialization.
14760 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
14761 uninstantiated templates. */
14763 static tree
14769 {
14770 tree templ;
14771 tree arguments;
14772 tree template_id;
14777 /* If the next token corresponds to a template-id, there is no need
14778 to reparse it. */
14781 {
14784 }
14786 /* Avoid performing name lookup if there is no possibility of
14787 finding a template-id. */
14790 && !cp_parser_nth_token_starts_template_argument_list_p
14792 {
14795 }
14797 /* Remember where the template-id starts. */
14803 /* Parse the template-name. */
14806 check_dependency_p,
14807 is_declaration,
14808 tag_type,
14811 {
14814 }
14816 /* Since we're going to preserve any side-effects from this parse, set up a
14817 firewall to protect our callers from cp_parser_commit_to_tentative_parse
14818 in the template arguments. */
14821 /* If we find the sequence `[:' after a template-name, it's probably
14822 a digraph-typo for `< ::'. Substitute the tokens and check if we can
14823 parse correctly the argument list. */
14830 {
14832 /* Change `:' into `::'. */
14834 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
14835 CPP_LESS. */
14838 /* Parse the arguments. */
14841 {
14842 /* If we couldn't parse an argument list, then we revert our changes
14843 and return simply an error. Maybe this is not a template-id
14844 after all. */
14849 }
14850 /* Otherwise, emit an error about the invalid digraph, but continue
14851 parsing because we got our argument list. */
14854 {
14857 "%<<:%> is an alternate spelling for %<[%>."
14860 {
14862 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
14865 }
14866 }
14867 }
14868 else
14869 {
14870 /* Look for the `<' that starts the template-argument-list. */
14872 {
14875 }
14876 /* Parse the arguments. */
14878 }
14880 /* Build a representation of the specialization. */
14883 TEMPLATE_ID_EXPR,
14887 {
14889 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
14890 template (rather than some instantiation thereof) only if
14891 is not nested within some other construct. For example, in
14892 "template <typename T> void f(T) { A<T>::", A<T> is just an
14893 instantiation of A. */
14896 CPP_SCOPE));
14897 template_id
14899 }
14900 /* A template-like identifier may be a partial concept id. */
14906 {
14910 }
14911 else
14912 {
14913 /* If it's not a class-template or a template-template, it should be
14914 a function-template. */
14922 }
14924 /* If parsing tentatively, replace the sequence of tokens that makes
14925 up the template-id with a CPP_TEMPLATE_ID token. That way,
14926 should we re-parse the token stream, we will not have to repeat
14927 the effort required to do the parse, nor will we issue duplicate
14928 error messages about problems during instantiation of the
14929 template. */
14931 /* Don't do this if we had a parse error in a declarator; re-parsing
14932 might succeed if a name changes meaning (60361). */
14936 {
14939 /* Reset the contents of the START_OF_ID token. */
14942 /* Update the location to be of the form:
14943 template-name < template-argument-list [opt] >
14944 ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
14945 with caret == start at the start of the template-name,
14946 ranging until the closing '>'. */
14947 location_t finish_loc
14949 location_t combined_loc
14953 /* Retrieve any deferred checks. Do not pop this access checks yet
14954 so the memory will not be reclaimed during token replacing below. */
14960 /* Purge all subsequent tokens. */
14963 /* ??? Can we actually assume that, if template_id ==
14964 error_mark_node, we will have issued a diagnostic to the
14965 user, as opposed to simply marking the tentative parse as
14966 failed? */
14969 }
14973 }
14975 /* Parse a template-name.
14977 template-name:
14978 identifier
14980 The standard should actually say:
14982 template-name:
14983 identifier
14984 operator-function-id
14986 A defect report has been filed about this issue.
14988 A conversion-function-id cannot be a template name because they cannot
14989 be part of a template-id. In fact, looking at this code:
14991 a.operator K<int>()
14993 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
14994 It is impossible to call a templated conversion-function-id with an
14995 explicit argument list, since the only allowed template parameter is
14996 the type to which it is converting.
14998 If TEMPLATE_KEYWORD_P is true, then we have just seen the
14999 `template' keyword, in a construction like:
15001 T::template f<3>()
15003 In that case `f' is taken to be a template-name, even though there
15004 is no way of knowing for sure.
15006 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
15007 name refers to a set of overloaded functions, at least one of which
15008 is a template, or an IDENTIFIER_NODE with the name of the template,
15009 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
15010 names are looked up inside uninstantiated templates. */
15012 static tree
15019 {
15020 tree identifier;
15021 tree decl;
15022 tree fns;
15025 /* If the next token is `operator', then we have either an
15026 operator-function-id or a conversion-function-id. */
15028 {
15029 /* We don't know whether we're looking at an
15030 operator-function-id or a conversion-function-id. */
15032 /* Try an operator-function-id. */
15034 /* If that didn't work, try a conversion-function-id. */
15036 {
15039 }
15040 }
15041 /* Look for the identifier. */
15042 else
15045 /* If we didn't find an identifier, we don't have a template-id. */
15049 /* If the name immediately followed the `template' keyword, then it
15050 is a template-name. However, if the next token is not `<', then
15051 we do not treat it as a template-name, since it is not being used
15052 as part of a template-id. This enables us to handle constructs
15053 like:
15055 template <typename T> struct S { S(); };
15056 template <typename T> S<T>::S();
15058 correctly. We would treat `S' as a template -- if it were `S<T>'
15059 -- but we do not if there is no `<'. */
15063 {
15064 /* In a declaration, in a dependent context, we pretend that the
15065 "template" keyword was present in order to improve error
15066 recovery. For example, given:
15068 template <typename T> void f(T::X<int>);
15070 we want to treat "X<int>" as a template-id. */
15072 && !template_keyword_p
15074 && check_dependency_p
15076 /* Do not do this for dtors (or ctors), since they never
15077 need the template keyword before their name. */
15079 {
15082 /* Explain what went wrong. */
15084 identifier);
15087 /* If parsing tentatively, find the location of the "<" token. */
15090 /* Parse the template arguments so that we can issue error
15091 messages about them. */
15094 /* Skip tokens until we find a good place from which to
15095 continue parsing. */
15100 /* If parsing tentatively, permanently remove the
15101 template argument list. That will prevent duplicate
15102 error messages from being issued about the missing
15103 "template" keyword. */
15109 }
15111 /* If the "template" keyword is present, then there is generally
15112 no point in doing name-lookup, so we just return IDENTIFIER.
15113 But, if the qualifying scope is non-dependent then we can
15114 (and must) do name-lookup normally. */
15120 }
15122 /* Look up the name. */
15124 tag_type,
15127 check_dependency_p,
15133 /* If DECL is a template, then the name was a template-name. */
15135 {
15139 }
15140 else
15141 {
15144 /* The standard does not explicitly indicate whether a name that
15145 names a set of overloaded declarations, some of which are
15146 templates, is a template-name. However, such a name should
15147 be a template-name; otherwise, there is no way to form a
15148 template-id for the overloaded templates. */
15156 {
15157 /* The name does not name a template. */
15160 }
15161 }
15163 /* If DECL is dependent, and refers to a function, then just return
15164 its name; we will look it up again during template instantiation. */
15166 {
15170 }
15173 }
15175 /* Parse a template-argument-list.
15177 template-argument-list:
15178 template-argument ... [opt]
15179 template-argument-list , template-argument ... [opt]
15181 Returns a TREE_VEC containing the arguments. */
15183 static tree
15185 {
15190 tree vec;
15197 /* Even if the template-id appears in an integral
15198 constant-expression, the contents of the argument list do
15199 not. */
15205 /* Parse the arguments. */
15206 do
15207 {
15208 tree argument;
15211 /* Consume the comma. */
15214 /* Parse the template-argument. */
15217 /* If the next token is an ellipsis, we're expanding a template
15218 argument pack. */
15220 {
15222 {
15226 }
15227 /* Consume the `...' token. */
15230 /* Make the argument into a TYPE_PACK_EXPANSION or
15231 EXPR_PACK_EXPANSION. */
15233 }
15236 {
15240 {
15243 }
15244 else
15246 }
15248 }
15264 }
15266 /* Parse a template-argument.
15268 template-argument:
15269 assignment-expression
15270 type-id
15271 id-expression
15273 The representation is that of an assignment-expression, type-id, or
15274 id-expression -- except that the qualified id-expression is
15275 evaluated, so that the value returned is either a DECL or an
15276 OVERLOAD.
15278 Although the standard says "assignment-expression", it forbids
15279 throw-expressions or assignments in the template argument.
15280 Therefore, we use "conditional-expression" instead. */
15282 static tree
15284 {
15285 tree argument;
15291 cp_id_kind idk;
15293 /* There's really no way to know what we're looking at, so we just
15294 try each alternative in order.
15296 [temp.arg]
15298 In a template-argument, an ambiguity between a type-id and an
15299 expression is resolved to a type-id, regardless of the form of
15300 the corresponding template-parameter.
15302 Therefore, we try a type-id first. */
15305 /* If there was no error parsing the type-id but the next token is a
15306 '>>', our behavior depends on which dialect of C++ we're
15307 parsing. In C++98, we probably found a typo for '> >'. But there
15308 are type-id which are also valid expressions. For instance:
15310 struct X { int operator >> (int); };
15311 template <int V> struct Foo {};
15312 Foo<X () >> 5> r;
15314 Here 'X()' is a valid type-id of a function type, but the user just
15315 wanted to write the expression "X() >> 5". Thus, we remember that we
15316 found a valid type-id, but we still try to parse the argument as an
15317 expression to see what happens.
15319 In C++0x, the '>>' will be considered two separate '>'
15320 tokens. */
15324 {
15327 }
15328 else
15329 {
15330 /* If the next token isn't a `,' or a `>', then this argument wasn't
15331 really finished. This means that the argument is not a valid
15332 type-id. */
15335 /* If that worked, we're done. */
15338 }
15339 /* We're still not sure what the argument will be. */
15341 /* Try a template. */
15349 /* If the next token isn't a `,' or a `>', then this argument wasn't
15350 really finished. */
15354 {
15355 /* Figure out what is being referred to. If the id-expression
15356 was for a class template specialization, then we will have a
15357 TYPE_DECL at this point. There is no need to do name lookup
15358 at this point in that case. */
15361 none_type,
15367 /* Handle a constrained-type-specifier for a non-type template
15368 parameter. */
15374 }
15376 {
15380 }
15381 /* It must be a non-type argument. In C++17 any constant-expression is
15382 allowed. */
15386 /* Otherwise, the permitted cases are given in [temp.arg.nontype]:
15388 -- an integral constant-expression of integral or enumeration
15389 type; or
15391 -- the name of a non-type template-parameter; or
15393 -- the name of an object or function with external linkage...
15395 -- the address of an object or function with external linkage...
15397 -- a pointer to member... */
15398 /* Look for a non-type template parameter. */
15400 {
15412 }
15414 /* If the next token is "&", the argument must be the address of an
15415 object or function with external linkage. */
15418 {
15421 }
15422 /* See if we might have an id-expression. */
15429 {
15432 address_p,
15439 else
15440 {
15441 tree probe;
15444 {
15445 /* Strip the dereference temporarily. */
15448 }
15450 /* If we're in a template, we represent a qualified-id referring
15451 to a static data member as a SCOPE_REF even if the scope isn't
15452 dependent so that we can check access control later. */
15457 {
15458 /* A variable without external linkage might still be a
15459 valid constant-expression, so no error is issued here
15460 if the external-linkage check fails. */
15463 }
15465 /* All overloaded functions are allowed; if the external
15466 linkage test does not pass, an error will be issued
15467 later. */
15468 ;
15472 /* A pointer-to-member. */
15473 ;
15475 ;
15476 else
15480 {
15483 tf_warning_or_error);
15484 else
15487 }
15488 }
15489 }
15490 /* If the argument started with "&", there are no other valid
15491 alternatives at this point. */
15493 {
15496 }
15498 general_expr:
15499 /* If the argument wasn't successfully parsed as a type-id followed
15500 by '>>', the argument can only be a constant expression now.
15501 Otherwise, we try parsing the constant-expression tentatively,
15502 because the argument could really be a type-id. */
15508 else
15509 {
15510 /* With C++17 generalized non-type template arguments we need to handle
15511 lvalue constant expressions, too. */
15514 }
15522 /* We did our best to parse the argument as a non type-id, but that
15523 was the only alternative that matched (albeit with a '>' after
15524 it). We can assume it's just a typo from the user, and a
15525 diagnostic will then be issued. */
15527 }
15529 /* Parse an explicit-instantiation.
15531 explicit-instantiation:
15532 template declaration
15534 Although the standard says `declaration', what it really means is:
15536 explicit-instantiation:
15537 template decl-specifier-seq [opt] declarator [opt] ;
15539 Things like `template int S<int>::i = 5, int S<double>::j;' are not
15540 supposed to be allowed. A defect report has been filed about this
15541 issue.
15543 GNU Extension:
15545 explicit-instantiation:
15546 storage-class-specifier template
15547 decl-specifier-seq [opt] declarator [opt] ;
15548 function-specifier template
15549 decl-specifier-seq [opt] declarator [opt] ; */
15551 static void
15553 {
15555 cp_decl_specifier_seq decl_specifiers;
15560 /* Look for an (optional) storage-class-specifier or
15561 function-specifier. */
15563 {
15564 extension_specifier
15567 extension_specifier
15570 }
15572 /* Look for the `template' keyword. */
15574 /* Let the front end know that we are processing an explicit
15575 instantiation. */
15577 /* [temp.explicit] says that we are supposed to ignore access
15578 control while processing explicit instantiation directives. */
15580 /* Parse a decl-specifier-seq. */
15582 CP_PARSER_FLAGS_OPTIONAL,
15585 /* If there was exactly one decl-specifier, and it declared a class,
15586 and there's no declarator, then we have an explicit type
15587 instantiation. */
15589 {
15590 tree type;
15594 /* Turn access control back on for names used during
15595 template instantiation. */
15600 }
15601 else
15602 {
15604 tree decl;
15606 /* Parse the declarator. */
15607 declarator
15618 {
15621 "explicit instantiation shall not use"
15625 "explicit instantiation shall not use"
15630 /* Turn access control back on for names used during
15631 template instantiation. */
15633 /* Do the explicit instantiation. */
15635 }
15636 else
15637 {
15639 /* Skip the body of the explicit instantiation. */
15641 }
15642 }
15643 /* We're done with the instantiation. */
15649 }
15651 /* Parse an explicit-specialization.
15653 explicit-specialization:
15654 template < > declaration
15656 Although the standard says `declaration', what it really means is:
15658 explicit-specialization:
15659 template <> decl-specifier [opt] init-declarator [opt] ;
15660 template <> function-definition
15661 template <> explicit-specialization
15662 template <> template-declaration */
15664 static void
15666 {
15670 /* Look for the `template' keyword. */
15672 /* Look for the `<'. */
15674 /* Look for the `>'. */
15676 /* We have processed another parameter list. */
15678 /* [temp]
15680 A template ... explicit specialization ... shall not have C
15681 linkage. */
15683 {
15685 /* Give it C++ linkage to avoid confusing other parts of the
15686 front end. */
15689 }
15690 else
15692 /* Let the front end know that we are beginning a specialization. */
15694 {
15697 }
15699 /* If the next keyword is `template', we need to figure out whether
15700 or not we're looking a template-declaration. */
15702 {
15707 else
15709 }
15710 else
15711 /* Parse the dependent declaration. */
15717 /* We're done with the specialization. */
15719 /* For the erroneous case of a template with C linkage, we pushed an
15720 implicit C++ linkage scope; exit that scope now. */
15723 /* We're done with this parameter list. */
15725 }
15727 /* Parse a type-specifier.
15729 type-specifier:
15730 simple-type-specifier
15731 class-specifier
15732 enum-specifier
15733 elaborated-type-specifier
15734 cv-qualifier
15736 GNU Extension:
15738 type-specifier:
15739 __complex__
15741 Returns a representation of the type-specifier. For a
15742 class-specifier, enum-specifier, or elaborated-type-specifier, a
15743 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
15745 The parser flags FLAGS is used to control type-specifier parsing.
15747 If IS_DECLARATION is TRUE, then this type-specifier is appearing
15748 in a decl-specifier-seq.
15750 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
15751 class-specifier, enum-specifier, or elaborated-type-specifier, then
15752 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
15753 if a type is declared; 2 if it is defined. Otherwise, it is set to
15754 zero.
15756 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
15757 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
15758 is set to FALSE. */
15760 static tree
15762 cp_parser_flags flags,
15767 {
15773 /* Assume this type-specifier does not declare a new type. */
15776 /* And that it does not specify a cv-qualifier. */
15779 /* Peek at the next token. */
15782 /* If we're looking at a keyword, we can use that to guide the
15783 production we choose. */
15786 {
15791 /* Look for the enum-specifier. */
15793 /* If that worked, we're done. */
15795 {
15800 type_spec,
15801 token,
15804 }
15805 else
15808 /* Any of these indicate either a class-specifier, or an
15809 elaborated-type-specifier. */
15816 /* Parse tentatively so that we can back up if we don't find a
15817 class-specifier. */
15819 /* Look for the class-specifier. */
15822 /* If that worked, we're done. */
15824 {
15829 type_spec,
15830 token,
15833 }
15835 /* Fall through. */
15836 elaborated_type_specifier:
15837 /* We're declaring (not defining) a class or enum. */
15841 /* Fall through. */
15843 /* Look for an elaborated-type-specifier. */
15844 type_spec
15845 = (cp_parser_elaborated_type_specifier
15848 is_declaration));
15851 type_spec,
15852 token,
15875 /* The `__complex__' keyword is a GNU extension. */
15881 }
15883 /* Handle simple keywords. */
15885 {
15887 {
15890 }
15892 }
15894 /* If we do not already have a type-specifier, assume we are looking
15895 at a simple-type-specifier. */
15897 decl_specs,
15898 flags);
15900 /* If we didn't find a type-specifier, and a type-specifier was not
15901 optional in this context, issue an error message. */
15903 {
15906 }
15909 }
15911 /* Parse a simple-type-specifier.
15913 simple-type-specifier:
15914 :: [opt] nested-name-specifier [opt] type-name
15915 :: [opt] nested-name-specifier template template-id
15916 char
15917 wchar_t
15918 bool
15919 short
15920 int
15921 long
15922 signed
15923 unsigned
15924 float
15925 double
15926 void
15928 C++0x Extension:
15930 simple-type-specifier:
15931 auto
15932 decltype ( expression )
15933 char16_t
15934 char32_t
15935 __underlying_type ( type-id )
15937 GNU Extension:
15939 simple-type-specifier:
15940 __int128
15941 __typeof__ unary-expression
15942 __typeof__ ( type-id )
15943 __typeof__ ( type-id ) { initializer-list , [opt] }
15945 Concepts Extension:
15947 simple-type-specifier:
15948 constrained-type-specifier
15950 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
15951 appropriately updated. */
15953 static tree
15956 cp_parser_flags flags)
15957 {
15962 /* Peek at the next token. */
15965 /* If we're looking at a keyword, things are easy. */
15967 {
16002 {
16005 }
16034 {
16035 /* The 'auto' might be the placeholder return type for a function decl
16036 with trailing return type. */
16045 {
16047 {
16054 }
16057 {
16060 }
16063 }
16067 {
16070 }
16073 {
16076 }
16077 else
16081 {
16084 "use of %<auto%> in lambda parameter declaration "
16085 "only available with "
16087 }
16090 "use of %<auto%> in parameter declaration "
16091 "only available with "
16095 "ISO C++ forbids use of %<auto%> in parameter "
16097 }
16098 else
16103 /* Since DR 743, decltype can either be a simple-type-specifier by
16104 itself or begin a nested-name-specifier. Parsing it will replace
16105 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
16106 handling below decide what to do. */
16112 /* Consume the `typeof' token. */
16114 /* Parse the operand to `typeof'. */
16116 /* If it is not already a TYPE, take its type. */
16122 token,
16131 token,
16141 token,
16146 }
16148 /* If token is an already-parsed decltype not followed by ::,
16149 it's a simple-type-specifier. */
16152 {
16155 {
16157 token,
16159 /* Remember that we are handling a decltype in order to
16160 implement the resolution of DR 1510 when the argument
16161 isn't instantiation dependent. */
16163 }
16166 }
16168 /* If the type-specifier was for a built-in type, we're done. */
16170 {
16171 /* Record the type. */
16178 type,
16179 token,
16184 /* Consume the token. */
16190 /* There is no valid C++ program where a non-template type is
16191 followed by a "<". That usually indicates that the user thought
16192 that the type was a template. */
16197 }
16199 /* The type-specifier must be a user-defined type. */
16201 {
16205 /* Don't gobble tokens or issue error messages if this is an
16206 optional type-specifier. */
16210 /* Look for the optional `::' operator. */
16211 global_p
16215 /* Look for the nested-name specifier. */
16216 qualified_p
16224 /* If we have seen a nested-name-specifier, and the next token
16225 is `template', then we are using the template-id production. */
16228 {
16229 /* Look for the template-id. */
16233 none_type,
16235 /* If the template-id did not name a type, we are out of
16236 luck. */
16238 {
16241 }
16242 }
16243 /* Otherwise, look for a type-name. */
16244 else
16246 /* Keep track of all name-lookups performed in class scopes. */
16248 && !global_p
16249 && !qualified_p
16253 /* If it didn't work out, we don't have a TYPE. */
16259 token,
16261 }
16263 /* If we didn't get a type-name, issue an error message. */
16265 {
16268 }
16271 {
16272 /* See if TYPE is an Objective-C type, and if so, parse and
16273 accept any protocol references following it. Do this before
16274 the cp_parser_check_for_invalid_template_id() call, because
16275 Objective-C types can be followed by '<...>' which would
16276 enclose protocol names rather than template arguments, and so
16277 everything is fine. */
16280 {
16284 /* Clobber the "unqualified" type previously entered into
16285 DECL_SPECS with the new, improved protocol-qualified version. */
16290 }
16292 /* There is no valid C++ program where a non-template type is
16293 followed by a "<". That usually indicates that the user
16294 thought that the type was a template. */
16296 none_type,
16298 }
16301 }
16303 /* Parse a type-name.
16305 type-name:
16306 class-name
16307 enum-name
16308 typedef-name
16309 simple-template-id [in c++0x]
16311 enum-name:
16312 identifier
16314 typedef-name:
16315 identifier
16317 Concepts:
16319 type-name:
16320 concept-name
16321 partial-concept-id
16323 concept-name:
16324 identifier
16326 Returns a TYPE_DECL for the type. */
16328 static tree
16330 {
16332 }
16334 /* See above. */
16335 static tree
16337 {
16338 tree type_decl;
16340 /* We can't know yet whether it is a class-name or not. */
16342 /* Try a class-name. */
16344 typename_keyword_p,
16346 none_type,
16350 /* If it's not a class-name, keep looking. */
16352 {
16354 /* It must be a typedef-name or an enum-name. */
16358 /* It is either a simple-template-id representing an
16359 instantiation of an alias template... */
16363 none_type,
16365 /* Note that this must be an instantiation of an alias template
16366 because [temp.names]/6 says:
16368 A template-id that names an alias template specialization
16369 is a type-name.
16371 Whereas [temp.names]/7 says:
16373 A simple-template-id that names a class template
16374 specialization is a class-name.
16376 With concepts, this could also be a partial-concept-id that
16377 declares a non-type template parameter. */
16384 else
16388 /* ... Or a typedef-name or an enum-name. */
16390 }
16393 }
16395 /* Check if DECL and ARGS can form a constrained-type-specifier.
16396 If ARGS is non-null, we try to form a concept check of the
16397 form DECL<?, ARGS> where ? is a wildcard that matches any
16398 kind of template argument. If ARGS is NULL, then we try to
16399 form a concept check of the form DECL<?>. */
16401 static tree
16404 {
16407 /* If we a constrained-type-specifier cannot be deduced. */
16411 /* A constrained type specifier can only be found in an
16412 overload set or as a reference to a template declaration.
16414 FIXME: This might be masking a bug. It's possible that
16415 that the deduction below is causing template specializations
16416 to be formed with the wildcard as an argument. */
16420 /* Try to build a call expression that evaluates the
16421 concept. This can fail if the overload set refers
16422 only to non-templates. */
16428 /* Deduce the checked constraint and the prototype parameter.
16430 FIXME: In certain cases, failure to deduce should be a
16431 diagnosable error. */
16432 tree conc;
16433 tree proto;
16437 /* In template parameter scope, this results in a constrained
16438 parameter. Return a descriptor of that parm. */
16442 /* In a parameter-declaration-clause, constrained-type
16443 specifiers result in invented template parameters. */
16445 {
16448 }
16449 else
16450 {
16451 /* Otherwise, we're in a context where the constrained
16452 type name is deduced and the constraint applies
16453 after deduction. */
16455 }
16458 }
16460 /* If DECL refers to a concept, return a TYPE_DECL representing
16461 the result of using the constrained type specifier in the
16462 current context. DECL refers to a concept if
16464 - it is an overload set containing a function concept taking a single
16465 type argument, or
16467 - it is a variable concept taking a single type argument. */
16469 static tree
16471 {
16477 else
16479 }
16481 /* Check if DECL and ARGS form a partial-concept-id. If so,
16482 assign ID to the resulting constrained placeholder.
16484 Returns true if the partial-concept-id designates a placeholder
16485 and false otherwise. Note that *id is set to NULL_TREE in
16486 this case. */
16488 static tree
16490 {
16492 }
16494 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
16495 or a concept-name.
16497 enum-name:
16498 identifier
16500 typedef-name:
16501 identifier
16503 concept-name:
16504 identifier
16506 Returns a TYPE_DECL for the type. */
16508 static tree
16510 {
16511 tree type_decl;
16512 tree identifier;
16519 /* Look up the type-name. */
16524 /* If we found an overload set, then it may refer to a concept-name. */
16530 {
16531 /* See if this is an Objective-C type. */
16536 }
16538 /* Issue an error if we did not find a type-name. */
16540 /* In Objective-C, we have the complication that class names are
16541 normally type names and start declarations (eg, the
16542 "NSObject" in "NSObject *object;"), but can be used in an
16543 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
16544 is an expression. So, a classname followed by a dot is not a
16545 valid type-name. */
16548 {
16553 }
16554 /* Remember that the name was used in the definition of the
16555 current class so that we can check later to see if the
16556 meaning would have been different after the class was
16557 entirely defined. */
16563 }
16565 /* Parse an elaborated-type-specifier. Note that the grammar given
16566 here incorporates the resolution to DR68.
16568 elaborated-type-specifier:
16569 class-key :: [opt] nested-name-specifier [opt] identifier
16570 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
16571 enum-key :: [opt] nested-name-specifier [opt] identifier
16572 typename :: [opt] nested-name-specifier identifier
16573 typename :: [opt] nested-name-specifier template [opt]
16574 template-id
16576 GNU extension:
16578 elaborated-type-specifier:
16579 class-key attributes :: [opt] nested-name-specifier [opt] identifier
16580 class-key attributes :: [opt] nested-name-specifier [opt]
16581 template [opt] template-id
16582 enum attributes :: [opt] nested-name-specifier [opt] identifier
16584 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
16585 declared `friend'. If IS_DECLARATION is TRUE, then this
16586 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
16587 something is being declared.
16589 Returns the TYPE specified. */
16591 static tree
16595 {
16597 tree identifier;
16600 tree globalscope;
16603 /* See if we're looking at the `enum' keyword. */
16605 {
16606 /* Consume the `enum' token. */
16608 /* Remember that it's an enumeration type. */
16610 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
16611 enums) is used here. */
16614 {
16618 /* Consume the `struct' or `class' and parse it anyway. */
16620 }
16621 /* Parse the attributes. */
16623 }
16624 /* Or, it might be `typename'. */
16626 RID_TYPENAME))
16627 {
16628 /* Consume the `typename' token. */
16630 /* Remember that it's a `typename' type. */
16632 }
16633 /* Otherwise it must be a class-key. */
16634 else
16635 {
16639 /* Parse the attributes. */
16641 }
16643 /* Look for the `::' operator. */
16646 /* Look for the nested-name-specifier. */
16648 {
16653 is_declaration))
16655 }
16656 else
16657 /* Even though `typename' is not present, the proposed resolution
16658 to Core Issue 180 says that in `class A<T>::B', `B' should be
16659 considered a type-name, even if `A<T>' is dependent. */
16664 is_declaration);
16665 /* For everything but enumeration types, consider a template-id.
16666 For an enumeration type, consider only a plain identifier. */
16668 {
16670 tree decl;
16672 /* Allow the `template' keyword. */
16674 /* If we didn't see `template', we don't know if there's a
16675 template-id or not. */
16678 /* Parse the template-id. */
16682 tag_type,
16683 is_declaration);
16684 /* If we didn't find a template-id, look for an ordinary
16685 identifier. */
16687 ;
16688 /* We can get here when cp_parser_template_id, called by
16689 cp_parser_class_name with tag_type == none_type, succeeds
16690 and caches a BASELINK. Then, when called again here,
16691 instead of failing and returning an error_mark_node
16692 returns it (see template/typename17.C in C++11).
16693 ??? Could we diagnose this earlier? */
16695 {
16698 }
16699 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
16700 in effect, then we must assume that, upon instantiation, the
16701 template will correspond to a class. */
16705 typename_type,
16707 /* If the `typename' keyword is in effect and DECL is not a type
16708 decl, then type is non existent. */
16710 ;
16716 }
16719 {
16724 {
16727 }
16729 /* For a `typename', we needn't call xref_tag. */
16735 /* Template parameter lists apply only if we are not within a
16736 function parameter list. */
16737 bool template_parm_lists_apply
16746 /* Look up a qualified name in the usual way. */
16748 {
16749 tree decl;
16750 tree ambiguous_decls;
16753 tag_type,
16760 /* If the lookup was ambiguous, an error will already have been
16761 issued. */
16765 /* If we are parsing friend declaration, DECL may be a
16766 TEMPLATE_DECL tree node here. However, we need to check
16767 whether this TEMPLATE_DECL results in valid code. Consider
16768 the following example:
16770 namespace N {
16771 template <class T> class C {};
16772 }
16773 class X {
16774 template <class T> friend class N::C; // #1, valid code
16775 };
16776 template <class T> class Y {
16777 friend class N::C; // #2, invalid code
16778 };
16780 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
16781 name lookup of `N::C'. We see that friend declaration must
16782 be template for the code to be valid. Note that
16783 processing_template_decl does not work here since it is
16784 always 1 for the above two cases. */
16786 decl = (cp_parser_maybe_treat_template_as_class
16791 {
16793 identifier,
16796 }
16799 {
16803 allow_template);
16807 }
16809 /* Forward declarations of nested types, such as
16811 class C1::C2;
16812 class C1::C2::C3;
16814 are invalid unless all components preceding the final '::'
16815 are complete. If all enclosing types are complete, these
16816 declarations become merely pointless.
16818 Invalid forward declarations of nested types are errors
16819 caught elsewhere in parsing. Those that are pointless arrive
16820 here. */
16827 }
16828 else
16829 {
16830 /* An elaborated-type-specifier sometimes introduces a new type and
16831 sometimes names an existing type. Normally, the rule is that it
16832 introduces a new type only if there is not an existing type of
16833 the same name already in scope. For example, given:
16835 struct S {};
16836 void f() { struct S s; }
16838 the `struct S' in the body of `f' is the same `struct S' as in
16839 the global scope; the existing definition is used. However, if
16840 there were no global declaration, this would introduce a new
16841 local class named `S'.
16843 An exception to this rule applies to the following code:
16845 namespace N { struct S; }
16847 Here, the elaborated-type-specifier names a new type
16848 unconditionally; even if there is already an `S' in the
16849 containing scope this declaration names a new type.
16850 This exception only applies if the elaborated-type-specifier
16851 forms the complete declaration:
16853 [class.name]
16855 A declaration consisting solely of `class-key identifier ;' is
16856 either a redeclaration of the name in the current scope or a
16857 forward declaration of the identifier as a class name. It
16858 introduces the name into the current scope.
16860 We are in this situation precisely when the next token is a `;'.
16862 An exception to the exception is that a `friend' declaration does
16863 *not* name a new type; i.e., given:
16865 struct S { friend struct T; };
16867 `T' is not a new type in the scope of `S'.
16869 Also, `new struct S' or `sizeof (struct S)' never results in the
16870 definition of a new type; a new type can only be declared in a
16871 declaration context. */
16873 tag_scope ts;
16877 /* Friends have special name lookup rules. */
16881 CPP_SEMICOLON))
16882 /* This is a `class-key identifier ;' */
16884 else
16887 template_p =
16888 (template_parm_lists_apply
16891 /* An unqualified name was used to reference this type, so
16892 there were no qualifying templates. */
16900 }
16901 }
16906 /* Allow attributes on forward declarations of classes. */
16908 {
16918 else
16921 }
16924 {
16925 /* Indicate whether this class was declared as a `class' or as a
16926 `struct'. */
16930 }
16932 /* A "<" cannot follow an elaborated type specifier. If that
16933 happens, the user was probably trying to form a template-id. */
16938 }
16940 /* Parse an enum-specifier.
16942 enum-specifier:
16943 enum-head { enumerator-list [opt] }
16944 enum-head { enumerator-list , } [C++0x]
16946 enum-head:
16947 enum-key identifier [opt] enum-base [opt]
16948 enum-key nested-name-specifier identifier enum-base [opt]
16950 enum-key:
16951 enum
16952 enum class [C++0x]
16953 enum struct [C++0x]
16955 enum-base: [C++0x]
16956 : type-specifier-seq
16958 opaque-enum-specifier:
16959 enum-key identifier enum-base [opt] ;
16961 GNU Extensions:
16962 enum-key attributes[opt] identifier [opt] enum-base [opt]
16963 { enumerator-list [opt] }attributes[opt]
16964 enum-key attributes[opt] identifier [opt] enum-base [opt]
16965 { enumerator-list, }attributes[opt] [C++0x]
16967 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
16968 if the token stream isn't an enum-specifier after all. */
16970 static tree
16972 {
16973 tree identifier;
16975 tree prev_scope;
16977 tree attributes;
16990 /* Parse tentatively so that we can back up if we don't find a
16991 enum-specifier. */
16994 /* Caller guarantees that the current token is 'enum', an identifier
16995 possibly follows, and the token after that is an opening brace.
16996 If we don't have an identifier, fabricate an anonymous name for
16997 the enumeration being defined. */
17000 /* Parse the "class" or "struct", which indicates a scoped
17001 enumeration type in C++0x. */
17004 {
17008 /* Consume the `struct' or `class' token. */
17012 }
17016 /* Clear the qualification. */
17021 /* Figure out in what scope the declaration is being placed. */
17027 nested_name_specifier
17035 {
17036 tree name;
17040 enum_type,
17045 input_location);
17047 {
17050 {
17051 /* Are template enums allowed in ISO? */
17055 /* ignore a typename reference, for it will be solved by name
17056 in start_enum. */
17058 }
17059 }
17062 else
17063 {
17068 }
17069 }
17070 else
17071 {
17074 else
17075 {
17081 }
17082 }
17085 /* Check for the `:' that denotes a specified underlying type in C++0x.
17086 Note that a ':' could also indicate a bitfield width, however. */
17088 {
17089 cp_decl_specifier_seq type_specifiers;
17091 /* Consume the `:'. */
17094 /* Parse the type-specifier-seq. */
17099 /* At this point this is surely not elaborated type specifier. */
17108 /* If that didn't work, stop. */
17110 {
17116 }
17117 }
17119 /* Look for the `{' but don't consume it yet. */
17121 {
17123 {
17126 {
17129 }
17130 }
17131 /* An opaque-enum-specifier must have a ';' here. */
17134 {
17137 {
17140 }
17141 }
17142 }
17148 {
17150 {
17154 }
17156 {
17158 }
17159 }
17161 /* Issue an error message if type-definitions are forbidden here. */
17164 else
17165 /* Create the new type. We do this before consuming the opening
17166 brace so the enum will be recorded as being on the line of its
17167 tag (or the 'enum' keyword, if there is no tag). */
17171 /* If the next token is not '{' it is an opaque-enum-specifier or an
17172 elaborated-type-specifier. */
17174 {
17178 {
17179 /* The following catches invalid code such as:
17180 enum class S<int>::E { A, B, C }; */
17188 {
17192 nested_name_specifier);
17194 }
17197 {
17199 "%qT for enum declaration does not name a class "
17202 }
17203 /* If that scope does not contain the scope in which the
17204 class was originally declared, the program is invalid. */
17206 nested_name_specifier))
17207 {
17210 "declaration of %qD in namespace %qD which does not "
17213 else
17215 "declaration of %qD in %qD which does not "
17219 }
17220 }
17225 /* Consume the opening brace. */
17232 {
17236 }
17237 else
17238 {
17244 }
17248 /* If the next token is not '}', then there are some enumerators. */
17250 {
17254 }
17255 else
17258 /* Consume the final '}'. */
17264 }
17265 else
17266 {
17267 /* If a ';' follows, then it is an opaque-enum-specifier
17268 and additional restrictions apply. */
17270 {
17277 }
17278 }
17280 /* Look for trailing attributes to apply to this enumeration, and
17281 apply them if appropriate. */
17283 {
17286 trailing_attr,
17288 }
17290 /* Finish up the enumeration. */
17292 {
17297 }
17300 {
17302 {
17305 }
17307 {
17309 }
17310 }
17311 out:
17314 }
17316 /* Parse an enumerator-list. The enumerators all have the indicated
17317 TYPE.
17319 enumerator-list:
17320 enumerator-definition
17321 enumerator-list , enumerator-definition */
17323 static void
17325 {
17327 {
17328 /* Parse an enumerator-definition. */
17331 /* If the next token is not a ',', we've reached the end of
17332 the list. */
17335 /* Otherwise, consume the `,' and keep going. */
17337 /* If the next token is a `}', there is a trailing comma. */
17339 {
17344 }
17345 }
17346 }
17348 /* Parse an enumerator-definition. The enumerator has the indicated
17349 TYPE.
17351 enumerator-definition:
17352 enumerator
17353 enumerator = constant-expression
17355 enumerator:
17356 identifier
17358 GNU Extensions:
17360 enumerator-definition:
17361 enumerator attributes [opt]
17362 enumerator attributes [opt] = constant-expression */
17364 static void
17366 {
17367 tree identifier;
17368 tree value;
17369 location_t loc;
17371 /* Save the input location because we are interested in the location
17372 of the identifier and not the location of the explicit value. */
17375 /* Look for the identifier. */
17380 /* Parse any specified attributes. */
17383 /* If the next token is an '=', then there is an explicit value. */
17385 {
17386 /* Consume the `=' token. */
17388 /* Parse the value. */
17390 }
17391 else
17394 /* If we are processing a template, make sure the initializer of the
17395 enumerator doesn't contain any bare template parameter pack. */
17399 /* Create the enumerator. */
17401 }
17403 /* Parse a namespace-name.
17405 namespace-name:
17406 original-namespace-name
17407 namespace-alias
17409 Returns the NAMESPACE_DECL for the namespace. */
17411 static tree
17413 {
17414 tree identifier;
17415 tree namespace_decl;
17419 /* Get the name of the namespace. */
17424 /* Look up the identifier in the currently active scope. Look only
17425 for namespaces, due to:
17427 [basic.lookup.udir]
17429 When looking up a namespace-name in a using-directive or alias
17430 definition, only namespace names are considered.
17432 And:
17434 [basic.lookup.qual]
17436 During the lookup of a name preceding the :: scope resolution
17437 operator, object, function, and enumerator names are ignored.
17439 (Note that cp_parser_qualifying_entity only calls this
17440 function if the token after the name is the scope resolution
17441 operator.) */
17443 none_type,
17449 /* If it's not a namespace, issue an error. */
17452 {
17457 }
17460 }
17462 /* Parse a namespace-definition.
17464 namespace-definition:
17465 named-namespace-definition
17466 unnamed-namespace-definition
17468 named-namespace-definition:
17469 original-namespace-definition
17470 extension-namespace-definition
17472 original-namespace-definition:
17473 namespace identifier { namespace-body }
17475 extension-namespace-definition:
17476 namespace original-namespace-name { namespace-body }
17478 unnamed-namespace-definition:
17479 namespace { namespace-body } */
17481 static void
17483 {
17493 {
17497 }
17498 else
17501 /* Look for the `namespace' keyword. */
17504 /* Parse any specified attributes before the identifier. */
17507 /* Get the name of the namespace. We do not attempt to distinguish
17508 between an original-namespace-definition and an
17509 extension-namespace-definition at this point. The semantic
17510 analysis routines are responsible for that. */
17513 else
17516 /* Parse any specified attributes after the identifier. */
17519 {
17522 else
17524 }
17526 /* Start the namespace. */
17529 /* Parse any nested namespace definition. */
17531 {
17536 "nested namespace definitions only available with "
17541 {
17545 else
17546 {
17549 }
17552 }
17553 }
17555 /* Look for the `{' to validate starting the namespace. */
17558 /* "inline namespace" is equivalent to a stub namespace definition
17559 followed by a strong using directive. */
17561 {
17563 /* Set up namespace association. */
17567 /* Import the contents of the inline namespace. */
17571 }
17577 /* Parse the body of the namespace. */
17583 /* Finish the nested namespace definitions. */
17587 /* Finish the namespace. */
17589 /* Look for the final `}'. */
17591 }
17593 /* Parse a namespace-body.
17595 namespace-body:
17596 declaration-seq [opt] */
17598 static void
17600 {
17602 }
17604 /* Parse a namespace-alias-definition.
17606 namespace-alias-definition:
17607 namespace identifier = qualified-namespace-specifier ; */
17609 static void
17611 {
17612 tree identifier;
17613 tree namespace_specifier;
17617 /* Look for the `namespace' keyword. */
17619 /* Look for the identifier. */
17623 /* Look for the `=' token. */
17626 {
17628 /* Skip the definition. */
17633 }
17635 /* Look for the qualified-namespace-specifier. */
17636 namespace_specifier
17638 /* Look for the `;' token. */
17641 /* Register the alias in the symbol table. */
17643 }
17645 /* Parse a qualified-namespace-specifier.
17647 qualified-namespace-specifier:
17648 :: [opt] nested-name-specifier [opt] namespace-name
17650 Returns a NAMESPACE_DECL corresponding to the specified
17651 namespace. */
17653 static tree
17655 {
17656 /* Look for the optional `::'. */
17660 /* Look for the optional nested-name-specifier. */
17668 }
17670 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
17671 access declaration.
17673 using-declaration:
17674 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
17675 using :: unqualified-id ;
17677 access-declaration:
17678 qualified-id ;
17680 */
17682 static bool
17685 {
17689 tree decl;
17690 tree identifier;
17691 tree qscope;
17696 {
17699 }
17700 else
17701 {
17702 /* Look for the `using' keyword. */
17705 /* Peek at the next token. */
17707 /* See if it's `typename'. */
17709 {
17710 /* Remember that we've seen it. */
17712 /* Consume the `typename' token. */
17714 }
17715 }
17717 /* Look for the optional global scope qualification. */
17718 global_scope_p
17723 /* If we saw `typename', or didn't see `::', then there must be a
17724 nested-name-specifier present. */
17726 {
17732 {
17735 }
17736 }
17737 /* Otherwise, we could be in either of the two productions. In that
17738 case, treat the nested-name-specifier as optional. */
17739 else
17751 /* Something has already gone wrong; there's no need to parse
17752 further. Since an error has occurred, the return value of
17753 cp_parser_parse_definitely will be false, as required. */
17757 /* Parse the unqualified-id. */
17765 {
17770 }
17772 /* The function we call to handle a using-declaration is different
17773 depending on what scope we are in. */
17775 ;
17778 /* [namespace.udecl]
17780 A using declaration shall not name a template-id. */
17783 else
17784 {
17786 {
17787 /* Create the USING_DECL. */
17794 {
17797 }
17798 else
17799 /* Add it to the list of members in this class. */
17801 }
17802 else
17803 {
17805 identifier,
17812 {
17815 }
17818 else
17820 }
17821 }
17823 /* Look for the final `;'. */
17828 "access declarations are deprecated "
17829 "in favour of using-declarations; "
17833 }
17835 /* Parse an alias-declaration.
17837 alias-declaration:
17838 using identifier attribute-specifier-seq [opt] = type-id */
17840 static tree
17842 {
17844 location_t id_location;
17846 cp_decl_specifier_seq decl_specs;
17850 /* Look for the `using' keyword. */
17851 cp_token *using_token
17873 /* Now we are going to parse the type-id of the declaration. */
17875 /*
17876 [dcl.type]/3 says:
17878 "A type-specifier-seq shall not define a class or enumeration
17879 unless it appears in the type-id of an alias-declaration (7.1.3) that
17880 is not the declaration of a template-declaration."
17882 In other words, if we currently are in an alias template, the
17883 type-id should not define a type.
17885 So let's set parser->type_definition_forbidden_message in that
17886 case; cp_parser_check_type_definition (called by
17887 cp_parser_class_specifier) will then emit an error if a type is
17888 defined in the type-id. */
17890 {
17894 }
17898 /* Restore the error message if need be. */
17904 {
17907 }
17909 /* A typedef-name can also be introduced by an alias-declaration. The
17910 identifier following the using keyword becomes a typedef-name. It has
17911 the same semantics as if it were introduced by the typedef
17912 specifier. In particular, it does not define a new type and it shall
17913 not appear in the type-id. */
17918 {
17921 ds_attribute,
17922 attrs_token);
17923 }
17925 ds_typedef,
17926 using_token);
17928 ds_alias,
17929 using_token);
17938 else
17944 // Attach constraints to the alias declaration.
17946 {
17950 }
17957 /* If decl is a template, return its TEMPLATE_DECL so that it gets
17958 added into the symbol table; otherwise, return the TYPE_DECL. */
17962 {
17966 }
17969 }
17971 /* Parse a using-directive.
17973 using-directive:
17974 using namespace :: [opt] nested-name-specifier [opt]
17975 namespace-name ; */
17977 static void
17979 {
17980 tree namespace_decl;
17981 tree attribs;
17983 /* Look for the `using' keyword. */
17985 /* And the `namespace' keyword. */
17987 /* Look for the optional `::' operator. */
17989 /* And the optional nested-name-specifier. */
17995 /* Get the namespace being used. */
17997 /* And any specified attributes. */
17999 /* Update the symbol table. */
18001 /* Look for the final `;'. */
18003 }
18005 /* Parse an asm-definition.
18007 asm-definition:
18008 asm ( string-literal ) ;
18010 GNU Extension:
18012 asm-definition:
18013 asm volatile [opt] ( string-literal ) ;
18014 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
18015 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18016 : asm-operand-list [opt] ) ;
18017 asm volatile [opt] ( string-literal : asm-operand-list [opt]
18018 : asm-operand-list [opt]
18019 : asm-clobber-list [opt] ) ;
18020 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
18021 : asm-clobber-list [opt]
18022 : asm-goto-list ) ; */
18024 static void
18026 {
18027 tree string;
18032 tree asm_stmt;
18040 /* Look for the `asm' keyword. */
18045 {
18048 }
18050 /* See if the next token is `volatile'. */
18053 {
18054 /* Remember that we saw the `volatile' keyword. */
18056 /* Consume the token. */
18058 }
18062 {
18063 /* Remember that we saw the `goto' keyword. */
18065 /* Consume the token. */
18067 }
18068 /* Look for the opening `('. */
18071 /* Look for the string. */
18074 {
18078 }
18080 /* If we're allowing GNU extensions, check for the extended assembly
18081 syntax. Unfortunately, the `:' tokens need not be separated by
18082 a space in C, and so, for compatibility, we tolerate that here
18083 too. Doing that means that we have to treat the `::' operator as
18084 two `:' tokens. */
18089 {
18094 /* The extended syntax was used. */
18097 /* Look for outputs. */
18099 {
18100 /* Consume the `:'. */
18102 /* Parse the output-operands. */
18104 CPP_COLON)
18106 CPP_SCOPE)
18108 CPP_CLOSE_PAREN)
18110 {
18114 }
18115 }
18116 /* If the next token is `::', there are no outputs, and the
18117 next token is the beginning of the inputs. */
18119 /* The inputs are coming next. */
18122 /* Look for inputs. */
18125 {
18126 /* Consume the `:' or `::'. */
18128 /* Parse the output-operands. */
18130 CPP_COLON)
18132 CPP_SCOPE)
18134 CPP_CLOSE_PAREN))
18135 {
18139 }
18140 }
18142 /* The clobbers are coming next. */
18145 /* Look for clobbers. */
18148 {
18150 /* Consume the `:' or `::'. */
18152 /* Parse the clobbers. */
18154 CPP_COLON)
18156 CPP_CLOSE_PAREN))
18158 }
18161 /* The labels are coming next. */
18164 /* Look for labels. */
18167 {
18169 /* Consume the `:' or `::'. */
18171 /* Parse the labels. */
18173 }
18177 }
18181 /* Look for the closing `)'. */
18189 {
18190 /* Create the ASM_EXPR. */
18192 {
18195 /* If the extended syntax was not used, mark the ASM_EXPR. */
18197 {
18203 }
18204 }
18205 else
18207 }
18208 }
18210 /* Declarators [gram.dcl.decl] */
18212 /* Parse an init-declarator.
18214 init-declarator:
18215 declarator initializer [opt]
18217 GNU Extension:
18219 init-declarator:
18220 declarator asm-specification [opt] attributes [opt] initializer [opt]
18222 function-definition:
18223 decl-specifier-seq [opt] declarator ctor-initializer [opt]
18224 function-body
18225 decl-specifier-seq [opt] declarator function-try-block
18227 GNU Extension:
18229 function-definition:
18230 __extension__ function-definition
18232 TM Extension:
18234 function-definition:
18235 decl-specifier-seq [opt] declarator function-transaction-block
18237 The DECL_SPECIFIERS apply to this declarator. Returns a
18238 representation of the entity declared. If MEMBER_P is TRUE, then
18239 this declarator appears in a class scope. The new DECL created by
18240 this declarator is returned.
18242 The CHECKS are access checks that should be performed once we know
18243 what entity is being declared (and, therefore, what classes have
18244 befriended it).
18246 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
18247 for a function-definition here as well. If the declarator is a
18248 declarator for a function-definition, *FUNCTION_DEFINITION_P will
18249 be TRUE upon return. By that point, the function-definition will
18250 have been completely parsed.
18252 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
18253 is FALSE.
18255 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
18256 parsed declaration if it is an uninitialized single declarator not followed
18257 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
18258 if present, will not be consumed. If returned, this declarator will be
18259 created with SD_INITIALIZED but will not call cp_finish_decl.
18261 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
18262 and there is an initializer, the pointed location_t is set to the
18263 location of the '=' or `(', or '{' in C++11 token introducing the
18264 initializer. */
18266 static tree
18276 {
18280 tree prefix_attributes;
18282 tree asm_specification;
18283 tree initializer;
18285 tree scope;
18287 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
18288 initialized with "= ..", CPP_OPEN_PAREN if initialized with
18289 "(...)". */
18300 /* Gather the attributes that were provided with the
18301 decl-specifiers. */
18304 /* Assume that this is not the declarator for a function
18305 definition. */
18309 /* Default arguments are only permitted for function parameters. */
18313 /* Defer access checks while parsing the declarator; we cannot know
18314 what names are accessible until we know what is being
18315 declared. */
18318 /* Parse the declarator. */
18320 declarator
18325 /* Gather up the deferred checks. */
18330 /* If the DECLARATOR was erroneous, there's no need to go
18331 further. */
18335 /* Check that the number of template-parameter-lists is OK. */
18345 /* Figure out what scope the entity declared by the DECLARATOR is
18346 located in. `grokdeclarator' sometimes changes the scope, so
18347 we compute it now. */
18350 /* Perform any lookups in the declared type which were thought to be
18351 dependent, but are not in the scope of the declarator. */
18352 decl_specifiers->type
18355 /* If we're allowing GNU extensions, look for an
18356 asm-specification. */
18358 {
18359 /* Look for an asm-specification. */
18362 }
18363 else
18366 /* Look for attributes. */
18370 /* Peek at the next token. */
18376 {
18377 /* Check to see if the token indicates the start of a
18378 function-definition. */
18380 {
18382 {
18383 /* If a function-definition should not appear here, issue an
18384 error message. */
18388 }
18390 location_t func_brace_location
18393 /* Neither attributes nor an asm-specification are allowed
18394 on a function-definition. */
18397 "an asm-specification is not allowed "
18401 "attributes are not allowed "
18403 /* This is a function-definition. */
18406 /* Parse the function definition. */
18409 decl_specifiers,
18410 declarator,
18411 prefix_attributes);
18412 else
18413 decl =
18414 (cp_parser_function_definition_from_specifiers_and_declarator
18418 {
18419 /* This is where the prologue starts... */
18422 }
18425 }
18426 }
18428 {
18429 /* A non-template declaration involving a function parameter list
18430 containing an implicit template parameter will be made into a
18431 template. If the resulting declaration is not going to be an
18432 actual function then finish the template scope here to prevent it.
18433 An error message will be issued once we have a decl to talk about.
18435 FIXME probably we should do type deduction rather than create an
18436 implicit template, but the standard currently doesn't allow it. */
18439 }
18441 /* [dcl.dcl]
18443 Only in function declarations for constructors, destructors, and
18444 type conversions can the decl-specifier-seq be omitted.
18446 We explicitly postpone this check past the point where we handle
18447 function-definitions because we tolerate function-definitions
18448 that are missing their return types in some modes. */
18450 {
18454 }
18456 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
18460 {
18471 {
18477 }
18478 }
18479 else
18480 {
18481 /* If the init-declarator isn't initialized and isn't followed by a
18482 `,' or `;', it's not a valid init-declarator. */
18485 {
18488 else
18489 {
18493 }
18494 }
18497 }
18499 /* Because start_decl has side-effects, we should only call it if we
18500 know we're going ahead. By this point, we know that we cannot
18501 possibly be looking at any other construct. */
18504 /* Enter the newly declared entry in the symbol table. If we're
18505 processing a declaration in a class-specifier, we wait until
18506 after processing the initializer. */
18508 {
18516 /* Adjust location of decl if declarator->id_loc is more appropriate:
18517 set, and decl wasn't merged with another decl, in which case its
18518 location would be different from input_location, and more accurate. */
18523 }
18525 /* Enter the SCOPE. That way unqualified names appearing in the
18526 initializer will be looked up in SCOPE. */
18529 /* Perform deferred access control checks, now that we know in which
18530 SCOPE the declared entity resides. */
18532 {
18535 /* If the entity being declared is a function, pretend that we
18536 are in its scope. If it is a `friend', it may have access to
18537 things that would not otherwise be accessible. */
18539 {
18542 }
18544 /* Perform access checks for template parameters. */
18547 /* Perform the access control checks for the declarator and the
18548 decl-specifiers. */
18551 /* Restore the saved value. */
18554 }
18556 /* Parse the initializer. */
18561 {
18563 {
18566 else
18567 {
18568 /* If the declaration was erroneous, we don't really
18569 know what the user intended, so just silently
18570 consume the initializer. */
18577 }
18578 }
18579 else
18580 {
18581 /* We want to record the extra mangling scope for in-class
18582 initializers of class members and initializers of static data
18583 member templates. The former involves deferring
18584 parsing of the initializer until end of class as with default
18585 arguments. So right here we only handle the latter. */
18595 }
18596 }
18598 /* The old parser allows attributes to appear after a parenthesized
18599 initializer. Mark Mitchell proposed removing this functionality
18600 on the GCC mailing lists on 2002-08-13. This parser accepts the
18601 attributes -- but ignores them. */
18608 /* And now complain about a non-function implicit template. */
18613 /* For an in-class declaration, use `grokfield' to create the
18614 declaration. */
18616 {
18618 {
18621 }
18630 }
18632 /* Finish processing the declaration. But, skip member
18633 declarations. */
18635 {
18638 asm_specification,
18639 /* If the initializer is in parentheses, then this is
18640 a direct-initialization, which means that an
18641 `explicit' constructor is OK. Otherwise, an
18642 `explicit' constructor cannot be used. */
18645 }
18648 /* Core issue #226 (C++0x only): A default template-argument
18649 shall not be specified in a friend class template
18650 declaration. */
18659 {
18662 else
18664 }
18667 }
18669 /* Parse a declarator.
18671 declarator:
18672 direct-declarator
18673 ptr-operator declarator
18675 abstract-declarator:
18676 ptr-operator abstract-declarator [opt]
18677 direct-abstract-declarator
18679 GNU Extensions:
18681 declarator:
18682 attributes [opt] direct-declarator
18683 attributes [opt] ptr-operator declarator
18685 abstract-declarator:
18686 attributes [opt] ptr-operator abstract-declarator [opt]
18687 attributes [opt] direct-abstract-declarator
18689 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
18690 detect constructor, destructor or conversion operators. It is set
18691 to -1 if the declarator is a name, and +1 if it is a
18692 function. Otherwise it is set to zero. Usually you just want to
18693 test for >0, but internally the negative value is used.
18695 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
18696 a decl-specifier-seq unless it declares a constructor, destructor,
18697 or conversion. It might seem that we could check this condition in
18698 semantic analysis, rather than parsing, but that makes it difficult
18699 to handle something like `f()'. We want to notice that there are
18700 no decl-specifiers, and therefore realize that this is an
18701 expression, not a declaration.)
18703 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
18704 the declarator is a direct-declarator of the form "(...)".
18706 MEMBER_P is true iff this declarator is a member-declarator.
18708 FRIEND_P is true iff this declarator is a friend. */
18712 cp_parser_declarator_kind dcl_kind,
18716 {
18719 cp_cv_quals cv_quals;
18720 tree class_type;
18723 /* Assume this is not a constructor, destructor, or type-conversion
18724 operator. */
18731 /* Check for the ptr-operator production. */
18733 /* Parse the ptr-operator. */
18739 /* If that worked, then we have a ptr-operator. */
18741 {
18742 /* If a ptr-operator was found, then this declarator was not
18743 parenthesized. */
18746 /* The dependent declarator is optional if we are parsing an
18747 abstract-declarator. */
18751 /* Parse the dependent declarator. */
18756 friend_p);
18758 /* If we are parsing an abstract-declarator, we must handle the
18759 case where the dependent declarator is absent. */
18764 declarator = cp_parser_make_indirect_declarator
18766 }
18767 /* Everything else is a direct-declarator. */
18768 else
18769 {
18772 CPP_OPEN_PAREN);
18774 ctor_dtor_or_conv_p,
18776 }
18781 }
18783 /* Parse a direct-declarator or direct-abstract-declarator.
18785 direct-declarator:
18786 declarator-id
18787 direct-declarator ( parameter-declaration-clause )
18788 cv-qualifier-seq [opt]
18789 ref-qualifier [opt]
18790 exception-specification [opt]
18791 direct-declarator [ constant-expression [opt] ]
18792 ( declarator )
18794 direct-abstract-declarator:
18795 direct-abstract-declarator [opt]
18796 ( parameter-declaration-clause )
18797 cv-qualifier-seq [opt]
18798 ref-qualifier [opt]
18799 exception-specification [opt]
18800 direct-abstract-declarator [opt] [ constant-expression [opt] ]
18801 ( abstract-declarator )
18803 Returns a representation of the declarator. DCL_KIND is
18804 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
18805 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
18806 we are parsing a direct-declarator. It is
18807 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
18808 of ambiguity we prefer an abstract declarator, as per
18809 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
18810 as for cp_parser_declarator. */
18814 cp_parser_declarator_kind dcl_kind,
18817 {
18827 {
18828 /* Peek at the next token. */
18831 {
18832 /* This is either a parameter-declaration-clause, or a
18833 parenthesized declarator. When we know we are parsing a
18834 named declarator, it must be a parenthesized declarator
18835 if FIRST is true. For instance, `(int)' is a
18836 parameter-declaration-clause, with an omitted
18837 direct-abstract-declarator. But `((*))', is a
18838 parenthesized abstract declarator. Finally, when T is a
18839 template parameter `(T)' is a
18840 parameter-declaration-clause, and not a parenthesized
18841 named declarator.
18843 We first try and parse a parameter-declaration-clause,
18844 and then try a nested declarator (if FIRST is true).
18846 It is not an error for it not to be a
18847 parameter-declaration-clause, even when FIRST is
18848 false. Consider,
18850 int i (int);
18851 int i (3);
18853 The first is the declaration of a function while the
18854 second is the definition of a variable, including its
18855 initializer.
18857 Having seen only the parenthesis, we cannot know which of
18858 these two alternatives should be selected. Even more
18859 complex are examples like:
18861 int i (int (a));
18862 int i (int (3));
18864 The former is a function-declaration; the latter is a
18865 variable initialization.
18867 Thus again, we try a parameter-declaration-clause, and if
18868 that fails, we back out and return. */
18871 {
18872 tree params;
18875 /* In a member-declarator, the only valid interpretation
18876 of a parenthesis is the start of a
18877 parameter-declaration-clause. (It is invalid to
18878 initialize a static data member with a parenthesized
18879 initializer; only the "=" form of initialization is
18880 permitted.) */
18884 /* Consume the `('. */
18887 {
18888 /* If this is going to be an abstract declarator, we're
18889 in a declarator and we can't have default args. */
18892 }
18896 /* Parse the parameter-declaration-clause. */
18899 /* Consume the `)'. */
18902 /* If all went well, parse the cv-qualifier-seq,
18903 ref-qualifier and the exception-specification. */
18905 {
18906 cp_cv_quals cv_quals;
18907 cp_virt_specifiers virt_specifiers;
18908 cp_ref_qualifier ref_qual;
18909 tree exception_specification;
18910 tree late_return;
18911 tree attrs;
18921 /* Parse the cv-qualifier-seq. */
18923 /* Parse the ref-qualifier. */
18925 /* Parse the tx-qualifier. */
18927 /* And the exception-specification. */
18928 exception_specification
18933 /* In here, we handle cases where attribute is used after
18934 the function declaration. For example:
18935 void func (int x) __attribute__((vector(..))); */
18939 {
18943 CPP_SEMICOLON)
18945 CPP_OPEN_BRACE))
18948 ;
18949 else
18951 }
18953 late_return = (cp_parser_late_return_type_opt
18957 /* Parse the virt-specifier-seq. */
18960 /* Create the function-declarator. */
18962 params,
18963 cv_quals,
18964 virt_specifiers,
18965 ref_qual,
18966 tx_qual,
18967 exception_specification,
18968 late_return,
18969 requires_clause);
18972 /* Any subsequent parameter lists are to do with
18973 return type, so are not those of the declared
18974 function. */
18976 }
18978 /* Remove the function parms from scope. */
18982 /* Repeat the main loop. */
18984 }
18986 /* If this is the first, we can try a parenthesized
18987 declarator. */
18989 {
18995 /* Consume the `('. */
18997 /* Parse the nested declarator. */
19000 declarator
19006 /* Expect a `)'. */
19013 }
19014 /* Otherwise, we must be done. */
19015 else
19017 }
19021 {
19022 /* Parse an array-declarator. */
19031 /* Consume the `['. */
19033 /* Peek at the next token. */
19035 /* If the next token is `]', then there is no
19036 constant-expression. */
19038 {
19040 bounds
19050 {
19051 /* Normally, the array bound must be an integral constant
19052 expression. However, as an extension, we allow VLAs
19053 in function scopes as long as they aren't part of a
19054 parameter declaration. */
19058 }
19061 {
19062 /* Remember this wasn't a constant-expression. */
19065 }
19066 }
19067 else
19069 /* Look for the closing `]'. */
19071 {
19074 }
19079 }
19081 {
19082 {
19083 tree qualifying_scope;
19084 tree unqualified_name;
19085 tree attrs;
19086 special_function_kind sfk;
19091 /* Parse a declarator-id */
19094 {
19097 /* If we see an ellipsis, we should be looking at a
19098 parameter pack. */
19100 {
19101 /* Consume the `...' */
19105 }
19106 }
19109 unqualified_name
19113 {
19117 {
19118 /* Check whether an error occurred. */
19121 /* We already consumed the ellipsis to mark a
19122 parameter pack, but we have no way to report it,
19123 so abort the tentative parse. We will be exiting
19124 immediately anyway. */
19126 }
19127 else
19133 && (qualifying_scope
19135 {
19138 }
19139 }
19144 {
19149 }
19155 {
19156 /* In the declaration of a member of a template class
19157 outside of the class itself, the SCOPE will sometimes
19158 be a TYPENAME_TYPE. For example, given:
19160 template <typename T>
19161 int S<T>::R::i = 3;
19163 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
19164 this context, we must resolve S<T>::R to an ordinary
19165 type, rather than a typename type.
19167 The reason we normally avoid resolving TYPENAME_TYPEs
19168 is that a specialization of `S' might render
19169 `S<T>::R' not a type. However, if `S' is
19170 specialized, then this `i' will not be used, so there
19171 is no harm in resolving the types here. */
19172 tree type;
19174 /* Resolve the TYPENAME_TYPE. */
19177 /* If that failed, the declarator is invalid. */
19179 {
19182 "cannot define member of dependent typedef "
19184 else
19189 }
19191 }
19196 {
19197 tree class_type;
19202 else
19206 {
19209 {
19212 {
19216 "use %<%T::%D%> instead of %<%T::%D%> to "
19218 class_type,
19223 }
19224 else
19226 }
19227 else
19228 {
19229 /* We do not attempt to print the declarator
19230 here because we do not have enough
19231 information about its original syntactic
19232 form. */
19236 }
19237 }
19240 {
19246 for an anonymous type, even if the type
19247 got a name for linkage purposes. */
19249 /* Handle correctly (c++/19200):
19251 struct S {
19252 struct T{};
19253 friend void S(T);
19254 };
19256 and also:
19258 namespace N {
19259 void S();
19260 }
19262 struct S {
19263 friend void N::S();
19264 }; */
19265 && !(friend_p
19268 class_type))
19269 {
19272 }
19280 }
19281 }
19283 unqualified_name,
19284 sfk);
19291 }
19293 handle_declarator:;
19296 {
19297 /* Any names that appear after the declarator-id for a
19298 member are looked up in the containing scope. */
19300 {
19301 /* But declarations with qualified-ids can't appear in a
19302 function. */
19306 }
19308 }
19312 /* Default args are only allowed on function
19313 declarations. */
19315 else
19319 }
19320 /* We're done. */
19321 else
19323 }
19325 /* For an abstract declarator, we might wind up with nothing at this
19326 point. That's an error; the declarator is not optional. */
19330 /* If we entered a scope, we must exit it now. */
19338 }
19340 /* Parse a ptr-operator.
19342 ptr-operator:
19343 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19344 * cv-qualifier-seq [opt]
19345 &
19346 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
19347 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
19349 GNU Extension:
19351 ptr-operator:
19352 & cv-qualifier-seq [opt]
19354 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
19355 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
19356 an rvalue reference. In the case of a pointer-to-member, *TYPE is
19357 filled in with the TYPE containing the member. *CV_QUALS is
19358 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
19359 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
19360 Note that the tree codes returned by this function have nothing
19361 to do with the types of trees that will be eventually be created
19362 to represent the pointer or reference type being parsed. They are
19363 just constants with suggestive names. */
19364 static enum tree_code
19369 {
19374 /* Assume that it's not a pointer-to-member. */
19376 /* And that there are no cv-qualifiers. */
19379 /* Peek at the next token. */
19382 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
19392 {
19393 /* Consume the `*', `&' or `&&'. */
19396 /* A `*' can be followed by a cv-qualifier-seq, and so can a
19397 `&', if we are allowing GNU extensions. (The only qualifier
19398 that can legally appear after `&' is `restrict', but that is
19399 enforced during semantic analysis. */
19407 }
19408 else
19409 {
19410 /* Try the pointer-to-member case. */
19412 /* Look for the optional `::' operator. */
19415 /* Look for the nested-name specifier. */
19422 /* If we found it, and the next token is a `*', then we are
19423 indeed looking at a pointer-to-member operator. */
19426 {
19427 /* Indicate that the `*' operator was used. */
19435 else
19436 {
19437 /* The type of which the member is a member is given by the
19438 current SCOPE. */
19440 /* The next name will not be qualified. */
19444 /* Look for optional c++11 attributes. */
19448 /* Look for the optional cv-qualifier-seq. */
19450 }
19451 }
19452 /* If that didn't work we don't have a ptr-operator. */
19455 }
19458 }
19460 /* Parse an (optional) cv-qualifier-seq.
19462 cv-qualifier-seq:
19463 cv-qualifier cv-qualifier-seq [opt]
19465 cv-qualifier:
19466 const
19467 volatile
19469 GNU Extension:
19471 cv-qualifier:
19472 __restrict__
19474 Returns a bitmask representing the cv-qualifiers. */
19476 static cp_cv_quals
19478 {
19482 {
19484 cp_cv_quals cv_qualifier;
19486 /* Peek at the next token. */
19488 /* See if it's a cv-qualifier. */
19490 {
19506 }
19512 {
19515 }
19516 else
19517 {
19520 }
19521 }
19524 }
19526 /* Parse an (optional) ref-qualifier
19528 ref-qualifier:
19529 &
19530 &&
19532 Returns cp_ref_qualifier representing ref-qualifier. */
19534 static cp_ref_qualifier
19536 {
19539 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
19544 {
19549 {
19561 }
19566 {
19569 }
19570 else
19571 {
19574 }
19575 }
19578 }
19580 /* Parse an optional tx-qualifier.
19582 tx-qualifier:
19583 transaction_safe
19584 transaction_safe_dynamic */
19586 static tree
19588 {
19591 {
19596 {
19600 {
19603 {
19606 }
19607 else
19609 }
19610 }
19611 }
19613 }
19615 /* Parse an (optional) virt-specifier-seq.
19617 virt-specifier-seq:
19618 virt-specifier virt-specifier-seq [opt]
19620 virt-specifier:
19621 override
19622 final
19624 Returns a bitmask representing the virt-specifiers. */
19626 static cp_virt_specifiers
19628 {
19632 {
19634 cp_virt_specifiers virt_specifier;
19636 /* Peek at the next token. */
19638 /* See if it's a virt-specifier-qualifier. */
19642 {
19645 }
19647 {
19650 }
19652 {
19654 }
19655 else
19659 {
19662 }
19663 else
19664 {
19667 }
19668 }
19670 }
19672 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
19673 is in scope even though it isn't real. */
19675 void
19677 {
19678 tree this_parm;
19681 {
19682 /* We don't clear this between NSDMIs. Is it already what we want? */
19687 }
19690 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
19692 current_class_ref
19695 }
19697 /* Return true iff our current scope is a non-static data member
19698 initializer. */
19700 bool
19702 {
19703 /* We recognize NSDMI context by the context-less 'this' pointer set up
19704 by the function above. */
19710 }
19712 /* Parse a late-specified return type, if any. This is not a separate
19713 non-terminal, but part of a function declarator, which looks like
19715 -> trailing-type-specifier-seq abstract-declarator(opt)
19717 Returns the type indicated by the type-id.
19719 In addition to this, parse any queued up omp declare simd
19720 clauses and Cilk Plus SIMD-enabled function's vector attributes.
19722 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
19723 function. */
19725 static tree
19728 {
19732 && declarator
19739 && declarator
19742 /* Peek at the next token. */
19744 /* A late-specified return type is indicated by an initial '->'. */
19755 {
19756 /* DR 1207: 'this' is in scope in the trailing return type. */
19758 }
19761 {
19762 /* Consume the ->. */
19766 }
19768 /* Function declarations may be followed by a trailing
19769 requires-clause. */
19773 declarator->attributes
19777 declarator->attributes
19781 declarator->attributes
19786 {
19789 }
19792 }
19794 /* Parse a declarator-id.
19796 declarator-id:
19797 id-expression
19798 :: [opt] nested-name-specifier [opt] type-name
19800 In the `id-expression' case, the value returned is as for
19801 cp_parser_id_expression if the id-expression was an unqualified-id.
19802 If the id-expression was a qualified-id, then a SCOPE_REF is
19803 returned. The first operand is the scope (either a NAMESPACE_DECL
19804 or TREE_TYPE), but the second is still just a representation of an
19805 unqualified-id. */
19807 static tree
19809 {
19810 tree id;
19811 /* The expression must be an id-expression. Assume that qualified
19812 names are the names of types so that:
19814 template <class T>
19815 int S<T>::R::i = 3;
19817 will work; we must treat `S<T>::R' as the name of a type.
19818 Similarly, assume that qualified names are templates, where
19819 required, so that:
19821 template <class T>
19822 int S<T>::R<T>::i = 3;
19824 will work, too. */
19830 optional_p);
19834 }
19836 /* Parse a type-id.
19838 type-id:
19839 type-specifier-seq abstract-declarator [opt]
19841 Returns the TYPE specified. */
19843 static tree
19846 {
19847 cp_decl_specifier_seq type_specifier_seq;
19850 /* Parse the type-specifier-seq. */
19852 is_trailing_return,
19857 /* There might or might not be an abstract declarator. */
19859 /* Look for the declarator. */
19860 abstract_declarator
19865 /* Check to see if there really was a declarator. */
19870 /* The concepts TS allows 'auto' as a type-id. */
19872 /* None of the valid uses of 'auto' in C++14 involve the type-id
19873 nonterminal, but it is valid in a trailing-return-type. */
19876 {
19877 /* A type-id with type 'auto' is only ok if the abstract declarator
19878 is a function declarator with a late-specified return type.
19880 A type-id with 'auto' is also valid in a trailing-return-type
19881 in a compound-requirement. */
19888 else
19889 {
19892 }
19893 }
19896 is_template_arg);
19897 }
19899 static tree
19901 {
19903 }
19905 static tree
19907 {
19908 tree r;
19910 parser->type_definition_forbidden_message
19915 {
19918 }
19920 }
19922 static tree
19924 {
19926 }
19928 /* Parse a type-specifier-seq.
19930 type-specifier-seq:
19931 type-specifier type-specifier-seq [opt]
19933 GNU extension:
19935 type-specifier-seq:
19936 attributes type-specifier-seq [opt]
19938 If IS_DECLARATION is true, we are at the start of a "condition" or
19939 exception-declaration, so we might be followed by a declarator-id.
19941 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
19942 i.e. we've just seen "->".
19944 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
19946 static void
19951 {
19956 /* Clear the TYPE_SPECIFIER_SEQ. */
19959 /* In the context of a trailing return type, enum E { } is an
19960 elaborated-type-specifier followed by a function-body, not an
19961 enum-specifier. */
19965 /* Parse the type-specifiers and attributes. */
19967 {
19968 tree type_specifier;
19971 /* Check for attributes first. */
19973 {
19978 }
19980 /* record the token of the beginning of the type specifier seq,
19981 for error reporting purposes*/
19985 /* Look for the type-specifier. */
19987 flags,
19988 type_specifier_seq,
19990 NULL,
19993 {
19994 /* If the first type-specifier could not be found, this is not a
19995 type-specifier-seq at all. */
19997 {
19998 /* Set in_declarator_p to avoid skipping to the semicolon. */
20010 }
20011 /* If subsequent type-specifiers could not be found, the
20012 type-specifier-seq is complete. */
20014 }
20017 /* The standard says that a condition can be:
20019 type-specifier-seq declarator = assignment-expression
20021 However, given:
20023 struct S {};
20024 if (int S = ...)
20026 we should treat the "S" as a declarator, not as a
20027 type-specifier. The standard doesn't say that explicitly for
20028 type-specifier-seq, but it does say that for
20029 decl-specifier-seq in an ordinary declaration. Perhaps it
20030 would be clearer just to allow a decl-specifier-seq here, and
20031 then add a semantic restriction that if any decl-specifiers
20032 that are not type-specifiers appear, the program is invalid. */
20035 }
20036 }
20038 /* Return whether the function currently being declared has an associated
20039 template parameter list. */
20041 static bool
20043 {
20056 }
20058 /* Parse a parameter-declaration-clause.
20060 parameter-declaration-clause:
20061 parameter-declaration-list [opt] ... [opt]
20062 parameter-declaration-list , ...
20064 Returns a representation for the parameter declarations. A return
20065 value of NULL indicates a parameter-declaration-clause consisting
20066 only of an ellipsis. */
20068 static tree
20070 {
20071 tree parameters;
20080 parser->auto_is_implicit_function_template_parm_p
20082 }
20088 && !processing_template_parmlist
20094 /* Peek at the next token. */
20096 /* Check for trivial parameter-declaration-clauses. */
20098 {
20099 /* Consume the `...' token. */
20102 }
20104 /* There are no parameters. */
20105 {
20106 #ifndef NO_IMPLICIT_EXTERN_C
20111 else
20112 #endif
20114 }
20115 /* Check for `(void)', too, which is a special case. */
20119 {
20120 /* Consume the `void' token. */
20122 /* There are no parameters. */
20124 }
20126 /* Parse the parameter-declaration-list. */
20128 /* If a parse error occurred while parsing the
20129 parameter-declaration-list, then the entire
20130 parameter-declaration-clause is erroneous. */
20134 /* Peek at the next token. */
20136 /* If it's a `,', the clause should terminate with an ellipsis. */
20138 {
20139 /* Consume the `,'. */
20141 /* Expect an ellipsis. */
20142 ellipsis_p
20144 }
20145 /* It might also be `...' if the optional trailing `,' was
20146 omitted. */
20148 {
20149 /* Consume the `...' token. */
20151 /* And remember that we saw it. */
20153 }
20154 else
20157 /* Finish the parameter list. */
20162 }
20164 /* Parse a parameter-declaration-list.
20166 parameter-declaration-list:
20167 parameter-declaration
20168 parameter-declaration-list , parameter-declaration
20170 Returns a representation of the parameter-declaration-list, as for
20171 cp_parser_parameter_declaration_clause. However, the
20172 `void_list_node' is never appended to the list. Upon return,
20173 *IS_ERROR will be true iff an error occurred. */
20175 static tree
20177 {
20183 /* Assume all will go well. */
20185 /* The special considerations that apply to a function within an
20186 unbraced linkage specifications do not apply to the parameters
20187 to the function. */
20188 saved_in_unbraced_linkage_specification_p
20192 /* Look for more parameters. */
20194 {
20202 /* Parse the parameter. */
20203 parameter
20208 /* We don't know yet if the enclosing context is deprecated, so wait
20209 and warn in grokparms if appropriate. */
20213 {
20214 /* If a function parameter pack was specified and an implicit template
20215 parameter was introduced during cp_parser_parameter_declaration,
20216 change any implicit parameters introduced into packs. */
20220 {
20228 }
20232 PARM,
20235 }
20239 /* If a parse error occurred parsing the parameter declaration,
20240 then the entire parameter-declaration-list is erroneous. */
20242 {
20246 }
20256 {
20260 }
20262 /* Add the new parameter to the list. */
20266 /* Peek at the next token. */
20269 /* These are for Objective-C++ */
20272 /* The parameter-declaration-list is complete. */
20275 {
20278 /* Peek at the next token. */
20280 /* If it's an ellipsis, then the list is complete. */
20283 /* Otherwise, there must be more parameters. Consume the
20284 `,'. */
20286 /* When parsing something like:
20288 int i(float f, double d)
20290 we can tell after seeing the declaration for "f" that we
20291 are not looking at an initialization of a variable "i",
20292 but rather at the declaration of a function "i".
20294 Due to the fact that the parsing of template arguments
20295 (as specified to a template-id) requires backtracking we
20296 cannot use this technique when inside a template argument
20297 list. */
20301 /* However, a parameter-declaration of the form
20302 "float(f)" (which is a valid declaration of a
20303 parameter "f") can also be interpreted as an
20304 expression (the conversion of "f" to "float"). */
20307 }
20308 else
20309 {
20317 }
20318 }
20320 parser->in_unbraced_linkage_specification_p
20323 /* Reset implicit_template_scope if we are about to leave the function
20324 parameter list that introduced it. Note that for out-of-line member
20325 definitions, there will be one or more class scopes before we get to
20326 the template parameter scope. */
20330 {
20334 {
20337 }
20338 }
20341 }
20343 /* Parse a parameter declaration.
20345 parameter-declaration:
20346 decl-specifier-seq ... [opt] declarator
20347 decl-specifier-seq declarator = assignment-expression
20348 decl-specifier-seq ... [opt] abstract-declarator [opt]
20349 decl-specifier-seq abstract-declarator [opt] = assignment-expression
20351 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
20352 declares a template parameter. (In that case, a non-nested `>'
20353 token encountered during the parsing of the assignment-expression
20354 is not interpreted as a greater-than operator.)
20356 Returns a representation of the parameter, or NULL if an error
20357 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
20358 true iff the declarator is of the form "(p)". */
20364 {
20366 cp_decl_specifier_seq decl_specifiers;
20368 tree default_argument;
20373 /* In a template parameter, `>' is not an operator.
20375 [temp.param]
20377 When parsing a default template-argument for a non-type
20378 template-parameter, the first non-nested `>' is taken as the end
20379 of the template parameter-list rather than a greater-than
20380 operator. */
20382 /* Type definitions may not appear in parameter types. */
20384 parser->type_definition_forbidden_message
20387 /* Parse the declaration-specifiers. */
20389 CP_PARSER_FLAGS_NONE,
20393 /* Complain about missing 'typename' or other invalid type names. */
20398 /* If an error occurred, there's no reason to attempt to parse the
20399 rest of the declaration. */
20401 {
20404 }
20406 /* Peek at the next token. */
20409 /* If the next token is a `)', `,', `=', `>', or `...', then there
20410 is no declarator. However, when variadic templates are enabled,
20411 there may be a declarator following `...'. */
20416 {
20420 }
20421 /* Otherwise, there should be a declarator. */
20422 else
20423 {
20427 /* After seeing a decl-specifier-seq, if the next token is not a
20428 "(", there is no possibility that the code is a valid
20429 expression. Therefore, if parsing tentatively, we commit at
20430 this point. */
20432 /* In an expression context, having seen:
20434 (int((char ...
20436 we cannot be sure whether we are looking at a
20437 function-type (taking a "char" as a parameter) or a cast
20438 of some object of type "char" to "int". */
20444 /* Parse the declarator. */
20447 CP_PARSER_DECLARATOR_EITHER,
20449 parenthesized_p,
20453 /* After the declarator, allow more attributes. */
20454 decl_specifiers.attributes
20458 /* If the declarator is a template parameter pack, remember that and
20459 clear the flag in the declarator itself so we don't get errors
20460 from grokdeclarator. */
20462 {
20465 }
20466 }
20468 /* If the next token is an ellipsis, and we have not seen a declarator
20469 name, and if either the type of the declarator contains parameter
20470 packs but it is not a TYPE_PACK_EXPANSION or is null (this happens
20471 for, eg, abbreviated integral type names), then we actually have a
20472 parameter pack expansion expression. Otherwise, leave the ellipsis
20473 for a C-style variadic function. */
20476 {
20487 {
20488 /* Consume the `...'. */
20492 /* Build a pack expansion type */
20497 else
20499 }
20500 }
20502 /* The restriction on defining new types applies only to the type
20503 of the parameter, not to the default argument. */
20506 /* If the next token is `=', then process a default argument. */
20508 {
20511 /* If we are defining a class, then the tokens that make up the
20512 default argument must be saved and processed later. */
20518 // A constrained-type-specifier may declare a type template-parameter.
20520 default_argument
20523 // A constrained-type-specifier may declare a template-template-parameter.
20525 default_argument
20528 /* Outside of a class definition, we can just parse the
20529 assignment-expression. */
20530 else
20531 default_argument
20535 {
20537 "default arguments are only "
20539 }
20541 || template_parameter_pack_p
20544 {
20545 /* Find the name of the parameter pack. */
20552 template_parm_p
20558 else
20560 template_parm_p
20567 }
20568 }
20569 else
20573 declarator,
20574 default_argument,
20575 template_parameter_pack_p);
20576 }
20578 /* Parse a default argument and return it.
20580 TEMPLATE_PARM_P is true if this is a default argument for a
20581 non-type template parameter. */
20582 static tree
20584 {
20590 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
20591 set correctly. */
20594 /* Local variable names (and the `this' keyword) may not
20595 appear in a default argument. */
20598 /* Parse the assignment-expression. */
20603 /* The "this" pointer is not valid in a default argument. */
20605 {
20610 }
20611 default_argument
20613 /* Restore the "this" pointer. */
20615 {
20618 }
20627 }
20629 /* Parse a function-body.
20631 function-body:
20632 compound_statement */
20634 static void
20636 {
20640 }
20642 /* Parse a ctor-initializer-opt followed by a function-body. Return
20643 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
20644 is true we are parsing a function-try-block. */
20646 static bool
20649 {
20657 /* Begin the function body. */
20659 /* Parse the optional ctor-initializer. */
20662 /* If we're parsing a constexpr constructor definition, we need
20663 to check that the constructor body is indeed empty. However,
20664 before we get to cp_parser_function_body lot of junk has been
20665 generated, so we can't just check that we have an empty block.
20666 Rather we take a snapshot of the outermost block, and check whether
20667 cp_parser_function_body changed its state. */
20669 {
20673 }
20674 /* Parse the function-body. */
20678 /* Finish the function body. */
20682 }
20684 /* Parse an initializer.
20686 initializer:
20687 = initializer-clause
20688 ( expression-list )
20690 Returns an expression representing the initializer. If no
20691 initializer is present, NULL_TREE is returned.
20693 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
20694 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
20695 set to TRUE if there is no initializer present. If there is an
20696 initializer, and it is not a constant-expression, *NON_CONSTANT_P
20697 is set to true; otherwise it is set to false. */
20699 static tree
20702 {
20704 tree init;
20706 /* Peek at the next token. */
20709 /* Let our caller know whether or not this initializer was
20710 parenthesized. */
20712 /* Assume that the initializer is constant. */
20716 {
20717 /* Consume the `='. */
20719 /* Parse the initializer-clause. */
20721 }
20723 {
20728 non_constant_p);
20733 }
20735 {
20740 }
20741 else
20742 {
20743 /* Anything else is an error. */
20746 }
20749 }
20751 /* Parse an initializer-clause.
20753 initializer-clause:
20754 assignment-expression
20755 braced-init-list
20757 Returns an expression representing the initializer.
20759 If the `assignment-expression' production is used the value
20760 returned is simply a representation for the expression.
20762 Otherwise, calls cp_parser_braced_list. */
20764 static cp_expr
20766 {
20767 cp_expr initializer;
20769 /* Assume the expression is constant. */
20772 /* If it is not a `{', then we are looking at an
20773 assignment-expression. */
20775 {
20776 initializer
20779 non_constant_p);
20780 }
20781 else
20785 }
20787 /* Parse a brace-enclosed initializer list.
20789 braced-init-list:
20790 { initializer-list , [opt] }
20791 { }
20793 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
20794 the elements of the initializer-list (or NULL, if the last
20795 production is used). The TREE_TYPE for the CONSTRUCTOR will be
20796 NULL_TREE. There is no way to detect whether or not the optional
20797 trailing `,' was provided. NON_CONSTANT_P is as for
20798 cp_parser_initializer. */
20800 static cp_expr
20802 {
20803 tree initializer;
20806 /* Consume the `{' token. */
20808 /* Create a CONSTRUCTOR to represent the braced-initializer. */
20810 /* If it's not a `}', then there is a non-trivial initializer. */
20812 {
20813 /* Parse the initializer list. */
20816 /* A trailing `,' token is allowed. */
20819 }
20820 else
20822 /* Now, there should be a trailing `}'. */
20828 /* Build a location of the form:
20829 { ... }
20830 ^~~~~~~
20831 with caret==start at the open brace, finish at the close brace. */
20835 }
20837 /* Consume tokens up to, and including, the next non-nested closing `]'.
20838 Returns true iff we found a closing `]'. */
20840 static bool
20842 {
20846 {
20850 {
20853 /* If we've run out of tokens, then there is no closing `]'. */
20862 {
20865 }
20870 }
20872 /* Consume the token. */
20874 }
20875 }
20877 /* Return true if we are looking at an array-designator, false otherwise. */
20879 static bool
20881 {
20882 /* Consume the `['. */
20887 /* Skip tokens until the next token is a closing square bracket.
20888 If we find the closing `]', and the next token is a `=', then
20889 we are looking at an array designator. */
20890 bool array_designator_p
20894 /* Roll back the tokens we skipped. */
20898 }
20900 /* Parse an initializer-list.
20902 initializer-list:
20903 initializer-clause ... [opt]
20904 initializer-list , initializer-clause ... [opt]
20906 GNU Extension:
20908 initializer-list:
20909 designation initializer-clause ...[opt]
20910 initializer-list , designation initializer-clause ...[opt]
20912 designation:
20913 . identifier =
20914 identifier :
20915 [ constant-expression ] =
20917 Returns a vec of constructor_elt. The VALUE of each elt is an expression
20918 for the initializer. If the INDEX of the elt is non-NULL, it is the
20919 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
20920 as for cp_parser_initializer. */
20924 {
20927 /* Assume all of the expressions are constant. */
20930 /* Parse the rest of the list. */
20932 {
20934 tree designator;
20935 tree initializer;
20938 /* If the next token is an identifier and the following one is a
20939 colon, we are looking at the GNU designated-initializer
20940 syntax. */
20944 {
20945 /* Warn the user that they are using an extension. */
20948 /* Consume the identifier. */
20950 /* Consume the `:'. */
20952 }
20953 /* Also handle the C99 syntax, '. id ='. */
20958 {
20959 /* Warn the user that they are using an extension. */
20962 /* Consume the `.'. */
20964 /* Consume the identifier. */
20966 /* Consume the `='. */
20968 }
20969 /* Also handle C99 array designators, '[ const ] ='. */
20973 {
20974 /* In C++11, [ could start a lambda-introducer. */
20980 {
20983 }
20984 else
20985 {
20990 }
20996 }
20997 else
21000 /* Parse the initializer. */
21003 /* If any clause is non-constant, so is the entire initializer. */
21007 /* If we have an ellipsis, this is an initializer pack
21008 expansion. */
21010 {
21011 /* Consume the `...'. */
21014 /* Turn the initializer into an initializer expansion. */
21016 }
21018 /* Add it to the vector. */
21021 /* If the next token is not a comma, we have reached the end of
21022 the list. */
21026 /* Peek at the next token. */
21028 /* If the next token is a `}', then we're still done. An
21029 initializer-clause can have a trailing `,' after the
21030 initializer-list and before the closing `}'. */
21034 /* Consume the `,' token. */
21036 }
21039 }
21041 /* Classes [gram.class] */
21043 /* Parse a class-name.
21045 class-name:
21046 identifier
21047 template-id
21049 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
21050 to indicate that names looked up in dependent types should be
21051 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
21052 keyword has been used to indicate that the name that appears next
21053 is a template. TAG_TYPE indicates the explicit tag given before
21054 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
21055 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
21056 is the class being defined in a class-head. If ENUM_OK is TRUE,
21057 enum-names are also accepted.
21059 Returns the TYPE_DECL representing the class. */
21061 static tree
21070 {
21071 tree decl;
21072 tree scope;
21077 /* All class-names start with an identifier. */
21080 {
21083 }
21085 /* PARSER->SCOPE can be cleared when parsing the template-arguments
21086 to a template-id, so we save it here. */
21091 /* Any name names a type if we're following the `typename' keyword
21092 in a qualified name where the enclosing scope is type-dependent. */
21095 /* Handle the common case (an identifier, but not a template-id)
21096 efficiently. */
21099 {
21103 /* Look for the identifier. */
21107 /* If the next token isn't an identifier, we are certainly not
21108 looking at a class-name. */
21111 /* If we know this is a type-name, there's no need to look it
21112 up. */
21115 else
21116 {
21117 tree ambiguous_decls;
21118 /* If we already know that this lookup is ambiguous, then
21119 we've already issued an error message; there's no reason
21120 to check again. */
21122 {
21125 }
21126 /* If the next token is a `::', then the name must be a type
21127 name.
21129 [basic.lookup.qual]
21131 During the lookup for a name preceding the :: scope
21132 resolution operator, object, function, and enumerator
21133 names are ignored. */
21136 /* Look up the name. */
21138 tag_type,
21141 check_dependency_p,
21145 {
21149 }
21150 }
21151 }
21152 else
21153 {
21154 /* Try a template-id. */
21156 check_dependency_p,
21157 tag_type,
21158 is_declaration);
21161 }
21165 /* If this is a typename, create a TYPENAME_TYPE. */
21167 {
21172 }
21176 /* Check to see that it is really the name of a class. */
21180 /* Situations like this:
21182 template <typename T> struct A {
21183 typename T::template X<int>::I i;
21184 };
21186 are problematic. Is `T::template X<int>' a class-name? The
21187 standard does not seem to be definitive, but there is no other
21188 valid interpretation of the following `::'. Therefore, those
21189 names are considered class-names. */
21190 {
21194 }
21199 /* In Objective-C 2.0, a classname followed by '.' starts a
21200 dot-syntax expression, and it's not a type-name. */
21212 }
21214 /* Parse a class-specifier.
21216 class-specifier:
21217 class-head { member-specification [opt] }
21219 Returns the TREE_TYPE representing the class. */
21221 static tree
21223 {
21224 tree type;
21238 /* Parse the class-head. */
21241 /* If the class-head was a semantic disaster, skip the entire body
21242 of the class. */
21244 {
21248 }
21250 /* Look for the `{'. */
21252 {
21255 }
21260 /* Issue an error message if type-definitions are forbidden here. */
21262 /* Remember that we are defining one more class. */
21264 /* Inside the class, surrounding template-parameter-lists do not
21265 apply. */
21266 saved_num_template_parameter_lists
21269 /* We are not in a function body. */
21272 /* Or in a loop. */
21275 /* Or in a switch. */
21278 /* We are not immediately inside an extern "lang" block. */
21279 saved_in_unbraced_linkage_specification_p
21283 // Associate constraints with the type.
21287 /* Start the class. */
21289 {
21292 }
21296 /* If the type is erroneous, skip the entire body of the class. */
21298 else
21299 /* Parse the member-specification. */
21302 /* Look for the trailing `}'. */
21304 /* Look for trailing attributes to apply to this class. */
21312 /* We've finished a type definition. Check for the common syntax
21313 error of forgetting a semicolon after the definition. We need to
21314 be careful, as we can't just check for not-a-semicolon and be done
21315 with it; the user might have typed:
21317 class X { } c = ...;
21318 class X { } *p = ...;
21320 and so forth. Instead, enumerate all the possible tokens that
21321 might follow this production; if we don't see one of them, then
21322 complain and silently insert the semicolon. */
21323 {
21328 /* Don't try to parse c++11 attributes here. As per the
21329 grammar, that should be a task for
21330 cp_parser_decl_specifier_seq. */
21334 {
21345 /* While it's legal for type qualifiers and storage class
21346 specifiers to follow type definitions in the grammar, only
21347 compiler testsuites contain code like that. Assume that if
21348 we see such code, then what we're really seeing is a case
21349 like:
21351 class X { }
21352 const <type> var = ...;
21354 or
21356 class Y { }
21357 static <type> func (...) ...
21359 i.e. the qualifier or specifier applies to the next
21360 declaration. To do so, however, we need to look ahead one
21361 more token to see if *that* token is a type specifier.
21363 This code could be improved to handle:
21365 class Z { }
21366 static const <type> var = ...; */
21369 {
21372 /* Handling user-defined types here would be nice, but very
21373 tricky. */
21374 want_semicolon
21377 }
21381 }
21383 /* If we don't have a type, then something is very wrong and we
21384 shouldn't try to do anything clever. Likewise for not seeing the
21385 closing brace. */
21387 {
21388 cp_token_position prev
21399 else
21402 /* Unget one token and smash it to look as though we encountered
21403 a semicolon in the input stream. */
21408 }
21409 }
21411 /* If this class is not itself within the scope of another class,
21412 then we need to parse the bodies of all of the queued function
21413 definitions. Note that the queued functions defined in a class
21414 are not always processed immediately following the
21415 class-specifier for that class. Consider:
21417 struct A {
21418 struct B { void f() { sizeof (A); } };
21419 };
21421 If `f' were processed before the processing of `A' were
21422 completed, there would be no way to compute the size of `A'.
21423 Note that the nesting we are interested in here is lexical --
21424 not the semantic nesting given by TYPE_CONTEXT. In particular,
21425 for:
21427 struct A { struct B; };
21428 struct A::B { void f() { } };
21430 there is no need to delay the parsing of `A::B::f'. */
21432 {
21433 tree decl;
21440 /* In a first pass, parse default arguments to the functions.
21441 Then, in a second pass, parse the bodies of the functions.
21442 This two-phased approach handles cases like:
21444 struct S {
21445 void f() { g(); }
21446 void g(int i = 3);
21447 };
21449 */
21451 {
21453 /* If there are default arguments that have not yet been processed,
21454 take care of them now. */
21456 {
21461 }
21462 /* Make sure that any template parameters are in scope. */
21464 /* Parse the default argument expressions. */
21466 /* Remove any template parameters from the symbol table. */
21468 }
21470 /* Now parse any NSDMIs. */
21474 {
21476 {
21481 }
21484 }
21491 /* Now do some post-NSDMI bookkeeping. */
21497 /* Now parse the body of the functions. */
21499 {
21500 /* OpenMP UDRs need to be parsed before all other functions. */
21507 }
21508 else
21512 }
21513 else
21516 /* Put back any saved access checks. */
21519 /* Restore saved state. */
21523 parser->num_template_parameter_lists
21525 parser->in_unbraced_linkage_specification_p
21529 }
21531 static tree
21533 {
21534 tree ret;
21539 }
21541 /* Parse a class-head.
21543 class-head:
21544 class-key identifier [opt] base-clause [opt]
21545 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
21546 class-key nested-name-specifier [opt] template-id
21547 base-clause [opt]
21549 class-virt-specifier:
21550 final
21552 GNU Extensions:
21553 class-key attributes identifier [opt] base-clause [opt]
21554 class-key attributes nested-name-specifier identifier base-clause [opt]
21555 class-key attributes nested-name-specifier [opt] template-id
21556 base-clause [opt]
21558 Upon return BASES is initialized to the list of base classes (or
21559 NULL, if there are none) in the same form returned by
21560 cp_parser_base_clause.
21562 Returns the TYPE of the indicated class. Sets
21563 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
21564 involving a nested-name-specifier was used, and FALSE otherwise.
21566 Returns error_mark_node if this is not a class-head.
21568 Returns NULL_TREE if the class-head is syntactically valid, but
21569 semantically invalid in a way that means we should skip the entire
21570 body of the class. */
21572 static tree
21575 {
21576 tree nested_name_specifier;
21580 tree attributes;
21581 tree bases;
21591 /* Assume no nested-name-specifier will be present. */
21593 /* Assume no template parameter lists will be used in defining the
21594 type. */
21598 /* Look for the class-key. */
21603 /* Parse the attributes. */
21606 /* If the next token is `::', that is invalid -- but sometimes
21607 people do try to write:
21609 struct ::S {};
21611 Handle this gracefully by accepting the extra qualifier, and then
21612 issuing an error about it later if this really is a
21613 class-head. If it turns out just to be an elaborated type
21614 specifier, remain silent. */
21620 /* Determine the name of the class. Begin by looking for an
21621 optional nested-name-specifier. */
21623 nested_name_specifier
21629 /* If there was a nested-name-specifier, then there *must* be an
21630 identifier. */
21632 {
21634 /* Although the grammar says `identifier', it really means
21635 `class-name' or `template-name'. You are only allowed to
21636 define a class that has already been declared with this
21637 syntax.
21639 The proposed resolution for Core Issue 180 says that wherever
21640 you see `class T::X' you should treat `X' as a type-name.
21642 It is OK to define an inaccessible class; for example:
21644 class A { class B; };
21645 class A::B {};
21647 We do not know if we will see a class-name, or a
21648 template-name. We look for a class-name first, in case the
21649 class-name is a template-id; if we looked for the
21650 template-name first we would stop after the template-name. */
21655 class_type,
21659 /* If that didn't work, ignore the nested-name-specifier. */
21661 {
21667 }
21668 /* If we could not find a corresponding TYPE, treat this
21669 declaration like an unqualified declaration. */
21672 /* Otherwise, count the number of templates used in TYPE and its
21673 containing scopes. */
21674 else
21675 {
21676 tree scope;
21688 }
21689 }
21690 /* Otherwise, the identifier is optional. */
21691 else
21692 {
21693 /* We don't know whether what comes next is a template-id,
21694 an identifier, or nothing at all. */
21696 /* Check for a template-id. */
21701 class_key,
21703 /* If that didn't work, it could still be an identifier. */
21705 {
21707 {
21710 }
21711 else
21713 }
21714 else
21715 {
21718 }
21719 }
21724 {
21726 class_key,
21728 }
21731 /* If it's not a `:' or a `{' then we can't really be looking at a
21732 class-head, since a class-head only appears as part of a
21733 class-specifier. We have to detect this situation before calling
21734 xref_tag, since that has irreversible side-effects. */
21736 {
21740 }
21742 /* At this point, we're going ahead with the class-specifier, even
21743 if some other problem occurs. */
21746 {
21751 }
21752 /* Issue the error about the overly-qualified name now. */
21754 {
21759 }
21761 {
21766 }
21768 {
21769 tree scope;
21771 /* Reject typedef-names in class heads. */
21773 {
21776 type);
21779 }
21781 /* Figure out in what scope the declaration is being placed. */
21783 /* If that scope does not contain the scope in which the
21784 class was originally declared, the program is invalid. */
21786 {
21789 "declaration of %qD in namespace %qD which does not "
21792 else
21798 }
21799 /* [dcl.meaning]
21801 A declarator-id shall not be qualified except for the
21802 definition of a ... nested class outside of its class
21803 ... [or] the definition or explicit instantiation of a
21804 class member of a namespace outside of its namespace. */
21806 {
21811 }
21812 }
21813 /* An explicit-specialization must be preceded by "template <>". If
21814 it is not, try to recover gracefully. */
21818 {
21822 /* Take the same action that would have been taken by
21823 cp_parser_explicit_specialization. */
21826 }
21827 /* There must be no "return" statements between this point and the
21828 end of this function; set "type "to the correct return value and
21829 use "goto done;" to return. */
21830 /* Make sure that the right number of template parameters were
21831 present. */
21835 {
21836 /* If something went wrong, there is no point in even trying to
21837 process the class-definition. */
21840 }
21842 /* Look up the type. */
21844 {
21848 {
21852 }
21853 else
21854 {
21857 }
21860 }
21862 {
21863 tree class_type;
21865 /* Given:
21867 template <typename T> struct S { struct T };
21868 template <typename T> struct S<T>::T { };
21870 we will get a TYPENAME_TYPE when processing the definition of
21871 `S::T'. We need to resolve it to the actual type before we
21872 try to define it. */
21874 {
21879 else
21880 {
21883 }
21884 }
21888 {
21891 }
21894 /* Enter the scope indicated by the nested-name-specifier. */
21896 /* Get the canonical version of this type. */
21898 /* Call push_template_decl if it seems like we should be defining a
21899 template either from the template headers or the type we're
21900 defining, so that we diagnose both extra and missing headers. */
21904 {
21907 {
21910 }
21911 }
21915 }
21917 {
21918 /* If the class was unnamed, create a dummy name. */
21923 }
21925 /* Indicate whether this class was declared as a `class' or as a
21926 `struct'. */
21931 /* If this type was already complete, and we see another definition,
21932 that's an error. */
21934 {
21936 type);
21938 type);
21941 }
21946 {
21947 /* Apply attributes now, before any use of the class as a template
21948 argument in its base list. */
21951 }
21953 /* We will have entered the scope containing the class; the names of
21954 base classes should be looked up in that context. For example:
21956 struct A { struct B {}; struct C; };
21957 struct A::C : B {};
21959 is valid. */
21961 /* Get the list of base-classes, if there is one. */
21963 {
21964 /* PR59482: enter the class scope so that base-specifiers are looked
21965 up correctly. */
21969 /* PR59482: get out of the previously pushed class scope so that the
21970 subsequent pops pop the right thing. */
21973 }
21974 else
21977 /* If we're really defining a class, process the base classes.
21978 If they're invalid, fail. */
21983 done:
21984 /* Leave the scope given by the nested-name-specifier. We will
21985 enter the class scope itself while processing the members. */
21990 {
21993 }
21999 out:
22002 }
22004 /* Parse a class-key.
22006 class-key:
22007 class
22008 struct
22009 union
22011 Returns the kind of class-key specified, or none_type to indicate
22012 error. */
22014 static enum tag_types
22016 {
22020 /* Look for the class-key. */
22025 /* Check to see if the TOKEN is a class-key. */
22030 }
22032 /* Parse a type-parameter-key.
22034 type-parameter-key:
22035 class
22036 typename
22037 */
22039 static void
22041 {
22042 /* Look for the type-parameter-key. */
22046 {
22049 /* typename is not allowed in a template template parameter
22050 by the standard until C++1Z. */
22052 "ISO C++ forbids typename key in template template parameter;"
22054 }
22055 else
22059 }
22061 /* Parse an (optional) member-specification.
22063 member-specification:
22064 member-declaration member-specification [opt]
22065 access-specifier : member-specification [opt] */
22067 static void
22069 {
22071 {
22075 /* Peek at the next token. */
22077 /* If it's a `}', or EOF then we've seen all the members. */
22083 /* See if this token is a keyword. */
22086 {
22090 /* Consume the access-specifier. */
22092 /* Remember which access-specifier is active. */
22094 /* Look for the `:'. */
22099 /* Accept #pragmas at class scope. */
22101 {
22104 }
22106 /* Otherwise, the next construction must be a
22107 member-declaration. */
22109 }
22110 }
22111 }
22113 /* Parse a member-declaration.
22115 member-declaration:
22116 decl-specifier-seq [opt] member-declarator-list [opt] ;
22117 function-definition ; [opt]
22118 :: [opt] nested-name-specifier template [opt] unqualified-id ;
22119 using-declaration
22120 template-declaration
22121 alias-declaration
22123 member-declarator-list:
22124 member-declarator
22125 member-declarator-list , member-declarator
22127 member-declarator:
22128 declarator pure-specifier [opt]
22129 declarator constant-initializer [opt]
22130 identifier [opt] : constant-expression
22132 GNU Extensions:
22134 member-declaration:
22135 __extension__ member-declaration
22137 member-declarator:
22138 declarator attributes [opt] pure-specifier [opt]
22139 declarator attributes [opt] constant-initializer [opt]
22140 identifier [opt] attributes [opt] : constant-expression
22142 C++0x Extensions:
22144 member-declaration:
22145 static_assert-declaration */
22147 static void
22149 {
22150 cp_decl_specifier_seq decl_specifiers;
22151 tree prefix_attributes;
22152 tree decl;
22161 /* Check for the `__extension__' keyword. */
22163 {
22164 /* Recurse. */
22166 /* Restore the old value of the PEDANTIC flag. */
22170 }
22172 /* Check for a template-declaration. */
22174 {
22175 /* An explicit specialization here is an error condition, and we
22176 expect the specialization handler to detect and report this. */
22180 else
22184 }
22185 /* Check for a template introduction. */
22189 /* Check for a using-declaration. */
22191 {
22193 {
22194 /* Parse the using-declaration. */
22198 }
22199 else
22200 {
22201 tree decl;
22205 /* Note that if we actually see the '=' token after the
22206 identifier, cp_parser_alias_declaration commits the
22207 tentative parse. In that case, we really expect an
22208 alias-declaration. Otherwise, we expect a using
22209 declaration. */
22210 alias_decl_expected =
22216 else
22220 }
22221 }
22223 /* Check for @defs. */
22225 {
22230 {
22235 }
22237 }
22239 /* If the next token is `static_assert' we have a static assertion. */
22241 {
22244 }
22251 /* Parse the decl-specifier-seq. */
22254 CP_PARSER_FLAGS_OPTIONAL,
22257 /* Check for an invalid type-name. */
22261 /* If there is no declarator, then the decl-specifier-seq should
22262 specify a type. */
22264 {
22265 /* If there was no decl-specifier-seq, and the next token is a
22266 `;', then we have something like:
22268 struct S { ; };
22270 [class.mem]
22272 Each member-declaration shall declare at least one member
22273 name of the class. */
22275 {
22279 }
22280 else
22281 {
22282 tree type;
22284 /* See if this declaration is a friend. */
22286 /* If there were decl-specifiers, check to see if there was
22287 a class-declaration. */
22290 /* Nested classes have already been added to the class, but
22291 a `friend' needs to be explicitly registered. */
22293 {
22294 /* If the `friend' keyword was present, the friend must
22295 be introduced with a class-key. */
22298 "in C++03 a class-key must be used "
22300 /* In this case:
22302 template <typename T> struct A {
22303 friend struct A<T>::B;
22304 };
22306 A<T>::B will be represented by a TYPENAME_TYPE, and
22307 therefore not recognized by check_tag_decl. */
22309 {
22313 }
22316 "friend declaration does not name a class or "
22318 else
22321 }
22322 /* If there is no TYPE, an error message will already have
22323 been issued. */
22325 ;
22326 /* An anonymous aggregate has to be handled specially; such
22327 a declaration really declares a data member (with a
22328 particular type), as opposed to a nested class. */
22330 {
22331 /* C++11 9.5/6. */
22334 "a storage class on an anonymous aggregate "
22337 /* Remove constructors and such from TYPE, now that we
22338 know it is an anonymous aggregate. */
22340 /* And make the corresponding data member. */
22343 /* Add it to the class. */
22345 }
22346 else
22347 cp_parser_check_access_in_redeclaration
22350 }
22351 }
22352 else
22353 {
22356 /* Clear attributes from the decl_specifiers but keep them
22357 around as prefix attributes that apply them to the entity
22358 being declared. */
22362 /* See if these declarations will be friends. */
22365 /* Keep going until we hit the `;' at the end of the
22366 declaration. */
22368 {
22370 tree first_attribute;
22372 /* Peek at the next token. */
22375 /* Check for a bitfield declaration. */
22380 {
22381 tree identifier;
22382 tree width;
22384 /* Get the name of the bitfield. Note that we cannot just
22385 check TOKEN here because it may have been invalidated by
22386 the call to cp_lexer_peek_nth_token above. */
22389 else
22392 /* Consume the `:' token. */
22394 /* Get the width of the bitfield. */
22395 width
22398 /* Look for attributes that apply to the bitfield. */
22400 /* Remember which attributes are prefix attributes and
22401 which are not. */
22403 /* Combine the attributes. */
22406 /* Create the bitfield declaration. */
22409 identifier,
22410 sfk_none)
22413 width,
22414 attributes);
22415 }
22416 else
22417 {
22419 tree initializer;
22420 tree asm_specification;
22423 /* Parse the declarator. */
22424 declarator
22429 friend_p);
22431 /* If something went wrong parsing the declarator, make sure
22432 that we at least consume some tokens. */
22434 {
22435 /* Skip to the end of the statement. */
22437 /* If the next token is not a semicolon, that is
22438 probably because we just skipped over the body of
22439 a function. So, we consume a semicolon if
22440 present, but do not issue an error message if it
22441 is not present. */
22443 CPP_SEMICOLON))
22446 }
22449 cp_parser_check_for_definition_in_return_type
22453 /* Look for an asm-specification. */
22455 /* Look for attributes that apply to the declaration. */
22457 /* Remember which attributes are prefix attributes and
22458 which are not. */
22460 /* Combine the attributes. */
22463 /* If it's an `=', then we have a constant-initializer or a
22464 pure-specifier. It is not correct to parse the
22465 initializer before registering the member declaration
22466 since the member declaration should be in scope while
22467 its initializer is processed. However, the rest of the
22468 front end does not yet provide an interface that allows
22469 us to handle this correctly. */
22471 {
22472 /* In [class.mem]:
22474 A pure-specifier shall be used only in the declaration of
22475 a virtual function.
22477 A member-declarator can contain a constant-initializer
22478 only if it declares a static member of integral or
22479 enumeration type.
22481 Therefore, if the DECLARATOR is for a function, we look
22482 for a pure-specifier; otherwise, we look for a
22483 constant-initializer. When we call `grokfield', it will
22484 perform more stringent semantics checks. */
22496 {
22498 /* Don't require a constant rvalue in C++11, since we
22499 might want a reference constant. We'll enforce
22500 constancy later. */
22502 /* Parse the initializer. */
22505 }
22506 else
22507 /* Parse the initializer. */
22509 }
22512 {
22516 else
22518 }
22519 /* Otherwise, there is no initializer. */
22520 else
22523 /* See if we are probably looking at a function
22524 definition. We are certainly not looking at a
22525 member-declarator. Calling `grokfield' has
22526 side-effects, so we must not do it unless we are sure
22527 that we are looking at a member-declarator. */
22530 {
22531 /* The grammar does not allow a pure-specifier to be
22532 used when a member function is defined. (It is
22533 possible that this fact is an oversight in the
22534 standard, since a pure function may be defined
22535 outside of the class-specifier. */
22541 declarator,
22542 attributes);
22545 /* If the member was not a friend, declare it here. */
22548 /* Peek at the next token. */
22550 /* If the next token is a semicolon, consume it. */
22554 }
22555 else
22558 /* Create the declaration. */
22563 {
22566 else
22568 }
22569 }
22574 /* Reset PREFIX_ATTRIBUTES. */
22580 /* If there is any qualification still in effect, clear it
22581 now; we will be starting fresh with the next declarator. */
22585 /* If it's a `,', then there are more declarators. */
22587 {
22590 {
22594 }
22595 }
22596 /* If the next token isn't a `;', then we have a parse error. */
22598 CPP_SEMICOLON))
22599 {
22600 /* The next token might be a ways away from where the
22601 actual semicolon is missing. Find the previous token
22602 and use that for our error position. */
22607 /* Assume that the user meant to provide a semicolon. If
22608 we were to cp_parser_skip_to_end_of_statement, we might
22609 skip to a semicolon inside a member function definition
22610 and issue nonsensical error messages. */
22612 }
22615 {
22616 /* Add DECL to the list of members. */
22618 /* Explicitly include, eg, NSDMIs, for better error
22619 recovery (c++/58650). */
22628 /* Add DECL to the queue of NSDMI to be parsed later. */
22630 }
22634 }
22635 }
22638 out:
22640 }
22642 /* Parse a pure-specifier.
22644 pure-specifier:
22645 = 0
22647 Returns INTEGER_ZERO_NODE if a pure specifier is found.
22648 Otherwise, ERROR_MARK_NODE is returned. */
22650 static tree
22652 {
22655 /* Look for the `=' token. */
22658 /* Look for the `0' token. */
22667 /* Accept = default or = delete in c++0x mode. */
22670 {
22673 }
22675 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
22677 {
22682 }
22684 {
22687 }
22690 }
22692 /* Parse a constant-initializer.
22694 constant-initializer:
22695 = constant-expression
22697 Returns a representation of the constant-expression. */
22699 static tree
22701 {
22702 /* Look for the `=' token. */
22706 /* It is invalid to write:
22708 struct S { static const int i = { 7 }; };
22710 */
22712 {
22715 /* Consume the opening brace. */
22717 /* Skip the initializer. */
22719 /* Look for the trailing `}'. */
22723 }
22726 }
22728 /* Derived classes [gram.class.derived] */
22730 /* Parse a base-clause.
22732 base-clause:
22733 : base-specifier-list
22735 base-specifier-list:
22736 base-specifier ... [opt]
22737 base-specifier-list , base-specifier ... [opt]
22739 Returns a TREE_LIST representing the base-classes, in the order in
22740 which they were declared. The representation of each node is as
22741 described by cp_parser_base_specifier.
22743 In the case that no bases are specified, this function will return
22744 NULL_TREE, not ERROR_MARK_NODE. */
22746 static tree
22748 {
22751 /* Look for the `:' that begins the list. */
22754 /* Scan the base-specifier-list. */
22756 {
22758 tree base;
22761 /* Look for the base-specifier. */
22763 /* Look for the (optional) ellipsis. */
22765 {
22766 /* Consume the `...'. */
22770 }
22772 /* Add BASE to the front of the list. */
22774 {
22776 /* Make this a pack expansion type. */
22780 {
22783 }
22784 }
22785 /* Peek at the next token. */
22787 /* If it's not a comma, then the list is complete. */
22790 /* Consume the `,'. */
22792 }
22794 /* PARSER->SCOPE may still be non-NULL at this point, if the last
22795 base class had a qualified name. However, the next name that
22796 appears is certainly not qualified. */
22802 }
22804 /* Parse a base-specifier.
22806 base-specifier:
22807 :: [opt] nested-name-specifier [opt] class-name
22808 virtual access-specifier [opt] :: [opt] nested-name-specifier
22809 [opt] class-name
22810 access-specifier virtual [opt] :: [opt] nested-name-specifier
22811 [opt] class-name
22813 Returns a TREE_LIST. The TREE_PURPOSE will be one of
22814 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
22815 indicate the specifiers provided. The TREE_VALUE will be a TYPE
22816 (or the ERROR_MARK_NODE) indicating the type that was specified. */
22818 static tree
22820 {
22828 tree type;
22830 /* Process the optional `virtual' and `access-specifier'. */
22832 {
22833 /* Peek at the next token. */
22835 /* Process `virtual'. */
22837 {
22839 /* If `virtual' appears more than once, issue an error. */
22841 {
22845 }
22849 /* Consume the `virtual' token. */
22857 /* If more than one access specifier appears, issue an
22858 error. */
22861 {
22865 }
22869 /* Consume the access-specifier. */
22877 }
22878 }
22879 /* It is not uncommon to see programs mechanically, erroneously, use
22880 the 'typename' keyword to denote (dependent) qualified types
22881 as base classes. */
22883 {
22888 else
22890 "keyword %<typename%> not allowed in this context "
22893 }
22895 /* Look for the optional `::' operator. */
22897 /* Look for the nested-name-specifier. The simplest way to
22898 implement:
22900 [temp.res]
22902 The keyword `typename' is not permitted in a base-specifier or
22903 mem-initializer; in these contexts a qualified name that
22904 depends on a template-parameter is implicitly assumed to be a
22905 type name.
22907 is to pretend that we have seen the `typename' keyword at this
22908 point. */
22912 typename_type,
22914 /* If the base class is given by a qualified name, assume that names
22915 we see are type names or templates, as appropriate. */
22921 /* DR 950 allows decltype as a base-specifier. */
22923 else
22924 {
22925 /* Otherwise, look for the class-name. */
22927 class_scope_p,
22928 template_p,
22929 typename_type,
22934 }
22940 }
22942 /* Exception handling [gram.exception] */
22944 /* Parse an (optional) noexcept-specification.
22946 noexcept-specification:
22947 noexcept ( constant-expression ) [opt]
22949 If no noexcept-specification is present, returns NULL_TREE.
22950 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
22951 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
22952 there are no parentheses. CONSUMED_EXPR will be set accordingly.
22953 Otherwise, returns a noexcept specification unless RETURN_COND is true,
22954 in which case a boolean condition is returned instead. */
22956 static tree
22961 {
22965 /* Peek at the next token. */
22968 /* Is it a noexcept-specification? */
22970 {
22971 tree expr;
22975 {
22979 {
22980 /* Types may not be defined in an exception-specification. */
22982 parser->type_definition_forbidden_message
22987 /* Restore the saved message. */
22989 }
22990 else
22991 {
22994 }
22997 }
22998 else
22999 {
23003 }
23005 /* We cannot build a noexcept-spec right away because this will check
23006 that expr is a constexpr. */
23009 else
23011 }
23012 else
23014 }
23016 /* Parse an (optional) exception-specification.
23018 exception-specification:
23019 throw ( type-id-list [opt] )
23021 Returns a TREE_LIST representing the exception-specification. The
23022 TREE_VALUE of each node is a type. */
23024 static tree
23026 {
23028 tree type_id_list;
23031 /* Peek at the next token. */
23034 /* Is it a noexcept-specification? */
23040 /* If it's not `throw', then there's no exception-specification. */
23044 #if 0
23045 /* Enable this once a lot of code has transitioned to noexcept? */
23049 #endif
23051 /* Consume the `throw'. */
23054 /* Look for the `('. */
23057 /* Peek at the next token. */
23059 /* If it's not a `)', then there is a type-id-list. */
23061 {
23062 /* Types may not be defined in an exception-specification. */
23064 parser->type_definition_forbidden_message
23066 /* Parse the type-id-list. */
23068 /* Restore the saved message. */
23070 }
23071 else
23074 /* Look for the `)'. */
23078 }
23080 /* Parse an (optional) type-id-list.
23082 type-id-list:
23083 type-id ... [opt]
23084 type-id-list , type-id ... [opt]
23086 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
23087 in the order that the types were presented. */
23089 static tree
23091 {
23095 {
23097 tree type;
23101 /* Get the next type-id. */
23103 /* Check for invalid 'auto'. */
23105 {
23109 }
23110 /* Parse the optional ellipsis. */
23112 {
23113 /* Consume the `...'. */
23116 /* Turn the type into a pack expansion expression. */
23118 }
23119 /* Add it to the list. */
23121 /* Peek at the next token. */
23123 /* If it is not a `,', we are done. */
23126 /* Consume the `,'. */
23128 }
23131 }
23133 /* Parse a try-block.
23135 try-block:
23136 try compound-statement handler-seq */
23138 static tree
23140 {
23141 tree try_block;
23155 }
23157 /* Parse a function-try-block.
23159 function-try-block:
23160 try ctor-initializer [opt] function-body handler-seq */
23162 static bool
23164 {
23165 tree compound_stmt;
23166 tree try_block;
23169 /* Look for the `try' keyword. */
23172 /* Let the rest of the front end know where we are. */
23174 /* Parse the function-body. */
23175 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23177 /* We're done with the `try' part. */
23179 /* Parse the handlers. */
23181 /* We're done with the handlers. */
23185 }
23187 /* Parse a handler-seq.
23189 handler-seq:
23190 handler handler-seq [opt] */
23192 static void
23194 {
23196 {
23199 /* Parse the handler. */
23201 /* Peek at the next token. */
23203 /* If it's not `catch' then there are no more handlers. */
23206 }
23207 }
23209 /* Parse a handler.
23211 handler:
23212 catch ( exception-declaration ) compound-statement */
23214 static void
23216 {
23217 tree handler;
23218 tree declaration;
23228 }
23230 /* Parse an exception-declaration.
23232 exception-declaration:
23233 type-specifier-seq declarator
23234 type-specifier-seq abstract-declarator
23235 type-specifier-seq
23236 ...
23238 Returns a VAR_DECL for the declaration, or NULL_TREE if the
23239 ellipsis variant is used. */
23241 static tree
23243 {
23244 cp_decl_specifier_seq type_specifiers;
23248 /* If it's an ellipsis, it's easy to handle. */
23250 {
23251 /* Consume the `...' token. */
23254 }
23256 /* Types may not be defined in exception-declarations. */
23258 parser->type_definition_forbidden_message
23261 /* Parse the type-specifier-seq. */
23265 /* If it's a `)', then there is no declarator. */
23268 else
23275 /* Restore the saved message. */
23282 }
23284 /* Parse a throw-expression.
23286 throw-expression:
23287 throw assignment-expression [opt]
23289 Returns a THROW_EXPR representing the throw-expression. */
23291 static tree
23293 {
23294 tree expression;
23299 /* Figure out whether or not there is an assignment-expression
23300 following the "throw" keyword. */
23308 else
23312 }
23314 /* GNU Extensions */
23316 /* Parse an (optional) asm-specification.
23318 asm-specification:
23319 asm ( string-literal )
23321 If the asm-specification is present, returns a STRING_CST
23322 corresponding to the string-literal. Otherwise, returns
23323 NULL_TREE. */
23325 static tree
23327 {
23329 tree asm_specification;
23331 /* Peek at the next token. */
23333 /* If the next token isn't the `asm' keyword, then there's no
23334 asm-specification. */
23338 /* Consume the `asm' token. */
23340 /* Look for the `('. */
23343 /* Look for the string-literal. */
23346 /* Look for the `)'. */
23350 }
23352 /* Parse an asm-operand-list.
23354 asm-operand-list:
23355 asm-operand
23356 asm-operand-list , asm-operand
23358 asm-operand:
23359 string-literal ( expression )
23360 [ string-literal ] string-literal ( expression )
23362 Returns a TREE_LIST representing the operands. The TREE_VALUE of
23363 each node is the expression. The TREE_PURPOSE is itself a
23364 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
23365 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
23366 is a STRING_CST for the string literal before the parenthesis. Returns
23367 ERROR_MARK_NODE if any of the operands are invalid. */
23369 static tree
23371 {
23376 {
23377 tree string_literal;
23378 tree expression;
23379 tree name;
23382 {
23383 /* Consume the `[' token. */
23385 /* Read the operand name. */
23390 /* Look for the closing `]'. */
23392 }
23393 else
23395 /* Look for the string-literal. */
23398 /* Look for the `('. */
23400 /* Parse the expression. */
23402 /* Look for the `)'. */
23410 /* Add this operand to the list. */
23412 expression,
23413 asm_operands);
23414 /* If the next token is not a `,', there are no more
23415 operands. */
23418 /* Consume the `,'. */
23420 }
23423 }
23425 /* Parse an asm-clobber-list.
23427 asm-clobber-list:
23428 string-literal
23429 asm-clobber-list , string-literal
23431 Returns a TREE_LIST, indicating the clobbers in the order that they
23432 appeared. The TREE_VALUE of each node is a STRING_CST. */
23434 static tree
23436 {
23440 {
23441 tree string_literal;
23443 /* Look for the string literal. */
23445 /* Add it to the list. */
23447 /* If the next token is not a `,', then the list is
23448 complete. */
23451 /* Consume the `,' token. */
23453 }
23456 }
23458 /* Parse an asm-label-list.
23460 asm-label-list:
23461 identifier
23462 asm-label-list , identifier
23464 Returns a TREE_LIST, indicating the labels in the order that they
23465 appeared. The TREE_VALUE of each node is a label. */
23467 static tree
23469 {
23473 {
23476 /* Look for the identifier. */
23479 {
23482 {
23488 }
23489 }
23490 /* If the next token is not a `,', then the list is
23491 complete. */
23494 /* Consume the `,' token. */
23496 }
23499 }
23501 /* Return TRUE iff the next tokens in the stream are possibly the
23502 beginning of a GNU extension attribute. */
23504 static bool
23506 {
23508 }
23510 /* Return TRUE iff the next tokens in the stream are possibly the
23511 beginning of a standard C++-11 attribute specifier. */
23513 static bool
23515 {
23517 }
23519 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23520 beginning of a standard C++-11 attribute specifier. */
23522 static bool
23524 {
23532 }
23534 /* Return TRUE iff the next Nth tokens in the stream are possibly the
23535 beginning of a GNU extension attribute. */
23537 static bool
23539 {
23543 }
23545 /* Return true iff the next tokens can be the beginning of either a
23546 GNU attribute list, or a standard C++11 attribute sequence. */
23548 static bool
23550 {
23553 }
23555 /* Return true iff the next Nth tokens can be the beginning of either
23556 a GNU attribute list, or a standard C++11 attribute sequence. */
23558 static bool
23560 {
23563 }
23565 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
23566 of GNU attributes, or return NULL. */
23568 static tree
23570 {
23574 }
23576 #define CILK_SIMD_FN_CLAUSE_MASK \
23577 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
23578 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
23579 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
23580 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
23581 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
23583 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
23584 vector [(<clauses>)] */
23586 static void
23588 {
23592 {
23597 }
23600 {
23603 paren_scope++;
23604 }
23606 {
23609 paren_scope++;
23611 paren_scope--;
23612 /* Do not push the last ')' */
23615 }
23624 }
23626 /* Parse an (optional) series of attributes.
23628 attributes:
23629 attributes attribute
23631 attribute:
23632 __attribute__ (( attribute-list [opt] ))
23634 The return value is as for cp_parser_gnu_attribute_list. */
23636 static tree
23638 {
23642 {
23644 tree attribute_list;
23647 /* Peek at the next token. */
23649 /* If it's not `__attribute__', then we're done. */
23653 /* Consume the `__attribute__' keyword. */
23655 /* Look for the two `(' tokens. */
23659 /* Peek at the next token. */
23662 /* Parse the attribute-list. */
23664 else
23665 /* If the next token is a `)', then there is no attribute
23666 list. */
23669 /* Look for the two `)' tokens. */
23677 /* Add these new attributes to the list. */
23679 }
23682 }
23684 /* Parse a GNU attribute-list.
23686 attribute-list:
23687 attribute
23688 attribute-list , attribute
23690 attribute:
23691 identifier
23692 identifier ( identifier )
23693 identifier ( identifier , expression-list )
23694 identifier ( expression-list )
23696 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
23697 to an attribute. The TREE_PURPOSE of each node is the identifier
23698 indicating which attribute is in use. The TREE_VALUE represents
23699 the arguments, if any. */
23701 static tree
23703 {
23709 {
23711 tree identifier;
23712 tree attribute;
23714 /* Look for the identifier. We also allow keywords here; for
23715 example `__attribute__ ((const))' is legal. */
23719 {
23722 /* Consume the token, but save it since we need it for the
23723 SIMD enabled function parsing. */
23726 /* Save away the identifier that indicates which attribute
23727 this is. */
23729 /* For keywords, use the canonical spelling, not the
23730 parsed identifier. */
23736 /* Peek at the next token. */
23738 /* If it's an `(', then parse the attribute arguments. */
23740 {
23745 {
23748 }
23749 else
23750 vec = cp_parser_parenthesized_expression_list
23756 else
23757 {
23760 }
23761 /* Save the arguments away. */
23763 }
23765 {
23768 }
23771 {
23772 /* Add this attribute to the list. */
23775 }
23778 }
23779 /* Now, look for more attributes. If the next token isn't a
23780 `,', we're done. */
23784 /* Consume the comma and keep going. */
23786 }
23789 /* We built up the list in reverse order. */
23791 }
23793 /* Parse a standard C++11 attribute.
23795 The returned representation is a TREE_LIST which TREE_PURPOSE is
23796 the scoped name of the attribute, and the TREE_VALUE is its
23797 arguments list.
23799 Note that the scoped name of the attribute is itself a TREE_LIST
23800 which TREE_PURPOSE is the namespace of the attribute, and
23801 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
23802 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
23803 and which TREE_PURPOSE is directly the attribute name.
23805 Clients of the attribute code should use get_attribute_namespace
23806 and get_attribute_name to get the actual namespace and name of
23807 attributes, regardless of their being GNU or C++11 attributes.
23809 attribute:
23810 attribute-token attribute-argument-clause [opt]
23812 attribute-token:
23813 identifier
23814 attribute-scoped-token
23816 attribute-scoped-token:
23817 attribute-namespace :: identifier
23819 attribute-namespace:
23820 identifier
23822 attribute-argument-clause:
23823 ( balanced-token-seq )
23825 balanced-token-seq:
23826 balanced-token [opt]
23827 balanced-token-seq balanced-token
23829 balanced-token:
23830 ( balanced-token-seq )
23831 [ balanced-token-seq ]
23832 { balanced-token-seq }. */
23834 static tree
23836 {
23840 /* First, parse name of the attribute, a.k.a attribute-token. */
23857 {
23858 /* We are seeing a scoped attribute token. */
23868 else
23869 {
23873 }
23875 NULL_TREE);
23877 }
23878 else
23879 {
23881 NULL_TREE);
23882 /* C++11 noreturn attribute is equivalent to GNU's. */
23885 /* C++14 deprecated attribute is equivalent to GNU's. */
23887 {
23890 "%<deprecated%> is a C++14 feature;"
23893 }
23894 /* Transactional Memory TS optimize_for_synchronized attribute is
23895 equivalent to GNU transaction_callable. */
23899 /* Transactional Memory attributes are GNU attributes. */
23902 }
23904 /* Now parse the optional argument clause of the attribute. */
23909 {
23915 /* A GNU attribute that takes an identifier in parameter. */
23918 vec = cp_parser_parenthesized_expression_list
23924 else
23925 {
23928 }
23932 else
23934 }
23937 }
23939 /* Check that the attribute ATTRIBUTE appears at most once in the
23940 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
23941 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
23942 isn't implemented yet in GCC. */
23944 static void
23946 {
23948 {
23958 }
23959 }
23961 /* Parse a list of standard C++-11 attributes.
23963 attribute-list:
23964 attribute [opt]
23965 attribute-list , attribute[opt]
23966 attribute ...
23967 attribute-list , attribute ...
23968 */
23970 static tree
23972 {
23977 {
23982 {
23986 }
23989 {
23994 }
23998 }
24001 }
24003 /* Parse a standard C++-11 attribute specifier.
24005 attribute-specifier:
24006 [ [ attribute-list ] ]
24007 alignment-specifier
24009 alignment-specifier:
24010 alignas ( type-id ... [opt] )
24011 alignas ( alignment-expression ... [opt] ). */
24013 static tree
24015 {
24021 {
24030 else
24031 /* Warn about parsing c++11 attribute in non-c++1 mode, only
24032 when we are sure that we have actually parsed them. */
24034 }
24035 else
24036 {
24037 tree alignas_expr;
24039 /* Look for an alignment-specifier. */
24051 {
24054 }
24060 {
24064 alignas_expr =
24071 }
24077 {
24080 }
24083 {
24086 }
24088 /* Build the C++-11 representation of an 'aligned'
24089 attribute. */
24090 attributes =
24093 alignas_expr);
24094 }
24097 }
24099 /* Parse a standard C++-11 attribute-specifier-seq.
24101 attribute-specifier-seq:
24102 attribute-specifier-seq [opt] attribute-specifier
24103 */
24105 static tree
24107 {
24112 {
24121 else
24124 }
24127 }
24129 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
24130 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
24131 current value of the PEDANTIC flag, regardless of whether or not
24132 the `__extension__' keyword is present. The caller is responsible
24133 for restoring the value of the PEDANTIC flag. */
24135 static bool
24137 {
24138 /* Save the old value of the PEDANTIC flag. */
24142 {
24143 /* Consume the `__extension__' token. */
24145 /* We're not being pedantic while the `__extension__' keyword is
24146 in effect. */
24150 }
24153 }
24155 /* Parse a label declaration.
24157 label-declaration:
24158 __label__ label-declarator-seq ;
24160 label-declarator-seq:
24161 identifier , label-declarator-seq
24162 identifier */
24164 static void
24166 {
24167 /* Look for the `__label__' keyword. */
24171 {
24172 tree identifier;
24174 /* Look for an identifier. */
24176 /* If we failed, stop. */
24179 /* Declare it as a label. */
24181 /* If the next token is a `;', stop. */
24184 /* Look for the `,' separating the label declarations. */
24186 }
24188 /* Look for the final `;'. */
24190 }
24192 // -------------------------------------------------------------------------- //
24193 // Requires Clause
24195 // Parse a requires clause.
24196 //
24197 // requires-clause:
24198 // 'requires' logical-or-expression
24199 //
24200 // The required logical-or-expression must be a constant expression. Note
24201 // that we don't check that the expression is constepxr here. We defer until
24202 // we analyze constraints and then, we only check atomic constraints.
24203 static tree
24205 {
24206 // Parse the requires clause so that it is not automatically folded.
24214 }
24216 // Optionally parse a requires clause:
24217 static tree
24219 {
24222 {
24225 {
24228 /* Parse and discard the requires-clause. */
24231 }
24233 }
24236 }
24239 /*---------------------------------------------------------------------------
24240 Requires expressions
24241 ---------------------------------------------------------------------------*/
24243 /* Parse a requires expression
24245 requirement-expression:
24246 'requires' requirement-parameter-list [opt] requirement-body */
24247 static tree
24249 {
24253 /* A requires-expression shall appear only within a concept
24254 definition or a requires-clause.
24256 TODO: Implement this diagnostic correctly. */
24258 {
24262 }
24265 {
24266 /* Local parameters are delared as variables within the scope
24267 of the expression. They are not visible past the end of
24268 the expression. Expressions within the requires-expression
24269 are unevaluated. */
24270 struct scope_sentinel
24271 {
24273 {
24276 }
24279 {
24282 }
24285 /* Parse the optional parameter list. */
24287 {
24291 }
24292 else
24295 /* Parse the requirement body. */
24299 }
24301 /* This needs to happen after pop_bindings_and_leave_scope, as it reverses
24302 the parm chain. */
24305 }
24307 /* Parse a parameterized requirement.
24309 requirement-parameter-list:
24310 '(' parameter-declaration-clause ')' */
24311 static tree
24313 {
24323 }
24325 /* Parse the body of a requirement.
24327 requirement-body:
24328 '{' requirement-list '}' */
24329 static tree
24331 {
24341 }
24343 /* Parse a list of requirements.
24345 requirement-list:
24346 requirement
24347 requirement-list ';' requirement[opt] */
24348 static tree
24350 {
24353 {
24360 /* If we see a semi-colon, consume it. */
24364 /* Stop processing at the end of the list. */
24367 }
24369 /* Reverse the order of requirements so they are analyzed in
24370 declaration order. */
24372 }
24374 /* Parse a syntactic requirement or type requirement.
24376 requirement:
24377 simple-requirement
24378 compound-requirement
24379 type-requirement
24380 nested-requirement */
24381 static tree
24383 {
24390 else
24392 }
24394 /* Parse a simple requirement.
24396 simple-requirement:
24397 expression ';' */
24398 static tree
24400 {
24409 }
24411 /* Parse a type requirement
24413 type-requirement
24414 nested-name-specifier [opt] required-type-name ';'
24416 required-type-name:
24417 type-name
24418 'template' [opt] simple-template-id */
24419 static tree
24421 {
24424 // Save the scope before parsing name specifiers.
24435 tree type;
24437 {
24446 }
24447 else
24466 }
24468 /* Parse a compound requirement
24470 compound-requirement:
24471 '{' expression '}' 'noexcept' [opt] trailing-return-type [opt] ';' */
24472 static tree
24474 {
24475 /* Parse an expression enclosed in '{ }'s. */
24486 /* Parse the optional noexcept. */
24489 {
24492 }
24494 /* Parse the optional trailing return type. */
24497 {
24505 }
24508 }
24510 /* Parse a nested requirement. This is the same as a requires clause.
24512 nested-requirement:
24513 requires-clause */
24514 static tree
24516 {
24522 }
24524 /* Support Functions */
24526 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
24527 NAME should have one of the representations used for an
24528 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
24529 is returned. If PARSER->SCOPE is a dependent type, then a
24530 SCOPE_REF is returned.
24532 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
24533 returned; the name was already resolved when the TEMPLATE_ID_EXPR
24534 was formed. Abstractly, such entities should not be passed to this
24535 function, because they do not need to be looked up, but it is
24536 simpler to check for this special case here, rather than at the
24537 call-sites.
24539 In cases not explicitly covered above, this function returns a
24540 DECL, OVERLOAD, or baselink representing the result of the lookup.
24541 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
24542 is returned.
24544 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
24545 (e.g., "struct") that was used. In that case bindings that do not
24546 refer to types are ignored.
24548 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
24549 ignored.
24551 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
24552 are ignored.
24554 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
24555 types.
24557 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
24558 TREE_LIST of candidates if name-lookup results in an ambiguity, and
24559 NULL_TREE otherwise. */
24561 static cp_expr
24568 location_t name_location)
24569 {
24570 tree decl;
24573 /* Assume that the lookup will be unambiguous. */
24577 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
24578 no longer valid. Note that if we are parsing tentatively, and
24579 the parse fails, OBJECT_TYPE will be automatically restored. */
24585 /* A template-id has already been resolved; there is no lookup to
24586 do. */
24590 {
24594 }
24596 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
24597 it should already have been checked to make sure that the name
24598 used matches the type being destroyed. */
24600 {
24601 tree type;
24603 /* Figure out to which type this destructor applies. */
24608 else
24610 /* If that's not a class type, there is no destructor. */
24617 /* If it was a class type, return the destructor. */
24619 }
24621 /* By this point, the NAME should be an ordinary identifier. If
24622 the id-expression was a qualified name, the qualifying scope is
24623 stored in PARSER->SCOPE at this point. */
24626 /* Perform the lookup. */
24628 {
24634 /* If the SCOPE is dependent, the lookup must be deferred until
24635 the template is instantiated -- unless we are explicitly
24636 looking up names in uninstantiated templates. Even then, we
24637 cannot look up the name if the scope is not a class type; it
24638 might, for example, be a template type parameter. */
24643 /* Defer lookup. */
24645 else
24646 {
24649 /* If PARSER->SCOPE is a dependent type, then it must be a
24650 class type, and we must not be checking dependencies;
24651 otherwise, we would have processed this lookup above. So
24652 that PARSER->SCOPE is not considered a dependent base by
24653 lookup_member, we must enter the scope here. */
24657 /* If the PARSER->SCOPE is a template specialization, it
24658 may be instantiated during name lookup. In that case,
24659 errors may be issued. Even if we rollback the current
24660 tentative parse, those errors are valid. */
24665 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
24666 lookup result and the nested-name-specifier nominates a class C:
24667 * if the name specified after the nested-name-specifier, when
24668 looked up in C, is the injected-class-name of C (Clause 9), or
24669 * if the name specified after the nested-name-specifier is the
24670 same as the identifier or the simple-template-id's template-
24671 name in the last component of the nested-name-specifier,
24672 the name is instead considered to name the constructor of
24673 class C. [ Note: for example, the constructor is not an
24674 acceptable lookup result in an elaborated-type-specifier so
24675 the constructor would not be used in place of the
24676 injected-class-name. --end note ] Such a constructor name
24677 shall be used only in the declarator-id of a declaration that
24678 names a constructor or in a using-declaration. */
24686 /* If we have a single function from a using decl, pull it out. */
24693 }
24695 /* If the scope is a dependent type and either we deferred lookup or
24696 we did lookup but didn't find the name, rememeber the name. */
24699 {
24701 {
24702 tree type;
24704 /* The resolution to Core Issue 180 says that `struct
24705 A::B' should be considered a type-name, even if `A'
24706 is dependent. */
24711 }
24715 CPP_CLOSE_PAREN)))
24719 else
24722 is_template);
24723 }
24726 }
24728 {
24729 /* Look up the name in the scope of the OBJECT_TYPE, unless the
24730 OBJECT_TYPE is not a class. */
24732 /* If the OBJECT_TYPE is a template specialization, it may
24733 be instantiated during name lookup. In that case, errors
24734 may be issued. Even if we rollback the current tentative
24735 parse, those errors are valid. */
24737 name,
24740 tf_warning_or_error);
24741 else
24745 {
24746 /* Look it up in the enclosing context. */
24750 /* DR 141 says when looking for a template-name after -> or ., only
24751 consider class templates. We need to fix our handling of
24752 dependent expressions to implement that properly, but for now
24753 let's ignore namespace-scope function templates. */
24755 {
24761 }
24762 }
24764 /* The object is type-dependent, so we can't look anything up; we used
24765 this to get the DR 141 behavior. */
24769 }
24770 else
24771 {
24777 }
24779 /* If the lookup failed, let our caller know. */
24783 /* Pull out the template from an injected-class-name (or multiple). */
24787 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
24789 {
24792 /* The error message we have to print is too complicated for
24793 cp_parser_error, so we incorporate its actions directly. */
24795 {
24797 name);
24799 }
24801 }
24809 /* If we have resolved the name of a member declaration, check to
24810 see if the declaration is accessible. When the name resolves to
24811 set of overloaded functions, accessibility is checked when
24812 overload resolution is done.
24814 During an explicit instantiation, access is not checked at all,
24815 as per [temp.explicit]. */
24822 }
24824 /* Like cp_parser_lookup_name, but for use in the typical case where
24825 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
24826 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
24828 static tree
24830 {
24832 none_type,
24837 location);
24838 }
24840 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
24841 the current context, return the TYPE_DECL. If TAG_NAME_P is
24842 true, the DECL indicates the class being defined in a class-head,
24843 or declared in an elaborated-type-specifier.
24845 Otherwise, return DECL. */
24847 static tree
24849 {
24850 /* If the TEMPLATE_DECL is being declared as part of a class-head,
24851 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
24853 struct A {
24854 template <typename T> struct B;
24855 };
24857 template <typename T> struct A::B {};
24859 Similarly, in an elaborated-type-specifier:
24861 namespace N { struct X{}; }
24863 struct A {
24864 template <typename T> friend struct N::X;
24865 };
24867 However, if the DECL refers to a class type, and we are in
24868 the scope of the class, then the name lookup automatically
24869 finds the TYPE_DECL created by build_self_reference rather
24870 than a TEMPLATE_DECL. For example, in:
24872 template <class T> struct S {
24873 S s;
24874 };
24876 there is no need to handle such case. */
24882 }
24884 /* If too many, or too few, template-parameter lists apply to the
24885 declarator, issue an error message. Returns TRUE if all went well,
24886 and FALSE otherwise. */
24888 static bool
24891 location_t declarator_location)
24892 {
24894 {
24896 {
24904 /* If the DECLARATOR has the form `X<y>' then it uses one
24905 additional level of template parameters. */
24908 return cp_parser_check_template_parameters
24910 }
24925 }
24927 }
24929 /* NUM_TEMPLATES were used in the current declaration. If that is
24930 invalid, return FALSE and issue an error messages. Otherwise,
24931 return TRUE. If DECLARATOR is non-NULL, then we are checking a
24932 declarator and we can print more accurate diagnostics. */
24934 static bool
24937 location_t location,
24939 {
24940 /* If there are the same number of template classes and parameter
24941 lists, that's OK. */
24944 /* If there are more, but only one more, then we are referring to a
24945 member template. That's OK too. */
24948 /* If there are more template classes than parameter lists, we have
24949 something like:
24951 template <class T> void S<T>::R<T>::f (); */
24953 {
24963 else
24966 }
24967 /* Otherwise, there are too many template parameter lists. We have
24968 something like:
24970 template <class T> template <class U> void S::f(); */
24973 }
24975 /* Parse an optional `::' token indicating that the following name is
24976 from the global namespace. If so, PARSER->SCOPE is set to the
24977 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
24978 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
24979 Returns the new value of PARSER->SCOPE, if the `::' token is
24980 present, and NULL_TREE otherwise. */
24982 static tree
24984 {
24987 /* Peek at the next token. */
24989 /* If we're looking at a `::' token then we're starting from the
24990 global namespace, not our current location. */
24992 {
24993 /* Consume the `::' token. */
24995 /* Set the SCOPE so that we know where to start the lookup. */
25001 }
25003 {
25007 }
25010 }
25012 /* Returns TRUE if the upcoming token sequence is the start of a
25013 constructor declarator. If FRIEND_P is true, the declarator is
25014 preceded by the `friend' specifier. */
25016 static bool
25018 {
25021 tree nested_name_specifier;
25024 /* The common case is that this is not a constructor declarator, so
25025 try to avoid doing lots of work if at all possible. It's not
25026 valid declare a constructor at function scope. */
25029 /* And only certain tokens can begin a constructor declarator. */
25037 /* Parse tentatively; we are going to roll back all of the tokens
25038 consumed here. */
25040 /* Assume that we are looking at a constructor declarator. */
25043 /* Look for the optional `::' operator. */
25046 /* Look for the nested-name-specifier. */
25047 nested_name_specifier
25058 /* Outside of a class-specifier, there must be a
25059 nested-name-specifier. */
25065 /* If we have a class scope, this is easy; DR 147 says that S::S always
25066 names the constructor, and no other qualified name could. */
25069 {
25079 }
25080 /* If we still think that this might be a constructor-declarator,
25081 look for a class-name. */
25083 {
25084 /* If we have:
25086 template <typename T> struct S {
25087 S();
25088 };
25090 we must recognize that the nested `S' names a class. */
25091 tree type_decl;
25095 none_type,
25099 /* If there was no class-name, then this is not a constructor.
25100 Otherwise, if we are in a class-specifier and we aren't
25101 handling a friend declaration, check that its type matches
25102 current_class_type (c++/38313). Note: error_mark_node
25103 is left alone for error recovery purposes. */
25105 && (outside_class_specifier_p
25110 /* If we're still considering a constructor, we have to see a `(',
25111 to begin the parameter-declaration-clause, followed by either a
25112 `)', an `...', or a decl-specifier. We need to check for a
25113 type-specifier to avoid being fooled into thinking that:
25115 S (f) (int);
25117 is a constructor. (It is actually a function named `f' that
25118 takes one parameter (of type `int') and returns a value of type
25119 `S'. */
25127 /* A parameter declaration begins with a decl-specifier,
25128 which is either the "attribute" keyword, a storage class
25129 specifier, or (usually) a type-specifier. */
25131 {
25132 tree type;
25136 /* Names appearing in the type-specifier should be looked up
25137 in the scope of the class. */
25140 else
25141 {
25144 {
25148 {
25151 }
25152 }
25154 }
25156 /* Inside the constructor parameter list, surrounding
25157 template-parameter-lists do not apply. */
25158 saved_num_template_parameter_lists
25162 /* Look for the type-specifier. */
25164 CP_PARSER_FLAGS_NONE,
25170 parser->num_template_parameter_lists
25173 /* Leave the scope of the class. */
25178 }
25179 }
25181 /* We did not really want to consume any tokens. */
25185 }
25187 /* Parse the definition of the function given by the DECL_SPECIFIERS,
25188 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
25189 they must be performed once we are in the scope of the function.
25191 Returns the function defined. */
25193 static tree
25194 cp_parser_function_definition_from_specifiers_and_declarator
25197 tree attributes,
25199 {
25200 tree fn;
25203 /* Begin the function-definition. */
25206 /* The things we're about to see are not directly qualified by any
25207 template headers we've seen thus far. */
25210 /* If there were names looked up in the decl-specifier-seq that we
25211 did not check, check them now. We must wait until we are in the
25212 scope of the function to perform the checks, since the function
25213 might be a friend. */
25217 {
25222 }
25225 {
25226 /* Skip the entire function. */
25229 }
25231 {
25232 /* Seen already, skip it. An error message has already been output. */
25236 /* If this is a function from a class, pop the nested class. */
25239 }
25240 else
25241 {
25242 timevar_id_t tv;
25245 else
25251 }
25254 }
25256 /* Parse the part of a function-definition that follows the
25257 declarator. INLINE_P is TRUE iff this function is an inline
25258 function defined within a class-specifier.
25260 Returns the function defined. */
25262 static tree
25265 {
25266 tree fn;
25272 bool fully_implicit_function_template_p
25275 tree implicit_template_parms
25278 cp_binding_level* implicit_template_scope
25284 /* If the next token is `return', then the code may be trying to
25285 make use of the "named return value" extension that G++ used to
25286 support. */
25289 {
25290 /* Consume the `return' keyword. */
25292 /* Look for the identifier that indicates what value is to be
25293 returned. */
25295 /* Issue an error message. */
25298 /* Skip tokens until we reach the start of the function body. */
25300 {
25307 }
25308 }
25309 /* The `extern' in `extern "C" void f () { ... }' does not apply to
25310 anything declared inside `f'. */
25311 saved_in_unbraced_linkage_specification_p
25314 /* Inside the function, surrounding template-parameter-lists do not
25315 apply. */
25316 saved_num_template_parameter_lists
25322 /* If the next token is `try', `__transaction_atomic', or
25323 `__transaction_relaxed`, then we are looking at either function-try-block
25324 or function-transaction-block. Note that all of these include the
25325 function-body. */
25328 RID_TRANSACTION_ATOMIC);
25330 RID_TRANSACTION_RELAXED))
25332 RID_TRANSACTION_RELAXED);
25335 else
25336 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
25341 /* Finish the function. */
25344 /* Generate code for it, if necessary. */
25346 /* Restore the saved values. */
25347 parser->in_unbraced_linkage_specification_p
25349 parser->num_template_parameter_lists
25353 parser->fully_implicit_function_template_p
25355 parser->implicit_template_parms
25357 parser->implicit_template_scope
25364 }
25366 /* Parse a template-declaration body (following argument list). */
25368 static void
25370 tree parameter_list,
25372 {
25376 /* We just processed one more parameter list. */
25379 /* Get the deferred access checks from the parameter list. These
25380 will be checked once we know what is being declared, as for a
25381 member template the checks must be performed in the scope of the
25382 class containing the member. */
25385 /* Tentatively parse for a new template parameter list, which can either be
25386 the template keyword or a template introduction. */
25392 else
25393 {
25394 /* There are no access checks when parsing a template, as we do not
25395 know if a specialization will be a friend. */
25399 checks,
25400 member_p,
25405 /* If this is a member template declaration, let the front
25406 end know. */
25408 {
25413 }
25418 }
25419 /* We are done with the current parameter list. */
25424 /* Finish up. */
25427 /* Check the template arguments for a literal operator template. */
25431 {
25435 else
25436 {
25439 {
25445 }
25447 {
25455 }
25456 else
25458 }
25460 {
25463 " Expected non-type template argument pack <char...>"
25465 decl);
25466 else
25469 decl);
25470 }
25471 }
25473 /* Register member declarations. */
25476 /* If DECL is a function template, we must return to parse it later.
25477 (Even though there is no definition, there might be default
25478 arguments that need handling.) */
25482 }
25484 /* Parse a template introduction header for a template-declaration. Returns
25485 false if tentative parse fails. */
25487 static bool
25489 {
25496 /* Look for the optional `::' operator. */
25499 /* Look for the nested-name-specifier. */
25509 /* Look up the concept for which we will be matching
25510 template parameters. */
25520 /* Look for opening brace for introduction. */
25528 /* Build vector of placeholder parameters and grab
25529 matching identifiers. */
25532 /* The introduction-list shall not be empty. */
25535 {
25538 }
25540 /* Look for closing brace for introduction. */
25545 {
25549 }
25551 /* Build and associate the constraint. */
25554 {
25556 member_p);
25558 }
25562 }
25564 /* Parse a normal template-declaration following the template keyword. */
25566 static void
25568 {
25569 tree parameter_list;
25573 /* Look for the `<' token. */
25577 {
25578 /* 14.5.2.2 [temp.mem]
25580 A local class shall not have member templates. */
25585 }
25586 /* [temp]
25588 A template ... shall not have C linkage. */
25590 {
25592 /* Give it C++ linkage to avoid confusing other parts of the
25593 front end. */
25596 }
25597 else
25600 /* We cannot perform access checks on the template parameter
25601 declarations until we know what is being declared, just as we
25602 cannot check the decl-specifier list. */
25605 /* If the next token is `>', then we have an invalid
25606 specialization. Rather than complain about an invalid template
25607 parameter, issue an error message here. */
25609 {
25613 }
25614 else
25615 {
25616 /* Parse the template parameters. */
25618 }
25620 /* Look for the `>'. */
25623 /* Manage template requirements */
25630 member_p);
25632 /* For the erroneous case of a template with C linkage, we pushed an
25633 implicit C++ linkage scope; exit that scope now. */
25636 }
25638 /* Parse a template-declaration, assuming that the `export' (and
25639 `extern') keywords, if present, has already been scanned. MEMBER_P
25640 is as for cp_parser_template_declaration. */
25642 static bool
25644 {
25646 {
25650 }
25655 }
25657 /* Perform the deferred access checks from a template-parameter-list.
25658 CHECKS is a TREE_LIST of access checks, as returned by
25659 get_deferred_access_checks. */
25661 static void
25662 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
25663 {
25667 }
25669 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
25670 `function-definition' sequence that follows a template header.
25671 If MEMBER_P is true, this declaration appears in a class scope.
25673 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
25674 *FRIEND_P is set to TRUE iff the declaration is a friend. */
25676 static tree
25682 {
25685 cp_decl_specifier_seq decl_specifiers;
25689 /* This function is only used when processing a template
25690 declaration. */
25694 /* Defer access checks until we know what is being declared. */
25697 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
25698 alternative. */
25701 CP_PARSER_FLAGS_OPTIONAL,
25707 /* There are no template typedefs. */
25709 {
25713 }
25715 /* Gather up the access checks that occurred the
25716 decl-specifier-seq. */
25719 /* Check for the declaration of a template class. */
25721 {
25724 {
25725 // If this is a declaration, but not a definition, associate
25726 // any constraints with the type declaration. Constraints
25727 // are associated with definitions in cp_parser_class_specifier.
25733 /* In this case:
25735 struct C {
25736 friend template <typename T> struct A<T>::B;
25737 };
25739 A<T>::B will be represented by a TYPENAME_TYPE, and
25740 therefore not recognized by shadow_tag. */
25742 && !decl
25749 else
25752 /* Perform access checks for template parameters. */
25755 /* Give a helpful diagnostic for
25756 template <class T> struct A { } a;
25757 if we aren't already recovering from an error. */
25760 {
25762 "a class template declaration must not declare "
25766 }
25767 }
25768 }
25770 /* Complain about missing 'typename' or other invalid type names. */
25773 {
25774 /* cp_parser_parse_and_diagnose_invalid_type_name calls
25775 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
25776 the rest of this declaration. */
25779 }
25781 /* If it's not a template class, try for a template function. If
25782 the next token is a `;', then this declaration does not declare
25783 anything. But, if there were errors in the decl-specifiers, then
25784 the error might well have come from an attempted class-specifier.
25785 In that case, there's no need to warn about a missing declarator. */
25789 {
25792 checks,
25794 member_p,
25795 declares_class_or_enum,
25799 /* 7.1.1-1 [dcl.stc]
25801 A storage-class-specifier shall not be specified in an explicit
25802 specialization... */
25804 && explicit_specialization_p
25806 {
25810 }
25814 }
25816 /* Look for a trailing `;' after the declaration. */
25822 out:
25825 /* Clear any current qualification; whatever comes next is the start
25826 of something new. */
25832 }
25834 /* Parse a cast-expression that is not the operand of a unary "&". */
25836 static cp_expr
25838 {
25841 }
25843 /* Parse a functional cast to TYPE. Returns an expression
25844 representing the cast. */
25846 static cp_expr
25848 {
25850 tree expression_list;
25851 cp_expr cast;
25860 {
25869 tf_warning_or_error);
25870 /* Create a location of the form:
25871 type_name{i, f}
25872 ^~~~~~~~~~~~~~~
25873 with caret == start at the start of the type name,
25874 finishing at the closing brace. */
25875 location_t finish_loc
25878 finish_loc);
25881 }
25890 else
25891 {
25894 }
25897 tf_warning_or_error);
25898 /* [expr.const]/1: In an integral constant expression "only type
25899 conversions to integral or enumeration type can be used". */
25905 NIC_CONSTRUCTOR))
25908 /* Create a location of the form:
25909 float(i)
25910 ^~~~~~~~
25911 with caret == start at the start of the type name,
25912 finishing at the closing paren. */
25913 location_t finish_loc
25918 }
25920 /* Save the tokens that make up the body of a member function defined
25921 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
25922 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
25923 specifiers applied to the declaration. Returns the FUNCTION_DECL
25924 for the member function. */
25926 static tree
25930 tree attributes)
25931 {
25934 tree fn;
25936 /* Create the FUNCTION_DECL. */
25940 /* If something went badly wrong, bail out now. */
25942 {
25943 /* If there's a function-body, skip it. */
25948 }
25950 /* Remember it, if there default args to post process. */
25953 /* Save away the tokens that make up the body of the
25954 function. */
25956 /* Handle function try blocks. */
25959 /* We can have braced-init-list mem-initializers before the fn body. */
25961 {
25964 {
25965 /* cache_group will stop after an un-nested { } pair, too. */
25969 /* variadic mem-inits have ... after the ')'. */
25972 }
25973 }
25975 /* Handle function try blocks. */
25980 /* Save away the inline definition; we will process it when the
25981 class is complete. */
25985 /* We need to know that this was defined in the class, so that
25986 friend templates are handled correctly. */
25989 /* Add FN to the queue of functions to be parsed later. */
25993 }
25995 /* Save the tokens that make up the in-class initializer for a non-static
25996 data member. Returns a DEFAULT_ARG. */
25998 static tree
26000 {
26002 }
26004 /* Parse a template-argument-list, as well as the trailing ">" (but
26005 not the opening "<"). See cp_parser_template_argument_list for the
26006 return value. */
26008 static tree
26010 {
26011 tree arguments;
26012 tree saved_scope;
26013 tree saved_qualifying_scope;
26014 tree saved_object_scope;
26019 /* [temp.names]
26021 When parsing a template-id, the first non-nested `>' is taken as
26022 the end of the template-argument-list rather than a greater-than
26023 operator. */
26024 saved_greater_than_is_operator_p
26027 /* Parsing the argument list may modify SCOPE, so we save it
26028 here. */
26032 /* We need to evaluate the template arguments, even though this
26033 template-id may be nested within a "sizeof". */
26038 /* Parse the template-argument-list itself. */
26042 else
26044 /* Look for the `>' that ends the template-argument-list. If we find
26045 a '>>' instead, it's probably just a typo. */
26047 {
26049 {
26050 /* In C++0x, a `>>' in a template argument list or cast
26051 expression is considered to be two separate `>'
26052 tokens. So, change the current token to a `>', but don't
26053 consume it: it will be consumed later when the outer
26054 template argument list (or cast expression) is parsed.
26055 Note that this replacement of `>' for `>>' is necessary
26056 even if we are parsing tentatively: in the tentative
26057 case, after calling
26058 cp_parser_enclosed_template_argument_list we will always
26059 throw away all of the template arguments and the first
26060 closing `>', either because the template argument list
26061 was erroneous or because we are replacing those tokens
26062 with a CPP_TEMPLATE_ID token. The second `>' (which will
26063 not have been thrown away) is needed either to close an
26064 outer template argument list or to complete a new-style
26065 cast. */
26068 }
26070 {
26071 /* If we're in a nested template argument list, the '>>' has
26072 to be a typo for '> >'. We emit the error message, but we
26073 continue parsing and we push a '>' as next token, so that
26074 the argument list will be parsed correctly. Note that the
26075 global source location is still on the token before the
26076 '>>', so we need to say explicitly where we want it. */
26082 }
26083 else
26084 {
26085 /* If this is not a nested template argument list, the '>>'
26086 is a typo for '>'. Emit an error message and continue.
26087 Same deal about the token location, but here we can get it
26088 right by consuming the '>>' before issuing the diagnostic. */
26091 "spurious %<>>%>, use %<>%> to terminate "
26093 }
26094 }
26095 else
26097 /* The `>' token might be a greater-than operator again now. */
26098 parser->greater_than_is_operator_p
26100 /* Restore the SAVED_SCOPE. */
26108 }
26110 /* MEMBER_FUNCTION is a member function, or a friend. If default
26111 arguments, or the body of the function have not yet been parsed,
26112 parse them now. */
26114 static void
26116 {
26118 /* If this member is a template, get the underlying
26119 FUNCTION_DECL. */
26123 /* There should not be any class definitions in progress at this
26124 point; the bodies of members are only parsed outside of all class
26125 definitions. */
26127 /* While we're parsing the member functions we might encounter more
26128 classes. We want to handle them right away, but we don't want
26129 them getting mixed up with functions that are currently in the
26130 queue. */
26133 /* Make sure that any template parameters are in scope. */
26136 /* If the body of the function has not yet been parsed, parse it
26137 now. */
26139 {
26140 tree function_scope;
26143 /* The function is no longer pending; we are processing it. */
26148 /* If this is a local class, enter the scope of the containing
26149 function. */
26154 /* Push the body of the function onto the lexer stack. */
26157 /* Let the front end know that we going to be defining this
26158 function. */
26162 /* Don't do access checking if it is a templated function. */
26166 /* #pragma omp declare reduction needs special parsing. */
26168 {
26173 }
26174 else
26175 /* Now, parse the body of the function. */
26182 /* Leave the scope of the containing function. */
26186 }
26188 /* Remove any template parameters from the symbol table. */
26191 /* Restore the queue. */
26194 }
26196 /* If DECL contains any default args, remember it on the unparsed
26197 functions queue. */
26199 static void
26201 {
26202 tree probe;
26205 probe;
26208 {
26212 }
26213 }
26215 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
26216 which is either a FIELD_DECL or PARM_DECL. Parse it and return
26217 the result. For a PARM_DECL, PARMTYPE is the corresponding type
26218 from the parameter-type-list. */
26220 static tree
26223 {
26225 tree parsed_arg;
26231 /* Push the saved tokens for the default argument onto the parser's
26232 lexer stack. */
26238 /* Parse the default argument. */
26249 {
26250 /* In a non-template class, check conversions now. In a template,
26251 we'll wait and instantiate these as needed. */
26254 tf_warning_or_error);
26255 else
26257 }
26259 /* If the token stream has not been completely used up, then
26260 there was extra junk after the end of the default
26261 argument. */
26263 {
26266 else
26268 }
26270 /* Revert to the main lexer. */
26274 }
26276 /* FIELD is a non-static data member with an initializer which we saved for
26277 later; parse it now. */
26279 static void
26281 {
26282 tree def;
26289 NULL_TREE);
26295 }
26297 /* FN is a FUNCTION_DECL which may contains a parameter with an
26298 unparsed DEFAULT_ARG. Parse the default args now. This function
26299 assumes that the current scope is the scope in which the default
26300 argument should be processed. */
26302 static void
26304 {
26308 /* While we're parsing the default args, we might (due to the
26309 statement expression extension) encounter more classes. We want
26310 to handle them right away, but we don't want them getting mixed
26311 up with default args that are currently in the queue. */
26314 /* Local variable names (and the `this' keyword) may not appear
26315 in a default argument. */
26326 {
26328 tree parsed_arg;
26330 tree copy;
26337 /* This can happen for a friend declaration for a function
26338 already declared with default arguments. */
26341 parsed_arg
26343 default_arg,
26346 {
26348 }
26352 /* Update any instantiations we've already created. */
26356 }
26360 /* Make sure no default arg is missing. */
26363 /* Restore the state of local_variables_forbidden_p. */
26366 /* Restore the queue. */
26368 }
26370 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
26372 sizeof ... ( identifier )
26374 where the 'sizeof' token has already been consumed. */
26376 static tree
26378 {
26379 /* Consume the `...'. */
26386 else
26394 /* The name is not qualified. */
26413 }
26415 /* Parse the operand of `sizeof' (or a similar operator). Returns
26416 either a TYPE or an expression, depending on the form of the
26417 input. The KEYWORD indicates which kind of expression we have
26418 encountered. */
26420 static tree
26422 {
26429 /* If it's a `...', then we are computing the length of a parameter
26430 pack. */
26435 /* Types cannot be defined in a `sizeof' expression. Save away the
26436 old message. */
26438 /* And create the new one. */
26444 /* The restrictions on constant-expressions do not apply inside
26445 sizeof expressions. */
26446 saved_integral_constant_expression_p
26448 saved_non_integral_constant_expression_p
26452 /* Do not actually evaluate the expression. */
26455 /* If it's a `(', then we might be looking at the type-id
26456 construction. */
26458 {
26461 /* We can't be sure yet whether we're looking at a type-id or an
26462 expression. */
26464 /* Note: as a GNU Extension, compound literals are considered
26465 postfix-expressions as they are in C99, so they are valid
26466 arguments to sizeof. See comment in cp_parser_cast_expression
26467 for details. */
26470 else
26471 {
26474 /* Look for the type-id. */
26476 /* Look for the closing `)'. */
26479 }
26481 /* If all went well, then we're done. */
26483 {
26484 cp_decl_specifier_seq decl_specs;
26486 /* Build a trivial decl-specifier-seq. */
26490 /* Call grokdeclarator to figure out what type this is. */
26493 TYPENAME,
26496 }
26497 }
26499 /* If the type-id production did not work out, then we must be
26500 looking at the unary-expression production. */
26504 /* Go back to evaluating expressions. */
26508 /* Free the message we created. */
26510 /* And restore the old one. */
26512 parser->integral_constant_expression_p
26514 parser->non_integral_constant_expression_p
26518 }
26520 /* If the current declaration has no declarator, return true. */
26522 static bool
26524 {
26525 /* If the next token is a `;' or a `,' then there is no
26526 declarator. */
26529 }
26531 /* Update the DECL_SPECS to reflect the storage class indicated by
26532 KEYWORD. */
26534 static void
26539 {
26540 cp_storage_class storage_class;
26543 {
26547 }
26549 {
26552 }
26557 {
26560 }
26563 {
26581 }
26585 /* A storage class specifier cannot be applied alongside a typedef
26586 specifier. If there is a typedef specifier present then set
26587 conflicting_specifiers_p which will trigger an error later
26588 on in grokdeclarator. */
26591 }
26593 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
26594 is true, the type is a class or enum definition. */
26596 static void
26598 tree type_spec,
26601 {
26604 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
26605 (with, for example, in "typedef int wchar_t;") we remember that
26606 this is what happened. In system headers, we ignore these
26607 declarations so that G++ can work with system headers that are not
26608 C++-safe. */
26610 && !type_definition_p
26620 {
26623 ds_redefined_builtin_type_spec,
26624 token);
26626 {
26630 }
26631 }
26634 else
26635 {
26640 }
26641 }
26643 /* True iff TOKEN is the GNU keyword __thread. */
26645 static bool
26647 {
26650 }
26652 /* Set the location for a declarator specifier and check if it is
26653 duplicated.
26655 DECL_SPECS is the sequence of declarator specifiers onto which to
26656 set the location.
26658 DS is the single declarator specifier to set which location is to
26659 be set onto the existing sequence of declarators.
26661 LOCATION is the location for the declarator specifier to
26662 consider. */
26664 static void
26667 {
26676 {
26680 }
26681 else
26682 {
26684 {
26688 else
26689 {
26692 OPT_Wlong_long,
26694 }
26695 }
26697 {
26702 else
26704 }
26705 else
26706 {
26722 "__complex"
26723 };
26726 }
26727 }
26728 }
26730 /* Return true iff the declarator specifier DS is present in the
26731 sequence of declarator specifiers DECL_SPECS. */
26733 bool
26735 cp_decl_spec ds)
26736 {
26743 }
26745 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
26746 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
26748 static bool
26750 {
26752 }
26754 /* Issue an error message indicating that TOKEN_DESC was expected.
26755 If KEYWORD is true, it indicated this function is called by
26756 cp_parser_require_keword and the required token can only be
26757 a indicated keyword. */
26759 static void
26761 required_token token_desc,
26763 {
26765 {
26834 }
26836 {
26838 {
26917 }
26918 }
26919 else
26921 }
26925 /* If the next token is of the indicated TYPE, consume it. Otherwise,
26926 issue an error message indicating that TOKEN_DESC was expected.
26928 Returns the token consumed, if the token had the appropriate type.
26929 Otherwise, returns NULL. */
26934 required_token token_desc)
26935 {
26938 else
26939 {
26940 /* Output the MESSAGE -- unless we're parsing tentatively. */
26944 }
26945 }
26947 /* An error message is produced if the next token is not '>'.
26948 All further tokens are skipped until the desired token is
26949 found or '{', '}', ';' or an unbalanced ')' or ']'. */
26951 static void
26953 {
26954 /* Current level of '< ... >'. */
26956 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
26959 /* Are we ready, yet? If not, issue error message. */
26963 /* Skip tokens until the desired token is found. */
26965 {
26966 /* Peek at the next token. */
26968 {
26976 /* C++0x views the `>>' operator as two `>' tokens, but
26977 C++98 does not. */
26980 {
26981 /* We've hit a `>>' where the first `>' closes the
26982 template argument list, and the second `>' is
26983 spurious. Just consume the `>>' and stop; we've
26984 already produced at least one error. */
26987 }
26988 /* Fall through for C++0x, so we handle the second `>' in
26989 the `>>'. */
26993 {
26994 /* We've reached the token we want, consume it and stop. */
26997 }
27016 /* The '>' was probably forgotten, don't look further. */
27021 }
27023 /* Consume this token. */
27025 }
27026 }
27028 /* If the next token is the indicated keyword, consume it. Otherwise,
27029 issue an error message indicating that TOKEN_DESC was expected.
27031 Returns the token consumed, if the token had the appropriate type.
27032 Otherwise, returns NULL. */
27037 required_token token_desc)
27038 {
27042 {
27045 }
27048 }
27050 /* Returns TRUE iff TOKEN is a token that can begin the body of a
27051 function-definition. */
27053 static bool
27055 {
27058 /* A ctor-initializer begins with a `:'. */
27060 /* A function-try-block begins with `try'. */
27062 /* A function-transaction-block begins with `__transaction_atomic'
27063 or `__transaction_relaxed'. */
27066 /* The named return value extension begins with `return'. */
27068 }
27070 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
27071 definition. */
27073 static bool
27075 {
27082 }
27084 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
27085 C++0x) ending a template-argument. */
27087 static bool
27089 {
27097 }
27099 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
27100 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
27102 static bool
27105 {
27111 /* Check for the sequence `<::' in the original code. It would be lexed as
27112 `[:', where `[' is a digraph, and there is no whitespace before
27113 `:'. */
27115 {
27120 }
27122 }
27124 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
27125 or none_type otherwise. */
27127 static enum tag_types
27129 {
27131 {
27141 }
27142 }
27144 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
27145 or none_type otherwise or if the token is null. */
27147 static enum tag_types
27149 {
27154 {
27162 }
27163 }
27165 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
27167 static void
27169 {
27173 {
27177 type))
27180 }
27181 }
27183 /* Issue an error message if DECL is redeclared with different
27184 access than its original declaration [class.access.spec/3].
27185 This applies to nested classes and nested class templates.
27186 [class.mem/1]. */
27188 static void
27190 {
27199 }
27201 /* Look for the `template' keyword, as a syntactic disambiguator.
27202 Return TRUE iff it is present, in which case it will be
27203 consumed. */
27205 static bool
27207 {
27209 {
27210 /* In C++98 the `template' keyword can only be used within templates;
27211 outside templates the parser can always figure out what is a
27212 template and what is not. In C++11, per the resolution of DR 468,
27213 `template' is allowed in cases where it is not strictly necessary. */
27216 {
27219 "in C++98 %<template%> (as a disambiguator) is only "
27221 /* If this part of the token stream is rescanned, the same
27222 error message would be generated. So, we purge the token
27223 from the stream. */
27226 }
27227 else
27228 {
27229 /* Consume the `template' keyword. */
27232 }
27233 }
27235 }
27237 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
27238 set PARSER->SCOPE, and perform other related actions. */
27240 static void
27242 {
27245 /* Get the stored value. */
27247 /* Set the scope from the stored value. */
27251 }
27253 /* Consume tokens up through a non-nested END token. Returns TRUE if we
27254 encounter the end of a block before what we were looking for. */
27256 static bool
27260 {
27262 {
27265 /* Abort a parenthesized expression if we encounter a semicolon. */
27269 /* If we've reached the end of the file, stop. */
27275 /* We've hit the end of an enclosing block, so there's been some
27276 kind of syntax error. */
27279 /* Consume the token. */
27281 /* See if it starts a new group. */
27283 {
27285 /* In theory this should probably check end == '}', but
27286 cp_parser_save_member_function_body needs it to exit
27287 after either '}' or ')' when called with ')'. */
27290 }
27292 {
27296 }
27301 }
27302 }
27304 /* Like above, for caching a default argument or NSDMI. Both of these are
27305 terminated by a non-nested comma, but it can be unclear whether or not a
27306 comma is nested in a template argument list unless we do more parsing.
27307 In order to handle this ambiguity, when we encounter a ',' after a '<'
27308 we try to parse what follows as a parameter-declaration-list (in the
27309 case of a default argument) or a member-declarator (in the case of an
27310 NSDMI). If that succeeds, then we stop caching. */
27312 static tree
27314 {
27319 tree default_argument;
27321 /* Add tokens until we have processed the entire default
27322 argument. We add the range [first_token, token). */
27325 {
27326 /* For list-initialization, this is straightforward. */
27329 }
27331 {
27334 /* Peek at the next token. */
27336 /* What we do depends on what token we have. */
27338 {
27339 /* In valid code, a default argument must be
27340 immediately followed by a `,' `)', or `...'. */
27343 {
27344 /* If we've seen a '<', we might be in a
27345 template-argument-list. Until Core issue 325 is
27346 resolved, we don't know how this situation ought
27347 to be handled, so try to DTRT. We check whether
27348 what comes after the comma is a valid parameter
27349 declaration list. If it is, then the comma ends
27350 the default argument; otherwise the default
27351 argument continues. */
27355 /* Set ITALP so cp_parser_parameter_declaration_list
27356 doesn't decide to commit to this parse. */
27363 {
27364 /* Parse declarators until we reach a non-comma or
27365 somthing that cannot be an initializer.
27366 Just checking whether we're looking at a single
27367 declarator is insufficient. Consider:
27368 int var = tuple<T,U>::x;
27369 The template parameter 'U' looks exactly like a
27370 declarator. */
27371 do
27372 {
27383 }
27385 /* If we met an '=' or ';' then the original comma
27386 was the end of the NSDMI. Otherwise assume
27387 we're still in the NSDMI. */
27390 }
27391 else
27392 {
27397 }
27404 }
27407 /* If we run into a non-nested `;', `}', or `]',
27408 then the code is invalid -- but the default
27409 argument is certainly over. */
27414 /* Handle correctly int n = sizeof ... ( p ); */
27417 /* Update DEPTH, if necessary. */
27432 /* This might be the comparison operator, or it might
27433 start a template argument list. */
27440 /* Fall through for C++0x, which treats the `>>'
27441 operator like two `>' tokens in certain
27442 cases. */
27446 {
27447 /* This might be an operator, or it might close a
27448 template argument list. But if a previous '<'
27449 started a template argument list, this will have
27450 closed it, so we can't be in one anymore. */
27454 }
27457 /* If we run out of tokens, issue an error message. */
27466 /* In these cases, we should look for template-ids.
27467 For example, if the default argument is
27468 `X<int, double>()', we need to do name lookup to
27469 figure out whether or not `X' is a template; if
27470 so, the `,' does not end the default argument.
27472 That is not yet done. */
27477 }
27479 /* If we've reached the end, stop. */
27483 /* Add the token to the token block. */
27485 }
27487 /* Create a DEFAULT_ARG to represent the unparsed default
27488 argument. */
27495 }
27497 /* Begin parsing tentatively. We always save tokens while parsing
27498 tentatively so that if the tentative parsing fails we can restore the
27499 tokens. */
27501 static void
27503 {
27504 /* Enter a new parsing context. */
27506 /* Begin saving tokens. */
27508 /* In order to avoid repetitive access control error messages,
27509 access checks are queued up until we are no longer parsing
27510 tentatively. */
27512 }
27514 /* Commit to the currently active tentative parse. */
27516 static void
27518 {
27522 /* Mark all of the levels as committed. */
27525 {
27532 }
27533 }
27535 /* Commit to the topmost currently active tentative parse.
27537 Note that this function shouldn't be called when there are
27538 irreversible side-effects while in a tentative state. For
27539 example, we shouldn't create a permanent entry in the symbol
27540 table, or issue an error message that might not apply if the
27541 tentative parse is aborted. */
27543 static void
27545 {
27550 {
27558 }
27559 }
27561 /* Abort the currently active tentative parse. All consumed tokens
27562 will be rolled back, and no diagnostics will be issued. */
27564 static void
27566 {
27570 /* Now, pretend that we want to see if the construct was
27571 successfully parsed. */
27573 }
27575 /* Stop parsing tentatively. If a parse error has occurred, restore the
27576 token stream. Otherwise, commit to the tokens we have consumed.
27577 Returns true if no error occurred; false otherwise. */
27579 static bool
27581 {
27585 /* Remember whether or not an error occurred, since we are about to
27586 destroy that information. */
27588 /* Remove the topmost context from the stack. */
27591 /* If no parse errors occurred, commit to the tentative parse. */
27593 {
27594 /* Commit to the tokens read tentatively, unless that was
27595 already done. */
27600 }
27601 /* Otherwise, if errors occurred, roll back our state so that things
27602 are just as they were before we began the tentative parse. */
27603 else
27604 {
27607 }
27608 /* Add the context to the front of the free list. */
27613 }
27615 /* Returns true if we are parsing tentatively and are not committed to
27616 this tentative parse. */
27618 static bool
27620 {
27623 }
27625 /* Returns nonzero iff an error has occurred during the most recent
27626 tentative parse. */
27628 static bool
27630 {
27633 }
27635 /* Returns nonzero if GNU extensions are allowed. */
27637 static bool
27639 {
27641 }
27642 \f
27643 /* Objective-C++ Productions */
27646 /* Parse an Objective-C expression, which feeds into a primary-expression
27647 above.
27649 objc-expression:
27650 objc-message-expression
27651 objc-string-literal
27652 objc-encode-expression
27653 objc-protocol-expression
27654 objc-selector-expression
27656 Returns a tree representation of the expression. */
27658 static cp_expr
27660 {
27661 /* Try to figure out what kind of declaration is present. */
27665 {
27675 {
27687 }
27693 }
27696 }
27698 /* Parse an Objective-C message expression.
27700 objc-message-expression:
27701 [ objc-message-receiver objc-message-args ]
27703 Returns a representation of an Objective-C message. */
27705 static tree
27707 {
27719 /* Construct a location e.g.
27720 [self func1:5]
27721 ^~~~~~~~~~~~~~
27722 ranging from the '[' to the ']', with the caret at the start. */
27727 }
27729 /* Parse an objc-message-receiver.
27731 objc-message-receiver:
27732 expression
27733 simple-type-specifier
27735 Returns a representation of the type or expression. */
27737 static tree
27739 {
27740 tree rcv;
27742 /* An Objective-C message receiver may be either (1) a type
27743 or (2) an expression. */
27747 /* If that worked out, fine. */
27754 CP_PARSER_FLAGS_NONE);
27761 }
27763 /* Parse the arguments and selectors comprising an Objective-C message.
27765 objc-message-args:
27766 objc-selector
27767 objc-selector-args
27768 objc-selector-args , objc-comma-args
27770 objc-selector-args:
27771 objc-selector [opt] : assignment-expression
27772 objc-selector-args objc-selector [opt] : assignment-expression
27774 objc-comma-args:
27775 assignment-expression
27776 objc-comma-args , assignment-expression
27778 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
27779 selector arguments and TREE_VALUE containing a list of comma
27780 arguments. */
27782 static tree
27784 {
27790 {
27796 /* Detect if we have a unary selector. */
27805 sel_args
27810 }
27812 /* Handle non-selector arguments, if any. */
27814 {
27815 tree arg;
27820 addl_args
27825 }
27828 {
27831 }
27834 }
27836 /* Parse an Objective-C encode expression.
27838 objc-encode-expression:
27839 @encode objc-typename
27841 Returns an encoded representation of the type argument. */
27843 static cp_expr
27845 {
27846 tree type;
27857 {
27861 }
27863 /* This happens if we find @encode(T) (where T is a template
27864 typename or something dependent on a template typename) when
27865 parsing a template. In that case, we can't compile it
27866 immediately, but we rather create an AT_ENCODE_EXPR which will
27867 need to be instantiated when the template is used.
27868 */
27870 {
27874 }
27877 /* Build a location of the form:
27878 @encode(int)
27879 ^~~~~~~~~~~~
27880 with caret==start at the @ token, finishing at the close paren. */
27881 location_t combined_loc
27886 }
27888 /* Parse an Objective-C @defs expression. */
27890 static tree
27892 {
27893 tree name;
27901 }
27903 /* Parse an Objective-C protocol expression.
27905 objc-protocol-expression:
27906 @protocol ( identifier )
27908 Returns a representation of the protocol expression. */
27910 static tree
27912 {
27913 tree proto;
27921 /* Build a location of the form:
27922 @protocol(prot)
27923 ^~~~~~~~~~~~~~~
27924 with caret==start at the @ token, finishing at the close paren. */
27925 location_t combined_loc
27931 }
27933 /* Parse an Objective-C selector expression.
27935 objc-selector-expression:
27936 @selector ( objc-method-signature )
27938 objc-method-signature:
27939 objc-selector
27940 objc-selector-seq
27942 objc-selector-seq:
27943 objc-selector :
27944 objc-selector-seq objc-selector :
27946 Returns a representation of the method selector. */
27948 static tree
27950 {
27962 {
27971 {
27972 /* Detect if we have a unary selector. */
27974 {
27977 }
27978 else
27979 {
27981 }
27982 }
27987 {
27988 sel_seq
27991 sel_seq
27994 }
27995 else
27996 sel_seq
28001 }
28003 finish_selector:
28007 /* Build a location of the form:
28008 @selector(func)
28009 ^~~~~~~~~~~~~~~
28010 with caret==start at the @ token, finishing at the close paren. */
28011 location_t combined_loc
28015 /* TODO: objc_build_selector_expr doesn't always honor the location. */
28018 }
28020 /* Parse a list of identifiers.
28022 objc-identifier-list:
28023 identifier
28024 objc-identifier-list , identifier
28026 Returns a TREE_LIST of identifier nodes. */
28028 static tree
28030 {
28031 tree identifier;
28032 tree list;
28043 {
28050 identifier));
28052 }
28055 }
28057 /* Parse an Objective-C alias declaration.
28059 objc-alias-declaration:
28060 @compatibility_alias identifier identifier ;
28062 This function registers the alias mapping with the Objective-C front end.
28063 It returns nothing. */
28065 static void
28067 {
28075 }
28077 /* Parse an Objective-C class forward-declaration.
28079 objc-class-declaration:
28080 @class objc-identifier-list ;
28082 The function registers the forward declarations with the Objective-C
28083 front end. It returns nothing. */
28085 static void
28087 {
28090 {
28091 tree id;
28101 else
28103 }
28105 }
28107 /* Parse a list of Objective-C protocol references.
28109 objc-protocol-refs-opt:
28110 objc-protocol-refs [opt]
28112 objc-protocol-refs:
28113 < objc-identifier-list >
28115 Returns a TREE_LIST of identifiers, if any. */
28117 static tree
28119 {
28123 {
28127 }
28130 }
28132 /* Parse a Objective-C visibility specification. */
28134 static void
28136 {
28140 {
28155 }
28157 /* Eat '@private'/'@protected'/'@public'. */
28159 }
28161 /* Parse an Objective-C method type. Return 'true' if it is a class
28162 (+) method, and 'false' if it is an instance (-) method. */
28166 {
28169 else
28171 }
28173 /* Parse an Objective-C protocol qualifier. */
28175 static tree
28177 {
28190 {
28195 }
28198 }
28200 /* Parse an Objective-C typename. */
28202 static tree
28204 {
28208 {
28214 /* An ObjC type name may consist of just protocol qualifiers, in which
28215 case the type shall default to 'id'. */
28217 {
28220 /* If the type could not be parsed, an error has already
28221 been produced. For error recovery, behave as if it had
28222 not been specified, which will use the default type
28223 'id'. */
28225 {
28227 /* We need to skip to the closing parenthesis as
28228 cp_parser_type_id() does not seem to do it for
28229 us. */
28234 }
28235 }
28239 }
28242 }
28244 /* Check to see if TYPE refers to an Objective-C selector name. */
28246 static bool
28248 {
28254 }
28256 /* Parse an Objective-C selector. */
28258 static tree
28260 {
28264 {
28267 }
28269 /* C++ operator names are allowed to appear in ObjC selectors. */
28271 {
28284 }
28285 }
28287 /* Parse an Objective-C params list. */
28289 static tree
28291 {
28297 {
28307 /* Detect if we have a unary selector. */
28310 {
28313 }
28317 {
28318 /* Something went quite wrong. There should be a colon
28319 here, but there is not. Stop parsing parameters. */
28321 }
28323 /* New ObjC allows attributes on parameters too. */
28328 params
28331 type_name,
28332 identifier,
28333 parm_attr));
28336 }
28339 {
28342 }
28344 /* We allow tail attributes for the method. */
28346 {
28354 }
28357 {
28360 }
28362 }
28364 /* Parse the non-keyword Objective-C params. */
28366 static tree
28369 {
28375 {
28377 tree parm;
28383 {
28388 }
28390 /* TODO: parse attributes for tail parameters. */
28399 }
28401 /* We allow tail attributes for the method. */
28403 {
28405 {
28410 }
28411 else
28412 /* We have an error, but parse the attributes, so that we can
28413 carry on. */
28419 }
28422 }
28424 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
28426 static void
28428 {
28431 /* If the next token is `extern' and the following token is a string
28432 literal, then we have a linkage specification. */
28434 && cp_parser_is_pure_string_literal
28437 /* Handle #pragma, if any. */
28440 /* Allow stray semicolons. */
28443 /* Mark methods as optional or required, when building protocols. */
28445 {
28448 }
28450 {
28453 }
28456 /* Other stray characters must generate errors. */
28458 {
28462 }
28463 /* Finally, try to parse a block-declaration, or a function-definition. */
28464 else
28466 }
28468 /* Parse a method signature. */
28470 static tree
28472 {
28488 }
28490 static bool
28492 {
28493 tree tattr;
28498 /* If the attributes are followed by a method introducer, this is not allowed.
28499 Dump the attributes and flag the situation. */
28504 /* Otherwise, the attributes introduce some interstitial code, possibly so
28505 rewind to allow that check. */
28508 }
28510 /* Parse an Objective-C method prototype list. */
28512 static void
28514 {
28518 {
28520 {
28525 else
28529 {
28533 }
28536 }
28542 OPT_Wattributes,
28544 else
28545 /* Allow for interspersed non-ObjC++ code. */
28549 }
28553 else
28557 }
28559 /* Parse an Objective-C method definition list. */
28561 static void
28563 {
28567 {
28568 tree meth;
28571 {
28577 else
28582 {
28586 }
28588 NULL_TREE);
28590 /* For historical reasons, we accept an optional semicolon. */
28597 {
28604 }
28605 }
28606 /* The following case will be removed once @synthesize is
28607 completely implemented. */
28618 else
28619 /* Allow for interspersed non-ObjC++ code. */
28623 }
28627 else
28631 }
28633 /* Parse Objective-C ivars. */
28635 static void
28637 {
28648 {
28649 cp_decl_specifier_seq declspecs;
28651 tree prefix_attributes;
28659 CP_PARSER_FLAGS_OPTIONAL,
28663 /* auto, register, static, extern, mutable. */
28665 {
28668 }
28670 /* thread_local. */
28672 {
28675 }
28677 /* typedef. */
28679 {
28682 }
28687 /* Keep going until we hit the `;' at the end of the
28688 declaration. */
28690 {
28695 /* Check for a (possibly unnamed) bitfield declaration. */
28703 {
28704 /* Get the name of the bitfield. */
28707 sfk_none);
28709 eat_colon:
28711 /* Get the width of the bitfield. */
28712 width
28714 }
28715 else
28716 {
28717 /* Parse the declarator. */
28718 declarator
28724 }
28726 /* Look for attributes that apply to the ivar. */
28728 /* Remember which attributes are prefix attributes and
28729 which are not. */
28731 /* Combine the attributes. */
28735 /* Create the bitfield declaration. */
28737 width,
28738 attributes);
28739 else
28744 /* Add the instance variable. */
28748 /* Reset PREFIX_ATTRIBUTES. */
28757 {
28760 }
28762 }
28766 }
28771 /* Do not consume the RID_AT_END, so it will be read again as terminating
28772 the @interface of @implementation. */
28776 /* For historical reasons, we accept an optional semicolon. */
28779 }
28781 /* Parse an Objective-C protocol declaration. */
28783 static void
28785 {
28791 {
28796 }
28798 /* See if we have a forward declaration or a definition. */
28801 /* Try a forward declaration first. */
28803 {
28805 {
28806 tree id;
28816 else
28818 }
28820 }
28822 /* Ok, we got a full-fledged definition (or at least should). */
28823 else
28824 {
28829 }
28830 }
28832 /* Parse an Objective-C superclass or category. */
28834 static void
28839 {
28845 {
28848 }
28850 {
28853 /* If there is no category name, and this is an @interface, we
28854 have a class extension. */
28856 {
28859 }
28860 else
28864 }
28865 }
28867 /* Parse an Objective-C class interface. */
28869 static void
28871 {
28878 {
28879 /* It's hard to recover because even if valid @interface stuff
28880 is to follow, we can't compile it (or validate it) if we
28881 don't even know which class it refers to. Let's assume this
28882 was a stray '@interface' token in the stream and skip it.
28883 */
28885 }
28890 /* We have either a class or a category on our hands. */
28893 else
28894 {
28896 /* Handle instance variable declarations, if any. */
28899 }
28902 }
28904 /* Parse an Objective-C class implementation. */
28906 static void
28908 {
28915 {
28916 /* It's hard to recover because even if valid @implementation
28917 stuff is to follow, we can't compile it (or validate it) if
28918 we don't even know which class it refers to. Let's assume
28919 this was a stray '@implementation' token in the stream and
28920 skip it.
28921 */
28923 }
28927 /* We have either a class or a category on our hands. */
28930 else
28931 {
28933 /* Handle instance variable declarations, if any. */
28936 }
28939 }
28941 /* Consume the @end token and finish off the implementation. */
28943 static void
28945 {
28948 }
28950 /* Parse an Objective-C declaration. */
28952 static void
28954 {
28955 /* Try to figure out what kind of declaration is present. */
28960 {
28976 }
28979 {
29002 }
29003 }
29005 /* Parse an Objective-C try-catch-finally statement.
29007 objc-try-catch-finally-stmt:
29008 @try compound-statement objc-catch-clause-seq [opt]
29009 objc-finally-clause [opt]
29011 objc-catch-clause-seq:
29012 objc-catch-clause objc-catch-clause-seq [opt]
29014 objc-catch-clause:
29015 @catch ( objc-exception-declaration ) compound-statement
29017 objc-finally-clause:
29018 @finally compound-statement
29020 objc-exception-declaration:
29021 parameter-declaration
29022 '...'
29024 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
29026 Returns NULL_TREE.
29028 PS: This function is identical to c_parser_objc_try_catch_finally_statement
29029 for C. Keep them in sync. */
29031 static tree
29033 {
29034 location_t location;
29035 tree stmt;
29040 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
29041 node, lest it get absorbed into the surrounding block. */
29047 {
29056 {
29057 /* We have "@catch (...)" (where the '...' are literally
29058 what is in the code). Skip the '...'.
29059 parameter_declaration is set to NULL_TREE, and
29060 objc_being_catch_clauses() knows that that means
29061 '...'. */
29064 }
29065 else
29066 {
29067 /* We have "@catch (NSException *exception)" or something
29068 like that. Parse the parameter declaration. */
29072 else
29077 }
29080 else
29081 {
29082 /* If there was no open parenthesis, we are recovering from
29083 an error, and we are trying to figure out what mistake
29084 the user has made. */
29086 /* If there is an immediate closing parenthesis, the user
29087 probably forgot the opening one (ie, they typed "@catch
29088 NSException *e)". Parse the closing parenthesis and keep
29089 going. */
29093 /* If these is no immediate closing parenthesis, the user
29094 probably doesn't know that parenthesis are required at
29095 all (ie, they typed "@catch NSException *e"). So, just
29096 forget about the closing parenthesis and keep going. */
29097 }
29101 }
29103 {
29106 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
29107 node, lest it get absorbed into the surrounding block. */
29111 }
29114 }
29116 /* Parse an Objective-C synchronized statement.
29118 objc-synchronized-stmt:
29119 @synchronized ( expression ) compound-statement
29121 Returns NULL_TREE. */
29123 static tree
29125 {
29126 location_t location;
29137 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
29138 node, lest it get absorbed into the surrounding block. */
29143 }
29145 /* Parse an Objective-C throw statement.
29147 objc-throw-stmt:
29148 @throw assignment-expression [opt] ;
29150 Returns a constructed '@throw' statement. */
29152 static tree
29154 {
29166 }
29168 /* Parse an Objective-C statement. */
29170 static tree
29172 {
29173 /* Try to figure out what kind of declaration is present. */
29177 {
29188 }
29191 }
29193 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
29194 look ahead to see if an objc keyword follows the attributes. This
29195 is to detect the use of prefix attributes on ObjC @interface and
29196 @protocol. */
29198 static bool
29200 {
29205 {
29208 }
29211 }
29213 /* This routine is a minimal replacement for
29214 c_parser_struct_declaration () used when parsing the list of
29215 types/names or ObjC++ properties. For example, when parsing the
29216 code
29218 @property (readonly) int a, b, c;
29220 this function is responsible for parsing "int a, int b, int c" and
29221 returning the declarations as CHAIN of DECLs.
29223 TODO: Share this code with cp_parser_objc_class_ivars. It's very
29224 similar parsing. */
29225 static tree
29227 {
29229 cp_decl_specifier_seq declspecs;
29231 tree prefix_attributes;
29234 CP_PARSER_FLAGS_NONE,
29241 /* auto, register, static, extern, mutable. */
29243 {
29246 }
29248 /* thread_local. */
29250 {
29253 }
29255 /* typedef. */
29257 {
29260 }
29265 /* Keep going until we hit the `;' at the end of the declaration. */
29267 {
29272 /* Parse the declarator. */
29276 /* Look for attributes that apply to the ivar. */
29278 /* Remember which attributes are prefix attributes and
29279 which are not. */
29281 /* Combine the attributes. */
29291 /* Reset PREFIX_ATTRIBUTES. */
29302 {
29305 }
29306 else
29308 }
29310 }
29312 /* Parse an Objective-C @property declaration. The syntax is:
29314 objc-property-declaration:
29315 '@property' objc-property-attributes[opt] struct-declaration ;
29317 objc-property-attributes:
29318 '(' objc-property-attribute-list ')'
29320 objc-property-attribute-list:
29321 objc-property-attribute
29322 objc-property-attribute-list, objc-property-attribute
29324 objc-property-attribute
29325 'getter' = identifier
29326 'setter' = identifier
29327 'readonly'
29328 'readwrite'
29329 'assign'
29330 'retain'
29331 'copy'
29332 'nonatomic'
29334 For example:
29335 @property NSString *name;
29336 @property (readonly) id object;
29337 @property (retain, nonatomic, getter=getTheName) id name;
29338 @property int a, b, c;
29340 PS: This function is identical to
29341 c_parser_objc_at_property_declaration for C. Keep them in sync. */
29342 static void
29344 {
29345 /* The following variables hold the attributes of the properties as
29346 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
29347 seen. When we see an attribute, we set them to 'true' (if they
29348 are boolean properties) or to the identifier (if they have an
29349 argument, ie, for getter and setter). Note that here we only
29350 parse the list of attributes, check the syntax and accumulate the
29351 attributes that we find. objc_add_property_declaration() will
29352 then process the information. */
29362 /* 'properties' is the list of properties that we read. Usually a
29363 single one, but maybe more (eg, in "@property int a, b, c;" there
29364 are three). */
29365 tree properties;
29366 location_t loc;
29372 /* Parse the optional attribute list... */
29374 {
29375 /* Eat the '('. */
29379 {
29385 {
29388 }
29392 {
29403 {
29407 else
29412 }
29415 {
29419 }
29421 {
29423 {
29426 }
29427 else
29431 else
29433 }
29434 else
29435 {
29437 {
29440 }
29441 else
29443 }
29449 }
29456 else
29458 }
29460 /* FIXME: "@property (setter, assign);" will generate a spurious
29461 "error: expected ‘)’ before ‘,’ token". This is because
29462 cp_parser_require, unlike the C counterpart, will produce an
29463 error even if we are in error recovery. */
29465 {
29470 }
29471 }
29473 /* ... and the property declaration(s). */
29477 {
29479 /* If the next token is now a `;', consume it. */
29483 }
29487 else
29488 {
29489 /* Comma-separated properties are chained together in
29490 reverse order; add them one by one. */
29499 }
29502 }
29504 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
29506 objc-synthesize-declaration:
29507 @synthesize objc-synthesize-identifier-list ;
29509 objc-synthesize-identifier-list:
29510 objc-synthesize-identifier
29511 objc-synthesize-identifier-list, objc-synthesize-identifier
29513 objc-synthesize-identifier
29514 identifier
29515 identifier = identifier
29517 For example:
29518 @synthesize MyProperty;
29519 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
29521 PS: This function is identical to c_parser_objc_at_synthesize_declaration
29522 for C. Keep them in sync.
29523 */
29524 static void
29526 {
29528 location_t loc;
29533 {
29537 {
29540 }
29542 {
29546 {
29549 }
29550 }
29551 else
29556 else
29558 }
29561 }
29563 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
29565 objc-dynamic-declaration:
29566 @dynamic identifier-list ;
29568 For example:
29569 @dynamic MyProperty;
29570 @dynamic MyProperty, AnotherProperty;
29572 PS: This function is identical to c_parser_objc_at_dynamic_declaration
29573 for C. Keep them in sync.
29574 */
29575 static void
29577 {
29579 location_t loc;
29584 {
29585 tree property;
29588 {
29591 }
29595 else
29597 }
29600 }
29602 \f
29603 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
29605 /* Returns name of the next clause.
29606 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
29607 the token is not consumed. Otherwise appropriate pragma_omp_clause is
29608 returned and the token is consumed. */
29610 static pragma_omp_clause
29612 {
29628 {
29633 {
29816 }
29817 }
29823 }
29825 /* Validate that a clause of the given type does not already exist. */
29827 static void
29830 {
29831 tree c;
29835 {
29838 }
29839 }
29841 /* OpenMP 2.5:
29842 variable-list:
29843 identifier
29844 variable-list , identifier
29846 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
29847 colon). An opening parenthesis will have been consumed by the caller.
29849 If KIND is nonzero, create the appropriate node and install the decl
29850 in OMP_CLAUSE_DECL and add the node to the head of the list.
29852 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
29853 return the list created.
29855 COLON can be NULL if only closing parenthesis should end the list,
29856 or pointer to bool which will receive false if the list is terminated
29857 by closing parenthesis or true if the list is terminated by colon. */
29859 static tree
29862 {
29866 {
29869 }
29871 {
29876 && current_class_ptr
29878 {
29884 }
29885 else
29886 {
29899 }
29901 ;
29903 {
29905 {
29908 {
29912 }
29913 /* FALLTHROUGH. */
29918 {
29919 location_t loc
29923 decl
29927 }
29928 /* FALLTHROUGH. */
29932 {
29940 parser->colon_corrects_to_scope_p
29944 else
29945 {
29946 /* Look for `:'. */
29950 CPP_CLOSE_SQUARE))
29952 }
29953 /* Look for the closing `]'. */
29955 RT_CLOSE_SQUARE))
29959 {
29962 {
29966 }
29970 {
29974 }
29975 }
29978 }
29982 }
29988 }
29989 else
29992 get_comma:
29996 }
30002 {
30006 }
30009 {
30012 /* Try to resync to an unnested comma. Copied from
30013 cp_parser_parenthesized_expression_list. */
30014 skip_comma:
30023 }
30026 }
30028 /* Similarly, but expect leading and trailing parenthesis. This is a very
30029 common case for omp clauses. */
30031 static tree
30033 {
30037 }
30039 /* OpenACC 2.0:
30040 copy ( variable-list )
30041 copyin ( variable-list )
30042 copyout ( variable-list )
30043 create ( variable-list )
30044 delete ( variable-list )
30045 present ( variable-list )
30046 present_or_copy ( variable-list )
30047 pcopy ( variable-list )
30048 present_or_copyin ( variable-list )
30049 pcopyin ( variable-list )
30050 present_or_copyout ( variable-list )
30051 pcopyout ( variable-list )
30052 present_or_create ( variable-list )
30053 pcreate ( variable-list ) */
30055 static tree
30057 tree list)
30058 {
30061 {
30107 }
30115 }
30117 /* OpenACC 2.0:
30118 deviceptr ( variable-list ) */
30120 static tree
30122 {
30126 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
30127 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
30128 variable-list must only allow for pointer variables. */
30131 {
30138 }
30141 }
30143 /* OpenACC 2.0:
30144 auto
30145 independent
30146 nohost
30147 seq */
30149 static tree
30153 {
30158 }
30160 /* OpenACC:
30161 num_gangs ( expression )
30162 num_workers ( expression )
30163 vector_length ( expression ) */
30165 static tree
30168 {
30178 {
30183 }
30191 }
30193 /* OpenACC:
30195 gang [( gang-arg-list )]
30196 worker [( [num:] int-expr )]
30197 vector [( [length:] int-expr )]
30199 where gang-arg is one of:
30201 [num:] int-expr
30202 static: size-expr
30204 and size-expr may be:
30206 *
30207 int-expr
30208 */
30210 static tree
30213 {
30223 {
30226 do
30227 {
30231 /* Gang static argument. */
30234 {
30242 {
30245 }
30247 /* Check for the '*' argument. */
30251 CPP_CLOSE_PAREN)))
30252 {
30257 {
30260 }
30262 }
30263 }
30264 /* Worker num: argument and vector length: arguments. */
30268 {
30271 }
30273 /* Now collect the actual argument. */
30275 {
30278 }
30290 {
30293 }
30295 }
30300 }
30314 cleanup_error:
30317 }
30319 /* OpenACC 2.0:
30320 tile ( size-expr-list ) */
30322 static tree
30324 {
30333 do
30334 {
30338 {
30341 }
30342 else
30352 }
30355 /* Consume the trailing ')'. */
30363 }
30365 /* OpenACC 2.0
30366 Parse wait clause or directive parameters. */
30368 static tree
30370 {
30380 {
30385 }
30392 {
30396 {
30399 else
30400 {
30407 }
30408 }
30409 }
30412 }
30414 /* OpenACC:
30415 wait ( int-expr-list ) */
30417 static tree
30419 {
30428 }
30430 /* OpenMP 3.0:
30431 collapse ( constant-expression ) */
30433 static tree
30435 {
30437 location_t loc;
30438 HOST_WIDE_INT n;
30458 {
30461 }
30469 }
30471 /* OpenMP 2.5:
30472 default ( shared | none )
30474 OpenACC 2.0
30475 default (none) */
30477 static tree
30480 {
30482 tree c;
30487 {
30492 {
30507 }
30510 }
30511 else
30512 {
30513 invalid_kind:
30516 else
30518 }
30534 }
30536 /* OpenMP 3.1:
30537 final ( expression ) */
30539 static tree
30541 {
30562 }
30564 /* OpenMP 2.5:
30565 if ( expression )
30567 OpenMP 4.5:
30568 if ( directive-name-modifier : expression )
30570 directive-name-modifier:
30571 parallel | task | taskloop | target data | target | target update
30572 | target enter data | target exit data */
30574 static tree
30577 {
30585 {
30597 {
30600 {
30613 else
30614 {
30615 location_t loc
30620 }
30623 {
30625 {
30630 }
30632 {
30633 location_t loc
30637 }
30638 }
30639 }
30640 }
30642 {
30644 {
30647 }
30648 else
30649 {
30651 {
30652 location_t loc
30655 }
30657 }
30658 }
30659 }
30671 {
30674 {
30677 {
30687 }
30689 p);
30691 }
30693 {
30696 else
30699 }
30702 {
30706 }
30707 }
30715 }
30717 /* OpenMP 3.1:
30718 mergeable */
30720 static tree
30723 {
30724 tree c;
30727 location);
30732 }
30734 /* OpenMP 2.5:
30735 nowait */
30737 static tree
30740 {
30741 tree c;
30748 }
30750 /* OpenMP 2.5:
30751 num_threads ( expression ) */
30753 static tree
30755 location_t location)
30756 {
30778 }
30780 /* OpenMP 4.5:
30781 num_tasks ( expression ) */
30783 static tree
30785 location_t location)
30786 {
30808 }
30810 /* OpenMP 4.5:
30811 grainsize ( expression ) */
30813 static tree
30815 location_t location)
30816 {
30838 }
30840 /* OpenMP 4.5:
30841 priority ( expression ) */
30843 static tree
30845 location_t location)
30846 {
30868 }
30870 /* OpenMP 4.5:
30871 hint ( expression ) */
30873 static tree
30875 location_t location)
30876 {
30897 }
30899 /* OpenMP 4.5:
30900 defaultmap ( tofrom : scalar ) */
30902 static tree
30904 location_t location)
30905 {
30913 {
30916 }
30920 {
30923 }
30929 {
30932 }
30936 {
30939 }
30945 location);
30951 out_err:
30956 }
30958 /* OpenMP 2.5:
30959 ordered
30961 OpenMP 4.5:
30962 ordered ( constant-expression ) */
30964 static tree
30967 {
30969 HOST_WIDE_INT n;
30975 {
30992 {
30994 "ordered argument needs positive constant integer "
30997 }
30998 }
31004 }
31006 /* OpenMP 2.5:
31007 reduction ( reduction-operator : variable-list )
31009 reduction-operator:
31010 One of: + * - & ^ | && ||
31012 OpenMP 3.1:
31014 reduction-operator:
31015 One of: + * - & ^ | && || min max
31017 OpenMP 4.0:
31019 reduction-operator:
31020 One of: + * - & ^ | && ||
31021 id-expression */
31023 static tree
31025 {
31033 {
31043 }
31047 else
31048 {
31059 {
31089 }
31090 else
31091 {
31093 resync_fail:
31098 }
31099 }
31105 NULL);
31107 {
31110 }
31113 }
31115 /* OpenMP 2.5:
31116 schedule ( schedule-kind )
31117 schedule ( schedule-kind , expression )
31119 schedule-kind:
31120 static | dynamic | guided | runtime | auto
31122 OpenMP 4.5:
31123 schedule ( schedule-modifier : schedule-kind )
31124 schedule ( schedule-modifier [ , schedule-modifier ] : schedule-kind , expression )
31126 schedule-modifier:
31127 simd
31128 monotonic
31129 nonmonotonic */
31131 static tree
31133 {
31143 {
31152 else
31158 else
31159 {
31162 }
31163 }
31166 {
31171 {
31192 }
31193 }
31198 else
31204 == (OMP_CLAUSE_SCHEDULE_MONOTONIC
31206 {
31210 }
31213 {
31228 else
31233 }
31245 invalid_kind:
31247 resync_fail:
31252 }
31254 /* OpenMP 3.0:
31255 untied */
31257 static tree
31260 {
31261 tree c;
31268 }
31270 /* OpenMP 4.0:
31271 inbranch
31272 notinbranch */
31274 static tree
31277 {
31282 }
31284 /* OpenMP 4.0:
31285 parallel
31286 for
31287 sections
31288 taskgroup */
31290 static tree
31294 {
31298 }
31300 /* OpenMP 4.5:
31301 nogroup */
31303 static tree
31306 {
31311 }
31313 /* OpenMP 4.5:
31314 simd
31315 threads */
31317 static tree
31321 {
31326 }
31328 /* OpenMP 4.0:
31329 num_teams ( expression ) */
31331 static tree
31333 location_t location)
31334 {
31356 }
31358 /* OpenMP 4.0:
31359 thread_limit ( expression ) */
31361 static tree
31363 location_t location)
31364 {
31386 }
31388 /* OpenMP 4.0:
31389 aligned ( variable-list )
31390 aligned ( variable-list : constant-expression ) */
31392 static tree
31394 {
31405 {
31415 }
31421 }
31423 /* OpenMP 4.0:
31424 linear ( variable-list )
31425 linear ( variable-list : expression )
31427 OpenMP 4.5:
31428 linear ( modifier ( variable-list ) )
31429 linear ( modifier ( variable-list ) : expression ) */
31431 static tree
31434 {
31444 {
31456 else
31458 }
31463 else
31464 {
31473 }
31476 {
31481 {
31492 {
31495 }
31498 }
31503 {
31506 }
31514 }
31517 {
31520 }
31523 }
31525 /* OpenMP 4.0:
31526 safelen ( constant-expression ) */
31528 static tree
31530 location_t location)
31531 {
31552 }
31554 /* OpenMP 4.0:
31555 simdlen ( constant-expression ) */
31557 static tree
31559 location_t location)
31560 {
31581 }
31583 /* OpenMP 4.5:
31584 vec:
31585 identifier [+/- integer]
31586 vec , identifier [+/- integer]
31587 */
31589 static tree
31591 tree list)
31592 {
31596 {
31599 }
31602 {
31609 else
31610 {
31611 t = cp_parser_lookup_name_simple
31616 id_loc);
31617 }
31623 {
31626 }
31630 {
31633 }
31637 {
31640 }
31643 add_to_vector:
31645 {
31649 }
31655 }
31658 {
31664 }
31666 }
31668 /* OpenMP 4.0:
31669 depend ( depend-kind : variable-list )
31671 depend-kind:
31672 in | out | inout
31674 OpenMP 4.5:
31675 depend ( source )
31677 depend ( sink : vec ) */
31679 static tree
31681 {
31689 {
31703 else
31705 }
31706 else
31712 {
31722 }
31729 else
31730 {
31736 }
31739 invalid_kind:
31741 resync_fail:
31746 }
31748 /* OpenMP 4.0:
31749 map ( map-kind : variable-list )
31750 map ( variable-list )
31752 map-kind:
31753 alloc | to | from | tofrom
31755 OpenMP 4.5:
31756 map-kind:
31757 alloc | to | from | tofrom | release | delete
31759 map ( always [,] map-kind: variable-list ) */
31761 static tree
31763 {
31772 {
31777 {
31780 nth++;
31786 {
31791 }
31792 }
31793 }
31797 {
31811 else
31812 {
31818 }
31821 }
31824 {
31828 }
31831 NULL);
31837 }
31839 /* OpenMP 4.0:
31840 device ( expression ) */
31842 static tree
31844 location_t location)
31845 {
31867 }
31869 /* OpenMP 4.0:
31870 dist_schedule ( static )
31871 dist_schedule ( static , expression ) */
31873 static tree
31875 location_t location)
31876 {
31889 {
31900 }
31905 location);
31909 invalid_kind:
31911 resync_fail:
31916 }
31918 /* OpenMP 4.0:
31919 proc_bind ( proc-bind-kind )
31921 proc-bind-kind:
31922 master | close | spread */
31924 static tree
31926 location_t location)
31927 {
31928 tree c;
31935 {
31945 else
31947 }
31948 else
31957 location);
31962 invalid_kind:
31964 resync_fail:
31969 }
31971 /* OpenACC:
31972 async [( int-expr )] */
31974 static tree
31976 {
31983 {
31992 }
32002 }
32004 /* Parse all OpenACC clauses. The set clauses allowed by the directive
32005 is a bitmask in MASK. Return the list of clauses found. */
32007 static tree
32011 {
32016 {
32017 location_t here;
32018 pragma_omp_clause c_kind;
32019 omp_clause_code code;
32030 {
32082 clauses);
32100 OMP_CLAUSE_INDEPENDENT,
32112 clauses);
32118 clauses);
32142 clauses);
32164 clauses);
32176 clauses);
32190 }
32195 {
32196 /* Remove the invalid clause(s) from the list to avoid
32197 confusing the rest of the compiler. */
32200 }
32201 }
32203 saw_error:
32210 }
32212 /* Parse all OpenMP clauses. The set clauses allowed by the directive
32213 is a bitmask in MASK. Return the list of clauses found; the result
32214 of clause default goes in *pdefault. */
32216 static tree
32220 {
32226 {
32227 pragma_omp_clause c_kind;
32238 {
32250 clauses);
32264 clauses);
32284 clauses);
32289 clauses);
32299 clauses);
32333 clauses);
32347 clauses);
32364 OMP_CLAUSE_NOTINBRANCH,
32373 {
32374 clause_not_first:
32378 }
32408 clauses);
32409 else
32419 clauses);
32437 {
32445 }
32488 clauses
32494 clauses
32506 }
32511 {
32512 /* Remove the invalid clause(s) from the list to avoid
32513 confusing the rest of the compiler. */
32516 }
32517 }
32518 saw_error:
32519 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
32520 no reason to skip to the end. */
32524 {
32527 else
32529 }
32531 }
32533 /* OpenMP 2.5:
32534 structured-block:
32535 statement
32537 In practice, we're also interested in adding the statement to an
32538 outer node. So it is convenient if we work around the fact that
32539 cp_parser_statement calls add_stmt. */
32541 static unsigned
32543 {
32546 /* Only move the values to IN_OMP_BLOCK if they weren't false.
32547 This preserves the "not within loop or switch" style error messages
32548 for nonsense cases like
32549 void foo() {
32550 #pragma omp single
32551 break;
32552 }
32553 */
32558 }
32560 static void
32562 {
32564 }
32566 static tree
32568 {
32576 }
32578 /* OpenMP 2.5:
32579 # pragma omp atomic new-line
32580 expression-stmt
32582 expression-stmt:
32583 x binop= expr | x++ | ++x | x-- | --x
32584 binop:
32585 +, *, -, /, &, ^, |, <<, >>
32587 where x is an lvalue expression with scalar type.
32589 OpenMP 3.1:
32590 # pragma omp atomic new-line
32591 update-stmt
32593 # pragma omp atomic read new-line
32594 read-stmt
32596 # pragma omp atomic write new-line
32597 write-stmt
32599 # pragma omp atomic update new-line
32600 update-stmt
32602 # pragma omp atomic capture new-line
32603 capture-stmt
32605 # pragma omp atomic capture new-line
32606 capture-block
32608 read-stmt:
32609 v = x
32610 write-stmt:
32611 x = expr
32612 update-stmt:
32613 expression-stmt | x = x binop expr
32614 capture-stmt:
32615 v = expression-stmt
32616 capture-block:
32617 { v = x; update-stmt; } | { update-stmt; v = x; }
32619 OpenMP 4.0:
32620 update-stmt:
32621 expression-stmt | x = x binop expr | x = expr binop x
32622 capture-stmt:
32623 v = update-stmt
32624 capture-block:
32625 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
32627 where x and v are lvalue expressions with scalar type. */
32629 static void
32631 {
32639 {
32644 {
32650 }
32651 }
32653 {
32665 else
32669 }
32671 {
32677 {
32682 {
32685 }
32686 }
32687 }
32691 {
32701 else
32706 {
32707 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
32708 opcode. */
32713 }
32717 {
32720 }
32721 else
32722 {
32728 }
32731 }
32733 restart:
32737 {
32744 /* FALLTHROUGH */
32754 /* FALLTHROUGH */
32769 /* Undo effects of boolean_increment for post {in,de}crement. */
32771 /* FALLTHRU */
32775 {
32776 /* Undo effects of boolean_increment. */
32778 {
32779 /* This is pre or post increment. */
32784 && !structured_block
32788 }
32789 }
32790 /* FALLTHRU */
32793 {
32828 {
32832 }
32835 {
32841 {
32846 }
32848 {
32860 {
32862 {
32867 }
32868 else
32870 }
32874 }
32877 {
32884 }
32888 }
32892 {
32895 {
32903 }
32905 {
32910 }
32945 }
32956 /* FALLTHROUGH */
32961 }
32968 }
32969 stmt_done:
32971 {
32982 }
32984 {
32987 }
32988 done:
32994 saw_error:
32997 {
33001 {
33005 }
33006 }
33007 }
33010 /* OpenMP 2.5:
33011 # pragma omp barrier new-line */
33013 static void
33015 {
33018 }
33020 /* OpenMP 2.5:
33021 # pragma omp critical [(name)] new-line
33022 structured-block
33024 OpenMP 4.5:
33025 # pragma omp critical [(name) [hint(expression)]] new-line
33026 structured-block */
33028 #define OMP_CRITICAL_CLAUSE_MASK \
33029 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_HINT) )
33031 static tree
33033 {
33037 {
33051 OMP_CRITICAL_CLAUSE_MASK,
33053 }
33054 else
33059 }
33061 /* OpenMP 2.5:
33062 # pragma omp flush flush-vars[opt] new-line
33064 flush-vars:
33065 ( variable-list ) */
33067 static void
33069 {
33075 }
33077 /* Helper function, to parse omp for increment expression. */
33079 static tree
33081 {
33086 {
33089 }
33092 {
33101 /* Fall through: OpenMP disallows NE_EXPR. */
33104 }
33106 /* If decl is an iterator, preserve LHS and RHS of the relational
33107 expr until finish_omp_for. */
33118 }
33120 /* Helper function, to parse omp for increment expression. */
33122 static tree
33124 {
33128 cp_id_kind idk;
33132 {
33141 }
33150 {
33155 }
33162 {
33166 }
33179 do
33180 {
33187 {
33189 {
33192 else
33194 tf_warning_or_error);
33195 }
33196 else
33199 }
33200 }
33204 {
33210 }
33211 else
33215 }
33217 /* Parse the initialization statement of either an OpenMP for loop or
33218 a Cilk Plus for loop.
33220 Return true if the resulting construct should have an
33221 OMP_CLAUSE_PRIVATE added to it. */
33223 static tree
33232 {
33238 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
33240 init-expr:
33241 var = lb
33242 integer-type var = lb
33243 random-access-iterator-type var = lb
33244 pointer-type var = lb
33245 */
33246 cp_decl_specifier_seq type_specifiers;
33248 /* First, try to parse as an initialized declaration. See
33249 cp_parser_condition, from whence the bulk of this is copied. */
33256 {
33257 /* If parsing a type specifier seq succeeded, then this
33258 MUST be a initialized declaration. */
33263 CP_PARSER_DECLARATOR_NAMED,
33274 else
33275 {
33285 {
33287 CPP_OPEN_PAREN))
33288 {
33292 else
33295 }
33296 else
33297 /* Trigger an error. */
33302 }
33306 {
33314 {
33317 auto_node);
33322 }
33325 asm_specification,
33326 LOOKUP_ONLYCONVERTING);
33329 {
33332 }
33333 else
33336 }
33337 else
33338 {
33339 /* Consume '='. */
33343 non_class:
33346 else
33349 asm_specification,
33350 LOOKUP_ONLYCONVERTING);
33351 }
33355 }
33356 }
33357 else
33358 {
33359 cp_id_kind idk;
33360 /* If parsing a type specifier sequence failed, then
33361 this MUST be a simple expression. */
33370 && decl
33373 {
33384 {
33389 }
33394 }
33396 && decl
33399 {
33400 tree rhs;
33408 rhs,
33409 tf_warning_or_error));
33412 }
33413 else
33414 {
33419 {
33423 }
33424 }
33425 }
33427 }
33429 /* Parse the restricted form of the for statement allowed by OpenMP. */
33431 static tree
33434 {
33438 location_t loc_first;
33449 {
33452 }
33455 {
33461 }
33463 {
33466 {
33468 "%<linear%> clause may not be specified together "
33471 }
33472 else
33474 }
33487 {
33490 location_t loc;
33494 {
33497 }
33500 {
33503 }
33512 add_private_clause
33519 {
33522 {
33528 }
33529 else
33531 }
33538 {
33543 {
33547 }
33550 {
33551 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
33555 {
33558 }
33559 else
33560 {
33563 }
33565 }
33566 else
33567 {
33572 }
33573 }
33576 {
33577 tree c;
33579 {
33588 decl);
33592 decl);
33593 }
33595 {
33600 else
33605 {
33608 /* For linear, signal that we need to fill up
33609 the so far unknown linear step. */
33612 }
33613 }
33614 }
33623 {
33624 /* If decl is an iterator, preserve the operator on decl
33625 until finish_omp_for. */
33627 && ((processing_template_decl
33632 else
33636 }
33648 {
33651 }
33656 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
33657 in between the collapsed for loops to be still considered perfectly
33658 nested. Hopefully the final version clarifies this.
33659 For now handle (multiple) {'s and empty statements. */
33661 do
33662 {
33666 {
33668 bracecount++;
33669 }
33673 else
33674 {
33681 }
33682 }
33686 {
33689 }
33690 }
33692 /* Note that we saved the original contents of this flag when we entered
33693 the structured block, and so we don't need to re-save it here. */
33696 else
33699 /* Note that the grammar doesn't call for a structured block here,
33700 though the loop as a whole is a structured block. */
33707 else
33712 {
33714 {
33716 nbraces--;
33717 }
33720 else
33721 {
33723 {
33726 }
33731 }
33732 }
33739 }
33741 /* Helper function for OpenMP parsing, split clauses and call
33742 finish_omp_clauses on each of the set of clauses afterwards. */
33744 static void
33747 {
33753 }
33755 /* OpenMP 4.0:
33756 #pragma omp simd simd-clause[optseq] new-line
33757 for-loop */
33759 #define OMP_SIMD_CLAUSE_MASK \
33760 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
33761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
33762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
33764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33765 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33766 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33767 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33769 static tree
33772 {
33783 {
33787 OMP_CLAUSE_ORDERED);
33789 {
33791 "%<ordered%> clause with parameter may not be specified "
33794 }
33795 }
33806 }
33808 /* OpenMP 2.5:
33809 #pragma omp for for-clause[optseq] new-line
33810 for-loop
33812 OpenMP 4.0:
33813 #pragma omp for simd for-simd-clause[optseq] new-line
33814 for-loop */
33816 #define OMP_FOR_CLAUSE_MASK \
33817 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
33818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
33819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
33820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
33821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
33822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
33823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
33824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
33825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
33827 static tree
33830 {
33839 /* Composite distribute parallel for{, simd} disallows ordered clause. */
33844 {
33849 {
33857 cclauses);
33861 cclauses);
33873 }
33874 }
33876 {
33879 }
33881 /* Composite distribute parallel for disallows linear clause. */
33888 {
33891 }
33902 }
33904 /* OpenMP 2.5:
33905 # pragma omp master new-line
33906 structured-block */
33908 static tree
33910 {
33914 }
33916 /* OpenMP 2.5:
33917 # pragma omp ordered new-line
33918 structured-block
33920 OpenMP 4.5:
33921 # pragma omp ordered ordered-clauses new-line
33922 structured-block */
33924 #define OMP_ORDERED_CLAUSE_MASK \
33925 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREADS) \
33926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMD))
33928 #define OMP_ORDERED_DEPEND_CLAUSE_MASK \
33929 (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND)
33931 static bool
33934 {
33938 {
33942 }
33945 {
33950 {
33952 {
33954 "%<depend%> clause may only be used in compound "
33958 }
33959 tree clauses
33961 OMP_ORDERED_DEPEND_CLAUSE_MASK,
33965 }
33966 }
33968 tree clauses
33974 }
33976 /* OpenMP 2.5:
33978 section-scope:
33979 { section-sequence }
33981 section-sequence:
33982 section-directive[opt] structured-block
33983 section-sequence section-directive structured-block */
33985 static tree
33987 {
33999 {
34003 }
34006 {
34014 {
34018 }
34020 {
34023 }
34028 }
34039 }
34041 /* OpenMP 2.5:
34042 # pragma omp sections sections-clause[optseq] newline
34043 sections-scope */
34045 #define OMP_SECTIONS_CLAUSE_MASK \
34046 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34052 static tree
34055 {
34067 {
34070 }
34077 }
34079 /* OpenMP 2.5:
34080 # pragma omp parallel parallel-clause[optseq] new-line
34081 structured-block
34082 # pragma omp parallel for parallel-for-clause[optseq] new-line
34083 structured-block
34084 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
34085 structured-block
34087 OpenMP 4.0:
34088 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
34089 structured-block */
34091 #define OMP_PARALLEL_CLAUSE_MASK \
34092 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
34098 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34099 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
34100 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
34102 static tree
34105 {
34112 /* #pragma omp target parallel{, for, for simd} disallow copyin clause. */
34118 {
34131 block);
34136 }
34137 /* When combined with distribute, parallel has to be followed by for.
34138 #pragma omp target parallel is allowed though. */
34142 {
34146 }
34148 {
34151 }
34153 {
34157 {
34167 block);
34170 }
34171 }
34175 {
34178 }
34186 }
34188 /* OpenMP 2.5:
34189 # pragma omp single single-clause[optseq] new-line
34190 structured-block */
34192 #define OMP_SINGLE_CLAUSE_MASK \
34193 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34194 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34195 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
34196 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34198 static tree
34200 {
34210 }
34212 /* OpenMP 3.0:
34213 # pragma omp task task-clause[optseq] new-line
34214 structured-block */
34216 #define OMP_TASK_CLAUSE_MASK \
34217 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34218 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
34219 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
34220 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34221 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34222 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34223 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
34224 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
34225 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34226 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
34228 static tree
34230 {
34241 }
34243 /* OpenMP 3.0:
34244 # pragma omp taskwait new-line */
34246 static void
34248 {
34251 }
34253 /* OpenMP 3.1:
34254 # pragma omp taskyield new-line */
34256 static void
34258 {
34261 }
34263 /* OpenMP 4.0:
34264 # pragma omp taskgroup new-line
34265 structured-block */
34267 static tree
34269 {
34273 }
34276 /* OpenMP 2.5:
34277 # pragma omp threadprivate (variable-list) */
34279 static void
34281 {
34282 tree vars;
34288 }
34290 /* OpenMP 4.0:
34291 # pragma omp cancel cancel-clause[optseq] new-line */
34293 #define OMP_CANCEL_CLAUSE_MASK \
34294 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
34298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
34300 static void
34302 {
34306 }
34308 /* OpenMP 4.0:
34309 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
34311 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
34312 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
34313 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
34314 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
34315 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
34317 static void
34319 {
34320 tree clauses;
34324 {
34329 {
34332 }
34333 }
34335 {
34339 }
34342 OMP_CANCELLATION_POINT_CLAUSE_MASK,
34344 pragma_tok);
34346 }
34348 /* OpenMP 4.0:
34349 #pragma omp distribute distribute-clause[optseq] new-line
34350 for-loop */
34352 #define OMP_DISTRIBUTE_CLAUSE_MASK \
34353 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34354 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34355 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
34356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
34357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
34359 static tree
34362 {
34371 {
34379 else
34382 {
34388 {
34391 cclauses);
34392 else
34394 cclauses);
34395 }
34400 cclauses);
34401 else
34403 cclauses);
34415 }
34416 }
34418 {
34421 }
34426 {
34429 }
34440 }
34442 /* OpenMP 4.0:
34443 # pragma omp teams teams-clause[optseq] new-line
34444 structured-block */
34446 #define OMP_TEAMS_CLAUSE_MASK \
34447 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34448 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34449 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
34450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
34451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
34452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
34453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
34455 static tree
34458 {
34467 {
34471 {
34479 cclauses);
34483 cclauses);
34495 }
34496 }
34498 {
34501 }
34506 {
34509 }
34517 }
34519 /* OpenMP 4.0:
34520 # pragma omp target data target-data-clause[optseq] new-line
34521 structured-block */
34523 #define OMP_TARGET_DATA_CLAUSE_MASK \
34524 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_USE_DEVICE_PTR))
34529 static tree
34531 {
34532 tree clauses
34537 {
34540 {
34557 "%<#pragma omp target data%> with map-type other "
34558 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
34562 }
34564 }
34567 {
34570 "%<#pragma omp target data%> must contain at least "
34573 }
34584 }
34586 /* OpenMP 4.5:
34587 # pragma omp target enter data target-enter-data-clause[optseq] new-line
34588 structured-block */
34590 #define OMP_TARGET_ENTER_DATA_CLAUSE_MASK \
34591 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34594 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34595 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34597 static tree
34600 {
34603 {
34608 {
34611 }
34612 }
34614 {
34618 }
34621 {
34623 "%<#pragma omp target enter data%> may only be "
34627 }
34629 tree clauses
34634 {
34637 {
34650 "%<#pragma omp target enter data%> with map-type other "
34654 }
34656 }
34659 {
34662 "%<#pragma omp target enter data%> must contain at least "
34665 }
34672 }
34674 /* OpenMP 4.5:
34675 # pragma omp target exit data target-enter-data-clause[optseq] new-line
34676 structured-block */
34678 #define OMP_TARGET_EXIT_DATA_CLAUSE_MASK \
34679 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34681 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34685 static tree
34688 {
34691 {
34696 {
34699 }
34700 }
34702 {
34706 }
34709 {
34711 "%<#pragma omp target exit data%> may only be "
34715 }
34717 tree clauses
34722 {
34725 {
34739 "%<#pragma omp target exit data%> with map-type other "
34740 "than %<from%>, %<release%> or %<delete%> on %<map%>"
34744 }
34746 }
34749 {
34752 "%<#pragma omp target exit data%> must contain at least "
34755 }
34762 }
34764 /* OpenMP 4.0:
34765 # pragma omp target update target-update-clause[optseq] new-line */
34767 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
34768 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
34769 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
34770 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34771 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34772 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34773 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
34775 static bool
34778 {
34780 {
34782 "%<#pragma omp target update%> may only be "
34786 }
34788 tree clauses
34793 {
34795 "%<#pragma omp target update%> must contain at least one "
34798 }
34806 }
34808 /* OpenMP 4.0:
34809 # pragma omp target target-clause[optseq] new-line
34810 structured-block */
34812 #define OMP_TARGET_CLAUSE_MASK \
34813 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
34814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
34815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
34816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND) \
34817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
34818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
34819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
34820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULTMAP) \
34821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IS_DEVICE_PTR))
34823 static bool
34826 {
34830 {
34834 }
34837 {
34849 {
34857 {
34858 tree stmt;
34860 {
34863 OMP_TARGET_CLAUSE_MASK,
34864 cclauses);
34868 OMP_TARGET_CLAUSE_MASK,
34869 cclauses);
34873 OMP_TARGET_CLAUSE_MASK,
34874 cclauses);
34878 }
34880 }
34885 {
34900 }
34906 {
34907 /* For combined target teams, ensure the num_teams and
34908 thread_limit clause expressions are evaluated on the host,
34909 before entering the target construct. */
34910 tree c;
34916 {
34925 OMP_CLAUSE_FIRSTPRIVATE);
34930 }
34931 }
34940 }
34942 {
34945 }
34947 {
34951 }
34953 {
34957 }
34959 {
34963 }
34965 {
34968 }
34969 }
34984 check_clauses:
34986 {
34989 {
35003 "%<#pragma omp target%> with map-type other "
35004 "than %<to%>, %<from%>, %<tofrom%> or %<alloc%> "
35008 }
35010 }
35012 }
35014 /* OpenACC 2.0:
35015 # pragma acc cache (variable-list) new-line
35016 */
35018 static tree
35020 {
35035 }
35037 /* OpenACC 2.0:
35038 # pragma acc data oacc-data-clause[optseq] new-line
35039 structured-block */
35041 #define OACC_DATA_CLAUSE_MASK \
35042 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35054 static tree
35056 {
35069 }
35071 /* OpenACC 2.0:
35072 # pragma acc host_data <clauses> new-line
35073 structured-block */
35075 #define OACC_HOST_DATA_CLAUSE_MASK \
35076 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_USE_DEVICE) )
35078 static tree
35080 {
35093 }
35095 /* OpenACC 2.0:
35096 # pragma acc declare oacc-data-clause[optseq] new-line
35097 */
35099 #define OACC_DECLARE_CLAUSE_MASK \
35100 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35101 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35102 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35103 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35104 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35105 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE_RESIDENT) \
35106 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_LINK) \
35107 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35108 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35109 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35110 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35111 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
35113 static tree
35115 {
35124 {
35128 }
35131 {
35135 {
35139 }
35142 {
35150 /* Generated by c_finish_omp_clauses from array sections;
35151 avoid spurious diagnostics. */
35158 {
35160 "%qD must be a global variable in"
35162 decl);
35165 }
35170 {
35174 }
35176 {
35178 "invalid use of %<extern%> variable %qD "
35182 }
35184 {
35186 "invalid use of %<global%> variable %qD "
35190 }
35192 }
35197 {
35202 }
35205 {
35206 tree id;
35210 else
35216 {
35219 {
35222 {
35226 }
35227 }
35228 }
35229 }
35230 }
35243 }
35245 /* OpenACC 2.0:
35246 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
35248 or
35250 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
35252 LOC is the location of the #pragma token.
35253 */
35255 #define OACC_ENTER_DATA_CLAUSE_MASK \
35256 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35259 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35260 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35261 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35264 #define OACC_EXIT_DATA_CLAUSE_MASK \
35265 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
35269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35271 static tree
35274 {
35279 {
35285 }
35290 {
35294 }
35301 else
35306 {
35310 }
35318 }
35320 /* OpenACC 2.0:
35321 # pragma acc loop oacc-loop-clause[optseq] new-line
35322 structured-block */
35324 #define OACC_LOOP_CLAUSE_MASK \
35325 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
35326 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35327 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35328 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
35329 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
35330 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
35331 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_AUTO) \
35332 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_INDEPENDENT) \
35333 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ) \
35334 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_TILE))
35336 static tree
35339 {
35346 {
35352 }
35361 }
35363 /* OpenACC 2.0:
35364 # pragma acc kernels oacc-kernels-clause[optseq] new-line
35365 structured-block
35367 or
35369 # pragma acc parallel oacc-parallel-clause[optseq] new-line
35370 structured-block
35371 */
35373 #define OACC_KERNELS_CLAUSE_MASK \
35374 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35382 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35383 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35384 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35385 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35386 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35389 #define OACC_PARALLEL_CLAUSE_MASK \
35390 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
35392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
35393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
35394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
35395 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEFAULT) \
35396 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
35397 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_FIRSTPRIVATE) \
35398 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35399 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
35400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
35401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
35402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
35403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
35404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
35405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
35406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRIVATE) \
35407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
35408 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
35409 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
35411 static tree
35414 {
35415 omp_clause_mask mask;
35418 {
35431 }
35434 {
35438 {
35443 tree clauses;
35446 }
35447 }
35456 }
35458 /* OpenACC 2.0:
35459 # pragma acc update oacc-update-clause[optseq] new-line
35460 */
35462 #define OACC_UPDATE_CLAUSE_MASK \
35463 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
35464 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
35465 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
35466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
35467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
35468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
35470 static tree
35472 {
35479 {
35481 "%<#pragma acc update%> must contain at least one "
35484 }
35492 }
35494 /* OpenACC 2.0:
35495 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
35497 LOC is the location of the #pragma token.
35498 */
35500 #define OACC_WAIT_CLAUSE_MASK \
35501 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
35503 static tree
35505 {
35519 }
35521 /* OpenMP 4.0:
35522 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
35524 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
35525 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
35526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
35527 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
35528 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
35529 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
35530 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
35532 static void
35535 {
35537 cp_omp_declare_simd_data data;
35539 {
35544 }
35555 {
35559 {
35572 }
35577 "%<#pragma omp declare simd%> not immediately followed by "
35581 }
35582 }
35584 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
35585 This function is modelled similar to the late parsing of omp declare
35586 simd. */
35588 static tree
35590 {
35597 {
35599 "used in the same function marked as a Cilk Plus SIMD-enabled "
35605 }
35607 {
35611 }
35616 {
35623 NULL);
35637 }
35643 }
35645 /* Finalize #pragma omp declare simd clauses after direct declarator has
35646 been parsed, and put that into "omp declare simd" attribute. */
35648 static tree
35650 {
35656 {
35661 }
35666 {
35684 }
35688 }
35691 /* OpenMP 4.0:
35692 # pragma omp declare target new-line
35693 declarations and definitions
35694 # pragma omp end declare target new-line
35696 OpenMP 4.5:
35697 # pragma omp declare target ( extended-list ) new-line
35699 # pragma omp declare target declare-target-clauses[seq] new-line */
35701 #define OMP_DECLARE_TARGET_CLAUSE_MASK \
35702 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
35703 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINK))
35705 static void
35707 {
35710 clauses
35714 {
35716 clauses);
35719 }
35720 else
35721 {
35725 }
35728 "%<#pragma omp declare target%> with clauses in between "
35729 "%<#pragma omp declare target%> without clauses and "
35732 {
35738 {
35741 }
35742 else
35745 {
35747 "%qD specified both in declare target %<link%> and %<to%>"
35750 }
35752 {
35756 {
35759 {
35763 }
35764 }
35765 }
35766 }
35767 }
35769 static void
35771 {
35774 {
35777 }
35779 {
35783 {
35786 }
35789 else
35790 {
35794 }
35795 }
35796 else
35797 {
35801 }
35805 "%<#pragma omp end declare target%> without corresponding "
35807 else
35809 }
35811 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
35812 expression and optional initializer clause of
35813 #pragma omp declare reduction. We store the expression(s) as
35814 either 3, 6 or 7 special statements inside of the artificial function's
35815 body. The first two statements are DECL_EXPRs for the artificial
35816 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
35817 expression that uses those variables.
35818 If there was any INITIALIZER clause, this is followed by further statements,
35819 the fourth and fifth statements are DECL_EXPRs for the artificial
35820 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
35821 constructor variant (first token after open paren is not omp_priv),
35822 then the sixth statement is a statement with the function call expression
35823 that uses the OMP_PRIV and optionally OMP_ORIG variable.
35824 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
35825 to initialize the OMP_PRIV artificial variable and there is seventh
35826 statement, a DECL_EXPR of the OMP_PRIV statement again. */
35828 static bool
35830 {
35842 tree combiner;
35857 {
35860 }
35863 {
35870 {
35873 }
35889 {
35893 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
35897 == CPP_CLOSE_PAREN
35900 {
35904 }
35909 }
35910 else
35911 {
35927 {
35932 }
35934 tree arg;
35947 }
35958 }
35964 }
35966 /* OpenMP 4.0
35967 #pragma omp declare reduction (reduction-id : typename-list : expression) \
35968 initializer-clause[opt] new-line
35970 initializer-clause:
35971 initializer (omp_priv initializer)
35972 initializer (function-name (argument-list)) */
35974 static void
35977 {
35987 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
35994 {
36026 }
36038 /* Types may not be defined in declare reduction type list. */
36041 parser->type_definition_forbidden_message
36047 saved_colon_doesnt_start_class_def_p
36052 {
36056 ;
36077 else
36082 else
36084 }
36086 /* Restore the saved message. */
36089 parser->colon_doesnt_start_class_def_p
36094 {
36095 fail:
36098 }
36104 {
36105 tree fntype
36108 NULL_TREE);
36128 {
36133 }
36135 {
36137 {
36146 }
36153 }
36154 else
36155 {
36158 }
36161 else
36164 {
36167 }
36169 {
36172 else
36177 }
36182 else
36183 {
36192 }
36199 }
36203 done:
36204 /* Free any declarators allocated. */
36206 }
36208 /* OpenMP 4.0
36209 #pragma omp declare simd declare-simd-clauses[optseq] new-line
36210 #pragma omp declare reduction (reduction-id : typename-list : expression) \
36211 initializer-clause[opt] new-line
36212 #pragma omp declare target new-line */
36214 static void
36217 {
36219 {
36224 {
36227 context);
36229 }
36232 {
36235 context);
36237 }
36239 {
36242 }
36244 {
36248 }
36249 }
36253 }
36255 /* OpenMP 4.5:
36256 #pragma omp taskloop taskloop-clause[optseq] new-line
36257 for-loop
36259 #pragma omp taskloop simd taskloop-simd-clause[optseq] new-line
36260 for-loop */
36262 #define OMP_TASKLOOP_CLAUSE_MASK \
36263 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
36264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
36265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
36266 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
36267 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
36268 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_GRAINSIZE) \
36269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TASKS) \
36270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE) \
36271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
36272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
36273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
36274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
36275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOGROUP) \
36276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIORITY))
36278 static tree
36281 {
36290 {
36295 {
36303 cclauses);
36307 cclauses);
36319 }
36320 }
36322 {
36325 }
36330 {
36333 }
36344 }
36347 /* OpenACC 2.0:
36348 # pragma acc routine oacc-routine-clause[optseq] new-line
36349 function-definition
36351 # pragma acc routine ( name ) oacc-routine-clause[optseq] new-line
36352 */
36354 #define OACC_ROUTINE_CLAUSE_MASK \
36355 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_GANG) \
36356 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WORKER) \
36357 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR) \
36358 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SEQ))
36361 /* Parse the OpenACC routine pragma. This has an optional '( name )'
36362 component, which must resolve to a declared namespace-scope
36363 function. The clauses are either processed directly (for a named
36364 function), or defered until the immediatley following declaration
36365 is parsed. */
36367 static void
36370 {
36373 cp_omp_declare_simd_data data;
36375 {
36381 }
36384 /* Create a dummy claue, to record location. */
36388 {
36393 }
36395 /* Look for optional '( name )'. */
36397 {
36399 {
36408 "%<#pragma acc routine%> not followed by a "
36413 }
36418 /* We parse the name as an id-expression. If it resolves to
36419 anything other than a non-overloaded function at namespace
36420 scope, it's an error. */
36434 {
36438 }
36440 /* Build a chain of clauses. */
36445 cp_lexer_peek_token
36448 /* Force clauses to be non-null, by attaching context to it. */
36454 {
36458 }
36460 /* Perhaps we should use the same rule as declarations in different
36461 namespaces? */
36463 {
36468 }
36471 {
36476 }
36483 }
36484 else
36485 {
36504 {
36505 /* Create an empty list of clauses. */
36507 NULL_TREE);
36518 }
36519 }
36520 }
36522 /* Finalize #pragma acc routine clauses after direct declarator has
36523 been parsed, and put that into "oacc function" attribute. */
36525 static tree
36527 {
36531 location_t loc;
36537 {
36542 }
36559 /* Force clauses to be non-null, by attaching context to it. */
36564 }
36566 /* Apply any saved OpenACC routine clauses to a just-parsed
36567 declaration. */
36569 static void
36571 {
36573 {
36581 {
36584 }
36587 {
36590 }
36593 {
36595 "%<#pragma acc routine%> not followed by a function "
36598 }
36601 {
36603 fndecl);
36605 }
36608 {
36612 }
36614 /* Process for function attrib */
36618 /* Add an "omp target" attribute. */
36622 }
36623 }
36625 /* Main entry point to OpenMP statement pragmas. */
36627 static void
36629 {
36630 tree stmt;
36635 {
36717 }
36720 }
36721 \f
36722 /* Transactional Memory parsing routines. */
36724 /* Parse a transaction attribute.
36726 txn-attribute:
36727 attribute
36728 [ [ identifier ] ]
36730 We use this instead of cp_parser_attributes_opt for transactions to avoid
36731 the pedwarn in C++98 mode. */
36733 static tree
36735 {
36750 {
36754 /* For keywords, use the canonical spelling,
36755 not the parsed identifier. */
36759 }
36760 else
36764 error1:
36767 }
36769 /* Parse a __transaction_atomic or __transaction_relaxed statement.
36771 transaction-statement:
36772 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
36773 compound-statement
36774 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
36775 */
36777 static tree
36779 {
36790 else
36791 {
36795 }
36797 /* Parse a noexcept specification. */
36801 {
36802 /* cancel-and-throw is unimplemented. */
36805 }
36806 else
36809 /* Keep track if we're in the lexical scope of an outer transaction. */
36821 }
36823 /* Parse a __transaction_atomic or __transaction_relaxed expression.
36825 transaction-expression:
36826 __transaction_atomic txn-noexcept-spec[opt] ( expression )
36827 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
36828 */
36830 static tree
36832 {
36845 keyword == RID_TRANSACTION_RELAXED
36859 /* Set this early. This might mean that we allow transaction_cancel in
36860 an expression that we find out later actually has to be a constexpr.
36861 However, we expect that cxx_constant_value will be able to deal with
36862 this; also, if the noexcept has no constexpr, then what we parse next
36863 really is a transaction's body. */
36866 /* Parse a noexcept specification. */
36872 {
36879 }
36880 else
36881 {
36882 /* The only expression that is available got parsed for the noexcept
36883 already. noexcept is true then. */
36886 }
36895 }
36897 /* Parse a function-transaction-block.
36899 function-transaction-block:
36900 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
36901 function-body
36902 __transaction_atomic txn-attribute[opt] function-try-block
36903 __transaction_relaxed ctor-initializer[opt] function-body
36904 __transaction_relaxed function-try-block
36905 */
36907 static bool
36909 {
36925 else
36926 {
36930 }
36938 else
36939 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
36947 }
36949 /* Parse a __transaction_cancel statement.
36951 cancel-statement:
36952 __transaction_cancel txn-attribute[opt] ;
36953 __transaction_cancel txn-attribute[opt] throw-expression ;
36955 ??? Cancel and throw is not yet implemented. */
36957 static tree
36959 {
36965 RT_TRANSACTION_CANCEL);
36972 /* ??? Parse cancel-and-throw here. */
36977 {
36981 }
36983 {
36987 }
36989 {
36992 {
36998 }
36999 }
37001 {
37005 }
37011 }
37012 \f
37013 /* The parser. */
37017 \f
37018 /* Special handling for the first token or line in the file. The first
37019 thing in the file might be #pragma GCC pch_preprocess, which loads a
37020 PCH file, which is a GC collection point. So we need to handle this
37021 first pragma without benefit of an existing lexer structure.
37023 Always returns one token to the caller in *FIRST_TOKEN. This is
37024 either the true first token of the file, or the first token after
37025 the initial pragma. */
37027 static void
37029 {
37038 {
37045 }
37046 else
37049 /* Skip to the end of the pragma. */
37053 /* Now actually load the PCH file. */
37057 /* Read one more token to return to our caller. We have to do this
37058 after reading the PCH file in, since its pointers have to be
37059 live. */
37061 }
37063 /* Parses the grainsize pragma for the _Cilk_for statement.
37064 Syntax:
37065 #pragma cilk grainsize = <VALUE>. */
37067 static void
37069 {
37071 {
37076 {
37079 }
37081 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
37084 else
37086 "%<#pragma cilk grainsize%> is not followed by "
37089 }
37091 }
37093 /* Normal parsing of a pragma token. Here we can (and must) use the
37094 regular lexer. */
37096 static bool
37098 {
37101 tree stmt;
37112 {
37120 {
37130 }
37135 {
37145 }
37150 {
37156 "%<#pragma omp taskwait%> may only be "
37161 }
37166 {
37172 "%<#pragma omp taskyield%> may only be "
37177 }
37182 {
37188 "%<#pragma omp cancel%> may only be "
37193 }
37198 {
37204 "%<#pragma omp cancellation point%> may only be "
37209 }
37277 "%<#pragma omp section%> may only be used in "
37282 {
37284 {
37288 }
37295 {
37298 }
37301 }
37305 {
37309 }
37317 {
37321 }
37323 /* Ignore the pragma if Cilk Plus is not enabled. */
37325 {
37328 }
37329 else
37330 {
37334 }
37341 bad_stmt:
37344 }
37348 }
37350 /* The interface the pragma parsers have to the lexer. */
37352 enum cpp_ttype
37354 {
37366 else
37367 {
37371 }
37374 }
37376 \f
37377 /* External interface. */
37379 /* Parse one entire translation unit. */
37381 void
37383 {
37396 }
37398 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
37399 vectorlength clause:
37400 Syntax:
37401 vectorlength ( constant-expression ) */
37403 static tree
37406 {
37408 tree expr;
37409 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
37410 safelen clause. Thus, vectorlength is represented as OMP 4.0
37411 safelen. For SIMD-enabled function it is represented by OMP 4.0
37412 simdlen. */
37415 loc);
37416 else
37418 loc);
37426 /* If expr == error_mark_node, then don't emit any errors nor
37427 create a clause. if any of the above functions returns
37428 error mark node then they would have emitted an error message. */
37430 ;
37438 else
37439 {
37440 tree c;
37442 {
37447 }
37448 else
37449 {
37454 }
37455 }
37460 }
37462 /* Handles the Cilk Plus #pragma simd linear clause.
37463 Syntax:
37464 linear ( simd-linear-variable-list )
37466 simd-linear-variable-list:
37467 simd-linear-variable
37468 simd-linear-variable-list , simd-linear-variable
37470 simd-linear-variable:
37471 id-expression
37472 id-expression : simd-linear-step
37474 simd-linear-step:
37475 conditional-expression */
37477 static tree
37479 {
37485 {
37489 }
37494 {
37497 {
37501 }
37508 {
37512 }
37513 else
37514 {
37518 /* If present, parse the linear step. Otherwise, assume the default
37519 value of 1. */
37521 {
37528 {
37529 /* If an error has occurred, then the whole pragma is
37530 considered ill-formed. Thus, no reason to keep
37531 parsing. */
37534 }
37542 else
37544 "step size must be an integer constant "
37546 }
37548 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
37554 }
37559 else
37560 {
37565 }
37566 }
37570 }
37572 /* Returns the name of the next clause. If the clause is not
37573 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
37574 token is not consumed. Otherwise, the appropriate enum from the
37575 pragma_simd_clause is returned and the token is consumed. */
37577 static pragma_omp_clause
37579 {
37580 pragma_omp_clause clause_type;
37597 else
37602 }
37604 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
37606 static tree
37608 {
37613 {
37614 pragma_omp_clause c_kind;
37621 /* Use the OpenMP 4.0 equivalent function. */
37624 /* Use the OpenMP 4.0 equivalent function. */
37626 clauses);
37628 /* Use the OMP 4.0 equivalent function. */
37630 clauses);
37632 /* Use the OMP 4.0 equivalent function. */
37634 else
37635 {
37639 }
37640 }
37646 else
37648 }
37650 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
37652 static void
37654 {
37661 {
37665 }
37674 }
37676 /* Main entry-point for parsing Cilk Plus _Cilk_for
37677 loops. The return value is error_mark_node
37678 when errors happen and CILK_FOR tree on success. */
37680 static tree
37682 {
37697 else
37703 }
37705 /* Create an identifier for a generic parameter type (a synthesized
37706 template parameter implied by `auto' or a concept identifier). */
37709 static tree
37711 {
37715 }
37717 /* Predicate that behaves as is_auto_or_concept but matches the parent
37718 node of the generic type rather than the generic type itself. This
37719 allows for type transformation in add_implicit_template_parms. */
37723 {
37725 }
37727 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
37728 (creating a new template parameter list if necessary). Returns the newly
37729 created template type parm. */
37731 static tree
37733 {
37736 /* Before committing to modifying any scope, if we're in an
37737 implicit template scope, and we're trying to synthesize a
37738 constrained parameter, try to find a previous parameter with
37739 the same name. This is the same-type rule for abbreviated
37740 function templates. */
37742 {
37745 {
37747 {
37750 /* Return the TEMPLATE_PARM_INDEX. */
37753 }
37755 }
37756 }
37758 /* We are either continuing a function template that already contains implicit
37759 template parameters, creating a new fully-implicit function template, or
37760 extending an existing explicit function template with implicit template
37761 parameters. */
37769 {
37773 }
37774 else
37775 {
37776 /* Roll back to the existing template parameter scope (in the case of
37777 extending an explicit function template) or introduce a new template
37778 parameter scope ahead of the function parameter scope (or class scope
37779 in the case of out-of-line member definitions). The function scope is
37780 added back after template parameter synthesis below. */
37785 {
37788 }
37790 {
37791 /* If not defining a class, then any class scope is a scope level in
37792 an out-of-line member definition. In this case simply wind back
37793 beyond the first such scope to inject the template parameter list.
37794 Otherwise wind back to the class being defined. The latter can
37795 occur in class member friend declarations such as:
37797 class A {
37798 void foo (auto);
37799 };
37800 class B {
37801 friend void A::foo (auto);
37802 };
37804 The template parameter list synthesized for the friend declaration
37805 must be injected in the scope of 'B'. This can also occur in
37806 erroneous cases such as:
37808 struct A {
37809 struct B {
37810 void foo (auto);
37811 };
37812 void B::foo (auto) {}
37813 };
37815 Here the attempted definition of 'B::foo' within 'A' is ill-formed
37816 but, nevertheless, the template parameter list synthesized for the
37817 declarator should be injected into the scope of 'A' as if the
37818 ill-formed template was specified explicitly. */
37821 {
37824 }
37825 }
37831 {
37832 /* Introduce a new template parameter list for implicit template
37833 parameters. */
37837 parser->implicit_template_scope
37844 }
37845 else
37846 {
37847 /* Synthesize implicit template parameters at the end of the explicit
37848 template parameter list. */
37855 parser->implicit_template_parms
37857 }
37858 }
37860 /* Synthesize a new template parameter and track the current template
37861 parameter chain with implicit_template_parms. */
37865 tree synth_tmpl_parm;
37869 synth_tmpl_parm
37872 synth_tmpl_parm
37874 else
37875 {
37879 }
37881 // Attach the constraint to the parm before processing.
37884 tree new_parm
37886 input_location,
37887 node,
37891 // Chain the new parameter to the list of implicit parameters.
37893 parser->implicit_template_parms
37895 else
37900 /* Return the TEMPLATE_PARM_INDEX, not the PARM_DECL. */
37903 /* If creating a fully implicit function template, start the new implicit
37904 template parameter list with this synthesized type, otherwise grow the
37905 current template parameter list. */
37908 {
37915 }
37916 else
37917 {
37922 }
37924 // If the new parameter was constrained, we need to add that to the
37925 // constraints in the template parameter list.
37927 {
37931 }
37936 }
37938 /* Finish the declaration of a fully implicit function template. Such a
37939 template has no explicit template parameter list so has not been through the
37940 normal template head and tail processing. synthesize_implicit_template_parm
37941 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
37942 provided if the declaration is a class member such that its template
37943 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
37944 form is returned. Otherwise NULL_TREE is returned. */
37946 static tree
37948 {
37953 {
37957 }
37967 }