| blob | 7c48f4cce3ac8a18edd60bbd10bba70ab71917f5 |
1 /* -*- C++ -*- Parser.
2 Copyright (C) 2000-2015 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/>. */
53 \f
54 /* The lexer. */
56 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
57 and c-lex.c) and the C++ parser. */
60 {
62 };
64 /* The various kinds of non integral constant we encounter. */
66 NIC_NONE,
67 /* floating-point literal */
68 NIC_FLOAT,
69 /* %<this%> */
70 NIC_THIS,
71 /* %<__FUNCTION__%> */
72 NIC_FUNC_NAME,
73 /* %<__PRETTY_FUNCTION__%> */
74 NIC_PRETTY_FUNC,
75 /* %<__func__%> */
76 NIC_C99_FUNC,
77 /* "%<va_arg%> */
78 NIC_VA_ARG,
79 /* a cast */
80 NIC_CAST,
81 /* %<typeid%> operator */
82 NIC_TYPEID,
83 /* non-constant compound literals */
84 NIC_NCC,
85 /* a function call */
86 NIC_FUNC_CALL,
87 /* an increment */
88 NIC_INC,
89 /* an decrement */
90 NIC_DEC,
91 /* an array reference */
92 NIC_ARRAY_REF,
93 /* %<->%> */
94 NIC_ARROW,
95 /* %<.%> */
96 NIC_POINT,
97 /* the address of a label */
98 NIC_ADDR_LABEL,
99 /* %<*%> */
100 NIC_STAR,
101 /* %<&%> */
102 NIC_ADDR,
103 /* %<++%> */
104 NIC_PREINCREMENT,
105 /* %<--%> */
106 NIC_PREDECREMENT,
107 /* %<new%> */
108 NIC_NEW,
109 /* %<delete%> */
110 NIC_DEL,
111 /* calls to overloaded operators */
112 NIC_OVERLOADED,
113 /* an assignment */
114 NIC_ASSIGNMENT,
115 /* a comma operator */
116 NIC_COMMA,
117 /* a call to a constructor */
118 NIC_CONSTRUCTOR,
119 /* a transaction expression */
120 NIC_TRANSACTION
123 /* The various kinds of errors about name-lookup failing. */
125 /* NULL */
126 NLE_NULL,
127 /* is not a type */
128 NLE_TYPE,
129 /* is not a class or namespace */
130 NLE_CXX98,
131 /* is not a class, namespace, or enumeration */
132 NLE_NOT_CXX98
135 /* The various kinds of required token */
137 RT_NONE,
159 /* The type is CPP_KEYWORD */
188 RT_TRANSACTION_CANCEL /* __transaction_cancel */
191 /* Prototypes. */
197 static void cp_lexer_destroy
199 static int cp_lexer_saving_tokens
203 static void cp_lexer_get_preprocessor_token
211 static bool cp_lexer_next_token_is_not
213 static bool cp_lexer_next_token_is_keyword
217 static void cp_lexer_purge_token
219 static void cp_lexer_purge_tokens_after
221 static void cp_lexer_save_tokens
223 static void cp_lexer_commit_tokens
225 static void cp_lexer_rollback_tokens
227 static void cp_lexer_print_token
231 static void cp_lexer_start_debugging
233 static void cp_lexer_stop_debugging
239 static void cp_parser_initial_pragma
242 static tree cp_literal_operator_id
245 static void cp_parser_cilk_simd
247 static tree cp_parser_cilk_for
249 static bool cp_parser_omp_declare_reduction_exprs
251 static tree cp_parser_cilk_simd_vectorlength
254 /* Manifest constants. */
255 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
256 #define CP_SAVED_TOKEN_STACK 5
258 /* Variables. */
260 /* The stream to which debugging output should be written. */
263 /* Nonzero if we are parsing an unevaluated operand: an operand to
264 sizeof, typeof, or alignof. */
267 /* Dump up to NUM tokens in BUFFER to FILE starting with token
268 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
269 first token in BUFFER. If NUM is 0, dump all the tokens. If
270 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
271 highlighted by surrounding it in [[ ]]. */
273 static void
277 {
294 {
297 }
302 {
309 nprinted++;
319 {
329 }
330 }
333 {
336 }
339 }
342 /* Dump all tokens in BUFFER to stderr. */
344 void
346 {
348 }
350 DEBUG_FUNCTION void
352 {
354 }
356 DEBUG_FUNCTION void
358 {
361 else
363 }
366 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
367 description for T. */
369 static void
371 {
373 {
376 }
377 }
380 /* Dump parser context C to FILE. */
382 static void
384 {
389 }
392 /* Print the stack of parsing contexts to FILE starting with FIRST. */
394 static void
396 {
402 {
405 }
406 }
409 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
411 static void
413 {
416 }
419 /* Print an unparsed function entry UF to FILE. */
421 static void
423 {
426 tree fn;
431 i++)
432 {
438 }
443 {
446 }
452 {
455 }
457 }
460 /* Print the stack of unparsed member functions S to FILE. */
462 static void
465 {
471 {
474 }
475 }
478 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
479 the given PARSER. If FILE is NULL, the output is printed on stderr. */
481 static void
483 {
495 next_token);
496 }
499 /* Dump debugging information for the given PARSER. If FILE is NULL,
500 the output is printed on stderr. */
502 void
504 {
507 expanded_location eloc;
585 }
587 DEBUG_FUNCTION void
589 {
591 }
593 DEBUG_FUNCTION void
595 {
598 else
600 }
602 /* Allocate memory for a new lexer object and return it. */
606 {
611 /* Allocate the memory. */
614 /* Initially we are not debugging. */
619 /* Create the buffer. */
623 }
626 /* Create a new main C++ lexer, the lexer that gets tokens from the
627 preprocessor. */
631 {
633 cp_token token;
635 /* It's possible that parsing the first pragma will load a PCH file,
636 which is a GC collection point. So we have to do that before
637 allocating any memory. */
642 /* Put the first token in the buffer. */
645 /* Get the remaining tokens from the preprocessor. */
647 {
650 }
659 /* Subsequent preprocessor diagnostics should use compiler
660 diagnostic functions to get the compiler source location. */
665 }
667 /* Create a new lexer whose token stream is primed with the tokens in
668 CACHE. When these tokens are exhausted, no new tokens will be read. */
672 {
677 /* We do not own the buffer. */
684 /* Initially we are not debugging. */
689 }
691 /* Frees all resources associated with LEXER. */
693 static void
695 {
699 }
701 /* Returns nonzero if debugging information should be output. */
705 {
707 }
712 {
716 }
720 {
722 }
726 {
728 }
732 {
735 else
737 }
741 {
745 }
747 /* nonzero if we are presently saving tokens. */
751 {
753 }
755 /* Store the next token from the preprocessor in *TOKEN. Return true
756 if we reach EOF. If LEXER is NULL, assume we are handling an
757 initial #pragma pch_preprocess, and thus want the lexer to return
758 processed strings. */
760 static void
762 {
765 /* Get a new token from the preprocessor. */
766 token->type
774 /* On some systems, some header files are surrounded by an
775 implicit extern "C" block. Set a flag in the token if it
776 comes from such a header. */
781 /* Check to see if this token is a keyword. */
783 {
785 {
786 /* Mark this token as a keyword. */
788 /* Record which keyword. */
790 }
791 else
792 {
796 {
797 /* Warn about the C++0x keyword (but still treat it as
798 an identifier). */
803 /* Clear out the C_RID_CODE so we don't warn about this
804 particular identifier-turned-keyword again. */
806 }
809 }
810 }
812 {
813 /* This only happens in Objective-C++; it must be a keyword. */
816 {
817 /* Replace 'class' with '@class', 'private' with '@private',
818 etc. This prevents confusion with the C++ keyword
819 'class', and makes the tokens consistent with other
820 Objective-C 'AT' keywords. For example '@class' is
821 reported as RID_AT_CLASS which is consistent with
822 '@synchronized', which is reported as
823 RID_AT_SYNCHRONIZED.
824 */
833 }
834 }
836 {
837 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
841 }
842 }
844 /* Update the globals input_location and the input file stack from TOKEN. */
847 {
849 {
851 }
852 }
854 /* Update the globals input_location and the input file stack from LEXER. */
857 {
860 }
862 /* Return a pointer to the next token in the token stream, but do not
863 consume it. */
867 {
869 {
873 }
875 }
877 /* Return true if the next token has the indicated TYPE. */
881 {
883 }
885 /* Return true if the next token does not have the indicated TYPE. */
889 {
891 }
893 /* Return true if the next token is the indicated KEYWORD. */
897 {
899 }
903 {
905 }
909 {
911 }
913 /* Return true if the next token is not the indicated KEYWORD. */
917 {
919 }
921 /* Return true if the next token is a keyword for a decl-specifier. */
923 static bool
925 {
930 {
931 /* auto specifier: storage-class-specifier in C++,
932 simple-type-specifier in C++0x. */
934 /* Storage classes. */
940 /* Elaborated type specifiers. */
946 /* Simple type specifiers. */
960 /* GNU extensions. */
963 /* C++0x extensions. */
974 }
975 }
977 /* Returns TRUE iff the token T begins a decltype type. */
979 static bool
981 {
984 }
986 /* Returns TRUE iff the next token begins a decltype type. */
988 static bool
990 {
993 }
995 /* Return a pointer to the Nth token in the token stream. If N is 1,
996 then this is precisely equivalent to cp_lexer_peek_token (except
997 that it is not inline). One would like to disallow that case, but
998 there is one case (cp_parser_nth_token_starts_template_id) where
999 the caller passes a variable for N and it might be 1. */
1003 {
1006 /* N is 1-based, not zero-based. */
1017 {
1020 {
1023 }
1027 }
1030 {
1033 }
1036 }
1038 /* Return the next token, and advance the lexer's next_token pointer
1039 to point to the next non-purged token. */
1043 {
1049 do
1050 {
1053 {
1056 }
1058 }
1063 /* Provide debugging output. */
1065 {
1069 }
1072 }
1074 /* Permanently remove the next token from the token stream, and
1075 advance the next_token pointer to refer to the next non-purged
1076 token. */
1078 static void
1080 {
1089 do
1090 {
1091 tok++;
1093 {
1096 }
1097 }
1100 }
1102 /* Permanently remove all tokens after TOK, up to, but not
1103 including, the token that will be returned next by
1104 cp_lexer_peek_token. */
1106 static void
1108 {
1117 {
1122 }
1123 }
1125 /* Begin saving tokens. All tokens consumed after this point will be
1126 preserved. */
1128 static void
1130 {
1131 /* Provide debugging output. */
1136 }
1138 /* Commit to the portion of the token stream most recently saved. */
1140 static void
1142 {
1143 /* Provide debugging output. */
1148 }
1150 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1151 to the token stream. Stop saving tokens. */
1153 static void
1155 {
1156 /* Provide debugging output. */
1161 }
1163 /* RAII wrapper around the above functions, with sanity checking. Creating
1164 a variable saves tokens, which are committed when the variable is
1165 destroyed unless they are explicitly rolled back by calling the rollback
1166 member function. */
1168 struct saved_token_sentinel
1169 {
1174 {
1177 }
1179 {
1182 }
1184 {
1188 }
1189 };
1191 /* Print a representation of the TOKEN on the STREAM. */
1193 static void
1195 {
1196 /* We don't use cpp_type2name here because the parser defines
1197 a few tokens of its own. */
1199 /* cpplib-defined token types */
1200 #define OP(e, s) #e,
1201 #define TK(e, s) #e,
1202 TTYPE_TABLE
1203 #undef OP
1204 #undef TK
1205 /* C++ parser token types - see "Manifest constants", above. */
1209 };
1211 /* For some tokens, print the associated data. */
1213 {
1215 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1216 For example, `struct' is mapped to an INTEGER_CST. */
1219 /* else fall through */
1237 /* If we have a name for the token, print it out. Otherwise, we
1238 simply give the numeric code. */
1241 else
1244 }
1245 }
1247 DEBUG_FUNCTION void
1249 {
1252 }
1254 DEBUG_FUNCTION void
1256 {
1259 else
1261 }
1264 /* Start emitting debugging information. */
1266 static void
1268 {
1271 }
1273 /* Stop emitting debugging information. */
1275 static void
1277 {
1280 }
1282 /* Create a new cp_token_cache, representing a range of tokens. */
1286 {
1291 }
1293 /* Diagnose if #pragma omp declare simd isn't followed immediately
1294 by function declaration or definition. */
1298 {
1300 {
1304 }
1305 }
1307 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1308 and put that into "omp declare simd" attribute. */
1312 {
1314 {
1316 {
1319 }
1321 {
1324 }
1325 }
1326 }
1327 \f
1328 /* Decl-specifiers. */
1330 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1332 static void
1334 {
1336 }
1338 /* Declarators. */
1340 /* Nothing other than the parser should be creating declarators;
1341 declarators are a semi-syntactic representation of C++ entities.
1342 Other parts of the front end that need to create entities (like
1343 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1358 /* An erroneous declarator. */
1361 /* The obstack on which declarators and related data structures are
1362 allocated. */
1365 /* Alloc BYTES from the declarator memory pool. */
1369 {
1371 }
1373 /* Allocate a declarator of the indicated KIND. Clear fields that are
1374 common to all declarators. */
1378 {
1390 }
1392 /* Make a declarator for a generalized identifier. If
1393 QUALIFYING_SCOPE is non-NULL, the identifier is
1394 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1395 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1396 is, if any. */
1400 special_function_kind sfk)
1401 {
1404 /* It is valid to write:
1406 class C { void f(); };
1407 typedef C D;
1408 void D::f();
1410 The standard is not clear about whether `typedef const C D' is
1411 legal; as of 2002-09-15 the committee is considering that
1412 question. EDG 3.0 allows that syntax. Therefore, we do as
1413 well. */
1427 }
1429 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1430 of modifiers such as const or volatile to apply to the pointer
1431 type, represented as identifiers. ATTRIBUTES represent the attributes that
1432 appertain to the pointer or reference. */
1434 cp_declarator *
1436 tree attributes)
1437 {
1445 {
1449 }
1450 else
1456 }
1458 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1459 represent the attributes that appertain to the pointer or
1460 reference. */
1462 cp_declarator *
1465 {
1473 {
1477 }
1478 else
1484 }
1486 /* Like make_pointer_declarator -- but for a pointer to a non-static
1487 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1488 appertain to the pointer or reference. */
1490 cp_declarator *
1493 tree attributes)
1494 {
1503 {
1506 }
1507 else
1513 }
1515 /* Make a declarator for the function given by TARGET, with the
1516 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1517 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1518 indicates what exceptions can be thrown. */
1520 cp_declarator *
1522 tree parms,
1523 cp_cv_quals cv_qualifiers,
1524 cp_virt_specifiers virt_specifiers,
1525 cp_ref_qualifier ref_qualifier,
1526 tree exception_specification,
1527 tree late_return_type)
1528 {
1540 {
1544 }
1545 else
1549 }
1551 /* Make a declarator for an array of BOUNDS elements, each of which is
1552 defined by ELEMENT. */
1554 cp_declarator *
1556 {
1563 {
1567 }
1568 else
1572 }
1574 /* Determine whether the declarator we've seen so far can be a
1575 parameter pack, when followed by an ellipsis. */
1576 static bool
1578 {
1579 /* Search for a declarator name, or any other declarator that goes
1580 after the point where the ellipsis could appear in a parameter
1581 pack. If we find any of these, then this declarator can not be
1582 made into a parameter pack. */
1585 {
1587 {
1599 }
1600 }
1603 }
1607 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1608 DECLARATOR and DEFAULT_ARGUMENT. */
1610 cp_parameter_declarator *
1613 tree default_argument)
1614 {
1622 else
1629 }
1631 /* Returns true iff DECLARATOR is a declaration for a function. */
1633 static bool
1635 {
1637 {
1645 }
1647 }
1649 /* The parser. */
1651 /* Overview
1652 --------
1654 A cp_parser parses the token stream as specified by the C++
1655 grammar. Its job is purely parsing, not semantic analysis. For
1656 example, the parser breaks the token stream into declarators,
1657 expressions, statements, and other similar syntactic constructs.
1658 It does not check that the types of the expressions on either side
1659 of an assignment-statement are compatible, or that a function is
1660 not declared with a parameter of type `void'.
1662 The parser invokes routines elsewhere in the compiler to perform
1663 semantic analysis and to build up the abstract syntax tree for the
1664 code processed.
1666 The parser (and the template instantiation code, which is, in a
1667 way, a close relative of parsing) are the only parts of the
1668 compiler that should be calling push_scope and pop_scope, or
1669 related functions. The parser (and template instantiation code)
1670 keeps track of what scope is presently active; everything else
1671 should simply honor that. (The code that generates static
1672 initializers may also need to set the scope, in order to check
1673 access control correctly when emitting the initializers.)
1675 Methodology
1676 -----------
1678 The parser is of the standard recursive-descent variety. Upcoming
1679 tokens in the token stream are examined in order to determine which
1680 production to use when parsing a non-terminal. Some C++ constructs
1681 require arbitrary look ahead to disambiguate. For example, it is
1682 impossible, in the general case, to tell whether a statement is an
1683 expression or declaration without scanning the entire statement.
1684 Therefore, the parser is capable of "parsing tentatively." When the
1685 parser is not sure what construct comes next, it enters this mode.
1686 Then, while we attempt to parse the construct, the parser queues up
1687 error messages, rather than issuing them immediately, and saves the
1688 tokens it consumes. If the construct is parsed successfully, the
1689 parser "commits", i.e., it issues any queued error messages and
1690 the tokens that were being preserved are permanently discarded.
1691 If, however, the construct is not parsed successfully, the parser
1692 rolls back its state completely so that it can resume parsing using
1693 a different alternative.
1695 Future Improvements
1696 -------------------
1698 The performance of the parser could probably be improved substantially.
1699 We could often eliminate the need to parse tentatively by looking ahead
1700 a little bit. In some places, this approach might not entirely eliminate
1701 the need to parse tentatively, but it might still speed up the average
1702 case. */
1704 /* Flags that are passed to some parsing functions. These values can
1705 be bitwise-ored together. */
1707 enum
1708 {
1709 /* No flags. */
1711 /* The construct is optional. If it is not present, then no error
1712 should be issued. */
1714 /* When parsing a type-specifier, treat user-defined type-names
1715 as non-type identifiers. */
1717 /* When parsing a type-specifier, do not try to parse a class-specifier
1718 or enum-specifier. */
1720 /* When parsing a decl-specifier-seq, only allow type-specifier or
1721 constexpr. */
1723 };
1725 /* This type is used for parameters and variables which hold
1726 combinations of the above flags. */
1729 /* The different kinds of declarators we want to parse. */
1732 {
1733 /* We want an abstract declarator. */
1734 CP_PARSER_DECLARATOR_ABSTRACT,
1735 /* We want a named declarator. */
1736 CP_PARSER_DECLARATOR_NAMED,
1737 /* We don't mind, but the name must be an unqualified-id. */
1738 CP_PARSER_DECLARATOR_EITHER
1741 /* The precedence values used to parse binary expressions. The minimum value
1742 of PREC must be 1, because zero is reserved to quickly discriminate
1743 binary operators from other tokens. */
1745 enum cp_parser_prec
1746 {
1747 PREC_NOT_OPERATOR,
1748 PREC_LOGICAL_OR_EXPRESSION,
1749 PREC_LOGICAL_AND_EXPRESSION,
1750 PREC_INCLUSIVE_OR_EXPRESSION,
1751 PREC_EXCLUSIVE_OR_EXPRESSION,
1752 PREC_AND_EXPRESSION,
1753 PREC_EQUALITY_EXPRESSION,
1754 PREC_RELATIONAL_EXPRESSION,
1755 PREC_SHIFT_EXPRESSION,
1756 PREC_ADDITIVE_EXPRESSION,
1757 PREC_MULTIPLICATIVE_EXPRESSION,
1758 PREC_PM_EXPRESSION,
1759 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1760 };
1762 /* A mapping from a token type to a corresponding tree node type, with a
1763 precedence value. */
1766 {
1767 /* The token type. */
1769 /* The corresponding tree code. */
1771 /* The precedence of this operator. */
1776 {
1777 /* Left hand side of the binary operation we are currently
1778 parsing. */
1779 tree lhs;
1780 /* Original tree code for left hand side, if it was a binary
1781 expression itself (used for -Wparentheses). */
1783 /* Tree code for the binary operation we are parsing. */
1785 /* Precedence of the binary operation we are parsing. */
1787 /* Location of the binary operation we are parsing. */
1788 location_t loc;
1791 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1792 entries because precedence levels on the stack are monotonically
1793 increasing. */
1797 /* Prototypes. */
1799 /* Constructors and destructors. */
1804 /* Class variables. */
1808 /* The operator-precedence table used by cp_parser_binary_expression.
1809 Transformed into an associative array (binops_by_token) by
1810 cp_parser_new. */
1843 };
1845 /* The same as binops, but initialized by cp_parser_new so that
1846 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1847 for speed. */
1850 /* Constructors and destructors. */
1852 /* Construct a new context. The context below this one on the stack
1853 is given by NEXT. */
1857 {
1860 /* Allocate the storage. */
1862 {
1863 /* Pull the first entry from the free list. */
1867 }
1868 else
1871 /* No errors have occurred yet in this context. */
1873 /* If this is not the bottommost context, copy information that we
1874 need from the previous context. */
1876 {
1877 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1878 expression, then we are parsing one in this context, too. */
1880 /* Thread the stack. */
1882 }
1885 }
1887 /* Managing the unparsed function queues. */
1889 #define unparsed_funs_with_default_args \
1890 parser->unparsed_queues->last ().funs_with_default_args
1891 #define unparsed_funs_with_definitions \
1892 parser->unparsed_queues->last ().funs_with_definitions
1893 #define unparsed_nsdmis \
1894 parser->unparsed_queues->last ().nsdmis
1895 #define unparsed_classes \
1896 parser->unparsed_queues->last ().classes
1898 static void
1900 {
1903 }
1905 static void
1907 {
1910 }
1912 /* Prototypes. */
1914 /* Constructors and destructors. */
1919 /* Routines to parse various constructs.
1921 Those that return `tree' will return the error_mark_node (rather
1922 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1923 Sometimes, they will return an ordinary node if error-recovery was
1924 attempted, even though a parse error occurred. So, to check
1925 whether or not a parse error occurred, you should always use
1926 cp_parser_error_occurred. If the construct is optional (indicated
1927 either by an `_opt' in the name of the function that does the
1928 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1929 the construct is not present. */
1931 /* Lexical conventions [gram.lex] */
1933 static tree cp_parser_identifier
1935 static tree cp_parser_string_literal
1937 static tree cp_parser_userdef_char_literal
1939 static tree cp_parser_userdef_string_literal
1941 static tree cp_parser_userdef_numeric_literal
1944 /* Basic concepts [gram.basic] */
1946 static bool cp_parser_translation_unit
1949 /* Expressions [gram.expr] */
1951 static tree cp_parser_primary_expression
1953 static tree cp_parser_id_expression
1955 static tree cp_parser_unqualified_id
1957 static tree cp_parser_nested_name_specifier_opt
1959 static tree cp_parser_nested_name_specifier
1961 static tree cp_parser_qualifying_entity
1963 static tree cp_parser_postfix_expression
1965 static tree cp_parser_postfix_open_square_expression
1967 static tree cp_parser_postfix_dot_deref_expression
1971 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1973 static void cp_parser_pseudo_destructor_name
1975 static tree cp_parser_unary_expression
1977 static enum tree_code cp_parser_unary_operator
1979 static tree cp_parser_new_expression
1983 static tree cp_parser_new_type_id
1991 static tree cp_parser_delete_expression
1993 static tree cp_parser_cast_expression
1995 static tree cp_parser_binary_expression
1997 static tree cp_parser_question_colon_clause
1999 static tree cp_parser_assignment_expression
2001 static enum tree_code cp_parser_assignment_operator_opt
2003 static tree cp_parser_expression
2005 static tree cp_parser_constant_expression
2007 static tree cp_parser_builtin_offsetof
2009 static tree cp_parser_lambda_expression
2011 static void cp_parser_lambda_introducer
2013 static bool cp_parser_lambda_declarator_opt
2015 static void cp_parser_lambda_body
2018 /* Statements [gram.stmt.stmt] */
2020 static void cp_parser_statement
2022 static void cp_parser_label_for_labeled_statement
2024 static tree cp_parser_expression_statement
2026 static tree cp_parser_compound_statement
2028 static void cp_parser_statement_seq_opt
2030 static tree cp_parser_selection_statement
2032 static tree cp_parser_condition
2034 static tree cp_parser_iteration_statement
2036 static bool cp_parser_for_init_statement
2038 static tree cp_parser_for
2040 static tree cp_parser_c_for
2042 static tree cp_parser_range_for
2044 static void do_range_for_auto_deduction
2046 static tree cp_parser_perform_range_for_lookup
2048 static tree cp_parser_range_for_member_function
2050 static tree cp_parser_jump_statement
2052 static void cp_parser_declaration_statement
2055 static tree cp_parser_implicitly_scoped_statement
2057 static void cp_parser_already_scoped_statement
2060 /* Declarations [gram.dcl.dcl] */
2062 static void cp_parser_declaration_seq_opt
2064 static void cp_parser_declaration
2066 static void cp_parser_block_declaration
2068 static void cp_parser_simple_declaration
2070 static void cp_parser_decl_specifier_seq
2072 static tree cp_parser_storage_class_specifier_opt
2074 static tree cp_parser_function_specifier_opt
2076 static tree cp_parser_type_specifier
2079 static tree cp_parser_simple_type_specifier
2081 static tree cp_parser_type_name
2083 static tree cp_parser_nonclass_name
2085 static tree cp_parser_elaborated_type_specifier
2087 static tree cp_parser_enum_specifier
2089 static void cp_parser_enumerator_list
2091 static void cp_parser_enumerator_definition
2093 static tree cp_parser_namespace_name
2095 static void cp_parser_namespace_definition
2097 static void cp_parser_namespace_body
2099 static tree cp_parser_qualified_namespace_specifier
2101 static void cp_parser_namespace_alias_definition
2103 static bool cp_parser_using_declaration
2105 static void cp_parser_using_directive
2107 static tree cp_parser_alias_declaration
2109 static void cp_parser_asm_definition
2111 static void cp_parser_linkage_specification
2113 static void cp_parser_static_assert
2115 static tree cp_parser_decltype
2118 /* Declarators [gram.dcl.decl] */
2120 static tree cp_parser_init_declarator
2127 static enum tree_code cp_parser_ptr_operator
2129 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2131 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2133 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2135 static tree cp_parser_late_return_type_opt
2137 static tree cp_parser_declarator_id
2139 static tree cp_parser_type_id
2141 static tree cp_parser_template_type_arg
2144 static tree cp_parser_type_id_1
2146 static void cp_parser_type_specifier_seq
2148 static tree cp_parser_parameter_declaration_clause
2150 static tree cp_parser_parameter_declaration_list
2154 static tree cp_parser_default_argument
2156 static void cp_parser_function_body
2158 static tree cp_parser_initializer
2160 static tree cp_parser_initializer_clause
2162 static tree cp_parser_braced_list
2167 static bool cp_parser_ctor_initializer_opt_and_function_body
2170 static tree cp_parser_late_parsing_omp_declare_simd
2173 static tree cp_parser_late_parsing_cilk_simd_fn_info
2176 static tree synthesize_implicit_template_parm
2178 static tree finish_fully_implicit_template
2181 /* Classes [gram.class] */
2183 static tree cp_parser_class_name
2185 static tree cp_parser_class_specifier
2187 static tree cp_parser_class_head
2189 static enum tag_types cp_parser_class_key
2191 static void cp_parser_type_parameter_key
2193 static void cp_parser_member_specification_opt
2195 static void cp_parser_member_declaration
2197 static tree cp_parser_pure_specifier
2199 static tree cp_parser_constant_initializer
2202 /* Derived classes [gram.class.derived] */
2204 static tree cp_parser_base_clause
2206 static tree cp_parser_base_specifier
2209 /* Special member functions [gram.special] */
2211 static tree cp_parser_conversion_function_id
2213 static tree cp_parser_conversion_type_id
2217 static bool cp_parser_ctor_initializer_opt
2219 static void cp_parser_mem_initializer_list
2221 static tree cp_parser_mem_initializer
2223 static tree cp_parser_mem_initializer_id
2226 /* Overloading [gram.over] */
2228 static tree cp_parser_operator_function_id
2230 static tree cp_parser_operator
2233 /* Templates [gram.temp] */
2235 static void cp_parser_template_declaration
2237 static tree cp_parser_template_parameter_list
2239 static tree cp_parser_template_parameter
2241 static tree cp_parser_type_parameter
2243 static tree cp_parser_template_id
2245 static tree cp_parser_template_name
2247 static tree cp_parser_template_argument_list
2249 static tree cp_parser_template_argument
2251 static void cp_parser_explicit_instantiation
2253 static void cp_parser_explicit_specialization
2256 /* Exception handling [gram.exception] */
2258 static tree cp_parser_try_block
2260 static bool cp_parser_function_try_block
2262 static void cp_parser_handler_seq
2264 static void cp_parser_handler
2266 static tree cp_parser_exception_declaration
2268 static tree cp_parser_throw_expression
2270 static tree cp_parser_exception_specification_opt
2272 static tree cp_parser_type_id_list
2275 /* GNU Extensions */
2277 static tree cp_parser_asm_specification_opt
2279 static tree cp_parser_asm_operand_list
2281 static tree cp_parser_asm_clobber_list
2283 static tree cp_parser_asm_label_list
2285 static bool cp_next_tokens_can_be_attribute_p
2287 static bool cp_next_tokens_can_be_gnu_attribute_p
2289 static bool cp_next_tokens_can_be_std_attribute_p
2291 static bool cp_nth_tokens_can_be_std_attribute_p
2293 static bool cp_nth_tokens_can_be_gnu_attribute_p
2295 static bool cp_nth_tokens_can_be_attribute_p
2297 static tree cp_parser_attributes_opt
2299 static tree cp_parser_gnu_attributes_opt
2301 static tree cp_parser_gnu_attribute_list
2303 static tree cp_parser_std_attribute
2305 static tree cp_parser_std_attribute_spec
2307 static tree cp_parser_std_attribute_spec_seq
2309 static bool cp_parser_extension_opt
2311 static void cp_parser_label_declaration
2314 /* Transactional Memory Extensions */
2316 static tree cp_parser_transaction
2318 static tree cp_parser_transaction_expression
2320 static bool cp_parser_function_transaction
2322 static tree cp_parser_transaction_cancel
2326 pragma_external,
2327 pragma_member,
2328 pragma_objc_icode,
2329 pragma_stmt,
2330 pragma_compound
2331 };
2332 static bool cp_parser_pragma
2335 /* Objective-C++ Productions */
2337 static tree cp_parser_objc_message_receiver
2339 static tree cp_parser_objc_message_args
2341 static tree cp_parser_objc_message_expression
2343 static tree cp_parser_objc_encode_expression
2345 static tree cp_parser_objc_defs_expression
2347 static tree cp_parser_objc_protocol_expression
2349 static tree cp_parser_objc_selector_expression
2351 static tree cp_parser_objc_expression
2353 static bool cp_parser_objc_selector_p
2355 static tree cp_parser_objc_selector
2357 static tree cp_parser_objc_protocol_refs_opt
2359 static void cp_parser_objc_declaration
2361 static tree cp_parser_objc_statement
2363 static bool cp_parser_objc_valid_prefix_attributes
2365 static void cp_parser_objc_at_property_declaration
2367 static void cp_parser_objc_at_synthesize_declaration
2369 static void cp_parser_objc_at_dynamic_declaration
2371 static tree cp_parser_objc_struct_declaration
2374 /* Utility Routines */
2376 static tree cp_parser_lookup_name
2378 static tree cp_parser_lookup_name_simple
2380 static tree cp_parser_maybe_treat_template_as_class
2382 static bool cp_parser_check_declarator_template_parameters
2384 static bool cp_parser_check_template_parameters
2386 static tree cp_parser_simple_cast_expression
2388 static tree cp_parser_global_scope_opt
2390 static bool cp_parser_constructor_declarator_p
2392 static tree cp_parser_function_definition_from_specifiers_and_declarator
2394 static tree cp_parser_function_definition_after_declarator
2396 static void cp_parser_template_declaration_after_export
2398 static void cp_parser_perform_template_parameter_access_checks
2400 static tree cp_parser_single_declaration
2402 static tree cp_parser_functional_cast
2404 static tree cp_parser_save_member_function_body
2406 static tree cp_parser_save_nsdmi
2408 static tree cp_parser_enclosed_template_argument_list
2410 static void cp_parser_save_default_args
2412 static void cp_parser_late_parsing_for_member
2414 static tree cp_parser_late_parse_one_default_arg
2416 static void cp_parser_late_parsing_nsdmi
2418 static void cp_parser_late_parsing_default_args
2420 static tree cp_parser_sizeof_operand
2422 static tree cp_parser_trait_expr
2424 static bool cp_parser_declares_only_class_p
2426 static void cp_parser_set_storage_class
2428 static void cp_parser_set_decl_spec_type
2430 static void set_and_check_decl_spec_loc
2433 static bool cp_parser_friend_p
2435 static void cp_parser_required_error
2441 static bool cp_parser_token_starts_function_definition_p
2443 static bool cp_parser_next_token_starts_class_definition_p
2445 static bool cp_parser_next_token_ends_template_argument_p
2447 static bool cp_parser_nth_token_starts_template_argument_list_p
2449 static enum tag_types cp_parser_token_is_class_key
2451 static enum tag_types cp_parser_token_is_type_parameter_key
2453 static void cp_parser_check_class_key
2455 static void cp_parser_check_access_in_redeclaration
2457 static bool cp_parser_optional_template_keyword
2459 static void cp_parser_pre_parsed_nested_name_specifier
2461 static bool cp_parser_cache_group
2463 static tree cp_parser_cache_defarg
2465 static void cp_parser_parse_tentatively
2467 static void cp_parser_commit_to_tentative_parse
2469 static void cp_parser_commit_to_topmost_tentative_parse
2471 static void cp_parser_abort_tentative_parse
2473 static bool cp_parser_parse_definitely
2477 static bool cp_parser_uncommitted_to_tentative_parse_p
2479 static void cp_parser_error
2481 static void cp_parser_name_lookup_error
2483 static bool cp_parser_simulate_error
2485 static bool cp_parser_check_type_definition
2487 static void cp_parser_check_for_definition_in_return_type
2489 static void cp_parser_check_for_invalid_template_id
2491 static bool cp_parser_non_integral_constant_expression
2493 static void cp_parser_diagnose_invalid_type_name
2495 static bool cp_parser_parse_and_diagnose_invalid_type_name
2497 static int cp_parser_skip_to_closing_parenthesis
2499 static void cp_parser_skip_to_end_of_statement
2501 static void cp_parser_consume_semicolon_at_end_of_statement
2503 static void cp_parser_skip_to_end_of_block_or_statement
2505 static bool cp_parser_skip_to_closing_brace
2507 static void cp_parser_skip_to_end_of_template_parameter_list
2509 static void cp_parser_skip_to_pragma_eol
2511 static bool cp_parser_error_occurred
2513 static bool cp_parser_allow_gnu_extensions_p
2515 static bool cp_parser_is_pure_string_literal
2517 static bool cp_parser_is_string_literal
2519 static bool cp_parser_is_keyword
2521 static tree cp_parser_make_typename_type
2525 static bool cp_parser_compound_literal_p
2527 static bool cp_parser_array_designator_p
2529 static bool cp_parser_skip_to_closing_square_bracket
2532 /* Returns nonzero if we are parsing tentatively. */
2536 {
2538 }
2540 /* Returns nonzero if TOKEN is a string literal. */
2542 static bool
2544 {
2550 }
2552 /* Returns nonzero if TOKEN is a string literal
2553 of a user-defined string literal. */
2555 static bool
2557 {
2564 }
2566 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2568 static bool
2570 {
2572 }
2574 /* If not parsing tentatively, issue a diagnostic of the form
2575 FILE:LINE: MESSAGE before TOKEN
2576 where TOKEN is the next token in the input stream. MESSAGE
2577 (specified by the caller) is usually of the form "expected
2578 OTHER-TOKEN". */
2580 static void
2582 {
2584 {
2586 /* This diagnostic makes more sense if it is tagged to the line
2587 of the token we just peeked at. */
2591 {
2596 }
2599 /* Because c_parser_error does not understand
2600 CPP_KEYWORD, keywords are treated like
2601 identifiers. */
2604 }
2605 }
2607 /* Issue an error about name-lookup failing. NAME is the
2608 IDENTIFIER_NODE DECL is the result of
2609 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2610 the thing that we hoped to find. */
2612 static void
2614 tree name,
2615 tree decl,
2616 name_lookup_error desired,
2617 location_t location)
2618 {
2619 /* If name lookup completely failed, tell the user that NAME was not
2620 declared. */
2622 {
2635 else
2637 }
2639 {
2641 {
2658 }
2659 }
2661 {
2663 {
2673 name);
2677 }
2678 }
2679 else
2680 {
2682 {
2695 }
2696 }
2697 }
2699 /* If we are parsing tentatively, remember that an error has occurred
2700 during this tentative parse. Returns true if the error was
2701 simulated; false if a message should be issued by the caller. */
2703 static bool
2705 {
2707 {
2710 }
2712 }
2714 /* This function is called when a type is defined. If type
2715 definitions are forbidden at this point, an error message is
2716 issued. */
2718 static bool
2720 {
2721 /* If types are forbidden here, issue a message. */
2723 {
2724 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2725 in the message need to be interpreted. */
2728 }
2730 }
2732 /* This function is called when the DECLARATOR is processed. The TYPE
2733 was a type defined in the decl-specifiers. If it is invalid to
2734 define a type in the decl-specifiers for DECLARATOR, an error is
2735 issued. TYPE_LOCATION is the location of TYPE and is used
2736 for error reporting. */
2738 static void
2741 {
2742 /* [dcl.fct] forbids type definitions in return types.
2743 Unfortunately, it's not easy to know whether or not we are
2744 processing a return type until after the fact. */
2752 {
2757 type);
2758 }
2759 }
2761 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2762 "<" in any valid C++ program. If the next token is indeed "<",
2763 issue a message warning the user about what appears to be an
2764 invalid attempt to form a template-id. LOCATION is the location
2765 of the type-specifier (TYPE) */
2767 static void
2769 tree type,
2771 location_t location)
2772 {
2776 {
2780 {
2783 else
2785 }
2786 else
2788 /* Remember the location of the invalid "<". */
2791 /* Consume the "<". */
2793 /* Parse the template arguments. */
2795 /* Permanently remove the invalid template arguments so that
2796 this error message is not issued again. */
2799 }
2800 }
2802 /* If parsing an integral constant-expression, issue an error message
2803 about the fact that THING appeared and return true. Otherwise,
2804 return false. In either case, set
2805 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2807 static bool
2809 non_integral_constant thing)
2810 {
2813 {
2815 {
2818 {
2825 "enumeration type cannot appear in a "
2916 }
2920 }
2921 }
2923 }
2925 /* Emit a diagnostic for an invalid type name. This function commits
2926 to the current active tentative parse, if any. (Otherwise, the
2927 problematic construct might be encountered again later, resulting
2928 in duplicate error messages.) LOCATION is the location of ID. */
2930 static void
2932 location_t location)
2933 {
2936 /* Try to lookup the identifier. */
2943 /* If the lookup was ambiguous, an error will already have
2944 been issued. */
2946 /* If the lookup found a template-name, it means that the user forgot
2947 to specify an argument list. Emit a useful error message. */
2949 {
2952 decl);
2954 }
2958 /* Something like 'unsigned A a;' */
2961 {
2962 /* Issue an error message. */
2964 /* If we're in a template class, it's possible that the user was
2965 referring to a type from a base class. For example:
2967 template <typename T> struct A { typedef T X; };
2968 template <typename T> struct B : public A<T> { X x; };
2970 The user should have said "typename A<T>::X". */
2984 {
2985 tree b;
2988 b;
2990 {
2994 {
2995 tree field;
2996 /* Go from a particular instantiation of the
2997 template (which will have an empty TYPE_FIELDs),
2998 to the main version. */
3001 field;
3005 {
3010 }
3013 }
3014 }
3015 }
3016 }
3017 /* Here we diagnose qualified-ids where the scope is actually correct,
3018 but the identifier does not resolve to a valid type name. */
3020 {
3022 {
3027 else
3033 }
3036 {
3037 /* A<T>::A<T>() */
3043 }
3050 {
3055 else
3061 }
3062 else
3064 }
3065 }
3067 /* Check for a common situation where a type-name should be present,
3068 but is not, and issue a sensible error message. Returns true if an
3069 invalid type-name was detected.
3071 The situation handled by this function are variable declarations of the
3072 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3073 Usually, `ID' should name a type, but if we got here it means that it
3074 does not. We try to emit the best possible error message depending on
3075 how exactly the id-expression looks like. */
3077 static bool
3079 {
3080 tree id;
3083 /* Avoid duplicate error about ambiguous lookup. */
3085 {
3089 }
3098 /* If the next token is a (, this is a function with no explicit return
3099 type, i.e. constructor, destructor or conversion op. */
3102 {
3105 }
3109 /* Emit a diagnostic for the invalid type. */
3111 out:
3112 /* If we aren't in the middle of a declarator (i.e. in a
3113 parameter-declaration-clause), skip to the end of the declaration;
3114 there's no point in trying to process it. */
3118 }
3120 /* Consume tokens up to, and including, the next non-nested closing `)'.
3121 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3122 are doing error recovery. Returns -1 if OR_COMMA is true and we
3123 found an unnested comma. */
3125 static int
3130 {
3140 {
3144 {
3147 /* If we've run out of tokens, then there is no closing `)'. */
3150 /* This is good for lambda expression capture-lists. */
3160 /* This matches the processing in skip_to_end_of_statement. */
3186 {
3190 }
3195 }
3197 /* Consume the token. */
3199 }
3200 }
3202 /* Consume tokens until we reach the end of the current statement.
3203 Normally, that will be just before consuming a `;'. However, if a
3204 non-nested `}' comes first, then we stop before consuming that. */
3206 static void
3208 {
3211 /* Unwind generic function template scope if necessary. */
3216 {
3220 {
3223 /* If we've run out of tokens, stop. */
3227 /* If the next token is a `;', we have reached the end of the
3228 statement. */
3234 /* If this is a non-nested '}', stop before consuming it.
3235 That way, when confronted with something like:
3237 { 3 + }
3239 we stop before consuming the closing '}', even though we
3240 have not yet reached a `;'. */
3244 /* If it is the closing '}' for a block that we have
3245 scanned, stop -- but only after consuming the token.
3246 That way given:
3248 void f g () { ... }
3249 typedef int I;
3251 we will stop after the body of the erroneously declared
3252 function, but before consuming the following `typedef'
3253 declaration. */
3255 {
3258 }
3266 }
3268 /* Consume the token. */
3270 }
3271 }
3273 /* This function is called at the end of a statement or declaration.
3274 If the next token is a semicolon, it is consumed; otherwise, error
3275 recovery is attempted. */
3277 static void
3279 {
3280 /* Look for the trailing `;'. */
3282 {
3283 /* If there is additional (erroneous) input, skip to the end of
3284 the statement. */
3286 /* If the next token is now a `;', consume it. */
3289 }
3290 }
3292 /* Skip tokens until we have consumed an entire block, or until we
3293 have consumed a non-nested `;'. */
3295 static void
3297 {
3300 /* Unwind generic function template scope if necessary. */
3305 {
3309 {
3312 /* If we've run out of tokens, stop. */
3316 /* Stop if this is an unnested ';'. */
3322 /* Stop if this is an unnested '}', or closes the outermost
3323 nesting level. */
3324 nesting_depth--;
3332 /* Nest. */
3333 nesting_depth++;
3338 }
3340 /* Consume the token. */
3342 }
3343 }
3345 /* Skip tokens until a non-nested closing curly brace is the next
3346 token, or there are no more tokens. Return true in the first case,
3347 false otherwise. */
3349 static bool
3351 {
3355 {
3359 {
3362 /* If we've run out of tokens, stop. */
3366 /* If the next token is a non-nested `}', then we have reached
3367 the end of the current block. */
3373 /* If it the next token is a `{', then we are entering a new
3374 block. Consume the entire block. */
3380 }
3382 /* Consume the token. */
3384 }
3385 }
3387 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3388 parameter is the PRAGMA token, allowing us to purge the entire pragma
3389 sequence. */
3391 static void
3393 {
3398 do
3402 /* Ensure that the pragma is not parsed again. */
3404 }
3406 /* Require pragma end of line, resyncing with it as necessary. The
3407 arguments are as for cp_parser_skip_to_pragma_eol. */
3409 static void
3411 {
3415 }
3417 /* This is a simple wrapper around make_typename_type. When the id is
3418 an unresolved identifier node, we can provide a superior diagnostic
3419 using cp_parser_diagnose_invalid_type_name. */
3421 static tree
3423 location_t id_location)
3424 {
3425 tree result;
3427 {
3433 }
3435 }
3437 /* This is a wrapper around the
3438 make_{pointer,ptrmem,reference}_declarator functions that decides
3439 which one to call based on the CODE and CLASS_TYPE arguments. The
3440 CODE argument should be one of the values returned by
3441 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3442 appertain to the pointer or reference. */
3446 cp_cv_quals cv_qualifiers,
3448 tree attributes)
3449 {
3456 else
3466 }
3468 /* Create a new C++ parser. */
3472 {
3477 /* cp_lexer_new_main is called before doing GC allocation because
3478 cp_lexer_new_main might load a PCH file. */
3481 /* Initialize the binops_by_token so that we can get the tree
3482 directly from the token. */
3490 /* For now, we always accept GNU extensions. */
3493 /* The `>' token is a greater-than operator, not the end of a
3494 template-id. */
3499 /* We are not parsing a constant-expression. */
3504 /* Local variable names are not forbidden. */
3507 /* We are not processing an `extern "C"' declaration. */
3510 /* We are not processing a declarator. */
3513 /* We are not processing a template-argument-list. */
3516 /* We are not in an iteration statement. */
3519 /* We are not in a switch statement. */
3522 /* We are not parsing a type-id inside an expression. */
3525 /* Declarations aren't implicitly extern "C". */
3528 /* String literals should be translated to the execution character set. */
3531 /* We are not parsing a function body. */
3534 /* We can correct until told otherwise. */
3537 /* The unparsed function queue is empty. */
3540 /* There are no classes being defined. */
3543 /* No template parameters apply. */
3546 /* Not declaring an implicit function template. */
3553 }
3555 /* Create a cp_lexer structure which will emit the tokens in CACHE
3556 and push it onto the parser's lexer stack. This is used for delayed
3557 parsing of in-class method bodies and default arguments, and should
3558 not be confused with tentative parsing. */
3559 static void
3561 {
3566 /* Move the current source position to that of the first token in the
3567 new lexer. */
3569 }
3571 /* Pop the top lexer off the parser stack. This is never used for the
3572 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3573 static void
3575 {
3580 /* Put the current source position back where it was before this
3581 lexer was pushed. */
3583 }
3585 /* Lexical conventions [gram.lex] */
3587 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3588 identifier. */
3590 static tree
3592 {
3595 /* Look for the identifier. */
3597 /* Return the value. */
3599 }
3601 /* Parse a sequence of adjacent string constants. Returns a
3602 TREE_STRING representing the combined, nul-terminated string
3603 constant. If TRANSLATE is true, translate the string to the
3604 execution character set. If WIDE_OK is true, a wide string is
3605 invalid here.
3607 C++98 [lex.string] says that if a narrow string literal token is
3608 adjacent to a wide string literal token, the behavior is undefined.
3609 However, C99 6.4.5p4 says that this results in a wide string literal.
3610 We follow C99 here, for consistency with the C front end.
3612 This code is largely lifted from lex_string() in c-lex.c.
3614 FUTURE: ObjC++ will need to handle @-strings here. */
3615 static tree
3618 {
3619 tree value;
3626 tree string_tree;
3632 {
3635 }
3638 {
3642 }
3643 else
3644 {
3647 }
3650 /* Try to avoid the overhead of creating and destroying an obstack
3651 for the common case of just one string. */
3654 {
3662 {
3666 }
3667 else
3671 }
3672 else
3673 {
3677 do
3678 {
3680 count++;
3685 {
3688 {
3691 }
3694 {
3699 }
3701 }
3702 else
3706 {
3711 "unsupported non-standard concatenation "
3713 }
3719 {
3723 }
3724 else
3725 {
3729 }
3730 }
3734 }
3737 {
3740 }
3744 {
3749 {
3764 }
3769 {
3774 else
3776 }
3777 }
3778 else
3779 /* cpp_interpret_string has issued an error. */
3786 }
3788 /* Look up a literal operator with the name and the exact arguments. */
3790 static tree
3792 {
3799 {
3805 {
3808 {
3818 }
3821 /* May be this should be sufficient_parms_p instead,
3822 depending on how exactly should user-defined literals
3823 work in presence of default arguments on the literal
3824 operator parameters. */
3827 }
3828 }
3831 }
3833 /* Parse a user-defined char constant. Returns a call to a user-defined
3834 literal operator taking the character as an argument. */
3836 static tree
3838 {
3846 /* Build up a call to the user-defined operator */
3847 /* Lookup the name we got back from the id-expression. */
3852 {
3857 }
3861 }
3863 /* A subroutine of cp_parser_userdef_numeric_literal to
3864 create a char... template parameter pack from a string node. */
3866 static tree
3868 {
3869 tree charvec;
3875 /* Fill in CHARVEC with all of the parameters. */
3880 /* Build the argument packs. */
3887 }
3889 /* A subroutine of cp_parser_userdef_numeric_literal to
3890 create a char... template parameter pack from a string node. */
3892 static tree
3894 {
3895 tree charvec;
3906 /* First template parm is character type. */
3909 /* Fill in CHARVEC with all of the parameters. */
3916 /* Build the argument packs. */
3923 }
3925 /* Parse a user-defined numeric constant. returns a call to a user-defined
3926 literal operator. */
3928 static tree
3930 {
3941 /* Look for a literal operator taking the exact type of numeric argument
3942 as the literal value. */
3947 {
3949 tf_warning_or_error);
3952 {
3955 long_long_unsigned_type_node);
3956 }
3957 else
3958 {
3962 long_double_type_node);
3966 }
3970 }
3973 /* If the numeric argument didn't work, look for a raw literal
3974 operator taking a const char* argument consisting of the number
3975 in string format. */
3980 {
3982 tf_warning_or_error);
3985 }
3988 /* If the raw literal didn't work, look for a non-type template
3989 function with parameter pack char.... Call the function with
3990 template parameter characters representing the number. */
3994 {
3998 tf_warning_or_error);
4001 }
4010 }
4012 /* Parse a user-defined string constant. Returns a call to a user-defined
4013 literal operator taking a character pointer and the length of the string
4014 as arguments. */
4016 static tree
4018 {
4027 /* Build up a call to the user-defined operator. */
4028 /* Lookup the name we got back from the id-expression. */
4035 {
4037 tf_warning_or_error);
4040 }
4043 /* Look for a template function with typename parameter CharT
4044 and parameter pack CharT... Call the function with
4045 template parameter characters representing the string. */
4049 {
4053 tf_warning_or_error);
4056 }
4062 }
4065 /* Basic concepts [gram.basic] */
4067 /* Parse a translation-unit.
4069 translation-unit:
4070 declaration-seq [opt]
4072 Returns TRUE if all went well. */
4074 static bool
4076 {
4077 /* The address of the first non-permanent object on the declarator
4078 obstack. */
4083 /* Create the declarator obstack, if necessary. */
4085 {
4087 /* Create the error declarator. */
4089 /* Create the empty parameter list. */
4091 /* Remember where the base of the declarator obstack lies. */
4093 }
4097 /* If there are no tokens left then all went well. */
4099 {
4100 /* Get rid of the token array; we don't need it any more. */
4104 /* This file might have been a context that's implicitly extern
4105 "C". If so, pop the lang context. (Only relevant for PCH.) */
4107 {
4110 }
4112 /* Finish up. */
4116 }
4117 else
4118 {
4121 }
4123 /* Make sure the declarator obstack was fully cleaned up. */
4127 /* All went well. */
4129 }
4131 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4132 decltype context. */
4136 {
4141 }
4143 /* We're about to parse a collection of statements. If we're currently
4144 parsing tentatively, set up a firewall so that any nested
4145 cp_parser_commit_to_tentative_parse won't affect the current context. */
4147 static cp_token_position
4149 {
4156 }
4158 /* We've finished parsing the collection of statements. Wrap up the
4159 firewall and replace the relevant tokens with the parsed form. */
4161 static void
4163 tree expr)
4164 {
4168 /* Finish the firewall level. */
4170 /* And remember the result of the parse for when we try again. */
4176 }
4178 /* Parse a GNU statement-expression, i.e. ({ stmts }), except for the
4179 enclosing parentheses. */
4181 static tree
4183 {
4186 /* Consume the '('. */
4188 /* Start the statement-expression. */
4190 /* Parse the compound-statement. */
4192 /* Finish up. */
4194 /* Consume the ')'. */
4200 }
4202 /* Expressions [gram.expr] */
4204 /* Parse a primary-expression.
4206 primary-expression:
4207 literal
4208 this
4209 ( expression )
4210 id-expression
4211 lambda-expression (C++11)
4213 GNU Extensions:
4215 primary-expression:
4216 ( compound-statement )
4217 __builtin_va_arg ( assignment-expression , type-id )
4218 __builtin_offsetof ( type-id , offsetof-expression )
4220 C++ Extensions:
4221 __has_nothrow_assign ( type-id )
4222 __has_nothrow_constructor ( type-id )
4223 __has_nothrow_copy ( type-id )
4224 __has_trivial_assign ( type-id )
4225 __has_trivial_constructor ( type-id )
4226 __has_trivial_copy ( type-id )
4227 __has_trivial_destructor ( type-id )
4228 __has_virtual_destructor ( type-id )
4229 __is_abstract ( type-id )
4230 __is_base_of ( type-id , type-id )
4231 __is_class ( type-id )
4232 __is_empty ( type-id )
4233 __is_enum ( type-id )
4234 __is_final ( type-id )
4235 __is_literal_type ( type-id )
4236 __is_pod ( type-id )
4237 __is_polymorphic ( type-id )
4238 __is_std_layout ( type-id )
4239 __is_trivial ( type-id )
4240 __is_union ( type-id )
4242 Objective-C++ Extension:
4244 primary-expression:
4245 objc-expression
4247 literal:
4248 __null
4250 ADDRESS_P is true iff this expression was immediately preceded by
4251 "&" and therefore might denote a pointer-to-member. CAST_P is true
4252 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4253 true iff this expression is a template argument.
4255 Returns a representation of the expression. Upon return, *IDK
4256 indicates what kind of id-expression (if any) was present. */
4258 static tree
4265 {
4268 /* Assume the primary expression is not an id-expression. */
4271 /* Peek at the next token. */
4274 {
4275 /* literal:
4276 integer-literal
4277 character-literal
4278 floating-literal
4279 string-literal
4280 boolean-literal
4281 pointer-literal
4282 user-defined-literal */
4294 {
4298 }
4299 /* Floating-point literals are only allowed in an integral
4300 constant expression if they are cast to an integral or
4301 enumeration type. */
4305 {
4306 /* CAST_P will be set even in invalid code like "int(2.7 +
4307 ...)". Therefore, we have to check that the next token
4308 is sure to end the cast. */
4310 {
4315 enumerator-definition. */
4317 /* The curly brace at the end of an enum-specifier. */
4319 /* The end of a statement. */
4321 /* The end of the cast-expression. */
4323 /* The end of an array bound. */
4325 /* The closing ">" in a template-argument-list. */
4328 /* C++0x only: A ">>" treated like two ">" tokens,
4329 in a template-argument-list. */
4334 }
4336 /* If we are within a cast, then the constraint that the
4337 cast is to an integral or enumeration type will be
4338 checked at that point. If we are not within a cast, then
4339 this code is invalid. */
4342 }
4362 /* ??? Should wide strings be allowed when parser->translate_strings_p
4363 is false (i.e. in attributes)? If not, we can kill the third
4364 argument to cp_parser_string_literal. */
4370 /* If we see `( { ' then we are looking at the beginning of
4371 a GNU statement-expression. */
4374 {
4375 /* Statement-expressions are not allowed by the standard. */
4379 /* And they're not allowed outside of a function-body; you
4380 cannot, for example, write:
4382 int i = ({ int j = 3; j + 1; });
4384 at class or namespace scope. */
4387 {
4389 "statement-expressions are not allowed outside "
4395 }
4396 else
4398 }
4399 /* Otherwise it's a normal parenthesized expression. */
4400 {
4401 tree expr;
4404 /* Consume the `('. */
4406 /* Within a parenthesized expression, a `>' token is always
4407 the greater-than operator. */
4408 saved_greater_than_is_operator_p
4412 /* Parse the parenthesized expression. */
4414 /* Let the front end know that this expression was
4415 enclosed in parentheses. This matters in case, for
4416 example, the expression is of the form `A::B', since
4417 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4418 not. */
4420 /* DR 705: Wrapping an unqualified name in parentheses
4421 suppresses arg-dependent lookup. We want to pass back
4422 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4423 (c++/37862), but none of the others. */
4427 /* The `>' token might be the end of a template-id or
4428 template-parameter-list now. */
4429 parser->greater_than_is_operator_p
4431 /* Consume the `)'. */
4436 }
4439 {
4441 {
4442 /* We might have an Objective-C++ message. */
4445 /* If that works out, we're done ... */
4448 /* ... else, fall though to see if it's a lambda. */
4449 }
4451 /* Don't warn about a failed tentative parse. */
4456 }
4460 /* We have an Objective-C++ string literal. */
4467 {
4468 /* These two are the boolean literals. */
4476 /* The `__null' literal. */
4481 /* The `nullptr' literal. */
4486 /* Recognize the `this' keyword. */
4490 {
4494 }
4495 /* Pointers cannot appear in constant-expressions. */
4500 /* The `operator' keyword can be the beginning of an
4501 id-expression. */
4508 {
4509 non_integral_constant name;
4511 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4512 __func__ are the names of variables -- but they are
4513 treated specially. Therefore, they are handled here,
4514 rather than relying on the generic id-expression logic
4515 below. Grammatically, these names are id-expressions.
4517 Consume the token. */
4521 {
4533 }
4538 /* Look up the name. */
4540 }
4543 {
4544 tree expression;
4545 tree type;
4546 source_location type_location;
4548 /* The `__builtin_va_arg' construct is used to handle
4549 `va_arg'. Consume the `__builtin_va_arg' token. */
4551 /* Look for the opening `('. */
4553 /* Now, parse the assignment-expression. */
4555 /* Look for the `,'. */
4558 /* Parse the type-id. */
4560 /* Look for the closing `)'. */
4562 /* Using `va_arg' in a constant-expression is not
4563 allowed. */
4565 NIC_VA_ARG))
4568 }
4598 /* Objective-C++ expressions. */
4608 {
4613 }
4617 }
4619 /* An id-expression can start with either an identifier, a
4620 `::' as the beginning of a qualified-id, or the "operator"
4621 keyword. */
4626 {
4627 tree id_expression;
4628 tree decl;
4634 id_expression:
4635 /* Parse the id-expression. */
4636 id_expression
4653 /* If we have a template-id, then no further lookup is
4654 required. If the template-id was for a template-class, we
4655 will sometimes have a TYPE_DECL at this point. */
4659 /* Look up the name. */
4660 else
4661 {
4662 tree ambiguous_decls;
4664 /* If we already know that this lookup is ambiguous, then
4665 we've already issued an error message; there's no reason
4666 to check again. */
4669 {
4672 }
4675 none_type,
4676 template_p,
4681 /* If the lookup was ambiguous, an error will already have
4682 been issued. */
4686 /* In Objective-C++, we may have an Objective-C 2.0
4687 dot-syntax for classes here. */
4692 {
4693 tree component;
4700 }
4702 /* In Objective-C++, an instance variable (ivar) may be preferred
4703 to whatever cp_parser_lookup_name() found. */
4706 /* If name lookup gives us a SCOPE_REF, then the
4707 qualifying scope was dependent. */
4709 {
4710 /* At this point, we do not know if DECL is a valid
4711 integral constant expression. We assume that it is
4712 in fact such an expression, so that code like:
4714 template <int N> struct A {
4715 int a[B<N>::i];
4716 };
4718 is accepted. At template-instantiation time, we
4719 will check that B<N>::i is actually a constant. */
4721 }
4722 /* Check to see if DECL is a local variable in a context
4723 where that is forbidden. */
4726 {
4727 /* It might be that we only found DECL because we are
4728 trying to be generous with pre-ISO scoping rules.
4729 For example, consider:
4731 int i;
4732 void g() {
4733 for (int i = 0; i < 10; ++i) {}
4734 extern void f(int j = i);
4735 }
4737 Here, name look up will originally find the out
4738 of scope `i'. We need to issue a warning message,
4739 but then use the global `i'. */
4742 {
4745 decl);
4747 }
4748 }
4749 }
4751 decl = (finish_id_expression
4753 idk,
4758 template_arg_p,
4764 }
4766 /* Anything else is an error. */
4770 }
4771 }
4779 {
4782 }
4784 /* Parse an id-expression.
4786 id-expression:
4787 unqualified-id
4788 qualified-id
4790 qualified-id:
4791 :: [opt] nested-name-specifier template [opt] unqualified-id
4792 :: identifier
4793 :: operator-function-id
4794 :: template-id
4796 Return a representation of the unqualified portion of the
4797 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4798 a `::' or nested-name-specifier.
4800 Often, if the id-expression was a qualified-id, the caller will
4801 want to make a SCOPE_REF to represent the qualified-id. This
4802 function does not do this in order to avoid wastefully creating
4803 SCOPE_REFs when they are not required.
4805 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4806 `template' keyword.
4808 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4809 uninstantiated templates.
4811 If *TEMPLATE_P is non-NULL, it is set to true iff the
4812 `template' keyword is used to explicitly indicate that the entity
4813 named is a template.
4815 If DECLARATOR_P is true, the id-expression is appearing as part of
4816 a declarator, rather than as part of an expression. */
4818 static tree
4825 {
4829 /* Assume the `template' keyword was not used. */
4833 /* Look for the optional `::' operator. */
4834 global_scope_p
4837 /* Look for the optional nested-name-specifier. */
4838 nested_name_specifier_p
4841 check_dependency_p,
4843 declarator_p)
4845 /* If there is a nested-name-specifier, then we are looking at
4846 the first qualified-id production. */
4848 {
4849 tree saved_scope;
4850 tree saved_object_scope;
4851 tree saved_qualifying_scope;
4852 tree unqualified_id;
4855 /* See if the next token is the `template' keyword. */
4859 /* Name lookup we do during the processing of the
4860 unqualified-id might obliterate SCOPE. */
4864 /* Process the final unqualified-id. */
4866 check_dependency_p,
4867 declarator_p,
4869 /* Restore the SAVED_SCOPE for our caller. */
4875 }
4876 /* Otherwise, if we are in global scope, then we are looking at one
4877 of the other qualified-id productions. */
4879 {
4881 tree id;
4883 /* Peek at the next token. */
4886 /* If it's an identifier, and the next token is not a "<", then
4887 we can avoid the template-id case. This is an optimization
4888 for this common case. */
4890 && !cp_parser_nth_token_starts_template_argument_list_p
4895 /* Try a template-id. */
4899 none_type,
4900 declarator_p);
4901 /* If that worked, we're done. */
4905 /* Peek at the next token. (Changes in the token buffer may
4906 have invalidated the pointer obtained above.) */
4910 {
4917 /* Fall through. */
4922 }
4923 }
4924 else
4927 declarator_p,
4928 optional_p);
4929 }
4931 /* Parse an unqualified-id.
4933 unqualified-id:
4934 identifier
4935 operator-function-id
4936 conversion-function-id
4937 ~ class-name
4938 template-id
4940 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4941 keyword, in a construct like `A::template ...'.
4943 Returns a representation of unqualified-id. For the `identifier'
4944 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4945 production a BIT_NOT_EXPR is returned; the operand of the
4946 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4947 other productions, see the documentation accompanying the
4948 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4949 names are looked up in uninstantiated templates. If DECLARATOR_P
4950 is true, the unqualified-id is appearing as part of a declarator,
4951 rather than as part of an expression. */
4953 static tree
4959 {
4962 /* Peek at the next token. */
4966 {
4968 {
4969 tree id;
4971 /* We don't know yet whether or not this will be a
4972 template-id. */
4974 /* Try a template-id. */
4976 check_dependency_p,
4977 none_type,
4978 declarator_p);
4979 /* If it worked, we're done. */
4982 /* Otherwise, it's an ordinary identifier. */
4984 }
4988 check_dependency_p,
4989 none_type,
4990 declarator_p);
4993 {
4994 tree type_decl;
4995 tree qualifying_scope;
4996 tree object_scope;
4997 tree scope;
5000 /* Consume the `~' token. */
5002 /* Parse the class-name. The standard, as written, seems to
5003 say that:
5005 template <typename T> struct S { ~S (); };
5006 template <typename T> S<T>::~S() {}
5008 is invalid, since `~' must be followed by a class-name, but
5009 `S<T>' is dependent, and so not known to be a class.
5010 That's not right; we need to look in uninstantiated
5011 templates. A further complication arises from:
5013 template <typename T> void f(T t) {
5014 t.T::~T();
5015 }
5017 Here, it is not possible to look up `T' in the scope of `T'
5018 itself. We must look in both the current scope, and the
5019 scope of the containing complete expression.
5021 Yet another issue is:
5023 struct S {
5024 int S;
5025 ~S();
5026 };
5028 S::~S() {}
5030 The standard does not seem to say that the `S' in `~S'
5031 should refer to the type `S' and not the data member
5032 `S::S'. */
5034 /* DR 244 says that we look up the name after the "~" in the
5035 same scope as we looked up the qualifying name. That idea
5036 isn't fully worked out; it's more complicated than that. */
5041 /* Check for invalid scopes. */
5043 {
5047 }
5049 {
5053 scope);
5058 }
5061 /* If the name is of the form "X::~X" it's OK even if X is a
5062 typedef. */
5071 {
5074 }
5076 /* ~auto means the destructor of whatever the object is. */
5078 {
5081 "%<~auto%> only available with "
5085 }
5087 /* If there was an explicit qualification (S::~T), first look
5088 in the scope given by the qualification (i.e., S).
5090 Note: in the calls to cp_parser_class_name below we pass
5091 typename_type so that lookup finds the injected-class-name
5092 rather than the constructor. */
5096 {
5101 typename_type,
5104 declarator_p);
5107 }
5108 /* In "N::S::~S", look in "N" as well. */
5110 {
5115 type_decl
5119 typename_type,
5122 declarator_p);
5125 }
5126 /* In "p->S::~T", look in the scope given by "*p" as well. */
5128 {
5133 type_decl
5137 typename_type,
5140 declarator_p);
5143 }
5144 /* Look in the surrounding context. */
5146 {
5152 type_decl
5156 typename_type,
5159 declarator_p);
5162 {
5163 /* We couldn't find a type with this name, so just accept
5164 it and check for a match at instantiation time. */
5169 }
5170 }
5171 /* If an error occurred, assume that the name of the
5172 destructor is the same as the name of the qualifying
5173 class. That allows us to keep parsing after running
5174 into ill-formed destructor names. */
5180 /* Check that destructor name and scope match. */
5182 {
5189 }
5191 /* [class.dtor]
5193 A typedef-name that names a class shall not be used as the
5194 identifier in the declarator for a destructor declaration. */
5201 type_decl);
5204 }
5208 {
5209 tree id;
5211 /* This could be a template-id, so we try that first. */
5213 /* Try a template-id. */
5216 none_type,
5217 declarator_p);
5218 /* If that worked, we're done. */
5221 /* We still don't know whether we're looking at an
5222 operator-function-id or a conversion-function-id. */
5224 /* Try an operator-function-id. */
5226 /* If that didn't work, try a conversion-function-id. */
5230 {
5231 /* 17.6.3.3.5 */
5237 }
5240 }
5241 /* Fall through. */
5248 }
5249 }
5251 /* Parse an (optional) nested-name-specifier.
5253 nested-name-specifier: [C++98]
5254 class-or-namespace-name :: nested-name-specifier [opt]
5255 class-or-namespace-name :: template nested-name-specifier [opt]
5257 nested-name-specifier: [C++0x]
5258 type-name ::
5259 namespace-name ::
5260 nested-name-specifier identifier ::
5261 nested-name-specifier template [opt] simple-template-id ::
5263 PARSER->SCOPE should be set appropriately before this function is
5264 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5265 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5266 in name lookups.
5268 Sets PARSER->SCOPE to the class (TYPE) or namespace
5269 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5270 it unchanged if there is no nested-name-specifier. Returns the new
5271 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5273 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5274 part of a declaration and/or decl-specifier. */
5276 static tree
5282 {
5287 /* Remember where the nested-name-specifier starts. */
5289 {
5292 }
5295 {
5296 tree new_scope;
5297 tree old_scope;
5298 tree saved_qualifying_scope;
5301 /* Spot cases that cannot be the beginning of a
5302 nested-name-specifier. */
5305 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5306 the already parsed nested-name-specifier. */
5308 {
5309 /* Grab the nested-name-specifier and continue the loop. */
5311 /* If we originally encountered this nested-name-specifier
5312 with IS_DECLARATION set to false, we will not have
5313 resolved TYPENAME_TYPEs, so we must do so here. */
5316 {
5321 }
5324 }
5326 /* Spot cases that cannot be the beginning of a
5327 nested-name-specifier. On the second and subsequent times
5328 through the loop, we look for the `template' keyword. */
5330 ;
5331 /* A template-id can start a nested-name-specifier. */
5333 ;
5334 /* DR 743: decltype can be used in a nested-name-specifier. */
5336 ;
5337 else
5338 {
5339 /* If the next token is not an identifier, then it is
5340 definitely not a type-name or namespace-name. */
5343 /* If the following token is neither a `<' (to begin a
5344 template-id), nor a `::', then we are not looking at a
5345 nested-name-specifier. */
5351 {
5355 }
5358 && !cp_parser_nth_token_starts_template_argument_list_p
5361 }
5363 /* The nested-name-specifier is optional, so we parse
5364 tentatively. */
5367 /* Look for the optional `template' keyword, if this isn't the
5368 first time through the loop. */
5371 else
5374 /* Save the old scope since the name lookup we are about to do
5375 might destroy it. */
5378 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5379 look up names in "X<T>::I" in order to determine that "Y" is
5380 a template. So, if we have a typename at this point, we make
5381 an effort to look through it. */
5383 && !typename_keyword_p
5388 /* Parse the qualifying entity. */
5389 new_scope
5391 typename_keyword_p,
5392 template_keyword_p,
5393 check_dependency_p,
5394 type_p,
5395 is_declaration);
5396 /* Look for the `::' token. */
5399 /* If we found what we wanted, we keep going; otherwise, we're
5400 done. */
5402 {
5405 /* Restore the OLD_SCOPE since it was valid before the
5406 failed attempt at finding the last
5407 class-or-namespace-name. */
5411 /* If the next token is a decltype, and the one after that is a
5412 `::', then the decltype has failed to resolve to a class or
5413 enumeration type. Give this error even when parsing
5414 tentatively since it can't possibly be valid--and we're going
5415 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5416 won't get another chance.*/
5420 {
5427 /* As below. */
5430 }
5434 {
5435 /* If we have a non-type template-id followed by ::, it can't
5436 possibly be valid. */
5441 {
5444 {
5450 }
5451 else
5452 {
5453 /* Variable template. */
5458 }
5465 /* As below. */
5469 }
5470 }
5474 /* If the next token is an identifier, and the one after
5475 that is a `::', then any valid interpretation would have
5476 found a class-or-namespace-name. */
5482 {
5485 {
5487 {
5488 tree decl;
5489 tree ambiguous_decls;
5492 none_type,
5501 decl);
5503 {
5504 // cp_parser_lookup_name has the same diagnostic,
5505 // thus make sure to emit it at most once.
5508 {
5513 }
5515 }
5516 else
5517 {
5519 cp_parser_name_lookup_error
5522 else
5523 cp_parser_name_lookup_error
5526 }
5527 }
5530 /* Treat this as a successful nested-name-specifier
5531 due to:
5533 [basic.lookup.qual]
5535 If the name found is not a class-name (clause
5536 _class_) or namespace-name (_namespace.def_), the
5537 program is ill-formed. */
5539 }
5541 }
5543 }
5544 /* We've found one valid nested-name-specifier. */
5546 /* Name lookup always gives us a DECL. */
5549 /* Uses of "template" must be followed by actual templates. */
5561 new_scope);
5562 /* If it is a class scope, try to complete it; we are about to
5563 be looking up names inside the class. */
5565 /* Since checking types for dependency can be expensive,
5566 avoid doing it if the type is already complete. */
5568 /* Do not try to complete dependent types. */
5570 {
5572 /* If it is a typedef to current class, use the current
5573 class instead, as the typedef won't have any names inside
5574 it yet. */
5578 }
5579 /* Make sure we look in the right scope the next time through
5580 the loop. */
5582 }
5584 /* If parsing tentatively, replace the sequence of tokens that makes
5585 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5586 token. That way, should we re-parse the token stream, we will
5587 not have to repeat the effort required to do the parse, nor will
5588 we issue duplicate error messages. */
5590 {
5594 /* Reset the contents of the START token. */
5596 /* Retrieve any deferred checks. Do not pop this access checks yet
5597 so the memory will not be reclaimed during token replacing below. */
5605 /* Purge all subsequent tokens. */
5607 }
5613 }
5615 /* Parse a nested-name-specifier. See
5616 cp_parser_nested_name_specifier_opt for details. This function
5617 behaves identically, except that it will an issue an error if no
5618 nested-name-specifier is present. */
5620 static tree
5626 {
5627 tree scope;
5629 /* Look for the nested-name-specifier. */
5631 typename_keyword_p,
5632 check_dependency_p,
5633 type_p,
5634 is_declaration);
5635 /* If it was not present, issue an error message. */
5637 {
5640 }
5643 }
5645 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5646 this is either a class-name or a namespace-name (which corresponds
5647 to the class-or-namespace-name production in the grammar). For
5648 C++0x, it can also be a type-name that refers to an enumeration
5649 type or a simple-template-id.
5651 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5652 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5653 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5654 TYPE_P is TRUE iff the next name should be taken as a class-name,
5655 even the same name is declared to be another entity in the same
5656 scope.
5658 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5659 specified by the class-or-namespace-name. If neither is found the
5660 ERROR_MARK_NODE is returned. */
5662 static tree
5669 {
5670 tree saved_scope;
5671 tree saved_qualifying_scope;
5672 tree saved_object_scope;
5673 tree scope;
5677 /* DR 743: decltype can appear in a nested-name-specifier. */
5679 {
5683 {
5686 }
5690 }
5692 /* Before we try to parse the class-name, we must save away the
5693 current PARSER->SCOPE since cp_parser_class_name will destroy
5694 it. */
5698 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5699 there is no need to look for a namespace-name. */
5700 only_class_p = template_keyword_p
5705 typename_keyword_p,
5706 template_keyword_p,
5708 check_dependency_p,
5710 is_declaration,
5713 /* If that didn't work, try for a namespace-name. */
5715 {
5716 /* Restore the saved scope. */
5720 /* If we are not looking at an identifier followed by the scope
5721 resolution operator, then this is not part of a
5722 nested-name-specifier. (Note that this function is only used
5723 to parse the components of a nested-name-specifier.) */
5728 }
5731 }
5733 /* Return true if we are looking at a compound-literal, false otherwise. */
5735 static bool
5737 {
5738 /* Consume the `('. */
5743 /* Skip tokens until the next token is a closing parenthesis.
5744 If we find the closing `)', and the next token is a `{', then
5745 we are looking at a compound-literal. */
5746 bool compound_literal_p
5751 /* Roll back the tokens we skipped. */
5755 }
5757 /* Parse a postfix-expression.
5759 postfix-expression:
5760 primary-expression
5761 postfix-expression [ expression ]
5762 postfix-expression ( expression-list [opt] )
5763 simple-type-specifier ( expression-list [opt] )
5764 typename :: [opt] nested-name-specifier identifier
5765 ( expression-list [opt] )
5766 typename :: [opt] nested-name-specifier template [opt] template-id
5767 ( expression-list [opt] )
5768 postfix-expression . template [opt] id-expression
5769 postfix-expression -> template [opt] id-expression
5770 postfix-expression . pseudo-destructor-name
5771 postfix-expression -> pseudo-destructor-name
5772 postfix-expression ++
5773 postfix-expression --
5774 dynamic_cast < type-id > ( expression )
5775 static_cast < type-id > ( expression )
5776 reinterpret_cast < type-id > ( expression )
5777 const_cast < type-id > ( expression )
5778 typeid ( expression )
5779 typeid ( type-id )
5781 GNU Extension:
5783 postfix-expression:
5784 ( type-id ) { initializer-list , [opt] }
5786 This extension is a GNU version of the C99 compound-literal
5787 construct. (The C99 grammar uses `type-name' instead of `type-id',
5788 but they are essentially the same concept.)
5790 If ADDRESS_P is true, the postfix expression is the operand of the
5791 `&' operator. CAST_P is true if this expression is the target of a
5792 cast.
5794 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5795 class member access expressions [expr.ref].
5797 Returns a representation of the expression. */
5799 static tree
5803 {
5805 location_t loc;
5812 /* Peek at the next token. */
5815 /* Some of the productions are determined by keywords. */
5818 {
5823 {
5824 tree type;
5825 tree expression;
5829 /* All of these can be handled in the same way from the point
5830 of view of parsing. Begin by consuming the token
5831 identifying the cast. */
5834 /* New types cannot be defined in the cast. */
5836 parser->type_definition_forbidden_message
5839 /* Look for the opening `<'. */
5841 /* Parse the type to which we are casting. */
5846 /* Look for the closing `>'. */
5848 /* Restore the old message. */
5851 bool saved_greater_than_is_operator_p
5855 /* And the expression which is being cast. */
5860 parser->greater_than_is_operator_p
5863 /* Only type conversions to integral or enumeration types
5864 can be used in constant-expressions. */
5870 {
5872 postfix_expression
5876 postfix_expression
5880 postfix_expression
5882 tf_warning_or_error);
5885 postfix_expression
5890 }
5891 }
5895 {
5896 tree type;
5900 /* Consume the `typeid' token. */
5902 /* Look for the `(' token. */
5904 /* Types cannot be defined in a `typeid' expression. */
5906 parser->type_definition_forbidden_message
5908 /* We can't be sure yet whether we're looking at a type-id or an
5909 expression. */
5911 /* Try a type-id first. */
5916 /* Look for the `)' token. Otherwise, we can't be sure that
5917 we're not looking at an expression: consider `typeid (int
5918 (3))', for example. */
5920 /* If all went well, simply lookup the type-id. */
5923 /* Otherwise, fall back to the expression variant. */
5924 else
5925 {
5926 tree expression;
5928 /* Look for an expression. */
5930 /* Compute its typeid. */
5932 /* Look for the `)' token. */
5934 }
5935 /* Restore the saved message. */
5937 /* `typeid' may not appear in an integral constant expression. */
5940 }
5944 {
5945 tree type;
5946 /* The syntax permitted here is the same permitted for an
5947 elaborated-type-specifier. */
5952 }
5956 {
5960 {
5965 }
5967 {
5972 }
5973 else
5974 {
5975 /* Consecutive _Cilk_spawns are not allowed in a statement. */
5978 }
5980 postfix_expression =
5984 {
5988 }
5990 {
5995 }
5996 else
5997 {
5999 postfix_expression);
6003 }
6005 }
6008 {
6011 tree p;
6025 tf_warning_or_error);
6028 tf_warning_or_error);
6029 else
6030 {
6034 }
6036 }
6039 {
6040 tree type;
6042 /* If the next thing is a simple-type-specifier, we may be
6043 looking at a functional cast. We could also be looking at
6044 an id-expression. So, we try the functional cast, and if
6045 that doesn't work we fall back to the primary-expression. */
6047 /* Look for the simple-type-specifier. */
6050 CP_PARSER_FLAGS_NONE);
6051 /* Parse the cast itself. */
6053 postfix_expression
6055 /* If that worked, we're done. */
6059 /* If the functional-cast didn't work out, try a
6060 compound-literal. */
6063 {
6068 /* Avoid calling cp_parser_type_id pointlessly, see comment
6069 in cp_parser_cast_expression about c++/29234. */
6072 else
6073 {
6074 /* Parse the type. */
6079 /* Look for the `)'. */
6081 }
6083 /* If things aren't going well, there's no need to
6084 keep going. */
6086 {
6088 /* Parse the brace-enclosed initializer list. */
6091 }
6092 /* If that worked, we're definitely looking at a
6093 compound-literal expression. */
6095 {
6096 /* Warn the user that a compound literal is not
6097 allowed in standard C++. */
6100 /* For simplicity, we disallow compound literals in
6101 constant-expressions. We could
6102 allow compound literals of integer type, whose
6103 initializer was a constant, in constant
6104 expressions. Permitting that usage, as a further
6105 extension, would not change the meaning of any
6106 currently accepted programs. (Of course, as
6107 compound literals are not part of ISO C++, the
6108 standard has nothing to say.) */
6110 NIC_NCC))
6111 {
6114 }
6115 /* Form the representation of the compound-literal. */
6116 postfix_expression
6118 tf_warning_or_error);
6120 }
6121 }
6123 /* It must be a primary-expression. */
6124 postfix_expression
6127 decltype_p,
6129 }
6131 }
6133 /* Note that we don't need to worry about calling build_cplus_new on a
6134 class-valued CALL_EXPR in decltype when it isn't the end of the
6135 postfix-expression; unary_complex_lvalue will take care of that for
6136 all these cases. */
6138 /* Keep looping until the postfix-expression is complete. */
6140 {
6144 /* It is not a Koenig lookup function call. */
6145 postfix_expression
6148 /* Peek at the next token. */
6152 {
6155 {
6157 "two consecutive %<[%> shall "
6160 }
6161 postfix_expression
6163 postfix_expression,
6165 decltype_p);
6171 /* postfix-expression ( expression-list [opt] ) */
6172 {
6182 is_builtin_constant_p
6185 {
6186 /* The whole point of __builtin_constant_p is to allow
6187 non-constant expressions to appear as arguments. */
6188 saved_integral_constant_expression_p
6190 saved_non_integral_constant_expression_p
6193 }
6194 args = (cp_parser_parenthesized_expression_list
6200 {
6201 parser->integral_constant_expression_p
6203 parser->non_integral_constant_expression_p
6205 }
6208 {
6211 }
6213 /* Function calls are not permitted in
6214 constant-expressions. */
6217 NIC_FUNC_CALL))
6218 {
6222 }
6227 {
6229 {
6231 {
6234 postfix_expression
6236 complain);
6237 }
6238 else
6239 postfix_expression
6241 }
6242 /* We do not perform argument-dependent lookup if
6243 normal lookup finds a non-function, in accordance
6244 with the expected resolution of DR 218. */
6247 {
6251 /* Do not do argument dependent lookup if regular
6252 lookup finds a member function or a block-scope
6253 function declaration. [basic.lookup.argdep]/3 */
6256 {
6259 postfix_expression
6261 complain);
6262 }
6263 }
6264 }
6267 {
6277 "%<memset%> used with constant zero length "
6278 "parameter; this could be due to transposed "
6281 /* Replace LITERAL_ZERO_P INTEGER_CSTs with normal ones
6282 to avoid leaking those into folder and middle-end. */
6284 tree arg;
6288 }
6291 {
6301 {
6302 postfix_expression
6306 }
6309 {
6310 postfix_expression
6311 = (build_new_method_call
6317 complain));
6318 }
6319 else
6320 postfix_expression
6324 complain);
6325 }
6329 postfix_expression = (build_offset_ref_call_from_tree
6331 complain));
6333 /* A call to a static class member, or a namespace-scope
6334 function. */
6335 postfix_expression
6338 koenig_p,
6339 complain);
6340 else
6341 /* All other function calls. */
6342 postfix_expression
6345 koenig_p,
6346 complain);
6350 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6354 }
6359 /* postfix-expression . template [opt] id-expression
6360 postfix-expression . pseudo-destructor-name
6361 postfix-expression -> template [opt] id-expression
6362 postfix-expression -> pseudo-destructor-name */
6364 /* Consume the `.' or `->' operator. */
6367 postfix_expression
6369 postfix_expression,
6376 /* postfix-expression ++ */
6377 /* Consume the `++' token. */
6379 /* Generate a representation for the complete expression. */
6380 postfix_expression
6382 POSTINCREMENT_EXPR);
6383 /* Increments may not appear in constant-expressions. */
6391 /* postfix-expression -- */
6392 /* Consume the `--' token. */
6394 /* Generate a representation for the complete expression. */
6395 postfix_expression
6397 POSTDECREMENT_EXPR);
6398 /* Decrements may not appear in constant-expressions. */
6410 else
6412 }
6413 }
6415 /* We should never get here. */
6418 }
6420 /* This function parses Cilk Plus array notations. If a normal array expr. is
6421 parsed then the array index is passed back to the caller through *INIT_INDEX
6422 and the function returns a NULL_TREE. If array notation expr. is parsed,
6423 then *INIT_INDEX is ignored by the caller and the function returns
6424 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6425 error_mark_node. */
6427 static tree
6429 tree array_value)
6430 {
6434 {
6437 }
6446 {
6449 }
6451 {
6452 /* Consume the ':'. */
6455 /* If we are here, then we have a case like this A[:]. */
6457 {
6461 }
6465 }
6466 else
6467 {
6468 /* If we are here, then there are three valid possibilities:
6469 1. ARRAY [ EXP ]
6470 2. ARRAY [ EXP : EXP ]
6471 3. ARRAY [ EXP : EXP : EXP ] */
6475 {
6476 /* This indicates that we have a normal array expression. */
6479 }
6481 /* Consume the ':'. */
6485 {
6488 }
6489 }
6494 {
6498 }
6504 }
6506 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6507 by cp_parser_builtin_offsetof. We're looking for
6509 postfix-expression [ expression ]
6510 postfix-expression [ braced-init-list ] (C++11)
6512 FOR_OFFSETOF is set if we're being called in that context, which
6513 changes how we deal with integer constant expressions. */
6515 static tree
6517 tree postfix_expression,
6520 {
6525 /* Consume the `[' token. */
6531 /* Parse the index expression. */
6532 /* ??? For offsetof, there is a question of what to allow here. If
6533 offsetof is not being used in an integral constant expression context,
6534 then we *could* get the right answer by computing the value at runtime.
6535 If we are in an integral constant expression context, then we might
6536 could accept any constant expression; hard to say without analysis.
6537 Rather than open the barn door too wide right away, allow only integer
6538 constant expressions here. */
6541 else
6542 {
6544 {
6551 {
6553 "braced list index is not allowed with array "
6557 }
6558 }
6560 {
6561 /* Here are have these two options:
6562 ARRAY[EXP : EXP] - Array notation expr with default
6563 stride of 1.
6564 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6565 stride. */
6567 postfix_expression);
6570 }
6571 else
6573 }
6575 /* For offsetof and declaration of types we need
6576 constant integeral values.
6577 Also we meed to fold for negative constants so that diagnostic in
6578 c-family/c-common.c doesn't fail for array-bounds. */
6582 /* Look for the closing `]'. */
6585 /* Build the ARRAY_REF. */
6589 /* When not doing offsetof, array references are not permitted in
6590 constant-expressions. */
6596 }
6598 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6599 by cp_parser_builtin_offsetof. We're looking for
6601 postfix-expression . template [opt] id-expression
6602 postfix-expression . pseudo-destructor-name
6603 postfix-expression -> template [opt] id-expression
6604 postfix-expression -> pseudo-destructor-name
6606 FOR_OFFSETOF is set if we're being called in that context. That sorta
6607 limits what of the above we'll actually accept, but nevermind.
6608 TOKEN_TYPE is the "." or "->" token, which will already have been
6609 removed from the stream. */
6611 static tree
6614 tree postfix_expression,
6616 location_t location)
6617 {
6618 tree name;
6623 /* If this is a `->' operator, dereference the pointer. */
6626 tf_warning_or_error);
6627 /* Check to see whether or not the expression is type-dependent. */
6629 /* The identifier following the `->' or `.' is not qualified. */
6635 /* Enter the scope corresponding to the type of the object
6636 given by the POSTFIX_EXPRESSION. */
6638 {
6640 /* According to the standard, no expression should ever have
6641 reference type. Unfortunately, we do not currently match
6642 the standard in this respect in that our internal representation
6643 of an expression may have reference type even when the standard
6644 says it does not. Therefore, we have to manually obtain the
6645 underlying type here. */
6647 /* The type of the POSTFIX_EXPRESSION must be complete. */
6649 {
6651 postfix_expression);
6653 }
6654 /* Unlike the object expression in other contexts, *this is not
6655 required to be of complete type for purposes of class member
6656 access (5.2.5) outside the member function body. */
6660 /* Let the name lookup machinery know that we are processing a
6661 class member access expression. */
6663 /* If something went wrong, we want to be able to discern that case,
6664 as opposed to the case where there was no SCOPE due to the type
6665 of expression being dependent. */
6668 /* If the SCOPE was erroneous, make the various semantic analysis
6669 functions exit quickly -- and without issuing additional error
6670 messages. */
6673 }
6675 /* Assume this expression is not a pseudo-destructor access. */
6678 /* If the SCOPE is a scalar type, then, if this is a valid program,
6679 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6680 is type dependent, it can be pseudo-destructor-name or something else.
6681 Try to parse it as pseudo-destructor-name first. */
6683 {
6684 tree s;
6685 tree type;
6688 /* Parse the pseudo-destructor-name. */
6697 {
6699 postfix_expression
6702 }
6703 }
6706 {
6707 /* If the SCOPE is not a scalar type, we are looking at an
6708 ordinary class member access expression, rather than a
6709 pseudo-destructor-name. */
6712 /* Parse the id-expression. */
6713 name = (cp_parser_id_expression
6720 /* In general, build a SCOPE_REF if the member name is qualified.
6721 However, if the name was not dependent and has already been
6722 resolved; there is no need to build the SCOPE_REF. For example;
6724 struct X { void f(); };
6725 template <typename T> void f(T* t) { t->X::f(); }
6727 Even though "t" is dependent, "X::f" is not and has been resolved
6728 to a BASELINK; there is no need to include scope information. */
6730 /* But we do need to remember that there was an explicit scope for
6731 virtual function calls. */
6735 /* If the name is a template-id that names a type, we will get a
6736 TYPE_DECL here. That is invalid code. */
6738 {
6741 }
6742 else
6743 {
6745 {
6747 {
6751 }
6752 else
6755 name,
6756 template_p);
6760 }
6762 adjust_result_of_qualified_name_lookup
6764 postfix_expression
6766 template_p,
6767 tf_warning_or_error);
6768 }
6769 }
6771 /* We no longer need to look up names in the scope of the object on
6772 the left-hand side of the `.' or `->' operator. */
6775 /* Outside of offsetof, these operators may not appear in
6776 constant-expressions. */
6778 && (cp_parser_non_integral_constant_expression
6783 }
6785 /* Cache of LITERAL_ZERO_P constants. */
6789 /* Parse a parenthesized expression-list.
6791 expression-list:
6792 assignment-expression
6793 expression-list, assignment-expression
6795 attribute-list:
6796 expression-list
6797 identifier
6798 identifier, expression-list
6800 CAST_P is true if this expression is the target of a cast.
6802 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6803 argument pack.
6805 Returns a vector of trees. Each element is a representation of an
6806 assignment-expression. NULL is returned if the ( and or ) are
6807 missing. An empty, but allocated, vector is returned on no
6808 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6809 if we are parsing an attribute list for an attribute that wants a
6810 plain identifier argument, normal_attr for an attribute that wants
6811 an expression, or non_attr if we aren't parsing an attribute list. If
6812 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6813 not all of the expressions in the list were constant.
6814 WANT_LITERAL_ZERO_P is true if the caller is interested in
6815 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6816 immediately, this can be removed. */
6825 {
6831 /* Assume all the expressions will be constant. */
6840 /* Within a parenthesized expression, a `>' token is always
6841 the greater-than operator. */
6842 saved_greater_than_is_operator_p
6846 /* Consume expressions until there are no more. */
6849 {
6850 tree expr;
6852 /* At the beginning of attribute lists, check to see if the
6853 next token is an identifier. */
6856 {
6859 /* Consume the identifier. */
6861 /* Save the identifier. */
6863 }
6864 else
6865 {
6868 /* Parse the next assignment-expression. */
6870 {
6871 /* A braced-init-list. */
6877 }
6879 {
6880 expr = (cp_parser_constant_expression
6885 }
6886 else
6887 {
6891 {
6898 /* If a parameter is literal zero alone, remember it
6899 for -Wmemset-transposed-args warning. */
6902 && want_literal_zero_p
6904 == CPP_COMMA
6907 {
6914 else
6915 {
6920 }
6921 /* Consume the 0 token (or '\0', 0LL etc.). */
6923 }
6927 }
6930 cast_p);
6931 }
6936 /* If we have an ellipsis, then this is an expression
6937 expansion. */
6940 {
6941 /* Consume the `...'. */
6944 /* Build the argument pack. */
6946 }
6948 /* Add it to the list. We add error_mark_node
6949 expressions to the list, so that we can still tell if
6950 the correct form for a parenthesized expression-list
6951 is found. That gives better errors. */
6956 }
6958 /* After the first item, attribute lists look the same as
6959 expression lists. */
6962 get_comma:;
6963 /* If the next token isn't a `,', then we are done. */
6967 /* Otherwise, consume the `,' and keep going. */
6969 }
6972 {
6975 skip_comma:;
6976 /* We try and resync to an unnested comma, as that will give the
6977 user better diagnostics. */
6985 {
6986 parser->greater_than_is_operator_p
6989 }
6990 }
6992 parser->greater_than_is_operator_p
6999 }
7001 /* Parse a pseudo-destructor-name.
7003 pseudo-destructor-name:
7004 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7005 :: [opt] nested-name-specifier template template-id :: ~ type-name
7006 :: [opt] nested-name-specifier [opt] ~ type-name
7008 If either of the first two productions is used, sets *SCOPE to the
7009 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7010 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7011 or ERROR_MARK_NODE if the parse fails. */
7013 static void
7015 tree object,
7018 {
7021 /* Handle ~auto. */
7025 {
7028 "%<~auto%> only available with "
7035 }
7037 /* Assume that things will not work out. */
7040 /* Look for the optional `::' operator. */
7042 /* Look for the optional nested-name-specifier. */
7043 nested_name_specifier_p
7050 /* Now, if we saw a nested-name-specifier, we might be doing the
7051 second production. */
7054 {
7055 /* Consume the `template' keyword. */
7057 /* Parse the template-id. */
7061 class_type,
7063 /* Look for the `::' token. */
7065 }
7066 /* If the next token is not a `~', then there might be some
7067 additional qualification. */
7069 {
7070 /* At this point, we're looking for "type-name :: ~". The type-name
7071 must not be a class-name, since this is a pseudo-destructor. So,
7072 it must be either an enum-name, or a typedef-name -- both of which
7073 are just identifiers. So, we peek ahead to check that the "::"
7074 and "~" tokens are present; if they are not, then we can avoid
7075 calling type_name. */
7079 {
7082 }
7084 /* Look for the type-name. */
7089 /* Look for the `::' token. */
7091 }
7092 else
7095 /* Look for the `~'. */
7098 /* Once we see the ~, this has to be a pseudo-destructor. */
7102 /* Look for the type-name again. We are not responsible for
7103 checking that it matches the first type-name. */
7105 }
7107 /* Parse a unary-expression.
7109 unary-expression:
7110 postfix-expression
7111 ++ cast-expression
7112 -- cast-expression
7113 unary-operator cast-expression
7114 sizeof unary-expression
7115 sizeof ( type-id )
7116 alignof ( type-id ) [C++0x]
7117 new-expression
7118 delete-expression
7120 GNU Extensions:
7122 unary-expression:
7123 __extension__ cast-expression
7124 __alignof__ unary-expression
7125 __alignof__ ( type-id )
7126 alignof unary-expression [C++0x]
7127 __real__ cast-expression
7128 __imag__ cast-expression
7129 && identifier
7130 sizeof ( type-id ) { initializer-list , [opt] }
7131 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7132 __alignof__ ( type-id ) { initializer-list , [opt] }
7134 ADDRESS_P is true iff the unary-expression is appearing as the
7135 operand of the `&' operator. CAST_P is true if this expression is
7136 the target of a cast.
7138 Returns a representation of the expression. */
7140 static tree
7143 {
7147 /* Peek at the next token. */
7149 /* Some keywords give away the kind of expression. */
7151 {
7155 {
7158 {
7161 location_t first_loc;
7164 /* Consume the token. */
7167 /* Parse the operand. */
7172 else
7173 {
7174 /* ISO C++ defines alignof only with types, not with
7175 expressions. So pedwarn if alignof is used with a non-
7176 type expression. However, __alignof__ is ok. */
7179 "ISO C++ does not allow %<alignof%> "
7183 }
7184 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7185 SIZEOF_EXPR with the original operand. */
7187 {
7189 {
7191 {
7194 error_mark_node));
7196 }
7197 else
7201 }
7203 }
7205 }
7214 {
7215 /* The saved value of the PEDANTIC flag. */
7217 tree expr;
7219 /* Save away the PEDANTIC flag. */
7221 /* Parse the cast-expression. */
7223 /* Restore the PEDANTIC flag. */
7227 }
7231 {
7232 tree expression;
7234 /* Consume the `__real__' or `__imag__' token. */
7236 /* Parse the cast-expression. */
7238 /* Create the complete representation. */
7242 expression,
7243 tf_warning_or_error);
7244 }
7252 {
7253 tree expr;
7263 parser->type_definition_forbidden_message
7266 saved_integral_constant_expression_p
7268 saved_non_integral_constant_expression_p
7272 saved_greater_than_is_operator_p
7284 parser->greater_than_is_operator_p
7287 parser->integral_constant_expression_p
7289 parser->non_integral_constant_expression_p
7296 }
7300 }
7301 }
7303 /* Look for the `:: new' and `:: delete', which also signal the
7304 beginning of a new-expression, or delete-expression,
7305 respectively. If the next token is `::', then it might be one of
7306 these. */
7308 {
7311 /* See if the token after the `::' is one of the keywords in
7312 which we're interested. */
7314 /* If it's `new', we have a new-expression. */
7317 /* Similarly, for `delete'. */
7320 }
7322 /* Look for a unary operator. */
7324 /* The `++' and `--' operators can be handled similarly, even though
7325 they are not technically unary-operators in the grammar. */
7327 {
7332 /* Handle the GNU address-of-label extension. */
7335 {
7336 tree identifier;
7337 tree expression;
7340 /* Consume the '&&' token. */
7342 /* Look for the identifier. */
7344 /* Create an expression representing the address. */
7347 NIC_ADDR_LABEL))
7350 }
7351 }
7353 {
7354 tree cast_expression;
7360 /* Consume the operator token. */
7362 /* Parse the cast-expression. */
7363 cast_expression
7368 pidk);
7369 /* Now, build an appropriate representation. */
7371 {
7375 RO_UNARY_STAR,
7376 complain);
7381 /* Fall through. */
7384 cast_expression,
7385 complain);
7392 /* Fall through. */
7402 }
7406 non_constant_p))
7410 }
7414 decltype_p,
7415 pidk);
7416 }
7418 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7419 unary-operator, the corresponding tree code is returned. */
7421 static enum tree_code
7423 {
7425 {
7446 }
7447 }
7449 /* Parse a new-expression.
7451 new-expression:
7452 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7453 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7455 Returns a representation of the expression. */
7457 static tree
7459 {
7462 tree type;
7465 tree ret;
7467 /* Look for the optional `::' operator. */
7468 global_scope_p
7472 /* Look for the `new' operator. */
7474 /* There's no easy way to tell a new-placement from the
7475 `( type-id )' construct. */
7477 /* Look for a new-placement. */
7479 /* If that didn't work out, there's no new-placement. */
7481 {
7485 }
7487 /* If the next token is a `(', then we have a parenthesized
7488 type-id. */
7490 {
7494 /* Consume the `('. */
7497 /* Parse the type-id. */
7498 parser->type_definition_forbidden_message
7503 /* Look for the closing `)'. */
7506 /* There should not be a direct-new-declarator in this production,
7507 but GCC used to allowed this, so we check and emit a sensible error
7508 message for this case. */
7510 {
7516 }
7517 }
7518 /* Otherwise, there must be a new-type-id. */
7519 else
7522 /* If the next token is a `(' or '{', then we have a new-initializer. */
7526 else
7529 /* A new-expression may not appear in an integral constant
7530 expression. */
7533 else
7534 {
7535 /* Create a representation of the new-expression. */
7537 tf_warning_or_error);
7538 }
7546 }
7548 /* Parse a new-placement.
7550 new-placement:
7551 ( expression-list )
7553 Returns the same representation as for an expression-list. */
7557 {
7560 /* Parse the expression-list. */
7561 expression_list = (cp_parser_parenthesized_expression_list
7570 }
7572 /* Parse a new-type-id.
7574 new-type-id:
7575 type-specifier-seq new-declarator [opt]
7577 Returns the TYPE allocated. If the new-type-id indicates an array
7578 type, *NELTS is set to the number of elements in the last array
7579 bound; the TYPE will not include the last array bound. */
7581 static tree
7583 {
7584 cp_decl_specifier_seq type_specifier_seq;
7590 /* The type-specifier sequence must not contain type definitions.
7591 (It cannot contain declarations of new types either, but if they
7592 are not definitions we will catch that because they are not
7593 complete.) */
7595 parser->type_definition_forbidden_message
7597 /* Parse the type-specifier-seq. */
7601 /* Restore the old message. */
7607 /* Parse the new-declarator. */
7610 /* Determine the number of elements in the last array dimension, if
7611 any. */
7613 /* Skip down to the last array dimension. */
7618 {
7621 }
7626 {
7629 }
7632 {
7639 else
7641 }
7644 }
7646 /* Parse an (optional) new-declarator.
7648 new-declarator:
7649 ptr-operator new-declarator [opt]
7650 direct-new-declarator
7652 Returns the declarator. */
7656 {
7659 cp_cv_quals cv_quals;
7661 /* We don't know if there's a ptr-operator next, or not. */
7663 /* Look for a ptr-operator. */
7665 /* If that worked, look for more new-declarators. */
7667 {
7670 /* Parse another optional declarator. */
7673 declarator = cp_parser_make_indirect_declarator
7677 }
7679 /* If the next token is a `[', there is a direct-new-declarator. */
7684 }
7686 /* Parse a direct-new-declarator.
7688 direct-new-declarator:
7689 [ expression ]
7690 direct-new-declarator [constant-expression]
7692 */
7696 {
7700 {
7701 tree expression;
7704 /* Look for the opening `['. */
7709 /* The standard requires that the expression have integral
7710 type. DR 74 adds enumeration types. We believe that the
7711 real intent is that these expressions be handled like the
7712 expression in a `switch' condition, which also allows
7713 classes with a single conversion to integral or
7714 enumeration type. */
7716 {
7717 expression
7719 expression,
7722 {
7724 "expression in new-declarator must have integral "
7727 }
7728 }
7730 /* Look for the closing `]'. */
7733 /* Add this bound to the declarator. */
7736 /* If the next token is not a `[', then there are no more
7737 bounds. */
7740 }
7743 }
7745 /* Parse a new-initializer.
7747 new-initializer:
7748 ( expression-list [opt] )
7749 braced-init-list
7751 Returns a representation of the expression-list. */
7755 {
7759 {
7760 tree t;
7767 }
7768 else
7769 expression_list = (cp_parser_parenthesized_expression_list
7775 }
7777 /* Parse a delete-expression.
7779 delete-expression:
7780 :: [opt] delete cast-expression
7781 :: [opt] delete [ ] cast-expression
7783 Returns a representation of the expression. */
7785 static tree
7787 {
7790 tree expression;
7792 /* Look for the optional `::' operator. */
7793 global_scope_p
7797 /* Look for the `delete' keyword. */
7799 /* See if the array syntax is in use. */
7801 {
7802 /* Consume the `[' token. */
7804 /* Look for the `]' token. */
7806 /* Remember that this is the `[]' construct. */
7808 }
7809 else
7812 /* Parse the cast-expression. */
7815 /* A delete-expression may not appear in an integral constant
7816 expression. */
7821 tf_warning_or_error);
7822 }
7824 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7825 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7826 0 otherwise. */
7828 static int
7830 {
7833 {
7875 /* In ((type ()) () the last () isn't a valid cast-expression,
7876 so the whole must be parsed as postfix-expression. */
7881 /* '[' may start a primary-expression in obj-c++ and in C++11,
7882 as a lambda-expression, eg, '(void)[]{}'. */
7889 /* '++' and '--' may or may not start a cast-expression:
7891 struct T { void operator++(int); };
7892 void f() { (T())++; }
7894 vs
7896 int a;
7897 (int)++a; */
7902 }
7903 }
7905 /* Parse a cast-expression.
7907 cast-expression:
7908 unary-expression
7909 ( type-id ) cast-expression
7911 ADDRESS_P is true iff the unary-expression is appearing as the
7912 operand of the `&' operator. CAST_P is true if this expression is
7913 the target of a cast.
7915 Returns a representation of the expression. */
7917 static tree
7920 {
7921 /* If it's a `(', then we might be looking at a cast. */
7923 {
7929 /* There's no way to know yet whether or not this is a cast.
7930 For example, `(int (3))' is a unary-expression, while `(int)
7931 3' is a cast. So, we resort to parsing tentatively. */
7933 /* Types may not be defined in a cast. */
7935 parser->type_definition_forbidden_message
7937 /* Consume the `('. */
7939 /* A very tricky bit is that `(struct S) { 3 }' is a
7940 compound-literal (which we permit in C++ as an extension).
7941 But, that construct is not a cast-expression -- it is a
7942 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7943 is legal; if the compound-literal were a cast-expression,
7944 you'd need an extra set of parentheses.) But, if we parse
7945 the type-id, and it happens to be a class-specifier, then we
7946 will commit to the parse at that point, because we cannot
7947 undo the action that is done when creating a new class. So,
7948 then we cannot back up and do a postfix-expression.
7950 Another tricky case is the following (c++/29234):
7952 struct S { void operator () (); };
7954 void foo ()
7955 {
7956 ( S()() );
7957 }
7959 As a type-id we parse the parenthesized S()() as a function
7960 returning a function, groktypename complains and we cannot
7961 back up in this case either.
7963 Therefore, we scan ahead to the closing `)', and check to see
7964 if the tokens after the `)' can start a cast-expression. Otherwise
7965 we are dealing with an unary-expression, a postfix-expression
7966 or something else.
7968 Yet another tricky case, in C++11, is the following (c++/54891):
7970 (void)[]{};
7972 The issue is that usually, besides the case of lambda-expressions,
7973 the parenthesized type-id cannot be followed by '[', and, eg, we
7974 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7975 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7976 we don't commit, we try a cast-expression, then an unary-expression.
7978 Save tokens so that we can put them back. */
7981 /* We may be looking at a cast-expression. */
7984 cast_expression
7987 /* Roll back the tokens we skipped. */
7989 /* If we aren't looking at a cast-expression, simulate an error so
7990 that the call to cp_parser_error_occurred below returns true. */
7993 else
7994 {
7997 /* Look for the type-id. */
7999 /* Look for the closing `)'. */
8002 }
8004 /* Restore the saved message. */
8007 /* At this point this can only be either a cast or a
8008 parenthesized ctor such as `(T ())' that looks like a cast to
8009 function returning T. */
8011 {
8012 /* Only commit if the cast-expression doesn't start with
8013 '++', '--', or '[' in C++11. */
8021 pidk);
8024 {
8025 /* Warn about old-style casts, if so requested. */
8032 /* Only type conversions to integral or enumeration types
8033 can be used in constant-expressions. */
8036 NIC_CAST))
8039 /* Perform the cast. */
8040 /* We don't want to resolve cast too early. Therefore we don't
8041 be able to use build_c_cast. */
8044 }
8045 }
8046 else
8048 }
8050 /* If we get here, then it's not a cast, so it must be a
8051 unary-expression. */
8054 }
8056 /* Parse a binary expression of the general form:
8058 pm-expression:
8059 cast-expression
8060 pm-expression .* cast-expression
8061 pm-expression ->* cast-expression
8063 multiplicative-expression:
8064 pm-expression
8065 multiplicative-expression * pm-expression
8066 multiplicative-expression / pm-expression
8067 multiplicative-expression % pm-expression
8069 additive-expression:
8070 multiplicative-expression
8071 additive-expression + multiplicative-expression
8072 additive-expression - multiplicative-expression
8074 shift-expression:
8075 additive-expression
8076 shift-expression << additive-expression
8077 shift-expression >> additive-expression
8079 relational-expression:
8080 shift-expression
8081 relational-expression < shift-expression
8082 relational-expression > shift-expression
8083 relational-expression <= shift-expression
8084 relational-expression >= shift-expression
8086 GNU Extension:
8088 relational-expression:
8089 relational-expression <? shift-expression
8090 relational-expression >? shift-expression
8092 equality-expression:
8093 relational-expression
8094 equality-expression == relational-expression
8095 equality-expression != relational-expression
8097 and-expression:
8098 equality-expression
8099 and-expression & equality-expression
8101 exclusive-or-expression:
8102 and-expression
8103 exclusive-or-expression ^ and-expression
8105 inclusive-or-expression:
8106 exclusive-or-expression
8107 inclusive-or-expression | exclusive-or-expression
8109 logical-and-expression:
8110 inclusive-or-expression
8111 logical-and-expression && inclusive-or-expression
8113 logical-or-expression:
8114 logical-and-expression
8115 logical-or-expression || logical-and-expression
8117 All these are implemented with a single function like:
8119 binary-expression:
8120 simple-cast-expression
8121 binary-expression <token> binary-expression
8123 CAST_P is true if this expression is the target of a cast.
8125 The binops_by_token map is used to get the tree codes for each <token> type.
8126 binary-expressions are associated according to a precedence table. */
8128 #define TOKEN_PRECEDENCE(token) \
8129 (((token->type == CPP_GREATER \
8130 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8131 && !parser->greater_than_is_operator_p) \
8132 ? PREC_NOT_OPERATOR \
8133 : binops_by_token[token->type].prec)
8135 static tree
8141 {
8142 cp_parser_expression_stack stack;
8144 cp_parser_expression_stack_entry current;
8145 tree rhs;
8151 /* Parse the first expression. */
8162 {
8163 /* Get an operator token. */
8169 {
8171 "%<>>%> operator is treated"
8175 }
8179 /* Popping an entry off the stack means we completed a subexpression:
8180 - either we found a token which is not an operator (`>' where it is not
8181 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8182 will happen repeatedly;
8183 - or, we found an operator which has lower priority. This is the case
8184 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8185 parsing `3 * 4'. */
8187 {
8190 else
8192 }
8194 get_rhs:
8198 /* We used the operator token. */
8202 /* For "false && x" or "true || x", x will never be executed;
8203 disable warnings while evaluating it. */
8209 /* Extract another operand. It may be the RHS of this expression
8210 or the LHS of a new, higher priority expression. */
8215 /* Get another operator token. Look up its precedence to avoid
8216 building a useless (immediately popped) stack entry for common
8217 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8221 {
8222 /* ... and prepare to parse the RHS of the new, higher priority
8223 expression. Since precedence levels on the stack are
8224 monotonically increasing, we do not have to care about
8225 stack overflows. */
8234 pop:
8236 /* If the stack is not empty, we have parsed into LHS the right side
8237 (`4' in the example above) of an expression we had suspended.
8238 We can use the information on the stack to recover the LHS (`3')
8239 from the stack together with the tree code (`MULT_EXPR'), and
8240 the precedence of the higher level subexpression
8241 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8242 which will be used to actually build the additive expression. */
8247 }
8250 /* Undo the disabling of warnings done above. */
8259 /* Avoid warning for !!x == y. */
8264 /* Avoid warning for !b == y where b is boolean. */
8268 /* Avoid warning for !!b == y where b is boolean. */
8276 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8277 ERROR_MARK for everything that is not a binary expression.
8278 This makes warn_about_parentheses miss some warnings that
8279 involve unary operators. For unary expressions we should
8280 pass the correct tree_code unless the unary expression was
8281 surrounded by parentheses.
8282 */
8288 == tcc_comparison
8291 else
8300 /* If the binary operator required the use of an overloaded operator,
8301 then this expression cannot be an integral constant-expression.
8302 An overloaded operator can be used even if both operands are
8303 otherwise permissible in an integral constant-expression if at
8304 least one of the operands is of enumeration type. */
8308 NIC_OVERLOADED))
8310 }
8313 }
8315 static tree
8320 {
8323 }
8325 /* Parse the `? expression : assignment-expression' part of a
8326 conditional-expression. The LOGICAL_OR_EXPR is the
8327 logical-or-expression that started the conditional-expression.
8328 Returns a representation of the entire conditional-expression.
8330 This routine is used by cp_parser_assignment_expression.
8332 ? expression : assignment-expression
8334 GNU Extensions:
8336 ? : assignment-expression */
8338 static tree
8340 {
8342 tree assignment_expr;
8346 /* Consume the `?' token. */
8351 {
8354 /* Implicit true clause. */
8356 c_inhibit_evaluation_warnings +=
8359 }
8360 else
8361 {
8364 /* Parse the expression. */
8365 c_inhibit_evaluation_warnings +=
8368 c_inhibit_evaluation_warnings +=
8372 }
8374 /* The next token should be a `:'. */
8376 /* Parse the assignment-expression. */
8378 c_inhibit_evaluation_warnings -=
8381 /* Build the conditional-expression. */
8383 expr,
8384 assignment_expr,
8385 tf_warning_or_error);
8386 }
8388 /* Parse an assignment-expression.
8390 assignment-expression:
8391 conditional-expression
8392 logical-or-expression assignment-operator assignment_expression
8393 throw-expression
8395 CAST_P is true if this expression is the target of a cast.
8396 DECLTYPE_P is true if this expression is the operand of decltype.
8398 Returns a representation for the expression. */
8400 static tree
8403 {
8404 tree expr;
8406 /* If the next token is the `throw' keyword, then we're looking at
8407 a throw-expression. */
8410 /* Otherwise, it must be that we are looking at a
8411 logical-or-expression. */
8412 else
8413 {
8414 /* Parse the binary expressions (logical-or-expression). */
8416 decltype_p,
8418 /* If the next token is a `?' then we're actually looking at a
8419 conditional-expression. */
8422 else
8423 {
8426 /* If it's an assignment-operator, we're using the second
8427 production. */
8428 enum tree_code assignment_operator
8431 {
8433 location_t saved_input_location;
8435 /* Parse the right-hand side of the assignment. */
8441 /* An assignment may not appear in a
8442 constant-expression. */
8444 NIC_ASSIGNMENT))
8446 /* Build the assignment expression. Its default
8447 location is the location of the '=' token. */
8451 assignment_operator,
8452 rhs,
8455 }
8456 }
8457 }
8460 }
8462 /* Parse an (optional) assignment-operator.
8464 assignment-operator: one of
8465 = *= /= %= += -= >>= <<= &= ^= |=
8467 GNU Extension:
8469 assignment-operator: one of
8470 <?= >?=
8472 If the next token is an assignment operator, the corresponding tree
8473 code is returned, and the token is consumed. For example, for
8474 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8475 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8476 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8477 operator, ERROR_MARK is returned. */
8479 static enum tree_code
8481 {
8485 /* Peek at the next token. */
8489 {
8535 /* Nothing else is an assignment operator. */
8537 }
8539 /* If it was an assignment operator, consume it. */
8544 }
8546 /* Parse an expression.
8548 expression:
8549 assignment-expression
8550 expression , assignment-expression
8552 CAST_P is true if this expression is the target of a cast.
8553 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8554 except possibly parenthesized or on the RHS of a comma (N3276).
8556 Returns a representation of the expression. */
8558 static tree
8561 {
8566 {
8567 tree assignment_expression;
8569 /* Parse the next assignment-expression. */
8570 assignment_expression
8573 /* We don't create a temporary for a call that is the immediate operand
8574 of decltype or on the RHS of a comma. But when we see a comma, we
8575 need to create a temporary for a call on the LHS. */
8580 assignment_expression
8584 /* If this is the first assignment-expression, we can just
8585 save it away. */
8588 else
8590 assignment_expression,
8592 /* If the next token is not a comma, then we are done with the
8593 expression. */
8596 /* Consume the `,'. */
8599 /* A comma operator cannot appear in a constant-expression. */
8602 }
8605 }
8607 /* Parse a constant-expression.
8609 constant-expression:
8610 conditional-expression
8612 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8613 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8614 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8615 is false, NON_CONSTANT_P should be NULL. */
8617 static tree
8621 {
8625 tree expression;
8627 /* It might seem that we could simply parse the
8628 conditional-expression, and then check to see if it were
8629 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8630 one that the compiler can figure out is constant, possibly after
8631 doing some simplifications or optimizations. The standard has a
8632 precise definition of constant-expression, and we must honor
8633 that, even though it is somewhat more restrictive.
8635 For example:
8637 int i[(2, 3)];
8639 is not a legal declaration, because `(2, 3)' is not a
8640 constant-expression. The `,' operator is forbidden in a
8641 constant-expression. However, GCC's constant-folding machinery
8642 will fold this operation to an INTEGER_CST for `3'. */
8644 /* Save the old settings. */
8646 saved_allow_non_integral_constant_expression_p
8649 /* We are now parsing a constant-expression. */
8651 parser->allow_non_integral_constant_expression_p
8654 /* Although the grammar says "conditional-expression", we parse an
8655 "assignment-expression", which also permits "throw-expression"
8656 and the use of assignment operators. In the case that
8657 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8658 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8659 actually essential that we look for an assignment-expression.
8660 For example, cp_parser_initializer_clauses uses this function to
8661 determine whether a particular assignment-expression is in fact
8662 constant. */
8664 /* Restore the old settings. */
8665 parser->integral_constant_expression_p
8667 parser->allow_non_integral_constant_expression_p
8670 {
8671 /* Require an rvalue constant expression here; that's what our
8672 callers expect. Reference constant expressions are handled
8673 separately in e.g. cp_parser_template_argument. */
8678 }
8681 parser->non_integral_constant_expression_p
8685 }
8687 /* Parse __builtin_offsetof.
8689 offsetof-expression:
8690 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8692 offsetof-member-designator:
8693 id-expression
8694 | offsetof-member-designator "." id-expression
8695 | offsetof-member-designator "[" expression "]"
8696 | offsetof-member-designator "->" id-expression */
8698 static tree
8700 {
8703 cp_id_kind dummy;
8706 /* We're about to accept non-integral-constant things, but will
8707 definitely yield an integral constant expression. Save and
8708 restore these values around our local parsing. */
8712 /* Consume the "__builtin_offsetof" token. */
8714 /* Consume the opening `('. */
8716 /* Parse the type-id. */
8719 /* Look for the `,'. */
8723 /* Build the (type *)null that begins the traditional offsetof macro. */
8725 tf_warning_or_error);
8727 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8731 {
8734 {
8736 /* offsetof-member-designator "[" expression "]" */
8742 /* offsetof-member-designator "->" identifier */
8745 /* FALLTHRU */
8748 /* offsetof-member-designator "." identifier */
8756 /* Consume the ")" token. */
8761 /* Error. We know the following require will fail, but
8762 that gives the proper error message. */
8767 }
8768 }
8770 success:
8773 failure:
8778 }
8780 /* Parse a trait expression.
8782 Returns a representation of the expression, the underlying type
8783 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8785 static tree
8787 {
8788 cp_trait_kind kind;
8794 {
8878 }
8880 /* Consume the token. */
8891 {
8898 }
8900 {
8902 {
8906 {
8909 }
8913 }
8914 }
8918 /* Complete the trait expression, which may mean either processing
8919 the trait expr now or saving it for template instantiation. */
8921 {
8930 }
8931 }
8933 /* Lambdas that appear in variable initializer or default argument scope
8934 get that in their mangling, so we need to record it. We might as well
8935 use the count for function and namespace scopes as well. */
8939 {
8940 tree t;
8945 static void
8947 {
8948 tree_int ti;
8950 /* Once we're inside a function, we ignore other scopes and just push
8951 the function again so that popping works properly. */
8958 {
8959 /* Don't reset the count if we're still in the same function. */
8962 }
8963 }
8965 static void
8967 {
8970 }
8972 static void
8974 {
8977 {
8980 }
8982 }
8984 /* Parse a lambda expression.
8986 lambda-expression:
8987 lambda-introducer lambda-declarator [opt] compound-statement
8989 Returns a representation of the expression. */
8991 static tree
8993 {
8995 tree type;
9003 {
9005 {
9009 }
9011 }
9013 {
9015 {
9018 }
9020 }
9022 /* We may be in the middle of deferred access check. Disable
9023 it now. */
9034 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9037 /* Now that we've started the type, add the capture fields for any
9038 explicit captures. */
9041 {
9042 /* Inside the class, surrounding template-parameter-lists do not apply. */
9043 unsigned int saved_num_template_parameter_lists
9047 bool fully_implicit_function_template_p
9051 bool auto_is_implicit_function_template_parm_p
9062 /* By virtue of defining a local class, a lambda expression has access to
9063 the private variables of enclosing classes. */
9068 {
9074 }
9076 {
9079 }
9081 /* The capture list was built up in reverse order; fix that now. */
9093 parser->fully_implicit_function_template_p
9097 parser->auto_is_implicit_function_template_parm_p
9099 }
9103 /* This field is only used during parsing of the lambda. */
9106 /* This lambda shouldn't have any proxies left at this point. */
9108 /* And now that we're done, push proxies for an enclosing lambda. */
9113 else
9119 }
9121 /* Parse the beginning of a lambda expression.
9123 lambda-introducer:
9124 [ lambda-capture [opt] ]
9126 LAMBDA_EXPR is the current representation of the lambda expression. */
9128 static void
9130 {
9131 /* Need commas after the first capture. */
9134 /* Eat the leading `['. */
9137 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9145 {
9148 }
9151 {
9153 tree capture_id;
9154 tree capture_init_expr;
9158 enum capture_kind_type
9159 {
9160 BY_COPY,
9161 BY_REFERENCE
9162 };
9166 {
9169 }
9173 else
9176 /* Possibly capture `this'. */
9178 {
9188 explicit_init_p);
9190 }
9192 /* Remember whether we want to capture as a reference or not. */
9194 {
9197 }
9199 /* Get the identifier. */
9204 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9205 delimiters, but I modified this to stop on unnested ']' as well. It
9206 was already changed to stop on unnested '}', so the
9207 "closing_parenthesis" name is no more misleading with my change. */
9208 {
9214 }
9216 /* Find the initializer for this capture. */
9220 {
9222 /* An explicit initializer exists. */
9225 "lambda capture initializers "
9231 {
9234 }
9235 }
9236 else
9237 {
9240 /* Turn the identifier into an id-expression. */
9241 capture_init_expr
9246 {
9249 }
9253 {
9256 capture_init_expr);
9259 }
9262 {
9265 capture_init_expr))
9268 }
9270 capture_init_expr
9271 = finish_id_expression
9273 capture_init_expr,
9287 {
9290 }
9291 else
9293 }
9297 {
9302 capture_id);
9306 "capture of %qD redundant with by-reference capture "
9308 }
9311 capture_id,
9312 capture_init_expr,
9314 explicit_init_p);
9315 }
9318 }
9320 /* Parse the (optional) middle of a lambda expression.
9322 lambda-declarator:
9323 < template-parameter-list [opt] >
9324 ( parameter-declaration-clause [opt] )
9325 attribute-specifier [opt]
9326 mutable [opt]
9327 exception-specification [opt]
9328 lambda-return-type-clause [opt]
9330 LAMBDA_EXPR is the current representation of the lambda expression. */
9332 static bool
9334 {
9335 /* 5.1.1.4 of the standard says:
9336 If a lambda-expression does not include a lambda-declarator, it is as if
9337 the lambda-declarator were ().
9338 This means an empty parameter list, no attributes, and no exception
9339 specification. */
9345 /* The template-parameter-list is optional, but must begin with
9346 an opening angle if present. */
9348 {
9351 "lambda templates are only available with "
9360 /* We just processed one more parameter list. */
9362 }
9364 /* The parameter-declaration-clause is optional (unless
9365 template-parameter-list was given), but must begin with an
9366 opening parenthesis if present. */
9368 {
9373 /* Parse parameters. */
9376 /* Default arguments shall not be specified in the
9377 parameter-declaration-clause of a lambda-declarator. */
9387 /* Parse optional `mutable' keyword. */
9389 {
9392 }
9394 /* Parse optional exception specification. */
9397 /* Parse optional trailing return type. */
9399 {
9403 }
9405 /* The function parameters must be in scope all the way until after the
9406 trailing-return-type in case of decltype. */
9408 }
9412 /* Create the function call operator.
9414 Messing with declarators like this is no uglier than building up the
9415 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9416 other code. */
9417 {
9418 cp_decl_specifier_seq return_type_specs;
9420 tree fco;
9427 else
9428 /* Maybe we will deduce the return type later. */
9434 sfk_none);
9439 VIRT_SPEC_UNSPECIFIED,
9440 REF_QUAL_NONE,
9441 exception_spec,
9446 declarator,
9447 attributes);
9449 {
9452 /* Give the object parameter a different name. */
9456 }
9458 {
9462 }
9471 }
9472 }
9474 /* Parse the body of a lambda expression, which is simply
9476 compound-statement
9478 but which requires special handling.
9479 LAMBDA_EXPR is the current representation of the lambda expression. */
9481 static void
9483 {
9488 else
9489 /* Still increment function_depth so that we don't GC in the
9490 middle of an expression. */
9492 /* Clear this in case we're in the middle of a default argument. */
9495 /* Finish the function call operator
9496 - class_specifier
9497 + late_parsing_for_member
9498 + function_definition_after_declarator
9499 + ctor_initializer_opt_and_function_body */
9500 {
9502 tree body;
9504 tree compound_stmt;
9505 tree cap;
9507 /* Let the front end know that we are going to be defining this
9508 function. */
9510 NULL_TREE,
9519 /* Push the proxies for any explicit captures. */
9526 /* 5.1.1.4 of the standard says:
9527 If a lambda-expression does not include a trailing-return-type, it
9528 is as if the trailing-return-type denotes the following type:
9529 * if the compound-statement is of the form
9530 { return attribute-specifier [opt] expression ; }
9531 the type of the returned expression after lvalue-to-rvalue
9532 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9533 (_conv.array_ 4.2), and function-to-pointer conversion
9534 (_conv.func_ 4.3);
9535 * otherwise, void. */
9537 /* In a lambda that has neither a lambda-return-type-clause
9538 nor a deducible form, errors should be reported for return statements
9539 in the body. Since we used void as the placeholder return type, parsing
9540 the body as usual will give such desired behavior. */
9544 {
9548 /* Parse tentatively in case there's more after the initial return
9549 statement. */
9560 {
9564 /* Will get error here if type not deduced yet. */
9568 }
9569 }
9572 {
9577 }
9581 out:
9585 /* Finish the function and generate code for it if necessary. */
9588 /* Only expand if the call op is not a template. */
9591 }
9596 else
9598 }
9600 /* Statements [gram.stmt.stmt] */
9602 /* Parse a statement.
9604 statement:
9605 labeled-statement
9606 expression-statement
9607 compound-statement
9608 selection-statement
9609 iteration-statement
9610 jump-statement
9611 declaration-statement
9612 try-block
9614 C++11:
9616 statement:
9617 labeled-statement
9618 attribute-specifier-seq (opt) expression-statement
9619 attribute-specifier-seq (opt) compound-statement
9620 attribute-specifier-seq (opt) selection-statement
9621 attribute-specifier-seq (opt) iteration-statement
9622 attribute-specifier-seq (opt) jump-statement
9623 declaration-statement
9624 attribute-specifier-seq (opt) try-block
9626 TM Extension:
9628 statement:
9629 atomic-statement
9631 IN_COMPOUND is true when the statement is nested inside a
9632 cp_parser_compound_statement; this matters for certain pragmas.
9634 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9635 is a (possibly labeled) if statement which is not enclosed in braces
9636 and has an else clause. This is used to implement -Wparentheses. */
9638 static void
9641 {
9646 restart:
9649 /* There is no statement yet. */
9655 /* In obj-c++, seeing '[[' might be the either the beginning of
9656 c++11 attributes, or a nested objc-message-expression. So
9657 let's parse the c++11 attributes tentatively. */
9661 {
9664 }
9666 /* Peek at the next token. */
9668 /* Remember the location of the first token in the statement. */
9670 /* If this is a keyword, then that will often determine what kind of
9671 statement we have. */
9673 {
9677 {
9680 /* Looks like a labeled-statement with a case label.
9681 Parse the label, and then use tail recursion to parse
9682 the statement. */
9699 {
9704 }
9705 else
9719 {
9724 }
9725 else
9726 {
9730 }
9734 /* Objective-C++ exception-handling constructs. */
9748 /* This must be a namespace alias definition. */
9761 /* It might be a keyword like `int' that can start a
9762 declaration-statement. */
9764 }
9765 }
9767 {
9768 /* If the next token is a `:', then we are looking at a
9769 labeled-statement. */
9772 {
9773 /* Looks like a labeled-statement with an ordinary label.
9774 Parse the label, and then use tail recursion to parse
9775 the statement. */
9779 }
9780 }
9781 /* Anything that starts with a `{' must be a compound-statement. */
9784 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9785 a statement all its own. */
9787 {
9788 /* Only certain OpenMP pragmas are attached to statements, and thus
9789 are considered statements themselves. All others are not. In
9790 the context of a compound, accept the pragma as a "statement" and
9791 return so that we can check for a close brace. Otherwise we
9792 require a real statement and must go back and read one. */
9798 }
9800 {
9803 }
9805 /* Everything else must be a declaration-statement or an
9806 expression-statement. Try for the declaration-statement
9807 first, unless we are looking at a `;', in which case we know that
9808 we have an expression-statement. */
9810 {
9812 {
9814 {
9815 /* Attributes should be parsed as part of the the
9816 declaration, so let's un-parse them. */
9819 }
9822 /* Try to parse the declaration-statement. */
9824 /* If that worked, we're done. */
9827 }
9828 /* Look for an expression-statement instead. */
9830 }
9832 /* Set the line number for the statement. */
9836 /* Note that for now, we don't do anything with c++11 statements
9837 parsed at this level. */
9840 OPT_Wattributes,
9842 }
9844 /* Parse the label for a labeled-statement, i.e.
9846 identifier :
9847 case constant-expression :
9848 default :
9850 GNU Extension:
9851 case constant-expression ... constant-expression : statement
9853 When a label is parsed without errors, the label is added to the
9854 parse tree by the finish_* functions, so this function doesn't
9855 have to return the label. */
9857 static void
9859 {
9864 /* The next token should be an identifier. */
9868 {
9871 }
9875 {
9877 {
9881 /* Consume the `case' token. */
9883 /* Parse the constant-expression. */
9890 {
9891 /* Consume the `...' token. */
9897 /* We don't need to emit warnings here, as the common code
9898 will do this for us. */
9899 }
9900 else
9905 else
9908 expr);
9909 }
9913 /* Consume the `default' token. */
9918 else
9923 /* Anything else must be an ordinary label. */
9926 }
9928 /* Require the `:' token. */
9931 /* An ordinary label may optionally be followed by attributes.
9932 However, this is only permitted if the attributes are then
9933 followed by a semicolon. This is because, for backward
9934 compatibility, when parsing
9935 lab: __attribute__ ((unused)) int i;
9936 we want the attribute to attach to "i", not "lab". */
9939 {
9940 tree attrs;
9947 ;
9948 else
9950 }
9956 }
9958 /* Parse an expression-statement.
9960 expression-statement:
9961 expression [opt] ;
9963 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9964 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9965 indicates whether this expression-statement is part of an
9966 expression statement. */
9968 static tree
9970 {
9974 /* If the next token is a ';', then there is no expression
9975 statement. */
9977 {
9981 {
9984 }
9985 }
9987 /* Give a helpful message for "A<T>::type t;" and the like. */
9990 {
9997 {
9998 /* A::A a; */
10003 }
10004 }
10006 /* Consume the final `;'. */
10011 /* This is the final expression statement of a statement
10012 expression. */
10018 }
10020 /* Parse a compound-statement.
10022 compound-statement:
10023 { statement-seq [opt] }
10025 GNU extension:
10027 compound-statement:
10028 { label-declaration-seq [opt] statement-seq [opt] }
10030 label-declaration-seq:
10031 label-declaration
10032 label-declaration-seq label-declaration
10034 Returns a tree representing the statement. */
10036 static tree
10039 {
10040 tree compound_stmt;
10042 /* Consume the `{'. */
10049 /* Begin the compound-statement. */
10051 /* If the next keyword is `__label__' we have a label declaration. */
10054 /* Parse an (optional) statement-seq. */
10056 /* Finish the compound-statement. */
10058 /* Consume the `}'. */
10062 }
10064 /* Parse an (optional) statement-seq.
10066 statement-seq:
10067 statement
10068 statement-seq [opt] statement */
10070 static void
10072 {
10073 /* Scan statements until there aren't any more. */
10075 {
10078 /* If we are looking at a `}', then we have run out of
10079 statements; the same is true if we have reached the end
10080 of file, or have stumbled upon a stray '@end'. */
10087 /* If we are in a compound statement and find 'else' then
10088 something went wrong. */
10090 {
10093 else
10094 {
10097 }
10098 }
10100 /* Parse the statement. */
10102 }
10103 }
10105 /* Parse a selection-statement.
10107 selection-statement:
10108 if ( condition ) statement
10109 if ( condition ) statement else statement
10110 switch ( condition ) statement
10112 Returns the new IF_STMT or SWITCH_STMT.
10114 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10115 is a (possibly labeled) if statement which is not enclosed in
10116 braces and has an else clause. This is used to implement
10117 -Wparentheses. */
10119 static tree
10121 {
10128 /* Peek at the next token. */
10131 /* See what kind of keyword it is. */
10134 {
10137 {
10138 tree statement;
10139 tree condition;
10141 /* Look for the `('. */
10143 {
10146 }
10148 /* Begin the selection-statement. */
10151 else
10154 /* Parse the condition. */
10156 /* Look for the `)'. */
10162 {
10166 /* Add the condition. */
10169 /* Parse the then-clause. */
10173 {
10181 }
10182 else
10189 /* If the next token is `else', parse the else-clause. */
10191 RID_ELSE))
10192 {
10193 /* Consume the `else' keyword. */
10194 location_t else_tok_loc
10197 /* Parse the else-clause. */
10199 {
10200 location_t loc;
10207 }
10208 else
10214 /* If we are currently parsing a then-clause, then
10215 IF_P will not be NULL. We set it to true to
10216 indicate that this if statement has an else clause.
10217 This may trigger the Wparentheses warning below
10218 when we get back up to the parent if statement. */
10221 }
10222 else
10223 {
10224 /* This if statement does not have an else clause. If
10225 NESTED_IF is true, then the then-clause is an if
10226 statement which does have an else clause. We warn
10227 about the potential ambiguity. */
10230 "suggest explicit braces to avoid ambiguous"
10232 }
10234 /* Now we're all done with the if-statement. */
10236 }
10237 else
10238 {
10242 /* Add the condition. */
10245 /* Parse the body of the switch-statement. */
10255 /* Now we're all done with the switch-statement. */
10257 }
10260 }
10266 }
10267 }
10269 /* Parse a condition.
10271 condition:
10272 expression
10273 type-specifier-seq declarator = initializer-clause
10274 type-specifier-seq declarator braced-init-list
10276 GNU Extension:
10278 condition:
10279 type-specifier-seq declarator asm-specification [opt]
10280 attributes [opt] = assignment-expression
10282 Returns the expression that should be tested. */
10284 static tree
10286 {
10287 cp_decl_specifier_seq type_specifiers;
10291 /* Try the declaration first. */
10293 /* New types are not allowed in the type-specifier-seq for a
10294 condition. */
10296 parser->type_definition_forbidden_message
10298 /* Parse the type-specifier-seq. */
10300 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10303 /* Restore the saved message. */
10305 /* If all is well, we might be looking at a declaration. */
10307 {
10308 tree decl;
10309 tree asm_specification;
10310 tree attributes;
10314 /* Parse the declarator. */
10320 /* Parse the attributes. */
10322 /* Parse the asm-specification. */
10324 /* If the next token is not an `=' or '{', then we might still be
10325 looking at an expression. For example:
10327 if (A(a).x)
10329 looks like a decl-specifier-seq and a declarator -- but then
10330 there is no `=', so this is an expression. */
10335 /* If we did see an `=' or '{', then we are looking at a declaration
10336 for sure. */
10338 {
10339 tree pushed_scope;
10343 /* Create the declaration. */
10349 /* Parse the initializer. */
10351 {
10355 }
10356 else
10357 {
10358 /* Consume the `='. */
10361 }
10365 /* Process the initializer. */
10368 asm_specification,
10369 flags);
10375 }
10376 }
10377 /* If we didn't even get past the declarator successfully, we are
10378 definitely not looking at a declaration. */
10379 else
10382 /* Otherwise, we are looking at an expression. */
10384 }
10386 /* Parses a for-statement or range-for-statement until the closing ')',
10387 not included. */
10389 static tree
10391 {
10395 /* Begin the for-statement. */
10398 /* Parse the initialization. */
10403 else
10405 }
10407 static tree
10409 {
10410 /* Normal for loop */
10413 tree stmt;
10416 /* The for-init-statement has already been parsed in
10417 cp_parser_for_init_statement, so no work is needed here. */
10420 /* If there's a condition, process it. */
10424 {
10428 }
10430 /* Look for the `;'. */
10433 /* If there's an expression, process it. */
10439 }
10441 /* Tries to parse a range-based for-statement:
10443 range-based-for:
10444 decl-specifier-seq declarator : expression
10446 The decl-specifier-seq declarator and the `:' are already parsed by
10447 cp_parser_for_init_statement. If processing_template_decl it returns a
10448 newly created RANGE_FOR_STMT; if not, it is converted to a
10449 regular FOR_STMT. */
10451 static tree
10454 {
10458 {
10461 }
10462 else
10465 /* If in template, STMT is converted to a normal for-statement
10466 at instantiation. If not, it is done just ahead. */
10468 {
10476 /* do_auto_deduction doesn't mess with template init-lists. */
10479 }
10480 else
10481 {
10484 }
10486 }
10488 /* Subroutine of cp_convert_range_for: given the initializer expression,
10489 builds up the range temporary. */
10491 static tree
10493 {
10496 /* Find out the type deduced by the declaration
10497 `auto &&__range = range_expr'. */
10502 /* Create the __range variable. */
10509 }
10511 /* Used by cp_parser_range_for in template context: we aren't going to
10512 do a full conversion yet, but we still need to resolve auto in the
10513 type of the for-range-declaration if present. This is basically
10514 a shortcut version of cp_convert_range_for. */
10516 static void
10518 {
10521 {
10524 iter_type = (cp_parser_perform_range_for_lookup
10527 {
10529 iter_type);
10531 tf_warning_or_error);
10534 }
10535 }
10536 }
10538 /* Converts a range-based for-statement into a normal
10539 for-statement, as per the definition.
10541 for (RANGE_DECL : RANGE_EXPR)
10542 BLOCK
10544 should be equivalent to:
10546 {
10547 auto &&__range = RANGE_EXPR;
10548 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10549 __begin != __end;
10550 ++__begin)
10551 {
10552 RANGE_DECL = *__begin;
10553 BLOCK
10554 }
10555 }
10557 If RANGE_EXPR is an array:
10558 BEGIN_EXPR = __range
10559 END_EXPR = __range + ARRAY_SIZE(__range)
10560 Else if RANGE_EXPR has a member 'begin' or 'end':
10561 BEGIN_EXPR = __range.begin()
10562 END_EXPR = __range.end()
10563 Else:
10564 BEGIN_EXPR = begin(__range)
10565 END_EXPR = end(__range);
10567 If __range has a member 'begin' but not 'end', or vice versa, we must
10568 still use the second alternative (it will surely fail, however).
10569 When calling begin()/end() in the third alternative we must use
10570 argument dependent lookup, but always considering 'std' as an associated
10571 namespace. */
10573 tree
10576 {
10582 /* If an error happened previously do nothing or else a lot of
10583 unhelpful errors would be issued. */
10585 else
10586 {
10587 tree range_temp;
10591 /* Can't bind a reference to an array of runtime bound. */
10593 else
10594 {
10599 LOOKUP_ONLYCONVERTING);
10601 }
10604 }
10606 /* The new for initialization statement. */
10614 LOOKUP_ONLYCONVERTING);
10623 LOOKUP_ONLYCONVERTING);
10627 /* The new for condition. */
10634 /* The new increment expression. */
10637 tf_warning_or_error);
10640 /* The declaration is initialized with *__begin inside the loop body. */
10643 tf_warning_or_error),
10645 LOOKUP_ONLYCONVERTING);
10648 }
10650 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10651 We need to solve both at the same time because the method used
10652 depends on the existence of members begin or end.
10653 Returns the type deduced for the iterator expression. */
10655 static tree
10657 {
10659 {
10662 }
10665 {
10670 }
10672 {
10673 /* If RANGE is an array, we will use pointer arithmetic. */
10676 range,
10680 }
10681 else
10682 {
10683 /* If it is not an array, we must do a bit of magic. */
10693 tf_warning_or_error);
10696 tf_warning_or_error);
10699 {
10700 /* Use the member functions. */
10703 else
10709 else
10712 }
10713 else
10714 {
10715 /* Use global functions with ADL. */
10722 tf_warning_or_error);
10724 tf_warning_or_error);
10726 tf_warning_or_error);
10728 tf_warning_or_error);
10731 }
10733 /* Last common checks. */
10735 {
10736 /* If one of the expressions is an error do no more checks. */
10739 }
10742 /* Can happen, when, eg, in a template context, Koenig lookup
10743 can't resolve begin/end (c++/58503). */
10745 else
10746 {
10748 /* The unqualified type of the __begin and __end temporaries should
10749 be the same, as required by the multiple auto declaration. */
10755 }
10756 }
10757 }
10759 /* Helper function for cp_parser_perform_range_for_lookup.
10760 Builds a tree for RANGE.IDENTIFIER(). */
10762 static tree
10764 {
10777 tf_warning_or_error);
10780 }
10782 /* Parse an iteration-statement.
10784 iteration-statement:
10785 while ( condition ) statement
10786 do statement while ( expression ) ;
10787 for ( for-init-statement condition [opt] ; expression [opt] )
10788 statement
10790 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10792 static tree
10794 {
10796 location_t tok_loc;
10798 tree statement;
10801 /* Peek at the next token. */
10808 /* Remember whether or not we are already within an iteration
10809 statement. */
10812 /* See what kind of keyword it is. */
10815 {
10817 {
10818 tree condition;
10820 /* Begin the while-statement. */
10822 /* Look for the `('. */
10824 /* Parse the condition. */
10827 /* Look for the `)'. */
10829 /* Parse the dependent statement. */
10833 /* We're done with the while-statement. */
10835 }
10839 {
10840 tree expression;
10842 /* Begin the do-statement. */
10844 /* Parse the body of the do-statement. */
10849 /* Look for the `while' keyword. */
10851 /* Look for the `('. */
10853 /* Parse the expression. */
10855 /* We're done with the do-statement. */
10857 /* Look for the `)'. */
10859 /* Look for the `;'. */
10861 }
10865 {
10866 /* Look for the `('. */
10871 /* Look for the `)'. */
10874 /* Parse the body of the for-statement. */
10879 /* We're done with the for-statement. */
10881 }
10888 }
10891 }
10893 /* Parse a for-init-statement or the declarator of a range-based-for.
10894 Returns true if a range-based-for declaration is seen.
10896 for-init-statement:
10897 expression-statement
10898 simple-declaration */
10900 static bool
10902 {
10903 /* If the next token is a `;', then we have an empty
10904 expression-statement. Grammatically, this is also a
10905 simple-declaration, but an invalid one, because it does not
10906 declare anything. Therefore, if we did not handle this case
10907 specially, we would issue an error message about an invalid
10908 declaration. */
10910 {
10916 {
10917 /* N3994 -- for (id : init) ... */
10920 "type-specifier only available with "
10928 }
10930 /* A colon is used in range-based for. */
10933 /* We're going to speculatively look for a declaration, falling back
10934 to an expression, if necessary. */
10936 /* Parse the declaration. */
10939 decl);
10942 {
10943 /* It is a range-for, consume the ':' */
10947 {
10949 "range-based %<for%> loops only available with "
10952 }
10953 }
10954 else
10955 /* The ';' is not consumed yet because we told
10956 cp_parser_simple_declaration not to. */
10961 /* If the tentative parse failed, then we shall need to look for an
10962 expression-statement. */
10963 }
10964 /* If we are here, it is an expression-statement. */
10967 }
10969 /* Parse a jump-statement.
10971 jump-statement:
10972 break ;
10973 continue ;
10974 return expression [opt] ;
10975 return braced-init-list ;
10976 goto identifier ;
10978 GNU extension:
10980 jump-statement:
10981 goto * expression ;
10983 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10985 static tree
10987 {
10993 /* Peek at the next token. */
10998 /* See what kind of keyword it is. */
11001 {
11005 {
11025 }
11031 {
11038 /* Fall through. */
11048 }
11053 {
11054 tree expr;
11058 {
11062 }
11065 else
11066 /* If the next token is a `;', then there is no
11067 expression. */
11069 /* Build the return-statement. */
11071 /* Look for the final `;'. */
11073 }
11079 {
11082 }
11084 /* Create the goto-statement. */
11086 {
11087 /* Issue a warning about this use of a GNU extension. */
11089 /* Consume the '*' token. */
11091 /* Parse the dependent expression. */
11093 }
11094 else
11096 /* Look for the final `;'. */
11103 }
11106 }
11108 /* Parse a declaration-statement.
11110 declaration-statement:
11111 block-declaration */
11113 static void
11115 {
11118 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11121 /* Parse the block-declaration. */
11124 /* Free any declarators allocated. */
11126 }
11128 /* Some dependent statements (like `if (cond) statement'), are
11129 implicitly in their own scope. In other words, if the statement is
11130 a single statement (as opposed to a compound-statement), it is
11131 none-the-less treated as if it were enclosed in braces. Any
11132 declarations appearing in the dependent statement are out of scope
11133 after control passes that point. This function parses a statement,
11134 but ensures that is in its own scope, even if it is not a
11135 compound-statement.
11137 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11138 is a (possibly labeled) if statement which is not enclosed in
11139 braces and has an else clause. This is used to implement
11140 -Wparentheses.
11142 Returns the new statement. */
11144 static tree
11146 location_t guard_loc,
11148 {
11149 tree statement;
11154 /* Mark if () ; with a special NOP_EXPR. */
11156 {
11160 }
11161 /* if a compound is opened, we simply parse the statement directly. */
11164 /* If the token is not a `{', then we must take special action. */
11165 else
11166 {
11167 /* Create a compound-statement. */
11169 /* Parse the dependent-statement. */
11172 /* Finish the dummy compound-statement. */
11176 {
11180 guard_kind);
11181 }
11182 }
11184 /* Return the statement. */
11186 }
11188 /* For some dependent statements (like `while (cond) statement'), we
11189 have already created a scope. Therefore, even if the dependent
11190 statement is a compound-statement, we do not want to create another
11191 scope. */
11193 static void
11196 {
11197 /* If the token is a `{', then we must take special action. */
11199 {
11206 guard_kind);
11207 }
11208 else
11209 {
11210 /* Avoid calling cp_parser_compound_statement, so that we
11211 don't create a new scope. Do everything else by hand. */
11213 /* If the next keyword is `__label__' we have a label declaration. */
11216 /* Parse an (optional) statement-seq. */
11219 }
11220 }
11222 /* Declarations [gram.dcl.dcl] */
11224 /* Parse an optional declaration-sequence.
11226 declaration-seq:
11227 declaration
11228 declaration-seq declaration */
11230 static void
11232 {
11234 {
11245 {
11246 /* A declaration consisting of a single semicolon is
11247 invalid. Allow it unless we're being pedantic. */
11252 }
11254 /* If we're entering or exiting a region that's implicitly
11255 extern "C", modify the lang context appropriately. */
11257 {
11260 }
11262 {
11265 }
11268 {
11269 /* A top-level declaration can consist solely of a #pragma.
11270 A nested declaration cannot, so this is done here and not
11271 in cp_parser_declaration. (A #pragma at block scope is
11272 handled in cp_parser_statement.) */
11275 }
11277 /* Parse the declaration itself. */
11279 }
11280 }
11282 /* Parse a declaration.
11284 declaration:
11285 block-declaration
11286 function-definition
11287 template-declaration
11288 explicit-instantiation
11289 explicit-specialization
11290 linkage-specification
11291 namespace-definition
11293 GNU extension:
11295 declaration:
11296 __extension__ declaration */
11298 static void
11300 {
11301 cp_token token1;
11302 cp_token token2;
11307 /* Check for the `__extension__' keyword. */
11309 {
11310 /* Parse the qualified declaration. */
11312 /* Restore the PEDANTIC flag. */
11316 }
11318 /* Try to figure out what kind of declaration is present. */
11323 else
11324 {
11327 }
11329 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11332 /* If the next token is `extern' and the following token is a string
11333 literal, then we have a linkage specification. */
11337 /* If the next token is `template', then we have either a template
11338 declaration, an explicit instantiation, or an explicit
11339 specialization. */
11341 {
11342 /* `template <>' indicates a template specialization. */
11346 /* `template <' indicates a template declaration. */
11349 /* Anything else must be an explicit instantiation. */
11350 else
11352 }
11353 /* If the next token is `export', then we have a template
11354 declaration. */
11357 /* If the next token is `extern', 'static' or 'inline' and the one
11358 after that is `template', we have a GNU extended explicit
11359 instantiation directive. */
11366 /* If the next token is `namespace', check for a named or unnamed
11367 namespace definition. */
11373 /* An unnamed namespace definition. */
11377 /* An inline (associated) namespace definition. */
11381 /* Objective-C++ declaration/definition. */
11388 /* We must have either a block declaration or a function
11389 definition. */
11390 else
11391 /* Try to parse a block-declaration, or a function-definition. */
11394 /* Free any declarators allocated. */
11396 }
11398 /* Parse a block-declaration.
11400 block-declaration:
11401 simple-declaration
11402 asm-definition
11403 namespace-alias-definition
11404 using-declaration
11405 using-directive
11407 GNU Extension:
11409 block-declaration:
11410 __extension__ block-declaration
11412 C++0x Extension:
11414 block-declaration:
11415 static_assert-declaration
11417 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11418 part of a declaration-statement. */
11420 static void
11423 {
11427 /* Check for the `__extension__' keyword. */
11429 {
11430 /* Parse the qualified declaration. */
11432 /* Restore the PEDANTIC flag. */
11436 }
11438 /* Peek at the next token to figure out which kind of declaration is
11439 present. */
11442 /* If the next keyword is `asm', we have an asm-definition. */
11444 {
11448 }
11449 /* If the next keyword is `namespace', we have a
11450 namespace-alias-definition. */
11453 /* If the next keyword is `using', we have a
11454 using-declaration, a using-directive, or an alias-declaration. */
11456 {
11461 /* If the token after `using' is `namespace', then we have a
11462 using-directive. */
11466 /* If the second token after 'using' is '=', then we have an
11467 alias-declaration. */
11473 /* Otherwise, it's a using-declaration. */
11474 else
11477 }
11478 /* If the next keyword is `__label__' we have a misplaced label
11479 declaration. */
11481 {
11485 /* If the next token is now a `;', consume it. */
11488 }
11489 /* If the next token is `static_assert' we have a static assertion. */
11492 /* Anything else must be a simple-declaration. */
11493 else
11496 }
11498 /* Parse a simple-declaration.
11500 simple-declaration:
11501 decl-specifier-seq [opt] init-declarator-list [opt] ;
11503 init-declarator-list:
11504 init-declarator
11505 init-declarator-list , init-declarator
11507 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11508 function-definition as a simple-declaration.
11510 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11511 parsed declaration if it is an uninitialized single declarator not followed
11512 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11513 if present, will not be consumed. */
11515 static void
11519 {
11520 cp_decl_specifier_seq decl_specifiers;
11529 /* Defer access checks until we know what is being declared; the
11530 checks for names appearing in the decl-specifier-seq should be
11531 done as if we were in the scope of the thing being declared. */
11534 /* Parse the decl-specifier-seq. We have to keep track of whether
11535 or not the decl-specifier-seq declares a named class or
11536 enumeration type, since that is the only case in which the
11537 init-declarator-list is allowed to be empty.
11539 [dcl.dcl]
11541 In a simple-declaration, the optional init-declarator-list can be
11542 omitted only when declaring a class or enumeration, that is when
11543 the decl-specifier-seq contains either a class-specifier, an
11544 elaborated-type-specifier, or an enum-specifier. */
11546 CP_PARSER_FLAGS_OPTIONAL,
11549 /* We no longer need to defer access checks. */
11552 /* In a block scope, a valid declaration must always have a
11553 decl-specifier-seq. By not trying to parse declarators, we can
11554 resolve the declaration/expression ambiguity more quickly. */
11557 {
11560 }
11562 /* If the next two tokens are both identifiers, the code is
11563 erroneous. The usual cause of this situation is code like:
11565 T t;
11567 where "T" should name a type -- but does not. */
11570 {
11571 /* If parsing tentatively, we should commit; we really are
11572 looking at a declaration. */
11574 /* Give up. */
11576 }
11578 /* If we have seen at least one decl-specifier, and the next token
11579 is not a parenthesis, then we must be looking at a declaration.
11580 (After "int (" we might be looking at a functional cast.) */
11587 /* Keep going until we hit the `;' at the end of the simple
11588 declaration. */
11591 CPP_SEMICOLON))
11592 {
11595 tree decl;
11598 {
11599 /* If we are processing next declarator, comma is expected */
11604 {
11608 }
11609 }
11610 else
11613 /* Parse the init-declarator. */
11616 function_definition_allowed_p,
11618 declares_class_or_enum,
11620 maybe_range_for_decl,
11622 /* If an error occurred while parsing tentatively, exit quickly.
11623 (That usually happens when in the body of a function; each
11624 statement is treated as a declaration-statement until proven
11625 otherwise.) */
11628 /* Handle function definitions specially. */
11630 {
11631 /* If the next token is a `,', then we are probably
11632 processing something like:
11634 void f() {}, *p;
11636 which is erroneous. */
11638 {
11641 "mixing"
11643 }
11644 /* Otherwise, we're done with the list of declarators. */
11645 else
11646 {
11649 }
11650 }
11653 /* The next token should be either a `,' or a `;'. */
11655 /* If it's a `,', there are more declarators to come. */
11658 /* If it's a `;', we are done. */
11661 /* Anything else is an error. */
11662 else
11663 {
11664 /* If we have already issued an error message we don't need
11665 to issue another one. */
11669 /* Skip tokens until we reach the end of the statement. */
11671 /* If the next token is now a `;', consume it. */
11675 }
11676 /* After the first time around, a function-definition is not
11677 allowed -- even if it was OK at first. For example:
11679 int i, f() {}
11681 is not valid. */
11683 }
11685 /* Issue an error message if no declarators are present, and the
11686 decl-specifier-seq does not itself declare a class or
11687 enumeration: [dcl.dcl]/3. */
11689 {
11691 {
11695 /* Ensure an error is issued anyway when finish_decltype_type,
11696 called via cp_parser_decl_specifier_seq, returns a class or
11697 an enumeration (c++/51786). */
11700 }
11701 /* Perform any deferred access checks. */
11703 }
11705 /* Consume the `;'. */
11709 {
11715 }
11717 done:
11719 }
11721 /* Parse a decl-specifier-seq.
11723 decl-specifier-seq:
11724 decl-specifier-seq [opt] decl-specifier
11725 decl-specifier attribute-specifier-seq [opt] (C++11)
11727 decl-specifier:
11728 storage-class-specifier
11729 type-specifier
11730 function-specifier
11731 friend
11732 typedef
11734 GNU Extension:
11736 decl-specifier:
11737 attributes
11739 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11741 The parser flags FLAGS is used to control type-specifier parsing.
11743 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11744 flags:
11746 1: one of the decl-specifiers is an elaborated-type-specifier
11747 (i.e., a type declaration)
11748 2: one of the decl-specifiers is an enum-specifier or a
11749 class-specifier (i.e., a type definition)
11751 */
11753 static void
11755 cp_parser_flags flags,
11758 {
11762 cp_decl_spec ds;
11764 /* Clear DECL_SPECS. */
11767 /* Assume no class or enumeration type is declared. */
11770 /* Keep reading specifiers until there are no more to read. */
11772 {
11777 /* Peek at the next token. */
11780 /* Save the first token of the decl spec list for error
11781 reporting. */
11784 /* Handle attributes. */
11786 {
11787 /* Parse the attributes. */
11790 /* In a sequence of declaration specifiers, c++11 attributes
11791 appertain to the type that precede them. In that case
11792 [dcl.spec]/1 says:
11794 The attribute-specifier-seq affects the type only for
11795 the declaration it appears in, not other declarations
11796 involving the same type.
11798 But for now let's force the user to position the
11799 attribute either at the beginning of the declaration or
11800 after the declarator-id, which would clearly mean that it
11801 applies to the declarator. */
11803 {
11805 /* The c++11 attribute is at the beginning of the
11806 declaration. It appertains to the entity being
11808 else
11809 {
11811 {
11812 /* This is an attribute following a
11813 class-specifier. */
11818 }
11819 else
11820 {
11821 decl_specs->std_attributes
11823 attrs);
11826 }
11828 }
11829 }
11831 decl_specs->attributes
11833 attrs);
11837 }
11838 /* Assume we will find a decl-specifier keyword. */
11840 /* If the next token is an appropriate keyword, we can simply
11841 add it to the list. */
11843 {
11844 /* decl-specifier:
11845 friend
11846 constexpr */
11849 {
11852 }
11853 else
11854 {
11856 /* Consume the token. */
11858 }
11866 /* function-specifier:
11867 inline
11868 virtual
11869 explicit */
11876 /* decl-specifier:
11877 typedef */
11880 /* Consume the token. */
11882 /* A constructor declarator cannot appear in a typedef. */
11884 /* The "typedef" keyword can only occur in a declaration; we
11885 may as well commit at this point. */
11892 /* storage-class-specifier:
11893 auto
11894 register
11895 static
11896 extern
11897 mutable
11899 GNU Extension:
11900 thread */
11903 {
11904 /* Consume the token. */
11907 /* Complain about `auto' as a storage specifier, if
11908 we're complaining about C++0x compatibility. */
11912 /* Set the storage class anyway. */
11914 token);
11915 }
11916 else
11917 /* C++0x auto type-specifier. */
11925 /* Consume the token. */
11928 token);
11931 /* Consume the token. */
11937 /* We did not yet find a decl-specifier yet. */
11940 }
11950 /* Constructors are a special case. The `S' in `S()' is not a
11951 decl-specifier; it is the beginning of the declarator. */
11952 constructor_p
11953 = (!found_decl_spec
11954 && constructor_possible_p
11955 && (cp_parser_constructor_declarator_p
11958 /* If we don't have a DECL_SPEC yet, then we must be looking at
11959 a type-specifier. */
11961 {
11964 tree type_spec;
11966 type_spec
11968 decl_specs,
11974 /* If this type-specifier referenced a user-defined type
11975 (a typedef, class-name, etc.), then we can't allow any
11976 more such type-specifiers henceforth.
11978 [dcl.spec]
11980 The longest sequence of decl-specifiers that could
11981 possibly be a type name is taken as the
11982 decl-specifier-seq of a declaration. The sequence shall
11983 be self-consistent as described below.
11985 [dcl.type]
11987 As a general rule, at most one type-specifier is allowed
11988 in the complete decl-specifier-seq of a declaration. The
11989 only exceptions are the following:
11991 -- const or volatile can be combined with any other
11992 type-specifier.
11994 -- signed or unsigned can be combined with char, long,
11995 short, or int.
11997 -- ..
11999 Example:
12001 typedef char* Pc;
12002 void g (const int Pc);
12004 Here, Pc is *not* part of the decl-specifier seq; it's
12005 the declarator. Therefore, once we see a type-specifier
12006 (other than a cv-qualifier), we forbid any additional
12007 user-defined types. We *do* still allow things like `int
12008 int' to be considered a decl-specifier-seq, and issue the
12009 error message later. */
12012 /* A constructor declarator cannot follow a type-specifier. */
12014 {
12019 }
12020 }
12022 /* If we still do not have a DECL_SPEC, then there are no more
12023 decl-specifiers. */
12028 /* After we see one decl-specifier, further decl-specifiers are
12029 always optional. */
12031 }
12033 /* Don't allow a friend specifier with a class definition. */
12038 }
12040 /* Parse an (optional) storage-class-specifier.
12042 storage-class-specifier:
12043 auto
12044 register
12045 static
12046 extern
12047 mutable
12049 GNU Extension:
12051 storage-class-specifier:
12052 thread
12054 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12056 static tree
12058 {
12060 {
12064 /* Fall through for C++98. */
12071 /* Consume the token. */
12076 }
12077 }
12079 /* Parse an (optional) function-specifier.
12081 function-specifier:
12082 inline
12083 virtual
12084 explicit
12086 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12087 Updates DECL_SPECS, if it is non-NULL. */
12089 static tree
12092 {
12095 {
12101 /* 14.5.2.3 [temp.mem]
12103 A member function template shall not be virtual. */
12106 else
12116 }
12118 /* Consume the token. */
12120 }
12122 /* Parse a linkage-specification.
12124 linkage-specification:
12125 extern string-literal { declaration-seq [opt] }
12126 extern string-literal declaration */
12128 static void
12130 {
12131 tree linkage;
12133 /* Look for the `extern' keyword. */
12136 /* Look for the string-literal. */
12139 /* Transform the literal into an identifier. If the literal is a
12140 wide-character string, or contains embedded NULs, then we can't
12141 handle it as the user wants. */
12144 {
12146 /* Assume C++ linkage. */
12148 }
12149 else
12152 /* We're now using the new linkage. */
12155 /* If the next token is a `{', then we're using the first
12156 production. */
12158 {
12161 /* Consume the `{' token. */
12163 /* Parse the declarations. */
12165 /* Look for the closing `}'. */
12167 }
12168 /* Otherwise, there's just one declaration. */
12169 else
12170 {
12173 saved_in_unbraced_linkage_specification_p
12177 parser->in_unbraced_linkage_specification_p
12179 }
12181 /* We're done with the linkage-specification. */
12183 }
12185 /* Parse a static_assert-declaration.
12187 static_assert-declaration:
12188 static_assert ( constant-expression , string-literal ) ;
12189 static_assert ( constant-expression ) ; (C++1Z)
12191 If MEMBER_P, this static_assert is a class member. */
12193 static void
12195 {
12196 tree condition;
12197 tree message;
12199 location_t saved_loc;
12202 /* Peek at the `static_assert' token so we can keep track of exactly
12203 where the static assertion started. */
12207 /* Look for the `static_assert' keyword. */
12209 RT_STATIC_ASSERT))
12212 /* We know we are in a static assertion; commit to any tentative
12213 parse. */
12217 /* Parse the `(' starting the static assertion condition. */
12220 /* Parse the constant-expression. Allow a non-constant expression
12221 here in order to give better diagnostics in finish_static_assert. */
12222 condition =
12227 /* Make sure we folded it completely before doing trying to get
12228 constant value. */
12232 {
12235 "static_assert without a message "
12237 /* Eat the ')' */
12242 }
12243 else
12244 {
12245 /* Parse the separating `,'. */
12248 /* Parse the string-literal message. */
12253 /* A `)' completes the static assertion. */
12259 }
12261 /* A semicolon terminates the declaration. */
12264 /* Complete the static assertion, which may mean either processing
12265 the static assert now or saving it for template instantiation. */
12267 }
12269 /* Parse the expression in decltype ( expression ). */
12271 static tree
12274 {
12276 tree expr;
12278 /* First, try parsing an id-expression. */
12289 {
12292 cp_id_kind idk;
12296 /* Lookup the name we got back from the id-expression. */
12306 {
12307 /* Complete lookup of the id-expression. */
12308 expr = (finish_id_expression
12321 /* We found an id-expression, but it was something that we
12322 should not have found. This is an error, not something
12323 we can recover from, so note that we found an
12324 id-expression and we'll recover as gracefully as
12325 possible. */
12327 }
12332 /* We have an id-expression. */
12334 }
12337 {
12338 /* Abort the id-expression parse. */
12341 /* Parsing tentatively, again. */
12344 /* Parse a class member access. */
12352 /* We have an id-expression. */
12354 }
12357 /* We have parsed the complete id-expression or member access. */
12359 else
12360 {
12361 /* Abort our attempt to parse an id-expression or member access
12362 expression. */
12365 /* Parse a full expression. */
12368 }
12371 }
12373 /* Parse a `decltype' type. Returns the type.
12375 simple-type-specifier:
12376 decltype ( expression )
12377 C++14 proposal:
12378 decltype ( auto ) */
12380 static tree
12382 {
12383 tree expr;
12392 {
12393 /* Already parsed. */
12396 }
12398 /* Look for the `decltype' token. */
12402 /* Parse the opening `('. */
12406 /* decltype (auto) */
12409 {
12416 }
12418 /* Types cannot be defined in a `decltype' expression. Save away the
12419 old message. */
12422 /* And create the new one. */
12423 parser->type_definition_forbidden_message
12426 /* The restrictions on constant-expressions do not apply inside
12427 decltype expressions. */
12428 saved_integral_constant_expression_p
12430 saved_non_integral_constant_expression_p
12434 /* Within a parenthesized expression, a `>' token is always
12435 the greater-than operator. */
12436 saved_greater_than_is_operator_p
12440 /* Do not actually evaluate the expression. */
12443 /* Do not warn about problems with the expression. */
12448 /* Go back to evaluating expressions. */
12452 /* The `>' token might be the end of a template-id or
12453 template-parameter-list now. */
12454 parser->greater_than_is_operator_p
12457 /* Restore the old message and the integral constant expression
12458 flags. */
12460 parser->integral_constant_expression_p
12462 parser->non_integral_constant_expression_p
12465 /* Parse to the closing `)'. */
12467 {
12471 }
12474 tf_warning_or_error);
12476 rewrite:
12477 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12478 it again. */
12485 }
12487 /* Special member functions [gram.special] */
12489 /* Parse a conversion-function-id.
12491 conversion-function-id:
12492 operator conversion-type-id
12494 Returns an IDENTIFIER_NODE representing the operator. */
12496 static tree
12498 {
12499 tree type;
12500 tree saved_scope;
12501 tree saved_qualifying_scope;
12502 tree saved_object_scope;
12505 /* Look for the `operator' token. */
12508 /* When we parse the conversion-type-id, the current scope will be
12509 reset. However, we need that information in able to look up the
12510 conversion function later, so we save it here. */
12514 /* We must enter the scope of the class so that the names of
12515 entities declared within the class are available in the
12516 conversion-type-id. For example, consider:
12518 struct S {
12519 typedef int I;
12520 operator I();
12521 };
12523 S::operator I() { ... }
12525 In order to see that `I' is a type-name in the definition, we
12526 must be in the scope of `S'. */
12529 /* Parse the conversion-type-id. */
12531 /* Leave the scope of the class, if any. */
12534 /* Restore the saved scope. */
12538 /* If the TYPE is invalid, indicate failure. */
12542 }
12544 /* Parse a conversion-type-id:
12546 conversion-type-id:
12547 type-specifier-seq conversion-declarator [opt]
12549 Returns the TYPE specified. */
12551 static tree
12553 {
12554 tree attributes;
12555 cp_decl_specifier_seq type_specifiers;
12557 tree type_specified;
12560 /* Parse the attributes. */
12564 parser->type_definition_forbidden_message
12567 /* Parse the type-specifiers. */
12574 /* If that didn't work, stop. */
12577 /* Parse the conversion-declarator. */
12585 /* Don't give this error when parsing tentatively. This happens to
12586 work because we always parse this definitively once. */
12589 {
12591 {
12594 }
12598 }
12601 }
12603 /* Parse an (optional) conversion-declarator.
12605 conversion-declarator:
12606 ptr-operator conversion-declarator [opt]
12608 */
12612 {
12615 cp_cv_quals cv_quals;
12617 /* We don't know if there's a ptr-operator next, or not. */
12619 /* Try the ptr-operator. */
12622 /* If it worked, look for more conversion-declarators. */
12624 {
12627 /* Parse another optional declarator. */
12630 declarator = cp_parser_make_indirect_declarator
12634 }
12637 }
12639 /* Parse an (optional) ctor-initializer.
12641 ctor-initializer:
12642 : mem-initializer-list
12644 Returns TRUE iff the ctor-initializer was actually present. */
12646 static bool
12648 {
12649 /* If the next token is not a `:', then there is no
12650 ctor-initializer. */
12652 {
12653 /* Do default initialization of any bases and members. */
12658 }
12660 /* Consume the `:' token. */
12662 /* And the mem-initializer-list. */
12666 }
12668 /* Parse a mem-initializer-list.
12670 mem-initializer-list:
12671 mem-initializer ... [opt]
12672 mem-initializer ... [opt] , mem-initializer-list */
12674 static void
12676 {
12681 /* Let the semantic analysis code know that we are starting the
12682 mem-initializer-list. */
12687 /* Loop through the list. */
12689 {
12690 tree mem_initializer;
12693 /* Parse the mem-initializer. */
12695 /* If the next token is a `...', we're expanding member initializers. */
12697 {
12698 /* Consume the `...'. */
12701 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12702 can be expanded but members cannot. */
12705 {
12710 }
12712 /* Construct the pack expansion type. */
12715 }
12718 {
12722 }
12723 /* Look for a target constructor. */
12727 {
12730 {
12734 }
12736 }
12737 /* Add it to the list, unless it was erroneous. */
12739 {
12742 }
12743 /* If the next token is not a `,', we're done. */
12746 /* Consume the `,' token. */
12748 }
12750 /* Perform semantic analysis. */
12753 }
12755 /* Parse a mem-initializer.
12757 mem-initializer:
12758 mem-initializer-id ( expression-list [opt] )
12759 mem-initializer-id braced-init-list
12761 GNU extension:
12763 mem-initializer:
12764 ( expression-list [opt] )
12766 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12767 class) or FIELD_DECL (for a non-static data member) to initialize;
12768 the TREE_VALUE is the expression-list. An empty initialization
12769 list is represented by void_list_node. */
12771 static tree
12773 {
12774 tree mem_initializer_id;
12775 tree expression_list;
12776 tree member;
12779 /* Find out what is being initialized. */
12781 {
12785 }
12786 else
12787 {
12791 }
12797 {
12804 }
12805 else
12806 {
12816 }
12826 }
12828 /* Parse a mem-initializer-id.
12830 mem-initializer-id:
12831 :: [opt] nested-name-specifier [opt] class-name
12832 decltype-specifier (C++11)
12833 identifier
12835 Returns a TYPE indicating the class to be initialized for the first
12836 production (and the second in C++11). Returns an IDENTIFIER_NODE
12837 indicating the data member to be initialized for the last production. */
12839 static tree
12841 {
12845 tree id;
12849 /* `typename' is not allowed in this context ([temp.res]). */
12851 {
12853 "keyword %<typename%> not allowed in this context (a qualified "
12856 }
12857 /* Look for the optional `::' operator. */
12858 global_scope_p
12862 /* Look for the optional nested-name-specifier. The simplest way to
12863 implement:
12865 [temp.res]
12867 The keyword `typename' is not permitted in a base-specifier or
12868 mem-initializer; in these contexts a qualified name that
12869 depends on a template-parameter is implicitly assumed to be a
12870 type name.
12872 is to assume that we have seen the `typename' keyword at this
12873 point. */
12874 nested_name_specifier_p
12883 /* If there is a `::' operator or a nested-name-specifier, then we
12884 are definitely looking for a class-name. */
12889 typename_type,
12893 /* Otherwise, we could also be looking for an ordinary identifier. */
12896 /* Try a decltype-specifier. */
12898 else
12899 /* Otherwise, try a class-name. */
12903 none_type,
12907 /* If we found one, we're done. */
12910 /* Otherwise, look for an ordinary identifier. */
12912 }
12914 /* Overloading [gram.over] */
12916 /* Parse an operator-function-id.
12918 operator-function-id:
12919 operator operator
12921 Returns an IDENTIFIER_NODE for the operator which is a
12922 human-readable spelling of the identifier, e.g., `operator +'. */
12924 static tree
12926 {
12927 /* Look for the `operator' keyword. */
12930 /* And then the name of the operator itself. */
12932 }
12934 /* Return an identifier node for a user-defined literal operator.
12935 The suffix identifier is chained to the operator name identifier. */
12937 static tree
12939 {
12940 tree identifier;
12947 }
12949 /* Parse an operator.
12951 operator:
12952 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12953 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12954 || ++ -- , ->* -> () []
12956 GNU Extensions:
12958 operator:
12959 <? >? <?= >?=
12961 Returns an IDENTIFIER_NODE for the operator which is a
12962 human-readable spelling of the identifier, e.g., `operator +'. */
12964 static tree
12966 {
12971 /* Peek at the next token. */
12973 /* Figure out which operator we have. */
12975 {
12977 {
12980 /* The keyword should be either `new' or `delete'. */
12985 else
12988 /* Consume the `new' or `delete' token. */
12991 /* Peek at the next token. */
12993 /* If it's a `[' token then this is the array variant of the
12994 operator. */
12996 {
12997 /* Consume the `[' token. */
12999 /* Look for the `]' token. */
13003 }
13004 /* Otherwise, we have the non-array variant. */
13005 else
13009 }
13156 /* Consume the `('. */
13158 /* Look for the matching `)'. */
13163 /* Consume the `['. */
13165 /* Look for the matching `]'. */
13180 {
13187 /* Consume the string. */
13193 {
13196 }
13197 else
13198 {
13200 /* Look for the suffix identifier. */
13205 {
13209 }
13210 else
13211 {
13214 }
13215 }
13220 {
13223 }
13226 {
13229 }
13231 {
13234 }
13236 }
13239 /* Anything else is an error. */
13241 }
13243 /* If we have selected an identifier, we need to consume the
13244 operator token. */
13247 /* Otherwise, no valid operator name was present. */
13248 else
13249 {
13252 }
13255 }
13257 /* Parse a template-declaration.
13259 template-declaration:
13260 export [opt] template < template-parameter-list > declaration
13262 If MEMBER_P is TRUE, this template-declaration occurs within a
13263 class-specifier.
13265 The grammar rule given by the standard isn't correct. What
13266 is really meant is:
13268 template-declaration:
13269 export [opt] template-parameter-list-seq
13270 decl-specifier-seq [opt] init-declarator [opt] ;
13271 export [opt] template-parameter-list-seq
13272 function-definition
13274 template-parameter-list-seq:
13275 template-parameter-list-seq [opt]
13276 template < template-parameter-list > */
13278 static void
13280 {
13281 /* Check for `export'. */
13283 {
13284 /* Consume the `export' token. */
13286 /* Warn that we do not support `export'. */
13288 }
13291 }
13293 /* Parse a template-parameter-list.
13295 template-parameter-list:
13296 template-parameter
13297 template-parameter-list , template-parameter
13299 Returns a TREE_LIST. Each node represents a template parameter.
13300 The nodes are connected via their TREE_CHAINs. */
13302 static tree
13304 {
13309 /* The loop below parses the template parms. We first need to know
13310 the total number of template parms to be able to compute proper
13311 canonical types of each dependent type. So after the loop, when
13312 we know the total number of template parms,
13313 end_template_parm_list computes the proper canonical types and
13314 fixes up the dependent types accordingly. */
13316 {
13317 tree parameter;
13320 location_t parm_loc;
13322 /* Parse the template-parameter. */
13327 /* Add it to the list. */
13330 parm_loc,
13331 parameter,
13332 is_non_type,
13333 is_parameter_pack);
13334 else
13335 {
13338 }
13340 /* If the next token is not a `,', we're done. */
13343 /* Otherwise, consume the `,' token. */
13345 }
13348 }
13350 /* Parse a template-parameter.
13352 template-parameter:
13353 type-parameter
13354 parameter-declaration
13356 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13357 the parameter. The TREE_PURPOSE is the default value, if any.
13358 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13359 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13360 set to true iff this parameter is a parameter pack. */
13362 static tree
13365 {
13369 tree parm;
13371 /* Assume it is a type parameter or a template parameter. */
13373 /* Assume it not a parameter pack. */
13375 /* Peek at the next token. */
13377 /* If it is `class' or `template', we have a type-parameter. */
13380 /* If it is `class' or `typename' we do not know yet whether it is a
13381 type parameter or a non-type parameter. Consider:
13383 template <typename T, typename T::X X> ...
13385 or:
13387 template <class C, class D*> ...
13389 Here, the first parameter is a type parameter, and the second is
13390 a non-type parameter. We can tell by looking at the token after
13391 the identifier -- if it is a `,', `=', or `>' then we have a type
13392 parameter. */
13394 {
13395 /* Peek at the token after `class' or `typename'. */
13397 /* If it's an ellipsis, we have a template type parameter
13398 pack. */
13401 /* If it's an identifier, skip it. */
13404 /* Now, see if the token looks like the end of a template
13405 parameter. */
13410 }
13412 /* Otherwise, it is a non-type parameter.
13414 [temp.param]
13416 When parsing a default template-argument for a non-type
13417 template-parameter, the first non-nested `>' is taken as the end
13418 of the template parameter-list rather than a greater-than
13419 operator. */
13421 parameter_declarator
13428 /* If the parameter declaration is marked as a parameter pack, set
13429 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13430 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13431 grokdeclarator. */
13434 {
13437 }
13440 {
13441 /* Can happen in some cases of erroneous input (c++/34892). */
13443 /* Consume the `...' for better error recovery. */
13445 }
13446 /* If the next token is an ellipsis, and we don't already have it
13447 marked as a parameter pack, then we have a parameter pack (that
13448 has no declarator). */
13451 && (declarator_can_be_parameter_pack
13453 {
13454 /* Consume the `...'. */
13459 }
13460 /* We might end up with a pack expansion as the type of the non-type
13461 template parameter, in which case this is a non-type template
13462 parameter pack. */
13465 {
13469 }
13472 {
13473 /* Parameter packs cannot have default arguments. However, a
13474 user may try to do so, so we'll parse them and give an
13475 appropriate diagnostic here. */
13479 /* Find the name of the parameter pack. */
13488 else
13492 /* Parse the default argument, but throw away the result. */
13494 }
13504 }
13506 /* Parse a type-parameter.
13508 type-parameter:
13509 class identifier [opt]
13510 class identifier [opt] = type-id
13511 typename identifier [opt]
13512 typename identifier [opt] = type-id
13513 template < template-parameter-list > class identifier [opt]
13514 template < template-parameter-list > class identifier [opt]
13515 = id-expression
13517 GNU Extension (variadic templates):
13519 type-parameter:
13520 class ... identifier [opt]
13521 typename ... identifier [opt]
13523 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13524 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13525 the declaration of the parameter.
13527 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13529 static tree
13531 {
13533 tree parameter;
13535 /* Look for a keyword to tell us what kind of parameter this is. */
13541 {
13544 {
13545 tree identifier;
13546 tree default_argument;
13548 /* If the next token is an ellipsis, we have a template
13549 argument pack. */
13551 {
13552 /* Consume the `...' token. */
13557 }
13559 /* If the next token is an identifier, then it names the
13560 parameter. */
13563 else
13566 /* Create the parameter. */
13569 /* If the next token is an `=', we have a default argument. */
13571 {
13572 /* Consume the `=' token. */
13574 /* Parse the default-argument. */
13578 /* Template parameter packs cannot have default
13579 arguments. */
13581 {
13584 "template parameter pack %qD cannot have a "
13586 else
13588 "template parameter packs cannot have "
13591 }
13595 }
13596 else
13599 /* Create the combined representation of the parameter and the
13600 default argument. */
13602 }
13606 {
13607 tree identifier;
13608 tree default_argument;
13610 /* Look for the `<'. */
13612 /* Parse the template-parameter-list. */
13614 /* Look for the `>'. */
13616 /* Look for the `class' or 'typename' keywords. */
13618 /* If the next token is an ellipsis, we have a template
13619 argument pack. */
13621 {
13622 /* Consume the `...' token. */
13627 }
13628 /* If the next token is an `=', then there is a
13629 default-argument. If the next token is a `>', we are at
13630 the end of the parameter-list. If the next token is a `,',
13631 then we are at the end of this parameter. */
13635 {
13637 /* Treat invalid names as if the parameter were nameless. */
13640 }
13641 else
13644 /* Create the template parameter. */
13646 identifier);
13648 /* If the next token is an `=', then there is a
13649 default-argument. */
13651 {
13654 /* Consume the `='. */
13656 /* Parse the id-expression. */
13658 /* save token before parsing the id-expression, for error
13659 reporting */
13661 default_argument
13669 /* If the id-expression was a template-id that refers to
13670 a template-class, we already have the declaration here,
13671 so no further lookup is needed. */
13672 ;
13673 else
13674 /* Look up the name. */
13675 default_argument
13677 none_type,
13683 /* See if the default argument is valid. */
13684 default_argument
13687 /* Template parameter packs cannot have default
13688 arguments. */
13690 {
13693 "template parameter pack %qD cannot "
13695 identifier);
13696 else
13700 }
13702 }
13703 else
13706 /* Create the combined representation of the parameter and the
13707 default argument. */
13709 }
13715 }
13718 }
13720 /* Parse a template-id.
13722 template-id:
13723 template-name < template-argument-list [opt] >
13725 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13726 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13727 returned. Otherwise, if the template-name names a function, or set
13728 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13729 names a class, returns a TYPE_DECL for the specialization.
13731 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13732 uninstantiated templates. */
13734 static tree
13740 {
13742 tree templ;
13743 tree arguments;
13744 tree template_id;
13751 /* If the next token corresponds to a template-id, there is no need
13752 to reparse it. */
13755 {
13758 /* Get the stored value. */
13760 /* Perform any access checks that were deferred. */
13763 {
13768 tf_warning_or_error);
13769 }
13770 /* Return the stored value. */
13772 }
13774 /* Avoid performing name lookup if there is no possibility of
13775 finding a template-id. */
13778 && !cp_parser_nth_token_starts_template_argument_list_p
13780 {
13783 }
13785 /* Remember where the template-id starts. */
13791 /* Parse the template-name. */
13794 check_dependency_p,
13795 is_declaration,
13796 tag_type,
13799 {
13802 }
13804 /* If we find the sequence `[:' after a template-name, it's probably
13805 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13806 parse correctly the argument list. */
13813 {
13815 /* Change `:' into `::'. */
13817 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13818 CPP_LESS. */
13821 /* Parse the arguments. */
13824 {
13825 /* If we couldn't parse an argument list, then we revert our changes
13826 and return simply an error. Maybe this is not a template-id
13827 after all. */
13832 }
13833 /* Otherwise, emit an error about the invalid digraph, but continue
13834 parsing because we got our argument list. */
13837 {
13840 "%<<:%> is an alternate spelling for %<[%>."
13843 {
13845 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13848 }
13849 }
13850 }
13851 else
13852 {
13853 /* Look for the `<' that starts the template-argument-list. */
13855 {
13858 }
13859 /* Parse the arguments. */
13861 }
13863 /* Build a representation of the specialization. */
13866 TEMPLATE_ID_EXPR,
13870 {
13872 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13873 template (rather than some instantiation thereof) only if
13874 is not nested within some other construct. For example, in
13875 "template <typename T> void f(T) { A<T>::", A<T> is just an
13876 instantiation of A. */
13879 CPP_SCOPE));
13880 template_id
13882 }
13884 {
13886 }
13887 else
13888 {
13889 /* If it's not a class-template or a template-template, it should be
13890 a function-template. */
13896 }
13898 /* If parsing tentatively, replace the sequence of tokens that makes
13899 up the template-id with a CPP_TEMPLATE_ID token. That way,
13900 should we re-parse the token stream, we will not have to repeat
13901 the effort required to do the parse, nor will we issue duplicate
13902 error messages about problems during instantiation of the
13903 template. */
13905 /* Don't do this if we had a parse error in a declarator; re-parsing
13906 might succeed if a name changes meaning (60361). */
13910 {
13913 /* Reset the contents of the START_OF_ID token. */
13915 /* Retrieve any deferred checks. Do not pop this access checks yet
13916 so the memory will not be reclaimed during token replacing below. */
13922 /* Purge all subsequent tokens. */
13925 /* ??? Can we actually assume that, if template_id ==
13926 error_mark_node, we will have issued a diagnostic to the
13927 user, as opposed to simply marking the tentative parse as
13928 failed? */
13931 }
13935 }
13937 /* Parse a template-name.
13939 template-name:
13940 identifier
13942 The standard should actually say:
13944 template-name:
13945 identifier
13946 operator-function-id
13948 A defect report has been filed about this issue.
13950 A conversion-function-id cannot be a template name because they cannot
13951 be part of a template-id. In fact, looking at this code:
13953 a.operator K<int>()
13955 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13956 It is impossible to call a templated conversion-function-id with an
13957 explicit argument list, since the only allowed template parameter is
13958 the type to which it is converting.
13960 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13961 `template' keyword, in a construction like:
13963 T::template f<3>()
13965 In that case `f' is taken to be a template-name, even though there
13966 is no way of knowing for sure.
13968 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13969 name refers to a set of overloaded functions, at least one of which
13970 is a template, or an IDENTIFIER_NODE with the name of the template,
13971 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13972 names are looked up inside uninstantiated templates. */
13974 static tree
13981 {
13982 tree identifier;
13983 tree decl;
13984 tree fns;
13987 /* If the next token is `operator', then we have either an
13988 operator-function-id or a conversion-function-id. */
13990 {
13991 /* We don't know whether we're looking at an
13992 operator-function-id or a conversion-function-id. */
13994 /* Try an operator-function-id. */
13996 /* If that didn't work, try a conversion-function-id. */
13998 {
14001 }
14002 }
14003 /* Look for the identifier. */
14004 else
14007 /* If we didn't find an identifier, we don't have a template-id. */
14011 /* If the name immediately followed the `template' keyword, then it
14012 is a template-name. However, if the next token is not `<', then
14013 we do not treat it as a template-name, since it is not being used
14014 as part of a template-id. This enables us to handle constructs
14015 like:
14017 template <typename T> struct S { S(); };
14018 template <typename T> S<T>::S();
14020 correctly. We would treat `S' as a template -- if it were `S<T>'
14021 -- but we do not if there is no `<'. */
14025 {
14026 /* In a declaration, in a dependent context, we pretend that the
14027 "template" keyword was present in order to improve error
14028 recovery. For example, given:
14030 template <typename T> void f(T::X<int>);
14032 we want to treat "X<int>" as a template-id. */
14034 && !template_keyword_p
14036 && check_dependency_p
14038 /* Do not do this for dtors (or ctors), since they never
14039 need the template keyword before their name. */
14041 {
14044 /* Explain what went wrong. */
14046 identifier);
14049 /* If parsing tentatively, find the location of the "<" token. */
14052 /* Parse the template arguments so that we can issue error
14053 messages about them. */
14056 /* Skip tokens until we find a good place from which to
14057 continue parsing. */
14062 /* If parsing tentatively, permanently remove the
14063 template argument list. That will prevent duplicate
14064 error messages from being issued about the missing
14065 "template" keyword. */
14071 }
14073 /* If the "template" keyword is present, then there is generally
14074 no point in doing name-lookup, so we just return IDENTIFIER.
14075 But, if the qualifying scope is non-dependent then we can
14076 (and must) do name-lookup normally. */
14082 }
14084 /* Look up the name. */
14086 tag_type,
14089 check_dependency_p,
14095 /* If DECL is a template, then the name was a template-name. */
14097 {
14101 }
14102 else
14103 {
14106 /* The standard does not explicitly indicate whether a name that
14107 names a set of overloaded declarations, some of which are
14108 templates, is a template-name. However, such a name should
14109 be a template-name; otherwise, there is no way to form a
14110 template-id for the overloaded templates. */
14118 {
14119 /* The name does not name a template. */
14122 }
14123 }
14125 /* If DECL is dependent, and refers to a function, then just return
14126 its name; we will look it up again during template instantiation. */
14128 {
14132 }
14135 }
14137 /* Parse a template-argument-list.
14139 template-argument-list:
14140 template-argument ... [opt]
14141 template-argument-list , template-argument ... [opt]
14143 Returns a TREE_VEC containing the arguments. */
14145 static tree
14147 {
14152 tree vec;
14159 /* Even if the template-id appears in an integral
14160 constant-expression, the contents of the argument list do
14161 not. */
14167 /* Parse the arguments. */
14168 do
14169 {
14170 tree argument;
14173 /* Consume the comma. */
14176 /* Parse the template-argument. */
14179 /* If the next token is an ellipsis, we're expanding a template
14180 argument pack. */
14182 {
14184 {
14188 }
14189 /* Consume the `...' token. */
14192 /* Make the argument into a TYPE_PACK_EXPANSION or
14193 EXPR_PACK_EXPANSION. */
14195 }
14198 {
14202 {
14205 }
14206 else
14208 }
14210 }
14223 #ifdef ENABLE_CHECKING
14225 #endif
14227 }
14229 /* Parse a template-argument.
14231 template-argument:
14232 assignment-expression
14233 type-id
14234 id-expression
14236 The representation is that of an assignment-expression, type-id, or
14237 id-expression -- except that the qualified id-expression is
14238 evaluated, so that the value returned is either a DECL or an
14239 OVERLOAD.
14241 Although the standard says "assignment-expression", it forbids
14242 throw-expressions or assignments in the template argument.
14243 Therefore, we use "conditional-expression" instead. */
14245 static tree
14247 {
14248 tree argument;
14254 cp_id_kind idk;
14256 /* There's really no way to know what we're looking at, so we just
14257 try each alternative in order.
14259 [temp.arg]
14261 In a template-argument, an ambiguity between a type-id and an
14262 expression is resolved to a type-id, regardless of the form of
14263 the corresponding template-parameter.
14265 Therefore, we try a type-id first. */
14268 /* If there was no error parsing the type-id but the next token is a
14269 '>>', our behavior depends on which dialect of C++ we're
14270 parsing. In C++98, we probably found a typo for '> >'. But there
14271 are type-id which are also valid expressions. For instance:
14273 struct X { int operator >> (int); };
14274 template <int V> struct Foo {};
14275 Foo<X () >> 5> r;
14277 Here 'X()' is a valid type-id of a function type, but the user just
14278 wanted to write the expression "X() >> 5". Thus, we remember that we
14279 found a valid type-id, but we still try to parse the argument as an
14280 expression to see what happens.
14282 In C++0x, the '>>' will be considered two separate '>'
14283 tokens. */
14287 {
14290 }
14291 else
14292 {
14293 /* If the next token isn't a `,' or a `>', then this argument wasn't
14294 really finished. This means that the argument is not a valid
14295 type-id. */
14298 /* If that worked, we're done. */
14301 }
14302 /* We're still not sure what the argument will be. */
14304 /* Try a template. */
14312 /* If the next token isn't a `,' or a `>', then this argument wasn't
14313 really finished. */
14317 {
14318 /* Figure out what is being referred to. If the id-expression
14319 was for a class template specialization, then we will have a
14320 TYPE_DECL at this point. There is no need to do name lookup
14321 at this point in that case. */
14324 none_type,
14333 }
14335 {
14339 }
14340 /* It must be a non-type argument. There permitted cases are given
14341 in [temp.arg.nontype]:
14343 -- an integral constant-expression of integral or enumeration
14344 type; or
14346 -- the name of a non-type template-parameter; or
14348 -- the name of an object or function with external linkage...
14350 -- the address of an object or function with external linkage...
14352 -- a pointer to member... */
14353 /* Look for a non-type template parameter. */
14355 {
14367 }
14369 /* If the next token is "&", the argument must be the address of an
14370 object or function with external linkage. */
14373 {
14376 }
14377 /* See if we might have an id-expression. */
14384 {
14387 address_p,
14394 else
14395 {
14396 tree probe;
14399 {
14400 /* Strip the dereference temporarily. */
14403 }
14405 /* If we're in a template, we represent a qualified-id referring
14406 to a static data member as a SCOPE_REF even if the scope isn't
14407 dependent so that we can check access control later. */
14412 {
14413 /* A variable without external linkage might still be a
14414 valid constant-expression, so no error is issued here
14415 if the external-linkage check fails. */
14418 }
14420 /* All overloaded functions are allowed; if the external
14421 linkage test does not pass, an error will be issued
14422 later. */
14423 ;
14427 /* A pointer-to-member. */
14428 ;
14430 ;
14431 else
14435 {
14438 tf_warning_or_error);
14439 else
14442 }
14443 }
14444 }
14445 /* If the argument started with "&", there are no other valid
14446 alternatives at this point. */
14448 {
14451 }
14453 /* If the argument wasn't successfully parsed as a type-id followed
14454 by '>>', the argument can only be a constant expression now.
14455 Otherwise, we try parsing the constant-expression tentatively,
14456 because the argument could really be a type-id. */
14467 /* We did our best to parse the argument as a non type-id, but that
14468 was the only alternative that matched (albeit with a '>' after
14469 it). We can assume it's just a typo from the user, and a
14470 diagnostic will then be issued. */
14472 }
14474 /* Parse an explicit-instantiation.
14476 explicit-instantiation:
14477 template declaration
14479 Although the standard says `declaration', what it really means is:
14481 explicit-instantiation:
14482 template decl-specifier-seq [opt] declarator [opt] ;
14484 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14485 supposed to be allowed. A defect report has been filed about this
14486 issue.
14488 GNU Extension:
14490 explicit-instantiation:
14491 storage-class-specifier template
14492 decl-specifier-seq [opt] declarator [opt] ;
14493 function-specifier template
14494 decl-specifier-seq [opt] declarator [opt] ; */
14496 static void
14498 {
14500 cp_decl_specifier_seq decl_specifiers;
14505 /* Look for an (optional) storage-class-specifier or
14506 function-specifier. */
14508 {
14509 extension_specifier
14512 extension_specifier
14515 }
14517 /* Look for the `template' keyword. */
14519 /* Let the front end know that we are processing an explicit
14520 instantiation. */
14522 /* [temp.explicit] says that we are supposed to ignore access
14523 control while processing explicit instantiation directives. */
14525 /* Parse a decl-specifier-seq. */
14527 CP_PARSER_FLAGS_OPTIONAL,
14530 /* If there was exactly one decl-specifier, and it declared a class,
14531 and there's no declarator, then we have an explicit type
14532 instantiation. */
14534 {
14535 tree type;
14539 /* Turn access control back on for names used during
14540 template instantiation. */
14545 }
14546 else
14547 {
14549 tree decl;
14551 /* Parse the declarator. */
14552 declarator
14563 {
14566 "explicit instantiation shall not use"
14570 "explicit instantiation shall not use"
14575 /* Turn access control back on for names used during
14576 template instantiation. */
14578 /* Do the explicit instantiation. */
14580 }
14581 else
14582 {
14584 /* Skip the body of the explicit instantiation. */
14586 }
14587 }
14588 /* We're done with the instantiation. */
14594 }
14596 /* Parse an explicit-specialization.
14598 explicit-specialization:
14599 template < > declaration
14601 Although the standard says `declaration', what it really means is:
14603 explicit-specialization:
14604 template <> decl-specifier [opt] init-declarator [opt] ;
14605 template <> function-definition
14606 template <> explicit-specialization
14607 template <> template-declaration */
14609 static void
14611 {
14615 /* Look for the `template' keyword. */
14617 /* Look for the `<'. */
14619 /* Look for the `>'. */
14621 /* We have processed another parameter list. */
14623 /* [temp]
14625 A template ... explicit specialization ... shall not have C
14626 linkage. */
14628 {
14630 /* Give it C++ linkage to avoid confusing other parts of the
14631 front end. */
14634 }
14635 else
14637 /* Let the front end know that we are beginning a specialization. */
14639 {
14642 }
14644 /* If the next keyword is `template', we need to figure out whether
14645 or not we're looking a template-declaration. */
14647 {
14652 else
14654 }
14655 else
14656 /* Parse the dependent declaration. */
14662 /* We're done with the specialization. */
14664 /* For the erroneous case of a template with C linkage, we pushed an
14665 implicit C++ linkage scope; exit that scope now. */
14668 /* We're done with this parameter list. */
14670 }
14672 /* Parse a type-specifier.
14674 type-specifier:
14675 simple-type-specifier
14676 class-specifier
14677 enum-specifier
14678 elaborated-type-specifier
14679 cv-qualifier
14681 GNU Extension:
14683 type-specifier:
14684 __complex__
14686 Returns a representation of the type-specifier. For a
14687 class-specifier, enum-specifier, or elaborated-type-specifier, a
14688 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14690 The parser flags FLAGS is used to control type-specifier parsing.
14692 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14693 in a decl-specifier-seq.
14695 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14696 class-specifier, enum-specifier, or elaborated-type-specifier, then
14697 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14698 if a type is declared; 2 if it is defined. Otherwise, it is set to
14699 zero.
14701 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14702 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14703 is set to FALSE. */
14705 static tree
14707 cp_parser_flags flags,
14712 {
14718 /* Assume this type-specifier does not declare a new type. */
14721 /* And that it does not specify a cv-qualifier. */
14724 /* Peek at the next token. */
14727 /* If we're looking at a keyword, we can use that to guide the
14728 production we choose. */
14731 {
14736 /* Look for the enum-specifier. */
14738 /* If that worked, we're done. */
14740 {
14745 type_spec,
14746 token,
14749 }
14750 else
14753 /* Any of these indicate either a class-specifier, or an
14754 elaborated-type-specifier. */
14761 /* Parse tentatively so that we can back up if we don't find a
14762 class-specifier. */
14764 /* Look for the class-specifier. */
14767 /* If that worked, we're done. */
14769 {
14774 type_spec,
14775 token,
14778 }
14780 /* Fall through. */
14781 elaborated_type_specifier:
14782 /* We're declaring (not defining) a class or enum. */
14786 /* Fall through. */
14788 /* Look for an elaborated-type-specifier. */
14789 type_spec
14790 = (cp_parser_elaborated_type_specifier
14793 is_declaration));
14796 type_spec,
14797 token,
14820 /* The `__complex__' keyword is a GNU extension. */
14826 }
14828 /* Handle simple keywords. */
14830 {
14832 {
14835 }
14837 }
14839 /* If we do not already have a type-specifier, assume we are looking
14840 at a simple-type-specifier. */
14842 decl_specs,
14843 flags);
14845 /* If we didn't find a type-specifier, and a type-specifier was not
14846 optional in this context, issue an error message. */
14848 {
14851 }
14854 }
14856 /* Parse a simple-type-specifier.
14858 simple-type-specifier:
14859 :: [opt] nested-name-specifier [opt] type-name
14860 :: [opt] nested-name-specifier template template-id
14861 char
14862 wchar_t
14863 bool
14864 short
14865 int
14866 long
14867 signed
14868 unsigned
14869 float
14870 double
14871 void
14873 C++0x Extension:
14875 simple-type-specifier:
14876 auto
14877 decltype ( expression )
14878 char16_t
14879 char32_t
14880 __underlying_type ( type-id )
14882 GNU Extension:
14884 simple-type-specifier:
14885 __int128
14886 __typeof__ unary-expression
14887 __typeof__ ( type-id )
14888 __typeof__ ( type-id ) { initializer-list , [opt] }
14890 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14891 appropriately updated. */
14893 static tree
14896 cp_parser_flags flags)
14897 {
14902 /* Peek at the next token. */
14905 /* If we're looking at a keyword, things are easy. */
14907 {
14942 {
14945 }
14974 {
14975 /* The 'auto' might be the placeholder return type for a function decl
14976 with trailing return type. */
14980 {
14988 have_trailing_return_fn_decl
14991 }
14994 {
14997 }
15001 else
15005 {
15008 "use of %<auto%> in lambda parameter declaration "
15009 "only available with "
15011 }
15014 "use of %<auto%> in parameter declaration "
15015 "only available with "
15017 else
15019 "ISO C++ forbids use of %<auto%> in parameter "
15021 }
15022 else
15027 /* Since DR 743, decltype can either be a simple-type-specifier by
15028 itself or begin a nested-name-specifier. Parsing it will replace
15029 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
15030 handling below decide what to do. */
15036 /* Consume the `typeof' token. */
15038 /* Parse the operand to `typeof'. */
15040 /* If it is not already a TYPE, take its type. */
15046 token,
15055 token,
15065 token,
15070 }
15072 /* If token is an already-parsed decltype not followed by ::,
15073 it's a simple-type-specifier. */
15076 {
15079 {
15081 token,
15083 /* Remember that we are handling a decltype in order to
15084 implement the resolution of DR 1510 when the argument
15085 isn't instantiation dependent. */
15087 }
15090 }
15092 /* If the type-specifier was for a built-in type, we're done. */
15094 {
15095 /* Record the type. */
15102 type,
15103 token,
15108 /* Consume the token. */
15114 /* There is no valid C++ program where a non-template type is
15115 followed by a "<". That usually indicates that the user thought
15116 that the type was a template. */
15121 }
15123 /* The type-specifier must be a user-defined type. */
15125 {
15129 /* Don't gobble tokens or issue error messages if this is an
15130 optional type-specifier. */
15134 /* Look for the optional `::' operator. */
15135 global_p
15139 /* Look for the nested-name specifier. */
15140 qualified_p
15148 /* If we have seen a nested-name-specifier, and the next token
15149 is `template', then we are using the template-id production. */
15152 {
15153 /* Look for the template-id. */
15157 none_type,
15159 /* If the template-id did not name a type, we are out of
15160 luck. */
15162 {
15165 }
15166 }
15167 /* Otherwise, look for a type-name. */
15168 else
15170 /* Keep track of all name-lookups performed in class scopes. */
15172 && !global_p
15173 && !qualified_p
15177 /* If it didn't work out, we don't have a TYPE. */
15183 token,
15185 }
15187 /* If we didn't get a type-name, issue an error message. */
15189 {
15192 }
15195 {
15196 /* See if TYPE is an Objective-C type, and if so, parse and
15197 accept any protocol references following it. Do this before
15198 the cp_parser_check_for_invalid_template_id() call, because
15199 Objective-C types can be followed by '<...>' which would
15200 enclose protocol names rather than template arguments, and so
15201 everything is fine. */
15204 {
15208 /* Clobber the "unqualified" type previously entered into
15209 DECL_SPECS with the new, improved protocol-qualified version. */
15214 }
15216 /* There is no valid C++ program where a non-template type is
15217 followed by a "<". That usually indicates that the user
15218 thought that the type was a template. */
15220 none_type,
15222 }
15225 }
15227 /* Parse a type-name.
15229 type-name:
15230 class-name
15231 enum-name
15232 typedef-name
15233 simple-template-id [in c++0x]
15235 enum-name:
15236 identifier
15238 typedef-name:
15239 identifier
15241 Returns a TYPE_DECL for the type. */
15243 static tree
15245 {
15246 tree type_decl;
15248 /* We can't know yet whether it is a class-name or not. */
15250 /* Try a class-name. */
15254 none_type,
15258 /* If it's not a class-name, keep looking. */
15260 {
15262 /* It must be a typedef-name or an enum-name. */
15266 /* It is either a simple-template-id representing an
15267 instantiation of an alias template... */
15271 none_type,
15273 /* Note that this must be an instantiation of an alias template
15274 because [temp.names]/6 says:
15276 A template-id that names an alias template specialization
15277 is a type-name.
15279 Whereas [temp.names]/7 says:
15281 A simple-template-id that names a class template
15282 specialization is a class-name. */
15287 else
15291 /* ... Or a typedef-name or an enum-name. */
15293 }
15296 }
15298 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15300 enum-name:
15301 identifier
15303 typedef-name:
15304 identifier
15306 Returns a TYPE_DECL for the type. */
15308 static tree
15310 {
15311 tree type_decl;
15312 tree identifier;
15319 /* Look up the type-name. */
15326 {
15327 /* See if this is an Objective-C type. */
15332 }
15334 /* Issue an error if we did not find a type-name. */
15336 /* In Objective-C, we have the complication that class names are
15337 normally type names and start declarations (eg, the
15338 "NSObject" in "NSObject *object;"), but can be used in an
15339 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15340 is an expression. So, a classname followed by a dot is not a
15341 valid type-name. */
15344 {
15349 }
15350 /* Remember that the name was used in the definition of the
15351 current class so that we can check later to see if the
15352 meaning would have been different after the class was
15353 entirely defined. */
15359 }
15361 /* Parse an elaborated-type-specifier. Note that the grammar given
15362 here incorporates the resolution to DR68.
15364 elaborated-type-specifier:
15365 class-key :: [opt] nested-name-specifier [opt] identifier
15366 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15367 enum-key :: [opt] nested-name-specifier [opt] identifier
15368 typename :: [opt] nested-name-specifier identifier
15369 typename :: [opt] nested-name-specifier template [opt]
15370 template-id
15372 GNU extension:
15374 elaborated-type-specifier:
15375 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15376 class-key attributes :: [opt] nested-name-specifier [opt]
15377 template [opt] template-id
15378 enum attributes :: [opt] nested-name-specifier [opt] identifier
15380 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15381 declared `friend'. If IS_DECLARATION is TRUE, then this
15382 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15383 something is being declared.
15385 Returns the TYPE specified. */
15387 static tree
15391 {
15393 tree identifier;
15396 tree globalscope;
15399 /* See if we're looking at the `enum' keyword. */
15401 {
15402 /* Consume the `enum' token. */
15404 /* Remember that it's an enumeration type. */
15406 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15407 enums) is used here. */
15410 {
15414 /* Consume the `struct' or `class' and parse it anyway. */
15416 }
15417 /* Parse the attributes. */
15419 }
15420 /* Or, it might be `typename'. */
15422 RID_TYPENAME))
15423 {
15424 /* Consume the `typename' token. */
15426 /* Remember that it's a `typename' type. */
15428 }
15429 /* Otherwise it must be a class-key. */
15430 else
15431 {
15435 /* Parse the attributes. */
15437 }
15439 /* Look for the `::' operator. */
15442 /* Look for the nested-name-specifier. */
15444 {
15449 is_declaration))
15451 }
15452 else
15453 /* Even though `typename' is not present, the proposed resolution
15454 to Core Issue 180 says that in `class A<T>::B', `B' should be
15455 considered a type-name, even if `A<T>' is dependent. */
15460 is_declaration);
15461 /* For everything but enumeration types, consider a template-id.
15462 For an enumeration type, consider only a plain identifier. */
15464 {
15466 tree decl;
15468 /* Allow the `template' keyword. */
15470 /* If we didn't see `template', we don't know if there's a
15471 template-id or not. */
15474 /* Parse the template-id. */
15478 tag_type,
15479 is_declaration);
15480 /* If we didn't find a template-id, look for an ordinary
15481 identifier. */
15483 ;
15484 /* We can get here when cp_parser_template_id, called by
15485 cp_parser_class_name with tag_type == none_type, succeeds
15486 and caches a BASELINK. Then, when called again here,
15487 instead of failing and returning an error_mark_node
15488 returns it (see template/typename17.C in C++11).
15489 ??? Could we diagnose this earlier? */
15491 {
15494 }
15495 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15496 in effect, then we must assume that, upon instantiation, the
15497 template will correspond to a class. */
15501 typename_type,
15503 /* If the `typename' keyword is in effect and DECL is not a type
15504 decl, then type is non existent. */
15506 ;
15512 }
15515 {
15520 {
15523 }
15525 /* For a `typename', we needn't call xref_tag. */
15531 /* Template parameter lists apply only if we are not within a
15532 function parameter list. */
15533 bool template_parm_lists_apply
15542 /* Look up a qualified name in the usual way. */
15544 {
15545 tree decl;
15546 tree ambiguous_decls;
15549 tag_type,
15556 /* If the lookup was ambiguous, an error will already have been
15557 issued. */
15561 /* If we are parsing friend declaration, DECL may be a
15562 TEMPLATE_DECL tree node here. However, we need to check
15563 whether this TEMPLATE_DECL results in valid code. Consider
15564 the following example:
15566 namespace N {
15567 template <class T> class C {};
15568 }
15569 class X {
15570 template <class T> friend class N::C; // #1, valid code
15571 };
15572 template <class T> class Y {
15573 friend class N::C; // #2, invalid code
15574 };
15576 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15577 name lookup of `N::C'. We see that friend declaration must
15578 be template for the code to be valid. Note that
15579 processing_template_decl does not work here since it is
15580 always 1 for the above two cases. */
15582 decl = (cp_parser_maybe_treat_template_as_class
15587 {
15589 identifier,
15592 }
15595 {
15599 allow_template);
15603 }
15605 /* Forward declarations of nested types, such as
15607 class C1::C2;
15608 class C1::C2::C3;
15610 are invalid unless all components preceding the final '::'
15611 are complete. If all enclosing types are complete, these
15612 declarations become merely pointless.
15614 Invalid forward declarations of nested types are errors
15615 caught elsewhere in parsing. Those that are pointless arrive
15616 here. */
15623 }
15624 else
15625 {
15626 /* An elaborated-type-specifier sometimes introduces a new type and
15627 sometimes names an existing type. Normally, the rule is that it
15628 introduces a new type only if there is not an existing type of
15629 the same name already in scope. For example, given:
15631 struct S {};
15632 void f() { struct S s; }
15634 the `struct S' in the body of `f' is the same `struct S' as in
15635 the global scope; the existing definition is used. However, if
15636 there were no global declaration, this would introduce a new
15637 local class named `S'.
15639 An exception to this rule applies to the following code:
15641 namespace N { struct S; }
15643 Here, the elaborated-type-specifier names a new type
15644 unconditionally; even if there is already an `S' in the
15645 containing scope this declaration names a new type.
15646 This exception only applies if the elaborated-type-specifier
15647 forms the complete declaration:
15649 [class.name]
15651 A declaration consisting solely of `class-key identifier ;' is
15652 either a redeclaration of the name in the current scope or a
15653 forward declaration of the identifier as a class name. It
15654 introduces the name into the current scope.
15656 We are in this situation precisely when the next token is a `;'.
15658 An exception to the exception is that a `friend' declaration does
15659 *not* name a new type; i.e., given:
15661 struct S { friend struct T; };
15663 `T' is not a new type in the scope of `S'.
15665 Also, `new struct S' or `sizeof (struct S)' never results in the
15666 definition of a new type; a new type can only be declared in a
15667 declaration context. */
15669 tag_scope ts;
15673 /* Friends have special name lookup rules. */
15677 CPP_SEMICOLON))
15678 /* This is a `class-key identifier ;' */
15680 else
15683 template_p =
15684 (template_parm_lists_apply
15687 /* An unqualified name was used to reference this type, so
15688 there were no qualifying templates. */
15696 }
15697 }
15702 /* Allow attributes on forward declarations of classes. */
15704 {
15714 else
15717 }
15720 {
15721 /* Indicate whether this class was declared as a `class' or as a
15722 `struct'. */
15726 }
15728 /* A "<" cannot follow an elaborated type specifier. If that
15729 happens, the user was probably trying to form a template-id. */
15734 }
15736 /* Parse an enum-specifier.
15738 enum-specifier:
15739 enum-head { enumerator-list [opt] }
15740 enum-head { enumerator-list , } [C++0x]
15742 enum-head:
15743 enum-key identifier [opt] enum-base [opt]
15744 enum-key nested-name-specifier identifier enum-base [opt]
15746 enum-key:
15747 enum
15748 enum class [C++0x]
15749 enum struct [C++0x]
15751 enum-base: [C++0x]
15752 : type-specifier-seq
15754 opaque-enum-specifier:
15755 enum-key identifier enum-base [opt] ;
15757 GNU Extensions:
15758 enum-key attributes[opt] identifier [opt] enum-base [opt]
15759 { enumerator-list [opt] }attributes[opt]
15760 enum-key attributes[opt] identifier [opt] enum-base [opt]
15761 { enumerator-list, }attributes[opt] [C++0x]
15763 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15764 if the token stream isn't an enum-specifier after all. */
15766 static tree
15768 {
15769 tree identifier;
15771 tree prev_scope;
15773 tree attributes;
15786 /* Parse tentatively so that we can back up if we don't find a
15787 enum-specifier. */
15790 /* Caller guarantees that the current token is 'enum', an identifier
15791 possibly follows, and the token after that is an opening brace.
15792 If we don't have an identifier, fabricate an anonymous name for
15793 the enumeration being defined. */
15796 /* Parse the "class" or "struct", which indicates a scoped
15797 enumeration type in C++0x. */
15800 {
15804 /* Consume the `struct' or `class' token. */
15808 }
15812 /* Clear the qualification. */
15817 /* Figure out in what scope the declaration is being placed. */
15823 nested_name_specifier
15831 {
15832 tree name;
15836 enum_type,
15841 input_location);
15843 {
15846 {
15847 /* Are template enums allowed in ISO? */
15851 /* ignore a typename reference, for it will be solved by name
15852 in start_enum. */
15854 }
15855 }
15858 else
15861 }
15862 else
15863 {
15866 else
15867 {
15873 }
15874 }
15877 /* Check for the `:' that denotes a specified underlying type in C++0x.
15878 Note that a ':' could also indicate a bitfield width, however. */
15880 {
15881 cp_decl_specifier_seq type_specifiers;
15883 /* Consume the `:'. */
15886 /* Parse the type-specifier-seq. */
15891 /* At this point this is surely not elaborated type specifier. */
15900 /* If that didn't work, stop. */
15902 {
15908 }
15909 }
15911 /* Look for the `{' but don't consume it yet. */
15913 {
15915 {
15918 {
15921 }
15922 }
15923 /* An opaque-enum-specifier must have a ';' here. */
15926 {
15929 {
15932 }
15933 }
15934 }
15940 {
15942 {
15946 }
15948 {
15950 }
15951 }
15953 /* Issue an error message if type-definitions are forbidden here. */
15956 else
15957 /* Create the new type. We do this before consuming the opening
15958 brace so the enum will be recorded as being on the line of its
15959 tag (or the 'enum' keyword, if there is no tag). */
15963 /* If the next token is not '{' it is an opaque-enum-specifier or an
15964 elaborated-type-specifier. */
15966 {
15970 {
15971 /* The following catches invalid code such as:
15972 enum class S<int>::E { A, B, C }; */
15980 {
15984 nested_name_specifier);
15986 }
15987 /* If that scope does not contain the scope in which the
15988 class was originally declared, the program is invalid. */
15990 nested_name_specifier))
15991 {
15994 "declaration of %qD in namespace %qD which does not "
15997 else
15999 "declaration of %qD in %qD which does not "
16003 }
16004 }
16009 /* Consume the opening brace. */
16016 {
16020 }
16021 else
16022 {
16028 }
16032 /* If the next token is not '}', then there are some enumerators. */
16034 {
16038 }
16039 else
16042 /* Consume the final '}'. */
16048 }
16049 else
16050 {
16051 /* If a ';' follows, then it is an opaque-enum-specifier
16052 and additional restrictions apply. */
16054 {
16061 }
16062 }
16064 /* Look for trailing attributes to apply to this enumeration, and
16065 apply them if appropriate. */
16067 {
16071 trailing_attr,
16073 }
16075 /* Finish up the enumeration. */
16077 {
16082 }
16085 {
16087 {
16090 }
16092 {
16094 }
16095 }
16096 out:
16099 }
16101 /* Parse an enumerator-list. The enumerators all have the indicated
16102 TYPE.
16104 enumerator-list:
16105 enumerator-definition
16106 enumerator-list , enumerator-definition */
16108 static void
16110 {
16112 {
16113 /* Parse an enumerator-definition. */
16116 /* If the next token is not a ',', we've reached the end of
16117 the list. */
16120 /* Otherwise, consume the `,' and keep going. */
16122 /* If the next token is a `}', there is a trailing comma. */
16124 {
16129 }
16130 }
16131 }
16133 /* Parse an enumerator-definition. The enumerator has the indicated
16134 TYPE.
16136 enumerator-definition:
16137 enumerator
16138 enumerator = constant-expression
16140 enumerator:
16141 identifier
16143 GNU Extensions:
16145 enumerator-definition:
16146 enumerator attributes [opt]
16147 enumerator attributes [opt] = constant-expression */
16149 static void
16151 {
16152 tree identifier;
16153 tree value;
16154 location_t loc;
16156 /* Save the input location because we are interested in the location
16157 of the identifier and not the location of the explicit value. */
16160 /* Look for the identifier. */
16165 /* Parse any specified attributes. */
16168 /* If the next token is an '=', then there is an explicit value. */
16170 {
16171 /* Consume the `=' token. */
16173 /* Parse the value. */
16175 }
16176 else
16179 /* If we are processing a template, make sure the initializer of the
16180 enumerator doesn't contain any bare template parameter pack. */
16184 /* Create the enumerator. */
16186 }
16188 /* Parse a namespace-name.
16190 namespace-name:
16191 original-namespace-name
16192 namespace-alias
16194 Returns the NAMESPACE_DECL for the namespace. */
16196 static tree
16198 {
16199 tree identifier;
16200 tree namespace_decl;
16204 /* Get the name of the namespace. */
16209 /* Look up the identifier in the currently active scope. Look only
16210 for namespaces, due to:
16212 [basic.lookup.udir]
16214 When looking up a namespace-name in a using-directive or alias
16215 definition, only namespace names are considered.
16217 And:
16219 [basic.lookup.qual]
16221 During the lookup of a name preceding the :: scope resolution
16222 operator, object, function, and enumerator names are ignored.
16224 (Note that cp_parser_qualifying_entity only calls this
16225 function if the token after the name is the scope resolution
16226 operator.) */
16228 none_type,
16234 /* If it's not a namespace, issue an error. */
16237 {
16242 }
16245 }
16247 /* Parse a namespace-definition.
16249 namespace-definition:
16250 named-namespace-definition
16251 unnamed-namespace-definition
16253 named-namespace-definition:
16254 original-namespace-definition
16255 extension-namespace-definition
16257 original-namespace-definition:
16258 namespace identifier { namespace-body }
16260 extension-namespace-definition:
16261 namespace original-namespace-name { namespace-body }
16263 unnamed-namespace-definition:
16264 namespace { namespace-body } */
16266 static void
16268 {
16275 {
16279 }
16280 else
16283 /* Look for the `namespace' keyword. */
16286 /* Get the name of the namespace. We do not attempt to distinguish
16287 between an original-namespace-definition and an
16288 extension-namespace-definition at this point. The semantic
16289 analysis routines are responsible for that. */
16292 else
16295 /* Parse any specified attributes. */
16298 /* Look for the `{' to start the namespace. */
16300 /* Start the namespace. */
16303 /* "inline namespace" is equivalent to a stub namespace definition
16304 followed by a strong using directive. */
16306 {
16308 /* Set up namespace association. */
16312 /* Import the contents of the inline namespace. */
16316 }
16320 /* Parse the body of the namespace. */
16326 /* Finish the namespace. */
16328 /* Look for the final `}'. */
16330 }
16332 /* Parse a namespace-body.
16334 namespace-body:
16335 declaration-seq [opt] */
16337 static void
16339 {
16341 }
16343 /* Parse a namespace-alias-definition.
16345 namespace-alias-definition:
16346 namespace identifier = qualified-namespace-specifier ; */
16348 static void
16350 {
16351 tree identifier;
16352 tree namespace_specifier;
16356 /* Look for the `namespace' keyword. */
16358 /* Look for the identifier. */
16362 /* Look for the `=' token. */
16365 {
16367 /* Skip the definition. */
16372 }
16374 /* Look for the qualified-namespace-specifier. */
16375 namespace_specifier
16377 /* Look for the `;' token. */
16380 /* Register the alias in the symbol table. */
16382 }
16384 /* Parse a qualified-namespace-specifier.
16386 qualified-namespace-specifier:
16387 :: [opt] nested-name-specifier [opt] namespace-name
16389 Returns a NAMESPACE_DECL corresponding to the specified
16390 namespace. */
16392 static tree
16394 {
16395 /* Look for the optional `::'. */
16399 /* Look for the optional nested-name-specifier. */
16407 }
16409 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16410 access declaration.
16412 using-declaration:
16413 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16414 using :: unqualified-id ;
16416 access-declaration:
16417 qualified-id ;
16419 */
16421 static bool
16424 {
16428 tree decl;
16429 tree identifier;
16430 tree qscope;
16435 {
16438 }
16439 else
16440 {
16441 /* Look for the `using' keyword. */
16444 /* Peek at the next token. */
16446 /* See if it's `typename'. */
16448 {
16449 /* Remember that we've seen it. */
16451 /* Consume the `typename' token. */
16453 }
16454 }
16456 /* Look for the optional global scope qualification. */
16457 global_scope_p
16462 /* If we saw `typename', or didn't see `::', then there must be a
16463 nested-name-specifier present. */
16465 {
16471 {
16474 }
16475 }
16476 /* Otherwise, we could be in either of the two productions. In that
16477 case, treat the nested-name-specifier as optional. */
16478 else
16490 /* Something has already gone wrong; there's no need to parse
16491 further. Since an error has occurred, the return value of
16492 cp_parser_parse_definitely will be false, as required. */
16496 /* Parse the unqualified-id. */
16504 {
16509 }
16511 /* The function we call to handle a using-declaration is different
16512 depending on what scope we are in. */
16514 ;
16517 /* [namespace.udecl]
16519 A using declaration shall not name a template-id. */
16522 else
16523 {
16525 {
16526 /* Create the USING_DECL. */
16533 {
16536 }
16537 else
16538 /* Add it to the list of members in this class. */
16540 }
16541 else
16542 {
16544 identifier,
16551 {
16554 }
16557 else
16559 }
16560 }
16562 /* Look for the final `;'. */
16567 "access declarations are deprecated "
16568 "in favour of using-declarations; "
16572 }
16574 /* Parse an alias-declaration.
16576 alias-declaration:
16577 using identifier attribute-specifier-seq [opt] = type-id */
16579 static tree
16581 {
16583 location_t id_location;
16585 cp_decl_specifier_seq decl_specs;
16589 /* Look for the `using' keyword. */
16590 cp_token *using_token
16612 /* Now we are going to parse the type-id of the declaration. */
16614 /*
16615 [dcl.type]/3 says:
16617 "A type-specifier-seq shall not define a class or enumeration
16618 unless it appears in the type-id of an alias-declaration (7.1.3) that
16619 is not the declaration of a template-declaration."
16621 In other words, if we currently are in an alias template, the
16622 type-id should not define a type.
16624 So let's set parser->type_definition_forbidden_message in that
16625 case; cp_parser_check_type_definition (called by
16626 cp_parser_class_specifier) will then emit an error if a type is
16627 defined in the type-id. */
16629 {
16633 }
16637 /* Restore the error message if need be. */
16643 {
16646 }
16648 /* A typedef-name can also be introduced by an alias-declaration. The
16649 identifier following the using keyword becomes a typedef-name. It has
16650 the same semantics as if it were introduced by the typedef
16651 specifier. In particular, it does not define a new type and it shall
16652 not appear in the type-id. */
16657 {
16660 ds_attribute,
16661 attrs_token);
16662 }
16664 ds_typedef,
16665 using_token);
16667 ds_alias,
16668 using_token);
16677 else
16688 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16689 added into the symbol table; otherwise, return the TYPE_DECL. */
16693 {
16697 }
16700 }
16702 /* Parse a using-directive.
16704 using-directive:
16705 using namespace :: [opt] nested-name-specifier [opt]
16706 namespace-name ; */
16708 static void
16710 {
16711 tree namespace_decl;
16712 tree attribs;
16714 /* Look for the `using' keyword. */
16716 /* And the `namespace' keyword. */
16718 /* Look for the optional `::' operator. */
16720 /* And the optional nested-name-specifier. */
16726 /* Get the namespace being used. */
16728 /* And any specified attributes. */
16730 /* Update the symbol table. */
16732 /* Look for the final `;'. */
16734 }
16736 /* Parse an asm-definition.
16738 asm-definition:
16739 asm ( string-literal ) ;
16741 GNU Extension:
16743 asm-definition:
16744 asm volatile [opt] ( string-literal ) ;
16745 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16746 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16747 : asm-operand-list [opt] ) ;
16748 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16749 : asm-operand-list [opt]
16750 : asm-clobber-list [opt] ) ;
16751 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16752 : asm-clobber-list [opt]
16753 : asm-goto-list ) ; */
16755 static void
16757 {
16758 tree string;
16763 tree asm_stmt;
16771 /* Look for the `asm' keyword. */
16776 {
16779 }
16781 /* See if the next token is `volatile'. */
16784 {
16785 /* Remember that we saw the `volatile' keyword. */
16787 /* Consume the token. */
16789 }
16793 {
16794 /* Remember that we saw the `goto' keyword. */
16796 /* Consume the token. */
16798 }
16799 /* Look for the opening `('. */
16802 /* Look for the string. */
16805 {
16809 }
16811 /* If we're allowing GNU extensions, check for the extended assembly
16812 syntax. Unfortunately, the `:' tokens need not be separated by
16813 a space in C, and so, for compatibility, we tolerate that here
16814 too. Doing that means that we have to treat the `::' operator as
16815 two `:' tokens. */
16820 {
16825 /* The extended syntax was used. */
16828 /* Look for outputs. */
16830 {
16831 /* Consume the `:'. */
16833 /* Parse the output-operands. */
16835 CPP_COLON)
16837 CPP_SCOPE)
16839 CPP_CLOSE_PAREN)
16841 {
16845 }
16846 }
16847 /* If the next token is `::', there are no outputs, and the
16848 next token is the beginning of the inputs. */
16850 /* The inputs are coming next. */
16853 /* Look for inputs. */
16856 {
16857 /* Consume the `:' or `::'. */
16859 /* Parse the output-operands. */
16861 CPP_COLON)
16863 CPP_SCOPE)
16865 CPP_CLOSE_PAREN))
16866 {
16870 }
16871 }
16873 /* The clobbers are coming next. */
16876 /* Look for clobbers. */
16879 {
16881 /* Consume the `:' or `::'. */
16883 /* Parse the clobbers. */
16885 CPP_COLON)
16887 CPP_CLOSE_PAREN))
16889 }
16892 /* The labels are coming next. */
16895 /* Look for labels. */
16898 {
16900 /* Consume the `:' or `::'. */
16902 /* Parse the labels. */
16904 }
16908 }
16912 /* Look for the closing `)'. */
16920 {
16921 /* Create the ASM_EXPR. */
16923 {
16926 /* If the extended syntax was not used, mark the ASM_EXPR. */
16928 {
16934 }
16935 }
16936 else
16938 }
16939 }
16941 /* Declarators [gram.dcl.decl] */
16943 /* Parse an init-declarator.
16945 init-declarator:
16946 declarator initializer [opt]
16948 GNU Extension:
16950 init-declarator:
16951 declarator asm-specification [opt] attributes [opt] initializer [opt]
16953 function-definition:
16954 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16955 function-body
16956 decl-specifier-seq [opt] declarator function-try-block
16958 GNU Extension:
16960 function-definition:
16961 __extension__ function-definition
16963 TM Extension:
16965 function-definition:
16966 decl-specifier-seq [opt] declarator function-transaction-block
16968 The DECL_SPECIFIERS apply to this declarator. Returns a
16969 representation of the entity declared. If MEMBER_P is TRUE, then
16970 this declarator appears in a class scope. The new DECL created by
16971 this declarator is returned.
16973 The CHECKS are access checks that should be performed once we know
16974 what entity is being declared (and, therefore, what classes have
16975 befriended it).
16977 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16978 for a function-definition here as well. If the declarator is a
16979 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16980 be TRUE upon return. By that point, the function-definition will
16981 have been completely parsed.
16983 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16984 is FALSE.
16986 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16987 parsed declaration if it is an uninitialized single declarator not followed
16988 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16989 if present, will not be consumed. If returned, this declarator will be
16990 created with SD_INITIALIZED but will not call cp_finish_decl.
16992 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16993 and there is an initializer, the pointed location_t is set to the
16994 location of the '=' or `(', or '{' in C++11 token introducing the
16995 initializer. */
16997 static tree
17007 {
17011 tree prefix_attributes;
17013 tree asm_specification;
17014 tree initializer;
17016 tree scope;
17018 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
17019 initialized with "= ..", CPP_OPEN_PAREN if initialized with
17020 "(...)". */
17031 /* Gather the attributes that were provided with the
17032 decl-specifiers. */
17035 /* Assume that this is not the declarator for a function
17036 definition. */
17040 /* Default arguments are only permitted for function parameters. */
17044 /* Defer access checks while parsing the declarator; we cannot know
17045 what names are accessible until we know what is being
17046 declared. */
17049 /* Parse the declarator. */
17051 declarator
17056 /* Gather up the deferred checks. */
17061 /* If the DECLARATOR was erroneous, there's no need to go
17062 further. */
17066 /* Check that the number of template-parameter-lists is OK. */
17076 /* Figure out what scope the entity declared by the DECLARATOR is
17077 located in. `grokdeclarator' sometimes changes the scope, so
17078 we compute it now. */
17081 /* Perform any lookups in the declared type which were thought to be
17082 dependent, but are not in the scope of the declarator. */
17083 decl_specifiers->type
17086 /* If we're allowing GNU extensions, look for an
17087 asm-specification. */
17089 {
17090 /* Look for an asm-specification. */
17093 }
17094 else
17097 /* Look for attributes. */
17101 /* Peek at the next token. */
17107 {
17108 /* Check to see if the token indicates the start of a
17109 function-definition. */
17111 {
17113 {
17114 /* If a function-definition should not appear here, issue an
17115 error message. */
17119 }
17121 location_t func_brace_location
17124 /* Neither attributes nor an asm-specification are allowed
17125 on a function-definition. */
17128 "an asm-specification is not allowed "
17132 "attributes are not allowed "
17134 /* This is a function-definition. */
17137 /* Parse the function definition. */
17140 decl_specifiers,
17141 declarator,
17142 prefix_attributes);
17143 else
17144 decl =
17145 (cp_parser_function_definition_from_specifiers_and_declarator
17149 {
17150 /* This is where the prologue starts... */
17153 }
17156 }
17157 }
17159 {
17160 /* A non-template declaration involving a function parameter list
17161 containing an implicit template parameter will be made into a
17162 template. If the resulting declaration is not going to be an
17163 actual function then finish the template scope here to prevent it.
17164 An error message will be issued once we have a decl to talk about.
17166 FIXME probably we should do type deduction rather than create an
17167 implicit template, but the standard currently doesn't allow it. */
17170 }
17172 /* [dcl.dcl]
17174 Only in function declarations for constructors, destructors, and
17175 type conversions can the decl-specifier-seq be omitted.
17177 We explicitly postpone this check past the point where we handle
17178 function-definitions because we tolerate function-definitions
17179 that are missing their return types in some modes. */
17181 {
17185 }
17187 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17191 {
17202 {
17208 }
17209 }
17210 else
17211 {
17212 /* If the init-declarator isn't initialized and isn't followed by a
17213 `,' or `;', it's not a valid init-declarator. */
17216 {
17219 else
17220 {
17224 }
17225 }
17228 }
17230 /* Because start_decl has side-effects, we should only call it if we
17231 know we're going ahead. By this point, we know that we cannot
17232 possibly be looking at any other construct. */
17235 /* Enter the newly declared entry in the symbol table. If we're
17236 processing a declaration in a class-specifier, we wait until
17237 after processing the initializer. */
17239 {
17246 /* Adjust location of decl if declarator->id_loc is more appropriate:
17247 set, and decl wasn't merged with another decl, in which case its
17248 location would be different from input_location, and more accurate. */
17253 }
17255 /* Enter the SCOPE. That way unqualified names appearing in the
17256 initializer will be looked up in SCOPE. */
17259 /* Perform deferred access control checks, now that we know in which
17260 SCOPE the declared entity resides. */
17262 {
17265 /* If the entity being declared is a function, pretend that we
17266 are in its scope. If it is a `friend', it may have access to
17267 things that would not otherwise be accessible. */
17269 {
17272 }
17274 /* Perform access checks for template parameters. */
17277 /* Perform the access control checks for the declarator and the
17278 decl-specifiers. */
17281 /* Restore the saved value. */
17284 }
17286 /* Parse the initializer. */
17291 {
17293 {
17296 else
17297 {
17298 /* If the declaration was erroneous, we don't really
17299 know what the user intended, so just silently
17300 consume the initializer. */
17307 }
17308 }
17309 else
17310 {
17311 /* We want to record the extra mangling scope for in-class
17312 initializers of class members and initializers of static data
17313 member templates. The former involves deferring
17314 parsing of the initializer until end of class as with default
17315 arguments. So right here we only handle the latter. */
17325 }
17326 }
17328 /* The old parser allows attributes to appear after a parenthesized
17329 initializer. Mark Mitchell proposed removing this functionality
17330 on the GCC mailing lists on 2002-08-13. This parser accepts the
17331 attributes -- but ignores them. */
17338 /* And now complain about a non-function implicit template. */
17343 /* For an in-class declaration, use `grokfield' to create the
17344 declaration. */
17346 {
17348 {
17351 }
17359 }
17361 /* Finish processing the declaration. But, skip member
17362 declarations. */
17364 {
17367 asm_specification,
17368 /* If the initializer is in parentheses, then this is
17369 a direct-initialization, which means that an
17370 `explicit' constructor is OK. Otherwise, an
17371 `explicit' constructor cannot be used. */
17374 }
17377 /* Core issue #226 (C++0x only): A default template-argument
17378 shall not be specified in a friend class template
17379 declaration. */
17388 {
17391 else
17393 }
17396 }
17398 /* Parse a declarator.
17400 declarator:
17401 direct-declarator
17402 ptr-operator declarator
17404 abstract-declarator:
17405 ptr-operator abstract-declarator [opt]
17406 direct-abstract-declarator
17408 GNU Extensions:
17410 declarator:
17411 attributes [opt] direct-declarator
17412 attributes [opt] ptr-operator declarator
17414 abstract-declarator:
17415 attributes [opt] ptr-operator abstract-declarator [opt]
17416 attributes [opt] direct-abstract-declarator
17418 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17419 detect constructor, destructor or conversion operators. It is set
17420 to -1 if the declarator is a name, and +1 if it is a
17421 function. Otherwise it is set to zero. Usually you just want to
17422 test for >0, but internally the negative value is used.
17424 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17425 a decl-specifier-seq unless it declares a constructor, destructor,
17426 or conversion. It might seem that we could check this condition in
17427 semantic analysis, rather than parsing, but that makes it difficult
17428 to handle something like `f()'. We want to notice that there are
17429 no decl-specifiers, and therefore realize that this is an
17430 expression, not a declaration.)
17432 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17433 the declarator is a direct-declarator of the form "(...)".
17435 MEMBER_P is true iff this declarator is a member-declarator.
17437 FRIEND_P is true iff this declarator is a friend. */
17441 cp_parser_declarator_kind dcl_kind,
17445 {
17448 cp_cv_quals cv_quals;
17449 tree class_type;
17452 /* Assume this is not a constructor, destructor, or type-conversion
17453 operator. */
17460 /* Check for the ptr-operator production. */
17462 /* Parse the ptr-operator. */
17468 /* If that worked, then we have a ptr-operator. */
17470 {
17471 /* If a ptr-operator was found, then this declarator was not
17472 parenthesized. */
17475 /* The dependent declarator is optional if we are parsing an
17476 abstract-declarator. */
17480 /* Parse the dependent declarator. */
17485 friend_p);
17487 /* If we are parsing an abstract-declarator, we must handle the
17488 case where the dependent declarator is absent. */
17493 declarator = cp_parser_make_indirect_declarator
17495 }
17496 /* Everything else is a direct-declarator. */
17497 else
17498 {
17501 CPP_OPEN_PAREN);
17503 ctor_dtor_or_conv_p,
17505 }
17510 }
17512 /* Parse a direct-declarator or direct-abstract-declarator.
17514 direct-declarator:
17515 declarator-id
17516 direct-declarator ( parameter-declaration-clause )
17517 cv-qualifier-seq [opt]
17518 ref-qualifier [opt]
17519 exception-specification [opt]
17520 direct-declarator [ constant-expression [opt] ]
17521 ( declarator )
17523 direct-abstract-declarator:
17524 direct-abstract-declarator [opt]
17525 ( parameter-declaration-clause )
17526 cv-qualifier-seq [opt]
17527 ref-qualifier [opt]
17528 exception-specification [opt]
17529 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17530 ( abstract-declarator )
17532 Returns a representation of the declarator. DCL_KIND is
17533 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17534 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17535 we are parsing a direct-declarator. It is
17536 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17537 of ambiguity we prefer an abstract declarator, as per
17538 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17539 as for cp_parser_declarator. */
17543 cp_parser_declarator_kind dcl_kind,
17546 {
17556 {
17557 /* Peek at the next token. */
17560 {
17561 /* This is either a parameter-declaration-clause, or a
17562 parenthesized declarator. When we know we are parsing a
17563 named declarator, it must be a parenthesized declarator
17564 if FIRST is true. For instance, `(int)' is a
17565 parameter-declaration-clause, with an omitted
17566 direct-abstract-declarator. But `((*))', is a
17567 parenthesized abstract declarator. Finally, when T is a
17568 template parameter `(T)' is a
17569 parameter-declaration-clause, and not a parenthesized
17570 named declarator.
17572 We first try and parse a parameter-declaration-clause,
17573 and then try a nested declarator (if FIRST is true).
17575 It is not an error for it not to be a
17576 parameter-declaration-clause, even when FIRST is
17577 false. Consider,
17579 int i (int);
17580 int i (3);
17582 The first is the declaration of a function while the
17583 second is the definition of a variable, including its
17584 initializer.
17586 Having seen only the parenthesis, we cannot know which of
17587 these two alternatives should be selected. Even more
17588 complex are examples like:
17590 int i (int (a));
17591 int i (int (3));
17593 The former is a function-declaration; the latter is a
17594 variable initialization.
17596 Thus again, we try a parameter-declaration-clause, and if
17597 that fails, we back out and return. */
17600 {
17601 tree params;
17604 /* In a member-declarator, the only valid interpretation
17605 of a parenthesis is the start of a
17606 parameter-declaration-clause. (It is invalid to
17607 initialize a static data member with a parenthesized
17608 initializer; only the "=" form of initialization is
17609 permitted.) */
17613 /* Consume the `('. */
17616 {
17617 /* If this is going to be an abstract declarator, we're
17618 in a declarator and we can't have default args. */
17621 }
17625 /* Parse the parameter-declaration-clause. */
17628 /* Consume the `)'. */
17631 /* If all went well, parse the cv-qualifier-seq,
17632 ref-qualifier and the exception-specification. */
17634 {
17635 cp_cv_quals cv_quals;
17636 cp_virt_specifiers virt_specifiers;
17637 cp_ref_qualifier ref_qual;
17638 tree exception_specification;
17639 tree late_return;
17640 tree attrs;
17650 /* Parse the cv-qualifier-seq. */
17652 /* Parse the ref-qualifier. */
17654 /* And the exception-specification. */
17655 exception_specification
17660 /* In here, we handle cases where attribute is used after
17661 the function declaration. For example:
17662 void func (int x) __attribute__((vector(..))); */
17665 {
17669 CPP_SEMICOLON)
17671 CPP_OPEN_BRACE))
17674 ;
17675 else
17677 }
17678 late_return = (cp_parser_late_return_type_opt
17683 /* Parse the virt-specifier-seq. */
17686 /* Create the function-declarator. */
17688 params,
17689 cv_quals,
17690 virt_specifiers,
17691 ref_qual,
17692 exception_specification,
17693 late_return);
17695 /* Any subsequent parameter lists are to do with
17696 return type, so are not those of the declared
17697 function. */
17699 }
17701 /* Remove the function parms from scope. */
17705 /* Repeat the main loop. */
17707 }
17709 /* If this is the first, we can try a parenthesized
17710 declarator. */
17712 {
17718 /* Consume the `('. */
17720 /* Parse the nested declarator. */
17723 declarator
17729 /* Expect a `)'. */
17736 }
17737 /* Otherwise, we must be done. */
17738 else
17740 }
17744 {
17745 /* Parse an array-declarator. */
17754 /* Consume the `['. */
17756 /* Peek at the next token. */
17758 /* If the next token is `]', then there is no
17759 constant-expression. */
17761 {
17764 bounds
17774 {
17775 /* Normally, the array bound must be an integral constant
17776 expression. However, as an extension, we allow VLAs
17777 in function scopes as long as they aren't part of a
17778 parameter declaration. */
17782 }
17785 {
17786 /* Remember this wasn't a constant-expression. */
17789 }
17790 }
17791 else
17793 /* Look for the closing `]'. */
17795 {
17798 }
17803 }
17805 {
17806 {
17807 tree qualifying_scope;
17808 tree unqualified_name;
17809 tree attrs;
17810 special_function_kind sfk;
17815 /* Parse a declarator-id */
17818 {
17821 /* If we see an ellipsis, we should be looking at a
17822 parameter pack. */
17824 {
17825 /* Consume the `...' */
17829 }
17830 }
17833 unqualified_name
17837 {
17841 {
17842 /* Check whether an error occurred. */
17845 /* We already consumed the ellipsis to mark a
17846 parameter pack, but we have no way to report it,
17847 so abort the tentative parse. We will be exiting
17848 immediately anyway. */
17850 }
17851 else
17857 && (qualifying_scope
17859 {
17862 }
17863 }
17868 {
17873 }
17879 {
17880 /* In the declaration of a member of a template class
17881 outside of the class itself, the SCOPE will sometimes
17882 be a TYPENAME_TYPE. For example, given:
17884 template <typename T>
17885 int S<T>::R::i = 3;
17887 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17888 this context, we must resolve S<T>::R to an ordinary
17889 type, rather than a typename type.
17891 The reason we normally avoid resolving TYPENAME_TYPEs
17892 is that a specialization of `S' might render
17893 `S<T>::R' not a type. However, if `S' is
17894 specialized, then this `i' will not be used, so there
17895 is no harm in resolving the types here. */
17896 tree type;
17898 /* Resolve the TYPENAME_TYPE. */
17901 /* If that failed, the declarator is invalid. */
17903 {
17906 "cannot define member of dependent typedef "
17908 else
17913 }
17915 }
17920 {
17921 tree class_type;
17926 else
17930 {
17933 {
17936 {
17940 "use %<%T::%D%> instead of %<%T::%D%> to "
17942 class_type,
17947 }
17948 else
17950 }
17951 else
17952 {
17953 /* We do not attempt to print the declarator
17954 here because we do not have enough
17955 information about its original syntactic
17956 form. */
17960 }
17961 }
17964 {
17970 for an anonymous type, even if the type
17971 got a name for linkage purposes. */
17973 /* Handle correctly (c++/19200):
17975 struct S {
17976 struct T{};
17977 friend void S(T);
17978 };
17980 and also:
17982 namespace N {
17983 void S();
17984 }
17986 struct S {
17987 friend void N::S();
17988 }; */
17989 && !(friend_p
17992 class_type))
17993 {
17996 }
18004 }
18005 }
18007 unqualified_name,
18008 sfk);
18015 }
18017 handle_declarator:;
18020 {
18021 /* Any names that appear after the declarator-id for a
18022 member are looked up in the containing scope. */
18024 {
18025 /* But declarations with qualified-ids can't appear in a
18026 function. */
18030 }
18032 }
18036 /* Default args are only allowed on function
18037 declarations. */
18039 else
18043 }
18044 /* We're done. */
18045 else
18047 }
18049 /* For an abstract declarator, we might wind up with nothing at this
18050 point. That's an error; the declarator is not optional. */
18054 /* If we entered a scope, we must exit it now. */
18062 }
18064 /* Parse a ptr-operator.
18066 ptr-operator:
18067 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18068 * cv-qualifier-seq [opt]
18069 &
18070 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18071 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18073 GNU Extension:
18075 ptr-operator:
18076 & cv-qualifier-seq [opt]
18078 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18079 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18080 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18081 filled in with the TYPE containing the member. *CV_QUALS is
18082 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18083 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18084 Note that the tree codes returned by this function have nothing
18085 to do with the types of trees that will be eventually be created
18086 to represent the pointer or reference type being parsed. They are
18087 just constants with suggestive names. */
18088 static enum tree_code
18093 {
18098 /* Assume that it's not a pointer-to-member. */
18100 /* And that there are no cv-qualifiers. */
18103 /* Peek at the next token. */
18106 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18116 {
18117 /* Consume the `*', `&' or `&&'. */
18120 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18121 `&', if we are allowing GNU extensions. (The only qualifier
18122 that can legally appear after `&' is `restrict', but that is
18123 enforced during semantic analysis. */
18131 }
18132 else
18133 {
18134 /* Try the pointer-to-member case. */
18136 /* Look for the optional `::' operator. */
18139 /* Look for the nested-name specifier. */
18146 /* If we found it, and the next token is a `*', then we are
18147 indeed looking at a pointer-to-member operator. */
18150 {
18151 /* Indicate that the `*' operator was used. */
18159 else
18160 {
18161 /* The type of which the member is a member is given by the
18162 current SCOPE. */
18164 /* The next name will not be qualified. */
18168 /* Look for optional c++11 attributes. */
18172 /* Look for the optional cv-qualifier-seq. */
18174 }
18175 }
18176 /* If that didn't work we don't have a ptr-operator. */
18179 }
18182 }
18184 /* Parse an (optional) cv-qualifier-seq.
18186 cv-qualifier-seq:
18187 cv-qualifier cv-qualifier-seq [opt]
18189 cv-qualifier:
18190 const
18191 volatile
18193 GNU Extension:
18195 cv-qualifier:
18196 __restrict__
18198 Returns a bitmask representing the cv-qualifiers. */
18200 static cp_cv_quals
18202 {
18206 {
18208 cp_cv_quals cv_qualifier;
18210 /* Peek at the next token. */
18212 /* See if it's a cv-qualifier. */
18214 {
18230 }
18236 {
18239 }
18240 else
18241 {
18244 }
18245 }
18248 }
18250 /* Parse an (optional) ref-qualifier
18252 ref-qualifier:
18253 &
18254 &&
18256 Returns cp_ref_qualifier representing ref-qualifier. */
18258 static cp_ref_qualifier
18260 {
18263 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18268 {
18273 {
18285 }
18290 {
18293 }
18294 else
18295 {
18298 }
18299 }
18302 }
18304 /* Parse an (optional) virt-specifier-seq.
18306 virt-specifier-seq:
18307 virt-specifier virt-specifier-seq [opt]
18309 virt-specifier:
18310 override
18311 final
18313 Returns a bitmask representing the virt-specifiers. */
18315 static cp_virt_specifiers
18317 {
18321 {
18323 cp_virt_specifiers virt_specifier;
18325 /* Peek at the next token. */
18327 /* See if it's a virt-specifier-qualifier. */
18331 {
18334 }
18336 {
18339 }
18341 {
18343 }
18344 else
18348 {
18351 }
18352 else
18353 {
18356 }
18357 }
18359 }
18361 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18362 is in scope even though it isn't real. */
18364 void
18366 {
18367 tree this_parm;
18370 {
18371 /* We don't clear this between NSDMIs. Is it already what we want? */
18376 }
18379 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18381 current_class_ref
18384 }
18386 /* Return true iff our current scope is a non-static data member
18387 initializer. */
18389 bool
18391 {
18392 /* We recognize NSDMI context by the context-less 'this' pointer set up
18393 by the function above. */
18399 }
18401 /* Parse a late-specified return type, if any. This is not a separate
18402 non-terminal, but part of a function declarator, which looks like
18404 -> trailing-type-specifier-seq abstract-declarator(opt)
18406 Returns the type indicated by the type-id.
18408 In addition to this this parses any queued up omp declare simd
18409 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18411 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18412 function. */
18414 static tree
18416 cp_cv_quals quals)
18417 {
18421 && declarator
18427 /* Peek at the next token. */
18429 /* A late-specified return type is indicated by an initial '->'. */
18436 {
18437 /* DR 1207: 'this' is in scope in the trailing return type. */
18439 }
18442 {
18443 /* Consume the ->. */
18447 }
18450 declarator->std_attributes
18454 declarator->std_attributes
18459 {
18462 }
18465 }
18467 /* Parse a declarator-id.
18469 declarator-id:
18470 id-expression
18471 :: [opt] nested-name-specifier [opt] type-name
18473 In the `id-expression' case, the value returned is as for
18474 cp_parser_id_expression if the id-expression was an unqualified-id.
18475 If the id-expression was a qualified-id, then a SCOPE_REF is
18476 returned. The first operand is the scope (either a NAMESPACE_DECL
18477 or TREE_TYPE), but the second is still just a representation of an
18478 unqualified-id. */
18480 static tree
18482 {
18483 tree id;
18484 /* The expression must be an id-expression. Assume that qualified
18485 names are the names of types so that:
18487 template <class T>
18488 int S<T>::R::i = 3;
18490 will work; we must treat `S<T>::R' as the name of a type.
18491 Similarly, assume that qualified names are templates, where
18492 required, so that:
18494 template <class T>
18495 int S<T>::R<T>::i = 3;
18497 will work, too. */
18503 optional_p);
18507 }
18509 /* Parse a type-id.
18511 type-id:
18512 type-specifier-seq abstract-declarator [opt]
18514 Returns the TYPE specified. */
18516 static tree
18519 {
18520 cp_decl_specifier_seq type_specifier_seq;
18523 /* Parse the type-specifier-seq. */
18525 is_trailing_return,
18530 /* There might or might not be an abstract declarator. */
18532 /* Look for the declarator. */
18533 abstract_declarator
18538 /* Check to see if there really was a declarator. */
18543 /* None of the valid uses of 'auto' in C++14 involve the type-id
18544 nonterminal, but it is valid in a trailing-return-type. */
18547 {
18548 /* A type-id with type 'auto' is only ok if the abstract declarator
18549 is a function declarator with a late-specified return type. */
18554 else
18555 {
18558 }
18559 }
18562 is_template_arg);
18563 }
18566 {
18568 }
18571 {
18572 tree r;
18574 parser->type_definition_forbidden_message
18579 {
18582 }
18584 }
18587 {
18589 }
18591 /* Parse a type-specifier-seq.
18593 type-specifier-seq:
18594 type-specifier type-specifier-seq [opt]
18596 GNU extension:
18598 type-specifier-seq:
18599 attributes type-specifier-seq [opt]
18601 If IS_DECLARATION is true, we are at the start of a "condition" or
18602 exception-declaration, so we might be followed by a declarator-id.
18604 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18605 i.e. we've just seen "->".
18607 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18609 static void
18614 {
18619 /* Clear the TYPE_SPECIFIER_SEQ. */
18622 /* In the context of a trailing return type, enum E { } is an
18623 elaborated-type-specifier followed by a function-body, not an
18624 enum-specifier. */
18628 /* Parse the type-specifiers and attributes. */
18630 {
18631 tree type_specifier;
18634 /* Check for attributes first. */
18636 {
18641 }
18643 /* record the token of the beginning of the type specifier seq,
18644 for error reporting purposes*/
18648 /* Look for the type-specifier. */
18650 flags,
18651 type_specifier_seq,
18653 NULL,
18656 {
18657 /* If the first type-specifier could not be found, this is not a
18658 type-specifier-seq at all. */
18660 {
18661 /* Set in_declarator_p to avoid skipping to the semicolon. */
18673 }
18674 /* If subsequent type-specifiers could not be found, the
18675 type-specifier-seq is complete. */
18677 }
18680 /* The standard says that a condition can be:
18682 type-specifier-seq declarator = assignment-expression
18684 However, given:
18686 struct S {};
18687 if (int S = ...)
18689 we should treat the "S" as a declarator, not as a
18690 type-specifier. The standard doesn't say that explicitly for
18691 type-specifier-seq, but it does say that for
18692 decl-specifier-seq in an ordinary declaration. Perhaps it
18693 would be clearer just to allow a decl-specifier-seq here, and
18694 then add a semantic restriction that if any decl-specifiers
18695 that are not type-specifiers appear, the program is invalid. */
18698 }
18699 }
18701 /* Return whether the function currently being declared has an associated
18702 template parameter list. */
18704 static bool
18706 {
18719 }
18721 /* Parse a parameter-declaration-clause.
18723 parameter-declaration-clause:
18724 parameter-declaration-list [opt] ... [opt]
18725 parameter-declaration-list , ...
18727 Returns a representation for the parameter declarations. A return
18728 value of NULL indicates a parameter-declaration-clause consisting
18729 only of an ellipsis. */
18731 static tree
18733 {
18734 tree parameters;
18743 parser->auto_is_implicit_function_template_parm_p
18745 }
18751 && !processing_template_parmlist
18757 /* Peek at the next token. */
18759 /* Check for trivial parameter-declaration-clauses. */
18761 {
18762 /* Consume the `...' token. */
18765 }
18767 /* There are no parameters. */
18768 {
18769 #ifndef NO_IMPLICIT_EXTERN_C
18774 else
18775 #endif
18777 }
18778 /* Check for `(void)', too, which is a special case. */
18782 {
18783 /* Consume the `void' token. */
18785 /* There are no parameters. */
18787 }
18789 /* Parse the parameter-declaration-list. */
18791 /* If a parse error occurred while parsing the
18792 parameter-declaration-list, then the entire
18793 parameter-declaration-clause is erroneous. */
18797 /* Peek at the next token. */
18799 /* If it's a `,', the clause should terminate with an ellipsis. */
18801 {
18802 /* Consume the `,'. */
18804 /* Expect an ellipsis. */
18805 ellipsis_p
18807 }
18808 /* It might also be `...' if the optional trailing `,' was
18809 omitted. */
18811 {
18812 /* Consume the `...' token. */
18814 /* And remember that we saw it. */
18816 }
18817 else
18820 /* Finish the parameter list. */
18825 }
18827 /* Parse a parameter-declaration-list.
18829 parameter-declaration-list:
18830 parameter-declaration
18831 parameter-declaration-list , parameter-declaration
18833 Returns a representation of the parameter-declaration-list, as for
18834 cp_parser_parameter_declaration_clause. However, the
18835 `void_list_node' is never appended to the list. Upon return,
18836 *IS_ERROR will be true iff an error occurred. */
18838 static tree
18840 {
18846 /* Assume all will go well. */
18848 /* The special considerations that apply to a function within an
18849 unbraced linkage specifications do not apply to the parameters
18850 to the function. */
18851 saved_in_unbraced_linkage_specification_p
18855 /* Look for more parameters. */
18857 {
18865 /* Parse the parameter. */
18866 parameter
18871 /* We don't know yet if the enclosing context is deprecated, so wait
18872 and warn in grokparms if appropriate. */
18876 {
18877 /* If a function parameter pack was specified and an implicit template
18878 parameter was introduced during cp_parser_parameter_declaration,
18879 change any implicit parameters introduced into packs. */
18883 {
18891 }
18895 PARM,
18898 }
18902 /* If a parse error occurred parsing the parameter declaration,
18903 then the entire parameter-declaration-list is erroneous. */
18905 {
18909 }
18919 {
18923 }
18925 /* Add the new parameter to the list. */
18929 /* Peek at the next token. */
18932 /* These are for Objective-C++ */
18935 /* The parameter-declaration-list is complete. */
18938 {
18941 /* Peek at the next token. */
18943 /* If it's an ellipsis, then the list is complete. */
18946 /* Otherwise, there must be more parameters. Consume the
18947 `,'. */
18949 /* When parsing something like:
18951 int i(float f, double d)
18953 we can tell after seeing the declaration for "f" that we
18954 are not looking at an initialization of a variable "i",
18955 but rather at the declaration of a function "i".
18957 Due to the fact that the parsing of template arguments
18958 (as specified to a template-id) requires backtracking we
18959 cannot use this technique when inside a template argument
18960 list. */
18964 /* However, a parameter-declaration of the form
18965 "float(f)" (which is a valid declaration of a
18966 parameter "f") can also be interpreted as an
18967 expression (the conversion of "f" to "float"). */
18970 }
18971 else
18972 {
18980 }
18981 }
18983 parser->in_unbraced_linkage_specification_p
18986 /* Reset implicit_template_scope if we are about to leave the function
18987 parameter list that introduced it. Note that for out-of-line member
18988 definitions, there will be one or more class scopes before we get to
18989 the template parameter scope. */
18993 {
18997 {
19000 }
19001 }
19004 }
19006 /* Parse a parameter declaration.
19008 parameter-declaration:
19009 decl-specifier-seq ... [opt] declarator
19010 decl-specifier-seq declarator = assignment-expression
19011 decl-specifier-seq ... [opt] abstract-declarator [opt]
19012 decl-specifier-seq abstract-declarator [opt] = assignment-expression
19014 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
19015 declares a template parameter. (In that case, a non-nested `>'
19016 token encountered during the parsing of the assignment-expression
19017 is not interpreted as a greater-than operator.)
19019 Returns a representation of the parameter, or NULL if an error
19020 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
19021 true iff the declarator is of the form "(p)". */
19027 {
19029 cp_decl_specifier_seq decl_specifiers;
19031 tree default_argument;
19035 /* In a template parameter, `>' is not an operator.
19037 [temp.param]
19039 When parsing a default template-argument for a non-type
19040 template-parameter, the first non-nested `>' is taken as the end
19041 of the template parameter-list rather than a greater-than
19042 operator. */
19044 /* Type definitions may not appear in parameter types. */
19046 parser->type_definition_forbidden_message
19049 /* Parse the declaration-specifiers. */
19051 CP_PARSER_FLAGS_NONE,
19055 /* Complain about missing 'typename' or other invalid type names. */
19060 /* If an error occurred, there's no reason to attempt to parse the
19061 rest of the declaration. */
19063 {
19066 }
19068 /* Peek at the next token. */
19071 /* If the next token is a `)', `,', `=', `>', or `...', then there
19072 is no declarator. However, when variadic templates are enabled,
19073 there may be a declarator following `...'. */
19078 {
19082 }
19083 /* Otherwise, there should be a declarator. */
19084 else
19085 {
19089 /* After seeing a decl-specifier-seq, if the next token is not a
19090 "(", there is no possibility that the code is a valid
19091 expression. Therefore, if parsing tentatively, we commit at
19092 this point. */
19094 /* In an expression context, having seen:
19096 (int((char ...
19098 we cannot be sure whether we are looking at a
19099 function-type (taking a "char" as a parameter) or a cast
19100 of some object of type "char" to "int". */
19106 /* Parse the declarator. */
19109 CP_PARSER_DECLARATOR_EITHER,
19111 parenthesized_p,
19115 /* After the declarator, allow more attributes. */
19116 decl_specifiers.attributes
19119 }
19121 /* If the next token is an ellipsis, and we have not seen a
19122 declarator name, and the type of the declarator contains parameter
19123 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19124 a parameter pack expansion expression. Otherwise, leave the
19125 ellipsis for a C-style variadic function. */
19128 {
19139 {
19140 /* Consume the `...'. */
19144 /* Build a pack expansion type */
19147 else
19149 }
19150 }
19152 /* The restriction on defining new types applies only to the type
19153 of the parameter, not to the default argument. */
19156 /* If the next token is `=', then process a default argument. */
19158 {
19160 /* If we are defining a class, then the tokens that make up the
19161 default argument must be saved and processed later. */
19166 /* Outside of a class definition, we can just parse the
19167 assignment-expression. */
19168 else
19169 default_argument
19173 {
19176 else
19177 {
19179 "default arguments are only "
19182 }
19183 }
19187 {
19188 /* Find the name of the parameter pack. */
19195 template_parm_p
19201 else
19203 template_parm_p
19210 }
19211 }
19212 else
19216 declarator,
19217 default_argument);
19218 }
19220 /* Parse a default argument and return it.
19222 TEMPLATE_PARM_P is true if this is a default argument for a
19223 non-type template parameter. */
19224 static tree
19226 {
19232 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19233 set correctly. */
19236 /* Local variable names (and the `this' keyword) may not
19237 appear in a default argument. */
19240 /* Parse the assignment-expression. */
19245 /* The "this" pointer is not valid in a default argument. */
19247 {
19252 }
19253 default_argument
19255 /* Restore the "this" pointer. */
19257 {
19260 }
19269 }
19271 /* Parse a function-body.
19273 function-body:
19274 compound_statement */
19276 static void
19278 {
19280 }
19282 /* Parse a ctor-initializer-opt followed by a function-body. Return
19283 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19284 is true we are parsing a function-try-block. */
19286 static bool
19289 {
19297 /* Begin the function body. */
19299 /* Parse the optional ctor-initializer. */
19302 /* If we're parsing a constexpr constructor definition, we need
19303 to check that the constructor body is indeed empty. However,
19304 before we get to cp_parser_function_body lot of junk has been
19305 generated, so we can't just check that we have an empty block.
19306 Rather we take a snapshot of the outermost block, and check whether
19307 cp_parser_function_body changed its state. */
19309 {
19313 }
19314 /* Parse the function-body. */
19318 /* Finish the function body. */
19322 }
19324 /* Parse an initializer.
19326 initializer:
19327 = initializer-clause
19328 ( expression-list )
19330 Returns an expression representing the initializer. If no
19331 initializer is present, NULL_TREE is returned.
19333 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19334 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19335 set to TRUE if there is no initializer present. If there is an
19336 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19337 is set to true; otherwise it is set to false. */
19339 static tree
19342 {
19344 tree init;
19346 /* Peek at the next token. */
19349 /* Let our caller know whether or not this initializer was
19350 parenthesized. */
19352 /* Assume that the initializer is constant. */
19356 {
19357 /* Consume the `='. */
19359 /* Parse the initializer-clause. */
19361 }
19363 {
19368 non_constant_p);
19373 }
19375 {
19380 }
19381 else
19382 {
19383 /* Anything else is an error. */
19386 }
19389 }
19391 /* Parse an initializer-clause.
19393 initializer-clause:
19394 assignment-expression
19395 braced-init-list
19397 Returns an expression representing the initializer.
19399 If the `assignment-expression' production is used the value
19400 returned is simply a representation for the expression.
19402 Otherwise, calls cp_parser_braced_list. */
19404 static tree
19406 {
19407 tree initializer;
19409 /* Assume the expression is constant. */
19412 /* If it is not a `{', then we are looking at an
19413 assignment-expression. */
19415 {
19416 initializer
19419 non_constant_p);
19420 }
19421 else
19425 }
19427 /* Parse a brace-enclosed initializer list.
19429 braced-init-list:
19430 { initializer-list , [opt] }
19431 { }
19433 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19434 the elements of the initializer-list (or NULL, if the last
19435 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19436 NULL_TREE. There is no way to detect whether or not the optional
19437 trailing `,' was provided. NON_CONSTANT_P is as for
19438 cp_parser_initializer. */
19440 static tree
19442 {
19443 tree initializer;
19445 /* Consume the `{' token. */
19447 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19449 /* If it's not a `}', then there is a non-trivial initializer. */
19451 {
19452 /* Parse the initializer list. */
19455 /* A trailing `,' token is allowed. */
19458 }
19459 else
19461 /* Now, there should be a trailing `}'. */
19465 }
19467 /* Consume tokens up to, and including, the next non-nested closing `]'.
19468 Returns true iff we found a closing `]'. */
19470 static bool
19472 {
19476 {
19480 {
19483 /* If we've run out of tokens, then there is no closing `]'. */
19492 {
19495 }
19500 }
19502 /* Consume the token. */
19504 }
19505 }
19507 /* Return true if we are looking at an array-designator, false otherwise. */
19509 static bool
19511 {
19512 /* Consume the `['. */
19517 /* Skip tokens until the next token is a closing square bracket.
19518 If we find the closing `]', and the next token is a `=', then
19519 we are looking at an array designator. */
19520 bool array_designator_p
19524 /* Roll back the tokens we skipped. */
19528 }
19530 /* Parse an initializer-list.
19532 initializer-list:
19533 initializer-clause ... [opt]
19534 initializer-list , initializer-clause ... [opt]
19536 GNU Extension:
19538 initializer-list:
19539 designation initializer-clause ...[opt]
19540 initializer-list , designation initializer-clause ...[opt]
19542 designation:
19543 . identifier =
19544 identifier :
19545 [ constant-expression ] =
19547 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19548 for the initializer. If the INDEX of the elt is non-NULL, it is the
19549 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19550 as for cp_parser_initializer. */
19554 {
19557 /* Assume all of the expressions are constant. */
19560 /* Parse the rest of the list. */
19562 {
19564 tree designator;
19565 tree initializer;
19568 /* If the next token is an identifier and the following one is a
19569 colon, we are looking at the GNU designated-initializer
19570 syntax. */
19574 {
19575 /* Warn the user that they are using an extension. */
19578 /* Consume the identifier. */
19580 /* Consume the `:'. */
19582 }
19583 /* Also handle the C99 syntax, '. id ='. */
19588 {
19589 /* Warn the user that they are using an extension. */
19592 /* Consume the `.'. */
19594 /* Consume the identifier. */
19596 /* Consume the `='. */
19598 }
19599 /* Also handle C99 array designators, '[ const ] ='. */
19603 {
19604 /* In C++11, [ could start a lambda-introducer. */
19610 {
19613 }
19614 else
19615 {
19620 }
19626 }
19627 else
19630 /* Parse the initializer. */
19633 /* If any clause is non-constant, so is the entire initializer. */
19637 /* If we have an ellipsis, this is an initializer pack
19638 expansion. */
19640 {
19641 /* Consume the `...'. */
19644 /* Turn the initializer into an initializer expansion. */
19646 }
19648 /* Add it to the vector. */
19651 /* If the next token is not a comma, we have reached the end of
19652 the list. */
19656 /* Peek at the next token. */
19658 /* If the next token is a `}', then we're still done. An
19659 initializer-clause can have a trailing `,' after the
19660 initializer-list and before the closing `}'. */
19664 /* Consume the `,' token. */
19666 }
19669 }
19671 /* Classes [gram.class] */
19673 /* Parse a class-name.
19675 class-name:
19676 identifier
19677 template-id
19679 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19680 to indicate that names looked up in dependent types should be
19681 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19682 keyword has been used to indicate that the name that appears next
19683 is a template. TAG_TYPE indicates the explicit tag given before
19684 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19685 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19686 is the class being defined in a class-head. If ENUM_OK is TRUE,
19687 enum-names are also accepted.
19689 Returns the TYPE_DECL representing the class. */
19691 static tree
19700 {
19701 tree decl;
19702 tree scope;
19707 /* All class-names start with an identifier. */
19710 {
19713 }
19715 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19716 to a template-id, so we save it here. */
19721 /* Any name names a type if we're following the `typename' keyword
19722 in a qualified name where the enclosing scope is type-dependent. */
19725 /* Handle the common case (an identifier, but not a template-id)
19726 efficiently. */
19729 {
19733 /* Look for the identifier. */
19737 /* If the next token isn't an identifier, we are certainly not
19738 looking at a class-name. */
19741 /* If we know this is a type-name, there's no need to look it
19742 up. */
19745 else
19746 {
19747 tree ambiguous_decls;
19748 /* If we already know that this lookup is ambiguous, then
19749 we've already issued an error message; there's no reason
19750 to check again. */
19752 {
19755 }
19756 /* If the next token is a `::', then the name must be a type
19757 name.
19759 [basic.lookup.qual]
19761 During the lookup for a name preceding the :: scope
19762 resolution operator, object, function, and enumerator
19763 names are ignored. */
19766 /* Look up the name. */
19768 tag_type,
19771 check_dependency_p,
19775 {
19779 }
19780 }
19781 }
19782 else
19783 {
19784 /* Try a template-id. */
19786 check_dependency_p,
19787 tag_type,
19788 is_declaration);
19791 }
19795 /* If this is a typename, create a TYPENAME_TYPE. */
19797 {
19802 }
19806 /* Check to see that it is really the name of a class. */
19810 /* Situations like this:
19812 template <typename T> struct A {
19813 typename T::template X<int>::I i;
19814 };
19816 are problematic. Is `T::template X<int>' a class-name? The
19817 standard does not seem to be definitive, but there is no other
19818 valid interpretation of the following `::'. Therefore, those
19819 names are considered class-names. */
19820 {
19824 }
19829 /* In Objective-C 2.0, a classname followed by '.' starts a
19830 dot-syntax expression, and it's not a type-name. */
19842 }
19844 /* Parse a class-specifier.
19846 class-specifier:
19847 class-head { member-specification [opt] }
19849 Returns the TREE_TYPE representing the class. */
19851 static tree
19853 {
19854 tree type;
19868 /* Parse the class-head. */
19871 /* If the class-head was a semantic disaster, skip the entire body
19872 of the class. */
19874 {
19878 }
19880 /* Look for the `{'. */
19882 {
19885 }
19889 /* Issue an error message if type-definitions are forbidden here. */
19891 /* Remember that we are defining one more class. */
19893 /* Inside the class, surrounding template-parameter-lists do not
19894 apply. */
19895 saved_num_template_parameter_lists
19898 /* We are not in a function body. */
19901 /* Or in a loop. */
19904 /* Or in a switch. */
19907 /* We are not immediately inside an extern "lang" block. */
19908 saved_in_unbraced_linkage_specification_p
19912 /* Start the class. */
19914 {
19917 }
19921 /* If the type is erroneous, skip the entire body of the class. */
19923 else
19924 /* Parse the member-specification. */
19927 /* Look for the trailing `}'. */
19929 /* Look for trailing attributes to apply to this class. */
19937 /* We've finished a type definition. Check for the common syntax
19938 error of forgetting a semicolon after the definition. We need to
19939 be careful, as we can't just check for not-a-semicolon and be done
19940 with it; the user might have typed:
19942 class X { } c = ...;
19943 class X { } *p = ...;
19945 and so forth. Instead, enumerate all the possible tokens that
19946 might follow this production; if we don't see one of them, then
19947 complain and silently insert the semicolon. */
19948 {
19953 /* Don't try to parse c++11 attributes here. As per the
19954 grammar, that should be a task for
19955 cp_parser_decl_specifier_seq. */
19959 {
19970 /* While it's legal for type qualifiers and storage class
19971 specifiers to follow type definitions in the grammar, only
19972 compiler testsuites contain code like that. Assume that if
19973 we see such code, then what we're really seeing is a case
19974 like:
19976 class X { }
19977 const <type> var = ...;
19979 or
19981 class Y { }
19982 static <type> func (...) ...
19984 i.e. the qualifier or specifier applies to the next
19985 declaration. To do so, however, we need to look ahead one
19986 more token to see if *that* token is a type specifier.
19988 This code could be improved to handle:
19990 class Z { }
19991 static const <type> var = ...; */
19994 {
19997 /* Handling user-defined types here would be nice, but very
19998 tricky. */
19999 want_semicolon
20002 }
20006 }
20008 /* If we don't have a type, then something is very wrong and we
20009 shouldn't try to do anything clever. Likewise for not seeing the
20010 closing brace. */
20012 {
20013 cp_token_position prev
20024 else
20027 /* Unget one token and smash it to look as though we encountered
20028 a semicolon in the input stream. */
20033 }
20034 }
20036 /* If this class is not itself within the scope of another class,
20037 then we need to parse the bodies of all of the queued function
20038 definitions. Note that the queued functions defined in a class
20039 are not always processed immediately following the
20040 class-specifier for that class. Consider:
20042 struct A {
20043 struct B { void f() { sizeof (A); } };
20044 };
20046 If `f' were processed before the processing of `A' were
20047 completed, there would be no way to compute the size of `A'.
20048 Note that the nesting we are interested in here is lexical --
20049 not the semantic nesting given by TYPE_CONTEXT. In particular,
20050 for:
20052 struct A { struct B; };
20053 struct A::B { void f() { } };
20055 there is no need to delay the parsing of `A::B::f'. */
20057 {
20058 tree decl;
20065 /* In a first pass, parse default arguments to the functions.
20066 Then, in a second pass, parse the bodies of the functions.
20067 This two-phased approach handles cases like:
20069 struct S {
20070 void f() { g(); }
20071 void g(int i = 3);
20072 };
20074 */
20076 {
20078 /* If there are default arguments that have not yet been processed,
20079 take care of them now. */
20081 {
20086 }
20087 /* Make sure that any template parameters are in scope. */
20089 /* Parse the default argument expressions. */
20091 /* Remove any template parameters from the symbol table. */
20093 }
20095 /* Now parse any NSDMIs. */
20099 {
20101 {
20106 }
20109 }
20116 /* Now do some post-NSDMI bookkeeping. */
20122 /* Now parse the body of the functions. */
20124 {
20125 /* OpenMP UDRs need to be parsed before all other functions. */
20132 }
20133 else
20137 }
20138 else
20141 /* Put back any saved access checks. */
20144 /* Restore saved state. */
20148 parser->num_template_parameter_lists
20150 parser->in_unbraced_linkage_specification_p
20154 }
20156 static tree
20158 {
20159 tree ret;
20164 }
20166 /* Parse a class-head.
20168 class-head:
20169 class-key identifier [opt] base-clause [opt]
20170 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20171 class-key nested-name-specifier [opt] template-id
20172 base-clause [opt]
20174 class-virt-specifier:
20175 final
20177 GNU Extensions:
20178 class-key attributes identifier [opt] base-clause [opt]
20179 class-key attributes nested-name-specifier identifier base-clause [opt]
20180 class-key attributes nested-name-specifier [opt] template-id
20181 base-clause [opt]
20183 Upon return BASES is initialized to the list of base classes (or
20184 NULL, if there are none) in the same form returned by
20185 cp_parser_base_clause.
20187 Returns the TYPE of the indicated class. Sets
20188 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20189 involving a nested-name-specifier was used, and FALSE otherwise.
20191 Returns error_mark_node if this is not a class-head.
20193 Returns NULL_TREE if the class-head is syntactically valid, but
20194 semantically invalid in a way that means we should skip the entire
20195 body of the class. */
20197 static tree
20200 {
20201 tree nested_name_specifier;
20205 tree attributes;
20206 tree bases;
20216 /* Assume no nested-name-specifier will be present. */
20218 /* Assume no template parameter lists will be used in defining the
20219 type. */
20223 /* Look for the class-key. */
20228 /* Parse the attributes. */
20231 /* If the next token is `::', that is invalid -- but sometimes
20232 people do try to write:
20234 struct ::S {};
20236 Handle this gracefully by accepting the extra qualifier, and then
20237 issuing an error about it later if this really is a
20238 class-head. If it turns out just to be an elaborated type
20239 specifier, remain silent. */
20245 /* Determine the name of the class. Begin by looking for an
20246 optional nested-name-specifier. */
20248 nested_name_specifier
20254 /* If there was a nested-name-specifier, then there *must* be an
20255 identifier. */
20257 {
20259 /* Although the grammar says `identifier', it really means
20260 `class-name' or `template-name'. You are only allowed to
20261 define a class that has already been declared with this
20262 syntax.
20264 The proposed resolution for Core Issue 180 says that wherever
20265 you see `class T::X' you should treat `X' as a type-name.
20267 It is OK to define an inaccessible class; for example:
20269 class A { class B; };
20270 class A::B {};
20272 We do not know if we will see a class-name, or a
20273 template-name. We look for a class-name first, in case the
20274 class-name is a template-id; if we looked for the
20275 template-name first we would stop after the template-name. */
20280 class_type,
20284 /* If that didn't work, ignore the nested-name-specifier. */
20286 {
20292 }
20293 /* If we could not find a corresponding TYPE, treat this
20294 declaration like an unqualified declaration. */
20297 /* Otherwise, count the number of templates used in TYPE and its
20298 containing scopes. */
20299 else
20300 {
20301 tree scope;
20313 }
20314 }
20315 /* Otherwise, the identifier is optional. */
20316 else
20317 {
20318 /* We don't know whether what comes next is a template-id,
20319 an identifier, or nothing at all. */
20321 /* Check for a template-id. */
20326 class_key,
20328 /* If that didn't work, it could still be an identifier. */
20330 {
20332 {
20335 }
20336 else
20338 }
20339 else
20340 {
20343 }
20344 }
20349 {
20351 class_key,
20353 }
20356 /* If it's not a `:' or a `{' then we can't really be looking at a
20357 class-head, since a class-head only appears as part of a
20358 class-specifier. We have to detect this situation before calling
20359 xref_tag, since that has irreversible side-effects. */
20361 {
20365 }
20367 /* At this point, we're going ahead with the class-specifier, even
20368 if some other problem occurs. */
20371 {
20376 }
20377 /* Issue the error about the overly-qualified name now. */
20379 {
20384 }
20386 {
20391 }
20393 {
20394 tree scope;
20396 /* Reject typedef-names in class heads. */
20398 {
20401 type);
20404 }
20406 /* Figure out in what scope the declaration is being placed. */
20408 /* If that scope does not contain the scope in which the
20409 class was originally declared, the program is invalid. */
20411 {
20414 "declaration of %qD in namespace %qD which does not "
20417 else
20423 }
20424 /* [dcl.meaning]
20426 A declarator-id shall not be qualified except for the
20427 definition of a ... nested class outside of its class
20428 ... [or] the definition or explicit instantiation of a
20429 class member of a namespace outside of its namespace. */
20431 {
20436 }
20437 }
20438 /* An explicit-specialization must be preceded by "template <>". If
20439 it is not, try to recover gracefully. */
20443 {
20447 /* Take the same action that would have been taken by
20448 cp_parser_explicit_specialization. */
20451 }
20452 /* There must be no "return" statements between this point and the
20453 end of this function; set "type "to the correct return value and
20454 use "goto done;" to return. */
20455 /* Make sure that the right number of template parameters were
20456 present. */
20460 {
20461 /* If something went wrong, there is no point in even trying to
20462 process the class-definition. */
20465 }
20467 /* Look up the type. */
20469 {
20473 {
20477 }
20478 else
20479 {
20482 }
20485 }
20487 {
20488 tree class_type;
20490 /* Given:
20492 template <typename T> struct S { struct T };
20493 template <typename T> struct S<T>::T { };
20495 we will get a TYPENAME_TYPE when processing the definition of
20496 `S::T'. We need to resolve it to the actual type before we
20497 try to define it. */
20499 {
20504 else
20505 {
20508 }
20509 }
20513 {
20516 }
20519 /* Enter the scope indicated by the nested-name-specifier. */
20521 /* Get the canonical version of this type. */
20523 /* Call push_template_decl if it seems like we should be defining a
20524 template either from the template headers or the type we're
20525 defining, so that we diagnose both extra and missing headers. */
20529 {
20532 {
20535 }
20536 }
20540 }
20542 {
20543 /* If the class was unnamed, create a dummy name. */
20548 }
20550 /* Indicate whether this class was declared as a `class' or as a
20551 `struct'. */
20556 /* If this type was already complete, and we see another definition,
20557 that's an error. */
20559 {
20561 type);
20563 type);
20566 }
20571 {
20572 /* Apply attributes now, before any use of the class as a template
20573 argument in its base list. */
20576 }
20578 /* We will have entered the scope containing the class; the names of
20579 base classes should be looked up in that context. For example:
20581 struct A { struct B {}; struct C; };
20582 struct A::C : B {};
20584 is valid. */
20586 /* Get the list of base-classes, if there is one. */
20588 {
20589 /* PR59482: enter the class scope so that base-specifiers are looked
20590 up correctly. */
20594 /* PR59482: get out of the previously pushed class scope so that the
20595 subsequent pops pop the right thing. */
20598 }
20599 else
20602 /* If we're really defining a class, process the base classes.
20603 If they're invalid, fail. */
20608 done:
20609 /* Leave the scope given by the nested-name-specifier. We will
20610 enter the class scope itself while processing the members. */
20615 {
20618 }
20624 out:
20627 }
20629 /* Parse a class-key.
20631 class-key:
20632 class
20633 struct
20634 union
20636 Returns the kind of class-key specified, or none_type to indicate
20637 error. */
20639 static enum tag_types
20641 {
20645 /* Look for the class-key. */
20650 /* Check to see if the TOKEN is a class-key. */
20655 }
20657 /* Parse a type-parameter-key.
20659 type-parameter-key:
20660 class
20661 typename
20662 */
20664 static void
20666 {
20667 /* Look for the type-parameter-key. */
20671 {
20674 /* typename is not allowed in a template template parameter
20675 by the standard until C++1Z. */
20677 "ISO C++ forbids typename key in template template parameter;"
20679 }
20680 else
20684 }
20686 /* Parse an (optional) member-specification.
20688 member-specification:
20689 member-declaration member-specification [opt]
20690 access-specifier : member-specification [opt] */
20692 static void
20694 {
20696 {
20700 /* Peek at the next token. */
20702 /* If it's a `}', or EOF then we've seen all the members. */
20708 /* See if this token is a keyword. */
20711 {
20715 /* Consume the access-specifier. */
20717 /* Remember which access-specifier is active. */
20719 /* Look for the `:'. */
20724 /* Accept #pragmas at class scope. */
20726 {
20729 }
20731 /* Otherwise, the next construction must be a
20732 member-declaration. */
20734 }
20735 }
20736 }
20738 /* Parse a member-declaration.
20740 member-declaration:
20741 decl-specifier-seq [opt] member-declarator-list [opt] ;
20742 function-definition ; [opt]
20743 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20744 using-declaration
20745 template-declaration
20746 alias-declaration
20748 member-declarator-list:
20749 member-declarator
20750 member-declarator-list , member-declarator
20752 member-declarator:
20753 declarator pure-specifier [opt]
20754 declarator constant-initializer [opt]
20755 identifier [opt] : constant-expression
20757 GNU Extensions:
20759 member-declaration:
20760 __extension__ member-declaration
20762 member-declarator:
20763 declarator attributes [opt] pure-specifier [opt]
20764 declarator attributes [opt] constant-initializer [opt]
20765 identifier [opt] attributes [opt] : constant-expression
20767 C++0x Extensions:
20769 member-declaration:
20770 static_assert-declaration */
20772 static void
20774 {
20775 cp_decl_specifier_seq decl_specifiers;
20776 tree prefix_attributes;
20777 tree decl;
20786 /* Check for the `__extension__' keyword. */
20788 {
20789 /* Recurse. */
20791 /* Restore the old value of the PEDANTIC flag. */
20795 }
20797 /* Check for a template-declaration. */
20799 {
20800 /* An explicit specialization here is an error condition, and we
20801 expect the specialization handler to detect and report this. */
20805 else
20809 }
20811 /* Check for a using-declaration. */
20813 {
20815 {
20816 /* Parse the using-declaration. */
20820 }
20821 else
20822 {
20823 tree decl;
20827 /* Note that if we actually see the '=' token after the
20828 identifier, cp_parser_alias_declaration commits the
20829 tentative parse. In that case, we really expects an
20830 alias-declaration. Otherwise, we expect a using
20831 declaration. */
20832 alias_decl_expected =
20838 else
20842 }
20843 }
20845 /* Check for @defs. */
20847 {
20852 {
20857 }
20859 }
20861 /* If the next token is `static_assert' we have a static assertion. */
20863 {
20866 }
20873 /* Parse the decl-specifier-seq. */
20876 CP_PARSER_FLAGS_OPTIONAL,
20879 /* Check for an invalid type-name. */
20883 /* If there is no declarator, then the decl-specifier-seq should
20884 specify a type. */
20886 {
20887 /* If there was no decl-specifier-seq, and the next token is a
20888 `;', then we have something like:
20890 struct S { ; };
20892 [class.mem]
20894 Each member-declaration shall declare at least one member
20895 name of the class. */
20897 {
20901 }
20902 else
20903 {
20904 tree type;
20906 /* See if this declaration is a friend. */
20908 /* If there were decl-specifiers, check to see if there was
20909 a class-declaration. */
20912 /* Nested classes have already been added to the class, but
20913 a `friend' needs to be explicitly registered. */
20915 {
20916 /* If the `friend' keyword was present, the friend must
20917 be introduced with a class-key. */
20920 "in C++03 a class-key must be used "
20922 /* In this case:
20924 template <typename T> struct A {
20925 friend struct A<T>::B;
20926 };
20928 A<T>::B will be represented by a TYPENAME_TYPE, and
20929 therefore not recognized by check_tag_decl. */
20931 {
20935 }
20938 "friend declaration does not name a class or "
20940 else
20943 }
20944 /* If there is no TYPE, an error message will already have
20945 been issued. */
20947 ;
20948 /* An anonymous aggregate has to be handled specially; such
20949 a declaration really declares a data member (with a
20950 particular type), as opposed to a nested class. */
20952 {
20953 /* C++11 9.5/6. */
20956 "a storage class on an anonymous aggregate "
20959 /* Remove constructors and such from TYPE, now that we
20960 know it is an anonymous aggregate. */
20962 /* And make the corresponding data member. */
20965 /* Add it to the class. */
20967 }
20968 else
20969 cp_parser_check_access_in_redeclaration
20972 }
20973 }
20974 else
20975 {
20978 /* Clear attributes from the decl_specifiers but keep them
20979 around as prefix attributes that apply them to the entity
20980 being declared. */
20984 /* See if these declarations will be friends. */
20987 /* Keep going until we hit the `;' at the end of the
20988 declaration. */
20990 {
20992 tree first_attribute;
20994 /* Peek at the next token. */
20997 /* Check for a bitfield declaration. */
21002 {
21003 tree identifier;
21004 tree width;
21006 /* Get the name of the bitfield. Note that we cannot just
21007 check TOKEN here because it may have been invalidated by
21008 the call to cp_lexer_peek_nth_token above. */
21011 else
21014 /* Consume the `:' token. */
21017 /* Get the width of the bitfield. */
21018 width
21021 /* Look for attributes that apply to the bitfield. */
21023 /* Remember which attributes are prefix attributes and
21024 which are not. */
21026 /* Combine the attributes. */
21029 /* Create the bitfield declaration. */
21032 identifier,
21033 sfk_none)
21036 width,
21037 attributes);
21038 }
21039 else
21040 {
21042 tree initializer;
21043 tree asm_specification;
21046 /* Parse the declarator. */
21047 declarator
21052 friend_p);
21054 /* If something went wrong parsing the declarator, make sure
21055 that we at least consume some tokens. */
21057 {
21058 /* Skip to the end of the statement. */
21060 /* If the next token is not a semicolon, that is
21061 probably because we just skipped over the body of
21062 a function. So, we consume a semicolon if
21063 present, but do not issue an error message if it
21064 is not present. */
21066 CPP_SEMICOLON))
21069 }
21072 cp_parser_check_for_definition_in_return_type
21076 /* Look for an asm-specification. */
21078 /* Look for attributes that apply to the declaration. */
21080 /* Remember which attributes are prefix attributes and
21081 which are not. */
21083 /* Combine the attributes. */
21086 /* If it's an `=', then we have a constant-initializer or a
21087 pure-specifier. It is not correct to parse the
21088 initializer before registering the member declaration
21089 since the member declaration should be in scope while
21090 its initializer is processed. However, the rest of the
21091 front end does not yet provide an interface that allows
21092 us to handle this correctly. */
21094 {
21095 /* In [class.mem]:
21097 A pure-specifier shall be used only in the declaration of
21098 a virtual function.
21100 A member-declarator can contain a constant-initializer
21101 only if it declares a static member of integral or
21102 enumeration type.
21104 Therefore, if the DECLARATOR is for a function, we look
21105 for a pure-specifier; otherwise, we look for a
21106 constant-initializer. When we call `grokfield', it will
21107 perform more stringent semantics checks. */
21119 {
21121 /* Don't require a constant rvalue in C++11, since we
21122 might want a reference constant. We'll enforce
21123 constancy later. */
21125 /* Parse the initializer. */
21128 }
21129 else
21130 /* Parse the initializer. */
21132 }
21135 {
21139 else
21141 }
21142 /* Otherwise, there is no initializer. */
21143 else
21146 /* See if we are probably looking at a function
21147 definition. We are certainly not looking at a
21148 member-declarator. Calling `grokfield' has
21149 side-effects, so we must not do it unless we are sure
21150 that we are looking at a member-declarator. */
21153 {
21154 /* The grammar does not allow a pure-specifier to be
21155 used when a member function is defined. (It is
21156 possible that this fact is an oversight in the
21157 standard, since a pure function may be defined
21158 outside of the class-specifier. */
21164 declarator,
21165 attributes);
21168 /* If the member was not a friend, declare it here. */
21171 /* Peek at the next token. */
21173 /* If the next token is a semicolon, consume it. */
21177 }
21178 else
21181 /* Create the declaration. */
21186 {
21189 else
21191 }
21192 }
21196 /* Reset PREFIX_ATTRIBUTES. */
21202 /* If there is any qualification still in effect, clear it
21203 now; we will be starting fresh with the next declarator. */
21207 /* If it's a `,', then there are more declarators. */
21209 {
21212 {
21216 }
21217 }
21218 /* If the next token isn't a `;', then we have a parse error. */
21220 CPP_SEMICOLON))
21221 {
21222 /* The next token might be a ways away from where the
21223 actual semicolon is missing. Find the previous token
21224 and use that for our error position. */
21229 /* Assume that the user meant to provide a semicolon. If
21230 we were to cp_parser_skip_to_end_of_statement, we might
21231 skip to a semicolon inside a member function definition
21232 and issue nonsensical error messages. */
21234 }
21237 {
21238 /* Add DECL to the list of members. */
21240 /* Explicitly include, eg, NSDMIs, for better error
21241 recovery (c++/58650). */
21250 /* Add DECL to the queue of NSDMI to be parsed later. */
21252 }
21256 }
21257 }
21260 out:
21262 }
21264 /* Parse a pure-specifier.
21266 pure-specifier:
21267 = 0
21269 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21270 Otherwise, ERROR_MARK_NODE is returned. */
21272 static tree
21274 {
21277 /* Look for the `=' token. */
21280 /* Look for the `0' token. */
21289 /* Accept = default or = delete in c++0x mode. */
21292 {
21295 }
21297 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21299 {
21304 }
21306 {
21309 }
21312 }
21314 /* Parse a constant-initializer.
21316 constant-initializer:
21317 = constant-expression
21319 Returns a representation of the constant-expression. */
21321 static tree
21323 {
21324 /* Look for the `=' token. */
21328 /* It is invalid to write:
21330 struct S { static const int i = { 7 }; };
21332 */
21334 {
21337 /* Consume the opening brace. */
21339 /* Skip the initializer. */
21341 /* Look for the trailing `}'. */
21345 }
21348 }
21350 /* Derived classes [gram.class.derived] */
21352 /* Parse a base-clause.
21354 base-clause:
21355 : base-specifier-list
21357 base-specifier-list:
21358 base-specifier ... [opt]
21359 base-specifier-list , base-specifier ... [opt]
21361 Returns a TREE_LIST representing the base-classes, in the order in
21362 which they were declared. The representation of each node is as
21363 described by cp_parser_base_specifier.
21365 In the case that no bases are specified, this function will return
21366 NULL_TREE, not ERROR_MARK_NODE. */
21368 static tree
21370 {
21373 /* Look for the `:' that begins the list. */
21376 /* Scan the base-specifier-list. */
21378 {
21380 tree base;
21383 /* Look for the base-specifier. */
21385 /* Look for the (optional) ellipsis. */
21387 {
21388 /* Consume the `...'. */
21392 }
21394 /* Add BASE to the front of the list. */
21396 {
21398 /* Make this a pack expansion type. */
21402 {
21405 }
21406 }
21407 /* Peek at the next token. */
21409 /* If it's not a comma, then the list is complete. */
21412 /* Consume the `,'. */
21414 }
21416 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21417 base class had a qualified name. However, the next name that
21418 appears is certainly not qualified. */
21424 }
21426 /* Parse a base-specifier.
21428 base-specifier:
21429 :: [opt] nested-name-specifier [opt] class-name
21430 virtual access-specifier [opt] :: [opt] nested-name-specifier
21431 [opt] class-name
21432 access-specifier virtual [opt] :: [opt] nested-name-specifier
21433 [opt] class-name
21435 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21436 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21437 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21438 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21440 static tree
21442 {
21450 tree type;
21452 /* Process the optional `virtual' and `access-specifier'. */
21454 {
21455 /* Peek at the next token. */
21457 /* Process `virtual'. */
21459 {
21461 /* If `virtual' appears more than once, issue an error. */
21463 {
21467 }
21471 /* Consume the `virtual' token. */
21479 /* If more than one access specifier appears, issue an
21480 error. */
21483 {
21487 }
21491 /* Consume the access-specifier. */
21499 }
21500 }
21501 /* It is not uncommon to see programs mechanically, erroneously, use
21502 the 'typename' keyword to denote (dependent) qualified types
21503 as base classes. */
21505 {
21510 else
21512 "keyword %<typename%> not allowed in this context "
21515 }
21517 /* Look for the optional `::' operator. */
21519 /* Look for the nested-name-specifier. The simplest way to
21520 implement:
21522 [temp.res]
21524 The keyword `typename' is not permitted in a base-specifier or
21525 mem-initializer; in these contexts a qualified name that
21526 depends on a template-parameter is implicitly assumed to be a
21527 type name.
21529 is to pretend that we have seen the `typename' keyword at this
21530 point. */
21534 typename_type,
21536 /* If the base class is given by a qualified name, assume that names
21537 we see are type names or templates, as appropriate. */
21543 /* DR 950 allows decltype as a base-specifier. */
21545 else
21546 {
21547 /* Otherwise, look for the class-name. */
21549 class_scope_p,
21550 template_p,
21551 typename_type,
21556 }
21562 }
21564 /* Exception handling [gram.exception] */
21566 /* Parse an (optional) noexcept-specification.
21568 noexcept-specification:
21569 noexcept ( constant-expression ) [opt]
21571 If no noexcept-specification is present, returns NULL_TREE.
21572 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21573 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21574 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21575 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21576 in which case a boolean condition is returned instead. */
21578 static tree
21583 {
21587 /* Peek at the next token. */
21590 /* Is it a noexcept-specification? */
21592 {
21593 tree expr;
21597 {
21601 {
21602 /* Types may not be defined in an exception-specification. */
21604 parser->type_definition_forbidden_message
21608 /* Restore the saved message. */
21610 }
21611 else
21612 {
21615 }
21618 }
21619 else
21620 {
21624 }
21626 /* We cannot build a noexcept-spec right away because this will check
21627 that expr is a constexpr. */
21630 else
21632 }
21633 else
21635 }
21637 /* Parse an (optional) exception-specification.
21639 exception-specification:
21640 throw ( type-id-list [opt] )
21642 Returns a TREE_LIST representing the exception-specification. The
21643 TREE_VALUE of each node is a type. */
21645 static tree
21647 {
21649 tree type_id_list;
21652 /* Peek at the next token. */
21655 /* Is it a noexcept-specification? */
21661 /* If it's not `throw', then there's no exception-specification. */
21665 #if 0
21666 /* Enable this once a lot of code has transitioned to noexcept? */
21670 #endif
21672 /* Consume the `throw'. */
21675 /* Look for the `('. */
21678 /* Peek at the next token. */
21680 /* If it's not a `)', then there is a type-id-list. */
21682 {
21683 /* Types may not be defined in an exception-specification. */
21685 parser->type_definition_forbidden_message
21687 /* Parse the type-id-list. */
21689 /* Restore the saved message. */
21691 }
21692 else
21695 /* Look for the `)'. */
21699 }
21701 /* Parse an (optional) type-id-list.
21703 type-id-list:
21704 type-id ... [opt]
21705 type-id-list , type-id ... [opt]
21707 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21708 in the order that the types were presented. */
21710 static tree
21712 {
21716 {
21718 tree type;
21720 /* Get the next type-id. */
21722 /* Parse the optional ellipsis. */
21724 {
21725 /* Consume the `...'. */
21728 /* Turn the type into a pack expansion expression. */
21730 }
21731 /* Add it to the list. */
21733 /* Peek at the next token. */
21735 /* If it is not a `,', we are done. */
21738 /* Consume the `,'. */
21740 }
21743 }
21745 /* Parse a try-block.
21747 try-block:
21748 try compound-statement handler-seq */
21750 static tree
21752 {
21753 tree try_block;
21767 }
21769 /* Parse a function-try-block.
21771 function-try-block:
21772 try ctor-initializer [opt] function-body handler-seq */
21774 static bool
21776 {
21777 tree compound_stmt;
21778 tree try_block;
21781 /* Look for the `try' keyword. */
21784 /* Let the rest of the front end know where we are. */
21786 /* Parse the function-body. */
21787 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21789 /* We're done with the `try' part. */
21791 /* Parse the handlers. */
21793 /* We're done with the handlers. */
21797 }
21799 /* Parse a handler-seq.
21801 handler-seq:
21802 handler handler-seq [opt] */
21804 static void
21806 {
21808 {
21811 /* Parse the handler. */
21813 /* Peek at the next token. */
21815 /* If it's not `catch' then there are no more handlers. */
21818 }
21819 }
21821 /* Parse a handler.
21823 handler:
21824 catch ( exception-declaration ) compound-statement */
21826 static void
21828 {
21829 tree handler;
21830 tree declaration;
21840 }
21842 /* Parse an exception-declaration.
21844 exception-declaration:
21845 type-specifier-seq declarator
21846 type-specifier-seq abstract-declarator
21847 type-specifier-seq
21848 ...
21850 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21851 ellipsis variant is used. */
21853 static tree
21855 {
21856 cp_decl_specifier_seq type_specifiers;
21860 /* If it's an ellipsis, it's easy to handle. */
21862 {
21863 /* Consume the `...' token. */
21866 }
21868 /* Types may not be defined in exception-declarations. */
21870 parser->type_definition_forbidden_message
21873 /* Parse the type-specifier-seq. */
21877 /* If it's a `)', then there is no declarator. */
21880 else
21887 /* Restore the saved message. */
21894 }
21896 /* Parse a throw-expression.
21898 throw-expression:
21899 throw assignment-expression [opt]
21901 Returns a THROW_EXPR representing the throw-expression. */
21903 static tree
21905 {
21906 tree expression;
21911 /* Figure out whether or not there is an assignment-expression
21912 following the "throw" keyword. */
21920 else
21924 }
21926 /* GNU Extensions */
21928 /* Parse an (optional) asm-specification.
21930 asm-specification:
21931 asm ( string-literal )
21933 If the asm-specification is present, returns a STRING_CST
21934 corresponding to the string-literal. Otherwise, returns
21935 NULL_TREE. */
21937 static tree
21939 {
21941 tree asm_specification;
21943 /* Peek at the next token. */
21945 /* If the next token isn't the `asm' keyword, then there's no
21946 asm-specification. */
21950 /* Consume the `asm' token. */
21952 /* Look for the `('. */
21955 /* Look for the string-literal. */
21958 /* Look for the `)'. */
21962 }
21964 /* Parse an asm-operand-list.
21966 asm-operand-list:
21967 asm-operand
21968 asm-operand-list , asm-operand
21970 asm-operand:
21971 string-literal ( expression )
21972 [ string-literal ] string-literal ( expression )
21974 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21975 each node is the expression. The TREE_PURPOSE is itself a
21976 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21977 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21978 is a STRING_CST for the string literal before the parenthesis. Returns
21979 ERROR_MARK_NODE if any of the operands are invalid. */
21981 static tree
21983 {
21988 {
21989 tree string_literal;
21990 tree expression;
21991 tree name;
21994 {
21995 /* Consume the `[' token. */
21997 /* Read the operand name. */
22002 /* Look for the closing `]'. */
22004 }
22005 else
22007 /* Look for the string-literal. */
22010 /* Look for the `('. */
22012 /* Parse the expression. */
22014 /* Look for the `)'. */
22022 /* Add this operand to the list. */
22024 expression,
22025 asm_operands);
22026 /* If the next token is not a `,', there are no more
22027 operands. */
22030 /* Consume the `,'. */
22032 }
22035 }
22037 /* Parse an asm-clobber-list.
22039 asm-clobber-list:
22040 string-literal
22041 asm-clobber-list , string-literal
22043 Returns a TREE_LIST, indicating the clobbers in the order that they
22044 appeared. The TREE_VALUE of each node is a STRING_CST. */
22046 static tree
22048 {
22052 {
22053 tree string_literal;
22055 /* Look for the string literal. */
22057 /* Add it to the list. */
22059 /* If the next token is not a `,', then the list is
22060 complete. */
22063 /* Consume the `,' token. */
22065 }
22068 }
22070 /* Parse an asm-label-list.
22072 asm-label-list:
22073 identifier
22074 asm-label-list , identifier
22076 Returns a TREE_LIST, indicating the labels in the order that they
22077 appeared. The TREE_VALUE of each node is a label. */
22079 static tree
22081 {
22085 {
22088 /* Look for the identifier. */
22091 {
22094 {
22100 }
22101 }
22102 /* If the next token is not a `,', then the list is
22103 complete. */
22106 /* Consume the `,' token. */
22108 }
22111 }
22113 /* Return TRUE iff the next tokens in the stream are possibly the
22114 beginning of a GNU extension attribute. */
22116 static bool
22118 {
22120 }
22122 /* Return TRUE iff the next tokens in the stream are possibly the
22123 beginning of a standard C++-11 attribute specifier. */
22125 static bool
22127 {
22129 }
22131 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22132 beginning of a standard C++-11 attribute specifier. */
22134 static bool
22136 {
22144 }
22146 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22147 beginning of a GNU extension attribute. */
22149 static bool
22151 {
22155 }
22157 /* Return true iff the next tokens can be the beginning of either a
22158 GNU attribute list, or a standard C++11 attribute sequence. */
22160 static bool
22162 {
22165 }
22167 /* Return true iff the next Nth tokens can be the beginning of either
22168 a GNU attribute list, or a standard C++11 attribute sequence. */
22170 static bool
22172 {
22175 }
22177 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22178 of GNU attributes, or return NULL. */
22180 static tree
22182 {
22186 }
22188 #define CILK_SIMD_FN_CLAUSE_MASK \
22189 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22190 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22191 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22192 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22193 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22195 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22196 vector [(<clauses>)] */
22198 static void
22200 {
22204 {
22209 }
22212 {
22215 paren_scope++;
22216 }
22218 {
22221 paren_scope++;
22223 paren_scope--;
22224 /* Do not push the last ')' */
22227 }
22236 }
22238 /* Parse an (optional) series of attributes.
22240 attributes:
22241 attributes attribute
22243 attribute:
22244 __attribute__ (( attribute-list [opt] ))
22246 The return value is as for cp_parser_gnu_attribute_list. */
22248 static tree
22250 {
22254 {
22256 tree attribute_list;
22259 /* Peek at the next token. */
22261 /* If it's not `__attribute__', then we're done. */
22265 /* Consume the `__attribute__' keyword. */
22267 /* Look for the two `(' tokens. */
22271 /* Peek at the next token. */
22274 /* Parse the attribute-list. */
22276 else
22277 /* If the next token is a `)', then there is no attribute
22278 list. */
22281 /* Look for the two `)' tokens. */
22289 /* Add these new attributes to the list. */
22291 }
22294 }
22296 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22297 "__vector" or "__vector__." */
22301 {
22305 }
22307 /* Parse a GNU attribute-list.
22309 attribute-list:
22310 attribute
22311 attribute-list , attribute
22313 attribute:
22314 identifier
22315 identifier ( identifier )
22316 identifier ( identifier , expression-list )
22317 identifier ( expression-list )
22319 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22320 to an attribute. The TREE_PURPOSE of each node is the identifier
22321 indicating which attribute is in use. The TREE_VALUE represents
22322 the arguments, if any. */
22324 static tree
22326 {
22332 {
22334 tree identifier;
22335 tree attribute;
22337 /* Look for the identifier. We also allow keywords here; for
22338 example `__attribute__ ((const))' is legal. */
22342 {
22345 /* Consume the token, but save it since we need it for the
22346 SIMD enabled function parsing. */
22349 /* Save away the identifier that indicates which attribute
22350 this is. */
22352 /* For keywords, use the canonical spelling, not the
22353 parsed identifier. */
22359 /* Peek at the next token. */
22361 /* If it's an `(', then parse the attribute arguments. */
22363 {
22368 {
22371 }
22372 else
22373 vec = cp_parser_parenthesized_expression_list
22379 else
22380 {
22383 }
22384 /* Save the arguments away. */
22386 }
22388 {
22391 }
22394 {
22395 /* Add this attribute to the list. */
22398 }
22401 }
22402 /* Now, look for more attributes. If the next token isn't a
22403 `,', we're done. */
22407 /* Consume the comma and keep going. */
22409 }
22412 /* We built up the list in reverse order. */
22414 }
22416 /* Parse a standard C++11 attribute.
22418 The returned representation is a TREE_LIST which TREE_PURPOSE is
22419 the scoped name of the attribute, and the TREE_VALUE is its
22420 arguments list.
22422 Note that the scoped name of the attribute is itself a TREE_LIST
22423 which TREE_PURPOSE is the namespace of the attribute, and
22424 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22425 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22426 and which TREE_PURPOSE is directly the attribute name.
22428 Clients of the attribute code should use get_attribute_namespace
22429 and get_attribute_name to get the actual namespace and name of
22430 attributes, regardless of their being GNU or C++11 attributes.
22432 attribute:
22433 attribute-token attribute-argument-clause [opt]
22435 attribute-token:
22436 identifier
22437 attribute-scoped-token
22439 attribute-scoped-token:
22440 attribute-namespace :: identifier
22442 attribute-namespace:
22443 identifier
22445 attribute-argument-clause:
22446 ( balanced-token-seq )
22448 balanced-token-seq:
22449 balanced-token [opt]
22450 balanced-token-seq balanced-token
22452 balanced-token:
22453 ( balanced-token-seq )
22454 [ balanced-token-seq ]
22455 { balanced-token-seq }. */
22457 static tree
22459 {
22463 /* First, parse name of the the attribute, a.k.a
22464 attribute-token. */
22481 {
22482 /* We are seeing a scoped attribute token. */
22492 else
22493 {
22497 }
22499 NULL_TREE);
22501 }
22502 else
22503 {
22505 NULL_TREE);
22506 /* C++11 noreturn attribute is equivalent to GNU's. */
22509 /* C++14 deprecated attribute is equivalent to GNU's. */
22511 {
22514 "%<deprecated%> is a C++14 feature;"
22517 }
22518 }
22520 /* Now parse the optional argument clause of the attribute. */
22525 {
22531 /* A GNU attribute that takes an identifier in parameter. */
22534 vec = cp_parser_parenthesized_expression_list
22540 else
22541 {
22544 }
22548 else
22550 }
22553 }
22555 /* Check that the attribute ATTRIBUTE appears at most once in the
22556 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
22557 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
22558 isn't implemented yet in GCC. */
22560 static void
22562 {
22564 {
22574 }
22575 }
22577 /* Parse a list of standard C++-11 attributes.
22579 attribute-list:
22580 attribute [opt]
22581 attribute-list , attribute[opt]
22582 attribute ...
22583 attribute-list , attribute ...
22584 */
22586 static tree
22588 {
22593 {
22598 {
22602 }
22605 {
22610 }
22614 }
22617 }
22619 /* Parse a standard C++-11 attribute specifier.
22621 attribute-specifier:
22622 [ [ attribute-list ] ]
22623 alignment-specifier
22625 alignment-specifier:
22626 alignas ( type-id ... [opt] )
22627 alignas ( alignment-expression ... [opt] ). */
22629 static tree
22631 {
22637 {
22646 else
22647 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22648 when we are sure that we have actually parsed them. */
22650 }
22651 else
22652 {
22653 tree alignas_expr;
22655 /* Look for an alignment-specifier. */
22667 {
22670 }
22676 {
22680 alignas_expr =
22687 }
22693 {
22696 }
22699 {
22702 }
22704 /* Build the C++-11 representation of an 'aligned'
22705 attribute. */
22706 attributes =
22709 alignas_expr);
22710 }
22713 }
22715 /* Parse a standard C++-11 attribute-specifier-seq.
22717 attribute-specifier-seq:
22718 attribute-specifier-seq [opt] attribute-specifier
22719 */
22721 static tree
22723 {
22727 {
22736 }
22740 }
22742 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22743 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22744 current value of the PEDANTIC flag, regardless of whether or not
22745 the `__extension__' keyword is present. The caller is responsible
22746 for restoring the value of the PEDANTIC flag. */
22748 static bool
22750 {
22751 /* Save the old value of the PEDANTIC flag. */
22755 {
22756 /* Consume the `__extension__' token. */
22758 /* We're not being pedantic while the `__extension__' keyword is
22759 in effect. */
22763 }
22766 }
22768 /* Parse a label declaration.
22770 label-declaration:
22771 __label__ label-declarator-seq ;
22773 label-declarator-seq:
22774 identifier , label-declarator-seq
22775 identifier */
22777 static void
22779 {
22780 /* Look for the `__label__' keyword. */
22784 {
22785 tree identifier;
22787 /* Look for an identifier. */
22789 /* If we failed, stop. */
22792 /* Declare it as a label. */
22794 /* If the next token is a `;', stop. */
22797 /* Look for the `,' separating the label declarations. */
22799 }
22801 /* Look for the final `;'. */
22803 }
22805 /* Support Functions */
22807 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22808 NAME should have one of the representations used for an
22809 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22810 is returned. If PARSER->SCOPE is a dependent type, then a
22811 SCOPE_REF is returned.
22813 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22814 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22815 was formed. Abstractly, such entities should not be passed to this
22816 function, because they do not need to be looked up, but it is
22817 simpler to check for this special case here, rather than at the
22818 call-sites.
22820 In cases not explicitly covered above, this function returns a
22821 DECL, OVERLOAD, or baselink representing the result of the lookup.
22822 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22823 is returned.
22825 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22826 (e.g., "struct") that was used. In that case bindings that do not
22827 refer to types are ignored.
22829 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22830 ignored.
22832 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22833 are ignored.
22835 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22836 types.
22838 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22839 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22840 NULL_TREE otherwise. */
22842 static tree
22849 location_t name_location)
22850 {
22851 tree decl;
22854 /* Assume that the lookup will be unambiguous. */
22858 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22859 no longer valid. Note that if we are parsing tentatively, and
22860 the parse fails, OBJECT_TYPE will be automatically restored. */
22866 /* A template-id has already been resolved; there is no lookup to
22867 do. */
22871 {
22875 }
22877 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22878 it should already have been checked to make sure that the name
22879 used matches the type being destroyed. */
22881 {
22882 tree type;
22884 /* Figure out to which type this destructor applies. */
22889 else
22891 /* If that's not a class type, there is no destructor. */
22898 /* If it was a class type, return the destructor. */
22900 }
22902 /* By this point, the NAME should be an ordinary identifier. If
22903 the id-expression was a qualified name, the qualifying scope is
22904 stored in PARSER->SCOPE at this point. */
22907 /* Perform the lookup. */
22909 {
22915 /* If the SCOPE is dependent, the lookup must be deferred until
22916 the template is instantiated -- unless we are explicitly
22917 looking up names in uninstantiated templates. Even then, we
22918 cannot look up the name if the scope is not a class type; it
22919 might, for example, be a template type parameter. */
22924 /* Defer lookup. */
22926 else
22927 {
22930 /* If PARSER->SCOPE is a dependent type, then it must be a
22931 class type, and we must not be checking dependencies;
22932 otherwise, we would have processed this lookup above. So
22933 that PARSER->SCOPE is not considered a dependent base by
22934 lookup_member, we must enter the scope here. */
22938 /* If the PARSER->SCOPE is a template specialization, it
22939 may be instantiated during name lookup. In that case,
22940 errors may be issued. Even if we rollback the current
22941 tentative parse, those errors are valid. */
22946 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22947 lookup result and the nested-name-specifier nominates a class C:
22948 * if the name specified after the nested-name-specifier, when
22949 looked up in C, is the injected-class-name of C (Clause 9), or
22950 * if the name specified after the nested-name-specifier is the
22951 same as the identifier or the simple-template-id's template-
22952 name in the last component of the nested-name-specifier,
22953 the name is instead considered to name the constructor of
22954 class C. [ Note: for example, the constructor is not an
22955 acceptable lookup result in an elaborated-type-specifier so
22956 the constructor would not be used in place of the
22957 injected-class-name. --end note ] Such a constructor name
22958 shall be used only in the declarator-id of a declaration that
22959 names a constructor or in a using-declaration. */
22967 /* If we have a single function from a using decl, pull it out. */
22974 }
22976 /* If the scope is a dependent type and either we deferred lookup or
22977 we did lookup but didn't find the name, rememeber the name. */
22980 {
22982 {
22983 tree type;
22985 /* The resolution to Core Issue 180 says that `struct
22986 A::B' should be considered a type-name, even if `A'
22987 is dependent. */
22992 }
22996 CPP_CLOSE_PAREN)))
23000 else
23003 is_template);
23004 }
23007 }
23009 {
23010 /* Look up the name in the scope of the OBJECT_TYPE, unless the
23011 OBJECT_TYPE is not a class. */
23013 /* If the OBJECT_TYPE is a template specialization, it may
23014 be instantiated during name lookup. In that case, errors
23015 may be issued. Even if we rollback the current tentative
23016 parse, those errors are valid. */
23018 name,
23021 tf_warning_or_error);
23022 else
23026 /* Look it up in the enclosing context. */
23032 }
23033 else
23034 {
23040 }
23042 /* If the lookup failed, let our caller know. */
23046 /* Pull out the template from an injected-class-name (or multiple). */
23050 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23052 {
23055 /* The error message we have to print is too complicated for
23056 cp_parser_error, so we incorporate its actions directly. */
23058 {
23060 name);
23062 }
23064 }
23072 /* If we have resolved the name of a member declaration, check to
23073 see if the declaration is accessible. When the name resolves to
23074 set of overloaded functions, accessibility is checked when
23075 overload resolution is done.
23077 During an explicit instantiation, access is not checked at all,
23078 as per [temp.explicit]. */
23085 }
23087 /* Like cp_parser_lookup_name, but for use in the typical case where
23088 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23089 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23091 static tree
23093 {
23095 none_type,
23100 location);
23101 }
23103 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23104 the current context, return the TYPE_DECL. If TAG_NAME_P is
23105 true, the DECL indicates the class being defined in a class-head,
23106 or declared in an elaborated-type-specifier.
23108 Otherwise, return DECL. */
23110 static tree
23112 {
23113 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23114 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23116 struct A {
23117 template <typename T> struct B;
23118 };
23120 template <typename T> struct A::B {};
23122 Similarly, in an elaborated-type-specifier:
23124 namespace N { struct X{}; }
23126 struct A {
23127 template <typename T> friend struct N::X;
23128 };
23130 However, if the DECL refers to a class type, and we are in
23131 the scope of the class, then the name lookup automatically
23132 finds the TYPE_DECL created by build_self_reference rather
23133 than a TEMPLATE_DECL. For example, in:
23135 template <class T> struct S {
23136 S s;
23137 };
23139 there is no need to handle such case. */
23145 }
23147 /* If too many, or too few, template-parameter lists apply to the
23148 declarator, issue an error message. Returns TRUE if all went well,
23149 and FALSE otherwise. */
23151 static bool
23154 location_t declarator_location)
23155 {
23157 {
23159 {
23167 /* If the DECLARATOR has the form `X<y>' then it uses one
23168 additional level of template parameters. */
23171 return cp_parser_check_template_parameters
23173 }
23188 }
23190 }
23192 /* NUM_TEMPLATES were used in the current declaration. If that is
23193 invalid, return FALSE and issue an error messages. Otherwise,
23194 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23195 declarator and we can print more accurate diagnostics. */
23197 static bool
23200 location_t location,
23202 {
23203 /* If there are the same number of template classes and parameter
23204 lists, that's OK. */
23207 /* If there are more, but only one more, then we are referring to a
23208 member template. That's OK too. */
23211 /* If there are more template classes than parameter lists, we have
23212 something like:
23214 template <class T> void S<T>::R<T>::f (); */
23216 {
23226 else
23229 }
23230 /* Otherwise, there are too many template parameter lists. We have
23231 something like:
23233 template <class T> template <class U> void S::f(); */
23236 }
23238 /* Parse an optional `::' token indicating that the following name is
23239 from the global namespace. If so, PARSER->SCOPE is set to the
23240 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23241 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23242 Returns the new value of PARSER->SCOPE, if the `::' token is
23243 present, and NULL_TREE otherwise. */
23245 static tree
23247 {
23250 /* Peek at the next token. */
23252 /* If we're looking at a `::' token then we're starting from the
23253 global namespace, not our current location. */
23255 {
23256 /* Consume the `::' token. */
23258 /* Set the SCOPE so that we know where to start the lookup. */
23264 }
23266 {
23270 }
23273 }
23275 /* Returns TRUE if the upcoming token sequence is the start of a
23276 constructor declarator. If FRIEND_P is true, the declarator is
23277 preceded by the `friend' specifier. */
23279 static bool
23281 {
23284 tree nested_name_specifier;
23287 /* The common case is that this is not a constructor declarator, so
23288 try to avoid doing lots of work if at all possible. It's not
23289 valid declare a constructor at function scope. */
23292 /* And only certain tokens can begin a constructor declarator. */
23300 /* Parse tentatively; we are going to roll back all of the tokens
23301 consumed here. */
23303 /* Assume that we are looking at a constructor declarator. */
23306 /* Look for the optional `::' operator. */
23309 /* Look for the nested-name-specifier. */
23310 nested_name_specifier
23321 /* Outside of a class-specifier, there must be a
23322 nested-name-specifier. */
23328 /* If we have a class scope, this is easy; DR 147 says that S::S always
23329 names the constructor, and no other qualified name could. */
23332 {
23342 }
23343 /* If we still think that this might be a constructor-declarator,
23344 look for a class-name. */
23346 {
23347 /* If we have:
23349 template <typename T> struct S {
23350 S();
23351 };
23353 we must recognize that the nested `S' names a class. */
23354 tree type_decl;
23358 none_type,
23362 /* If there was no class-name, then this is not a constructor.
23363 Otherwise, if we are in a class-specifier and we aren't
23364 handling a friend declaration, check that its type matches
23365 current_class_type (c++/38313). Note: error_mark_node
23366 is left alone for error recovery purposes. */
23368 && (outside_class_specifier_p
23373 /* If we're still considering a constructor, we have to see a `(',
23374 to begin the parameter-declaration-clause, followed by either a
23375 `)', an `...', or a decl-specifier. We need to check for a
23376 type-specifier to avoid being fooled into thinking that:
23378 S (f) (int);
23380 is a constructor. (It is actually a function named `f' that
23381 takes one parameter (of type `int') and returns a value of type
23382 `S'. */
23390 /* A parameter declaration begins with a decl-specifier,
23391 which is either the "attribute" keyword, a storage class
23392 specifier, or (usually) a type-specifier. */
23394 {
23395 tree type;
23399 /* Names appearing in the type-specifier should be looked up
23400 in the scope of the class. */
23403 else
23404 {
23407 {
23411 {
23414 }
23415 }
23417 }
23419 /* Inside the constructor parameter list, surrounding
23420 template-parameter-lists do not apply. */
23421 saved_num_template_parameter_lists
23425 /* Look for the type-specifier. */
23427 CP_PARSER_FLAGS_NONE,
23433 parser->num_template_parameter_lists
23436 /* Leave the scope of the class. */
23441 }
23442 }
23444 /* We did not really want to consume any tokens. */
23448 }
23450 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23451 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23452 they must be performed once we are in the scope of the function.
23454 Returns the function defined. */
23456 static tree
23457 cp_parser_function_definition_from_specifiers_and_declarator
23460 tree attributes,
23462 {
23463 tree fn;
23466 /* Begin the function-definition. */
23469 /* The things we're about to see are not directly qualified by any
23470 template headers we've seen thus far. */
23473 /* If there were names looked up in the decl-specifier-seq that we
23474 did not check, check them now. We must wait until we are in the
23475 scope of the function to perform the checks, since the function
23476 might be a friend. */
23480 {
23483 }
23486 {
23487 /* Skip the entire function. */
23490 }
23492 {
23493 /* Seen already, skip it. An error message has already been output. */
23497 /* If this is a function from a class, pop the nested class. */
23500 }
23501 else
23502 {
23503 timevar_id_t tv;
23506 else
23512 }
23515 }
23517 /* Parse the part of a function-definition that follows the
23518 declarator. INLINE_P is TRUE iff this function is an inline
23519 function defined within a class-specifier.
23521 Returns the function defined. */
23523 static tree
23526 {
23527 tree fn;
23533 bool fully_implicit_function_template_p
23536 tree implicit_template_parms
23539 cp_binding_level* implicit_template_scope
23545 /* If the next token is `return', then the code may be trying to
23546 make use of the "named return value" extension that G++ used to
23547 support. */
23550 {
23551 /* Consume the `return' keyword. */
23553 /* Look for the identifier that indicates what value is to be
23554 returned. */
23556 /* Issue an error message. */
23559 /* Skip tokens until we reach the start of the function body. */
23561 {
23568 }
23569 }
23570 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23571 anything declared inside `f'. */
23572 saved_in_unbraced_linkage_specification_p
23575 /* Inside the function, surrounding template-parameter-lists do not
23576 apply. */
23577 saved_num_template_parameter_lists
23583 /* If the next token is `try', `__transaction_atomic', or
23584 `__transaction_relaxed`, then we are looking at either function-try-block
23585 or function-transaction-block. Note that all of these include the
23586 function-body. */
23589 RID_TRANSACTION_ATOMIC);
23591 RID_TRANSACTION_RELAXED))
23593 RID_TRANSACTION_RELAXED);
23596 else
23597 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23602 /* Finish the function. */
23605 /* Generate code for it, if necessary. */
23607 /* Restore the saved values. */
23608 parser->in_unbraced_linkage_specification_p
23610 parser->num_template_parameter_lists
23614 parser->fully_implicit_function_template_p
23616 parser->implicit_template_parms
23618 parser->implicit_template_scope
23625 }
23627 /* Parse a template-declaration, assuming that the `export' (and
23628 `extern') keywords, if present, has already been scanned. MEMBER_P
23629 is as for cp_parser_template_declaration. */
23631 static void
23633 {
23636 tree parameter_list;
23641 /* Look for the `template' keyword. */
23646 /* And the `<'. */
23650 {
23651 /* 14.5.2.2 [temp.mem]
23653 A local class shall not have member templates. */
23658 }
23659 /* [temp]
23661 A template ... shall not have C linkage. */
23663 {
23665 /* Give it C++ linkage to avoid confusing other parts of the
23666 front end. */
23669 }
23670 else
23673 /* We cannot perform access checks on the template parameter
23674 declarations until we know what is being declared, just as we
23675 cannot check the decl-specifier list. */
23678 /* If the next token is `>', then we have an invalid
23679 specialization. Rather than complain about an invalid template
23680 parameter, issue an error message here. */
23682 {
23686 }
23687 else
23688 {
23689 /* Parse the template parameters. */
23691 }
23693 /* Get the deferred access checks from the parameter list. These
23694 will be checked once we know what is being declared, as for a
23695 member template the checks must be performed in the scope of the
23696 class containing the member. */
23699 /* Look for the `>'. */
23701 /* We just processed one more parameter list. */
23703 /* If the next token is `template', there are more template
23704 parameters. */
23706 RID_TEMPLATE))
23711 else
23712 {
23713 /* There are no access checks when parsing a template, as we do not
23714 know if a specialization will be a friend. */
23718 checks,
23719 member_p,
23724 /* If this is a member template declaration, let the front
23725 end know. */
23727 {
23732 }
23737 }
23738 /* We are done with the current parameter list. */
23743 /* Finish up. */
23746 /* Check the template arguments for a literal operator template. */
23750 {
23754 else
23755 {
23758 {
23764 }
23766 {
23774 }
23775 else
23777 }
23779 {
23782 " Expected non-type template argument pack <char...>"
23784 decl);
23785 else
23788 decl);
23789 }
23790 }
23791 /* Register member declarations. */
23794 /* For the erroneous case of a template with C linkage, we pushed an
23795 implicit C++ linkage scope; exit that scope now. */
23798 /* If DECL is a function template, we must return to parse it later.
23799 (Even though there is no definition, there might be default
23800 arguments that need handling.) */
23804 }
23806 /* Perform the deferred access checks from a template-parameter-list.
23807 CHECKS is a TREE_LIST of access checks, as returned by
23808 get_deferred_access_checks. */
23810 static void
23811 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23812 {
23816 }
23818 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23819 `function-definition' sequence that follows a template header.
23820 If MEMBER_P is true, this declaration appears in a class scope.
23822 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23823 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23825 static tree
23831 {
23834 cp_decl_specifier_seq decl_specifiers;
23838 /* This function is only used when processing a template
23839 declaration. */
23843 /* Defer access checks until we know what is being declared. */
23846 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23847 alternative. */
23850 CP_PARSER_FLAGS_OPTIONAL,
23856 /* There are no template typedefs. */
23858 {
23862 }
23864 /* Gather up the access checks that occurred the
23865 decl-specifier-seq. */
23868 /* Check for the declaration of a template class. */
23870 {
23872 {
23875 /* In this case:
23877 struct C {
23878 friend template <typename T> struct A<T>::B;
23879 };
23881 A<T>::B will be represented by a TYPENAME_TYPE, and
23882 therefore not recognized by shadow_tag. */
23884 && !decl
23891 else
23894 /* Perform access checks for template parameters. */
23896 }
23897 }
23899 /* Complain about missing 'typename' or other invalid type names. */
23902 {
23903 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23904 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23905 the rest of this declaration. */
23908 }
23910 /* If it's not a template class, try for a template function. If
23911 the next token is a `;', then this declaration does not declare
23912 anything. But, if there were errors in the decl-specifiers, then
23913 the error might well have come from an attempted class-specifier.
23914 In that case, there's no need to warn about a missing declarator. */
23918 {
23921 checks,
23923 member_p,
23924 declares_class_or_enum,
23928 /* 7.1.1-1 [dcl.stc]
23930 A storage-class-specifier shall not be specified in an explicit
23931 specialization... */
23933 && explicit_specialization_p
23935 {
23939 }
23943 }
23945 /* Look for a trailing `;' after the declaration. */
23951 out:
23954 /* Clear any current qualification; whatever comes next is the start
23955 of something new. */
23961 }
23963 /* Parse a cast-expression that is not the operand of a unary "&". */
23965 static tree
23967 {
23970 }
23972 /* Parse a functional cast to TYPE. Returns an expression
23973 representing the cast. */
23975 static tree
23977 {
23979 tree expression_list;
23980 tree cast;
23987 {
23995 tf_warning_or_error);
23996 }
24005 else
24006 {
24009 }
24012 tf_warning_or_error);
24013 /* [expr.const]/1: In an integral constant expression "only type
24014 conversions to integral or enumeration type can be used". */
24020 NIC_CONSTRUCTOR))
24023 }
24025 /* Save the tokens that make up the body of a member function defined
24026 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
24027 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
24028 specifiers applied to the declaration. Returns the FUNCTION_DECL
24029 for the member function. */
24031 static tree
24035 tree attributes)
24036 {
24039 tree fn;
24041 /* Create the FUNCTION_DECL. */
24044 /* If something went badly wrong, bail out now. */
24046 {
24047 /* If there's a function-body, skip it. */
24052 }
24054 /* Remember it, if there default args to post process. */
24057 /* Save away the tokens that make up the body of the
24058 function. */
24060 /* Handle function try blocks. */
24063 /* We can have braced-init-list mem-initializers before the fn body. */
24065 {
24068 {
24069 /* cache_group will stop after an un-nested { } pair, too. */
24073 /* variadic mem-inits have ... after the ')'. */
24076 }
24077 }
24079 /* Handle function try blocks. */
24084 /* Save away the inline definition; we will process it when the
24085 class is complete. */
24089 /* We need to know that this was defined in the class, so that
24090 friend templates are handled correctly. */
24093 /* Add FN to the queue of functions to be parsed later. */
24097 }
24099 /* Save the tokens that make up the in-class initializer for a non-static
24100 data member. Returns a DEFAULT_ARG. */
24102 static tree
24104 {
24106 }
24108 /* Parse a template-argument-list, as well as the trailing ">" (but
24109 not the opening "<"). See cp_parser_template_argument_list for the
24110 return value. */
24112 static tree
24114 {
24115 tree arguments;
24116 tree saved_scope;
24117 tree saved_qualifying_scope;
24118 tree saved_object_scope;
24123 /* [temp.names]
24125 When parsing a template-id, the first non-nested `>' is taken as
24126 the end of the template-argument-list rather than a greater-than
24127 operator. */
24128 saved_greater_than_is_operator_p
24131 /* Parsing the argument list may modify SCOPE, so we save it
24132 here. */
24136 /* We need to evaluate the template arguments, even though this
24137 template-id may be nested within a "sizeof". */
24142 /* Parse the template-argument-list itself. */
24146 else
24148 /* Look for the `>' that ends the template-argument-list. If we find
24149 a '>>' instead, it's probably just a typo. */
24151 {
24153 {
24154 /* In C++0x, a `>>' in a template argument list or cast
24155 expression is considered to be two separate `>'
24156 tokens. So, change the current token to a `>', but don't
24157 consume it: it will be consumed later when the outer
24158 template argument list (or cast expression) is parsed.
24159 Note that this replacement of `>' for `>>' is necessary
24160 even if we are parsing tentatively: in the tentative
24161 case, after calling
24162 cp_parser_enclosed_template_argument_list we will always
24163 throw away all of the template arguments and the first
24164 closing `>', either because the template argument list
24165 was erroneous or because we are replacing those tokens
24166 with a CPP_TEMPLATE_ID token. The second `>' (which will
24167 not have been thrown away) is needed either to close an
24168 outer template argument list or to complete a new-style
24169 cast. */
24172 }
24174 {
24175 /* If we're in a nested template argument list, the '>>' has
24176 to be a typo for '> >'. We emit the error message, but we
24177 continue parsing and we push a '>' as next token, so that
24178 the argument list will be parsed correctly. Note that the
24179 global source location is still on the token before the
24180 '>>', so we need to say explicitly where we want it. */
24186 }
24187 else
24188 {
24189 /* If this is not a nested template argument list, the '>>'
24190 is a typo for '>'. Emit an error message and continue.
24191 Same deal about the token location, but here we can get it
24192 right by consuming the '>>' before issuing the diagnostic. */
24195 "spurious %<>>%>, use %<>%> to terminate "
24197 }
24198 }
24199 else
24201 /* The `>' token might be a greater-than operator again now. */
24202 parser->greater_than_is_operator_p
24204 /* Restore the SAVED_SCOPE. */
24212 }
24214 /* MEMBER_FUNCTION is a member function, or a friend. If default
24215 arguments, or the body of the function have not yet been parsed,
24216 parse them now. */
24218 static void
24220 {
24222 /* If this member is a template, get the underlying
24223 FUNCTION_DECL. */
24227 /* There should not be any class definitions in progress at this
24228 point; the bodies of members are only parsed outside of all class
24229 definitions. */
24231 /* While we're parsing the member functions we might encounter more
24232 classes. We want to handle them right away, but we don't want
24233 them getting mixed up with functions that are currently in the
24234 queue. */
24237 /* Make sure that any template parameters are in scope. */
24240 /* If the body of the function has not yet been parsed, parse it
24241 now. */
24243 {
24244 tree function_scope;
24247 /* The function is no longer pending; we are processing it. */
24252 /* If this is a local class, enter the scope of the containing
24253 function. */
24258 /* Push the body of the function onto the lexer stack. */
24261 /* Let the front end know that we going to be defining this
24262 function. */
24266 /* Don't do access checking if it is a templated function. */
24270 /* #pragma omp declare reduction needs special parsing. */
24272 {
24277 }
24278 else
24279 /* Now, parse the body of the function. */
24286 /* Leave the scope of the containing function. */
24290 }
24292 /* Remove any template parameters from the symbol table. */
24295 /* Restore the queue. */
24298 }
24300 /* If DECL contains any default args, remember it on the unparsed
24301 functions queue. */
24303 static void
24305 {
24306 tree probe;
24309 probe;
24312 {
24316 }
24317 }
24319 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24320 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24321 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24322 from the parameter-type-list. */
24324 static tree
24327 {
24329 tree parsed_arg;
24335 /* Push the saved tokens for the default argument onto the parser's
24336 lexer stack. */
24342 /* Parse the default argument. */
24353 {
24354 /* In a non-template class, check conversions now. In a template,
24355 we'll wait and instantiate these as needed. */
24358 tf_warning_or_error);
24359 else
24361 }
24363 /* If the token stream has not been completely used up, then
24364 there was extra junk after the end of the default
24365 argument. */
24367 {
24370 else
24372 }
24374 /* Revert to the main lexer. */
24378 }
24380 /* FIELD is a non-static data member with an initializer which we saved for
24381 later; parse it now. */
24383 static void
24385 {
24386 tree def;
24393 NULL_TREE);
24399 }
24401 /* FN is a FUNCTION_DECL which may contains a parameter with an
24402 unparsed DEFAULT_ARG. Parse the default args now. This function
24403 assumes that the current scope is the scope in which the default
24404 argument should be processed. */
24406 static void
24408 {
24412 /* While we're parsing the default args, we might (due to the
24413 statement expression extension) encounter more classes. We want
24414 to handle them right away, but we don't want them getting mixed
24415 up with default args that are currently in the queue. */
24418 /* Local variable names (and the `this' keyword) may not appear
24419 in a default argument. */
24430 {
24432 tree parsed_arg;
24434 tree copy;
24441 /* This can happen for a friend declaration for a function
24442 already declared with default arguments. */
24445 parsed_arg
24447 default_arg,
24450 {
24452 }
24456 /* Update any instantiations we've already created. */
24460 }
24464 /* Make sure no default arg is missing. */
24467 /* Restore the state of local_variables_forbidden_p. */
24470 /* Restore the queue. */
24472 }
24474 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24476 sizeof ... ( identifier )
24478 where the 'sizeof' token has already been consumed. */
24480 static tree
24482 {
24483 /* Consume the `...'. */
24490 else
24498 /* The name is not qualified. */
24516 }
24518 /* Parse the operand of `sizeof' (or a similar operator). Returns
24519 either a TYPE or an expression, depending on the form of the
24520 input. The KEYWORD indicates which kind of expression we have
24521 encountered. */
24523 static tree
24525 {
24532 /* If it's a `...', then we are computing the length of a parameter
24533 pack. */
24538 /* Types cannot be defined in a `sizeof' expression. Save away the
24539 old message. */
24541 /* And create the new one. */
24547 /* The restrictions on constant-expressions do not apply inside
24548 sizeof expressions. */
24549 saved_integral_constant_expression_p
24551 saved_non_integral_constant_expression_p
24555 /* Do not actually evaluate the expression. */
24558 /* If it's a `(', then we might be looking at the type-id
24559 construction. */
24561 {
24564 /* We can't be sure yet whether we're looking at a type-id or an
24565 expression. */
24567 /* Note: as a GNU Extension, compound literals are considered
24568 postfix-expressions as they are in C99, so they are valid
24569 arguments to sizeof. See comment in cp_parser_cast_expression
24570 for details. */
24573 else
24574 {
24577 /* Look for the type-id. */
24579 /* Look for the closing `)'. */
24582 }
24584 /* If all went well, then we're done. */
24586 {
24587 cp_decl_specifier_seq decl_specs;
24589 /* Build a trivial decl-specifier-seq. */
24593 /* Call grokdeclarator to figure out what type this is. */
24596 TYPENAME,
24599 }
24600 }
24602 /* If the type-id production did not work out, then we must be
24603 looking at the unary-expression production. */
24607 /* Go back to evaluating expressions. */
24611 /* Free the message we created. */
24613 /* And restore the old one. */
24615 parser->integral_constant_expression_p
24617 parser->non_integral_constant_expression_p
24621 }
24623 /* If the current declaration has no declarator, return true. */
24625 static bool
24627 {
24628 /* If the next token is a `;' or a `,' then there is no
24629 declarator. */
24632 }
24634 /* Update the DECL_SPECS to reflect the storage class indicated by
24635 KEYWORD. */
24637 static void
24642 {
24643 cp_storage_class storage_class;
24646 {
24650 }
24652 {
24655 }
24660 {
24663 }
24666 {
24684 }
24688 /* A storage class specifier cannot be applied alongside a typedef
24689 specifier. If there is a typedef specifier present then set
24690 conflicting_specifiers_p which will trigger an error later
24691 on in grokdeclarator. */
24694 }
24696 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24697 is true, the type is a class or enum definition. */
24699 static void
24701 tree type_spec,
24704 {
24707 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24708 (with, for example, in "typedef int wchar_t;") we remember that
24709 this is what happened. In system headers, we ignore these
24710 declarations so that G++ can work with system headers that are not
24711 C++-safe. */
24713 && !type_definition_p
24723 {
24726 ds_redefined_builtin_type_spec,
24727 token);
24729 {
24733 }
24734 }
24737 else
24738 {
24743 }
24744 }
24746 /* True iff TOKEN is the GNU keyword __thread. */
24748 static bool
24750 {
24753 }
24755 /* Set the location for a declarator specifier and check if it is
24756 duplicated.
24758 DECL_SPECS is the sequence of declarator specifiers onto which to
24759 set the location.
24761 DS is the single declarator specifier to set which location is to
24762 be set onto the existing sequence of declarators.
24764 LOCATION is the location for the declarator specifier to
24765 consider. */
24767 static void
24770 {
24779 {
24783 }
24784 else
24785 {
24787 {
24791 else
24792 {
24795 OPT_Wlong_long,
24797 }
24798 }
24800 {
24805 else
24807 }
24808 else
24809 {
24825 "__complex"
24826 };
24829 }
24830 }
24831 }
24833 /* Return true iff the declarator specifier DS is present in the
24834 sequence of declarator specifiers DECL_SPECS. */
24836 bool
24838 cp_decl_spec ds)
24839 {
24846 }
24848 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24849 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24851 static bool
24853 {
24855 }
24857 /* Issue an error message indicating that TOKEN_DESC was expected.
24858 If KEYWORD is true, it indicated this function is called by
24859 cp_parser_require_keword and the required token can only be
24860 a indicated keyword. */
24862 static void
24864 required_token token_desc,
24866 {
24868 {
24937 }
24939 {
24941 {
25020 }
25021 }
25022 else
25024 }
25028 /* If the next token is of the indicated TYPE, consume it. Otherwise,
25029 issue an error message indicating that TOKEN_DESC was expected.
25031 Returns the token consumed, if the token had the appropriate type.
25032 Otherwise, returns NULL. */
25037 required_token token_desc)
25038 {
25041 else
25042 {
25043 /* Output the MESSAGE -- unless we're parsing tentatively. */
25047 }
25048 }
25050 /* An error message is produced if the next token is not '>'.
25051 All further tokens are skipped until the desired token is
25052 found or '{', '}', ';' or an unbalanced ')' or ']'. */
25054 static void
25056 {
25057 /* Current level of '< ... >'. */
25059 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
25062 /* Are we ready, yet? If not, issue error message. */
25066 /* Skip tokens until the desired token is found. */
25068 {
25069 /* Peek at the next token. */
25071 {
25079 /* C++0x views the `>>' operator as two `>' tokens, but
25080 C++98 does not. */
25083 {
25084 /* We've hit a `>>' where the first `>' closes the
25085 template argument list, and the second `>' is
25086 spurious. Just consume the `>>' and stop; we've
25087 already produced at least one error. */
25090 }
25091 /* Fall through for C++0x, so we handle the second `>' in
25092 the `>>'. */
25096 {
25097 /* We've reached the token we want, consume it and stop. */
25100 }
25119 /* The '>' was probably forgotten, don't look further. */
25124 }
25126 /* Consume this token. */
25128 }
25129 }
25131 /* If the next token is the indicated keyword, consume it. Otherwise,
25132 issue an error message indicating that TOKEN_DESC was expected.
25134 Returns the token consumed, if the token had the appropriate type.
25135 Otherwise, returns NULL. */
25140 required_token token_desc)
25141 {
25145 {
25148 }
25151 }
25153 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25154 function-definition. */
25156 static bool
25158 {
25161 /* A ctor-initializer begins with a `:'. */
25163 /* A function-try-block begins with `try'. */
25165 /* A function-transaction-block begins with `__transaction_atomic'
25166 or `__transaction_relaxed'. */
25169 /* The named return value extension begins with `return'. */
25171 }
25173 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25174 definition. */
25176 static bool
25178 {
25185 }
25187 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25188 C++0x) ending a template-argument. */
25190 static bool
25192 {
25200 }
25202 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25203 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25205 static bool
25208 {
25214 /* Check for the sequence `<::' in the original code. It would be lexed as
25215 `[:', where `[' is a digraph, and there is no whitespace before
25216 `:'. */
25218 {
25223 }
25225 }
25227 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25228 or none_type otherwise. */
25230 static enum tag_types
25232 {
25234 {
25244 }
25245 }
25247 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25248 or none_type otherwise or if the token is null. */
25250 static enum tag_types
25252 {
25257 {
25265 }
25266 }
25268 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25270 static void
25272 {
25276 {
25280 type))
25283 }
25284 }
25286 /* Issue an error message if DECL is redeclared with different
25287 access than its original declaration [class.access.spec/3].
25288 This applies to nested classes and nested class templates.
25289 [class.mem/1]. */
25291 static void
25293 {
25302 }
25304 /* Look for the `template' keyword, as a syntactic disambiguator.
25305 Return TRUE iff it is present, in which case it will be
25306 consumed. */
25308 static bool
25310 {
25312 {
25313 /* In C++98 the `template' keyword can only be used within templates;
25314 outside templates the parser can always figure out what is a
25315 template and what is not. In C++11, per the resolution of DR 468,
25316 `template' is allowed in cases where it is not strictly necessary. */
25319 {
25322 "in C++98 %<template%> (as a disambiguator) is only "
25324 /* If this part of the token stream is rescanned, the same
25325 error message would be generated. So, we purge the token
25326 from the stream. */
25329 }
25330 else
25331 {
25332 /* Consume the `template' keyword. */
25335 }
25336 }
25338 }
25340 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25341 set PARSER->SCOPE, and perform other related actions. */
25343 static void
25345 {
25351 /* Get the stored value. */
25353 /* Perform any access checks that were deferred. */
25356 {
25361 }
25362 /* Set the scope from the stored value. */
25366 }
25368 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25369 encounter the end of a block before what we were looking for. */
25371 static bool
25375 {
25377 {
25380 /* Abort a parenthesized expression if we encounter a semicolon. */
25384 /* If we've reached the end of the file, stop. */
25390 /* We've hit the end of an enclosing block, so there's been some
25391 kind of syntax error. */
25394 /* Consume the token. */
25396 /* See if it starts a new group. */
25398 {
25400 /* In theory this should probably check end == '}', but
25401 cp_parser_save_member_function_body needs it to exit
25402 after either '}' or ')' when called with ')'. */
25405 }
25407 {
25411 }
25416 }
25417 }
25419 /* Like above, for caching a default argument or NSDMI. Both of these are
25420 terminated by a non-nested comma, but it can be unclear whether or not a
25421 comma is nested in a template argument list unless we do more parsing.
25422 In order to handle this ambiguity, when we encounter a ',' after a '<'
25423 we try to parse what follows as a parameter-declaration-list (in the
25424 case of a default argument) or a member-declarator (in the case of an
25425 NSDMI). If that succeeds, then we stop caching. */
25427 static tree
25429 {
25434 tree default_argument;
25436 /* Add tokens until we have processed the entire default
25437 argument. We add the range [first_token, token). */
25440 {
25441 /* For list-initialization, this is straightforward. */
25444 }
25446 {
25449 /* Peek at the next token. */
25451 /* What we do depends on what token we have. */
25453 {
25454 /* In valid code, a default argument must be
25455 immediately followed by a `,' `)', or `...'. */
25458 {
25459 /* If we've seen a '<', we might be in a
25460 template-argument-list. Until Core issue 325 is
25461 resolved, we don't know how this situation ought
25462 to be handled, so try to DTRT. We check whether
25463 what comes after the comma is a valid parameter
25464 declaration list. If it is, then the comma ends
25465 the default argument; otherwise the default
25466 argument continues. */
25470 /* Set ITALP so cp_parser_parameter_declaration_list
25471 doesn't decide to commit to this parse. */
25478 {
25479 /* Parse declarators until we reach a non-comma or
25480 somthing that cannot be an initializer.
25481 Just checking whether we're looking at a single
25482 declarator is insufficient. Consider:
25483 int var = tuple<T,U>::x;
25484 The template parameter 'U' looks exactly like a
25485 declarator. */
25486 do
25487 {
25498 }
25500 /* If we met an '=' or ';' then the original comma
25501 was the end of the NSDMI. Otherwise assume
25502 we're still in the NSDMI. */
25505 }
25506 else
25507 {
25512 }
25519 }
25522 /* If we run into a non-nested `;', `}', or `]',
25523 then the code is invalid -- but the default
25524 argument is certainly over. */
25529 /* Handle correctly int n = sizeof ... ( p ); */
25532 /* Update DEPTH, if necessary. */
25547 /* This might be the comparison operator, or it might
25548 start a template argument list. */
25555 /* Fall through for C++0x, which treats the `>>'
25556 operator like two `>' tokens in certain
25557 cases. */
25561 {
25562 /* This might be an operator, or it might close a
25563 template argument list. But if a previous '<'
25564 started a template argument list, this will have
25565 closed it, so we can't be in one anymore. */
25569 }
25572 /* If we run out of tokens, issue an error message. */
25581 /* In these cases, we should look for template-ids.
25582 For example, if the default argument is
25583 `X<int, double>()', we need to do name lookup to
25584 figure out whether or not `X' is a template; if
25585 so, the `,' does not end the default argument.
25587 That is not yet done. */
25592 }
25594 /* If we've reached the end, stop. */
25598 /* Add the token to the token block. */
25600 }
25602 /* Create a DEFAULT_ARG to represent the unparsed default
25603 argument. */
25610 }
25612 /* Begin parsing tentatively. We always save tokens while parsing
25613 tentatively so that if the tentative parsing fails we can restore the
25614 tokens. */
25616 static void
25618 {
25619 /* Enter a new parsing context. */
25621 /* Begin saving tokens. */
25623 /* In order to avoid repetitive access control error messages,
25624 access checks are queued up until we are no longer parsing
25625 tentatively. */
25627 }
25629 /* Commit to the currently active tentative parse. */
25631 static void
25633 {
25637 /* Mark all of the levels as committed. */
25640 {
25647 }
25648 }
25650 /* Commit to the topmost currently active tentative parse.
25652 Note that this function shouldn't be called when there are
25653 irreversible side-effects while in a tentative state. For
25654 example, we shouldn't create a permanent entry in the symbol
25655 table, or issue an error message that might not apply if the
25656 tentative parse is aborted. */
25658 static void
25660 {
25665 {
25673 }
25674 }
25676 /* Abort the currently active tentative parse. All consumed tokens
25677 will be rolled back, and no diagnostics will be issued. */
25679 static void
25681 {
25685 /* Now, pretend that we want to see if the construct was
25686 successfully parsed. */
25688 }
25690 /* Stop parsing tentatively. If a parse error has occurred, restore the
25691 token stream. Otherwise, commit to the tokens we have consumed.
25692 Returns true if no error occurred; false otherwise. */
25694 static bool
25696 {
25700 /* Remember whether or not an error occurred, since we are about to
25701 destroy that information. */
25703 /* Remove the topmost context from the stack. */
25706 /* If no parse errors occurred, commit to the tentative parse. */
25708 {
25709 /* Commit to the tokens read tentatively, unless that was
25710 already done. */
25715 }
25716 /* Otherwise, if errors occurred, roll back our state so that things
25717 are just as they were before we began the tentative parse. */
25718 else
25719 {
25722 }
25723 /* Add the context to the front of the free list. */
25728 }
25730 /* Returns true if we are parsing tentatively and are not committed to
25731 this tentative parse. */
25733 static bool
25735 {
25738 }
25740 /* Returns nonzero iff an error has occurred during the most recent
25741 tentative parse. */
25743 static bool
25745 {
25748 }
25750 /* Returns nonzero if GNU extensions are allowed. */
25752 static bool
25754 {
25756 }
25757 \f
25758 /* Objective-C++ Productions */
25761 /* Parse an Objective-C expression, which feeds into a primary-expression
25762 above.
25764 objc-expression:
25765 objc-message-expression
25766 objc-string-literal
25767 objc-encode-expression
25768 objc-protocol-expression
25769 objc-selector-expression
25771 Returns a tree representation of the expression. */
25773 static tree
25775 {
25776 /* Try to figure out what kind of declaration is present. */
25780 {
25790 {
25802 }
25808 }
25811 }
25813 /* Parse an Objective-C message expression.
25815 objc-message-expression:
25816 [ objc-message-receiver objc-message-args ]
25818 Returns a representation of an Objective-C message. */
25820 static tree
25822 {
25831 }
25833 /* Parse an objc-message-receiver.
25835 objc-message-receiver:
25836 expression
25837 simple-type-specifier
25839 Returns a representation of the type or expression. */
25841 static tree
25843 {
25844 tree rcv;
25846 /* An Objective-C message receiver may be either (1) a type
25847 or (2) an expression. */
25851 /* If that worked out, fine. */
25858 CP_PARSER_FLAGS_NONE);
25865 }
25867 /* Parse the arguments and selectors comprising an Objective-C message.
25869 objc-message-args:
25870 objc-selector
25871 objc-selector-args
25872 objc-selector-args , objc-comma-args
25874 objc-selector-args:
25875 objc-selector [opt] : assignment-expression
25876 objc-selector-args objc-selector [opt] : assignment-expression
25878 objc-comma-args:
25879 assignment-expression
25880 objc-comma-args , assignment-expression
25882 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25883 selector arguments and TREE_VALUE containing a list of comma
25884 arguments. */
25886 static tree
25888 {
25894 {
25900 /* Detect if we have a unary selector. */
25909 sel_args
25914 }
25916 /* Handle non-selector arguments, if any. */
25918 {
25919 tree arg;
25924 addl_args
25929 }
25932 {
25935 }
25938 }
25940 /* Parse an Objective-C encode expression.
25942 objc-encode-expression:
25943 @encode objc-typename
25945 Returns an encoded representation of the type argument. */
25947 static tree
25949 {
25950 tree type;
25960 {
25964 }
25966 /* This happens if we find @encode(T) (where T is a template
25967 typename or something dependent on a template typename) when
25968 parsing a template. In that case, we can't compile it
25969 immediately, but we rather create an AT_ENCODE_EXPR which will
25970 need to be instantiated when the template is used.
25971 */
25973 {
25977 }
25980 }
25982 /* Parse an Objective-C @defs expression. */
25984 static tree
25986 {
25987 tree name;
25995 }
25997 /* Parse an Objective-C protocol expression.
25999 objc-protocol-expression:
26000 @protocol ( identifier )
26002 Returns a representation of the protocol expression. */
26004 static tree
26006 {
26007 tree proto;
26015 }
26017 /* Parse an Objective-C selector expression.
26019 objc-selector-expression:
26020 @selector ( objc-method-signature )
26022 objc-method-signature:
26023 objc-selector
26024 objc-selector-seq
26026 objc-selector-seq:
26027 objc-selector :
26028 objc-selector-seq objc-selector :
26030 Returns a representation of the method selector. */
26032 static tree
26034 {
26046 {
26055 {
26056 /* Detect if we have a unary selector. */
26058 {
26061 }
26062 else
26063 {
26065 }
26066 }
26071 {
26072 sel_seq
26075 sel_seq
26078 }
26079 else
26080 sel_seq
26085 }
26087 finish_selector:
26091 }
26093 /* Parse a list of identifiers.
26095 objc-identifier-list:
26096 identifier
26097 objc-identifier-list , identifier
26099 Returns a TREE_LIST of identifier nodes. */
26101 static tree
26103 {
26104 tree identifier;
26105 tree list;
26116 {
26123 identifier));
26125 }
26128 }
26130 /* Parse an Objective-C alias declaration.
26132 objc-alias-declaration:
26133 @compatibility_alias identifier identifier ;
26135 This function registers the alias mapping with the Objective-C front end.
26136 It returns nothing. */
26138 static void
26140 {
26148 }
26150 /* Parse an Objective-C class forward-declaration.
26152 objc-class-declaration:
26153 @class objc-identifier-list ;
26155 The function registers the forward declarations with the Objective-C
26156 front end. It returns nothing. */
26158 static void
26160 {
26163 {
26164 tree id;
26174 else
26176 }
26178 }
26180 /* Parse a list of Objective-C protocol references.
26182 objc-protocol-refs-opt:
26183 objc-protocol-refs [opt]
26185 objc-protocol-refs:
26186 < objc-identifier-list >
26188 Returns a TREE_LIST of identifiers, if any. */
26190 static tree
26192 {
26196 {
26200 }
26203 }
26205 /* Parse a Objective-C visibility specification. */
26207 static void
26209 {
26213 {
26228 }
26230 /* Eat '@private'/'@protected'/'@public'. */
26232 }
26234 /* Parse an Objective-C method type. Return 'true' if it is a class
26235 (+) method, and 'false' if it is an instance (-) method. */
26239 {
26242 else
26244 }
26246 /* Parse an Objective-C protocol qualifier. */
26248 static tree
26250 {
26263 {
26268 }
26271 }
26273 /* Parse an Objective-C typename. */
26275 static tree
26277 {
26281 {
26287 /* An ObjC type name may consist of just protocol qualifiers, in which
26288 case the type shall default to 'id'. */
26290 {
26293 /* If the type could not be parsed, an error has already
26294 been produced. For error recovery, behave as if it had
26295 not been specified, which will use the default type
26296 'id'. */
26298 {
26300 /* We need to skip to the closing parenthesis as
26301 cp_parser_type_id() does not seem to do it for
26302 us. */
26307 }
26308 }
26312 }
26315 }
26317 /* Check to see if TYPE refers to an Objective-C selector name. */
26319 static bool
26321 {
26327 }
26329 /* Parse an Objective-C selector. */
26331 static tree
26333 {
26337 {
26340 }
26342 /* C++ operator names are allowed to appear in ObjC selectors. */
26344 {
26357 }
26358 }
26360 /* Parse an Objective-C params list. */
26362 static tree
26364 {
26370 {
26380 /* Detect if we have a unary selector. */
26383 {
26386 }
26390 {
26391 /* Something went quite wrong. There should be a colon
26392 here, but there is not. Stop parsing parameters. */
26394 }
26396 /* New ObjC allows attributes on parameters too. */
26401 params
26404 type_name,
26405 identifier,
26406 parm_attr));
26409 }
26412 {
26415 }
26417 /* We allow tail attributes for the method. */
26419 {
26427 }
26430 {
26433 }
26435 }
26437 /* Parse the non-keyword Objective-C params. */
26439 static tree
26442 {
26448 {
26450 tree parm;
26456 {
26461 }
26463 /* TODO: parse attributes for tail parameters. */
26472 }
26474 /* We allow tail attributes for the method. */
26476 {
26478 {
26483 }
26484 else
26485 /* We have an error, but parse the attributes, so that we can
26486 carry on. */
26492 }
26495 }
26497 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26499 static void
26501 {
26504 /* If the next token is `extern' and the following token is a string
26505 literal, then we have a linkage specification. */
26507 && cp_parser_is_pure_string_literal
26510 /* Handle #pragma, if any. */
26513 /* Allow stray semicolons. */
26516 /* Mark methods as optional or required, when building protocols. */
26518 {
26521 }
26523 {
26526 }
26529 /* Other stray characters must generate errors. */
26531 {
26535 }
26536 /* Finally, try to parse a block-declaration, or a function-definition. */
26537 else
26539 }
26541 /* Parse a method signature. */
26543 static tree
26545 {
26561 }
26563 static bool
26565 {
26566 tree tattr;
26571 /* If the attributes are followed by a method introducer, this is not allowed.
26572 Dump the attributes and flag the situation. */
26577 /* Otherwise, the attributes introduce some interstitial code, possibly so
26578 rewind to allow that check. */
26581 }
26583 /* Parse an Objective-C method prototype list. */
26585 static void
26587 {
26591 {
26593 {
26598 else
26602 {
26606 }
26609 }
26615 OPT_Wattributes,
26617 else
26618 /* Allow for interspersed non-ObjC++ code. */
26622 }
26626 else
26630 }
26632 /* Parse an Objective-C method definition list. */
26634 static void
26636 {
26640 {
26641 tree meth;
26644 {
26650 else
26655 {
26659 }
26661 NULL_TREE);
26663 /* For historical reasons, we accept an optional semicolon. */
26670 {
26677 }
26678 }
26679 /* The following case will be removed once @synthesize is
26680 completely implemented. */
26691 else
26692 /* Allow for interspersed non-ObjC++ code. */
26696 }
26700 else
26704 }
26706 /* Parse Objective-C ivars. */
26708 static void
26710 {
26721 {
26722 cp_decl_specifier_seq declspecs;
26724 tree prefix_attributes;
26732 CP_PARSER_FLAGS_OPTIONAL,
26736 /* auto, register, static, extern, mutable. */
26738 {
26741 }
26743 /* thread_local. */
26745 {
26748 }
26750 /* typedef. */
26752 {
26755 }
26760 /* Keep going until we hit the `;' at the end of the
26761 declaration. */
26763 {
26768 /* Check for a (possibly unnamed) bitfield declaration. */
26776 {
26777 /* Get the name of the bitfield. */
26780 sfk_none);
26782 eat_colon:
26784 /* Get the width of the bitfield. */
26785 width
26787 }
26788 else
26789 {
26790 /* Parse the declarator. */
26791 declarator
26797 }
26799 /* Look for attributes that apply to the ivar. */
26801 /* Remember which attributes are prefix attributes and
26802 which are not. */
26804 /* Combine the attributes. */
26808 /* Create the bitfield declaration. */
26810 width,
26811 attributes);
26812 else
26817 /* Add the instance variable. */
26821 /* Reset PREFIX_ATTRIBUTES. */
26830 {
26833 }
26835 }
26839 }
26844 /* Do not consume the RID_AT_END, so it will be read again as terminating
26845 the @interface of @implementation. */
26849 /* For historical reasons, we accept an optional semicolon. */
26852 }
26854 /* Parse an Objective-C protocol declaration. */
26856 static void
26858 {
26864 {
26869 }
26871 /* See if we have a forward declaration or a definition. */
26874 /* Try a forward declaration first. */
26876 {
26878 {
26879 tree id;
26889 else
26891 }
26893 }
26895 /* Ok, we got a full-fledged definition (or at least should). */
26896 else
26897 {
26902 }
26903 }
26905 /* Parse an Objective-C superclass or category. */
26907 static void
26912 {
26918 {
26921 }
26923 {
26926 /* If there is no category name, and this is an @interface, we
26927 have a class extension. */
26929 {
26932 }
26933 else
26937 }
26938 }
26940 /* Parse an Objective-C class interface. */
26942 static void
26944 {
26951 {
26952 /* It's hard to recover because even if valid @interface stuff
26953 is to follow, we can't compile it (or validate it) if we
26954 don't even know which class it refers to. Let's assume this
26955 was a stray '@interface' token in the stream and skip it.
26956 */
26958 }
26963 /* We have either a class or a category on our hands. */
26966 else
26967 {
26969 /* Handle instance variable declarations, if any. */
26972 }
26975 }
26977 /* Parse an Objective-C class implementation. */
26979 static void
26981 {
26988 {
26989 /* It's hard to recover because even if valid @implementation
26990 stuff is to follow, we can't compile it (or validate it) if
26991 we don't even know which class it refers to. Let's assume
26992 this was a stray '@implementation' token in the stream and
26993 skip it.
26994 */
26996 }
27000 /* We have either a class or a category on our hands. */
27003 else
27004 {
27006 /* Handle instance variable declarations, if any. */
27009 }
27012 }
27014 /* Consume the @end token and finish off the implementation. */
27016 static void
27018 {
27021 }
27023 /* Parse an Objective-C declaration. */
27025 static void
27027 {
27028 /* Try to figure out what kind of declaration is present. */
27033 {
27049 }
27052 {
27075 }
27076 }
27078 /* Parse an Objective-C try-catch-finally statement.
27080 objc-try-catch-finally-stmt:
27081 @try compound-statement objc-catch-clause-seq [opt]
27082 objc-finally-clause [opt]
27084 objc-catch-clause-seq:
27085 objc-catch-clause objc-catch-clause-seq [opt]
27087 objc-catch-clause:
27088 @catch ( objc-exception-declaration ) compound-statement
27090 objc-finally-clause:
27091 @finally compound-statement
27093 objc-exception-declaration:
27094 parameter-declaration
27095 '...'
27097 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
27099 Returns NULL_TREE.
27101 PS: This function is identical to c_parser_objc_try_catch_finally_statement
27102 for C. Keep them in sync. */
27104 static tree
27106 {
27107 location_t location;
27108 tree stmt;
27113 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
27114 node, lest it get absorbed into the surrounding block. */
27120 {
27129 {
27130 /* We have "@catch (...)" (where the '...' are literally
27131 what is in the code). Skip the '...'.
27132 parameter_declaration is set to NULL_TREE, and
27133 objc_being_catch_clauses() knows that that means
27134 '...'. */
27137 }
27138 else
27139 {
27140 /* We have "@catch (NSException *exception)" or something
27141 like that. Parse the parameter declaration. */
27145 else
27150 }
27153 else
27154 {
27155 /* If there was no open parenthesis, we are recovering from
27156 an error, and we are trying to figure out what mistake
27157 the user has made. */
27159 /* If there is an immediate closing parenthesis, the user
27160 probably forgot the opening one (ie, they typed "@catch
27161 NSException *e)". Parse the closing parenthesis and keep
27162 going. */
27166 /* If these is no immediate closing parenthesis, the user
27167 probably doesn't know that parenthesis are required at
27168 all (ie, they typed "@catch NSException *e"). So, just
27169 forget about the closing parenthesis and keep going. */
27170 }
27174 }
27176 {
27179 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27180 node, lest it get absorbed into the surrounding block. */
27184 }
27187 }
27189 /* Parse an Objective-C synchronized statement.
27191 objc-synchronized-stmt:
27192 @synchronized ( expression ) compound-statement
27194 Returns NULL_TREE. */
27196 static tree
27198 {
27199 location_t location;
27210 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27211 node, lest it get absorbed into the surrounding block. */
27216 }
27218 /* Parse an Objective-C throw statement.
27220 objc-throw-stmt:
27221 @throw assignment-expression [opt] ;
27223 Returns a constructed '@throw' statement. */
27225 static tree
27227 {
27239 }
27241 /* Parse an Objective-C statement. */
27243 static tree
27245 {
27246 /* Try to figure out what kind of declaration is present. */
27250 {
27261 }
27264 }
27266 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27267 look ahead to see if an objc keyword follows the attributes. This
27268 is to detect the use of prefix attributes on ObjC @interface and
27269 @protocol. */
27271 static bool
27273 {
27278 {
27281 }
27284 }
27286 /* This routine is a minimal replacement for
27287 c_parser_struct_declaration () used when parsing the list of
27288 types/names or ObjC++ properties. For example, when parsing the
27289 code
27291 @property (readonly) int a, b, c;
27293 this function is responsible for parsing "int a, int b, int c" and
27294 returning the declarations as CHAIN of DECLs.
27296 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27297 similar parsing. */
27298 static tree
27300 {
27302 cp_decl_specifier_seq declspecs;
27304 tree prefix_attributes;
27307 CP_PARSER_FLAGS_NONE,
27314 /* auto, register, static, extern, mutable. */
27316 {
27319 }
27321 /* thread_local. */
27323 {
27326 }
27328 /* typedef. */
27330 {
27333 }
27338 /* Keep going until we hit the `;' at the end of the declaration. */
27340 {
27345 /* Parse the declarator. */
27349 /* Look for attributes that apply to the ivar. */
27351 /* Remember which attributes are prefix attributes and
27352 which are not. */
27354 /* Combine the attributes. */
27364 /* Reset PREFIX_ATTRIBUTES. */
27375 {
27378 }
27379 else
27381 }
27383 }
27385 /* Parse an Objective-C @property declaration. The syntax is:
27387 objc-property-declaration:
27388 '@property' objc-property-attributes[opt] struct-declaration ;
27390 objc-property-attributes:
27391 '(' objc-property-attribute-list ')'
27393 objc-property-attribute-list:
27394 objc-property-attribute
27395 objc-property-attribute-list, objc-property-attribute
27397 objc-property-attribute
27398 'getter' = identifier
27399 'setter' = identifier
27400 'readonly'
27401 'readwrite'
27402 'assign'
27403 'retain'
27404 'copy'
27405 'nonatomic'
27407 For example:
27408 @property NSString *name;
27409 @property (readonly) id object;
27410 @property (retain, nonatomic, getter=getTheName) id name;
27411 @property int a, b, c;
27413 PS: This function is identical to
27414 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27415 static void
27417 {
27418 /* The following variables hold the attributes of the properties as
27419 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27420 seen. When we see an attribute, we set them to 'true' (if they
27421 are boolean properties) or to the identifier (if they have an
27422 argument, ie, for getter and setter). Note that here we only
27423 parse the list of attributes, check the syntax and accumulate the
27424 attributes that we find. objc_add_property_declaration() will
27425 then process the information. */
27435 /* 'properties' is the list of properties that we read. Usually a
27436 single one, but maybe more (eg, in "@property int a, b, c;" there
27437 are three). */
27438 tree properties;
27439 location_t loc;
27445 /* Parse the optional attribute list... */
27447 {
27448 /* Eat the '('. */
27452 {
27458 {
27461 }
27465 {
27476 {
27480 else
27485 }
27488 {
27492 }
27494 {
27496 {
27499 }
27500 else
27504 else
27506 }
27507 else
27508 {
27510 {
27513 }
27514 else
27516 }
27522 }
27529 else
27531 }
27533 /* FIXME: "@property (setter, assign);" will generate a spurious
27534 "error: expected ‘)’ before ‘,’ token". This is because
27535 cp_parser_require, unlike the C counterpart, will produce an
27536 error even if we are in error recovery. */
27538 {
27543 }
27544 }
27546 /* ... and the property declaration(s). */
27550 {
27552 /* If the next token is now a `;', consume it. */
27556 }
27560 else
27561 {
27562 /* Comma-separated properties are chained together in
27563 reverse order; add them one by one. */
27572 }
27575 }
27577 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27579 objc-synthesize-declaration:
27580 @synthesize objc-synthesize-identifier-list ;
27582 objc-synthesize-identifier-list:
27583 objc-synthesize-identifier
27584 objc-synthesize-identifier-list, objc-synthesize-identifier
27586 objc-synthesize-identifier
27587 identifier
27588 identifier = identifier
27590 For example:
27591 @synthesize MyProperty;
27592 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27594 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27595 for C. Keep them in sync.
27596 */
27597 static void
27599 {
27601 location_t loc;
27606 {
27610 {
27613 }
27615 {
27619 {
27622 }
27623 }
27624 else
27629 else
27631 }
27634 }
27636 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27638 objc-dynamic-declaration:
27639 @dynamic identifier-list ;
27641 For example:
27642 @dynamic MyProperty;
27643 @dynamic MyProperty, AnotherProperty;
27645 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27646 for C. Keep them in sync.
27647 */
27648 static void
27650 {
27652 location_t loc;
27657 {
27658 tree property;
27661 {
27664 }
27668 else
27670 }
27673 }
27675 \f
27676 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27678 /* Returns name of the next clause.
27679 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27680 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27681 returned and the token is consumed. */
27683 static pragma_omp_clause
27685 {
27699 {
27704 {
27847 }
27848 }
27854 }
27856 /* Validate that a clause of the given type does not already exist. */
27858 static void
27861 {
27862 tree c;
27866 {
27869 }
27870 }
27872 /* OpenMP 2.5:
27873 variable-list:
27874 identifier
27875 variable-list , identifier
27877 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27878 colon). An opening parenthesis will have been consumed by the caller.
27880 If KIND is nonzero, create the appropriate node and install the decl
27881 in OMP_CLAUSE_DECL and add the node to the head of the list.
27883 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27884 return the list created.
27886 COLON can be NULL if only closing parenthesis should end the list,
27887 or pointer to bool which will receive false if the list is terminated
27888 by closing parenthesis or true if the list is terminated by colon. */
27890 static tree
27893 {
27897 {
27900 }
27902 {
27919 {
27921 {
27924 {
27928 }
27929 /* FALL THROUGH. */
27935 {
27943 parser->colon_corrects_to_scope_p
27947 else
27948 {
27949 /* Look for `:'. */
27953 CPP_CLOSE_SQUARE))
27955 }
27956 /* So we need here fully folded values. */
27961 /* Look for the closing `]'. */
27963 RT_CLOSE_SQUARE))
27967 {
27970 {
27974 }
27978 {
27982 }
27983 }
27986 }
27990 }
27996 }
27997 else
28000 get_comma:
28004 }
28010 {
28014 }
28017 {
28020 /* Try to resync to an unnested comma. Copied from
28021 cp_parser_parenthesized_expression_list. */
28022 skip_comma:
28031 }
28034 }
28036 /* Similarly, but expect leading and trailing parenthesis. This is a very
28037 common case for omp clauses. */
28039 static tree
28041 {
28045 }
28047 /* OpenACC 2.0:
28048 copy ( variable-list )
28049 copyin ( variable-list )
28050 copyout ( variable-list )
28051 create ( variable-list )
28052 delete ( variable-list )
28053 present ( variable-list )
28054 present_or_copy ( variable-list )
28055 pcopy ( variable-list )
28056 present_or_copyin ( variable-list )
28057 pcopyin ( variable-list )
28058 present_or_copyout ( variable-list )
28059 pcopyout ( variable-list )
28060 present_or_create ( variable-list )
28061 pcreate ( variable-list ) */
28063 static tree
28065 tree list)
28066 {
28069 {
28109 }
28117 }
28119 /* OpenACC 2.0:
28120 deviceptr ( variable-list ) */
28122 static tree
28124 {
28128 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
28129 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
28130 variable-list must only allow for pointer variables. */
28133 {
28136 /* FIXME diagnostics: Ideally we should keep individual
28137 locations for all the variables in the var list to make the
28138 following errors more precise. Perhaps
28139 c_parser_omp_var_list_parens should construct a list of
28140 locations to go along with the var list. */
28145 ;
28154 }
28157 }
28159 /* OpenACC:
28160 vector_length ( expression ) */
28162 static tree
28164 {
28174 {
28177 }
28180 {
28185 }
28188 location);
28196 }
28198 /* OpenACC 2.0
28199 Parse wait clause or directive parameters. */
28201 static tree
28203 {
28213 {
28218 }
28225 {
28229 {
28232 else
28233 {
28240 }
28241 }
28242 }
28245 }
28247 /* OpenACC:
28248 wait ( int-expr-list ) */
28250 static tree
28252 {
28261 }
28263 /* OpenMP 3.0:
28264 collapse ( constant-expression ) */
28266 static tree
28268 {
28270 location_t loc;
28271 HOST_WIDE_INT n;
28291 {
28294 }
28302 }
28304 /* OpenMP 2.5:
28305 default ( shared | none ) */
28307 static tree
28309 {
28311 tree c;
28316 {
28321 {
28336 }
28339 }
28340 else
28341 {
28342 invalid_kind:
28344 }
28360 }
28362 /* OpenMP 3.1:
28363 final ( expression ) */
28365 static tree
28367 {
28388 }
28390 /* OpenMP 2.5:
28391 if ( expression ) */
28393 static tree
28395 {
28416 }
28418 /* OpenMP 3.1:
28419 mergeable */
28421 static tree
28424 {
28425 tree c;
28428 location);
28433 }
28435 /* OpenMP 2.5:
28436 nowait */
28438 static tree
28441 {
28442 tree c;
28449 }
28451 /* OpenACC:
28452 num_gangs ( expression ) */
28454 static tree
28456 {
28472 {
28475 }
28485 }
28487 /* OpenMP 2.5:
28488 num_threads ( expression ) */
28490 static tree
28492 location_t location)
28493 {
28515 }
28517 /* OpenACC:
28518 num_workers ( expression ) */
28520 static tree
28522 {
28538 {
28541 }
28544 location);
28552 }
28554 /* OpenMP 2.5:
28555 ordered */
28557 static tree
28560 {
28561 tree c;
28569 }
28571 /* OpenMP 2.5:
28572 reduction ( reduction-operator : variable-list )
28574 reduction-operator:
28575 One of: + * - & ^ | && ||
28577 OpenMP 3.1:
28579 reduction-operator:
28580 One of: + * - & ^ | && || min max
28582 OpenMP 4.0:
28584 reduction-operator:
28585 One of: + * - & ^ | && ||
28586 id-expression */
28588 static tree
28590 {
28598 {
28608 }
28612 else
28613 {
28624 {
28654 }
28655 else
28656 {
28658 resync_fail:
28663 }
28664 }
28670 NULL);
28672 {
28675 }
28678 }
28680 /* OpenMP 2.5:
28681 schedule ( schedule-kind )
28682 schedule ( schedule-kind , expression )
28684 schedule-kind:
28685 static | dynamic | guided | runtime | auto */
28687 static tree
28689 {
28698 {
28703 {
28724 }
28725 }
28730 else
28735 {
28750 else
28755 }
28763 invalid_kind:
28765 resync_fail:
28770 }
28772 /* OpenMP 3.0:
28773 untied */
28775 static tree
28778 {
28779 tree c;
28786 }
28788 /* OpenMP 4.0:
28789 inbranch
28790 notinbranch */
28792 static tree
28795 {
28800 }
28802 /* OpenMP 4.0:
28803 parallel
28804 for
28805 sections
28806 taskgroup */
28808 static tree
28812 {
28816 }
28818 /* OpenMP 4.0:
28819 num_teams ( expression ) */
28821 static tree
28823 location_t location)
28824 {
28846 }
28848 /* OpenMP 4.0:
28849 thread_limit ( expression ) */
28851 static tree
28853 location_t location)
28854 {
28876 }
28878 /* OpenMP 4.0:
28879 aligned ( variable-list )
28880 aligned ( variable-list : constant-expression ) */
28882 static tree
28884 {
28895 {
28906 }
28912 }
28914 /* OpenMP 4.0:
28915 linear ( variable-list )
28916 linear ( variable-list : expression ) */
28918 static tree
28921 {
28932 {
28936 {
28939 }
28947 }
28953 }
28955 /* OpenMP 4.0:
28956 safelen ( constant-expression ) */
28958 static tree
28960 location_t location)
28961 {
28982 }
28984 /* OpenMP 4.0:
28985 simdlen ( constant-expression ) */
28987 static tree
28989 location_t location)
28990 {
29011 }
29013 /* OpenMP 4.0:
29014 depend ( depend-kind : variable-list )
29016 depend-kind:
29017 in | out | inout */
29019 static tree
29021 {
29029 {
29039 else
29041 }
29042 else
29050 NULL);
29057 invalid_kind:
29059 resync_fail:
29064 }
29066 /* OpenMP 4.0:
29067 map ( map-kind : variable-list )
29068 map ( variable-list )
29070 map-kind:
29071 alloc | to | from | tofrom */
29073 static tree
29075 {
29084 {
29096 else
29097 {
29103 }
29106 }
29109 NULL);
29115 }
29117 /* OpenMP 4.0:
29118 device ( expression ) */
29120 static tree
29122 location_t location)
29123 {
29145 }
29147 /* OpenMP 4.0:
29148 dist_schedule ( static )
29149 dist_schedule ( static , expression ) */
29151 static tree
29153 location_t location)
29154 {
29167 {
29178 }
29183 location);
29187 invalid_kind:
29189 resync_fail:
29194 }
29196 /* OpenMP 4.0:
29197 proc_bind ( proc-bind-kind )
29199 proc-bind-kind:
29200 master | close | spread */
29202 static tree
29204 location_t location)
29205 {
29206 tree c;
29213 {
29223 else
29225 }
29226 else
29235 location);
29240 invalid_kind:
29242 resync_fail:
29247 }
29249 /* OpenACC:
29250 async [( int-expr )] */
29252 static tree
29254 {
29261 {
29270 }
29280 }
29282 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29283 is a bitmask in MASK. Return the list of clauses found. */
29285 static tree
29289 {
29294 {
29295 location_t here;
29296 pragma_omp_clause c_kind;
29307 {
29399 }
29404 {
29405 /* Remove the invalid clause(s) from the list to avoid
29406 confusing the rest of the compiler. */
29409 }
29410 }
29412 saw_error:
29419 }
29421 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29422 is a bitmask in MASK. Return the list of clauses found; the result
29423 of clause default goes in *pdefault. */
29425 static tree
29429 {
29436 {
29437 pragma_omp_clause c_kind;
29448 {
29460 clauses);
29474 clauses);
29483 clauses);
29507 clauses);
29521 clauses);
29538 OMP_CLAUSE_NOTINBRANCH,
29547 {
29548 clause_not_first:
29552 }
29577 clauses);
29582 clauses);
29587 clauses);
29650 }
29655 {
29656 /* Remove the invalid clause(s) from the list to avoid
29657 confusing the rest of the compiler. */
29660 }
29661 }
29662 saw_error:
29663 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29664 no reason to skip to the end. */
29670 }
29672 /* OpenMP 2.5:
29673 structured-block:
29674 statement
29676 In practice, we're also interested in adding the statement to an
29677 outer node. So it is convenient if we work around the fact that
29678 cp_parser_statement calls add_stmt. */
29680 static unsigned
29682 {
29685 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29686 This preserves the "not within loop or switch" style error messages
29687 for nonsense cases like
29688 void foo() {
29689 #pragma omp single
29690 break;
29691 }
29692 */
29697 }
29699 static void
29701 {
29703 }
29705 static tree
29707 {
29715 }
29717 /* OpenMP 2.5:
29718 # pragma omp atomic new-line
29719 expression-stmt
29721 expression-stmt:
29722 x binop= expr | x++ | ++x | x-- | --x
29723 binop:
29724 +, *, -, /, &, ^, |, <<, >>
29726 where x is an lvalue expression with scalar type.
29728 OpenMP 3.1:
29729 # pragma omp atomic new-line
29730 update-stmt
29732 # pragma omp atomic read new-line
29733 read-stmt
29735 # pragma omp atomic write new-line
29736 write-stmt
29738 # pragma omp atomic update new-line
29739 update-stmt
29741 # pragma omp atomic capture new-line
29742 capture-stmt
29744 # pragma omp atomic capture new-line
29745 capture-block
29747 read-stmt:
29748 v = x
29749 write-stmt:
29750 x = expr
29751 update-stmt:
29752 expression-stmt | x = x binop expr
29753 capture-stmt:
29754 v = expression-stmt
29755 capture-block:
29756 { v = x; update-stmt; } | { update-stmt; v = x; }
29758 OpenMP 4.0:
29759 update-stmt:
29760 expression-stmt | x = x binop expr | x = expr binop x
29761 capture-stmt:
29762 v = update-stmt
29763 capture-block:
29764 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29766 where x and v are lvalue expressions with scalar type. */
29768 static void
29770 {
29778 {
29783 {
29789 }
29790 }
29792 {
29804 else
29808 }
29810 {
29816 {
29821 {
29824 }
29825 }
29826 }
29830 {
29840 else
29845 {
29846 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29847 opcode. */
29852 }
29856 {
29859 }
29860 else
29861 {
29867 }
29870 }
29872 restart:
29876 {
29883 /* FALLTHROUGH */
29893 /* FALLTHROUGH */
29908 /* Undo effects of boolean_increment for post {in,de}crement. */
29910 /* FALLTHRU */
29914 {
29915 /* Undo effects of boolean_increment. */
29917 {
29918 /* This is pre or post increment. */
29923 && !structured_block
29927 }
29928 }
29929 /* FALLTHRU */
29932 {
29967 {
29971 }
29974 {
29980 {
29985 }
29987 {
29999 {
30001 {
30006 }
30007 else
30009 }
30013 }
30016 {
30023 }
30027 }
30031 {
30034 {
30042 }
30044 {
30049 }
30084 }
30095 /* FALLTHROUGH */
30100 }
30107 }
30108 stmt_done:
30110 {
30121 }
30123 {
30126 }
30127 done:
30133 saw_error:
30136 {
30140 {
30144 }
30145 }
30146 }
30149 /* OpenMP 2.5:
30150 # pragma omp barrier new-line */
30152 static void
30154 {
30157 }
30159 /* OpenMP 2.5:
30160 # pragma omp critical [(name)] new-line
30161 structured-block */
30163 static tree
30165 {
30169 {
30181 }
30186 }
30188 /* OpenMP 2.5:
30189 # pragma omp flush flush-vars[opt] new-line
30191 flush-vars:
30192 ( variable-list ) */
30194 static void
30196 {
30202 }
30204 /* Helper function, to parse omp for increment expression. */
30206 static tree
30208 {
30213 {
30216 }
30219 {
30228 /* Fall through: OpenMP disallows NE_EXPR. */
30231 }
30233 /* If decl is an iterator, preserve LHS and RHS of the relational
30234 expr until finish_omp_for. */
30244 }
30246 /* Helper function, to parse omp for increment expression. */
30248 static tree
30250 {
30254 cp_id_kind idk;
30258 {
30266 }
30274 {
30279 }
30286 {
30290 }
30302 do
30303 {
30310 {
30312 {
30315 else
30317 tf_warning_or_error);
30320 }
30321 else
30324 }
30325 }
30329 {
30333 }
30334 else
30338 }
30340 /* Parse the initialization statement of either an OpenMP for loop or
30341 a Cilk Plus for loop.
30343 Return true if the resulting construct should have an
30344 OMP_CLAUSE_PRIVATE added to it. */
30346 static bool
30354 {
30360 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30362 init-expr:
30363 var = lb
30364 integer-type var = lb
30365 random-access-iterator-type var = lb
30366 pointer-type var = lb
30367 */
30368 cp_decl_specifier_seq type_specifiers;
30370 /* First, try to parse as an initialized declaration. See
30371 cp_parser_condition, from whence the bulk of this is copied. */
30378 {
30379 /* If parsing a type specifier seq succeeded, then this
30380 MUST be a initialized declaration. */
30385 CP_PARSER_DECLARATOR_NAMED,
30396 else
30397 {
30407 {
30409 CPP_OPEN_PAREN))
30410 {
30414 else
30417 }
30418 else
30419 /* Trigger an error. */
30424 }
30428 {
30436 {
30439 auto_node);
30444 }
30447 asm_specification,
30448 LOOKUP_ONLYCONVERTING);
30450 {
30453 }
30454 else
30457 }
30458 else
30459 {
30460 /* Consume '='. */
30464 non_class:
30467 else
30470 asm_specification,
30471 LOOKUP_ONLYCONVERTING);
30472 }
30476 }
30477 }
30478 else
30479 {
30480 cp_id_kind idk;
30481 /* If parsing a type specifier sequence failed, then
30482 this MUST be a simple expression. */
30490 && decl
30493 {
30494 tree rhs;
30501 rhs,
30502 tf_warning_or_error));
30504 }
30505 else
30506 {
30511 {
30515 }
30516 }
30517 }
30519 }
30521 /* Parse the restricted form of the for statement allowed by OpenMP. */
30523 static tree
30526 {
30530 location_t loc_first;
30549 {
30552 location_t loc;
30556 {
30559 }
30562 {
30565 }
30574 add_private_clause
30581 {
30584 {
30590 }
30591 else
30593 }
30600 {
30605 {
30609 }
30612 {
30613 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
30617 {
30620 }
30621 else
30622 {
30625 }
30627 }
30628 else
30629 {
30634 }
30635 }
30638 {
30639 tree c;
30641 {
30650 decl);
30654 decl);
30655 }
30657 {
30662 {
30665 }
30666 }
30667 }
30676 {
30677 /* If decl is an iterator, preserve the operator on decl
30678 until finish_omp_for. */
30680 && ((processing_template_decl
30684 else
30688 }
30703 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30704 in between the collapsed for loops to be still considered perfectly
30705 nested. Hopefully the final version clarifies this.
30706 For now handle (multiple) {'s and empty statements. */
30708 do
30709 {
30713 {
30715 bracecount++;
30716 }
30720 else
30721 {
30728 }
30729 }
30733 {
30736 }
30737 }
30739 /* Note that we saved the original contents of this flag when we entered
30740 the structured block, and so we don't need to re-save it here. */
30743 else
30746 /* Note that the grammar doesn't call for a structured block here,
30747 though the loop as a whole is a structured block. */
30754 else
30759 {
30761 {
30763 nbraces--;
30764 }
30767 else
30768 {
30770 {
30773 }
30778 }
30779 }
30786 }
30788 /* Helper function for OpenMP parsing, split clauses and call
30789 finish_omp_clauses on each of the set of clauses afterwards. */
30791 static void
30794 {
30800 }
30802 /* OpenMP 4.0:
30803 #pragma omp simd simd-clause[optseq] new-line
30804 for-loop */
30806 #define OMP_SIMD_CLAUSE_MASK \
30807 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30808 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30809 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30810 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30811 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30812 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30813 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30815 static tree
30818 {
30830 {
30833 }
30844 }
30846 /* OpenMP 2.5:
30847 #pragma omp for for-clause[optseq] new-line
30848 for-loop
30850 OpenMP 4.0:
30851 #pragma omp for simd for-simd-clause[optseq] new-line
30852 for-loop */
30854 #define OMP_FOR_CLAUSE_MASK \
30855 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30859 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30860 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30861 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30862 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30864 static tree
30867 {
30878 {
30883 {
30891 cclauses);
30895 cclauses);
30907 }
30908 }
30910 {
30913 }
30918 {
30921 }
30932 }
30934 /* OpenMP 2.5:
30935 # pragma omp master new-line
30936 structured-block */
30938 static tree
30940 {
30944 }
30946 /* OpenMP 2.5:
30947 # pragma omp ordered new-line
30948 structured-block */
30950 static tree
30952 {
30956 }
30958 /* OpenMP 2.5:
30960 section-scope:
30961 { section-sequence }
30963 section-sequence:
30964 section-directive[opt] structured-block
30965 section-sequence section-directive structured-block */
30967 static tree
30969 {
30980 {
30984 }
30987 {
30995 {
30999 }
31001 {
31004 }
31009 }
31020 }
31022 /* OpenMP 2.5:
31023 # pragma omp sections sections-clause[optseq] newline
31024 sections-scope */
31026 #define OMP_SECTIONS_CLAUSE_MASK \
31027 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31028 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31029 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31030 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31031 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31033 static tree
31036 {
31048 {
31051 }
31058 }
31060 /* OpenMP 2.5:
31061 # pragma omp parallel parallel-clause[optseq] new-line
31062 structured-block
31063 # pragma omp parallel for parallel-for-clause[optseq] new-line
31064 structured-block
31065 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
31066 structured-block
31068 OpenMP 4.0:
31069 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
31070 structured-block */
31072 #define OMP_PARALLEL_CLAUSE_MASK \
31073 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31074 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31075 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31076 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31077 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31078 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31079 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31080 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
31081 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
31083 static tree
31086 {
31095 {
31108 block);
31113 }
31115 {
31119 }
31121 {
31124 }
31126 {
31130 {
31140 block);
31143 }
31144 }
31154 }
31156 /* OpenMP 2.5:
31157 # pragma omp single single-clause[optseq] new-line
31158 structured-block */
31160 #define OMP_SINGLE_CLAUSE_MASK \
31161 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31166 static tree
31168 {
31178 }
31180 /* OpenMP 3.0:
31181 # pragma omp task task-clause[optseq] new-line
31182 structured-block */
31184 #define OMP_TASK_CLAUSE_MASK \
31185 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31191 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31192 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31193 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31195 static tree
31197 {
31208 }
31210 /* OpenMP 3.0:
31211 # pragma omp taskwait new-line */
31213 static void
31215 {
31218 }
31220 /* OpenMP 3.1:
31221 # pragma omp taskyield new-line */
31223 static void
31225 {
31228 }
31230 /* OpenMP 4.0:
31231 # pragma omp taskgroup new-line
31232 structured-block */
31234 static tree
31236 {
31240 }
31243 /* OpenMP 2.5:
31244 # pragma omp threadprivate (variable-list) */
31246 static void
31248 {
31249 tree vars;
31255 }
31257 /* OpenMP 4.0:
31258 # pragma omp cancel cancel-clause[optseq] new-line */
31260 #define OMP_CANCEL_CLAUSE_MASK \
31261 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31262 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31263 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31264 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31265 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31267 static void
31269 {
31273 }
31275 /* OpenMP 4.0:
31276 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31278 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31279 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31280 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31281 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31282 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31284 static void
31286 {
31287 tree clauses;
31291 {
31296 {
31299 }
31300 }
31302 {
31306 }
31309 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31311 pragma_tok);
31313 }
31315 /* OpenMP 4.0:
31316 #pragma omp distribute distribute-clause[optseq] new-line
31317 for-loop */
31319 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31320 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31321 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31322 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31323 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31325 static tree
31328 {
31337 {
31345 else
31348 {
31354 {
31357 cclauses);
31358 else
31360 cclauses);
31361 }
31366 cclauses);
31367 else
31369 cclauses);
31381 }
31382 }
31384 {
31387 }
31392 {
31395 }
31406 }
31408 /* OpenMP 4.0:
31409 # pragma omp teams teams-clause[optseq] new-line
31410 structured-block */
31412 #define OMP_TEAMS_CLAUSE_MASK \
31413 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31414 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31415 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31416 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31417 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31418 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31419 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31421 static tree
31424 {
31433 {
31437 {
31445 cclauses);
31449 cclauses);
31461 }
31462 }
31464 {
31467 }
31472 {
31475 }
31483 }
31485 /* OpenMP 4.0:
31486 # pragma omp target data target-data-clause[optseq] new-line
31487 structured-block */
31489 #define OMP_TARGET_DATA_CLAUSE_MASK \
31490 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31494 static tree
31496 {
31508 }
31510 /* OpenMP 4.0:
31511 # pragma omp target update target-update-clause[optseq] new-line */
31513 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31514 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31515 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31516 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31517 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31519 static bool
31522 {
31524 {
31526 "%<#pragma omp target update%> may only be "
31530 }
31532 tree clauses
31537 {
31539 "%<#pragma omp target update%> must contain at least one "
31542 }
31550 }
31552 /* OpenMP 4.0:
31553 # pragma omp target target-clause[optseq] new-line
31554 structured-block */
31556 #define OMP_TARGET_CLAUSE_MASK \
31557 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31558 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31559 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31561 static bool
31564 {
31566 {
31570 }
31573 {
31578 {
31586 {
31588 OMP_TARGET_CLAUSE_MASK,
31589 cclauses);
31591 }
31607 }
31609 {
31612 }
31614 {
31618 }
31620 {
31623 }
31624 }
31638 }
31640 /* OpenACC 2.0:
31641 # pragma acc cache (variable-list) new-line
31642 */
31644 static tree
31646 {
31661 }
31663 /* OpenACC 2.0:
31664 # pragma acc data oacc-data-clause[optseq] new-line
31665 structured-block */
31667 #define OACC_DATA_CLAUSE_MASK \
31668 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31669 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31670 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31671 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31672 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31673 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31674 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31675 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31676 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31677 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31678 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31680 static tree
31682 {
31695 }
31697 /* OpenACC 2.0:
31698 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31700 or
31702 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31704 LOC is the location of the #pragma token.
31705 */
31707 #define OACC_ENTER_DATA_CLAUSE_MASK \
31708 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31709 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31710 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31711 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31712 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31713 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31714 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31716 #define OACC_EXIT_DATA_CLAUSE_MASK \
31717 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31718 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31719 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31720 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31721 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31723 static tree
31726 {
31731 {
31737 }
31742 {
31746 }
31753 else
31758 {
31762 }
31770 }
31772 /* OpenACC 2.0:
31773 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31774 structured-block */
31776 #define OACC_KERNELS_CLAUSE_MASK \
31777 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31778 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31779 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31780 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31781 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31782 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31791 static tree
31793 {
31806 }
31808 /* OpenACC 2.0:
31809 # pragma acc loop oacc-loop-clause[optseq] new-line
31810 structured-block */
31812 #define OACC_LOOP_CLAUSE_MASK \
31813 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31816 static tree
31818 {
31831 }
31833 /* OpenACC 2.0:
31834 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31835 structured-block */
31837 #define OACC_PARALLEL_CLAUSE_MASK \
31838 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31839 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31840 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31841 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31842 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31843 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31844 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31845 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31846 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31847 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31848 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31849 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31850 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31851 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31852 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31853 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31856 static tree
31858 {
31871 }
31873 /* OpenACC 2.0:
31874 # pragma acc update oacc-update-clause[optseq] new-line
31875 */
31877 #define OACC_UPDATE_CLAUSE_MASK \
31878 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31879 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31880 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31881 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31882 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31883 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31885 static tree
31887 {
31894 {
31896 "%<#pragma acc update%> must contain at least one "
31899 }
31907 }
31909 /* OpenACC 2.0:
31910 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31912 LOC is the location of the #pragma token.
31913 */
31915 #define OACC_WAIT_CLAUSE_MASK \
31916 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31918 static tree
31920 {
31933 }
31935 /* OpenMP 4.0:
31936 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31938 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31939 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31940 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31941 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31942 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31943 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31944 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31946 static void
31949 {
31951 cp_omp_declare_simd_data data;
31953 {
31958 }
31969 {
31973 {
31986 }
31991 "%<#pragma omp declare simd%> not immediately followed by "
31995 }
31996 }
31998 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31999 This function is modelled similar to the late parsing of omp declare
32000 simd. */
32002 static tree
32004 {
32010 {
32016 }
32018 {
32022 }
32027 {
32034 NULL);
32048 }
32053 }
32055 /* Finalize #pragma omp declare simd clauses after direct declarator has
32056 been parsed, and put that into "omp declare simd" attribute. */
32058 static tree
32060 {
32066 {
32071 }
32076 {
32094 }
32098 }
32101 /* OpenMP 4.0:
32102 # pragma omp declare target new-line
32103 declarations and definitions
32104 # pragma omp end declare target new-line */
32106 static void
32108 {
32111 }
32113 static void
32115 {
32118 {
32121 }
32123 {
32127 {
32130 }
32133 else
32134 {
32138 }
32139 }
32140 else
32141 {
32145 }
32149 "%<#pragma omp end declare target%> without corresponding "
32151 else
32153 }
32155 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
32156 expression and optional initializer clause of
32157 #pragma omp declare reduction. We store the expression(s) as
32158 either 3, 6 or 7 special statements inside of the artificial function's
32159 body. The first two statements are DECL_EXPRs for the artificial
32160 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32161 expression that uses those variables.
32162 If there was any INITIALIZER clause, this is followed by further statements,
32163 the fourth and fifth statements are DECL_EXPRs for the artificial
32164 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32165 constructor variant (first token after open paren is not omp_priv),
32166 then the sixth statement is a statement with the function call expression
32167 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32168 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32169 to initialize the OMP_PRIV artificial variable and there is seventh
32170 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32172 static bool
32174 {
32186 tree combiner;
32201 {
32204 }
32207 {
32214 {
32217 }
32233 {
32237 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32241 == CPP_CLOSE_PAREN
32244 {
32248 }
32253 }
32254 else
32255 {
32271 {
32276 }
32278 tree arg;
32291 }
32302 }
32308 }
32310 /* OpenMP 4.0
32311 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32312 initializer-clause[opt] new-line
32314 initializer-clause:
32315 initializer (omp_priv initializer)
32316 initializer (function-name (argument-list)) */
32318 static void
32321 {
32331 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32338 {
32370 }
32382 /* Types may not be defined in declare reduction type list. */
32385 parser->type_definition_forbidden_message
32391 saved_colon_doesnt_start_class_def_p
32396 {
32400 ;
32421 else
32426 else
32428 }
32430 /* Restore the saved message. */
32433 parser->colon_doesnt_start_class_def_p
32438 {
32439 fail:
32442 }
32448 {
32449 tree fntype
32452 NULL_TREE);
32471 {
32476 }
32478 {
32480 {
32489 }
32496 }
32497 else
32498 {
32501 }
32504 else
32507 {
32510 }
32512 {
32515 else
32520 }
32525 else
32526 {
32535 }
32542 }
32546 done:
32547 /* Free any declarators allocated. */
32549 }
32551 /* OpenMP 4.0
32552 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32553 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32554 initializer-clause[opt] new-line
32555 #pragma omp declare target new-line */
32557 static void
32560 {
32562 {
32567 {
32570 context);
32572 }
32575 {
32578 context);
32580 }
32582 {
32585 }
32587 {
32591 }
32592 }
32596 }
32598 /* Main entry point to OpenMP statement pragmas. */
32600 static void
32602 {
32603 tree stmt;
32608 {
32683 }
32687 }
32688 \f
32689 /* Transactional Memory parsing routines. */
32691 /* Parse a transaction attribute.
32693 txn-attribute:
32694 attribute
32695 [ [ identifier ] ]
32697 ??? Simplify this when C++0x bracket attributes are
32698 implemented properly. */
32700 static tree
32702 {
32717 {
32721 /* For keywords, use the canonical spelling,
32722 not the parsed identifier. */
32726 }
32727 else
32731 error1:
32734 }
32736 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32738 transaction-statement:
32739 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32740 compound-statement
32741 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32742 */
32744 static tree
32746 {
32761 else
32762 {
32766 }
32768 /* Parse a noexcept specification. */
32771 /* Keep track if we're in the lexical scope of an outer transaction. */
32783 }
32785 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32787 transaction-expression:
32788 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32789 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32790 */
32792 static tree
32794 {
32819 /* Set this early. This might mean that we allow transaction_cancel in
32820 an expression that we find out later actually has to be a constexpr.
32821 However, we expect that cxx_constant_value will be able to deal with
32822 this; also, if the noexcept has no constexpr, then what we parse next
32823 really is a transaction's body. */
32826 /* Parse a noexcept specification. */
32832 {
32839 }
32840 else
32841 {
32842 /* The only expression that is available got parsed for the noexcept
32843 already. noexcept is true then. */
32846 }
32855 }
32857 /* Parse a function-transaction-block.
32859 function-transaction-block:
32860 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32861 function-body
32862 __transaction_atomic txn-attribute[opt] function-try-block
32863 __transaction_relaxed ctor-initializer[opt] function-body
32864 __transaction_relaxed function-try-block
32865 */
32867 static bool
32869 {
32885 else
32886 {
32890 }
32898 else
32899 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32907 }
32909 /* Parse a __transaction_cancel statement.
32911 cancel-statement:
32912 __transaction_cancel txn-attribute[opt] ;
32913 __transaction_cancel txn-attribute[opt] throw-expression ;
32915 ??? Cancel and throw is not yet implemented. */
32917 static tree
32919 {
32925 RT_TRANSACTION_CANCEL);
32932 /* ??? Parse cancel-and-throw here. */
32937 {
32941 }
32943 {
32947 }
32949 {
32952 {
32958 }
32959 }
32961 {
32965 }
32971 }
32972 \f
32973 /* The parser. */
32977 \f
32978 /* Special handling for the first token or line in the file. The first
32979 thing in the file might be #pragma GCC pch_preprocess, which loads a
32980 PCH file, which is a GC collection point. So we need to handle this
32981 first pragma without benefit of an existing lexer structure.
32983 Always returns one token to the caller in *FIRST_TOKEN. This is
32984 either the true first token of the file, or the first token after
32985 the initial pragma. */
32987 static void
32989 {
32998 {
33005 }
33006 else
33009 /* Skip to the end of the pragma. */
33013 /* Now actually load the PCH file. */
33017 /* Read one more token to return to our caller. We have to do this
33018 after reading the PCH file in, since its pointers have to be
33019 live. */
33021 }
33023 /* Parses the grainsize pragma for the _Cilk_for statement.
33024 Syntax:
33025 #pragma cilk grainsize = <VALUE>. */
33027 static void
33029 {
33031 {
33036 {
33039 }
33041 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
33044 else
33046 "%<#pragma cilk grainsize%> is not followed by "
33049 }
33051 }
33053 /* Normal parsing of a pragma token. Here we can (and must) use the
33054 regular lexer. */
33056 static bool
33058 {
33070 {
33078 {
33088 }
33093 {
33103 }
33108 {
33114 "%<#pragma omp taskwait%> may only be "
33119 }
33124 {
33130 "%<#pragma omp taskyield%> may only be "
33135 }
33140 {
33146 "%<#pragma omp cancel%> may only be "
33151 }
33156 {
33162 "%<#pragma omp cancellation point%> may only be "
33167 }
33214 "%<#pragma omp section%> may only be used in "
33219 {
33221 {
33225 }
33232 {
33235 }
33238 }
33242 {
33246 }
33252 {
33256 }
33258 /* Ignore the pragma if Cilk Plus is not enabled. */
33260 {
33263 }
33264 else
33265 {
33269 }
33276 bad_stmt:
33279 }
33283 }
33285 /* The interface the pragma parsers have to the lexer. */
33287 enum cpp_ttype
33289 {
33302 else
33303 {
33307 }
33310 }
33312 \f
33313 /* External interface. */
33315 /* Parse one entire translation unit. */
33317 void
33319 {
33332 }
33334 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33335 vectorlength clause:
33336 Syntax:
33337 vectorlength ( constant-expression ) */
33339 static tree
33342 {
33344 tree expr;
33345 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33346 safelen clause. Thus, vectorlength is represented as OMP 4.0
33347 safelen. For SIMD-enabled function it is represented by OMP 4.0
33348 simdlen. */
33351 loc);
33352 else
33354 loc);
33362 /* If expr == error_mark_node, then don't emit any errors nor
33363 create a clause. if any of the above functions returns
33364 error mark node then they would have emitted an error message. */
33366 ;
33374 else
33375 {
33376 tree c;
33378 {
33383 }
33384 else
33385 {
33390 }
33391 }
33396 }
33398 /* Handles the Cilk Plus #pragma simd linear clause.
33399 Syntax:
33400 linear ( simd-linear-variable-list )
33402 simd-linear-variable-list:
33403 simd-linear-variable
33404 simd-linear-variable-list , simd-linear-variable
33406 simd-linear-variable:
33407 id-expression
33408 id-expression : simd-linear-step
33410 simd-linear-step:
33411 conditional-expression */
33413 static tree
33415 {
33421 {
33425 }
33430 {
33433 {
33437 }
33444 {
33448 }
33449 else
33450 {
33454 /* If present, parse the linear step. Otherwise, assume the default
33455 value of 1. */
33457 {
33464 {
33465 /* If an error has occurred, then the whole pragma is
33466 considered ill-formed. Thus, no reason to keep
33467 parsing. */
33470 }
33478 else
33480 "step size must be an integer constant "
33482 }
33484 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33490 }
33495 else
33496 {
33501 }
33502 }
33506 }
33508 /* Returns the name of the next clause. If the clause is not
33509 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33510 token is not consumed. Otherwise, the appropriate enum from the
33511 pragma_simd_clause is returned and the token is consumed. */
33513 static pragma_omp_clause
33515 {
33516 pragma_omp_clause clause_type;
33533 else
33538 }
33540 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33542 static tree
33544 {
33549 {
33550 pragma_omp_clause c_kind;
33557 /* Use the OpenMP 4.0 equivalent function. */
33560 /* Use the OpenMP 4.0 equivalent function. */
33562 clauses);
33564 /* Use the OMP 4.0 equivalent function. */
33566 clauses);
33568 /* Use the OMP 4.0 equivalent function. */
33570 else
33571 {
33575 }
33576 }
33582 else
33584 }
33586 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33588 static void
33590 {
33597 {
33601 }
33610 }
33612 /* Main entry-point for parsing Cilk Plus _Cilk_for
33613 loops. The return value is error_mark_node
33614 when errors happen and CILK_FOR tree on success. */
33616 static tree
33618 {
33633 else
33639 }
33641 /* Create an identifier for a generic parameter type (a synthesized
33642 template parameter implied by `auto' or a concept identifier). */
33645 static tree
33647 {
33651 }
33653 /* Predicate that behaves as is_auto_or_concept but matches the parent
33654 node of the generic type rather than the generic type itself. This
33655 allows for type transformation in add_implicit_template_parms. */
33659 {
33661 }
33663 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33664 (creating a new template parameter list if necessary). Returns the newly
33665 created template type parm. */
33667 tree
33669 {
33672 /* We are either continuing a function template that already contains implicit
33673 template parameters, creating a new fully-implicit function template, or
33674 extending an existing explicit function template with implicit template
33675 parameters. */
33683 {
33687 }
33688 else
33689 {
33690 /* Roll back to the existing template parameter scope (in the case of
33691 extending an explicit function template) or introduce a new template
33692 parameter scope ahead of the function parameter scope (or class scope
33693 in the case of out-of-line member definitions). The function scope is
33694 added back after template parameter synthesis below. */
33699 {
33702 }
33704 {
33705 /* If not defining a class, then any class scope is a scope level in
33706 an out-of-line member definition. In this case simply wind back
33707 beyond the first such scope to inject the template parameter list.
33708 Otherwise wind back to the class being defined. The latter can
33709 occur in class member friend declarations such as:
33711 class A {
33712 void foo (auto);
33713 };
33714 class B {
33715 friend void A::foo (auto);
33716 };
33718 The template parameter list synthesized for the friend declaration
33719 must be injected in the scope of 'B'. This can also occur in
33720 erroneous cases such as:
33722 struct A {
33723 struct B {
33724 void foo (auto);
33725 };
33726 void B::foo (auto) {}
33727 };
33729 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33730 but, nevertheless, the template parameter list synthesized for the
33731 declarator should be injected into the scope of 'A' as if the
33732 ill-formed template was specified explicitly. */
33735 {
33738 }
33739 }
33745 {
33746 /* Introduce a new template parameter list for implicit template
33747 parameters. */
33751 parser->implicit_template_scope
33758 }
33759 else
33760 {
33761 /* Synthesize implicit template parameters at the end of the explicit
33762 template parameter list. */
33769 parser->implicit_template_parms
33771 }
33772 }
33774 /* Synthesize a new template parameter and track the current template
33775 parameter chain with implicit_template_parms. */
33779 synth_id);
33780 tree new_parm
33782 input_location,
33789 parser->implicit_template_parms
33791 else
33796 /* If creating a fully implicit function template, start the new implicit
33797 template parameter list with this synthesized type, otherwise grow the
33798 current template parameter list. */
33801 {
33808 }
33809 else
33810 {
33815 }
33820 }
33822 /* Finish the declaration of a fully implicit function template. Such a
33823 template has no explicit template parameter list so has not been through the
33824 normal template head and tail processing. synthesize_implicit_template_parm
33825 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33826 provided if the declaration is a class member such that its template
33827 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33828 form is returned. Otherwise NULL_TREE is returned. */
33830 tree
33832 {
33837 {
33841 }
33851 }