| blob | 35191a1cabc5889f31173fea832128ea2fba58ab |
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 }
6577 /* Look for the closing `]'. */
6580 /* Build the ARRAY_REF. */
6584 /* When not doing offsetof, array references are not permitted in
6585 constant-expressions. */
6591 }
6593 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6594 by cp_parser_builtin_offsetof. We're looking for
6596 postfix-expression . template [opt] id-expression
6597 postfix-expression . pseudo-destructor-name
6598 postfix-expression -> template [opt] id-expression
6599 postfix-expression -> pseudo-destructor-name
6601 FOR_OFFSETOF is set if we're being called in that context. That sorta
6602 limits what of the above we'll actually accept, but nevermind.
6603 TOKEN_TYPE is the "." or "->" token, which will already have been
6604 removed from the stream. */
6606 static tree
6609 tree postfix_expression,
6611 location_t location)
6612 {
6613 tree name;
6618 /* If this is a `->' operator, dereference the pointer. */
6621 tf_warning_or_error);
6622 /* Check to see whether or not the expression is type-dependent. */
6624 /* The identifier following the `->' or `.' is not qualified. */
6630 /* Enter the scope corresponding to the type of the object
6631 given by the POSTFIX_EXPRESSION. */
6633 {
6635 /* According to the standard, no expression should ever have
6636 reference type. Unfortunately, we do not currently match
6637 the standard in this respect in that our internal representation
6638 of an expression may have reference type even when the standard
6639 says it does not. Therefore, we have to manually obtain the
6640 underlying type here. */
6642 /* The type of the POSTFIX_EXPRESSION must be complete. */
6644 {
6646 postfix_expression);
6648 }
6649 /* Unlike the object expression in other contexts, *this is not
6650 required to be of complete type for purposes of class member
6651 access (5.2.5) outside the member function body. */
6655 /* Let the name lookup machinery know that we are processing a
6656 class member access expression. */
6658 /* If something went wrong, we want to be able to discern that case,
6659 as opposed to the case where there was no SCOPE due to the type
6660 of expression being dependent. */
6663 /* If the SCOPE was erroneous, make the various semantic analysis
6664 functions exit quickly -- and without issuing additional error
6665 messages. */
6668 }
6670 /* Assume this expression is not a pseudo-destructor access. */
6673 /* If the SCOPE is a scalar type, then, if this is a valid program,
6674 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6675 is type dependent, it can be pseudo-destructor-name or something else.
6676 Try to parse it as pseudo-destructor-name first. */
6678 {
6679 tree s;
6680 tree type;
6683 /* Parse the pseudo-destructor-name. */
6692 {
6694 postfix_expression
6697 }
6698 }
6701 {
6702 /* If the SCOPE is not a scalar type, we are looking at an
6703 ordinary class member access expression, rather than a
6704 pseudo-destructor-name. */
6707 /* Parse the id-expression. */
6708 name = (cp_parser_id_expression
6715 /* In general, build a SCOPE_REF if the member name is qualified.
6716 However, if the name was not dependent and has already been
6717 resolved; there is no need to build the SCOPE_REF. For example;
6719 struct X { void f(); };
6720 template <typename T> void f(T* t) { t->X::f(); }
6722 Even though "t" is dependent, "X::f" is not and has been resolved
6723 to a BASELINK; there is no need to include scope information. */
6725 /* But we do need to remember that there was an explicit scope for
6726 virtual function calls. */
6730 /* If the name is a template-id that names a type, we will get a
6731 TYPE_DECL here. That is invalid code. */
6733 {
6736 }
6737 else
6738 {
6740 {
6742 {
6746 }
6747 else
6750 name,
6751 template_p);
6755 }
6757 adjust_result_of_qualified_name_lookup
6759 postfix_expression
6761 template_p,
6762 tf_warning_or_error);
6763 }
6764 }
6766 /* We no longer need to look up names in the scope of the object on
6767 the left-hand side of the `.' or `->' operator. */
6770 /* Outside of offsetof, these operators may not appear in
6771 constant-expressions. */
6773 && (cp_parser_non_integral_constant_expression
6778 }
6780 /* Cache of LITERAL_ZERO_P constants. */
6784 /* Parse a parenthesized expression-list.
6786 expression-list:
6787 assignment-expression
6788 expression-list, assignment-expression
6790 attribute-list:
6791 expression-list
6792 identifier
6793 identifier, expression-list
6795 CAST_P is true if this expression is the target of a cast.
6797 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6798 argument pack.
6800 Returns a vector of trees. Each element is a representation of an
6801 assignment-expression. NULL is returned if the ( and or ) are
6802 missing. An empty, but allocated, vector is returned on no
6803 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6804 if we are parsing an attribute list for an attribute that wants a
6805 plain identifier argument, normal_attr for an attribute that wants
6806 an expression, or non_attr if we aren't parsing an attribute list. If
6807 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6808 not all of the expressions in the list were constant.
6809 WANT_LITERAL_ZERO_P is true if the caller is interested in
6810 LITERAL_ZERO_P INTEGER_CSTs. FIXME: once we don't fold everything
6811 immediately, this can be removed. */
6820 {
6826 /* Assume all the expressions will be constant. */
6835 /* Within a parenthesized expression, a `>' token is always
6836 the greater-than operator. */
6837 saved_greater_than_is_operator_p
6841 /* Consume expressions until there are no more. */
6844 {
6845 tree expr;
6847 /* At the beginning of attribute lists, check to see if the
6848 next token is an identifier. */
6851 {
6854 /* Consume the identifier. */
6856 /* Save the identifier. */
6858 }
6859 else
6860 {
6863 /* Parse the next assignment-expression. */
6865 {
6866 /* A braced-init-list. */
6872 }
6874 {
6875 expr = (cp_parser_constant_expression
6880 }
6881 else
6882 {
6886 {
6893 /* If a parameter is literal zero alone, remember it
6894 for -Wmemset-transposed-args warning. */
6897 && want_literal_zero_p
6899 == CPP_COMMA
6902 {
6909 else
6910 {
6915 }
6916 /* Consume the 0 token (or '\0', 0LL etc.). */
6918 }
6922 }
6925 cast_p);
6926 }
6931 /* If we have an ellipsis, then this is an expression
6932 expansion. */
6935 {
6936 /* Consume the `...'. */
6939 /* Build the argument pack. */
6941 }
6943 /* Add it to the list. We add error_mark_node
6944 expressions to the list, so that we can still tell if
6945 the correct form for a parenthesized expression-list
6946 is found. That gives better errors. */
6951 }
6953 /* After the first item, attribute lists look the same as
6954 expression lists. */
6957 get_comma:;
6958 /* If the next token isn't a `,', then we are done. */
6962 /* Otherwise, consume the `,' and keep going. */
6964 }
6967 {
6970 skip_comma:;
6971 /* We try and resync to an unnested comma, as that will give the
6972 user better diagnostics. */
6980 {
6981 parser->greater_than_is_operator_p
6984 }
6985 }
6987 parser->greater_than_is_operator_p
6994 }
6996 /* Parse a pseudo-destructor-name.
6998 pseudo-destructor-name:
6999 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
7000 :: [opt] nested-name-specifier template template-id :: ~ type-name
7001 :: [opt] nested-name-specifier [opt] ~ type-name
7003 If either of the first two productions is used, sets *SCOPE to the
7004 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
7005 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
7006 or ERROR_MARK_NODE if the parse fails. */
7008 static void
7010 tree object,
7013 {
7016 /* Handle ~auto. */
7020 {
7023 "%<~auto%> only available with "
7030 }
7032 /* Assume that things will not work out. */
7035 /* Look for the optional `::' operator. */
7037 /* Look for the optional nested-name-specifier. */
7038 nested_name_specifier_p
7045 /* Now, if we saw a nested-name-specifier, we might be doing the
7046 second production. */
7049 {
7050 /* Consume the `template' keyword. */
7052 /* Parse the template-id. */
7056 class_type,
7058 /* Look for the `::' token. */
7060 }
7061 /* If the next token is not a `~', then there might be some
7062 additional qualification. */
7064 {
7065 /* At this point, we're looking for "type-name :: ~". The type-name
7066 must not be a class-name, since this is a pseudo-destructor. So,
7067 it must be either an enum-name, or a typedef-name -- both of which
7068 are just identifiers. So, we peek ahead to check that the "::"
7069 and "~" tokens are present; if they are not, then we can avoid
7070 calling type_name. */
7074 {
7077 }
7079 /* Look for the type-name. */
7084 /* Look for the `::' token. */
7086 }
7087 else
7090 /* Look for the `~'. */
7093 /* Once we see the ~, this has to be a pseudo-destructor. */
7097 /* Look for the type-name again. We are not responsible for
7098 checking that it matches the first type-name. */
7100 }
7102 /* Parse a unary-expression.
7104 unary-expression:
7105 postfix-expression
7106 ++ cast-expression
7107 -- cast-expression
7108 unary-operator cast-expression
7109 sizeof unary-expression
7110 sizeof ( type-id )
7111 alignof ( type-id ) [C++0x]
7112 new-expression
7113 delete-expression
7115 GNU Extensions:
7117 unary-expression:
7118 __extension__ cast-expression
7119 __alignof__ unary-expression
7120 __alignof__ ( type-id )
7121 alignof unary-expression [C++0x]
7122 __real__ cast-expression
7123 __imag__ cast-expression
7124 && identifier
7125 sizeof ( type-id ) { initializer-list , [opt] }
7126 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
7127 __alignof__ ( type-id ) { initializer-list , [opt] }
7129 ADDRESS_P is true iff the unary-expression is appearing as the
7130 operand of the `&' operator. CAST_P is true if this expression is
7131 the target of a cast.
7133 Returns a representation of the expression. */
7135 static tree
7138 {
7142 /* Peek at the next token. */
7144 /* Some keywords give away the kind of expression. */
7146 {
7150 {
7153 {
7156 location_t first_loc;
7159 /* Consume the token. */
7162 /* Parse the operand. */
7167 else
7168 {
7169 /* ISO C++ defines alignof only with types, not with
7170 expressions. So pedwarn if alignof is used with a non-
7171 type expression. However, __alignof__ is ok. */
7174 "ISO C++ does not allow %<alignof%> "
7178 }
7179 /* For SIZEOF_EXPR, just issue diagnostics, but keep
7180 SIZEOF_EXPR with the original operand. */
7182 {
7184 {
7186 {
7189 error_mark_node));
7191 }
7192 else
7196 }
7198 }
7200 }
7209 {
7210 /* The saved value of the PEDANTIC flag. */
7212 tree expr;
7214 /* Save away the PEDANTIC flag. */
7216 /* Parse the cast-expression. */
7218 /* Restore the PEDANTIC flag. */
7222 }
7226 {
7227 tree expression;
7229 /* Consume the `__real__' or `__imag__' token. */
7231 /* Parse the cast-expression. */
7233 /* Create the complete representation. */
7237 expression,
7238 tf_warning_or_error);
7239 }
7247 {
7248 tree expr;
7258 parser->type_definition_forbidden_message
7261 saved_integral_constant_expression_p
7263 saved_non_integral_constant_expression_p
7267 saved_greater_than_is_operator_p
7279 parser->greater_than_is_operator_p
7282 parser->integral_constant_expression_p
7284 parser->non_integral_constant_expression_p
7291 }
7295 }
7296 }
7298 /* Look for the `:: new' and `:: delete', which also signal the
7299 beginning of a new-expression, or delete-expression,
7300 respectively. If the next token is `::', then it might be one of
7301 these. */
7303 {
7306 /* See if the token after the `::' is one of the keywords in
7307 which we're interested. */
7309 /* If it's `new', we have a new-expression. */
7312 /* Similarly, for `delete'. */
7315 }
7317 /* Look for a unary operator. */
7319 /* The `++' and `--' operators can be handled similarly, even though
7320 they are not technically unary-operators in the grammar. */
7322 {
7327 /* Handle the GNU address-of-label extension. */
7330 {
7331 tree identifier;
7332 tree expression;
7335 /* Consume the '&&' token. */
7337 /* Look for the identifier. */
7339 /* Create an expression representing the address. */
7342 NIC_ADDR_LABEL))
7345 }
7346 }
7348 {
7349 tree cast_expression;
7355 /* Consume the operator token. */
7357 /* Parse the cast-expression. */
7358 cast_expression
7363 pidk);
7364 /* Now, build an appropriate representation. */
7366 {
7370 RO_UNARY_STAR,
7371 complain);
7376 /* Fall through. */
7379 cast_expression,
7380 complain);
7387 /* Fall through. */
7397 }
7401 non_constant_p))
7405 }
7409 decltype_p,
7410 pidk);
7411 }
7413 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7414 unary-operator, the corresponding tree code is returned. */
7416 static enum tree_code
7418 {
7420 {
7441 }
7442 }
7444 /* Parse a new-expression.
7446 new-expression:
7447 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7448 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7450 Returns a representation of the expression. */
7452 static tree
7454 {
7457 tree type;
7460 tree ret;
7462 /* Look for the optional `::' operator. */
7463 global_scope_p
7467 /* Look for the `new' operator. */
7469 /* There's no easy way to tell a new-placement from the
7470 `( type-id )' construct. */
7472 /* Look for a new-placement. */
7474 /* If that didn't work out, there's no new-placement. */
7476 {
7480 }
7482 /* If the next token is a `(', then we have a parenthesized
7483 type-id. */
7485 {
7489 /* Consume the `('. */
7492 /* Parse the type-id. */
7493 parser->type_definition_forbidden_message
7498 /* Look for the closing `)'. */
7501 /* There should not be a direct-new-declarator in this production,
7502 but GCC used to allowed this, so we check and emit a sensible error
7503 message for this case. */
7505 {
7511 }
7512 }
7513 /* Otherwise, there must be a new-type-id. */
7514 else
7517 /* If the next token is a `(' or '{', then we have a new-initializer. */
7521 else
7524 /* A new-expression may not appear in an integral constant
7525 expression. */
7528 else
7529 {
7530 /* Create a representation of the new-expression. */
7532 tf_warning_or_error);
7533 }
7541 }
7543 /* Parse a new-placement.
7545 new-placement:
7546 ( expression-list )
7548 Returns the same representation as for an expression-list. */
7552 {
7555 /* Parse the expression-list. */
7556 expression_list = (cp_parser_parenthesized_expression_list
7565 }
7567 /* Parse a new-type-id.
7569 new-type-id:
7570 type-specifier-seq new-declarator [opt]
7572 Returns the TYPE allocated. If the new-type-id indicates an array
7573 type, *NELTS is set to the number of elements in the last array
7574 bound; the TYPE will not include the last array bound. */
7576 static tree
7578 {
7579 cp_decl_specifier_seq type_specifier_seq;
7585 /* The type-specifier sequence must not contain type definitions.
7586 (It cannot contain declarations of new types either, but if they
7587 are not definitions we will catch that because they are not
7588 complete.) */
7590 parser->type_definition_forbidden_message
7592 /* Parse the type-specifier-seq. */
7596 /* Restore the old message. */
7602 /* Parse the new-declarator. */
7605 /* Determine the number of elements in the last array dimension, if
7606 any. */
7608 /* Skip down to the last array dimension. */
7613 {
7616 }
7621 {
7624 }
7627 {
7634 else
7636 }
7639 }
7641 /* Parse an (optional) new-declarator.
7643 new-declarator:
7644 ptr-operator new-declarator [opt]
7645 direct-new-declarator
7647 Returns the declarator. */
7651 {
7654 cp_cv_quals cv_quals;
7656 /* We don't know if there's a ptr-operator next, or not. */
7658 /* Look for a ptr-operator. */
7660 /* If that worked, look for more new-declarators. */
7662 {
7665 /* Parse another optional declarator. */
7668 declarator = cp_parser_make_indirect_declarator
7672 }
7674 /* If the next token is a `[', there is a direct-new-declarator. */
7679 }
7681 /* Parse a direct-new-declarator.
7683 direct-new-declarator:
7684 [ expression ]
7685 direct-new-declarator [constant-expression]
7687 */
7691 {
7695 {
7696 tree expression;
7699 /* Look for the opening `['. */
7704 /* The standard requires that the expression have integral
7705 type. DR 74 adds enumeration types. We believe that the
7706 real intent is that these expressions be handled like the
7707 expression in a `switch' condition, which also allows
7708 classes with a single conversion to integral or
7709 enumeration type. */
7711 {
7712 expression
7714 expression,
7717 {
7719 "expression in new-declarator must have integral "
7722 }
7723 }
7725 /* Look for the closing `]'. */
7728 /* Add this bound to the declarator. */
7731 /* If the next token is not a `[', then there are no more
7732 bounds. */
7735 }
7738 }
7740 /* Parse a new-initializer.
7742 new-initializer:
7743 ( expression-list [opt] )
7744 braced-init-list
7746 Returns a representation of the expression-list. */
7750 {
7754 {
7755 tree t;
7762 }
7763 else
7764 expression_list = (cp_parser_parenthesized_expression_list
7770 }
7772 /* Parse a delete-expression.
7774 delete-expression:
7775 :: [opt] delete cast-expression
7776 :: [opt] delete [ ] cast-expression
7778 Returns a representation of the expression. */
7780 static tree
7782 {
7785 tree expression;
7787 /* Look for the optional `::' operator. */
7788 global_scope_p
7792 /* Look for the `delete' keyword. */
7794 /* See if the array syntax is in use. */
7796 {
7797 /* Consume the `[' token. */
7799 /* Look for the `]' token. */
7801 /* Remember that this is the `[]' construct. */
7803 }
7804 else
7807 /* Parse the cast-expression. */
7810 /* A delete-expression may not appear in an integral constant
7811 expression. */
7816 tf_warning_or_error);
7817 }
7819 /* Returns 1 if TOKEN may start a cast-expression and isn't '++', '--',
7820 neither '[' in C++11; -1 if TOKEN is '++', '--', or '[' in C++11;
7821 0 otherwise. */
7823 static int
7825 {
7828 {
7870 /* In ((type ()) () the last () isn't a valid cast-expression,
7871 so the whole must be parsed as postfix-expression. */
7876 /* '[' may start a primary-expression in obj-c++ and in C++11,
7877 as a lambda-expression, eg, '(void)[]{}'. */
7884 /* '++' and '--' may or may not start a cast-expression:
7886 struct T { void operator++(int); };
7887 void f() { (T())++; }
7889 vs
7891 int a;
7892 (int)++a; */
7897 }
7898 }
7900 /* Parse a cast-expression.
7902 cast-expression:
7903 unary-expression
7904 ( type-id ) cast-expression
7906 ADDRESS_P is true iff the unary-expression is appearing as the
7907 operand of the `&' operator. CAST_P is true if this expression is
7908 the target of a cast.
7910 Returns a representation of the expression. */
7912 static tree
7915 {
7916 /* If it's a `(', then we might be looking at a cast. */
7918 {
7924 /* There's no way to know yet whether or not this is a cast.
7925 For example, `(int (3))' is a unary-expression, while `(int)
7926 3' is a cast. So, we resort to parsing tentatively. */
7928 /* Types may not be defined in a cast. */
7930 parser->type_definition_forbidden_message
7932 /* Consume the `('. */
7934 /* A very tricky bit is that `(struct S) { 3 }' is a
7935 compound-literal (which we permit in C++ as an extension).
7936 But, that construct is not a cast-expression -- it is a
7937 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7938 is legal; if the compound-literal were a cast-expression,
7939 you'd need an extra set of parentheses.) But, if we parse
7940 the type-id, and it happens to be a class-specifier, then we
7941 will commit to the parse at that point, because we cannot
7942 undo the action that is done when creating a new class. So,
7943 then we cannot back up and do a postfix-expression.
7945 Another tricky case is the following (c++/29234):
7947 struct S { void operator () (); };
7949 void foo ()
7950 {
7951 ( S()() );
7952 }
7954 As a type-id we parse the parenthesized S()() as a function
7955 returning a function, groktypename complains and we cannot
7956 back up in this case either.
7958 Therefore, we scan ahead to the closing `)', and check to see
7959 if the tokens after the `)' can start a cast-expression. Otherwise
7960 we are dealing with an unary-expression, a postfix-expression
7961 or something else.
7963 Yet another tricky case, in C++11, is the following (c++/54891):
7965 (void)[]{};
7967 The issue is that usually, besides the case of lambda-expressions,
7968 the parenthesized type-id cannot be followed by '[', and, eg, we
7969 want to parse '(C ())[2];' in parse/pr26997.C as unary-expression.
7970 Thus, if cp_parser_tokens_start_cast_expression returns -1, below
7971 we don't commit, we try a cast-expression, then an unary-expression.
7973 Save tokens so that we can put them back. */
7976 /* We may be looking at a cast-expression. */
7979 cast_expression
7982 /* Roll back the tokens we skipped. */
7984 /* If we aren't looking at a cast-expression, simulate an error so
7985 that the call to cp_parser_error_occurred below returns true. */
7988 else
7989 {
7992 /* Look for the type-id. */
7994 /* Look for the closing `)'. */
7997 }
7999 /* Restore the saved message. */
8002 /* At this point this can only be either a cast or a
8003 parenthesized ctor such as `(T ())' that looks like a cast to
8004 function returning T. */
8006 {
8007 /* Only commit if the cast-expression doesn't start with
8008 '++', '--', or '[' in C++11. */
8016 pidk);
8019 {
8020 /* Warn about old-style casts, if so requested. */
8027 /* Only type conversions to integral or enumeration types
8028 can be used in constant-expressions. */
8031 NIC_CAST))
8034 /* Perform the cast. */
8037 }
8038 }
8039 else
8041 }
8043 /* If we get here, then it's not a cast, so it must be a
8044 unary-expression. */
8047 }
8049 /* Parse a binary expression of the general form:
8051 pm-expression:
8052 cast-expression
8053 pm-expression .* cast-expression
8054 pm-expression ->* cast-expression
8056 multiplicative-expression:
8057 pm-expression
8058 multiplicative-expression * pm-expression
8059 multiplicative-expression / pm-expression
8060 multiplicative-expression % pm-expression
8062 additive-expression:
8063 multiplicative-expression
8064 additive-expression + multiplicative-expression
8065 additive-expression - multiplicative-expression
8067 shift-expression:
8068 additive-expression
8069 shift-expression << additive-expression
8070 shift-expression >> additive-expression
8072 relational-expression:
8073 shift-expression
8074 relational-expression < shift-expression
8075 relational-expression > shift-expression
8076 relational-expression <= shift-expression
8077 relational-expression >= shift-expression
8079 GNU Extension:
8081 relational-expression:
8082 relational-expression <? shift-expression
8083 relational-expression >? shift-expression
8085 equality-expression:
8086 relational-expression
8087 equality-expression == relational-expression
8088 equality-expression != relational-expression
8090 and-expression:
8091 equality-expression
8092 and-expression & equality-expression
8094 exclusive-or-expression:
8095 and-expression
8096 exclusive-or-expression ^ and-expression
8098 inclusive-or-expression:
8099 exclusive-or-expression
8100 inclusive-or-expression | exclusive-or-expression
8102 logical-and-expression:
8103 inclusive-or-expression
8104 logical-and-expression && inclusive-or-expression
8106 logical-or-expression:
8107 logical-and-expression
8108 logical-or-expression || logical-and-expression
8110 All these are implemented with a single function like:
8112 binary-expression:
8113 simple-cast-expression
8114 binary-expression <token> binary-expression
8116 CAST_P is true if this expression is the target of a cast.
8118 The binops_by_token map is used to get the tree codes for each <token> type.
8119 binary-expressions are associated according to a precedence table. */
8121 #define TOKEN_PRECEDENCE(token) \
8122 (((token->type == CPP_GREATER \
8123 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
8124 && !parser->greater_than_is_operator_p) \
8125 ? PREC_NOT_OPERATOR \
8126 : binops_by_token[token->type].prec)
8128 static tree
8134 {
8135 cp_parser_expression_stack stack;
8137 cp_parser_expression_stack_entry current;
8138 tree rhs;
8142 tree overload;
8144 /* Parse the first expression. */
8155 {
8156 /* Get an operator token. */
8162 {
8164 "%<>>%> operator is treated"
8168 }
8172 /* Popping an entry off the stack means we completed a subexpression:
8173 - either we found a token which is not an operator (`>' where it is not
8174 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
8175 will happen repeatedly;
8176 - or, we found an operator which has lower priority. This is the case
8177 where the recursive descent *ascends*, as in `3 * 4 + 5' after
8178 parsing `3 * 4'. */
8180 {
8183 else
8185 }
8187 get_rhs:
8191 /* We used the operator token. */
8194 /* For "false && x" or "true || x", x will never be executed;
8195 disable warnings while evaluating it. */
8201 /* Extract another operand. It may be the RHS of this expression
8202 or the LHS of a new, higher priority expression. */
8207 /* Get another operator token. Look up its precedence to avoid
8208 building a useless (immediately popped) stack entry for common
8209 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
8213 {
8214 /* ... and prepare to parse the RHS of the new, higher priority
8215 expression. Since precedence levels on the stack are
8216 monotonically increasing, we do not have to care about
8217 stack overflows. */
8226 pop:
8228 /* If the stack is not empty, we have parsed into LHS the right side
8229 (`4' in the example above) of an expression we had suspended.
8230 We can use the information on the stack to recover the LHS (`3')
8231 from the stack together with the tree code (`MULT_EXPR'), and
8232 the precedence of the higher level subexpression
8233 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
8234 which will be used to actually build the additive expression. */
8239 }
8241 /* Undo the disabling of warnings done above. */
8250 /* Avoid warning for !!x == y. */
8255 /* Avoid warning for !b == y where b is boolean. */
8259 /* Avoid warning for !!b == y where b is boolean. */
8267 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
8268 ERROR_MARK for everything that is not a binary expression.
8269 This makes warn_about_parentheses miss some warnings that
8270 involve unary operators. For unary expressions we should
8271 pass the correct tree_code unless the unary expression was
8272 surrounded by parentheses.
8273 */
8279 == tcc_comparison
8282 else
8291 /* If the binary operator required the use of an overloaded operator,
8292 then this expression cannot be an integral constant-expression.
8293 An overloaded operator can be used even if both operands are
8294 otherwise permissible in an integral constant-expression if at
8295 least one of the operands is of enumeration type. */
8299 NIC_OVERLOADED))
8301 }
8304 }
8306 static tree
8311 {
8314 }
8316 /* Parse the `? expression : assignment-expression' part of a
8317 conditional-expression. The LOGICAL_OR_EXPR is the
8318 logical-or-expression that started the conditional-expression.
8319 Returns a representation of the entire conditional-expression.
8321 This routine is used by cp_parser_assignment_expression.
8323 ? expression : assignment-expression
8325 GNU Extensions:
8327 ? : assignment-expression */
8329 static tree
8331 {
8332 tree expr;
8333 tree assignment_expr;
8337 /* Consume the `?' token. */
8342 {
8345 /* Implicit true clause. */
8349 }
8350 else
8351 {
8354 /* Parse the expression. */
8357 c_inhibit_evaluation_warnings +=
8361 }
8363 /* The next token should be a `:'. */
8365 /* Parse the assignment-expression. */
8369 /* Build the conditional-expression. */
8371 expr,
8372 assignment_expr,
8373 tf_warning_or_error);
8374 }
8376 /* Parse an assignment-expression.
8378 assignment-expression:
8379 conditional-expression
8380 logical-or-expression assignment-operator assignment_expression
8381 throw-expression
8383 CAST_P is true if this expression is the target of a cast.
8384 DECLTYPE_P is true if this expression is the operand of decltype.
8386 Returns a representation for the expression. */
8388 static tree
8391 {
8392 tree expr;
8394 /* If the next token is the `throw' keyword, then we're looking at
8395 a throw-expression. */
8398 /* Otherwise, it must be that we are looking at a
8399 logical-or-expression. */
8400 else
8401 {
8402 /* Parse the binary expressions (logical-or-expression). */
8404 decltype_p,
8406 /* If the next token is a `?' then we're actually looking at a
8407 conditional-expression. */
8410 else
8411 {
8414 /* If it's an assignment-operator, we're using the second
8415 production. */
8416 enum tree_code assignment_operator
8419 {
8421 location_t saved_input_location;
8423 /* Parse the right-hand side of the assignment. */
8429 /* An assignment may not appear in a
8430 constant-expression. */
8432 NIC_ASSIGNMENT))
8434 /* Build the assignment expression. Its default
8435 location is the location of the '=' token. */
8439 assignment_operator,
8440 rhs,
8443 }
8444 }
8445 }
8448 }
8450 /* Parse an (optional) assignment-operator.
8452 assignment-operator: one of
8453 = *= /= %= += -= >>= <<= &= ^= |=
8455 GNU Extension:
8457 assignment-operator: one of
8458 <?= >?=
8460 If the next token is an assignment operator, the corresponding tree
8461 code is returned, and the token is consumed. For example, for
8462 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8463 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8464 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8465 operator, ERROR_MARK is returned. */
8467 static enum tree_code
8469 {
8473 /* Peek at the next token. */
8477 {
8523 /* Nothing else is an assignment operator. */
8525 }
8527 /* If it was an assignment operator, consume it. */
8532 }
8534 /* Parse an expression.
8536 expression:
8537 assignment-expression
8538 expression , assignment-expression
8540 CAST_P is true if this expression is the target of a cast.
8541 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8542 except possibly parenthesized or on the RHS of a comma (N3276).
8544 Returns a representation of the expression. */
8546 static tree
8549 {
8554 {
8555 tree assignment_expression;
8557 /* Parse the next assignment-expression. */
8558 assignment_expression
8561 /* We don't create a temporary for a call that is the immediate operand
8562 of decltype or on the RHS of a comma. But when we see a comma, we
8563 need to create a temporary for a call on the LHS. */
8568 assignment_expression
8572 /* If this is the first assignment-expression, we can just
8573 save it away. */
8576 else
8578 assignment_expression,
8580 /* If the next token is not a comma, then we are done with the
8581 expression. */
8584 /* Consume the `,'. */
8587 /* A comma operator cannot appear in a constant-expression. */
8590 }
8593 }
8595 /* Parse a constant-expression.
8597 constant-expression:
8598 conditional-expression
8600 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8601 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8602 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8603 is false, NON_CONSTANT_P should be NULL. */
8605 static tree
8609 {
8613 tree expression;
8615 /* It might seem that we could simply parse the
8616 conditional-expression, and then check to see if it were
8617 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8618 one that the compiler can figure out is constant, possibly after
8619 doing some simplifications or optimizations. The standard has a
8620 precise definition of constant-expression, and we must honor
8621 that, even though it is somewhat more restrictive.
8623 For example:
8625 int i[(2, 3)];
8627 is not a legal declaration, because `(2, 3)' is not a
8628 constant-expression. The `,' operator is forbidden in a
8629 constant-expression. However, GCC's constant-folding machinery
8630 will fold this operation to an INTEGER_CST for `3'. */
8632 /* Save the old settings. */
8634 saved_allow_non_integral_constant_expression_p
8637 /* We are now parsing a constant-expression. */
8639 parser->allow_non_integral_constant_expression_p
8642 /* Although the grammar says "conditional-expression", we parse an
8643 "assignment-expression", which also permits "throw-expression"
8644 and the use of assignment operators. In the case that
8645 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8646 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8647 actually essential that we look for an assignment-expression.
8648 For example, cp_parser_initializer_clauses uses this function to
8649 determine whether a particular assignment-expression is in fact
8650 constant. */
8652 /* Restore the old settings. */
8653 parser->integral_constant_expression_p
8655 parser->allow_non_integral_constant_expression_p
8658 {
8659 /* Require an rvalue constant expression here; that's what our
8660 callers expect. Reference constant expressions are handled
8661 separately in e.g. cp_parser_template_argument. */
8666 }
8669 parser->non_integral_constant_expression_p
8673 }
8675 /* Parse __builtin_offsetof.
8677 offsetof-expression:
8678 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8680 offsetof-member-designator:
8681 id-expression
8682 | offsetof-member-designator "." id-expression
8683 | offsetof-member-designator "[" expression "]"
8684 | offsetof-member-designator "->" id-expression */
8686 static tree
8688 {
8691 cp_id_kind dummy;
8694 /* We're about to accept non-integral-constant things, but will
8695 definitely yield an integral constant expression. Save and
8696 restore these values around our local parsing. */
8700 /* Consume the "__builtin_offsetof" token. */
8702 /* Consume the opening `('. */
8704 /* Parse the type-id. */
8707 /* Look for the `,'. */
8711 /* Build the (type *)null that begins the traditional offsetof macro. */
8713 tf_warning_or_error);
8715 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8719 {
8722 {
8724 /* offsetof-member-designator "[" expression "]" */
8730 /* offsetof-member-designator "->" identifier */
8733 /* FALLTHRU */
8736 /* offsetof-member-designator "." identifier */
8744 /* Consume the ")" token. */
8749 /* Error. We know the following require will fail, but
8750 that gives the proper error message. */
8755 }
8756 }
8758 success:
8761 failure:
8766 }
8768 /* Parse a trait expression.
8770 Returns a representation of the expression, the underlying type
8771 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8773 static tree
8775 {
8776 cp_trait_kind kind;
8782 {
8866 }
8868 /* Consume the token. */
8879 {
8886 }
8888 {
8890 {
8894 {
8897 }
8901 }
8902 }
8906 /* Complete the trait expression, which may mean either processing
8907 the trait expr now or saving it for template instantiation. */
8909 {
8918 }
8919 }
8921 /* Lambdas that appear in variable initializer or default argument scope
8922 get that in their mangling, so we need to record it. We might as well
8923 use the count for function and namespace scopes as well. */
8927 {
8928 tree t;
8933 static void
8935 {
8936 tree_int ti;
8938 /* Once we're inside a function, we ignore other scopes and just push
8939 the function again so that popping works properly. */
8946 {
8947 /* Don't reset the count if we're still in the same function. */
8950 }
8951 }
8953 static void
8955 {
8958 }
8960 static void
8962 {
8965 {
8968 }
8970 }
8972 /* Parse a lambda expression.
8974 lambda-expression:
8975 lambda-introducer lambda-declarator [opt] compound-statement
8977 Returns a representation of the expression. */
8979 static tree
8981 {
8983 tree type;
8991 {
8993 {
8997 }
8999 }
9001 {
9003 {
9006 }
9008 }
9010 /* We may be in the middle of deferred access check. Disable
9011 it now. */
9022 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
9025 /* Now that we've started the type, add the capture fields for any
9026 explicit captures. */
9029 {
9030 /* Inside the class, surrounding template-parameter-lists do not apply. */
9031 unsigned int saved_num_template_parameter_lists
9035 bool fully_implicit_function_template_p
9039 bool auto_is_implicit_function_template_parm_p
9050 /* By virtue of defining a local class, a lambda expression has access to
9051 the private variables of enclosing classes. */
9056 {
9062 }
9064 {
9067 }
9069 /* The capture list was built up in reverse order; fix that now. */
9081 parser->fully_implicit_function_template_p
9085 parser->auto_is_implicit_function_template_parm_p
9087 }
9091 /* This field is only used during parsing of the lambda. */
9094 /* This lambda shouldn't have any proxies left at this point. */
9096 /* And now that we're done, push proxies for an enclosing lambda. */
9101 else
9107 }
9109 /* Parse the beginning of a lambda expression.
9111 lambda-introducer:
9112 [ lambda-capture [opt] ]
9114 LAMBDA_EXPR is the current representation of the lambda expression. */
9116 static void
9118 {
9119 /* Need commas after the first capture. */
9122 /* Eat the leading `['. */
9125 /* Record default capture mode. "[&" "[=" "[&," "[=," */
9133 {
9136 }
9139 {
9141 tree capture_id;
9142 tree capture_init_expr;
9146 enum capture_kind_type
9147 {
9148 BY_COPY,
9149 BY_REFERENCE
9150 };
9154 {
9157 }
9161 else
9164 /* Possibly capture `this'. */
9166 {
9176 explicit_init_p);
9178 }
9180 /* Remember whether we want to capture as a reference or not. */
9182 {
9185 }
9187 /* Get the identifier. */
9192 /* Would be nice to have a cp_parser_skip_to_closing_x for general
9193 delimiters, but I modified this to stop on unnested ']' as well. It
9194 was already changed to stop on unnested '}', so the
9195 "closing_parenthesis" name is no more misleading with my change. */
9196 {
9202 }
9204 /* Find the initializer for this capture. */
9208 {
9210 /* An explicit initializer exists. */
9213 "lambda capture initializers "
9219 {
9222 }
9223 }
9224 else
9225 {
9228 /* Turn the identifier into an id-expression. */
9229 capture_init_expr
9234 {
9237 }
9241 {
9244 capture_init_expr);
9247 }
9250 {
9253 capture_init_expr))
9256 }
9258 capture_init_expr
9259 = finish_id_expression
9261 capture_init_expr,
9275 {
9278 }
9279 else
9281 }
9285 {
9290 capture_id);
9294 "capture of %qD redundant with by-reference capture "
9296 }
9299 capture_id,
9300 capture_init_expr,
9302 explicit_init_p);
9303 }
9306 }
9308 /* Parse the (optional) middle of a lambda expression.
9310 lambda-declarator:
9311 < template-parameter-list [opt] >
9312 ( parameter-declaration-clause [opt] )
9313 attribute-specifier [opt]
9314 mutable [opt]
9315 exception-specification [opt]
9316 lambda-return-type-clause [opt]
9318 LAMBDA_EXPR is the current representation of the lambda expression. */
9320 static bool
9322 {
9323 /* 5.1.1.4 of the standard says:
9324 If a lambda-expression does not include a lambda-declarator, it is as if
9325 the lambda-declarator were ().
9326 This means an empty parameter list, no attributes, and no exception
9327 specification. */
9333 /* The template-parameter-list is optional, but must begin with
9334 an opening angle if present. */
9336 {
9339 "lambda templates are only available with "
9348 /* We just processed one more parameter list. */
9350 }
9352 /* The parameter-declaration-clause is optional (unless
9353 template-parameter-list was given), but must begin with an
9354 opening parenthesis if present. */
9356 {
9361 /* Parse parameters. */
9364 /* Default arguments shall not be specified in the
9365 parameter-declaration-clause of a lambda-declarator. */
9375 /* Parse optional `mutable' keyword. */
9377 {
9380 }
9382 /* Parse optional exception specification. */
9385 /* Parse optional trailing return type. */
9387 {
9391 }
9393 /* The function parameters must be in scope all the way until after the
9394 trailing-return-type in case of decltype. */
9396 }
9400 /* Create the function call operator.
9402 Messing with declarators like this is no uglier than building up the
9403 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9404 other code. */
9405 {
9406 cp_decl_specifier_seq return_type_specs;
9408 tree fco;
9415 else
9416 /* Maybe we will deduce the return type later. */
9422 sfk_none);
9427 VIRT_SPEC_UNSPECIFIED,
9428 REF_QUAL_NONE,
9429 exception_spec,
9434 declarator,
9435 attributes);
9437 {
9440 /* Give the object parameter a different name. */
9444 }
9446 {
9450 }
9459 }
9460 }
9462 /* Parse the body of a lambda expression, which is simply
9464 compound-statement
9466 but which requires special handling.
9467 LAMBDA_EXPR is the current representation of the lambda expression. */
9469 static void
9471 {
9476 else
9477 /* Still increment function_depth so that we don't GC in the
9478 middle of an expression. */
9480 /* Clear this in case we're in the middle of a default argument. */
9483 /* Finish the function call operator
9484 - class_specifier
9485 + late_parsing_for_member
9486 + function_definition_after_declarator
9487 + ctor_initializer_opt_and_function_body */
9488 {
9490 tree body;
9492 tree compound_stmt;
9493 tree cap;
9495 /* Let the front end know that we are going to be defining this
9496 function. */
9498 NULL_TREE,
9507 /* Push the proxies for any explicit captures. */
9514 /* 5.1.1.4 of the standard says:
9515 If a lambda-expression does not include a trailing-return-type, it
9516 is as if the trailing-return-type denotes the following type:
9517 * if the compound-statement is of the form
9518 { return attribute-specifier [opt] expression ; }
9519 the type of the returned expression after lvalue-to-rvalue
9520 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9521 (_conv.array_ 4.2), and function-to-pointer conversion
9522 (_conv.func_ 4.3);
9523 * otherwise, void. */
9525 /* In a lambda that has neither a lambda-return-type-clause
9526 nor a deducible form, errors should be reported for return statements
9527 in the body. Since we used void as the placeholder return type, parsing
9528 the body as usual will give such desired behavior. */
9532 {
9536 /* Parse tentatively in case there's more after the initial return
9537 statement. */
9548 {
9552 /* Will get error here if type not deduced yet. */
9556 }
9557 }
9560 {
9565 }
9569 out:
9573 /* Finish the function and generate code for it if necessary. */
9576 /* Only expand if the call op is not a template. */
9579 }
9584 else
9586 }
9588 /* Statements [gram.stmt.stmt] */
9590 /* Parse a statement.
9592 statement:
9593 labeled-statement
9594 expression-statement
9595 compound-statement
9596 selection-statement
9597 iteration-statement
9598 jump-statement
9599 declaration-statement
9600 try-block
9602 C++11:
9604 statement:
9605 labeled-statement
9606 attribute-specifier-seq (opt) expression-statement
9607 attribute-specifier-seq (opt) compound-statement
9608 attribute-specifier-seq (opt) selection-statement
9609 attribute-specifier-seq (opt) iteration-statement
9610 attribute-specifier-seq (opt) jump-statement
9611 declaration-statement
9612 attribute-specifier-seq (opt) try-block
9614 TM Extension:
9616 statement:
9617 atomic-statement
9619 IN_COMPOUND is true when the statement is nested inside a
9620 cp_parser_compound_statement; this matters for certain pragmas.
9622 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9623 is a (possibly labeled) if statement which is not enclosed in braces
9624 and has an else clause. This is used to implement -Wparentheses. */
9626 static void
9629 {
9634 restart:
9637 /* There is no statement yet. */
9643 /* In obj-c++, seeing '[[' might be the either the beginning of
9644 c++11 attributes, or a nested objc-message-expression. So
9645 let's parse the c++11 attributes tentatively. */
9649 {
9652 }
9654 /* Peek at the next token. */
9656 /* Remember the location of the first token in the statement. */
9658 /* If this is a keyword, then that will often determine what kind of
9659 statement we have. */
9661 {
9665 {
9668 /* Looks like a labeled-statement with a case label.
9669 Parse the label, and then use tail recursion to parse
9670 the statement. */
9687 {
9692 }
9693 else
9707 {
9712 }
9713 else
9714 {
9718 }
9722 /* Objective-C++ exception-handling constructs. */
9736 /* This must be a namespace alias definition. */
9749 /* It might be a keyword like `int' that can start a
9750 declaration-statement. */
9752 }
9753 }
9755 {
9756 /* If the next token is a `:', then we are looking at a
9757 labeled-statement. */
9760 {
9761 /* Looks like a labeled-statement with an ordinary label.
9762 Parse the label, and then use tail recursion to parse
9763 the statement. */
9767 }
9768 }
9769 /* Anything that starts with a `{' must be a compound-statement. */
9772 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9773 a statement all its own. */
9775 {
9776 /* Only certain OpenMP pragmas are attached to statements, and thus
9777 are considered statements themselves. All others are not. In
9778 the context of a compound, accept the pragma as a "statement" and
9779 return so that we can check for a close brace. Otherwise we
9780 require a real statement and must go back and read one. */
9786 }
9788 {
9791 }
9793 /* Everything else must be a declaration-statement or an
9794 expression-statement. Try for the declaration-statement
9795 first, unless we are looking at a `;', in which case we know that
9796 we have an expression-statement. */
9798 {
9800 {
9802 {
9803 /* Attributes should be parsed as part of the the
9804 declaration, so let's un-parse them. */
9807 }
9810 /* Try to parse the declaration-statement. */
9812 /* If that worked, we're done. */
9815 }
9816 /* Look for an expression-statement instead. */
9818 }
9820 /* Set the line number for the statement. */
9824 /* Note that for now, we don't do anything with c++11 statements
9825 parsed at this level. */
9828 OPT_Wattributes,
9830 }
9832 /* Parse the label for a labeled-statement, i.e.
9834 identifier :
9835 case constant-expression :
9836 default :
9838 GNU Extension:
9839 case constant-expression ... constant-expression : statement
9841 When a label is parsed without errors, the label is added to the
9842 parse tree by the finish_* functions, so this function doesn't
9843 have to return the label. */
9845 static void
9847 {
9852 /* The next token should be an identifier. */
9856 {
9859 }
9863 {
9865 {
9869 /* Consume the `case' token. */
9871 /* Parse the constant-expression. */
9878 {
9879 /* Consume the `...' token. */
9885 /* We don't need to emit warnings here, as the common code
9886 will do this for us. */
9887 }
9888 else
9893 else
9896 expr);
9897 }
9901 /* Consume the `default' token. */
9906 else
9911 /* Anything else must be an ordinary label. */
9914 }
9916 /* Require the `:' token. */
9919 /* An ordinary label may optionally be followed by attributes.
9920 However, this is only permitted if the attributes are then
9921 followed by a semicolon. This is because, for backward
9922 compatibility, when parsing
9923 lab: __attribute__ ((unused)) int i;
9924 we want the attribute to attach to "i", not "lab". */
9927 {
9928 tree attrs;
9935 ;
9936 else
9938 }
9944 }
9946 /* Parse an expression-statement.
9948 expression-statement:
9949 expression [opt] ;
9951 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9952 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9953 indicates whether this expression-statement is part of an
9954 expression statement. */
9956 static tree
9958 {
9962 /* If the next token is a ';', then there is no expression
9963 statement. */
9965 {
9969 {
9972 }
9973 }
9975 /* Give a helpful message for "A<T>::type t;" and the like. */
9978 {
9985 {
9986 /* A::A a; */
9991 }
9992 }
9994 /* Consume the final `;'. */
9999 /* This is the final expression statement of a statement
10000 expression. */
10006 }
10008 /* Parse a compound-statement.
10010 compound-statement:
10011 { statement-seq [opt] }
10013 GNU extension:
10015 compound-statement:
10016 { label-declaration-seq [opt] statement-seq [opt] }
10018 label-declaration-seq:
10019 label-declaration
10020 label-declaration-seq label-declaration
10022 Returns a tree representing the statement. */
10024 static tree
10027 {
10028 tree compound_stmt;
10030 /* Consume the `{'. */
10037 /* Begin the compound-statement. */
10039 /* If the next keyword is `__label__' we have a label declaration. */
10042 /* Parse an (optional) statement-seq. */
10044 /* Finish the compound-statement. */
10046 /* Consume the `}'. */
10050 }
10052 /* Parse an (optional) statement-seq.
10054 statement-seq:
10055 statement
10056 statement-seq [opt] statement */
10058 static void
10060 {
10061 /* Scan statements until there aren't any more. */
10063 {
10066 /* If we are looking at a `}', then we have run out of
10067 statements; the same is true if we have reached the end
10068 of file, or have stumbled upon a stray '@end'. */
10075 /* If we are in a compound statement and find 'else' then
10076 something went wrong. */
10078 {
10081 else
10082 {
10085 }
10086 }
10088 /* Parse the statement. */
10090 }
10091 }
10093 /* Parse a selection-statement.
10095 selection-statement:
10096 if ( condition ) statement
10097 if ( condition ) statement else statement
10098 switch ( condition ) statement
10100 Returns the new IF_STMT or SWITCH_STMT.
10102 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10103 is a (possibly labeled) if statement which is not enclosed in
10104 braces and has an else clause. This is used to implement
10105 -Wparentheses. */
10107 static tree
10109 {
10116 /* Peek at the next token. */
10119 /* See what kind of keyword it is. */
10122 {
10125 {
10126 tree statement;
10127 tree condition;
10129 /* Look for the `('. */
10131 {
10134 }
10136 /* Begin the selection-statement. */
10139 else
10142 /* Parse the condition. */
10144 /* Look for the `)'. */
10150 {
10154 /* Add the condition. */
10157 /* Parse the then-clause. */
10161 {
10169 }
10170 else
10177 /* If the next token is `else', parse the else-clause. */
10179 RID_ELSE))
10180 {
10181 /* Consume the `else' keyword. */
10182 location_t else_tok_loc
10185 /* Parse the else-clause. */
10187 {
10188 location_t loc;
10195 }
10196 else
10202 /* If we are currently parsing a then-clause, then
10203 IF_P will not be NULL. We set it to true to
10204 indicate that this if statement has an else clause.
10205 This may trigger the Wparentheses warning below
10206 when we get back up to the parent if statement. */
10209 }
10210 else
10211 {
10212 /* This if statement does not have an else clause. If
10213 NESTED_IF is true, then the then-clause is an if
10214 statement which does have an else clause. We warn
10215 about the potential ambiguity. */
10218 "suggest explicit braces to avoid ambiguous"
10220 }
10222 /* Now we're all done with the if-statement. */
10224 }
10225 else
10226 {
10230 /* Add the condition. */
10233 /* Parse the body of the switch-statement. */
10243 /* Now we're all done with the switch-statement. */
10245 }
10248 }
10254 }
10255 }
10257 /* Parse a condition.
10259 condition:
10260 expression
10261 type-specifier-seq declarator = initializer-clause
10262 type-specifier-seq declarator braced-init-list
10264 GNU Extension:
10266 condition:
10267 type-specifier-seq declarator asm-specification [opt]
10268 attributes [opt] = assignment-expression
10270 Returns the expression that should be tested. */
10272 static tree
10274 {
10275 cp_decl_specifier_seq type_specifiers;
10279 /* Try the declaration first. */
10281 /* New types are not allowed in the type-specifier-seq for a
10282 condition. */
10284 parser->type_definition_forbidden_message
10286 /* Parse the type-specifier-seq. */
10288 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
10291 /* Restore the saved message. */
10293 /* If all is well, we might be looking at a declaration. */
10295 {
10296 tree decl;
10297 tree asm_specification;
10298 tree attributes;
10302 /* Parse the declarator. */
10308 /* Parse the attributes. */
10310 /* Parse the asm-specification. */
10312 /* If the next token is not an `=' or '{', then we might still be
10313 looking at an expression. For example:
10315 if (A(a).x)
10317 looks like a decl-specifier-seq and a declarator -- but then
10318 there is no `=', so this is an expression. */
10323 /* If we did see an `=' or '{', then we are looking at a declaration
10324 for sure. */
10326 {
10327 tree pushed_scope;
10331 /* Create the declaration. */
10337 /* Parse the initializer. */
10339 {
10343 }
10344 else
10345 {
10346 /* Consume the `='. */
10349 }
10353 /* Process the initializer. */
10356 asm_specification,
10357 flags);
10363 }
10364 }
10365 /* If we didn't even get past the declarator successfully, we are
10366 definitely not looking at a declaration. */
10367 else
10370 /* Otherwise, we are looking at an expression. */
10372 }
10374 /* Parses a for-statement or range-for-statement until the closing ')',
10375 not included. */
10377 static tree
10379 {
10383 /* Begin the for-statement. */
10386 /* Parse the initialization. */
10391 else
10393 }
10395 static tree
10397 {
10398 /* Normal for loop */
10401 tree stmt;
10404 /* The for-init-statement has already been parsed in
10405 cp_parser_for_init_statement, so no work is needed here. */
10408 /* If there's a condition, process it. */
10412 {
10416 }
10418 /* Look for the `;'. */
10421 /* If there's an expression, process it. */
10427 }
10429 /* Tries to parse a range-based for-statement:
10431 range-based-for:
10432 decl-specifier-seq declarator : expression
10434 The decl-specifier-seq declarator and the `:' are already parsed by
10435 cp_parser_for_init_statement. If processing_template_decl it returns a
10436 newly created RANGE_FOR_STMT; if not, it is converted to a
10437 regular FOR_STMT. */
10439 static tree
10442 {
10446 {
10449 }
10450 else
10453 /* If in template, STMT is converted to a normal for-statement
10454 at instantiation. If not, it is done just ahead. */
10456 {
10464 /* do_auto_deduction doesn't mess with template init-lists. */
10467 }
10468 else
10469 {
10472 }
10474 }
10476 /* Subroutine of cp_convert_range_for: given the initializer expression,
10477 builds up the range temporary. */
10479 static tree
10481 {
10484 /* Find out the type deduced by the declaration
10485 `auto &&__range = range_expr'. */
10490 /* Create the __range variable. */
10497 }
10499 /* Used by cp_parser_range_for in template context: we aren't going to
10500 do a full conversion yet, but we still need to resolve auto in the
10501 type of the for-range-declaration if present. This is basically
10502 a shortcut version of cp_convert_range_for. */
10504 static void
10506 {
10509 {
10512 iter_type = (cp_parser_perform_range_for_lookup
10515 {
10517 iter_type);
10519 tf_warning_or_error);
10522 }
10523 }
10524 }
10526 /* Converts a range-based for-statement into a normal
10527 for-statement, as per the definition.
10529 for (RANGE_DECL : RANGE_EXPR)
10530 BLOCK
10532 should be equivalent to:
10534 {
10535 auto &&__range = RANGE_EXPR;
10536 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10537 __begin != __end;
10538 ++__begin)
10539 {
10540 RANGE_DECL = *__begin;
10541 BLOCK
10542 }
10543 }
10545 If RANGE_EXPR is an array:
10546 BEGIN_EXPR = __range
10547 END_EXPR = __range + ARRAY_SIZE(__range)
10548 Else if RANGE_EXPR has a member 'begin' or 'end':
10549 BEGIN_EXPR = __range.begin()
10550 END_EXPR = __range.end()
10551 Else:
10552 BEGIN_EXPR = begin(__range)
10553 END_EXPR = end(__range);
10555 If __range has a member 'begin' but not 'end', or vice versa, we must
10556 still use the second alternative (it will surely fail, however).
10557 When calling begin()/end() in the third alternative we must use
10558 argument dependent lookup, but always considering 'std' as an associated
10559 namespace. */
10561 tree
10564 {
10570 /* If an error happened previously do nothing or else a lot of
10571 unhelpful errors would be issued. */
10573 else
10574 {
10575 tree range_temp;
10579 /* Can't bind a reference to an array of runtime bound. */
10581 else
10582 {
10587 LOOKUP_ONLYCONVERTING);
10589 }
10592 }
10594 /* The new for initialization statement. */
10602 LOOKUP_ONLYCONVERTING);
10611 LOOKUP_ONLYCONVERTING);
10615 /* The new for condition. */
10622 /* The new increment expression. */
10625 tf_warning_or_error);
10628 /* The declaration is initialized with *__begin inside the loop body. */
10631 tf_warning_or_error),
10633 LOOKUP_ONLYCONVERTING);
10636 }
10638 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10639 We need to solve both at the same time because the method used
10640 depends on the existence of members begin or end.
10641 Returns the type deduced for the iterator expression. */
10643 static tree
10645 {
10647 {
10650 }
10653 {
10658 }
10660 {
10661 /* If RANGE is an array, we will use pointer arithmetic. */
10664 range,
10668 }
10669 else
10670 {
10671 /* If it is not an array, we must do a bit of magic. */
10681 tf_warning_or_error);
10684 tf_warning_or_error);
10687 {
10688 /* Use the member functions. */
10691 else
10697 else
10700 }
10701 else
10702 {
10703 /* Use global functions with ADL. */
10710 tf_warning_or_error);
10712 tf_warning_or_error);
10714 tf_warning_or_error);
10716 tf_warning_or_error);
10719 }
10721 /* Last common checks. */
10723 {
10724 /* If one of the expressions is an error do no more checks. */
10727 }
10730 /* Can happen, when, eg, in a template context, Koenig lookup
10731 can't resolve begin/end (c++/58503). */
10733 else
10734 {
10736 /* The unqualified type of the __begin and __end temporaries should
10737 be the same, as required by the multiple auto declaration. */
10743 }
10744 }
10745 }
10747 /* Helper function for cp_parser_perform_range_for_lookup.
10748 Builds a tree for RANGE.IDENTIFIER(). */
10750 static tree
10752 {
10765 tf_warning_or_error);
10768 }
10770 /* Parse an iteration-statement.
10772 iteration-statement:
10773 while ( condition ) statement
10774 do statement while ( expression ) ;
10775 for ( for-init-statement condition [opt] ; expression [opt] )
10776 statement
10778 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10780 static tree
10782 {
10784 location_t tok_loc;
10786 tree statement;
10789 /* Peek at the next token. */
10796 /* Remember whether or not we are already within an iteration
10797 statement. */
10800 /* See what kind of keyword it is. */
10803 {
10805 {
10806 tree condition;
10808 /* Begin the while-statement. */
10810 /* Look for the `('. */
10812 /* Parse the condition. */
10815 /* Look for the `)'. */
10817 /* Parse the dependent statement. */
10821 /* We're done with the while-statement. */
10823 }
10827 {
10828 tree expression;
10830 /* Begin the do-statement. */
10832 /* Parse the body of the do-statement. */
10837 /* Look for the `while' keyword. */
10839 /* Look for the `('. */
10841 /* Parse the expression. */
10843 /* We're done with the do-statement. */
10845 /* Look for the `)'. */
10847 /* Look for the `;'. */
10849 }
10853 {
10854 /* Look for the `('. */
10859 /* Look for the `)'. */
10862 /* Parse the body of the for-statement. */
10867 /* We're done with the for-statement. */
10869 }
10876 }
10879 }
10881 /* Parse a for-init-statement or the declarator of a range-based-for.
10882 Returns true if a range-based-for declaration is seen.
10884 for-init-statement:
10885 expression-statement
10886 simple-declaration */
10888 static bool
10890 {
10891 /* If the next token is a `;', then we have an empty
10892 expression-statement. Grammatically, this is also a
10893 simple-declaration, but an invalid one, because it does not
10894 declare anything. Therefore, if we did not handle this case
10895 specially, we would issue an error message about an invalid
10896 declaration. */
10898 {
10904 {
10905 /* N3994 -- for (id : init) ... */
10908 "type-specifier only available with "
10916 }
10918 /* A colon is used in range-based for. */
10921 /* We're going to speculatively look for a declaration, falling back
10922 to an expression, if necessary. */
10924 /* Parse the declaration. */
10927 decl);
10930 {
10931 /* It is a range-for, consume the ':' */
10935 {
10937 "range-based %<for%> loops only available with "
10940 }
10941 }
10942 else
10943 /* The ';' is not consumed yet because we told
10944 cp_parser_simple_declaration not to. */
10949 /* If the tentative parse failed, then we shall need to look for an
10950 expression-statement. */
10951 }
10952 /* If we are here, it is an expression-statement. */
10955 }
10957 /* Parse a jump-statement.
10959 jump-statement:
10960 break ;
10961 continue ;
10962 return expression [opt] ;
10963 return braced-init-list ;
10964 goto identifier ;
10966 GNU extension:
10968 jump-statement:
10969 goto * expression ;
10971 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10973 static tree
10975 {
10981 /* Peek at the next token. */
10986 /* See what kind of keyword it is. */
10989 {
10993 {
11013 }
11019 {
11026 /* Fall through. */
11036 }
11041 {
11042 tree expr;
11046 {
11050 }
11053 else
11054 /* If the next token is a `;', then there is no
11055 expression. */
11057 /* Build the return-statement. */
11059 /* Look for the final `;'. */
11061 }
11067 {
11070 }
11072 /* Create the goto-statement. */
11074 {
11075 /* Issue a warning about this use of a GNU extension. */
11077 /* Consume the '*' token. */
11079 /* Parse the dependent expression. */
11081 }
11082 else
11084 /* Look for the final `;'. */
11091 }
11094 }
11096 /* Parse a declaration-statement.
11098 declaration-statement:
11099 block-declaration */
11101 static void
11103 {
11106 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11109 /* Parse the block-declaration. */
11112 /* Free any declarators allocated. */
11114 }
11116 /* Some dependent statements (like `if (cond) statement'), are
11117 implicitly in their own scope. In other words, if the statement is
11118 a single statement (as opposed to a compound-statement), it is
11119 none-the-less treated as if it were enclosed in braces. Any
11120 declarations appearing in the dependent statement are out of scope
11121 after control passes that point. This function parses a statement,
11122 but ensures that is in its own scope, even if it is not a
11123 compound-statement.
11125 If IF_P is not NULL, *IF_P is set to indicate whether the statement
11126 is a (possibly labeled) if statement which is not enclosed in
11127 braces and has an else clause. This is used to implement
11128 -Wparentheses.
11130 Returns the new statement. */
11132 static tree
11134 location_t guard_loc,
11136 {
11137 tree statement;
11142 /* Mark if () ; with a special NOP_EXPR. */
11144 {
11148 }
11149 /* if a compound is opened, we simply parse the statement directly. */
11152 /* If the token is not a `{', then we must take special action. */
11153 else
11154 {
11155 /* Create a compound-statement. */
11157 /* Parse the dependent-statement. */
11160 /* Finish the dummy compound-statement. */
11164 {
11168 guard_kind);
11169 }
11170 }
11172 /* Return the statement. */
11174 }
11176 /* For some dependent statements (like `while (cond) statement'), we
11177 have already created a scope. Therefore, even if the dependent
11178 statement is a compound-statement, we do not want to create another
11179 scope. */
11181 static void
11184 {
11185 /* If the token is a `{', then we must take special action. */
11187 {
11194 guard_kind);
11195 }
11196 else
11197 {
11198 /* Avoid calling cp_parser_compound_statement, so that we
11199 don't create a new scope. Do everything else by hand. */
11201 /* If the next keyword is `__label__' we have a label declaration. */
11204 /* Parse an (optional) statement-seq. */
11207 }
11208 }
11210 /* Declarations [gram.dcl.dcl] */
11212 /* Parse an optional declaration-sequence.
11214 declaration-seq:
11215 declaration
11216 declaration-seq declaration */
11218 static void
11220 {
11222 {
11233 {
11234 /* A declaration consisting of a single semicolon is
11235 invalid. Allow it unless we're being pedantic. */
11240 }
11242 /* If we're entering or exiting a region that's implicitly
11243 extern "C", modify the lang context appropriately. */
11245 {
11248 }
11250 {
11253 }
11256 {
11257 /* A top-level declaration can consist solely of a #pragma.
11258 A nested declaration cannot, so this is done here and not
11259 in cp_parser_declaration. (A #pragma at block scope is
11260 handled in cp_parser_statement.) */
11263 }
11265 /* Parse the declaration itself. */
11267 }
11268 }
11270 /* Parse a declaration.
11272 declaration:
11273 block-declaration
11274 function-definition
11275 template-declaration
11276 explicit-instantiation
11277 explicit-specialization
11278 linkage-specification
11279 namespace-definition
11281 GNU extension:
11283 declaration:
11284 __extension__ declaration */
11286 static void
11288 {
11289 cp_token token1;
11290 cp_token token2;
11295 /* Check for the `__extension__' keyword. */
11297 {
11298 /* Parse the qualified declaration. */
11300 /* Restore the PEDANTIC flag. */
11304 }
11306 /* Try to figure out what kind of declaration is present. */
11311 else
11312 {
11315 }
11317 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
11320 /* If the next token is `extern' and the following token is a string
11321 literal, then we have a linkage specification. */
11325 /* If the next token is `template', then we have either a template
11326 declaration, an explicit instantiation, or an explicit
11327 specialization. */
11329 {
11330 /* `template <>' indicates a template specialization. */
11334 /* `template <' indicates a template declaration. */
11337 /* Anything else must be an explicit instantiation. */
11338 else
11340 }
11341 /* If the next token is `export', then we have a template
11342 declaration. */
11345 /* If the next token is `extern', 'static' or 'inline' and the one
11346 after that is `template', we have a GNU extended explicit
11347 instantiation directive. */
11354 /* If the next token is `namespace', check for a named or unnamed
11355 namespace definition. */
11361 /* An unnamed namespace definition. */
11365 /* An inline (associated) namespace definition. */
11369 /* Objective-C++ declaration/definition. */
11376 /* We must have either a block declaration or a function
11377 definition. */
11378 else
11379 /* Try to parse a block-declaration, or a function-definition. */
11382 /* Free any declarators allocated. */
11384 }
11386 /* Parse a block-declaration.
11388 block-declaration:
11389 simple-declaration
11390 asm-definition
11391 namespace-alias-definition
11392 using-declaration
11393 using-directive
11395 GNU Extension:
11397 block-declaration:
11398 __extension__ block-declaration
11400 C++0x Extension:
11402 block-declaration:
11403 static_assert-declaration
11405 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11406 part of a declaration-statement. */
11408 static void
11411 {
11415 /* Check for the `__extension__' keyword. */
11417 {
11418 /* Parse the qualified declaration. */
11420 /* Restore the PEDANTIC flag. */
11424 }
11426 /* Peek at the next token to figure out which kind of declaration is
11427 present. */
11430 /* If the next keyword is `asm', we have an asm-definition. */
11432 {
11436 }
11437 /* If the next keyword is `namespace', we have a
11438 namespace-alias-definition. */
11441 /* If the next keyword is `using', we have a
11442 using-declaration, a using-directive, or an alias-declaration. */
11444 {
11449 /* If the token after `using' is `namespace', then we have a
11450 using-directive. */
11454 /* If the second token after 'using' is '=', then we have an
11455 alias-declaration. */
11461 /* Otherwise, it's a using-declaration. */
11462 else
11465 }
11466 /* If the next keyword is `__label__' we have a misplaced label
11467 declaration. */
11469 {
11473 /* If the next token is now a `;', consume it. */
11476 }
11477 /* If the next token is `static_assert' we have a static assertion. */
11480 /* Anything else must be a simple-declaration. */
11481 else
11484 }
11486 /* Parse a simple-declaration.
11488 simple-declaration:
11489 decl-specifier-seq [opt] init-declarator-list [opt] ;
11491 init-declarator-list:
11492 init-declarator
11493 init-declarator-list , init-declarator
11495 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11496 function-definition as a simple-declaration.
11498 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11499 parsed declaration if it is an uninitialized single declarator not followed
11500 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11501 if present, will not be consumed. */
11503 static void
11507 {
11508 cp_decl_specifier_seq decl_specifiers;
11517 /* Defer access checks until we know what is being declared; the
11518 checks for names appearing in the decl-specifier-seq should be
11519 done as if we were in the scope of the thing being declared. */
11522 /* Parse the decl-specifier-seq. We have to keep track of whether
11523 or not the decl-specifier-seq declares a named class or
11524 enumeration type, since that is the only case in which the
11525 init-declarator-list is allowed to be empty.
11527 [dcl.dcl]
11529 In a simple-declaration, the optional init-declarator-list can be
11530 omitted only when declaring a class or enumeration, that is when
11531 the decl-specifier-seq contains either a class-specifier, an
11532 elaborated-type-specifier, or an enum-specifier. */
11534 CP_PARSER_FLAGS_OPTIONAL,
11537 /* We no longer need to defer access checks. */
11540 /* In a block scope, a valid declaration must always have a
11541 decl-specifier-seq. By not trying to parse declarators, we can
11542 resolve the declaration/expression ambiguity more quickly. */
11545 {
11548 }
11550 /* If the next two tokens are both identifiers, the code is
11551 erroneous. The usual cause of this situation is code like:
11553 T t;
11555 where "T" should name a type -- but does not. */
11558 {
11559 /* If parsing tentatively, we should commit; we really are
11560 looking at a declaration. */
11562 /* Give up. */
11564 }
11566 /* If we have seen at least one decl-specifier, and the next token
11567 is not a parenthesis, then we must be looking at a declaration.
11568 (After "int (" we might be looking at a functional cast.) */
11575 /* Keep going until we hit the `;' at the end of the simple
11576 declaration. */
11579 CPP_SEMICOLON))
11580 {
11583 tree decl;
11586 {
11587 /* If we are processing next declarator, comma is expected */
11592 {
11596 }
11597 }
11598 else
11601 /* Parse the init-declarator. */
11604 function_definition_allowed_p,
11606 declares_class_or_enum,
11608 maybe_range_for_decl,
11610 /* If an error occurred while parsing tentatively, exit quickly.
11611 (That usually happens when in the body of a function; each
11612 statement is treated as a declaration-statement until proven
11613 otherwise.) */
11616 /* Handle function definitions specially. */
11618 {
11619 /* If the next token is a `,', then we are probably
11620 processing something like:
11622 void f() {}, *p;
11624 which is erroneous. */
11626 {
11629 "mixing"
11631 }
11632 /* Otherwise, we're done with the list of declarators. */
11633 else
11634 {
11637 }
11638 }
11641 /* The next token should be either a `,' or a `;'. */
11643 /* If it's a `,', there are more declarators to come. */
11646 /* If it's a `;', we are done. */
11649 /* Anything else is an error. */
11650 else
11651 {
11652 /* If we have already issued an error message we don't need
11653 to issue another one. */
11657 /* Skip tokens until we reach the end of the statement. */
11659 /* If the next token is now a `;', consume it. */
11663 }
11664 /* After the first time around, a function-definition is not
11665 allowed -- even if it was OK at first. For example:
11667 int i, f() {}
11669 is not valid. */
11671 }
11673 /* Issue an error message if no declarators are present, and the
11674 decl-specifier-seq does not itself declare a class or
11675 enumeration: [dcl.dcl]/3. */
11677 {
11679 {
11683 /* Ensure an error is issued anyway when finish_decltype_type,
11684 called via cp_parser_decl_specifier_seq, returns a class or
11685 an enumeration (c++/51786). */
11688 }
11689 /* Perform any deferred access checks. */
11691 }
11693 /* Consume the `;'. */
11697 {
11703 }
11705 done:
11707 }
11709 /* Parse a decl-specifier-seq.
11711 decl-specifier-seq:
11712 decl-specifier-seq [opt] decl-specifier
11713 decl-specifier attribute-specifier-seq [opt] (C++11)
11715 decl-specifier:
11716 storage-class-specifier
11717 type-specifier
11718 function-specifier
11719 friend
11720 typedef
11722 GNU Extension:
11724 decl-specifier:
11725 attributes
11727 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11729 The parser flags FLAGS is used to control type-specifier parsing.
11731 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11732 flags:
11734 1: one of the decl-specifiers is an elaborated-type-specifier
11735 (i.e., a type declaration)
11736 2: one of the decl-specifiers is an enum-specifier or a
11737 class-specifier (i.e., a type definition)
11739 */
11741 static void
11743 cp_parser_flags flags,
11746 {
11750 cp_decl_spec ds;
11752 /* Clear DECL_SPECS. */
11755 /* Assume no class or enumeration type is declared. */
11758 /* Keep reading specifiers until there are no more to read. */
11760 {
11765 /* Peek at the next token. */
11768 /* Save the first token of the decl spec list for error
11769 reporting. */
11772 /* Handle attributes. */
11774 {
11775 /* Parse the attributes. */
11778 /* In a sequence of declaration specifiers, c++11 attributes
11779 appertain to the type that precede them. In that case
11780 [dcl.spec]/1 says:
11782 The attribute-specifier-seq affects the type only for
11783 the declaration it appears in, not other declarations
11784 involving the same type.
11786 But for now let's force the user to position the
11787 attribute either at the beginning of the declaration or
11788 after the declarator-id, which would clearly mean that it
11789 applies to the declarator. */
11791 {
11793 /* The c++11 attribute is at the beginning of the
11794 declaration. It appertains to the entity being
11796 else
11797 {
11799 {
11800 /* This is an attribute following a
11801 class-specifier. */
11806 }
11807 else
11808 {
11809 decl_specs->std_attributes
11811 attrs);
11814 }
11816 }
11817 }
11819 decl_specs->attributes
11821 attrs);
11825 }
11826 /* Assume we will find a decl-specifier keyword. */
11828 /* If the next token is an appropriate keyword, we can simply
11829 add it to the list. */
11831 {
11832 /* decl-specifier:
11833 friend
11834 constexpr */
11837 {
11840 }
11841 else
11842 {
11844 /* Consume the token. */
11846 }
11854 /* function-specifier:
11855 inline
11856 virtual
11857 explicit */
11864 /* decl-specifier:
11865 typedef */
11868 /* Consume the token. */
11870 /* A constructor declarator cannot appear in a typedef. */
11872 /* The "typedef" keyword can only occur in a declaration; we
11873 may as well commit at this point. */
11880 /* storage-class-specifier:
11881 auto
11882 register
11883 static
11884 extern
11885 mutable
11887 GNU Extension:
11888 thread */
11891 {
11892 /* Consume the token. */
11895 /* Complain about `auto' as a storage specifier, if
11896 we're complaining about C++0x compatibility. */
11900 /* Set the storage class anyway. */
11902 token);
11903 }
11904 else
11905 /* C++0x auto type-specifier. */
11913 /* Consume the token. */
11916 token);
11919 /* Consume the token. */
11925 /* We did not yet find a decl-specifier yet. */
11928 }
11938 /* Constructors are a special case. The `S' in `S()' is not a
11939 decl-specifier; it is the beginning of the declarator. */
11940 constructor_p
11941 = (!found_decl_spec
11942 && constructor_possible_p
11943 && (cp_parser_constructor_declarator_p
11946 /* If we don't have a DECL_SPEC yet, then we must be looking at
11947 a type-specifier. */
11949 {
11952 tree type_spec;
11954 type_spec
11956 decl_specs,
11962 /* If this type-specifier referenced a user-defined type
11963 (a typedef, class-name, etc.), then we can't allow any
11964 more such type-specifiers henceforth.
11966 [dcl.spec]
11968 The longest sequence of decl-specifiers that could
11969 possibly be a type name is taken as the
11970 decl-specifier-seq of a declaration. The sequence shall
11971 be self-consistent as described below.
11973 [dcl.type]
11975 As a general rule, at most one type-specifier is allowed
11976 in the complete decl-specifier-seq of a declaration. The
11977 only exceptions are the following:
11979 -- const or volatile can be combined with any other
11980 type-specifier.
11982 -- signed or unsigned can be combined with char, long,
11983 short, or int.
11985 -- ..
11987 Example:
11989 typedef char* Pc;
11990 void g (const int Pc);
11992 Here, Pc is *not* part of the decl-specifier seq; it's
11993 the declarator. Therefore, once we see a type-specifier
11994 (other than a cv-qualifier), we forbid any additional
11995 user-defined types. We *do* still allow things like `int
11996 int' to be considered a decl-specifier-seq, and issue the
11997 error message later. */
12000 /* A constructor declarator cannot follow a type-specifier. */
12002 {
12007 }
12008 }
12010 /* If we still do not have a DECL_SPEC, then there are no more
12011 decl-specifiers. */
12016 /* After we see one decl-specifier, further decl-specifiers are
12017 always optional. */
12019 }
12021 /* Don't allow a friend specifier with a class definition. */
12026 }
12028 /* Parse an (optional) storage-class-specifier.
12030 storage-class-specifier:
12031 auto
12032 register
12033 static
12034 extern
12035 mutable
12037 GNU Extension:
12039 storage-class-specifier:
12040 thread
12042 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
12044 static tree
12046 {
12048 {
12052 /* Fall through for C++98. */
12059 /* Consume the token. */
12064 }
12065 }
12067 /* Parse an (optional) function-specifier.
12069 function-specifier:
12070 inline
12071 virtual
12072 explicit
12074 Returns an IDENTIFIER_NODE corresponding to the keyword used.
12075 Updates DECL_SPECS, if it is non-NULL. */
12077 static tree
12080 {
12083 {
12089 /* 14.5.2.3 [temp.mem]
12091 A member function template shall not be virtual. */
12094 else
12104 }
12106 /* Consume the token. */
12108 }
12110 /* Parse a linkage-specification.
12112 linkage-specification:
12113 extern string-literal { declaration-seq [opt] }
12114 extern string-literal declaration */
12116 static void
12118 {
12119 tree linkage;
12121 /* Look for the `extern' keyword. */
12124 /* Look for the string-literal. */
12127 /* Transform the literal into an identifier. If the literal is a
12128 wide-character string, or contains embedded NULs, then we can't
12129 handle it as the user wants. */
12132 {
12134 /* Assume C++ linkage. */
12136 }
12137 else
12140 /* We're now using the new linkage. */
12143 /* If the next token is a `{', then we're using the first
12144 production. */
12146 {
12149 /* Consume the `{' token. */
12151 /* Parse the declarations. */
12153 /* Look for the closing `}'. */
12155 }
12156 /* Otherwise, there's just one declaration. */
12157 else
12158 {
12161 saved_in_unbraced_linkage_specification_p
12165 parser->in_unbraced_linkage_specification_p
12167 }
12169 /* We're done with the linkage-specification. */
12171 }
12173 /* Parse a static_assert-declaration.
12175 static_assert-declaration:
12176 static_assert ( constant-expression , string-literal ) ;
12177 static_assert ( constant-expression ) ; (C++1Z)
12179 If MEMBER_P, this static_assert is a class member. */
12181 static void
12183 {
12184 tree condition;
12185 tree message;
12187 location_t saved_loc;
12190 /* Peek at the `static_assert' token so we can keep track of exactly
12191 where the static assertion started. */
12195 /* Look for the `static_assert' keyword. */
12197 RT_STATIC_ASSERT))
12200 /* We know we are in a static assertion; commit to any tentative
12201 parse. */
12205 /* Parse the `(' starting the static assertion condition. */
12208 /* Parse the constant-expression. Allow a non-constant expression
12209 here in order to give better diagnostics in finish_static_assert. */
12210 condition =
12216 {
12219 "static_assert without a message "
12221 /* Eat the ')' */
12226 }
12227 else
12228 {
12229 /* Parse the separating `,'. */
12232 /* Parse the string-literal message. */
12237 /* A `)' completes the static assertion. */
12243 }
12245 /* A semicolon terminates the declaration. */
12248 /* Complete the static assertion, which may mean either processing
12249 the static assert now or saving it for template instantiation. */
12251 }
12253 /* Parse the expression in decltype ( expression ). */
12255 static tree
12258 {
12260 tree expr;
12262 /* First, try parsing an id-expression. */
12273 {
12276 cp_id_kind idk;
12280 /* Lookup the name we got back from the id-expression. */
12290 {
12291 /* Complete lookup of the id-expression. */
12292 expr = (finish_id_expression
12305 /* We found an id-expression, but it was something that we
12306 should not have found. This is an error, not something
12307 we can recover from, so note that we found an
12308 id-expression and we'll recover as gracefully as
12309 possible. */
12311 }
12316 /* We have an id-expression. */
12318 }
12321 {
12322 /* Abort the id-expression parse. */
12325 /* Parsing tentatively, again. */
12328 /* Parse a class member access. */
12336 /* We have an id-expression. */
12338 }
12341 /* We have parsed the complete id-expression or member access. */
12343 else
12344 {
12345 /* Abort our attempt to parse an id-expression or member access
12346 expression. */
12349 /* Parse a full expression. */
12352 }
12355 }
12357 /* Parse a `decltype' type. Returns the type.
12359 simple-type-specifier:
12360 decltype ( expression )
12361 C++14 proposal:
12362 decltype ( auto ) */
12364 static tree
12366 {
12367 tree expr;
12376 {
12377 /* Already parsed. */
12380 }
12382 /* Look for the `decltype' token. */
12386 /* Parse the opening `('. */
12390 /* decltype (auto) */
12393 {
12400 }
12402 /* Types cannot be defined in a `decltype' expression. Save away the
12403 old message. */
12406 /* And create the new one. */
12407 parser->type_definition_forbidden_message
12410 /* The restrictions on constant-expressions do not apply inside
12411 decltype expressions. */
12412 saved_integral_constant_expression_p
12414 saved_non_integral_constant_expression_p
12418 /* Within a parenthesized expression, a `>' token is always
12419 the greater-than operator. */
12420 saved_greater_than_is_operator_p
12424 /* Do not actually evaluate the expression. */
12427 /* Do not warn about problems with the expression. */
12432 /* Go back to evaluating expressions. */
12436 /* The `>' token might be the end of a template-id or
12437 template-parameter-list now. */
12438 parser->greater_than_is_operator_p
12441 /* Restore the old message and the integral constant expression
12442 flags. */
12444 parser->integral_constant_expression_p
12446 parser->non_integral_constant_expression_p
12449 /* Parse to the closing `)'. */
12451 {
12455 }
12458 tf_warning_or_error);
12460 rewrite:
12461 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12462 it again. */
12469 }
12471 /* Special member functions [gram.special] */
12473 /* Parse a conversion-function-id.
12475 conversion-function-id:
12476 operator conversion-type-id
12478 Returns an IDENTIFIER_NODE representing the operator. */
12480 static tree
12482 {
12483 tree type;
12484 tree saved_scope;
12485 tree saved_qualifying_scope;
12486 tree saved_object_scope;
12489 /* Look for the `operator' token. */
12492 /* When we parse the conversion-type-id, the current scope will be
12493 reset. However, we need that information in able to look up the
12494 conversion function later, so we save it here. */
12498 /* We must enter the scope of the class so that the names of
12499 entities declared within the class are available in the
12500 conversion-type-id. For example, consider:
12502 struct S {
12503 typedef int I;
12504 operator I();
12505 };
12507 S::operator I() { ... }
12509 In order to see that `I' is a type-name in the definition, we
12510 must be in the scope of `S'. */
12513 /* Parse the conversion-type-id. */
12515 /* Leave the scope of the class, if any. */
12518 /* Restore the saved scope. */
12522 /* If the TYPE is invalid, indicate failure. */
12526 }
12528 /* Parse a conversion-type-id:
12530 conversion-type-id:
12531 type-specifier-seq conversion-declarator [opt]
12533 Returns the TYPE specified. */
12535 static tree
12537 {
12538 tree attributes;
12539 cp_decl_specifier_seq type_specifiers;
12541 tree type_specified;
12544 /* Parse the attributes. */
12548 parser->type_definition_forbidden_message
12551 /* Parse the type-specifiers. */
12558 /* If that didn't work, stop. */
12561 /* Parse the conversion-declarator. */
12569 /* Don't give this error when parsing tentatively. This happens to
12570 work because we always parse this definitively once. */
12573 {
12575 {
12578 }
12582 }
12585 }
12587 /* Parse an (optional) conversion-declarator.
12589 conversion-declarator:
12590 ptr-operator conversion-declarator [opt]
12592 */
12596 {
12599 cp_cv_quals cv_quals;
12601 /* We don't know if there's a ptr-operator next, or not. */
12603 /* Try the ptr-operator. */
12606 /* If it worked, look for more conversion-declarators. */
12608 {
12611 /* Parse another optional declarator. */
12614 declarator = cp_parser_make_indirect_declarator
12618 }
12621 }
12623 /* Parse an (optional) ctor-initializer.
12625 ctor-initializer:
12626 : mem-initializer-list
12628 Returns TRUE iff the ctor-initializer was actually present. */
12630 static bool
12632 {
12633 /* If the next token is not a `:', then there is no
12634 ctor-initializer. */
12636 {
12637 /* Do default initialization of any bases and members. */
12642 }
12644 /* Consume the `:' token. */
12646 /* And the mem-initializer-list. */
12650 }
12652 /* Parse a mem-initializer-list.
12654 mem-initializer-list:
12655 mem-initializer ... [opt]
12656 mem-initializer ... [opt] , mem-initializer-list */
12658 static void
12660 {
12665 /* Let the semantic analysis code know that we are starting the
12666 mem-initializer-list. */
12671 /* Loop through the list. */
12673 {
12674 tree mem_initializer;
12677 /* Parse the mem-initializer. */
12679 /* If the next token is a `...', we're expanding member initializers. */
12681 {
12682 /* Consume the `...'. */
12685 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12686 can be expanded but members cannot. */
12689 {
12694 }
12696 /* Construct the pack expansion type. */
12699 }
12702 {
12706 }
12707 /* Look for a target constructor. */
12711 {
12714 {
12718 }
12720 }
12721 /* Add it to the list, unless it was erroneous. */
12723 {
12726 }
12727 /* If the next token is not a `,', we're done. */
12730 /* Consume the `,' token. */
12732 }
12734 /* Perform semantic analysis. */
12737 }
12739 /* Parse a mem-initializer.
12741 mem-initializer:
12742 mem-initializer-id ( expression-list [opt] )
12743 mem-initializer-id braced-init-list
12745 GNU extension:
12747 mem-initializer:
12748 ( expression-list [opt] )
12750 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12751 class) or FIELD_DECL (for a non-static data member) to initialize;
12752 the TREE_VALUE is the expression-list. An empty initialization
12753 list is represented by void_list_node. */
12755 static tree
12757 {
12758 tree mem_initializer_id;
12759 tree expression_list;
12760 tree member;
12763 /* Find out what is being initialized. */
12765 {
12769 }
12770 else
12771 {
12775 }
12781 {
12788 }
12789 else
12790 {
12800 }
12810 }
12812 /* Parse a mem-initializer-id.
12814 mem-initializer-id:
12815 :: [opt] nested-name-specifier [opt] class-name
12816 decltype-specifier (C++11)
12817 identifier
12819 Returns a TYPE indicating the class to be initialized for the first
12820 production (and the second in C++11). Returns an IDENTIFIER_NODE
12821 indicating the data member to be initialized for the last production. */
12823 static tree
12825 {
12829 tree id;
12833 /* `typename' is not allowed in this context ([temp.res]). */
12835 {
12837 "keyword %<typename%> not allowed in this context (a qualified "
12840 }
12841 /* Look for the optional `::' operator. */
12842 global_scope_p
12846 /* Look for the optional nested-name-specifier. The simplest way to
12847 implement:
12849 [temp.res]
12851 The keyword `typename' is not permitted in a base-specifier or
12852 mem-initializer; in these contexts a qualified name that
12853 depends on a template-parameter is implicitly assumed to be a
12854 type name.
12856 is to assume that we have seen the `typename' keyword at this
12857 point. */
12858 nested_name_specifier_p
12867 /* If there is a `::' operator or a nested-name-specifier, then we
12868 are definitely looking for a class-name. */
12873 typename_type,
12877 /* Otherwise, we could also be looking for an ordinary identifier. */
12880 /* Try a decltype-specifier. */
12882 else
12883 /* Otherwise, try a class-name. */
12887 none_type,
12891 /* If we found one, we're done. */
12894 /* Otherwise, look for an ordinary identifier. */
12896 }
12898 /* Overloading [gram.over] */
12900 /* Parse an operator-function-id.
12902 operator-function-id:
12903 operator operator
12905 Returns an IDENTIFIER_NODE for the operator which is a
12906 human-readable spelling of the identifier, e.g., `operator +'. */
12908 static tree
12910 {
12911 /* Look for the `operator' keyword. */
12914 /* And then the name of the operator itself. */
12916 }
12918 /* Return an identifier node for a user-defined literal operator.
12919 The suffix identifier is chained to the operator name identifier. */
12921 static tree
12923 {
12924 tree identifier;
12931 }
12933 /* Parse an operator.
12935 operator:
12936 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12937 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12938 || ++ -- , ->* -> () []
12940 GNU Extensions:
12942 operator:
12943 <? >? <?= >?=
12945 Returns an IDENTIFIER_NODE for the operator which is a
12946 human-readable spelling of the identifier, e.g., `operator +'. */
12948 static tree
12950 {
12955 /* Peek at the next token. */
12957 /* Figure out which operator we have. */
12959 {
12961 {
12964 /* The keyword should be either `new' or `delete'. */
12969 else
12972 /* Consume the `new' or `delete' token. */
12975 /* Peek at the next token. */
12977 /* If it's a `[' token then this is the array variant of the
12978 operator. */
12980 {
12981 /* Consume the `[' token. */
12983 /* Look for the `]' token. */
12987 }
12988 /* Otherwise, we have the non-array variant. */
12989 else
12993 }
13140 /* Consume the `('. */
13142 /* Look for the matching `)'. */
13147 /* Consume the `['. */
13149 /* Look for the matching `]'. */
13164 {
13171 /* Consume the string. */
13177 {
13180 }
13181 else
13182 {
13184 /* Look for the suffix identifier. */
13189 {
13193 }
13194 else
13195 {
13198 }
13199 }
13204 {
13207 }
13210 {
13213 }
13215 {
13218 }
13220 }
13223 /* Anything else is an error. */
13225 }
13227 /* If we have selected an identifier, we need to consume the
13228 operator token. */
13231 /* Otherwise, no valid operator name was present. */
13232 else
13233 {
13236 }
13239 }
13241 /* Parse a template-declaration.
13243 template-declaration:
13244 export [opt] template < template-parameter-list > declaration
13246 If MEMBER_P is TRUE, this template-declaration occurs within a
13247 class-specifier.
13249 The grammar rule given by the standard isn't correct. What
13250 is really meant is:
13252 template-declaration:
13253 export [opt] template-parameter-list-seq
13254 decl-specifier-seq [opt] init-declarator [opt] ;
13255 export [opt] template-parameter-list-seq
13256 function-definition
13258 template-parameter-list-seq:
13259 template-parameter-list-seq [opt]
13260 template < template-parameter-list > */
13262 static void
13264 {
13265 /* Check for `export'. */
13267 {
13268 /* Consume the `export' token. */
13270 /* Warn that we do not support `export'. */
13272 }
13275 }
13277 /* Parse a template-parameter-list.
13279 template-parameter-list:
13280 template-parameter
13281 template-parameter-list , template-parameter
13283 Returns a TREE_LIST. Each node represents a template parameter.
13284 The nodes are connected via their TREE_CHAINs. */
13286 static tree
13288 {
13293 /* The loop below parses the template parms. We first need to know
13294 the total number of template parms to be able to compute proper
13295 canonical types of each dependent type. So after the loop, when
13296 we know the total number of template parms,
13297 end_template_parm_list computes the proper canonical types and
13298 fixes up the dependent types accordingly. */
13300 {
13301 tree parameter;
13304 location_t parm_loc;
13306 /* Parse the template-parameter. */
13311 /* Add it to the list. */
13314 parm_loc,
13315 parameter,
13316 is_non_type,
13317 is_parameter_pack);
13318 else
13319 {
13322 }
13324 /* If the next token is not a `,', we're done. */
13327 /* Otherwise, consume the `,' token. */
13329 }
13332 }
13334 /* Parse a template-parameter.
13336 template-parameter:
13337 type-parameter
13338 parameter-declaration
13340 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13341 the parameter. The TREE_PURPOSE is the default value, if any.
13342 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13343 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13344 set to true iff this parameter is a parameter pack. */
13346 static tree
13349 {
13353 tree parm;
13355 /* Assume it is a type parameter or a template parameter. */
13357 /* Assume it not a parameter pack. */
13359 /* Peek at the next token. */
13361 /* If it is `class' or `template', we have a type-parameter. */
13364 /* If it is `class' or `typename' we do not know yet whether it is a
13365 type parameter or a non-type parameter. Consider:
13367 template <typename T, typename T::X X> ...
13369 or:
13371 template <class C, class D*> ...
13373 Here, the first parameter is a type parameter, and the second is
13374 a non-type parameter. We can tell by looking at the token after
13375 the identifier -- if it is a `,', `=', or `>' then we have a type
13376 parameter. */
13378 {
13379 /* Peek at the token after `class' or `typename'. */
13381 /* If it's an ellipsis, we have a template type parameter
13382 pack. */
13385 /* If it's an identifier, skip it. */
13388 /* Now, see if the token looks like the end of a template
13389 parameter. */
13394 }
13396 /* Otherwise, it is a non-type parameter.
13398 [temp.param]
13400 When parsing a default template-argument for a non-type
13401 template-parameter, the first non-nested `>' is taken as the end
13402 of the template parameter-list rather than a greater-than
13403 operator. */
13405 parameter_declarator
13412 /* If the parameter declaration is marked as a parameter pack, set
13413 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13414 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13415 grokdeclarator. */
13418 {
13421 }
13424 {
13425 /* Can happen in some cases of erroneous input (c++/34892). */
13427 /* Consume the `...' for better error recovery. */
13429 }
13430 /* If the next token is an ellipsis, and we don't already have it
13431 marked as a parameter pack, then we have a parameter pack (that
13432 has no declarator). */
13435 && (declarator_can_be_parameter_pack
13437 {
13438 /* Consume the `...'. */
13443 }
13444 /* We might end up with a pack expansion as the type of the non-type
13445 template parameter, in which case this is a non-type template
13446 parameter pack. */
13449 {
13453 }
13456 {
13457 /* Parameter packs cannot have default arguments. However, a
13458 user may try to do so, so we'll parse them and give an
13459 appropriate diagnostic here. */
13463 /* Find the name of the parameter pack. */
13472 else
13476 /* Parse the default argument, but throw away the result. */
13478 }
13488 }
13490 /* Parse a type-parameter.
13492 type-parameter:
13493 class identifier [opt]
13494 class identifier [opt] = type-id
13495 typename identifier [opt]
13496 typename identifier [opt] = type-id
13497 template < template-parameter-list > class identifier [opt]
13498 template < template-parameter-list > class identifier [opt]
13499 = id-expression
13501 GNU Extension (variadic templates):
13503 type-parameter:
13504 class ... identifier [opt]
13505 typename ... identifier [opt]
13507 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13508 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13509 the declaration of the parameter.
13511 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13513 static tree
13515 {
13517 tree parameter;
13519 /* Look for a keyword to tell us what kind of parameter this is. */
13525 {
13528 {
13529 tree identifier;
13530 tree default_argument;
13532 /* If the next token is an ellipsis, we have a template
13533 argument pack. */
13535 {
13536 /* Consume the `...' token. */
13541 }
13543 /* If the next token is an identifier, then it names the
13544 parameter. */
13547 else
13550 /* Create the parameter. */
13553 /* If the next token is an `=', we have a default argument. */
13555 {
13556 /* Consume the `=' token. */
13558 /* Parse the default-argument. */
13562 /* Template parameter packs cannot have default
13563 arguments. */
13565 {
13568 "template parameter pack %qD cannot have a "
13570 else
13572 "template parameter packs cannot have "
13575 }
13579 }
13580 else
13583 /* Create the combined representation of the parameter and the
13584 default argument. */
13586 }
13590 {
13591 tree identifier;
13592 tree default_argument;
13594 /* Look for the `<'. */
13596 /* Parse the template-parameter-list. */
13598 /* Look for the `>'. */
13600 /* Look for the `class' or 'typename' keywords. */
13602 /* If the next token is an ellipsis, we have a template
13603 argument pack. */
13605 {
13606 /* Consume the `...' token. */
13611 }
13612 /* If the next token is an `=', then there is a
13613 default-argument. If the next token is a `>', we are at
13614 the end of the parameter-list. If the next token is a `,',
13615 then we are at the end of this parameter. */
13619 {
13621 /* Treat invalid names as if the parameter were nameless. */
13624 }
13625 else
13628 /* Create the template parameter. */
13630 identifier);
13632 /* If the next token is an `=', then there is a
13633 default-argument. */
13635 {
13638 /* Consume the `='. */
13640 /* Parse the id-expression. */
13642 /* save token before parsing the id-expression, for error
13643 reporting */
13645 default_argument
13653 /* If the id-expression was a template-id that refers to
13654 a template-class, we already have the declaration here,
13655 so no further lookup is needed. */
13656 ;
13657 else
13658 /* Look up the name. */
13659 default_argument
13661 none_type,
13667 /* See if the default argument is valid. */
13668 default_argument
13671 /* Template parameter packs cannot have default
13672 arguments. */
13674 {
13677 "template parameter pack %qD cannot "
13679 identifier);
13680 else
13684 }
13686 }
13687 else
13690 /* Create the combined representation of the parameter and the
13691 default argument. */
13693 }
13699 }
13702 }
13704 /* Parse a template-id.
13706 template-id:
13707 template-name < template-argument-list [opt] >
13709 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13710 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13711 returned. Otherwise, if the template-name names a function, or set
13712 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13713 names a class, returns a TYPE_DECL for the specialization.
13715 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13716 uninstantiated templates. */
13718 static tree
13724 {
13726 tree templ;
13727 tree arguments;
13728 tree template_id;
13735 /* If the next token corresponds to a template-id, there is no need
13736 to reparse it. */
13739 {
13742 /* Get the stored value. */
13744 /* Perform any access checks that were deferred. */
13747 {
13752 tf_warning_or_error);
13753 }
13754 /* Return the stored value. */
13756 }
13758 /* Avoid performing name lookup if there is no possibility of
13759 finding a template-id. */
13762 && !cp_parser_nth_token_starts_template_argument_list_p
13764 {
13767 }
13769 /* Remember where the template-id starts. */
13775 /* Parse the template-name. */
13778 check_dependency_p,
13779 is_declaration,
13780 tag_type,
13783 {
13786 }
13788 /* If we find the sequence `[:' after a template-name, it's probably
13789 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13790 parse correctly the argument list. */
13797 {
13799 /* Change `:' into `::'. */
13801 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13802 CPP_LESS. */
13805 /* Parse the arguments. */
13808 {
13809 /* If we couldn't parse an argument list, then we revert our changes
13810 and return simply an error. Maybe this is not a template-id
13811 after all. */
13816 }
13817 /* Otherwise, emit an error about the invalid digraph, but continue
13818 parsing because we got our argument list. */
13821 {
13824 "%<<:%> is an alternate spelling for %<[%>."
13827 {
13829 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13832 }
13833 }
13834 }
13835 else
13836 {
13837 /* Look for the `<' that starts the template-argument-list. */
13839 {
13842 }
13843 /* Parse the arguments. */
13845 }
13847 /* Build a representation of the specialization. */
13850 TEMPLATE_ID_EXPR,
13854 {
13856 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13857 template (rather than some instantiation thereof) only if
13858 is not nested within some other construct. For example, in
13859 "template <typename T> void f(T) { A<T>::", A<T> is just an
13860 instantiation of A. */
13863 CPP_SCOPE));
13864 template_id
13866 }
13868 {
13870 }
13871 else
13872 {
13873 /* If it's not a class-template or a template-template, it should be
13874 a function-template. */
13880 }
13882 /* If parsing tentatively, replace the sequence of tokens that makes
13883 up the template-id with a CPP_TEMPLATE_ID token. That way,
13884 should we re-parse the token stream, we will not have to repeat
13885 the effort required to do the parse, nor will we issue duplicate
13886 error messages about problems during instantiation of the
13887 template. */
13889 /* Don't do this if we had a parse error in a declarator; re-parsing
13890 might succeed if a name changes meaning (60361). */
13894 {
13897 /* Reset the contents of the START_OF_ID token. */
13899 /* Retrieve any deferred checks. Do not pop this access checks yet
13900 so the memory will not be reclaimed during token replacing below. */
13906 /* Purge all subsequent tokens. */
13909 /* ??? Can we actually assume that, if template_id ==
13910 error_mark_node, we will have issued a diagnostic to the
13911 user, as opposed to simply marking the tentative parse as
13912 failed? */
13915 }
13919 }
13921 /* Parse a template-name.
13923 template-name:
13924 identifier
13926 The standard should actually say:
13928 template-name:
13929 identifier
13930 operator-function-id
13932 A defect report has been filed about this issue.
13934 A conversion-function-id cannot be a template name because they cannot
13935 be part of a template-id. In fact, looking at this code:
13937 a.operator K<int>()
13939 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13940 It is impossible to call a templated conversion-function-id with an
13941 explicit argument list, since the only allowed template parameter is
13942 the type to which it is converting.
13944 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13945 `template' keyword, in a construction like:
13947 T::template f<3>()
13949 In that case `f' is taken to be a template-name, even though there
13950 is no way of knowing for sure.
13952 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13953 name refers to a set of overloaded functions, at least one of which
13954 is a template, or an IDENTIFIER_NODE with the name of the template,
13955 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13956 names are looked up inside uninstantiated templates. */
13958 static tree
13965 {
13966 tree identifier;
13967 tree decl;
13968 tree fns;
13971 /* If the next token is `operator', then we have either an
13972 operator-function-id or a conversion-function-id. */
13974 {
13975 /* We don't know whether we're looking at an
13976 operator-function-id or a conversion-function-id. */
13978 /* Try an operator-function-id. */
13980 /* If that didn't work, try a conversion-function-id. */
13982 {
13985 }
13986 }
13987 /* Look for the identifier. */
13988 else
13991 /* If we didn't find an identifier, we don't have a template-id. */
13995 /* If the name immediately followed the `template' keyword, then it
13996 is a template-name. However, if the next token is not `<', then
13997 we do not treat it as a template-name, since it is not being used
13998 as part of a template-id. This enables us to handle constructs
13999 like:
14001 template <typename T> struct S { S(); };
14002 template <typename T> S<T>::S();
14004 correctly. We would treat `S' as a template -- if it were `S<T>'
14005 -- but we do not if there is no `<'. */
14009 {
14010 /* In a declaration, in a dependent context, we pretend that the
14011 "template" keyword was present in order to improve error
14012 recovery. For example, given:
14014 template <typename T> void f(T::X<int>);
14016 we want to treat "X<int>" as a template-id. */
14018 && !template_keyword_p
14020 && check_dependency_p
14022 /* Do not do this for dtors (or ctors), since they never
14023 need the template keyword before their name. */
14025 {
14028 /* Explain what went wrong. */
14030 identifier);
14033 /* If parsing tentatively, find the location of the "<" token. */
14036 /* Parse the template arguments so that we can issue error
14037 messages about them. */
14040 /* Skip tokens until we find a good place from which to
14041 continue parsing. */
14046 /* If parsing tentatively, permanently remove the
14047 template argument list. That will prevent duplicate
14048 error messages from being issued about the missing
14049 "template" keyword. */
14055 }
14057 /* If the "template" keyword is present, then there is generally
14058 no point in doing name-lookup, so we just return IDENTIFIER.
14059 But, if the qualifying scope is non-dependent then we can
14060 (and must) do name-lookup normally. */
14066 }
14068 /* Look up the name. */
14070 tag_type,
14073 check_dependency_p,
14079 /* If DECL is a template, then the name was a template-name. */
14081 {
14085 }
14086 else
14087 {
14090 /* The standard does not explicitly indicate whether a name that
14091 names a set of overloaded declarations, some of which are
14092 templates, is a template-name. However, such a name should
14093 be a template-name; otherwise, there is no way to form a
14094 template-id for the overloaded templates. */
14102 {
14103 /* The name does not name a template. */
14106 }
14107 }
14109 /* If DECL is dependent, and refers to a function, then just return
14110 its name; we will look it up again during template instantiation. */
14112 {
14116 }
14119 }
14121 /* Parse a template-argument-list.
14123 template-argument-list:
14124 template-argument ... [opt]
14125 template-argument-list , template-argument ... [opt]
14127 Returns a TREE_VEC containing the arguments. */
14129 static tree
14131 {
14136 tree vec;
14143 /* Even if the template-id appears in an integral
14144 constant-expression, the contents of the argument list do
14145 not. */
14151 /* Parse the arguments. */
14152 do
14153 {
14154 tree argument;
14157 /* Consume the comma. */
14160 /* Parse the template-argument. */
14163 /* If the next token is an ellipsis, we're expanding a template
14164 argument pack. */
14166 {
14168 {
14172 }
14173 /* Consume the `...' token. */
14176 /* Make the argument into a TYPE_PACK_EXPANSION or
14177 EXPR_PACK_EXPANSION. */
14179 }
14182 {
14186 {
14189 }
14190 else
14192 }
14194 }
14207 #ifdef ENABLE_CHECKING
14209 #endif
14211 }
14213 /* Parse a template-argument.
14215 template-argument:
14216 assignment-expression
14217 type-id
14218 id-expression
14220 The representation is that of an assignment-expression, type-id, or
14221 id-expression -- except that the qualified id-expression is
14222 evaluated, so that the value returned is either a DECL or an
14223 OVERLOAD.
14225 Although the standard says "assignment-expression", it forbids
14226 throw-expressions or assignments in the template argument.
14227 Therefore, we use "conditional-expression" instead. */
14229 static tree
14231 {
14232 tree argument;
14238 cp_id_kind idk;
14240 /* There's really no way to know what we're looking at, so we just
14241 try each alternative in order.
14243 [temp.arg]
14245 In a template-argument, an ambiguity between a type-id and an
14246 expression is resolved to a type-id, regardless of the form of
14247 the corresponding template-parameter.
14249 Therefore, we try a type-id first. */
14252 /* If there was no error parsing the type-id but the next token is a
14253 '>>', our behavior depends on which dialect of C++ we're
14254 parsing. In C++98, we probably found a typo for '> >'. But there
14255 are type-id which are also valid expressions. For instance:
14257 struct X { int operator >> (int); };
14258 template <int V> struct Foo {};
14259 Foo<X () >> 5> r;
14261 Here 'X()' is a valid type-id of a function type, but the user just
14262 wanted to write the expression "X() >> 5". Thus, we remember that we
14263 found a valid type-id, but we still try to parse the argument as an
14264 expression to see what happens.
14266 In C++0x, the '>>' will be considered two separate '>'
14267 tokens. */
14271 {
14274 }
14275 else
14276 {
14277 /* If the next token isn't a `,' or a `>', then this argument wasn't
14278 really finished. This means that the argument is not a valid
14279 type-id. */
14282 /* If that worked, we're done. */
14285 }
14286 /* We're still not sure what the argument will be. */
14288 /* Try a template. */
14296 /* If the next token isn't a `,' or a `>', then this argument wasn't
14297 really finished. */
14301 {
14302 /* Figure out what is being referred to. If the id-expression
14303 was for a class template specialization, then we will have a
14304 TYPE_DECL at this point. There is no need to do name lookup
14305 at this point in that case. */
14308 none_type,
14317 }
14319 {
14323 }
14324 /* It must be a non-type argument. There permitted cases are given
14325 in [temp.arg.nontype]:
14327 -- an integral constant-expression of integral or enumeration
14328 type; or
14330 -- the name of a non-type template-parameter; or
14332 -- the name of an object or function with external linkage...
14334 -- the address of an object or function with external linkage...
14336 -- a pointer to member... */
14337 /* Look for a non-type template parameter. */
14339 {
14351 }
14353 /* If the next token is "&", the argument must be the address of an
14354 object or function with external linkage. */
14357 {
14360 }
14361 /* See if we might have an id-expression. */
14368 {
14371 address_p,
14378 else
14379 {
14380 tree probe;
14383 {
14384 /* Strip the dereference temporarily. */
14387 }
14389 /* If we're in a template, we represent a qualified-id referring
14390 to a static data member as a SCOPE_REF even if the scope isn't
14391 dependent so that we can check access control later. */
14396 {
14397 /* A variable without external linkage might still be a
14398 valid constant-expression, so no error is issued here
14399 if the external-linkage check fails. */
14402 }
14404 /* All overloaded functions are allowed; if the external
14405 linkage test does not pass, an error will be issued
14406 later. */
14407 ;
14411 /* A pointer-to-member. */
14412 ;
14414 ;
14415 else
14419 {
14422 tf_warning_or_error);
14423 else
14426 }
14427 }
14428 }
14429 /* If the argument started with "&", there are no other valid
14430 alternatives at this point. */
14432 {
14435 }
14437 /* If the argument wasn't successfully parsed as a type-id followed
14438 by '>>', the argument can only be a constant expression now.
14439 Otherwise, we try parsing the constant-expression tentatively,
14440 because the argument could really be a type-id. */
14451 /* We did our best to parse the argument as a non type-id, but that
14452 was the only alternative that matched (albeit with a '>' after
14453 it). We can assume it's just a typo from the user, and a
14454 diagnostic will then be issued. */
14456 }
14458 /* Parse an explicit-instantiation.
14460 explicit-instantiation:
14461 template declaration
14463 Although the standard says `declaration', what it really means is:
14465 explicit-instantiation:
14466 template decl-specifier-seq [opt] declarator [opt] ;
14468 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14469 supposed to be allowed. A defect report has been filed about this
14470 issue.
14472 GNU Extension:
14474 explicit-instantiation:
14475 storage-class-specifier template
14476 decl-specifier-seq [opt] declarator [opt] ;
14477 function-specifier template
14478 decl-specifier-seq [opt] declarator [opt] ; */
14480 static void
14482 {
14484 cp_decl_specifier_seq decl_specifiers;
14489 /* Look for an (optional) storage-class-specifier or
14490 function-specifier. */
14492 {
14493 extension_specifier
14496 extension_specifier
14499 }
14501 /* Look for the `template' keyword. */
14503 /* Let the front end know that we are processing an explicit
14504 instantiation. */
14506 /* [temp.explicit] says that we are supposed to ignore access
14507 control while processing explicit instantiation directives. */
14509 /* Parse a decl-specifier-seq. */
14511 CP_PARSER_FLAGS_OPTIONAL,
14514 /* If there was exactly one decl-specifier, and it declared a class,
14515 and there's no declarator, then we have an explicit type
14516 instantiation. */
14518 {
14519 tree type;
14523 /* Turn access control back on for names used during
14524 template instantiation. */
14529 }
14530 else
14531 {
14533 tree decl;
14535 /* Parse the declarator. */
14536 declarator
14547 {
14550 "explicit instantiation shall not use"
14554 "explicit instantiation shall not use"
14559 /* Turn access control back on for names used during
14560 template instantiation. */
14562 /* Do the explicit instantiation. */
14564 }
14565 else
14566 {
14568 /* Skip the body of the explicit instantiation. */
14570 }
14571 }
14572 /* We're done with the instantiation. */
14578 }
14580 /* Parse an explicit-specialization.
14582 explicit-specialization:
14583 template < > declaration
14585 Although the standard says `declaration', what it really means is:
14587 explicit-specialization:
14588 template <> decl-specifier [opt] init-declarator [opt] ;
14589 template <> function-definition
14590 template <> explicit-specialization
14591 template <> template-declaration */
14593 static void
14595 {
14599 /* Look for the `template' keyword. */
14601 /* Look for the `<'. */
14603 /* Look for the `>'. */
14605 /* We have processed another parameter list. */
14607 /* [temp]
14609 A template ... explicit specialization ... shall not have C
14610 linkage. */
14612 {
14614 /* Give it C++ linkage to avoid confusing other parts of the
14615 front end. */
14618 }
14619 else
14621 /* Let the front end know that we are beginning a specialization. */
14623 {
14626 }
14628 /* If the next keyword is `template', we need to figure out whether
14629 or not we're looking a template-declaration. */
14631 {
14636 else
14638 }
14639 else
14640 /* Parse the dependent declaration. */
14646 /* We're done with the specialization. */
14648 /* For the erroneous case of a template with C linkage, we pushed an
14649 implicit C++ linkage scope; exit that scope now. */
14652 /* We're done with this parameter list. */
14654 }
14656 /* Parse a type-specifier.
14658 type-specifier:
14659 simple-type-specifier
14660 class-specifier
14661 enum-specifier
14662 elaborated-type-specifier
14663 cv-qualifier
14665 GNU Extension:
14667 type-specifier:
14668 __complex__
14670 Returns a representation of the type-specifier. For a
14671 class-specifier, enum-specifier, or elaborated-type-specifier, a
14672 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14674 The parser flags FLAGS is used to control type-specifier parsing.
14676 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14677 in a decl-specifier-seq.
14679 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14680 class-specifier, enum-specifier, or elaborated-type-specifier, then
14681 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14682 if a type is declared; 2 if it is defined. Otherwise, it is set to
14683 zero.
14685 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14686 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14687 is set to FALSE. */
14689 static tree
14691 cp_parser_flags flags,
14696 {
14702 /* Assume this type-specifier does not declare a new type. */
14705 /* And that it does not specify a cv-qualifier. */
14708 /* Peek at the next token. */
14711 /* If we're looking at a keyword, we can use that to guide the
14712 production we choose. */
14715 {
14720 /* Look for the enum-specifier. */
14722 /* If that worked, we're done. */
14724 {
14729 type_spec,
14730 token,
14733 }
14734 else
14737 /* Any of these indicate either a class-specifier, or an
14738 elaborated-type-specifier. */
14745 /* Parse tentatively so that we can back up if we don't find a
14746 class-specifier. */
14748 /* Look for the class-specifier. */
14751 /* If that worked, we're done. */
14753 {
14758 type_spec,
14759 token,
14762 }
14764 /* Fall through. */
14765 elaborated_type_specifier:
14766 /* We're declaring (not defining) a class or enum. */
14770 /* Fall through. */
14772 /* Look for an elaborated-type-specifier. */
14773 type_spec
14774 = (cp_parser_elaborated_type_specifier
14777 is_declaration));
14780 type_spec,
14781 token,
14804 /* The `__complex__' keyword is a GNU extension. */
14810 }
14812 /* Handle simple keywords. */
14814 {
14816 {
14819 }
14821 }
14823 /* If we do not already have a type-specifier, assume we are looking
14824 at a simple-type-specifier. */
14826 decl_specs,
14827 flags);
14829 /* If we didn't find a type-specifier, and a type-specifier was not
14830 optional in this context, issue an error message. */
14832 {
14835 }
14838 }
14840 /* Parse a simple-type-specifier.
14842 simple-type-specifier:
14843 :: [opt] nested-name-specifier [opt] type-name
14844 :: [opt] nested-name-specifier template template-id
14845 char
14846 wchar_t
14847 bool
14848 short
14849 int
14850 long
14851 signed
14852 unsigned
14853 float
14854 double
14855 void
14857 C++0x Extension:
14859 simple-type-specifier:
14860 auto
14861 decltype ( expression )
14862 char16_t
14863 char32_t
14864 __underlying_type ( type-id )
14866 GNU Extension:
14868 simple-type-specifier:
14869 __int128
14870 __typeof__ unary-expression
14871 __typeof__ ( type-id )
14872 __typeof__ ( type-id ) { initializer-list , [opt] }
14874 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14875 appropriately updated. */
14877 static tree
14880 cp_parser_flags flags)
14881 {
14886 /* Peek at the next token. */
14889 /* If we're looking at a keyword, things are easy. */
14891 {
14926 {
14929 }
14958 {
14959 /* The 'auto' might be the placeholder return type for a function decl
14960 with trailing return type. */
14964 {
14972 have_trailing_return_fn_decl
14975 }
14978 {
14981 }
14985 else
14989 {
14992 "use of %<auto%> in lambda parameter declaration "
14993 "only available with "
14995 }
14998 "use of %<auto%> in parameter declaration "
14999 "only available with "
15001 else
15003 "ISO C++ forbids use of %<auto%> in parameter "
15005 }
15006 else
15011 /* Since DR 743, decltype can either be a simple-type-specifier by
15012 itself or begin a nested-name-specifier. Parsing it will replace
15013 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
15014 handling below decide what to do. */
15020 /* Consume the `typeof' token. */
15022 /* Parse the operand to `typeof'. */
15024 /* If it is not already a TYPE, take its type. */
15030 token,
15039 token,
15049 token,
15054 }
15056 /* If token is an already-parsed decltype not followed by ::,
15057 it's a simple-type-specifier. */
15060 {
15063 {
15065 token,
15067 /* Remember that we are handling a decltype in order to
15068 implement the resolution of DR 1510 when the argument
15069 isn't instantiation dependent. */
15071 }
15074 }
15076 /* If the type-specifier was for a built-in type, we're done. */
15078 {
15079 /* Record the type. */
15086 type,
15087 token,
15092 /* Consume the token. */
15098 /* There is no valid C++ program where a non-template type is
15099 followed by a "<". That usually indicates that the user thought
15100 that the type was a template. */
15105 }
15107 /* The type-specifier must be a user-defined type. */
15109 {
15113 /* Don't gobble tokens or issue error messages if this is an
15114 optional type-specifier. */
15118 /* Look for the optional `::' operator. */
15119 global_p
15123 /* Look for the nested-name specifier. */
15124 qualified_p
15132 /* If we have seen a nested-name-specifier, and the next token
15133 is `template', then we are using the template-id production. */
15136 {
15137 /* Look for the template-id. */
15141 none_type,
15143 /* If the template-id did not name a type, we are out of
15144 luck. */
15146 {
15149 }
15150 }
15151 /* Otherwise, look for a type-name. */
15152 else
15154 /* Keep track of all name-lookups performed in class scopes. */
15156 && !global_p
15157 && !qualified_p
15161 /* If it didn't work out, we don't have a TYPE. */
15167 token,
15169 }
15171 /* If we didn't get a type-name, issue an error message. */
15173 {
15176 }
15179 {
15180 /* See if TYPE is an Objective-C type, and if so, parse and
15181 accept any protocol references following it. Do this before
15182 the cp_parser_check_for_invalid_template_id() call, because
15183 Objective-C types can be followed by '<...>' which would
15184 enclose protocol names rather than template arguments, and so
15185 everything is fine. */
15188 {
15192 /* Clobber the "unqualified" type previously entered into
15193 DECL_SPECS with the new, improved protocol-qualified version. */
15198 }
15200 /* There is no valid C++ program where a non-template type is
15201 followed by a "<". That usually indicates that the user
15202 thought that the type was a template. */
15204 none_type,
15206 }
15209 }
15211 /* Parse a type-name.
15213 type-name:
15214 class-name
15215 enum-name
15216 typedef-name
15217 simple-template-id [in c++0x]
15219 enum-name:
15220 identifier
15222 typedef-name:
15223 identifier
15225 Returns a TYPE_DECL for the type. */
15227 static tree
15229 {
15230 tree type_decl;
15232 /* We can't know yet whether it is a class-name or not. */
15234 /* Try a class-name. */
15238 none_type,
15242 /* If it's not a class-name, keep looking. */
15244 {
15246 /* It must be a typedef-name or an enum-name. */
15250 /* It is either a simple-template-id representing an
15251 instantiation of an alias template... */
15255 none_type,
15257 /* Note that this must be an instantiation of an alias template
15258 because [temp.names]/6 says:
15260 A template-id that names an alias template specialization
15261 is a type-name.
15263 Whereas [temp.names]/7 says:
15265 A simple-template-id that names a class template
15266 specialization is a class-name. */
15271 else
15275 /* ... Or a typedef-name or an enum-name. */
15277 }
15280 }
15282 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
15284 enum-name:
15285 identifier
15287 typedef-name:
15288 identifier
15290 Returns a TYPE_DECL for the type. */
15292 static tree
15294 {
15295 tree type_decl;
15296 tree identifier;
15303 /* Look up the type-name. */
15310 {
15311 /* See if this is an Objective-C type. */
15316 }
15318 /* Issue an error if we did not find a type-name. */
15320 /* In Objective-C, we have the complication that class names are
15321 normally type names and start declarations (eg, the
15322 "NSObject" in "NSObject *object;"), but can be used in an
15323 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15324 is an expression. So, a classname followed by a dot is not a
15325 valid type-name. */
15328 {
15333 }
15334 /* Remember that the name was used in the definition of the
15335 current class so that we can check later to see if the
15336 meaning would have been different after the class was
15337 entirely defined. */
15343 }
15345 /* Parse an elaborated-type-specifier. Note that the grammar given
15346 here incorporates the resolution to DR68.
15348 elaborated-type-specifier:
15349 class-key :: [opt] nested-name-specifier [opt] identifier
15350 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15351 enum-key :: [opt] nested-name-specifier [opt] identifier
15352 typename :: [opt] nested-name-specifier identifier
15353 typename :: [opt] nested-name-specifier template [opt]
15354 template-id
15356 GNU extension:
15358 elaborated-type-specifier:
15359 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15360 class-key attributes :: [opt] nested-name-specifier [opt]
15361 template [opt] template-id
15362 enum attributes :: [opt] nested-name-specifier [opt] identifier
15364 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15365 declared `friend'. If IS_DECLARATION is TRUE, then this
15366 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15367 something is being declared.
15369 Returns the TYPE specified. */
15371 static tree
15375 {
15377 tree identifier;
15380 tree globalscope;
15383 /* See if we're looking at the `enum' keyword. */
15385 {
15386 /* Consume the `enum' token. */
15388 /* Remember that it's an enumeration type. */
15390 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15391 enums) is used here. */
15394 {
15398 /* Consume the `struct' or `class' and parse it anyway. */
15400 }
15401 /* Parse the attributes. */
15403 }
15404 /* Or, it might be `typename'. */
15406 RID_TYPENAME))
15407 {
15408 /* Consume the `typename' token. */
15410 /* Remember that it's a `typename' type. */
15412 }
15413 /* Otherwise it must be a class-key. */
15414 else
15415 {
15419 /* Parse the attributes. */
15421 }
15423 /* Look for the `::' operator. */
15426 /* Look for the nested-name-specifier. */
15428 {
15433 is_declaration))
15435 }
15436 else
15437 /* Even though `typename' is not present, the proposed resolution
15438 to Core Issue 180 says that in `class A<T>::B', `B' should be
15439 considered a type-name, even if `A<T>' is dependent. */
15444 is_declaration);
15445 /* For everything but enumeration types, consider a template-id.
15446 For an enumeration type, consider only a plain identifier. */
15448 {
15450 tree decl;
15452 /* Allow the `template' keyword. */
15454 /* If we didn't see `template', we don't know if there's a
15455 template-id or not. */
15458 /* Parse the template-id. */
15462 tag_type,
15463 is_declaration);
15464 /* If we didn't find a template-id, look for an ordinary
15465 identifier. */
15467 ;
15468 /* We can get here when cp_parser_template_id, called by
15469 cp_parser_class_name with tag_type == none_type, succeeds
15470 and caches a BASELINK. Then, when called again here,
15471 instead of failing and returning an error_mark_node
15472 returns it (see template/typename17.C in C++11).
15473 ??? Could we diagnose this earlier? */
15475 {
15478 }
15479 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15480 in effect, then we must assume that, upon instantiation, the
15481 template will correspond to a class. */
15485 typename_type,
15487 /* If the `typename' keyword is in effect and DECL is not a type
15488 decl, then type is non existent. */
15490 ;
15496 }
15499 {
15504 {
15507 }
15509 /* For a `typename', we needn't call xref_tag. */
15515 /* Template parameter lists apply only if we are not within a
15516 function parameter list. */
15517 bool template_parm_lists_apply
15526 /* Look up a qualified name in the usual way. */
15528 {
15529 tree decl;
15530 tree ambiguous_decls;
15533 tag_type,
15540 /* If the lookup was ambiguous, an error will already have been
15541 issued. */
15545 /* If we are parsing friend declaration, DECL may be a
15546 TEMPLATE_DECL tree node here. However, we need to check
15547 whether this TEMPLATE_DECL results in valid code. Consider
15548 the following example:
15550 namespace N {
15551 template <class T> class C {};
15552 }
15553 class X {
15554 template <class T> friend class N::C; // #1, valid code
15555 };
15556 template <class T> class Y {
15557 friend class N::C; // #2, invalid code
15558 };
15560 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15561 name lookup of `N::C'. We see that friend declaration must
15562 be template for the code to be valid. Note that
15563 processing_template_decl does not work here since it is
15564 always 1 for the above two cases. */
15566 decl = (cp_parser_maybe_treat_template_as_class
15571 {
15573 identifier,
15576 }
15579 {
15583 allow_template);
15587 }
15589 /* Forward declarations of nested types, such as
15591 class C1::C2;
15592 class C1::C2::C3;
15594 are invalid unless all components preceding the final '::'
15595 are complete. If all enclosing types are complete, these
15596 declarations become merely pointless.
15598 Invalid forward declarations of nested types are errors
15599 caught elsewhere in parsing. Those that are pointless arrive
15600 here. */
15607 }
15608 else
15609 {
15610 /* An elaborated-type-specifier sometimes introduces a new type and
15611 sometimes names an existing type. Normally, the rule is that it
15612 introduces a new type only if there is not an existing type of
15613 the same name already in scope. For example, given:
15615 struct S {};
15616 void f() { struct S s; }
15618 the `struct S' in the body of `f' is the same `struct S' as in
15619 the global scope; the existing definition is used. However, if
15620 there were no global declaration, this would introduce a new
15621 local class named `S'.
15623 An exception to this rule applies to the following code:
15625 namespace N { struct S; }
15627 Here, the elaborated-type-specifier names a new type
15628 unconditionally; even if there is already an `S' in the
15629 containing scope this declaration names a new type.
15630 This exception only applies if the elaborated-type-specifier
15631 forms the complete declaration:
15633 [class.name]
15635 A declaration consisting solely of `class-key identifier ;' is
15636 either a redeclaration of the name in the current scope or a
15637 forward declaration of the identifier as a class name. It
15638 introduces the name into the current scope.
15640 We are in this situation precisely when the next token is a `;'.
15642 An exception to the exception is that a `friend' declaration does
15643 *not* name a new type; i.e., given:
15645 struct S { friend struct T; };
15647 `T' is not a new type in the scope of `S'.
15649 Also, `new struct S' or `sizeof (struct S)' never results in the
15650 definition of a new type; a new type can only be declared in a
15651 declaration context. */
15653 tag_scope ts;
15657 /* Friends have special name lookup rules. */
15661 CPP_SEMICOLON))
15662 /* This is a `class-key identifier ;' */
15664 else
15667 template_p =
15668 (template_parm_lists_apply
15671 /* An unqualified name was used to reference this type, so
15672 there were no qualifying templates. */
15680 }
15681 }
15686 /* Allow attributes on forward declarations of classes. */
15688 {
15698 else
15701 }
15704 {
15705 /* Indicate whether this class was declared as a `class' or as a
15706 `struct'. */
15710 }
15712 /* A "<" cannot follow an elaborated type specifier. If that
15713 happens, the user was probably trying to form a template-id. */
15718 }
15720 /* Parse an enum-specifier.
15722 enum-specifier:
15723 enum-head { enumerator-list [opt] }
15724 enum-head { enumerator-list , } [C++0x]
15726 enum-head:
15727 enum-key identifier [opt] enum-base [opt]
15728 enum-key nested-name-specifier identifier enum-base [opt]
15730 enum-key:
15731 enum
15732 enum class [C++0x]
15733 enum struct [C++0x]
15735 enum-base: [C++0x]
15736 : type-specifier-seq
15738 opaque-enum-specifier:
15739 enum-key identifier enum-base [opt] ;
15741 GNU Extensions:
15742 enum-key attributes[opt] identifier [opt] enum-base [opt]
15743 { enumerator-list [opt] }attributes[opt]
15744 enum-key attributes[opt] identifier [opt] enum-base [opt]
15745 { enumerator-list, }attributes[opt] [C++0x]
15747 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15748 if the token stream isn't an enum-specifier after all. */
15750 static tree
15752 {
15753 tree identifier;
15755 tree prev_scope;
15757 tree attributes;
15770 /* Parse tentatively so that we can back up if we don't find a
15771 enum-specifier. */
15774 /* Caller guarantees that the current token is 'enum', an identifier
15775 possibly follows, and the token after that is an opening brace.
15776 If we don't have an identifier, fabricate an anonymous name for
15777 the enumeration being defined. */
15780 /* Parse the "class" or "struct", which indicates a scoped
15781 enumeration type in C++0x. */
15784 {
15788 /* Consume the `struct' or `class' token. */
15792 }
15796 /* Clear the qualification. */
15801 /* Figure out in what scope the declaration is being placed. */
15807 nested_name_specifier
15815 {
15816 tree name;
15820 enum_type,
15825 input_location);
15827 {
15830 {
15831 /* Are template enums allowed in ISO? */
15835 /* ignore a typename reference, for it will be solved by name
15836 in start_enum. */
15838 }
15839 }
15842 else
15845 }
15846 else
15847 {
15850 else
15851 {
15857 }
15858 }
15861 /* Check for the `:' that denotes a specified underlying type in C++0x.
15862 Note that a ':' could also indicate a bitfield width, however. */
15864 {
15865 cp_decl_specifier_seq type_specifiers;
15867 /* Consume the `:'. */
15870 /* Parse the type-specifier-seq. */
15875 /* At this point this is surely not elaborated type specifier. */
15884 /* If that didn't work, stop. */
15886 {
15892 }
15893 }
15895 /* Look for the `{' but don't consume it yet. */
15897 {
15899 {
15902 {
15905 }
15906 }
15907 /* An opaque-enum-specifier must have a ';' here. */
15910 {
15913 {
15916 }
15917 }
15918 }
15924 {
15926 {
15930 }
15932 {
15934 }
15935 }
15937 /* Issue an error message if type-definitions are forbidden here. */
15940 else
15941 /* Create the new type. We do this before consuming the opening
15942 brace so the enum will be recorded as being on the line of its
15943 tag (or the 'enum' keyword, if there is no tag). */
15947 /* If the next token is not '{' it is an opaque-enum-specifier or an
15948 elaborated-type-specifier. */
15950 {
15954 {
15955 /* The following catches invalid code such as:
15956 enum class S<int>::E { A, B, C }; */
15964 {
15968 nested_name_specifier);
15970 }
15971 /* If that scope does not contain the scope in which the
15972 class was originally declared, the program is invalid. */
15974 nested_name_specifier))
15975 {
15978 "declaration of %qD in namespace %qD which does not "
15981 else
15983 "declaration of %qD in %qD which does not "
15987 }
15988 }
15993 /* Consume the opening brace. */
16000 {
16004 }
16005 else
16006 {
16012 }
16016 /* If the next token is not '}', then there are some enumerators. */
16018 {
16022 }
16023 else
16026 /* Consume the final '}'. */
16032 }
16033 else
16034 {
16035 /* If a ';' follows, then it is an opaque-enum-specifier
16036 and additional restrictions apply. */
16038 {
16045 }
16046 }
16048 /* Look for trailing attributes to apply to this enumeration, and
16049 apply them if appropriate. */
16051 {
16055 trailing_attr,
16057 }
16059 /* Finish up the enumeration. */
16061 {
16066 }
16069 {
16071 {
16074 }
16076 {
16078 }
16079 }
16080 out:
16083 }
16085 /* Parse an enumerator-list. The enumerators all have the indicated
16086 TYPE.
16088 enumerator-list:
16089 enumerator-definition
16090 enumerator-list , enumerator-definition */
16092 static void
16094 {
16096 {
16097 /* Parse an enumerator-definition. */
16100 /* If the next token is not a ',', we've reached the end of
16101 the list. */
16104 /* Otherwise, consume the `,' and keep going. */
16106 /* If the next token is a `}', there is a trailing comma. */
16108 {
16113 }
16114 }
16115 }
16117 /* Parse an enumerator-definition. The enumerator has the indicated
16118 TYPE.
16120 enumerator-definition:
16121 enumerator
16122 enumerator = constant-expression
16124 enumerator:
16125 identifier
16127 GNU Extensions:
16129 enumerator-definition:
16130 enumerator attributes [opt]
16131 enumerator attributes [opt] = constant-expression */
16133 static void
16135 {
16136 tree identifier;
16137 tree value;
16138 location_t loc;
16140 /* Save the input location because we are interested in the location
16141 of the identifier and not the location of the explicit value. */
16144 /* Look for the identifier. */
16149 /* Parse any specified attributes. */
16152 /* If the next token is an '=', then there is an explicit value. */
16154 {
16155 /* Consume the `=' token. */
16157 /* Parse the value. */
16159 }
16160 else
16163 /* If we are processing a template, make sure the initializer of the
16164 enumerator doesn't contain any bare template parameter pack. */
16168 /* Create the enumerator. */
16170 }
16172 /* Parse a namespace-name.
16174 namespace-name:
16175 original-namespace-name
16176 namespace-alias
16178 Returns the NAMESPACE_DECL for the namespace. */
16180 static tree
16182 {
16183 tree identifier;
16184 tree namespace_decl;
16188 /* Get the name of the namespace. */
16193 /* Look up the identifier in the currently active scope. Look only
16194 for namespaces, due to:
16196 [basic.lookup.udir]
16198 When looking up a namespace-name in a using-directive or alias
16199 definition, only namespace names are considered.
16201 And:
16203 [basic.lookup.qual]
16205 During the lookup of a name preceding the :: scope resolution
16206 operator, object, function, and enumerator names are ignored.
16208 (Note that cp_parser_qualifying_entity only calls this
16209 function if the token after the name is the scope resolution
16210 operator.) */
16212 none_type,
16218 /* If it's not a namespace, issue an error. */
16221 {
16226 }
16229 }
16231 /* Parse a namespace-definition.
16233 namespace-definition:
16234 named-namespace-definition
16235 unnamed-namespace-definition
16237 named-namespace-definition:
16238 original-namespace-definition
16239 extension-namespace-definition
16241 original-namespace-definition:
16242 namespace identifier { namespace-body }
16244 extension-namespace-definition:
16245 namespace original-namespace-name { namespace-body }
16247 unnamed-namespace-definition:
16248 namespace { namespace-body } */
16250 static void
16252 {
16259 {
16263 }
16264 else
16267 /* Look for the `namespace' keyword. */
16270 /* Get the name of the namespace. We do not attempt to distinguish
16271 between an original-namespace-definition and an
16272 extension-namespace-definition at this point. The semantic
16273 analysis routines are responsible for that. */
16276 else
16279 /* Parse any specified attributes. */
16282 /* Look for the `{' to start the namespace. */
16284 /* Start the namespace. */
16287 /* "inline namespace" is equivalent to a stub namespace definition
16288 followed by a strong using directive. */
16290 {
16292 /* Set up namespace association. */
16296 /* Import the contents of the inline namespace. */
16300 }
16304 /* Parse the body of the namespace. */
16310 /* Finish the namespace. */
16312 /* Look for the final `}'. */
16314 }
16316 /* Parse a namespace-body.
16318 namespace-body:
16319 declaration-seq [opt] */
16321 static void
16323 {
16325 }
16327 /* Parse a namespace-alias-definition.
16329 namespace-alias-definition:
16330 namespace identifier = qualified-namespace-specifier ; */
16332 static void
16334 {
16335 tree identifier;
16336 tree namespace_specifier;
16340 /* Look for the `namespace' keyword. */
16342 /* Look for the identifier. */
16346 /* Look for the `=' token. */
16349 {
16351 /* Skip the definition. */
16356 }
16358 /* Look for the qualified-namespace-specifier. */
16359 namespace_specifier
16361 /* Look for the `;' token. */
16364 /* Register the alias in the symbol table. */
16366 }
16368 /* Parse a qualified-namespace-specifier.
16370 qualified-namespace-specifier:
16371 :: [opt] nested-name-specifier [opt] namespace-name
16373 Returns a NAMESPACE_DECL corresponding to the specified
16374 namespace. */
16376 static tree
16378 {
16379 /* Look for the optional `::'. */
16383 /* Look for the optional nested-name-specifier. */
16391 }
16393 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16394 access declaration.
16396 using-declaration:
16397 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16398 using :: unqualified-id ;
16400 access-declaration:
16401 qualified-id ;
16403 */
16405 static bool
16408 {
16412 tree decl;
16413 tree identifier;
16414 tree qscope;
16419 {
16422 }
16423 else
16424 {
16425 /* Look for the `using' keyword. */
16428 /* Peek at the next token. */
16430 /* See if it's `typename'. */
16432 {
16433 /* Remember that we've seen it. */
16435 /* Consume the `typename' token. */
16437 }
16438 }
16440 /* Look for the optional global scope qualification. */
16441 global_scope_p
16446 /* If we saw `typename', or didn't see `::', then there must be a
16447 nested-name-specifier present. */
16449 {
16455 {
16458 }
16459 }
16460 /* Otherwise, we could be in either of the two productions. In that
16461 case, treat the nested-name-specifier as optional. */
16462 else
16474 /* Something has already gone wrong; there's no need to parse
16475 further. Since an error has occurred, the return value of
16476 cp_parser_parse_definitely will be false, as required. */
16480 /* Parse the unqualified-id. */
16488 {
16493 }
16495 /* The function we call to handle a using-declaration is different
16496 depending on what scope we are in. */
16498 ;
16501 /* [namespace.udecl]
16503 A using declaration shall not name a template-id. */
16506 else
16507 {
16509 {
16510 /* Create the USING_DECL. */
16517 {
16520 }
16521 else
16522 /* Add it to the list of members in this class. */
16524 }
16525 else
16526 {
16528 identifier,
16535 {
16538 }
16541 else
16543 }
16544 }
16546 /* Look for the final `;'. */
16551 "access declarations are deprecated "
16552 "in favour of using-declarations; "
16556 }
16558 /* Parse an alias-declaration.
16560 alias-declaration:
16561 using identifier attribute-specifier-seq [opt] = type-id */
16563 static tree
16565 {
16567 location_t id_location;
16569 cp_decl_specifier_seq decl_specs;
16573 /* Look for the `using' keyword. */
16574 cp_token *using_token
16596 /* Now we are going to parse the type-id of the declaration. */
16598 /*
16599 [dcl.type]/3 says:
16601 "A type-specifier-seq shall not define a class or enumeration
16602 unless it appears in the type-id of an alias-declaration (7.1.3) that
16603 is not the declaration of a template-declaration."
16605 In other words, if we currently are in an alias template, the
16606 type-id should not define a type.
16608 So let's set parser->type_definition_forbidden_message in that
16609 case; cp_parser_check_type_definition (called by
16610 cp_parser_class_specifier) will then emit an error if a type is
16611 defined in the type-id. */
16613 {
16617 }
16621 /* Restore the error message if need be. */
16627 {
16630 }
16632 /* A typedef-name can also be introduced by an alias-declaration. The
16633 identifier following the using keyword becomes a typedef-name. It has
16634 the same semantics as if it were introduced by the typedef
16635 specifier. In particular, it does not define a new type and it shall
16636 not appear in the type-id. */
16641 {
16644 ds_attribute,
16645 attrs_token);
16646 }
16648 ds_typedef,
16649 using_token);
16651 ds_alias,
16652 using_token);
16661 else
16672 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16673 added into the symbol table; otherwise, return the TYPE_DECL. */
16677 {
16681 }
16684 }
16686 /* Parse a using-directive.
16688 using-directive:
16689 using namespace :: [opt] nested-name-specifier [opt]
16690 namespace-name ; */
16692 static void
16694 {
16695 tree namespace_decl;
16696 tree attribs;
16698 /* Look for the `using' keyword. */
16700 /* And the `namespace' keyword. */
16702 /* Look for the optional `::' operator. */
16704 /* And the optional nested-name-specifier. */
16710 /* Get the namespace being used. */
16712 /* And any specified attributes. */
16714 /* Update the symbol table. */
16716 /* Look for the final `;'. */
16718 }
16720 /* Parse an asm-definition.
16722 asm-definition:
16723 asm ( string-literal ) ;
16725 GNU Extension:
16727 asm-definition:
16728 asm volatile [opt] ( string-literal ) ;
16729 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16730 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16731 : asm-operand-list [opt] ) ;
16732 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16733 : asm-operand-list [opt]
16734 : asm-clobber-list [opt] ) ;
16735 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16736 : asm-clobber-list [opt]
16737 : asm-goto-list ) ; */
16739 static void
16741 {
16742 tree string;
16747 tree asm_stmt;
16755 /* Look for the `asm' keyword. */
16760 {
16763 }
16765 /* See if the next token is `volatile'. */
16768 {
16769 /* Remember that we saw the `volatile' keyword. */
16771 /* Consume the token. */
16773 }
16777 {
16778 /* Remember that we saw the `goto' keyword. */
16780 /* Consume the token. */
16782 }
16783 /* Look for the opening `('. */
16786 /* Look for the string. */
16789 {
16793 }
16795 /* If we're allowing GNU extensions, check for the extended assembly
16796 syntax. Unfortunately, the `:' tokens need not be separated by
16797 a space in C, and so, for compatibility, we tolerate that here
16798 too. Doing that means that we have to treat the `::' operator as
16799 two `:' tokens. */
16804 {
16809 /* The extended syntax was used. */
16812 /* Look for outputs. */
16814 {
16815 /* Consume the `:'. */
16817 /* Parse the output-operands. */
16819 CPP_COLON)
16821 CPP_SCOPE)
16823 CPP_CLOSE_PAREN)
16825 {
16829 }
16830 }
16831 /* If the next token is `::', there are no outputs, and the
16832 next token is the beginning of the inputs. */
16834 /* The inputs are coming next. */
16837 /* Look for inputs. */
16840 {
16841 /* Consume the `:' or `::'. */
16843 /* Parse the output-operands. */
16845 CPP_COLON)
16847 CPP_SCOPE)
16849 CPP_CLOSE_PAREN))
16850 {
16854 }
16855 }
16857 /* The clobbers are coming next. */
16860 /* Look for clobbers. */
16863 {
16865 /* Consume the `:' or `::'. */
16867 /* Parse the clobbers. */
16869 CPP_COLON)
16871 CPP_CLOSE_PAREN))
16873 }
16876 /* The labels are coming next. */
16879 /* Look for labels. */
16882 {
16884 /* Consume the `:' or `::'. */
16886 /* Parse the labels. */
16888 }
16892 }
16896 /* Look for the closing `)'. */
16904 {
16905 /* Create the ASM_EXPR. */
16907 {
16910 /* If the extended syntax was not used, mark the ASM_EXPR. */
16912 {
16918 }
16919 }
16920 else
16922 }
16923 }
16925 /* Declarators [gram.dcl.decl] */
16927 /* Parse an init-declarator.
16929 init-declarator:
16930 declarator initializer [opt]
16932 GNU Extension:
16934 init-declarator:
16935 declarator asm-specification [opt] attributes [opt] initializer [opt]
16937 function-definition:
16938 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16939 function-body
16940 decl-specifier-seq [opt] declarator function-try-block
16942 GNU Extension:
16944 function-definition:
16945 __extension__ function-definition
16947 TM Extension:
16949 function-definition:
16950 decl-specifier-seq [opt] declarator function-transaction-block
16952 The DECL_SPECIFIERS apply to this declarator. Returns a
16953 representation of the entity declared. If MEMBER_P is TRUE, then
16954 this declarator appears in a class scope. The new DECL created by
16955 this declarator is returned.
16957 The CHECKS are access checks that should be performed once we know
16958 what entity is being declared (and, therefore, what classes have
16959 befriended it).
16961 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16962 for a function-definition here as well. If the declarator is a
16963 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16964 be TRUE upon return. By that point, the function-definition will
16965 have been completely parsed.
16967 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16968 is FALSE.
16970 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16971 parsed declaration if it is an uninitialized single declarator not followed
16972 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16973 if present, will not be consumed. If returned, this declarator will be
16974 created with SD_INITIALIZED but will not call cp_finish_decl.
16976 If INIT_LOC is not NULL, and *INIT_LOC is equal to UNKNOWN_LOCATION,
16977 and there is an initializer, the pointed location_t is set to the
16978 location of the '=' or `(', or '{' in C++11 token introducing the
16979 initializer. */
16981 static tree
16991 {
16995 tree prefix_attributes;
16997 tree asm_specification;
16998 tree initializer;
17000 tree scope;
17002 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
17003 initialized with "= ..", CPP_OPEN_PAREN if initialized with
17004 "(...)". */
17015 /* Gather the attributes that were provided with the
17016 decl-specifiers. */
17019 /* Assume that this is not the declarator for a function
17020 definition. */
17024 /* Default arguments are only permitted for function parameters. */
17028 /* Defer access checks while parsing the declarator; we cannot know
17029 what names are accessible until we know what is being
17030 declared. */
17033 /* Parse the declarator. */
17035 declarator
17040 /* Gather up the deferred checks. */
17045 /* If the DECLARATOR was erroneous, there's no need to go
17046 further. */
17050 /* Check that the number of template-parameter-lists is OK. */
17060 /* Figure out what scope the entity declared by the DECLARATOR is
17061 located in. `grokdeclarator' sometimes changes the scope, so
17062 we compute it now. */
17065 /* Perform any lookups in the declared type which were thought to be
17066 dependent, but are not in the scope of the declarator. */
17067 decl_specifiers->type
17070 /* If we're allowing GNU extensions, look for an
17071 asm-specification. */
17073 {
17074 /* Look for an asm-specification. */
17077 }
17078 else
17081 /* Look for attributes. */
17085 /* Peek at the next token. */
17091 {
17092 /* Check to see if the token indicates the start of a
17093 function-definition. */
17095 {
17097 {
17098 /* If a function-definition should not appear here, issue an
17099 error message. */
17103 }
17105 location_t func_brace_location
17108 /* Neither attributes nor an asm-specification are allowed
17109 on a function-definition. */
17112 "an asm-specification is not allowed "
17116 "attributes are not allowed "
17118 /* This is a function-definition. */
17121 /* Parse the function definition. */
17124 decl_specifiers,
17125 declarator,
17126 prefix_attributes);
17127 else
17128 decl =
17129 (cp_parser_function_definition_from_specifiers_and_declarator
17133 {
17134 /* This is where the prologue starts... */
17137 }
17140 }
17141 }
17143 {
17144 /* A non-template declaration involving a function parameter list
17145 containing an implicit template parameter will be made into a
17146 template. If the resulting declaration is not going to be an
17147 actual function then finish the template scope here to prevent it.
17148 An error message will be issued once we have a decl to talk about.
17150 FIXME probably we should do type deduction rather than create an
17151 implicit template, but the standard currently doesn't allow it. */
17154 }
17156 /* [dcl.dcl]
17158 Only in function declarations for constructors, destructors, and
17159 type conversions can the decl-specifier-seq be omitted.
17161 We explicitly postpone this check past the point where we handle
17162 function-definitions because we tolerate function-definitions
17163 that are missing their return types in some modes. */
17165 {
17169 }
17171 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
17175 {
17186 {
17192 }
17193 }
17194 else
17195 {
17196 /* If the init-declarator isn't initialized and isn't followed by a
17197 `,' or `;', it's not a valid init-declarator. */
17200 {
17203 else
17204 {
17208 }
17209 }
17212 }
17214 /* Because start_decl has side-effects, we should only call it if we
17215 know we're going ahead. By this point, we know that we cannot
17216 possibly be looking at any other construct. */
17219 /* Enter the newly declared entry in the symbol table. If we're
17220 processing a declaration in a class-specifier, we wait until
17221 after processing the initializer. */
17223 {
17230 /* Adjust location of decl if declarator->id_loc is more appropriate:
17231 set, and decl wasn't merged with another decl, in which case its
17232 location would be different from input_location, and more accurate. */
17237 }
17239 /* Enter the SCOPE. That way unqualified names appearing in the
17240 initializer will be looked up in SCOPE. */
17243 /* Perform deferred access control checks, now that we know in which
17244 SCOPE the declared entity resides. */
17246 {
17249 /* If the entity being declared is a function, pretend that we
17250 are in its scope. If it is a `friend', it may have access to
17251 things that would not otherwise be accessible. */
17253 {
17256 }
17258 /* Perform access checks for template parameters. */
17261 /* Perform the access control checks for the declarator and the
17262 decl-specifiers. */
17265 /* Restore the saved value. */
17268 }
17270 /* Parse the initializer. */
17275 {
17277 {
17280 else
17281 {
17282 /* If the declaration was erroneous, we don't really
17283 know what the user intended, so just silently
17284 consume the initializer. */
17291 }
17292 }
17293 else
17294 {
17295 /* We want to record the extra mangling scope for in-class
17296 initializers of class members and initializers of static data
17297 member templates. The former involves deferring
17298 parsing of the initializer until end of class as with default
17299 arguments. So right here we only handle the latter. */
17309 }
17310 }
17312 /* The old parser allows attributes to appear after a parenthesized
17313 initializer. Mark Mitchell proposed removing this functionality
17314 on the GCC mailing lists on 2002-08-13. This parser accepts the
17315 attributes -- but ignores them. */
17322 /* And now complain about a non-function implicit template. */
17327 /* For an in-class declaration, use `grokfield' to create the
17328 declaration. */
17330 {
17332 {
17335 }
17343 }
17345 /* Finish processing the declaration. But, skip member
17346 declarations. */
17348 {
17351 asm_specification,
17352 /* If the initializer is in parentheses, then this is
17353 a direct-initialization, which means that an
17354 `explicit' constructor is OK. Otherwise, an
17355 `explicit' constructor cannot be used. */
17358 }
17361 /* Core issue #226 (C++0x only): A default template-argument
17362 shall not be specified in a friend class template
17363 declaration. */
17372 {
17375 else
17377 }
17380 }
17382 /* Parse a declarator.
17384 declarator:
17385 direct-declarator
17386 ptr-operator declarator
17388 abstract-declarator:
17389 ptr-operator abstract-declarator [opt]
17390 direct-abstract-declarator
17392 GNU Extensions:
17394 declarator:
17395 attributes [opt] direct-declarator
17396 attributes [opt] ptr-operator declarator
17398 abstract-declarator:
17399 attributes [opt] ptr-operator abstract-declarator [opt]
17400 attributes [opt] direct-abstract-declarator
17402 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17403 detect constructor, destructor or conversion operators. It is set
17404 to -1 if the declarator is a name, and +1 if it is a
17405 function. Otherwise it is set to zero. Usually you just want to
17406 test for >0, but internally the negative value is used.
17408 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17409 a decl-specifier-seq unless it declares a constructor, destructor,
17410 or conversion. It might seem that we could check this condition in
17411 semantic analysis, rather than parsing, but that makes it difficult
17412 to handle something like `f()'. We want to notice that there are
17413 no decl-specifiers, and therefore realize that this is an
17414 expression, not a declaration.)
17416 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17417 the declarator is a direct-declarator of the form "(...)".
17419 MEMBER_P is true iff this declarator is a member-declarator.
17421 FRIEND_P is true iff this declarator is a friend. */
17425 cp_parser_declarator_kind dcl_kind,
17429 {
17432 cp_cv_quals cv_quals;
17433 tree class_type;
17436 /* Assume this is not a constructor, destructor, or type-conversion
17437 operator. */
17444 /* Check for the ptr-operator production. */
17446 /* Parse the ptr-operator. */
17452 /* If that worked, then we have a ptr-operator. */
17454 {
17455 /* If a ptr-operator was found, then this declarator was not
17456 parenthesized. */
17459 /* The dependent declarator is optional if we are parsing an
17460 abstract-declarator. */
17464 /* Parse the dependent declarator. */
17469 friend_p);
17471 /* If we are parsing an abstract-declarator, we must handle the
17472 case where the dependent declarator is absent. */
17477 declarator = cp_parser_make_indirect_declarator
17479 }
17480 /* Everything else is a direct-declarator. */
17481 else
17482 {
17485 CPP_OPEN_PAREN);
17487 ctor_dtor_or_conv_p,
17489 }
17494 }
17496 /* Parse a direct-declarator or direct-abstract-declarator.
17498 direct-declarator:
17499 declarator-id
17500 direct-declarator ( parameter-declaration-clause )
17501 cv-qualifier-seq [opt]
17502 ref-qualifier [opt]
17503 exception-specification [opt]
17504 direct-declarator [ constant-expression [opt] ]
17505 ( declarator )
17507 direct-abstract-declarator:
17508 direct-abstract-declarator [opt]
17509 ( parameter-declaration-clause )
17510 cv-qualifier-seq [opt]
17511 ref-qualifier [opt]
17512 exception-specification [opt]
17513 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17514 ( abstract-declarator )
17516 Returns a representation of the declarator. DCL_KIND is
17517 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17518 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17519 we are parsing a direct-declarator. It is
17520 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17521 of ambiguity we prefer an abstract declarator, as per
17522 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P, MEMBER_P, and FRIEND_P are
17523 as for cp_parser_declarator. */
17527 cp_parser_declarator_kind dcl_kind,
17530 {
17540 {
17541 /* Peek at the next token. */
17544 {
17545 /* This is either a parameter-declaration-clause, or a
17546 parenthesized declarator. When we know we are parsing a
17547 named declarator, it must be a parenthesized declarator
17548 if FIRST is true. For instance, `(int)' is a
17549 parameter-declaration-clause, with an omitted
17550 direct-abstract-declarator. But `((*))', is a
17551 parenthesized abstract declarator. Finally, when T is a
17552 template parameter `(T)' is a
17553 parameter-declaration-clause, and not a parenthesized
17554 named declarator.
17556 We first try and parse a parameter-declaration-clause,
17557 and then try a nested declarator (if FIRST is true).
17559 It is not an error for it not to be a
17560 parameter-declaration-clause, even when FIRST is
17561 false. Consider,
17563 int i (int);
17564 int i (3);
17566 The first is the declaration of a function while the
17567 second is the definition of a variable, including its
17568 initializer.
17570 Having seen only the parenthesis, we cannot know which of
17571 these two alternatives should be selected. Even more
17572 complex are examples like:
17574 int i (int (a));
17575 int i (int (3));
17577 The former is a function-declaration; the latter is a
17578 variable initialization.
17580 Thus again, we try a parameter-declaration-clause, and if
17581 that fails, we back out and return. */
17584 {
17585 tree params;
17588 /* In a member-declarator, the only valid interpretation
17589 of a parenthesis is the start of a
17590 parameter-declaration-clause. (It is invalid to
17591 initialize a static data member with a parenthesized
17592 initializer; only the "=" form of initialization is
17593 permitted.) */
17597 /* Consume the `('. */
17600 {
17601 /* If this is going to be an abstract declarator, we're
17602 in a declarator and we can't have default args. */
17605 }
17609 /* Parse the parameter-declaration-clause. */
17612 /* Consume the `)'. */
17615 /* If all went well, parse the cv-qualifier-seq,
17616 ref-qualifier and the exception-specification. */
17618 {
17619 cp_cv_quals cv_quals;
17620 cp_virt_specifiers virt_specifiers;
17621 cp_ref_qualifier ref_qual;
17622 tree exception_specification;
17623 tree late_return;
17624 tree attrs;
17634 /* Parse the cv-qualifier-seq. */
17636 /* Parse the ref-qualifier. */
17638 /* And the exception-specification. */
17639 exception_specification
17644 /* In here, we handle cases where attribute is used after
17645 the function declaration. For example:
17646 void func (int x) __attribute__((vector(..))); */
17649 {
17653 CPP_SEMICOLON)
17655 CPP_OPEN_BRACE))
17658 ;
17659 else
17661 }
17662 late_return = (cp_parser_late_return_type_opt
17667 /* Parse the virt-specifier-seq. */
17670 /* Create the function-declarator. */
17672 params,
17673 cv_quals,
17674 virt_specifiers,
17675 ref_qual,
17676 exception_specification,
17677 late_return);
17679 /* Any subsequent parameter lists are to do with
17680 return type, so are not those of the declared
17681 function. */
17683 }
17685 /* Remove the function parms from scope. */
17689 /* Repeat the main loop. */
17691 }
17693 /* If this is the first, we can try a parenthesized
17694 declarator. */
17696 {
17702 /* Consume the `('. */
17704 /* Parse the nested declarator. */
17707 declarator
17713 /* Expect a `)'. */
17720 }
17721 /* Otherwise, we must be done. */
17722 else
17724 }
17728 {
17729 /* Parse an array-declarator. */
17738 /* Consume the `['. */
17740 /* Peek at the next token. */
17742 /* If the next token is `]', then there is no
17743 constant-expression. */
17745 {
17747 bounds
17757 {
17758 /* Normally, the array bound must be an integral constant
17759 expression. However, as an extension, we allow VLAs
17760 in function scopes as long as they aren't part of a
17761 parameter declaration. */
17765 }
17768 {
17769 /* Remember this wasn't a constant-expression. */
17772 }
17773 }
17774 else
17776 /* Look for the closing `]'. */
17778 {
17781 }
17786 }
17788 {
17789 {
17790 tree qualifying_scope;
17791 tree unqualified_name;
17792 tree attrs;
17793 special_function_kind sfk;
17798 /* Parse a declarator-id */
17801 {
17804 /* If we see an ellipsis, we should be looking at a
17805 parameter pack. */
17807 {
17808 /* Consume the `...' */
17812 }
17813 }
17816 unqualified_name
17820 {
17824 {
17825 /* Check whether an error occurred. */
17828 /* We already consumed the ellipsis to mark a
17829 parameter pack, but we have no way to report it,
17830 so abort the tentative parse. We will be exiting
17831 immediately anyway. */
17833 }
17834 else
17840 && (qualifying_scope
17842 {
17845 }
17846 }
17851 {
17856 }
17862 {
17863 /* In the declaration of a member of a template class
17864 outside of the class itself, the SCOPE will sometimes
17865 be a TYPENAME_TYPE. For example, given:
17867 template <typename T>
17868 int S<T>::R::i = 3;
17870 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17871 this context, we must resolve S<T>::R to an ordinary
17872 type, rather than a typename type.
17874 The reason we normally avoid resolving TYPENAME_TYPEs
17875 is that a specialization of `S' might render
17876 `S<T>::R' not a type. However, if `S' is
17877 specialized, then this `i' will not be used, so there
17878 is no harm in resolving the types here. */
17879 tree type;
17881 /* Resolve the TYPENAME_TYPE. */
17884 /* If that failed, the declarator is invalid. */
17886 {
17889 "cannot define member of dependent typedef "
17891 else
17896 }
17898 }
17903 {
17904 tree class_type;
17909 else
17913 {
17916 {
17919 {
17923 "use %<%T::%D%> instead of %<%T::%D%> to "
17925 class_type,
17930 }
17931 else
17933 }
17934 else
17935 {
17936 /* We do not attempt to print the declarator
17937 here because we do not have enough
17938 information about its original syntactic
17939 form. */
17943 }
17944 }
17947 {
17953 for an anonymous type, even if the type
17954 got a name for linkage purposes. */
17956 /* Handle correctly (c++/19200):
17958 struct S {
17959 struct T{};
17960 friend void S(T);
17961 };
17963 and also:
17965 namespace N {
17966 void S();
17967 }
17969 struct S {
17970 friend void N::S();
17971 }; */
17972 && !(friend_p
17975 class_type))
17976 {
17979 }
17987 }
17988 }
17990 unqualified_name,
17991 sfk);
17998 }
18000 handle_declarator:;
18003 {
18004 /* Any names that appear after the declarator-id for a
18005 member are looked up in the containing scope. */
18007 {
18008 /* But declarations with qualified-ids can't appear in a
18009 function. */
18013 }
18015 }
18019 /* Default args are only allowed on function
18020 declarations. */
18022 else
18026 }
18027 /* We're done. */
18028 else
18030 }
18032 /* For an abstract declarator, we might wind up with nothing at this
18033 point. That's an error; the declarator is not optional. */
18037 /* If we entered a scope, we must exit it now. */
18045 }
18047 /* Parse a ptr-operator.
18049 ptr-operator:
18050 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18051 * cv-qualifier-seq [opt]
18052 &
18053 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
18054 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
18056 GNU Extension:
18058 ptr-operator:
18059 & cv-qualifier-seq [opt]
18061 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
18062 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
18063 an rvalue reference. In the case of a pointer-to-member, *TYPE is
18064 filled in with the TYPE containing the member. *CV_QUALS is
18065 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
18066 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
18067 Note that the tree codes returned by this function have nothing
18068 to do with the types of trees that will be eventually be created
18069 to represent the pointer or reference type being parsed. They are
18070 just constants with suggestive names. */
18071 static enum tree_code
18076 {
18081 /* Assume that it's not a pointer-to-member. */
18083 /* And that there are no cv-qualifiers. */
18086 /* Peek at the next token. */
18089 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
18099 {
18100 /* Consume the `*', `&' or `&&'. */
18103 /* A `*' can be followed by a cv-qualifier-seq, and so can a
18104 `&', if we are allowing GNU extensions. (The only qualifier
18105 that can legally appear after `&' is `restrict', but that is
18106 enforced during semantic analysis. */
18114 }
18115 else
18116 {
18117 /* Try the pointer-to-member case. */
18119 /* Look for the optional `::' operator. */
18122 /* Look for the nested-name specifier. */
18129 /* If we found it, and the next token is a `*', then we are
18130 indeed looking at a pointer-to-member operator. */
18133 {
18134 /* Indicate that the `*' operator was used. */
18142 else
18143 {
18144 /* The type of which the member is a member is given by the
18145 current SCOPE. */
18147 /* The next name will not be qualified. */
18151 /* Look for optional c++11 attributes. */
18155 /* Look for the optional cv-qualifier-seq. */
18157 }
18158 }
18159 /* If that didn't work we don't have a ptr-operator. */
18162 }
18165 }
18167 /* Parse an (optional) cv-qualifier-seq.
18169 cv-qualifier-seq:
18170 cv-qualifier cv-qualifier-seq [opt]
18172 cv-qualifier:
18173 const
18174 volatile
18176 GNU Extension:
18178 cv-qualifier:
18179 __restrict__
18181 Returns a bitmask representing the cv-qualifiers. */
18183 static cp_cv_quals
18185 {
18189 {
18191 cp_cv_quals cv_qualifier;
18193 /* Peek at the next token. */
18195 /* See if it's a cv-qualifier. */
18197 {
18213 }
18219 {
18222 }
18223 else
18224 {
18227 }
18228 }
18231 }
18233 /* Parse an (optional) ref-qualifier
18235 ref-qualifier:
18236 &
18237 &&
18239 Returns cp_ref_qualifier representing ref-qualifier. */
18241 static cp_ref_qualifier
18243 {
18246 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
18251 {
18256 {
18268 }
18273 {
18276 }
18277 else
18278 {
18281 }
18282 }
18285 }
18287 /* Parse an (optional) virt-specifier-seq.
18289 virt-specifier-seq:
18290 virt-specifier virt-specifier-seq [opt]
18292 virt-specifier:
18293 override
18294 final
18296 Returns a bitmask representing the virt-specifiers. */
18298 static cp_virt_specifiers
18300 {
18304 {
18306 cp_virt_specifiers virt_specifier;
18308 /* Peek at the next token. */
18310 /* See if it's a virt-specifier-qualifier. */
18314 {
18317 }
18319 {
18322 }
18324 {
18326 }
18327 else
18331 {
18334 }
18335 else
18336 {
18339 }
18340 }
18342 }
18344 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18345 is in scope even though it isn't real. */
18347 void
18349 {
18350 tree this_parm;
18353 {
18354 /* We don't clear this between NSDMIs. Is it already what we want? */
18359 }
18362 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18364 current_class_ref
18367 }
18369 /* Return true iff our current scope is a non-static data member
18370 initializer. */
18372 bool
18374 {
18375 /* We recognize NSDMI context by the context-less 'this' pointer set up
18376 by the function above. */
18382 }
18384 /* Parse a late-specified return type, if any. This is not a separate
18385 non-terminal, but part of a function declarator, which looks like
18387 -> trailing-type-specifier-seq abstract-declarator(opt)
18389 Returns the type indicated by the type-id.
18391 In addition to this this parses any queued up omp declare simd
18392 clauses and Cilk Plus SIMD-enabled function's vector attributes.
18394 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18395 function. */
18397 static tree
18399 cp_cv_quals quals)
18400 {
18404 && declarator
18410 /* Peek at the next token. */
18412 /* A late-specified return type is indicated by an initial '->'. */
18419 {
18420 /* DR 1207: 'this' is in scope in the trailing return type. */
18422 }
18425 {
18426 /* Consume the ->. */
18430 }
18433 declarator->std_attributes
18437 declarator->std_attributes
18442 {
18445 }
18448 }
18450 /* Parse a declarator-id.
18452 declarator-id:
18453 id-expression
18454 :: [opt] nested-name-specifier [opt] type-name
18456 In the `id-expression' case, the value returned is as for
18457 cp_parser_id_expression if the id-expression was an unqualified-id.
18458 If the id-expression was a qualified-id, then a SCOPE_REF is
18459 returned. The first operand is the scope (either a NAMESPACE_DECL
18460 or TREE_TYPE), but the second is still just a representation of an
18461 unqualified-id. */
18463 static tree
18465 {
18466 tree id;
18467 /* The expression must be an id-expression. Assume that qualified
18468 names are the names of types so that:
18470 template <class T>
18471 int S<T>::R::i = 3;
18473 will work; we must treat `S<T>::R' as the name of a type.
18474 Similarly, assume that qualified names are templates, where
18475 required, so that:
18477 template <class T>
18478 int S<T>::R<T>::i = 3;
18480 will work, too. */
18486 optional_p);
18490 }
18492 /* Parse a type-id.
18494 type-id:
18495 type-specifier-seq abstract-declarator [opt]
18497 Returns the TYPE specified. */
18499 static tree
18502 {
18503 cp_decl_specifier_seq type_specifier_seq;
18506 /* Parse the type-specifier-seq. */
18508 is_trailing_return,
18513 /* There might or might not be an abstract declarator. */
18515 /* Look for the declarator. */
18516 abstract_declarator
18521 /* Check to see if there really was a declarator. */
18526 /* None of the valid uses of 'auto' in C++14 involve the type-id
18527 nonterminal, but it is valid in a trailing-return-type. */
18530 {
18531 /* A type-id with type 'auto' is only ok if the abstract declarator
18532 is a function declarator with a late-specified return type. */
18537 else
18538 {
18541 }
18542 }
18545 is_template_arg);
18546 }
18549 {
18551 }
18554 {
18555 tree r;
18557 parser->type_definition_forbidden_message
18562 {
18565 }
18567 }
18570 {
18572 }
18574 /* Parse a type-specifier-seq.
18576 type-specifier-seq:
18577 type-specifier type-specifier-seq [opt]
18579 GNU extension:
18581 type-specifier-seq:
18582 attributes type-specifier-seq [opt]
18584 If IS_DECLARATION is true, we are at the start of a "condition" or
18585 exception-declaration, so we might be followed by a declarator-id.
18587 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18588 i.e. we've just seen "->".
18590 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18592 static void
18597 {
18602 /* Clear the TYPE_SPECIFIER_SEQ. */
18605 /* In the context of a trailing return type, enum E { } is an
18606 elaborated-type-specifier followed by a function-body, not an
18607 enum-specifier. */
18611 /* Parse the type-specifiers and attributes. */
18613 {
18614 tree type_specifier;
18617 /* Check for attributes first. */
18619 {
18624 }
18626 /* record the token of the beginning of the type specifier seq,
18627 for error reporting purposes*/
18631 /* Look for the type-specifier. */
18633 flags,
18634 type_specifier_seq,
18636 NULL,
18639 {
18640 /* If the first type-specifier could not be found, this is not a
18641 type-specifier-seq at all. */
18643 {
18644 /* Set in_declarator_p to avoid skipping to the semicolon. */
18656 }
18657 /* If subsequent type-specifiers could not be found, the
18658 type-specifier-seq is complete. */
18660 }
18663 /* The standard says that a condition can be:
18665 type-specifier-seq declarator = assignment-expression
18667 However, given:
18669 struct S {};
18670 if (int S = ...)
18672 we should treat the "S" as a declarator, not as a
18673 type-specifier. The standard doesn't say that explicitly for
18674 type-specifier-seq, but it does say that for
18675 decl-specifier-seq in an ordinary declaration. Perhaps it
18676 would be clearer just to allow a decl-specifier-seq here, and
18677 then add a semantic restriction that if any decl-specifiers
18678 that are not type-specifiers appear, the program is invalid. */
18681 }
18682 }
18684 /* Return whether the function currently being declared has an associated
18685 template parameter list. */
18687 static bool
18689 {
18702 }
18704 /* Parse a parameter-declaration-clause.
18706 parameter-declaration-clause:
18707 parameter-declaration-list [opt] ... [opt]
18708 parameter-declaration-list , ...
18710 Returns a representation for the parameter declarations. A return
18711 value of NULL indicates a parameter-declaration-clause consisting
18712 only of an ellipsis. */
18714 static tree
18716 {
18717 tree parameters;
18726 parser->auto_is_implicit_function_template_parm_p
18728 }
18734 && !processing_template_parmlist
18740 /* Peek at the next token. */
18742 /* Check for trivial parameter-declaration-clauses. */
18744 {
18745 /* Consume the `...' token. */
18748 }
18750 /* There are no parameters. */
18751 {
18752 #ifndef NO_IMPLICIT_EXTERN_C
18757 else
18758 #endif
18760 }
18761 /* Check for `(void)', too, which is a special case. */
18765 {
18766 /* Consume the `void' token. */
18768 /* There are no parameters. */
18770 }
18772 /* Parse the parameter-declaration-list. */
18774 /* If a parse error occurred while parsing the
18775 parameter-declaration-list, then the entire
18776 parameter-declaration-clause is erroneous. */
18780 /* Peek at the next token. */
18782 /* If it's a `,', the clause should terminate with an ellipsis. */
18784 {
18785 /* Consume the `,'. */
18787 /* Expect an ellipsis. */
18788 ellipsis_p
18790 }
18791 /* It might also be `...' if the optional trailing `,' was
18792 omitted. */
18794 {
18795 /* Consume the `...' token. */
18797 /* And remember that we saw it. */
18799 }
18800 else
18803 /* Finish the parameter list. */
18808 }
18810 /* Parse a parameter-declaration-list.
18812 parameter-declaration-list:
18813 parameter-declaration
18814 parameter-declaration-list , parameter-declaration
18816 Returns a representation of the parameter-declaration-list, as for
18817 cp_parser_parameter_declaration_clause. However, the
18818 `void_list_node' is never appended to the list. Upon return,
18819 *IS_ERROR will be true iff an error occurred. */
18821 static tree
18823 {
18829 /* Assume all will go well. */
18831 /* The special considerations that apply to a function within an
18832 unbraced linkage specifications do not apply to the parameters
18833 to the function. */
18834 saved_in_unbraced_linkage_specification_p
18838 /* Look for more parameters. */
18840 {
18848 /* Parse the parameter. */
18849 parameter
18854 /* We don't know yet if the enclosing context is deprecated, so wait
18855 and warn in grokparms if appropriate. */
18859 {
18860 /* If a function parameter pack was specified and an implicit template
18861 parameter was introduced during cp_parser_parameter_declaration,
18862 change any implicit parameters introduced into packs. */
18866 {
18874 }
18878 PARM,
18881 }
18885 /* If a parse error occurred parsing the parameter declaration,
18886 then the entire parameter-declaration-list is erroneous. */
18888 {
18892 }
18902 {
18906 }
18908 /* Add the new parameter to the list. */
18912 /* Peek at the next token. */
18915 /* These are for Objective-C++ */
18918 /* The parameter-declaration-list is complete. */
18921 {
18924 /* Peek at the next token. */
18926 /* If it's an ellipsis, then the list is complete. */
18929 /* Otherwise, there must be more parameters. Consume the
18930 `,'. */
18932 /* When parsing something like:
18934 int i(float f, double d)
18936 we can tell after seeing the declaration for "f" that we
18937 are not looking at an initialization of a variable "i",
18938 but rather at the declaration of a function "i".
18940 Due to the fact that the parsing of template arguments
18941 (as specified to a template-id) requires backtracking we
18942 cannot use this technique when inside a template argument
18943 list. */
18947 /* However, a parameter-declaration of the form
18948 "float(f)" (which is a valid declaration of a
18949 parameter "f") can also be interpreted as an
18950 expression (the conversion of "f" to "float"). */
18953 }
18954 else
18955 {
18963 }
18964 }
18966 parser->in_unbraced_linkage_specification_p
18969 /* Reset implicit_template_scope if we are about to leave the function
18970 parameter list that introduced it. Note that for out-of-line member
18971 definitions, there will be one or more class scopes before we get to
18972 the template parameter scope. */
18976 {
18980 {
18983 }
18984 }
18987 }
18989 /* Parse a parameter declaration.
18991 parameter-declaration:
18992 decl-specifier-seq ... [opt] declarator
18993 decl-specifier-seq declarator = assignment-expression
18994 decl-specifier-seq ... [opt] abstract-declarator [opt]
18995 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18997 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18998 declares a template parameter. (In that case, a non-nested `>'
18999 token encountered during the parsing of the assignment-expression
19000 is not interpreted as a greater-than operator.)
19002 Returns a representation of the parameter, or NULL if an error
19003 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
19004 true iff the declarator is of the form "(p)". */
19010 {
19012 cp_decl_specifier_seq decl_specifiers;
19014 tree default_argument;
19018 /* In a template parameter, `>' is not an operator.
19020 [temp.param]
19022 When parsing a default template-argument for a non-type
19023 template-parameter, the first non-nested `>' is taken as the end
19024 of the template parameter-list rather than a greater-than
19025 operator. */
19027 /* Type definitions may not appear in parameter types. */
19029 parser->type_definition_forbidden_message
19032 /* Parse the declaration-specifiers. */
19034 CP_PARSER_FLAGS_NONE,
19038 /* Complain about missing 'typename' or other invalid type names. */
19043 /* If an error occurred, there's no reason to attempt to parse the
19044 rest of the declaration. */
19046 {
19049 }
19051 /* Peek at the next token. */
19054 /* If the next token is a `)', `,', `=', `>', or `...', then there
19055 is no declarator. However, when variadic templates are enabled,
19056 there may be a declarator following `...'. */
19061 {
19065 }
19066 /* Otherwise, there should be a declarator. */
19067 else
19068 {
19072 /* After seeing a decl-specifier-seq, if the next token is not a
19073 "(", there is no possibility that the code is a valid
19074 expression. Therefore, if parsing tentatively, we commit at
19075 this point. */
19077 /* In an expression context, having seen:
19079 (int((char ...
19081 we cannot be sure whether we are looking at a
19082 function-type (taking a "char" as a parameter) or a cast
19083 of some object of type "char" to "int". */
19089 /* Parse the declarator. */
19092 CP_PARSER_DECLARATOR_EITHER,
19094 parenthesized_p,
19098 /* After the declarator, allow more attributes. */
19099 decl_specifiers.attributes
19102 }
19104 /* If the next token is an ellipsis, and we have not seen a
19105 declarator name, and the type of the declarator contains parameter
19106 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
19107 a parameter pack expansion expression. Otherwise, leave the
19108 ellipsis for a C-style variadic function. */
19111 {
19122 {
19123 /* Consume the `...'. */
19127 /* Build a pack expansion type */
19130 else
19132 }
19133 }
19135 /* The restriction on defining new types applies only to the type
19136 of the parameter, not to the default argument. */
19139 /* If the next token is `=', then process a default argument. */
19141 {
19143 /* If we are defining a class, then the tokens that make up the
19144 default argument must be saved and processed later. */
19149 /* Outside of a class definition, we can just parse the
19150 assignment-expression. */
19151 else
19152 default_argument
19156 {
19159 else
19160 {
19162 "default arguments are only "
19165 }
19166 }
19170 {
19171 /* Find the name of the parameter pack. */
19178 template_parm_p
19184 else
19186 template_parm_p
19193 }
19194 }
19195 else
19199 declarator,
19200 default_argument);
19201 }
19203 /* Parse a default argument and return it.
19205 TEMPLATE_PARM_P is true if this is a default argument for a
19206 non-type template parameter. */
19207 static tree
19209 {
19215 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
19216 set correctly. */
19219 /* Local variable names (and the `this' keyword) may not
19220 appear in a default argument. */
19223 /* Parse the assignment-expression. */
19228 /* The "this" pointer is not valid in a default argument. */
19230 {
19235 }
19236 default_argument
19238 /* Restore the "this" pointer. */
19240 {
19243 }
19252 }
19254 /* Parse a function-body.
19256 function-body:
19257 compound_statement */
19259 static void
19261 {
19263 }
19265 /* Parse a ctor-initializer-opt followed by a function-body. Return
19266 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
19267 is true we are parsing a function-try-block. */
19269 static bool
19272 {
19280 /* Begin the function body. */
19282 /* Parse the optional ctor-initializer. */
19285 /* If we're parsing a constexpr constructor definition, we need
19286 to check that the constructor body is indeed empty. However,
19287 before we get to cp_parser_function_body lot of junk has been
19288 generated, so we can't just check that we have an empty block.
19289 Rather we take a snapshot of the outermost block, and check whether
19290 cp_parser_function_body changed its state. */
19292 {
19296 }
19297 /* Parse the function-body. */
19301 /* Finish the function body. */
19305 }
19307 /* Parse an initializer.
19309 initializer:
19310 = initializer-clause
19311 ( expression-list )
19313 Returns an expression representing the initializer. If no
19314 initializer is present, NULL_TREE is returned.
19316 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
19317 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
19318 set to TRUE if there is no initializer present. If there is an
19319 initializer, and it is not a constant-expression, *NON_CONSTANT_P
19320 is set to true; otherwise it is set to false. */
19322 static tree
19325 {
19327 tree init;
19329 /* Peek at the next token. */
19332 /* Let our caller know whether or not this initializer was
19333 parenthesized. */
19335 /* Assume that the initializer is constant. */
19339 {
19340 /* Consume the `='. */
19342 /* Parse the initializer-clause. */
19344 }
19346 {
19351 non_constant_p);
19356 }
19358 {
19363 }
19364 else
19365 {
19366 /* Anything else is an error. */
19369 }
19372 }
19374 /* Parse an initializer-clause.
19376 initializer-clause:
19377 assignment-expression
19378 braced-init-list
19380 Returns an expression representing the initializer.
19382 If the `assignment-expression' production is used the value
19383 returned is simply a representation for the expression.
19385 Otherwise, calls cp_parser_braced_list. */
19387 static tree
19389 {
19390 tree initializer;
19392 /* Assume the expression is constant. */
19395 /* If it is not a `{', then we are looking at an
19396 assignment-expression. */
19398 {
19399 initializer
19402 non_constant_p);
19403 }
19404 else
19408 }
19410 /* Parse a brace-enclosed initializer list.
19412 braced-init-list:
19413 { initializer-list , [opt] }
19414 { }
19416 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19417 the elements of the initializer-list (or NULL, if the last
19418 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19419 NULL_TREE. There is no way to detect whether or not the optional
19420 trailing `,' was provided. NON_CONSTANT_P is as for
19421 cp_parser_initializer. */
19423 static tree
19425 {
19426 tree initializer;
19428 /* Consume the `{' token. */
19430 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19432 /* If it's not a `}', then there is a non-trivial initializer. */
19434 {
19435 /* Parse the initializer list. */
19438 /* A trailing `,' token is allowed. */
19441 }
19442 else
19444 /* Now, there should be a trailing `}'. */
19448 }
19450 /* Consume tokens up to, and including, the next non-nested closing `]'.
19451 Returns true iff we found a closing `]'. */
19453 static bool
19455 {
19459 {
19463 {
19466 /* If we've run out of tokens, then there is no closing `]'. */
19475 {
19478 }
19483 }
19485 /* Consume the token. */
19487 }
19488 }
19490 /* Return true if we are looking at an array-designator, false otherwise. */
19492 static bool
19494 {
19495 /* Consume the `['. */
19500 /* Skip tokens until the next token is a closing square bracket.
19501 If we find the closing `]', and the next token is a `=', then
19502 we are looking at an array designator. */
19503 bool array_designator_p
19507 /* Roll back the tokens we skipped. */
19511 }
19513 /* Parse an initializer-list.
19515 initializer-list:
19516 initializer-clause ... [opt]
19517 initializer-list , initializer-clause ... [opt]
19519 GNU Extension:
19521 initializer-list:
19522 designation initializer-clause ...[opt]
19523 initializer-list , designation initializer-clause ...[opt]
19525 designation:
19526 . identifier =
19527 identifier :
19528 [ constant-expression ] =
19530 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19531 for the initializer. If the INDEX of the elt is non-NULL, it is the
19532 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19533 as for cp_parser_initializer. */
19537 {
19540 /* Assume all of the expressions are constant. */
19543 /* Parse the rest of the list. */
19545 {
19547 tree designator;
19548 tree initializer;
19551 /* If the next token is an identifier and the following one is a
19552 colon, we are looking at the GNU designated-initializer
19553 syntax. */
19557 {
19558 /* Warn the user that they are using an extension. */
19561 /* Consume the identifier. */
19563 /* Consume the `:'. */
19565 }
19566 /* Also handle the C99 syntax, '. id ='. */
19571 {
19572 /* Warn the user that they are using an extension. */
19575 /* Consume the `.'. */
19577 /* Consume the identifier. */
19579 /* Consume the `='. */
19581 }
19582 /* Also handle C99 array designators, '[ const ] ='. */
19586 {
19587 /* In C++11, [ could start a lambda-introducer. */
19593 {
19596 }
19597 else
19598 {
19603 }
19609 }
19610 else
19613 /* Parse the initializer. */
19616 /* If any clause is non-constant, so is the entire initializer. */
19620 /* If we have an ellipsis, this is an initializer pack
19621 expansion. */
19623 {
19624 /* Consume the `...'. */
19627 /* Turn the initializer into an initializer expansion. */
19629 }
19631 /* Add it to the vector. */
19634 /* If the next token is not a comma, we have reached the end of
19635 the list. */
19639 /* Peek at the next token. */
19641 /* If the next token is a `}', then we're still done. An
19642 initializer-clause can have a trailing `,' after the
19643 initializer-list and before the closing `}'. */
19647 /* Consume the `,' token. */
19649 }
19652 }
19654 /* Classes [gram.class] */
19656 /* Parse a class-name.
19658 class-name:
19659 identifier
19660 template-id
19662 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19663 to indicate that names looked up in dependent types should be
19664 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19665 keyword has been used to indicate that the name that appears next
19666 is a template. TAG_TYPE indicates the explicit tag given before
19667 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19668 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19669 is the class being defined in a class-head. If ENUM_OK is TRUE,
19670 enum-names are also accepted.
19672 Returns the TYPE_DECL representing the class. */
19674 static tree
19683 {
19684 tree decl;
19685 tree scope;
19690 /* All class-names start with an identifier. */
19693 {
19696 }
19698 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19699 to a template-id, so we save it here. */
19704 /* Any name names a type if we're following the `typename' keyword
19705 in a qualified name where the enclosing scope is type-dependent. */
19708 /* Handle the common case (an identifier, but not a template-id)
19709 efficiently. */
19712 {
19716 /* Look for the identifier. */
19720 /* If the next token isn't an identifier, we are certainly not
19721 looking at a class-name. */
19724 /* If we know this is a type-name, there's no need to look it
19725 up. */
19728 else
19729 {
19730 tree ambiguous_decls;
19731 /* If we already know that this lookup is ambiguous, then
19732 we've already issued an error message; there's no reason
19733 to check again. */
19735 {
19738 }
19739 /* If the next token is a `::', then the name must be a type
19740 name.
19742 [basic.lookup.qual]
19744 During the lookup for a name preceding the :: scope
19745 resolution operator, object, function, and enumerator
19746 names are ignored. */
19749 /* Look up the name. */
19751 tag_type,
19754 check_dependency_p,
19758 {
19762 }
19763 }
19764 }
19765 else
19766 {
19767 /* Try a template-id. */
19769 check_dependency_p,
19770 tag_type,
19771 is_declaration);
19774 }
19778 /* If this is a typename, create a TYPENAME_TYPE. */
19780 {
19785 }
19789 /* Check to see that it is really the name of a class. */
19793 /* Situations like this:
19795 template <typename T> struct A {
19796 typename T::template X<int>::I i;
19797 };
19799 are problematic. Is `T::template X<int>' a class-name? The
19800 standard does not seem to be definitive, but there is no other
19801 valid interpretation of the following `::'. Therefore, those
19802 names are considered class-names. */
19803 {
19807 }
19812 /* In Objective-C 2.0, a classname followed by '.' starts a
19813 dot-syntax expression, and it's not a type-name. */
19825 }
19827 /* Parse a class-specifier.
19829 class-specifier:
19830 class-head { member-specification [opt] }
19832 Returns the TREE_TYPE representing the class. */
19834 static tree
19836 {
19837 tree type;
19851 /* Parse the class-head. */
19854 /* If the class-head was a semantic disaster, skip the entire body
19855 of the class. */
19857 {
19861 }
19863 /* Look for the `{'. */
19865 {
19868 }
19872 /* Issue an error message if type-definitions are forbidden here. */
19874 /* Remember that we are defining one more class. */
19876 /* Inside the class, surrounding template-parameter-lists do not
19877 apply. */
19878 saved_num_template_parameter_lists
19881 /* We are not in a function body. */
19884 /* Or in a loop. */
19887 /* Or in a switch. */
19890 /* We are not immediately inside an extern "lang" block. */
19891 saved_in_unbraced_linkage_specification_p
19895 /* Start the class. */
19897 {
19900 }
19904 /* If the type is erroneous, skip the entire body of the class. */
19906 else
19907 /* Parse the member-specification. */
19910 /* Look for the trailing `}'. */
19912 /* Look for trailing attributes to apply to this class. */
19920 /* We've finished a type definition. Check for the common syntax
19921 error of forgetting a semicolon after the definition. We need to
19922 be careful, as we can't just check for not-a-semicolon and be done
19923 with it; the user might have typed:
19925 class X { } c = ...;
19926 class X { } *p = ...;
19928 and so forth. Instead, enumerate all the possible tokens that
19929 might follow this production; if we don't see one of them, then
19930 complain and silently insert the semicolon. */
19931 {
19936 /* Don't try to parse c++11 attributes here. As per the
19937 grammar, that should be a task for
19938 cp_parser_decl_specifier_seq. */
19942 {
19953 /* While it's legal for type qualifiers and storage class
19954 specifiers to follow type definitions in the grammar, only
19955 compiler testsuites contain code like that. Assume that if
19956 we see such code, then what we're really seeing is a case
19957 like:
19959 class X { }
19960 const <type> var = ...;
19962 or
19964 class Y { }
19965 static <type> func (...) ...
19967 i.e. the qualifier or specifier applies to the next
19968 declaration. To do so, however, we need to look ahead one
19969 more token to see if *that* token is a type specifier.
19971 This code could be improved to handle:
19973 class Z { }
19974 static const <type> var = ...; */
19977 {
19980 /* Handling user-defined types here would be nice, but very
19981 tricky. */
19982 want_semicolon
19985 }
19989 }
19991 /* If we don't have a type, then something is very wrong and we
19992 shouldn't try to do anything clever. Likewise for not seeing the
19993 closing brace. */
19995 {
19996 cp_token_position prev
20007 else
20010 /* Unget one token and smash it to look as though we encountered
20011 a semicolon in the input stream. */
20016 }
20017 }
20019 /* If this class is not itself within the scope of another class,
20020 then we need to parse the bodies of all of the queued function
20021 definitions. Note that the queued functions defined in a class
20022 are not always processed immediately following the
20023 class-specifier for that class. Consider:
20025 struct A {
20026 struct B { void f() { sizeof (A); } };
20027 };
20029 If `f' were processed before the processing of `A' were
20030 completed, there would be no way to compute the size of `A'.
20031 Note that the nesting we are interested in here is lexical --
20032 not the semantic nesting given by TYPE_CONTEXT. In particular,
20033 for:
20035 struct A { struct B; };
20036 struct A::B { void f() { } };
20038 there is no need to delay the parsing of `A::B::f'. */
20040 {
20041 tree decl;
20048 /* In a first pass, parse default arguments to the functions.
20049 Then, in a second pass, parse the bodies of the functions.
20050 This two-phased approach handles cases like:
20052 struct S {
20053 void f() { g(); }
20054 void g(int i = 3);
20055 };
20057 */
20059 {
20061 /* If there are default arguments that have not yet been processed,
20062 take care of them now. */
20064 {
20069 }
20070 /* Make sure that any template parameters are in scope. */
20072 /* Parse the default argument expressions. */
20074 /* Remove any template parameters from the symbol table. */
20076 }
20078 /* Now parse any NSDMIs. */
20082 {
20084 {
20089 }
20092 }
20099 /* Now do some post-NSDMI bookkeeping. */
20105 /* Now parse the body of the functions. */
20107 {
20108 /* OpenMP UDRs need to be parsed before all other functions. */
20115 }
20116 else
20120 }
20121 else
20124 /* Put back any saved access checks. */
20127 /* Restore saved state. */
20131 parser->num_template_parameter_lists
20133 parser->in_unbraced_linkage_specification_p
20137 }
20139 static tree
20141 {
20142 tree ret;
20147 }
20149 /* Parse a class-head.
20151 class-head:
20152 class-key identifier [opt] base-clause [opt]
20153 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
20154 class-key nested-name-specifier [opt] template-id
20155 base-clause [opt]
20157 class-virt-specifier:
20158 final
20160 GNU Extensions:
20161 class-key attributes identifier [opt] base-clause [opt]
20162 class-key attributes nested-name-specifier identifier base-clause [opt]
20163 class-key attributes nested-name-specifier [opt] template-id
20164 base-clause [opt]
20166 Upon return BASES is initialized to the list of base classes (or
20167 NULL, if there are none) in the same form returned by
20168 cp_parser_base_clause.
20170 Returns the TYPE of the indicated class. Sets
20171 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
20172 involving a nested-name-specifier was used, and FALSE otherwise.
20174 Returns error_mark_node if this is not a class-head.
20176 Returns NULL_TREE if the class-head is syntactically valid, but
20177 semantically invalid in a way that means we should skip the entire
20178 body of the class. */
20180 static tree
20183 {
20184 tree nested_name_specifier;
20188 tree attributes;
20189 tree bases;
20199 /* Assume no nested-name-specifier will be present. */
20201 /* Assume no template parameter lists will be used in defining the
20202 type. */
20206 /* Look for the class-key. */
20211 /* Parse the attributes. */
20214 /* If the next token is `::', that is invalid -- but sometimes
20215 people do try to write:
20217 struct ::S {};
20219 Handle this gracefully by accepting the extra qualifier, and then
20220 issuing an error about it later if this really is a
20221 class-head. If it turns out just to be an elaborated type
20222 specifier, remain silent. */
20228 /* Determine the name of the class. Begin by looking for an
20229 optional nested-name-specifier. */
20231 nested_name_specifier
20237 /* If there was a nested-name-specifier, then there *must* be an
20238 identifier. */
20240 {
20242 /* Although the grammar says `identifier', it really means
20243 `class-name' or `template-name'. You are only allowed to
20244 define a class that has already been declared with this
20245 syntax.
20247 The proposed resolution for Core Issue 180 says that wherever
20248 you see `class T::X' you should treat `X' as a type-name.
20250 It is OK to define an inaccessible class; for example:
20252 class A { class B; };
20253 class A::B {};
20255 We do not know if we will see a class-name, or a
20256 template-name. We look for a class-name first, in case the
20257 class-name is a template-id; if we looked for the
20258 template-name first we would stop after the template-name. */
20263 class_type,
20267 /* If that didn't work, ignore the nested-name-specifier. */
20269 {
20275 }
20276 /* If we could not find a corresponding TYPE, treat this
20277 declaration like an unqualified declaration. */
20280 /* Otherwise, count the number of templates used in TYPE and its
20281 containing scopes. */
20282 else
20283 {
20284 tree scope;
20296 }
20297 }
20298 /* Otherwise, the identifier is optional. */
20299 else
20300 {
20301 /* We don't know whether what comes next is a template-id,
20302 an identifier, or nothing at all. */
20304 /* Check for a template-id. */
20309 class_key,
20311 /* If that didn't work, it could still be an identifier. */
20313 {
20315 {
20318 }
20319 else
20321 }
20322 else
20323 {
20326 }
20327 }
20332 {
20334 class_key,
20336 }
20339 /* If it's not a `:' or a `{' then we can't really be looking at a
20340 class-head, since a class-head only appears as part of a
20341 class-specifier. We have to detect this situation before calling
20342 xref_tag, since that has irreversible side-effects. */
20344 {
20348 }
20350 /* At this point, we're going ahead with the class-specifier, even
20351 if some other problem occurs. */
20354 {
20359 }
20360 /* Issue the error about the overly-qualified name now. */
20362 {
20367 }
20369 {
20374 }
20376 {
20377 tree scope;
20379 /* Reject typedef-names in class heads. */
20381 {
20384 type);
20387 }
20389 /* Figure out in what scope the declaration is being placed. */
20391 /* If that scope does not contain the scope in which the
20392 class was originally declared, the program is invalid. */
20394 {
20397 "declaration of %qD in namespace %qD which does not "
20400 else
20406 }
20407 /* [dcl.meaning]
20409 A declarator-id shall not be qualified except for the
20410 definition of a ... nested class outside of its class
20411 ... [or] the definition or explicit instantiation of a
20412 class member of a namespace outside of its namespace. */
20414 {
20419 }
20420 }
20421 /* An explicit-specialization must be preceded by "template <>". If
20422 it is not, try to recover gracefully. */
20426 {
20430 /* Take the same action that would have been taken by
20431 cp_parser_explicit_specialization. */
20434 }
20435 /* There must be no "return" statements between this point and the
20436 end of this function; set "type "to the correct return value and
20437 use "goto done;" to return. */
20438 /* Make sure that the right number of template parameters were
20439 present. */
20443 {
20444 /* If something went wrong, there is no point in even trying to
20445 process the class-definition. */
20448 }
20450 /* Look up the type. */
20452 {
20456 {
20460 }
20461 else
20462 {
20465 }
20468 }
20470 {
20471 tree class_type;
20473 /* Given:
20475 template <typename T> struct S { struct T };
20476 template <typename T> struct S<T>::T { };
20478 we will get a TYPENAME_TYPE when processing the definition of
20479 `S::T'. We need to resolve it to the actual type before we
20480 try to define it. */
20482 {
20487 else
20488 {
20491 }
20492 }
20496 {
20499 }
20502 /* Enter the scope indicated by the nested-name-specifier. */
20504 /* Get the canonical version of this type. */
20506 /* Call push_template_decl if it seems like we should be defining a
20507 template either from the template headers or the type we're
20508 defining, so that we diagnose both extra and missing headers. */
20512 {
20515 {
20518 }
20519 }
20523 }
20525 {
20526 /* If the class was unnamed, create a dummy name. */
20531 }
20533 /* Indicate whether this class was declared as a `class' or as a
20534 `struct'. */
20539 /* If this type was already complete, and we see another definition,
20540 that's an error. */
20542 {
20544 type);
20546 type);
20549 }
20554 {
20555 /* Apply attributes now, before any use of the class as a template
20556 argument in its base list. */
20559 }
20561 /* We will have entered the scope containing the class; the names of
20562 base classes should be looked up in that context. For example:
20564 struct A { struct B {}; struct C; };
20565 struct A::C : B {};
20567 is valid. */
20569 /* Get the list of base-classes, if there is one. */
20571 {
20572 /* PR59482: enter the class scope so that base-specifiers are looked
20573 up correctly. */
20577 /* PR59482: get out of the previously pushed class scope so that the
20578 subsequent pops pop the right thing. */
20581 }
20582 else
20585 /* If we're really defining a class, process the base classes.
20586 If they're invalid, fail. */
20591 done:
20592 /* Leave the scope given by the nested-name-specifier. We will
20593 enter the class scope itself while processing the members. */
20598 {
20601 }
20607 out:
20610 }
20612 /* Parse a class-key.
20614 class-key:
20615 class
20616 struct
20617 union
20619 Returns the kind of class-key specified, or none_type to indicate
20620 error. */
20622 static enum tag_types
20624 {
20628 /* Look for the class-key. */
20633 /* Check to see if the TOKEN is a class-key. */
20638 }
20640 /* Parse a type-parameter-key.
20642 type-parameter-key:
20643 class
20644 typename
20645 */
20647 static void
20649 {
20650 /* Look for the type-parameter-key. */
20654 {
20657 /* typename is not allowed in a template template parameter
20658 by the standard until C++1Z. */
20660 "ISO C++ forbids typename key in template template parameter;"
20662 }
20663 else
20667 }
20669 /* Parse an (optional) member-specification.
20671 member-specification:
20672 member-declaration member-specification [opt]
20673 access-specifier : member-specification [opt] */
20675 static void
20677 {
20679 {
20683 /* Peek at the next token. */
20685 /* If it's a `}', or EOF then we've seen all the members. */
20691 /* See if this token is a keyword. */
20694 {
20698 /* Consume the access-specifier. */
20700 /* Remember which access-specifier is active. */
20702 /* Look for the `:'. */
20707 /* Accept #pragmas at class scope. */
20709 {
20712 }
20714 /* Otherwise, the next construction must be a
20715 member-declaration. */
20717 }
20718 }
20719 }
20721 /* Parse a member-declaration.
20723 member-declaration:
20724 decl-specifier-seq [opt] member-declarator-list [opt] ;
20725 function-definition ; [opt]
20726 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20727 using-declaration
20728 template-declaration
20729 alias-declaration
20731 member-declarator-list:
20732 member-declarator
20733 member-declarator-list , member-declarator
20735 member-declarator:
20736 declarator pure-specifier [opt]
20737 declarator constant-initializer [opt]
20738 identifier [opt] : constant-expression
20740 GNU Extensions:
20742 member-declaration:
20743 __extension__ member-declaration
20745 member-declarator:
20746 declarator attributes [opt] pure-specifier [opt]
20747 declarator attributes [opt] constant-initializer [opt]
20748 identifier [opt] attributes [opt] : constant-expression
20750 C++0x Extensions:
20752 member-declaration:
20753 static_assert-declaration */
20755 static void
20757 {
20758 cp_decl_specifier_seq decl_specifiers;
20759 tree prefix_attributes;
20760 tree decl;
20769 /* Check for the `__extension__' keyword. */
20771 {
20772 /* Recurse. */
20774 /* Restore the old value of the PEDANTIC flag. */
20778 }
20780 /* Check for a template-declaration. */
20782 {
20783 /* An explicit specialization here is an error condition, and we
20784 expect the specialization handler to detect and report this. */
20788 else
20792 }
20794 /* Check for a using-declaration. */
20796 {
20798 {
20799 /* Parse the using-declaration. */
20803 }
20804 else
20805 {
20806 tree decl;
20810 /* Note that if we actually see the '=' token after the
20811 identifier, cp_parser_alias_declaration commits the
20812 tentative parse. In that case, we really expects an
20813 alias-declaration. Otherwise, we expect a using
20814 declaration. */
20815 alias_decl_expected =
20821 else
20825 }
20826 }
20828 /* Check for @defs. */
20830 {
20835 {
20840 }
20842 }
20844 /* If the next token is `static_assert' we have a static assertion. */
20846 {
20849 }
20856 /* Parse the decl-specifier-seq. */
20859 CP_PARSER_FLAGS_OPTIONAL,
20862 /* Check for an invalid type-name. */
20866 /* If there is no declarator, then the decl-specifier-seq should
20867 specify a type. */
20869 {
20870 /* If there was no decl-specifier-seq, and the next token is a
20871 `;', then we have something like:
20873 struct S { ; };
20875 [class.mem]
20877 Each member-declaration shall declare at least one member
20878 name of the class. */
20880 {
20884 }
20885 else
20886 {
20887 tree type;
20889 /* See if this declaration is a friend. */
20891 /* If there were decl-specifiers, check to see if there was
20892 a class-declaration. */
20895 /* Nested classes have already been added to the class, but
20896 a `friend' needs to be explicitly registered. */
20898 {
20899 /* If the `friend' keyword was present, the friend must
20900 be introduced with a class-key. */
20903 "in C++03 a class-key must be used "
20905 /* In this case:
20907 template <typename T> struct A {
20908 friend struct A<T>::B;
20909 };
20911 A<T>::B will be represented by a TYPENAME_TYPE, and
20912 therefore not recognized by check_tag_decl. */
20914 {
20918 }
20921 "friend declaration does not name a class or "
20923 else
20926 }
20927 /* If there is no TYPE, an error message will already have
20928 been issued. */
20930 ;
20931 /* An anonymous aggregate has to be handled specially; such
20932 a declaration really declares a data member (with a
20933 particular type), as opposed to a nested class. */
20935 {
20936 /* C++11 9.5/6. */
20939 "a storage class on an anonymous aggregate "
20942 /* Remove constructors and such from TYPE, now that we
20943 know it is an anonymous aggregate. */
20945 /* And make the corresponding data member. */
20948 /* Add it to the class. */
20950 }
20951 else
20952 cp_parser_check_access_in_redeclaration
20955 }
20956 }
20957 else
20958 {
20961 /* Clear attributes from the decl_specifiers but keep them
20962 around as prefix attributes that apply them to the entity
20963 being declared. */
20967 /* See if these declarations will be friends. */
20970 /* Keep going until we hit the `;' at the end of the
20971 declaration. */
20973 {
20975 tree first_attribute;
20977 /* Peek at the next token. */
20980 /* Check for a bitfield declaration. */
20985 {
20986 tree identifier;
20987 tree width;
20989 /* Get the name of the bitfield. Note that we cannot just
20990 check TOKEN here because it may have been invalidated by
20991 the call to cp_lexer_peek_nth_token above. */
20994 else
20997 /* Consume the `:' token. */
20999 /* Get the width of the bitfield. */
21000 width
21003 /* Look for attributes that apply to the bitfield. */
21005 /* Remember which attributes are prefix attributes and
21006 which are not. */
21008 /* Combine the attributes. */
21011 /* Create the bitfield declaration. */
21014 identifier,
21015 sfk_none)
21018 width,
21019 attributes);
21020 }
21021 else
21022 {
21024 tree initializer;
21025 tree asm_specification;
21028 /* Parse the declarator. */
21029 declarator
21034 friend_p);
21036 /* If something went wrong parsing the declarator, make sure
21037 that we at least consume some tokens. */
21039 {
21040 /* Skip to the end of the statement. */
21042 /* If the next token is not a semicolon, that is
21043 probably because we just skipped over the body of
21044 a function. So, we consume a semicolon if
21045 present, but do not issue an error message if it
21046 is not present. */
21048 CPP_SEMICOLON))
21051 }
21054 cp_parser_check_for_definition_in_return_type
21058 /* Look for an asm-specification. */
21060 /* Look for attributes that apply to the declaration. */
21062 /* Remember which attributes are prefix attributes and
21063 which are not. */
21065 /* Combine the attributes. */
21068 /* If it's an `=', then we have a constant-initializer or a
21069 pure-specifier. It is not correct to parse the
21070 initializer before registering the member declaration
21071 since the member declaration should be in scope while
21072 its initializer is processed. However, the rest of the
21073 front end does not yet provide an interface that allows
21074 us to handle this correctly. */
21076 {
21077 /* In [class.mem]:
21079 A pure-specifier shall be used only in the declaration of
21080 a virtual function.
21082 A member-declarator can contain a constant-initializer
21083 only if it declares a static member of integral or
21084 enumeration type.
21086 Therefore, if the DECLARATOR is for a function, we look
21087 for a pure-specifier; otherwise, we look for a
21088 constant-initializer. When we call `grokfield', it will
21089 perform more stringent semantics checks. */
21101 {
21103 /* Don't require a constant rvalue in C++11, since we
21104 might want a reference constant. We'll enforce
21105 constancy later. */
21107 /* Parse the initializer. */
21110 }
21111 else
21112 /* Parse the initializer. */
21114 }
21117 {
21121 else
21123 }
21124 /* Otherwise, there is no initializer. */
21125 else
21128 /* See if we are probably looking at a function
21129 definition. We are certainly not looking at a
21130 member-declarator. Calling `grokfield' has
21131 side-effects, so we must not do it unless we are sure
21132 that we are looking at a member-declarator. */
21135 {
21136 /* The grammar does not allow a pure-specifier to be
21137 used when a member function is defined. (It is
21138 possible that this fact is an oversight in the
21139 standard, since a pure function may be defined
21140 outside of the class-specifier. */
21146 declarator,
21147 attributes);
21150 /* If the member was not a friend, declare it here. */
21153 /* Peek at the next token. */
21155 /* If the next token is a semicolon, consume it. */
21159 }
21160 else
21163 /* Create the declaration. */
21168 {
21171 else
21173 }
21174 }
21178 /* Reset PREFIX_ATTRIBUTES. */
21184 /* If there is any qualification still in effect, clear it
21185 now; we will be starting fresh with the next declarator. */
21189 /* If it's a `,', then there are more declarators. */
21191 {
21194 {
21198 }
21199 }
21200 /* If the next token isn't a `;', then we have a parse error. */
21202 CPP_SEMICOLON))
21203 {
21204 /* The next token might be a ways away from where the
21205 actual semicolon is missing. Find the previous token
21206 and use that for our error position. */
21211 /* Assume that the user meant to provide a semicolon. If
21212 we were to cp_parser_skip_to_end_of_statement, we might
21213 skip to a semicolon inside a member function definition
21214 and issue nonsensical error messages. */
21216 }
21219 {
21220 /* Add DECL to the list of members. */
21222 /* Explicitly include, eg, NSDMIs, for better error
21223 recovery (c++/58650). */
21232 /* Add DECL to the queue of NSDMI to be parsed later. */
21234 }
21238 }
21239 }
21242 out:
21244 }
21246 /* Parse a pure-specifier.
21248 pure-specifier:
21249 = 0
21251 Returns INTEGER_ZERO_NODE if a pure specifier is found.
21252 Otherwise, ERROR_MARK_NODE is returned. */
21254 static tree
21256 {
21259 /* Look for the `=' token. */
21262 /* Look for the `0' token. */
21271 /* Accept = default or = delete in c++0x mode. */
21274 {
21277 }
21279 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
21281 {
21286 }
21288 {
21291 }
21294 }
21296 /* Parse a constant-initializer.
21298 constant-initializer:
21299 = constant-expression
21301 Returns a representation of the constant-expression. */
21303 static tree
21305 {
21306 /* Look for the `=' token. */
21310 /* It is invalid to write:
21312 struct S { static const int i = { 7 }; };
21314 */
21316 {
21319 /* Consume the opening brace. */
21321 /* Skip the initializer. */
21323 /* Look for the trailing `}'. */
21327 }
21330 }
21332 /* Derived classes [gram.class.derived] */
21334 /* Parse a base-clause.
21336 base-clause:
21337 : base-specifier-list
21339 base-specifier-list:
21340 base-specifier ... [opt]
21341 base-specifier-list , base-specifier ... [opt]
21343 Returns a TREE_LIST representing the base-classes, in the order in
21344 which they were declared. The representation of each node is as
21345 described by cp_parser_base_specifier.
21347 In the case that no bases are specified, this function will return
21348 NULL_TREE, not ERROR_MARK_NODE. */
21350 static tree
21352 {
21355 /* Look for the `:' that begins the list. */
21358 /* Scan the base-specifier-list. */
21360 {
21362 tree base;
21365 /* Look for the base-specifier. */
21367 /* Look for the (optional) ellipsis. */
21369 {
21370 /* Consume the `...'. */
21374 }
21376 /* Add BASE to the front of the list. */
21378 {
21380 /* Make this a pack expansion type. */
21384 {
21387 }
21388 }
21389 /* Peek at the next token. */
21391 /* If it's not a comma, then the list is complete. */
21394 /* Consume the `,'. */
21396 }
21398 /* PARSER->SCOPE may still be non-NULL at this point, if the last
21399 base class had a qualified name. However, the next name that
21400 appears is certainly not qualified. */
21406 }
21408 /* Parse a base-specifier.
21410 base-specifier:
21411 :: [opt] nested-name-specifier [opt] class-name
21412 virtual access-specifier [opt] :: [opt] nested-name-specifier
21413 [opt] class-name
21414 access-specifier virtual [opt] :: [opt] nested-name-specifier
21415 [opt] class-name
21417 Returns a TREE_LIST. The TREE_PURPOSE will be one of
21418 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
21419 indicate the specifiers provided. The TREE_VALUE will be a TYPE
21420 (or the ERROR_MARK_NODE) indicating the type that was specified. */
21422 static tree
21424 {
21432 tree type;
21434 /* Process the optional `virtual' and `access-specifier'. */
21436 {
21437 /* Peek at the next token. */
21439 /* Process `virtual'. */
21441 {
21443 /* If `virtual' appears more than once, issue an error. */
21445 {
21449 }
21453 /* Consume the `virtual' token. */
21461 /* If more than one access specifier appears, issue an
21462 error. */
21465 {
21469 }
21473 /* Consume the access-specifier. */
21481 }
21482 }
21483 /* It is not uncommon to see programs mechanically, erroneously, use
21484 the 'typename' keyword to denote (dependent) qualified types
21485 as base classes. */
21487 {
21492 else
21494 "keyword %<typename%> not allowed in this context "
21497 }
21499 /* Look for the optional `::' operator. */
21501 /* Look for the nested-name-specifier. The simplest way to
21502 implement:
21504 [temp.res]
21506 The keyword `typename' is not permitted in a base-specifier or
21507 mem-initializer; in these contexts a qualified name that
21508 depends on a template-parameter is implicitly assumed to be a
21509 type name.
21511 is to pretend that we have seen the `typename' keyword at this
21512 point. */
21516 typename_type,
21518 /* If the base class is given by a qualified name, assume that names
21519 we see are type names or templates, as appropriate. */
21525 /* DR 950 allows decltype as a base-specifier. */
21527 else
21528 {
21529 /* Otherwise, look for the class-name. */
21531 class_scope_p,
21532 template_p,
21533 typename_type,
21538 }
21544 }
21546 /* Exception handling [gram.exception] */
21548 /* Parse an (optional) noexcept-specification.
21550 noexcept-specification:
21551 noexcept ( constant-expression ) [opt]
21553 If no noexcept-specification is present, returns NULL_TREE.
21554 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21555 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21556 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21557 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21558 in which case a boolean condition is returned instead. */
21560 static tree
21565 {
21569 /* Peek at the next token. */
21572 /* Is it a noexcept-specification? */
21574 {
21575 tree expr;
21579 {
21583 {
21584 /* Types may not be defined in an exception-specification. */
21586 parser->type_definition_forbidden_message
21591 /* Restore the saved message. */
21593 }
21594 else
21595 {
21598 }
21601 }
21602 else
21603 {
21607 }
21609 /* We cannot build a noexcept-spec right away because this will check
21610 that expr is a constexpr. */
21613 else
21615 }
21616 else
21618 }
21620 /* Parse an (optional) exception-specification.
21622 exception-specification:
21623 throw ( type-id-list [opt] )
21625 Returns a TREE_LIST representing the exception-specification. The
21626 TREE_VALUE of each node is a type. */
21628 static tree
21630 {
21632 tree type_id_list;
21635 /* Peek at the next token. */
21638 /* Is it a noexcept-specification? */
21644 /* If it's not `throw', then there's no exception-specification. */
21648 #if 0
21649 /* Enable this once a lot of code has transitioned to noexcept? */
21653 #endif
21655 /* Consume the `throw'. */
21658 /* Look for the `('. */
21661 /* Peek at the next token. */
21663 /* If it's not a `)', then there is a type-id-list. */
21665 {
21666 /* Types may not be defined in an exception-specification. */
21668 parser->type_definition_forbidden_message
21670 /* Parse the type-id-list. */
21672 /* Restore the saved message. */
21674 }
21675 else
21678 /* Look for the `)'. */
21682 }
21684 /* Parse an (optional) type-id-list.
21686 type-id-list:
21687 type-id ... [opt]
21688 type-id-list , type-id ... [opt]
21690 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21691 in the order that the types were presented. */
21693 static tree
21695 {
21699 {
21701 tree type;
21703 /* Get the next type-id. */
21705 /* Parse the optional ellipsis. */
21707 {
21708 /* Consume the `...'. */
21711 /* Turn the type into a pack expansion expression. */
21713 }
21714 /* Add it to the list. */
21716 /* Peek at the next token. */
21718 /* If it is not a `,', we are done. */
21721 /* Consume the `,'. */
21723 }
21726 }
21728 /* Parse a try-block.
21730 try-block:
21731 try compound-statement handler-seq */
21733 static tree
21735 {
21736 tree try_block;
21750 }
21752 /* Parse a function-try-block.
21754 function-try-block:
21755 try ctor-initializer [opt] function-body handler-seq */
21757 static bool
21759 {
21760 tree compound_stmt;
21761 tree try_block;
21764 /* Look for the `try' keyword. */
21767 /* Let the rest of the front end know where we are. */
21769 /* Parse the function-body. */
21770 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21772 /* We're done with the `try' part. */
21774 /* Parse the handlers. */
21776 /* We're done with the handlers. */
21780 }
21782 /* Parse a handler-seq.
21784 handler-seq:
21785 handler handler-seq [opt] */
21787 static void
21789 {
21791 {
21794 /* Parse the handler. */
21796 /* Peek at the next token. */
21798 /* If it's not `catch' then there are no more handlers. */
21801 }
21802 }
21804 /* Parse a handler.
21806 handler:
21807 catch ( exception-declaration ) compound-statement */
21809 static void
21811 {
21812 tree handler;
21813 tree declaration;
21823 }
21825 /* Parse an exception-declaration.
21827 exception-declaration:
21828 type-specifier-seq declarator
21829 type-specifier-seq abstract-declarator
21830 type-specifier-seq
21831 ...
21833 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21834 ellipsis variant is used. */
21836 static tree
21838 {
21839 cp_decl_specifier_seq type_specifiers;
21843 /* If it's an ellipsis, it's easy to handle. */
21845 {
21846 /* Consume the `...' token. */
21849 }
21851 /* Types may not be defined in exception-declarations. */
21853 parser->type_definition_forbidden_message
21856 /* Parse the type-specifier-seq. */
21860 /* If it's a `)', then there is no declarator. */
21863 else
21870 /* Restore the saved message. */
21877 }
21879 /* Parse a throw-expression.
21881 throw-expression:
21882 throw assignment-expression [opt]
21884 Returns a THROW_EXPR representing the throw-expression. */
21886 static tree
21888 {
21889 tree expression;
21894 /* Figure out whether or not there is an assignment-expression
21895 following the "throw" keyword. */
21903 else
21907 }
21909 /* GNU Extensions */
21911 /* Parse an (optional) asm-specification.
21913 asm-specification:
21914 asm ( string-literal )
21916 If the asm-specification is present, returns a STRING_CST
21917 corresponding to the string-literal. Otherwise, returns
21918 NULL_TREE. */
21920 static tree
21922 {
21924 tree asm_specification;
21926 /* Peek at the next token. */
21928 /* If the next token isn't the `asm' keyword, then there's no
21929 asm-specification. */
21933 /* Consume the `asm' token. */
21935 /* Look for the `('. */
21938 /* Look for the string-literal. */
21941 /* Look for the `)'. */
21945 }
21947 /* Parse an asm-operand-list.
21949 asm-operand-list:
21950 asm-operand
21951 asm-operand-list , asm-operand
21953 asm-operand:
21954 string-literal ( expression )
21955 [ string-literal ] string-literal ( expression )
21957 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21958 each node is the expression. The TREE_PURPOSE is itself a
21959 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21960 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21961 is a STRING_CST for the string literal before the parenthesis. Returns
21962 ERROR_MARK_NODE if any of the operands are invalid. */
21964 static tree
21966 {
21971 {
21972 tree string_literal;
21973 tree expression;
21974 tree name;
21977 {
21978 /* Consume the `[' token. */
21980 /* Read the operand name. */
21985 /* Look for the closing `]'. */
21987 }
21988 else
21990 /* Look for the string-literal. */
21993 /* Look for the `('. */
21995 /* Parse the expression. */
21997 /* Look for the `)'. */
22005 /* Add this operand to the list. */
22007 expression,
22008 asm_operands);
22009 /* If the next token is not a `,', there are no more
22010 operands. */
22013 /* Consume the `,'. */
22015 }
22018 }
22020 /* Parse an asm-clobber-list.
22022 asm-clobber-list:
22023 string-literal
22024 asm-clobber-list , string-literal
22026 Returns a TREE_LIST, indicating the clobbers in the order that they
22027 appeared. The TREE_VALUE of each node is a STRING_CST. */
22029 static tree
22031 {
22035 {
22036 tree string_literal;
22038 /* Look for the string literal. */
22040 /* Add it to the list. */
22042 /* If the next token is not a `,', then the list is
22043 complete. */
22046 /* Consume the `,' token. */
22048 }
22051 }
22053 /* Parse an asm-label-list.
22055 asm-label-list:
22056 identifier
22057 asm-label-list , identifier
22059 Returns a TREE_LIST, indicating the labels in the order that they
22060 appeared. The TREE_VALUE of each node is a label. */
22062 static tree
22064 {
22068 {
22071 /* Look for the identifier. */
22074 {
22077 {
22083 }
22084 }
22085 /* If the next token is not a `,', then the list is
22086 complete. */
22089 /* Consume the `,' token. */
22091 }
22094 }
22096 /* Return TRUE iff the next tokens in the stream are possibly the
22097 beginning of a GNU extension attribute. */
22099 static bool
22101 {
22103 }
22105 /* Return TRUE iff the next tokens in the stream are possibly the
22106 beginning of a standard C++-11 attribute specifier. */
22108 static bool
22110 {
22112 }
22114 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22115 beginning of a standard C++-11 attribute specifier. */
22117 static bool
22119 {
22127 }
22129 /* Return TRUE iff the next Nth tokens in the stream are possibly the
22130 beginning of a GNU extension attribute. */
22132 static bool
22134 {
22138 }
22140 /* Return true iff the next tokens can be the beginning of either a
22141 GNU attribute list, or a standard C++11 attribute sequence. */
22143 static bool
22145 {
22148 }
22150 /* Return true iff the next Nth tokens can be the beginning of either
22151 a GNU attribute list, or a standard C++11 attribute sequence. */
22153 static bool
22155 {
22158 }
22160 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
22161 of GNU attributes, or return NULL. */
22163 static tree
22165 {
22169 }
22171 #define CILK_SIMD_FN_CLAUSE_MASK \
22172 ((OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_VECTORLENGTH) \
22173 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_LINEAR) \
22174 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_UNIFORM) \
22175 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_MASK) \
22176 | (OMP_CLAUSE_MASK_1 << PRAGMA_CILK_CLAUSE_NOMASK))
22178 /* Parses the Cilk Plus SIMD-enabled function's attribute. Syntax:
22179 vector [(<clauses>)] */
22181 static void
22183 {
22187 {
22192 }
22195 {
22198 paren_scope++;
22199 }
22201 {
22204 paren_scope++;
22206 paren_scope--;
22207 /* Do not push the last ')' */
22210 }
22219 }
22221 /* Parse an (optional) series of attributes.
22223 attributes:
22224 attributes attribute
22226 attribute:
22227 __attribute__ (( attribute-list [opt] ))
22229 The return value is as for cp_parser_gnu_attribute_list. */
22231 static tree
22233 {
22237 {
22239 tree attribute_list;
22242 /* Peek at the next token. */
22244 /* If it's not `__attribute__', then we're done. */
22248 /* Consume the `__attribute__' keyword. */
22250 /* Look for the two `(' tokens. */
22254 /* Peek at the next token. */
22257 /* Parse the attribute-list. */
22259 else
22260 /* If the next token is a `)', then there is no attribute
22261 list. */
22264 /* Look for the two `)' tokens. */
22272 /* Add these new attributes to the list. */
22274 }
22277 }
22279 /* Returns true of NAME is an IDENTIFIER_NODE with identiifer "vector,"
22280 "__vector" or "__vector__." */
22284 {
22288 }
22290 /* Parse a GNU attribute-list.
22292 attribute-list:
22293 attribute
22294 attribute-list , attribute
22296 attribute:
22297 identifier
22298 identifier ( identifier )
22299 identifier ( identifier , expression-list )
22300 identifier ( expression-list )
22302 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
22303 to an attribute. The TREE_PURPOSE of each node is the identifier
22304 indicating which attribute is in use. The TREE_VALUE represents
22305 the arguments, if any. */
22307 static tree
22309 {
22315 {
22317 tree identifier;
22318 tree attribute;
22320 /* Look for the identifier. We also allow keywords here; for
22321 example `__attribute__ ((const))' is legal. */
22325 {
22328 /* Consume the token, but save it since we need it for the
22329 SIMD enabled function parsing. */
22332 /* Save away the identifier that indicates which attribute
22333 this is. */
22335 /* For keywords, use the canonical spelling, not the
22336 parsed identifier. */
22342 /* Peek at the next token. */
22344 /* If it's an `(', then parse the attribute arguments. */
22346 {
22351 {
22354 }
22355 else
22356 vec = cp_parser_parenthesized_expression_list
22362 else
22363 {
22366 }
22367 /* Save the arguments away. */
22369 }
22371 {
22374 }
22377 {
22378 /* Add this attribute to the list. */
22381 }
22384 }
22385 /* Now, look for more attributes. If the next token isn't a
22386 `,', we're done. */
22390 /* Consume the comma and keep going. */
22392 }
22395 /* We built up the list in reverse order. */
22397 }
22399 /* Parse a standard C++11 attribute.
22401 The returned representation is a TREE_LIST which TREE_PURPOSE is
22402 the scoped name of the attribute, and the TREE_VALUE is its
22403 arguments list.
22405 Note that the scoped name of the attribute is itself a TREE_LIST
22406 which TREE_PURPOSE is the namespace of the attribute, and
22407 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
22408 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
22409 and which TREE_PURPOSE is directly the attribute name.
22411 Clients of the attribute code should use get_attribute_namespace
22412 and get_attribute_name to get the actual namespace and name of
22413 attributes, regardless of their being GNU or C++11 attributes.
22415 attribute:
22416 attribute-token attribute-argument-clause [opt]
22418 attribute-token:
22419 identifier
22420 attribute-scoped-token
22422 attribute-scoped-token:
22423 attribute-namespace :: identifier
22425 attribute-namespace:
22426 identifier
22428 attribute-argument-clause:
22429 ( balanced-token-seq )
22431 balanced-token-seq:
22432 balanced-token [opt]
22433 balanced-token-seq balanced-token
22435 balanced-token:
22436 ( balanced-token-seq )
22437 [ balanced-token-seq ]
22438 { balanced-token-seq }. */
22440 static tree
22442 {
22446 /* First, parse name of the the attribute, a.k.a
22447 attribute-token. */
22464 {
22465 /* We are seeing a scoped attribute token. */
22475 else
22476 {
22480 }
22482 NULL_TREE);
22484 }
22485 else
22486 {
22488 NULL_TREE);
22489 /* C++11 noreturn attribute is equivalent to GNU's. */
22492 /* C++14 deprecated attribute is equivalent to GNU's. */
22494 {
22497 "%<deprecated%> is a C++14 feature;"
22500 }
22501 }
22503 /* Now parse the optional argument clause of the attribute. */
22508 {
22514 /* A GNU attribute that takes an identifier in parameter. */
22517 vec = cp_parser_parenthesized_expression_list
22523 else
22524 {
22527 }
22531 else
22533 }
22536 }
22538 /* Check that the attribute ATTRIBUTE appears at most once in the
22539 attribute-list ATTRIBUTES. This is enforced for noreturn (7.6.3)
22540 and deprecated (7.6.5). Note that carries_dependency (7.6.4)
22541 isn't implemented yet in GCC. */
22543 static void
22545 {
22547 {
22557 }
22558 }
22560 /* Parse a list of standard C++-11 attributes.
22562 attribute-list:
22563 attribute [opt]
22564 attribute-list , attribute[opt]
22565 attribute ...
22566 attribute-list , attribute ...
22567 */
22569 static tree
22571 {
22576 {
22581 {
22585 }
22588 {
22593 }
22597 }
22600 }
22602 /* Parse a standard C++-11 attribute specifier.
22604 attribute-specifier:
22605 [ [ attribute-list ] ]
22606 alignment-specifier
22608 alignment-specifier:
22609 alignas ( type-id ... [opt] )
22610 alignas ( alignment-expression ... [opt] ). */
22612 static tree
22614 {
22620 {
22629 else
22630 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22631 when we are sure that we have actually parsed them. */
22633 }
22634 else
22635 {
22636 tree alignas_expr;
22638 /* Look for an alignment-specifier. */
22650 {
22653 }
22659 {
22663 alignas_expr =
22670 }
22676 {
22679 }
22682 {
22685 }
22687 /* Build the C++-11 representation of an 'aligned'
22688 attribute. */
22689 attributes =
22692 alignas_expr);
22693 }
22696 }
22698 /* Parse a standard C++-11 attribute-specifier-seq.
22700 attribute-specifier-seq:
22701 attribute-specifier-seq [opt] attribute-specifier
22702 */
22704 static tree
22706 {
22710 {
22719 }
22723 }
22725 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22726 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22727 current value of the PEDANTIC flag, regardless of whether or not
22728 the `__extension__' keyword is present. The caller is responsible
22729 for restoring the value of the PEDANTIC flag. */
22731 static bool
22733 {
22734 /* Save the old value of the PEDANTIC flag. */
22738 {
22739 /* Consume the `__extension__' token. */
22741 /* We're not being pedantic while the `__extension__' keyword is
22742 in effect. */
22746 }
22749 }
22751 /* Parse a label declaration.
22753 label-declaration:
22754 __label__ label-declarator-seq ;
22756 label-declarator-seq:
22757 identifier , label-declarator-seq
22758 identifier */
22760 static void
22762 {
22763 /* Look for the `__label__' keyword. */
22767 {
22768 tree identifier;
22770 /* Look for an identifier. */
22772 /* If we failed, stop. */
22775 /* Declare it as a label. */
22777 /* If the next token is a `;', stop. */
22780 /* Look for the `,' separating the label declarations. */
22782 }
22784 /* Look for the final `;'. */
22786 }
22788 /* Support Functions */
22790 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22791 NAME should have one of the representations used for an
22792 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22793 is returned. If PARSER->SCOPE is a dependent type, then a
22794 SCOPE_REF is returned.
22796 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22797 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22798 was formed. Abstractly, such entities should not be passed to this
22799 function, because they do not need to be looked up, but it is
22800 simpler to check for this special case here, rather than at the
22801 call-sites.
22803 In cases not explicitly covered above, this function returns a
22804 DECL, OVERLOAD, or baselink representing the result of the lookup.
22805 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22806 is returned.
22808 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22809 (e.g., "struct") that was used. In that case bindings that do not
22810 refer to types are ignored.
22812 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22813 ignored.
22815 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22816 are ignored.
22818 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22819 types.
22821 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22822 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22823 NULL_TREE otherwise. */
22825 static tree
22832 location_t name_location)
22833 {
22834 tree decl;
22837 /* Assume that the lookup will be unambiguous. */
22841 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22842 no longer valid. Note that if we are parsing tentatively, and
22843 the parse fails, OBJECT_TYPE will be automatically restored. */
22849 /* A template-id has already been resolved; there is no lookup to
22850 do. */
22854 {
22858 }
22860 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22861 it should already have been checked to make sure that the name
22862 used matches the type being destroyed. */
22864 {
22865 tree type;
22867 /* Figure out to which type this destructor applies. */
22872 else
22874 /* If that's not a class type, there is no destructor. */
22881 /* If it was a class type, return the destructor. */
22883 }
22885 /* By this point, the NAME should be an ordinary identifier. If
22886 the id-expression was a qualified name, the qualifying scope is
22887 stored in PARSER->SCOPE at this point. */
22890 /* Perform the lookup. */
22892 {
22898 /* If the SCOPE is dependent, the lookup must be deferred until
22899 the template is instantiated -- unless we are explicitly
22900 looking up names in uninstantiated templates. Even then, we
22901 cannot look up the name if the scope is not a class type; it
22902 might, for example, be a template type parameter. */
22907 /* Defer lookup. */
22909 else
22910 {
22913 /* If PARSER->SCOPE is a dependent type, then it must be a
22914 class type, and we must not be checking dependencies;
22915 otherwise, we would have processed this lookup above. So
22916 that PARSER->SCOPE is not considered a dependent base by
22917 lookup_member, we must enter the scope here. */
22921 /* If the PARSER->SCOPE is a template specialization, it
22922 may be instantiated during name lookup. In that case,
22923 errors may be issued. Even if we rollback the current
22924 tentative parse, those errors are valid. */
22929 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22930 lookup result and the nested-name-specifier nominates a class C:
22931 * if the name specified after the nested-name-specifier, when
22932 looked up in C, is the injected-class-name of C (Clause 9), or
22933 * if the name specified after the nested-name-specifier is the
22934 same as the identifier or the simple-template-id's template-
22935 name in the last component of the nested-name-specifier,
22936 the name is instead considered to name the constructor of
22937 class C. [ Note: for example, the constructor is not an
22938 acceptable lookup result in an elaborated-type-specifier so
22939 the constructor would not be used in place of the
22940 injected-class-name. --end note ] Such a constructor name
22941 shall be used only in the declarator-id of a declaration that
22942 names a constructor or in a using-declaration. */
22950 /* If we have a single function from a using decl, pull it out. */
22957 }
22959 /* If the scope is a dependent type and either we deferred lookup or
22960 we did lookup but didn't find the name, rememeber the name. */
22963 {
22965 {
22966 tree type;
22968 /* The resolution to Core Issue 180 says that `struct
22969 A::B' should be considered a type-name, even if `A'
22970 is dependent. */
22975 }
22979 CPP_CLOSE_PAREN)))
22983 else
22986 is_template);
22987 }
22990 }
22992 {
22993 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22994 OBJECT_TYPE is not a class. */
22996 /* If the OBJECT_TYPE is a template specialization, it may
22997 be instantiated during name lookup. In that case, errors
22998 may be issued. Even if we rollback the current tentative
22999 parse, those errors are valid. */
23001 name,
23004 tf_warning_or_error);
23005 else
23009 /* Look it up in the enclosing context. */
23015 }
23016 else
23017 {
23023 }
23025 /* If the lookup failed, let our caller know. */
23029 /* Pull out the template from an injected-class-name (or multiple). */
23033 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
23035 {
23038 /* The error message we have to print is too complicated for
23039 cp_parser_error, so we incorporate its actions directly. */
23041 {
23043 name);
23045 }
23047 }
23055 /* If we have resolved the name of a member declaration, check to
23056 see if the declaration is accessible. When the name resolves to
23057 set of overloaded functions, accessibility is checked when
23058 overload resolution is done.
23060 During an explicit instantiation, access is not checked at all,
23061 as per [temp.explicit]. */
23068 }
23070 /* Like cp_parser_lookup_name, but for use in the typical case where
23071 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
23072 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
23074 static tree
23076 {
23078 none_type,
23083 location);
23084 }
23086 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
23087 the current context, return the TYPE_DECL. If TAG_NAME_P is
23088 true, the DECL indicates the class being defined in a class-head,
23089 or declared in an elaborated-type-specifier.
23091 Otherwise, return DECL. */
23093 static tree
23095 {
23096 /* If the TEMPLATE_DECL is being declared as part of a class-head,
23097 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
23099 struct A {
23100 template <typename T> struct B;
23101 };
23103 template <typename T> struct A::B {};
23105 Similarly, in an elaborated-type-specifier:
23107 namespace N { struct X{}; }
23109 struct A {
23110 template <typename T> friend struct N::X;
23111 };
23113 However, if the DECL refers to a class type, and we are in
23114 the scope of the class, then the name lookup automatically
23115 finds the TYPE_DECL created by build_self_reference rather
23116 than a TEMPLATE_DECL. For example, in:
23118 template <class T> struct S {
23119 S s;
23120 };
23122 there is no need to handle such case. */
23128 }
23130 /* If too many, or too few, template-parameter lists apply to the
23131 declarator, issue an error message. Returns TRUE if all went well,
23132 and FALSE otherwise. */
23134 static bool
23137 location_t declarator_location)
23138 {
23140 {
23142 {
23150 /* If the DECLARATOR has the form `X<y>' then it uses one
23151 additional level of template parameters. */
23154 return cp_parser_check_template_parameters
23156 }
23171 }
23173 }
23175 /* NUM_TEMPLATES were used in the current declaration. If that is
23176 invalid, return FALSE and issue an error messages. Otherwise,
23177 return TRUE. If DECLARATOR is non-NULL, then we are checking a
23178 declarator and we can print more accurate diagnostics. */
23180 static bool
23183 location_t location,
23185 {
23186 /* If there are the same number of template classes and parameter
23187 lists, that's OK. */
23190 /* If there are more, but only one more, then we are referring to a
23191 member template. That's OK too. */
23194 /* If there are more template classes than parameter lists, we have
23195 something like:
23197 template <class T> void S<T>::R<T>::f (); */
23199 {
23209 else
23212 }
23213 /* Otherwise, there are too many template parameter lists. We have
23214 something like:
23216 template <class T> template <class U> void S::f(); */
23219 }
23221 /* Parse an optional `::' token indicating that the following name is
23222 from the global namespace. If so, PARSER->SCOPE is set to the
23223 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
23224 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
23225 Returns the new value of PARSER->SCOPE, if the `::' token is
23226 present, and NULL_TREE otherwise. */
23228 static tree
23230 {
23233 /* Peek at the next token. */
23235 /* If we're looking at a `::' token then we're starting from the
23236 global namespace, not our current location. */
23238 {
23239 /* Consume the `::' token. */
23241 /* Set the SCOPE so that we know where to start the lookup. */
23247 }
23249 {
23253 }
23256 }
23258 /* Returns TRUE if the upcoming token sequence is the start of a
23259 constructor declarator. If FRIEND_P is true, the declarator is
23260 preceded by the `friend' specifier. */
23262 static bool
23264 {
23267 tree nested_name_specifier;
23270 /* The common case is that this is not a constructor declarator, so
23271 try to avoid doing lots of work if at all possible. It's not
23272 valid declare a constructor at function scope. */
23275 /* And only certain tokens can begin a constructor declarator. */
23283 /* Parse tentatively; we are going to roll back all of the tokens
23284 consumed here. */
23286 /* Assume that we are looking at a constructor declarator. */
23289 /* Look for the optional `::' operator. */
23292 /* Look for the nested-name-specifier. */
23293 nested_name_specifier
23304 /* Outside of a class-specifier, there must be a
23305 nested-name-specifier. */
23311 /* If we have a class scope, this is easy; DR 147 says that S::S always
23312 names the constructor, and no other qualified name could. */
23315 {
23325 }
23326 /* If we still think that this might be a constructor-declarator,
23327 look for a class-name. */
23329 {
23330 /* If we have:
23332 template <typename T> struct S {
23333 S();
23334 };
23336 we must recognize that the nested `S' names a class. */
23337 tree type_decl;
23341 none_type,
23345 /* If there was no class-name, then this is not a constructor.
23346 Otherwise, if we are in a class-specifier and we aren't
23347 handling a friend declaration, check that its type matches
23348 current_class_type (c++/38313). Note: error_mark_node
23349 is left alone for error recovery purposes. */
23351 && (outside_class_specifier_p
23356 /* If we're still considering a constructor, we have to see a `(',
23357 to begin the parameter-declaration-clause, followed by either a
23358 `)', an `...', or a decl-specifier. We need to check for a
23359 type-specifier to avoid being fooled into thinking that:
23361 S (f) (int);
23363 is a constructor. (It is actually a function named `f' that
23364 takes one parameter (of type `int') and returns a value of type
23365 `S'. */
23373 /* A parameter declaration begins with a decl-specifier,
23374 which is either the "attribute" keyword, a storage class
23375 specifier, or (usually) a type-specifier. */
23377 {
23378 tree type;
23382 /* Names appearing in the type-specifier should be looked up
23383 in the scope of the class. */
23386 else
23387 {
23390 {
23394 {
23397 }
23398 }
23400 }
23402 /* Inside the constructor parameter list, surrounding
23403 template-parameter-lists do not apply. */
23404 saved_num_template_parameter_lists
23408 /* Look for the type-specifier. */
23410 CP_PARSER_FLAGS_NONE,
23416 parser->num_template_parameter_lists
23419 /* Leave the scope of the class. */
23424 }
23425 }
23427 /* We did not really want to consume any tokens. */
23431 }
23433 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23434 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23435 they must be performed once we are in the scope of the function.
23437 Returns the function defined. */
23439 static tree
23440 cp_parser_function_definition_from_specifiers_and_declarator
23443 tree attributes,
23445 {
23446 tree fn;
23449 /* Begin the function-definition. */
23452 /* The things we're about to see are not directly qualified by any
23453 template headers we've seen thus far. */
23456 /* If there were names looked up in the decl-specifier-seq that we
23457 did not check, check them now. We must wait until we are in the
23458 scope of the function to perform the checks, since the function
23459 might be a friend. */
23463 {
23466 }
23469 {
23470 /* Skip the entire function. */
23473 }
23475 {
23476 /* Seen already, skip it. An error message has already been output. */
23480 /* If this is a function from a class, pop the nested class. */
23483 }
23484 else
23485 {
23486 timevar_id_t tv;
23489 else
23495 }
23498 }
23500 /* Parse the part of a function-definition that follows the
23501 declarator. INLINE_P is TRUE iff this function is an inline
23502 function defined within a class-specifier.
23504 Returns the function defined. */
23506 static tree
23509 {
23510 tree fn;
23516 bool fully_implicit_function_template_p
23519 tree implicit_template_parms
23522 cp_binding_level* implicit_template_scope
23528 /* If the next token is `return', then the code may be trying to
23529 make use of the "named return value" extension that G++ used to
23530 support. */
23533 {
23534 /* Consume the `return' keyword. */
23536 /* Look for the identifier that indicates what value is to be
23537 returned. */
23539 /* Issue an error message. */
23542 /* Skip tokens until we reach the start of the function body. */
23544 {
23551 }
23552 }
23553 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23554 anything declared inside `f'. */
23555 saved_in_unbraced_linkage_specification_p
23558 /* Inside the function, surrounding template-parameter-lists do not
23559 apply. */
23560 saved_num_template_parameter_lists
23566 /* If the next token is `try', `__transaction_atomic', or
23567 `__transaction_relaxed`, then we are looking at either function-try-block
23568 or function-transaction-block. Note that all of these include the
23569 function-body. */
23572 RID_TRANSACTION_ATOMIC);
23574 RID_TRANSACTION_RELAXED))
23576 RID_TRANSACTION_RELAXED);
23579 else
23580 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23585 /* Finish the function. */
23588 /* Generate code for it, if necessary. */
23590 /* Restore the saved values. */
23591 parser->in_unbraced_linkage_specification_p
23593 parser->num_template_parameter_lists
23597 parser->fully_implicit_function_template_p
23599 parser->implicit_template_parms
23601 parser->implicit_template_scope
23608 }
23610 /* Parse a template-declaration, assuming that the `export' (and
23611 `extern') keywords, if present, has already been scanned. MEMBER_P
23612 is as for cp_parser_template_declaration. */
23614 static void
23616 {
23619 tree parameter_list;
23624 /* Look for the `template' keyword. */
23629 /* And the `<'. */
23633 {
23634 /* 14.5.2.2 [temp.mem]
23636 A local class shall not have member templates. */
23641 }
23642 /* [temp]
23644 A template ... shall not have C linkage. */
23646 {
23648 /* Give it C++ linkage to avoid confusing other parts of the
23649 front end. */
23652 }
23653 else
23656 /* We cannot perform access checks on the template parameter
23657 declarations until we know what is being declared, just as we
23658 cannot check the decl-specifier list. */
23661 /* If the next token is `>', then we have an invalid
23662 specialization. Rather than complain about an invalid template
23663 parameter, issue an error message here. */
23665 {
23669 }
23670 else
23671 {
23672 /* Parse the template parameters. */
23674 }
23676 /* Get the deferred access checks from the parameter list. These
23677 will be checked once we know what is being declared, as for a
23678 member template the checks must be performed in the scope of the
23679 class containing the member. */
23682 /* Look for the `>'. */
23684 /* We just processed one more parameter list. */
23686 /* If the next token is `template', there are more template
23687 parameters. */
23689 RID_TEMPLATE))
23694 else
23695 {
23696 /* There are no access checks when parsing a template, as we do not
23697 know if a specialization will be a friend. */
23701 checks,
23702 member_p,
23707 /* If this is a member template declaration, let the front
23708 end know. */
23710 {
23715 }
23720 }
23721 /* We are done with the current parameter list. */
23726 /* Finish up. */
23729 /* Check the template arguments for a literal operator template. */
23733 {
23737 else
23738 {
23741 {
23747 }
23749 {
23757 }
23758 else
23760 }
23762 {
23765 " Expected non-type template argument pack <char...>"
23767 decl);
23768 else
23771 decl);
23772 }
23773 }
23774 /* Register member declarations. */
23777 /* For the erroneous case of a template with C linkage, we pushed an
23778 implicit C++ linkage scope; exit that scope now. */
23781 /* If DECL is a function template, we must return to parse it later.
23782 (Even though there is no definition, there might be default
23783 arguments that need handling.) */
23787 }
23789 /* Perform the deferred access checks from a template-parameter-list.
23790 CHECKS is a TREE_LIST of access checks, as returned by
23791 get_deferred_access_checks. */
23793 static void
23794 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23795 {
23799 }
23801 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23802 `function-definition' sequence that follows a template header.
23803 If MEMBER_P is true, this declaration appears in a class scope.
23805 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23806 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23808 static tree
23814 {
23817 cp_decl_specifier_seq decl_specifiers;
23821 /* This function is only used when processing a template
23822 declaration. */
23826 /* Defer access checks until we know what is being declared. */
23829 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23830 alternative. */
23833 CP_PARSER_FLAGS_OPTIONAL,
23839 /* There are no template typedefs. */
23841 {
23845 }
23847 /* Gather up the access checks that occurred the
23848 decl-specifier-seq. */
23851 /* Check for the declaration of a template class. */
23853 {
23855 {
23858 /* In this case:
23860 struct C {
23861 friend template <typename T> struct A<T>::B;
23862 };
23864 A<T>::B will be represented by a TYPENAME_TYPE, and
23865 therefore not recognized by shadow_tag. */
23867 && !decl
23874 else
23877 /* Perform access checks for template parameters. */
23879 }
23880 }
23882 /* Complain about missing 'typename' or other invalid type names. */
23885 {
23886 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23887 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23888 the rest of this declaration. */
23891 }
23893 /* If it's not a template class, try for a template function. If
23894 the next token is a `;', then this declaration does not declare
23895 anything. But, if there were errors in the decl-specifiers, then
23896 the error might well have come from an attempted class-specifier.
23897 In that case, there's no need to warn about a missing declarator. */
23901 {
23904 checks,
23906 member_p,
23907 declares_class_or_enum,
23911 /* 7.1.1-1 [dcl.stc]
23913 A storage-class-specifier shall not be specified in an explicit
23914 specialization... */
23916 && explicit_specialization_p
23918 {
23922 }
23926 }
23928 /* Look for a trailing `;' after the declaration. */
23934 out:
23937 /* Clear any current qualification; whatever comes next is the start
23938 of something new. */
23944 }
23946 /* Parse a cast-expression that is not the operand of a unary "&". */
23948 static tree
23950 {
23953 }
23955 /* Parse a functional cast to TYPE. Returns an expression
23956 representing the cast. */
23958 static tree
23960 {
23962 tree expression_list;
23963 tree cast;
23970 {
23978 tf_warning_or_error);
23979 }
23988 else
23989 {
23992 }
23995 tf_warning_or_error);
23996 /* [expr.const]/1: In an integral constant expression "only type
23997 conversions to integral or enumeration type can be used". */
24003 NIC_CONSTRUCTOR))
24006 }
24008 /* Save the tokens that make up the body of a member function defined
24009 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
24010 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
24011 specifiers applied to the declaration. Returns the FUNCTION_DECL
24012 for the member function. */
24014 static tree
24018 tree attributes)
24019 {
24022 tree fn;
24024 /* Create the FUNCTION_DECL. */
24027 /* If something went badly wrong, bail out now. */
24029 {
24030 /* If there's a function-body, skip it. */
24035 }
24037 /* Remember it, if there default args to post process. */
24040 /* Save away the tokens that make up the body of the
24041 function. */
24043 /* Handle function try blocks. */
24046 /* We can have braced-init-list mem-initializers before the fn body. */
24048 {
24051 {
24052 /* cache_group will stop after an un-nested { } pair, too. */
24056 /* variadic mem-inits have ... after the ')'. */
24059 }
24060 }
24062 /* Handle function try blocks. */
24067 /* Save away the inline definition; we will process it when the
24068 class is complete. */
24072 /* We need to know that this was defined in the class, so that
24073 friend templates are handled correctly. */
24076 /* Add FN to the queue of functions to be parsed later. */
24080 }
24082 /* Save the tokens that make up the in-class initializer for a non-static
24083 data member. Returns a DEFAULT_ARG. */
24085 static tree
24087 {
24089 }
24091 /* Parse a template-argument-list, as well as the trailing ">" (but
24092 not the opening "<"). See cp_parser_template_argument_list for the
24093 return value. */
24095 static tree
24097 {
24098 tree arguments;
24099 tree saved_scope;
24100 tree saved_qualifying_scope;
24101 tree saved_object_scope;
24106 /* [temp.names]
24108 When parsing a template-id, the first non-nested `>' is taken as
24109 the end of the template-argument-list rather than a greater-than
24110 operator. */
24111 saved_greater_than_is_operator_p
24114 /* Parsing the argument list may modify SCOPE, so we save it
24115 here. */
24119 /* We need to evaluate the template arguments, even though this
24120 template-id may be nested within a "sizeof". */
24125 /* Parse the template-argument-list itself. */
24129 else
24131 /* Look for the `>' that ends the template-argument-list. If we find
24132 a '>>' instead, it's probably just a typo. */
24134 {
24136 {
24137 /* In C++0x, a `>>' in a template argument list or cast
24138 expression is considered to be two separate `>'
24139 tokens. So, change the current token to a `>', but don't
24140 consume it: it will be consumed later when the outer
24141 template argument list (or cast expression) is parsed.
24142 Note that this replacement of `>' for `>>' is necessary
24143 even if we are parsing tentatively: in the tentative
24144 case, after calling
24145 cp_parser_enclosed_template_argument_list we will always
24146 throw away all of the template arguments and the first
24147 closing `>', either because the template argument list
24148 was erroneous or because we are replacing those tokens
24149 with a CPP_TEMPLATE_ID token. The second `>' (which will
24150 not have been thrown away) is needed either to close an
24151 outer template argument list or to complete a new-style
24152 cast. */
24155 }
24157 {
24158 /* If we're in a nested template argument list, the '>>' has
24159 to be a typo for '> >'. We emit the error message, but we
24160 continue parsing and we push a '>' as next token, so that
24161 the argument list will be parsed correctly. Note that the
24162 global source location is still on the token before the
24163 '>>', so we need to say explicitly where we want it. */
24169 }
24170 else
24171 {
24172 /* If this is not a nested template argument list, the '>>'
24173 is a typo for '>'. Emit an error message and continue.
24174 Same deal about the token location, but here we can get it
24175 right by consuming the '>>' before issuing the diagnostic. */
24178 "spurious %<>>%>, use %<>%> to terminate "
24180 }
24181 }
24182 else
24184 /* The `>' token might be a greater-than operator again now. */
24185 parser->greater_than_is_operator_p
24187 /* Restore the SAVED_SCOPE. */
24195 }
24197 /* MEMBER_FUNCTION is a member function, or a friend. If default
24198 arguments, or the body of the function have not yet been parsed,
24199 parse them now. */
24201 static void
24203 {
24205 /* If this member is a template, get the underlying
24206 FUNCTION_DECL. */
24210 /* There should not be any class definitions in progress at this
24211 point; the bodies of members are only parsed outside of all class
24212 definitions. */
24214 /* While we're parsing the member functions we might encounter more
24215 classes. We want to handle them right away, but we don't want
24216 them getting mixed up with functions that are currently in the
24217 queue. */
24220 /* Make sure that any template parameters are in scope. */
24223 /* If the body of the function has not yet been parsed, parse it
24224 now. */
24226 {
24227 tree function_scope;
24230 /* The function is no longer pending; we are processing it. */
24235 /* If this is a local class, enter the scope of the containing
24236 function. */
24241 /* Push the body of the function onto the lexer stack. */
24244 /* Let the front end know that we going to be defining this
24245 function. */
24249 /* Don't do access checking if it is a templated function. */
24253 /* #pragma omp declare reduction needs special parsing. */
24255 {
24260 }
24261 else
24262 /* Now, parse the body of the function. */
24269 /* Leave the scope of the containing function. */
24273 }
24275 /* Remove any template parameters from the symbol table. */
24278 /* Restore the queue. */
24281 }
24283 /* If DECL contains any default args, remember it on the unparsed
24284 functions queue. */
24286 static void
24288 {
24289 tree probe;
24292 probe;
24295 {
24299 }
24300 }
24302 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24303 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24304 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24305 from the parameter-type-list. */
24307 static tree
24310 {
24312 tree parsed_arg;
24318 /* Push the saved tokens for the default argument onto the parser's
24319 lexer stack. */
24325 /* Parse the default argument. */
24336 {
24337 /* In a non-template class, check conversions now. In a template,
24338 we'll wait and instantiate these as needed. */
24341 tf_warning_or_error);
24342 else
24344 }
24346 /* If the token stream has not been completely used up, then
24347 there was extra junk after the end of the default
24348 argument. */
24350 {
24353 else
24355 }
24357 /* Revert to the main lexer. */
24361 }
24363 /* FIELD is a non-static data member with an initializer which we saved for
24364 later; parse it now. */
24366 static void
24368 {
24369 tree def;
24376 NULL_TREE);
24382 }
24384 /* FN is a FUNCTION_DECL which may contains a parameter with an
24385 unparsed DEFAULT_ARG. Parse the default args now. This function
24386 assumes that the current scope is the scope in which the default
24387 argument should be processed. */
24389 static void
24391 {
24395 /* While we're parsing the default args, we might (due to the
24396 statement expression extension) encounter more classes. We want
24397 to handle them right away, but we don't want them getting mixed
24398 up with default args that are currently in the queue. */
24401 /* Local variable names (and the `this' keyword) may not appear
24402 in a default argument. */
24413 {
24415 tree parsed_arg;
24417 tree copy;
24424 /* This can happen for a friend declaration for a function
24425 already declared with default arguments. */
24428 parsed_arg
24430 default_arg,
24433 {
24435 }
24439 /* Update any instantiations we've already created. */
24443 }
24447 /* Make sure no default arg is missing. */
24450 /* Restore the state of local_variables_forbidden_p. */
24453 /* Restore the queue. */
24455 }
24457 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24459 sizeof ... ( identifier )
24461 where the 'sizeof' token has already been consumed. */
24463 static tree
24465 {
24466 /* Consume the `...'. */
24473 else
24481 /* The name is not qualified. */
24499 }
24501 /* Parse the operand of `sizeof' (or a similar operator). Returns
24502 either a TYPE or an expression, depending on the form of the
24503 input. The KEYWORD indicates which kind of expression we have
24504 encountered. */
24506 static tree
24508 {
24515 /* If it's a `...', then we are computing the length of a parameter
24516 pack. */
24521 /* Types cannot be defined in a `sizeof' expression. Save away the
24522 old message. */
24524 /* And create the new one. */
24530 /* The restrictions on constant-expressions do not apply inside
24531 sizeof expressions. */
24532 saved_integral_constant_expression_p
24534 saved_non_integral_constant_expression_p
24538 /* Do not actually evaluate the expression. */
24541 /* If it's a `(', then we might be looking at the type-id
24542 construction. */
24544 {
24547 /* We can't be sure yet whether we're looking at a type-id or an
24548 expression. */
24550 /* Note: as a GNU Extension, compound literals are considered
24551 postfix-expressions as they are in C99, so they are valid
24552 arguments to sizeof. See comment in cp_parser_cast_expression
24553 for details. */
24556 else
24557 {
24560 /* Look for the type-id. */
24562 /* Look for the closing `)'. */
24565 }
24567 /* If all went well, then we're done. */
24569 {
24570 cp_decl_specifier_seq decl_specs;
24572 /* Build a trivial decl-specifier-seq. */
24576 /* Call grokdeclarator to figure out what type this is. */
24579 TYPENAME,
24582 }
24583 }
24585 /* If the type-id production did not work out, then we must be
24586 looking at the unary-expression production. */
24590 /* Go back to evaluating expressions. */
24594 /* Free the message we created. */
24596 /* And restore the old one. */
24598 parser->integral_constant_expression_p
24600 parser->non_integral_constant_expression_p
24604 }
24606 /* If the current declaration has no declarator, return true. */
24608 static bool
24610 {
24611 /* If the next token is a `;' or a `,' then there is no
24612 declarator. */
24615 }
24617 /* Update the DECL_SPECS to reflect the storage class indicated by
24618 KEYWORD. */
24620 static void
24625 {
24626 cp_storage_class storage_class;
24629 {
24633 }
24635 {
24638 }
24643 {
24646 }
24649 {
24667 }
24671 /* A storage class specifier cannot be applied alongside a typedef
24672 specifier. If there is a typedef specifier present then set
24673 conflicting_specifiers_p which will trigger an error later
24674 on in grokdeclarator. */
24677 }
24679 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24680 is true, the type is a class or enum definition. */
24682 static void
24684 tree type_spec,
24687 {
24690 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24691 (with, for example, in "typedef int wchar_t;") we remember that
24692 this is what happened. In system headers, we ignore these
24693 declarations so that G++ can work with system headers that are not
24694 C++-safe. */
24696 && !type_definition_p
24706 {
24709 ds_redefined_builtin_type_spec,
24710 token);
24712 {
24716 }
24717 }
24720 else
24721 {
24726 }
24727 }
24729 /* True iff TOKEN is the GNU keyword __thread. */
24731 static bool
24733 {
24736 }
24738 /* Set the location for a declarator specifier and check if it is
24739 duplicated.
24741 DECL_SPECS is the sequence of declarator specifiers onto which to
24742 set the location.
24744 DS is the single declarator specifier to set which location is to
24745 be set onto the existing sequence of declarators.
24747 LOCATION is the location for the declarator specifier to
24748 consider. */
24750 static void
24753 {
24762 {
24766 }
24767 else
24768 {
24770 {
24774 else
24775 {
24778 OPT_Wlong_long,
24780 }
24781 }
24783 {
24788 else
24790 }
24791 else
24792 {
24808 "__complex"
24809 };
24812 }
24813 }
24814 }
24816 /* Return true iff the declarator specifier DS is present in the
24817 sequence of declarator specifiers DECL_SPECS. */
24819 bool
24821 cp_decl_spec ds)
24822 {
24829 }
24831 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24832 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24834 static bool
24836 {
24838 }
24840 /* Issue an error message indicating that TOKEN_DESC was expected.
24841 If KEYWORD is true, it indicated this function is called by
24842 cp_parser_require_keword and the required token can only be
24843 a indicated keyword. */
24845 static void
24847 required_token token_desc,
24849 {
24851 {
24920 }
24922 {
24924 {
25003 }
25004 }
25005 else
25007 }
25011 /* If the next token is of the indicated TYPE, consume it. Otherwise,
25012 issue an error message indicating that TOKEN_DESC was expected.
25014 Returns the token consumed, if the token had the appropriate type.
25015 Otherwise, returns NULL. */
25020 required_token token_desc)
25021 {
25024 else
25025 {
25026 /* Output the MESSAGE -- unless we're parsing tentatively. */
25030 }
25031 }
25033 /* An error message is produced if the next token is not '>'.
25034 All further tokens are skipped until the desired token is
25035 found or '{', '}', ';' or an unbalanced ')' or ']'. */
25037 static void
25039 {
25040 /* Current level of '< ... >'. */
25042 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
25045 /* Are we ready, yet? If not, issue error message. */
25049 /* Skip tokens until the desired token is found. */
25051 {
25052 /* Peek at the next token. */
25054 {
25062 /* C++0x views the `>>' operator as two `>' tokens, but
25063 C++98 does not. */
25066 {
25067 /* We've hit a `>>' where the first `>' closes the
25068 template argument list, and the second `>' is
25069 spurious. Just consume the `>>' and stop; we've
25070 already produced at least one error. */
25073 }
25074 /* Fall through for C++0x, so we handle the second `>' in
25075 the `>>'. */
25079 {
25080 /* We've reached the token we want, consume it and stop. */
25083 }
25102 /* The '>' was probably forgotten, don't look further. */
25107 }
25109 /* Consume this token. */
25111 }
25112 }
25114 /* If the next token is the indicated keyword, consume it. Otherwise,
25115 issue an error message indicating that TOKEN_DESC was expected.
25117 Returns the token consumed, if the token had the appropriate type.
25118 Otherwise, returns NULL. */
25123 required_token token_desc)
25124 {
25128 {
25131 }
25134 }
25136 /* Returns TRUE iff TOKEN is a token that can begin the body of a
25137 function-definition. */
25139 static bool
25141 {
25144 /* A ctor-initializer begins with a `:'. */
25146 /* A function-try-block begins with `try'. */
25148 /* A function-transaction-block begins with `__transaction_atomic'
25149 or `__transaction_relaxed'. */
25152 /* The named return value extension begins with `return'. */
25154 }
25156 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
25157 definition. */
25159 static bool
25161 {
25168 }
25170 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
25171 C++0x) ending a template-argument. */
25173 static bool
25175 {
25183 }
25185 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
25186 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
25188 static bool
25191 {
25197 /* Check for the sequence `<::' in the original code. It would be lexed as
25198 `[:', where `[' is a digraph, and there is no whitespace before
25199 `:'. */
25201 {
25206 }
25208 }
25210 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
25211 or none_type otherwise. */
25213 static enum tag_types
25215 {
25217 {
25227 }
25228 }
25230 /* Returns the kind of tag indicated by TOKEN, if it is a type-parameter-key,
25231 or none_type otherwise or if the token is null. */
25233 static enum tag_types
25235 {
25240 {
25248 }
25249 }
25251 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
25253 static void
25255 {
25259 {
25263 type))
25266 }
25267 }
25269 /* Issue an error message if DECL is redeclared with different
25270 access than its original declaration [class.access.spec/3].
25271 This applies to nested classes and nested class templates.
25272 [class.mem/1]. */
25274 static void
25276 {
25285 }
25287 /* Look for the `template' keyword, as a syntactic disambiguator.
25288 Return TRUE iff it is present, in which case it will be
25289 consumed. */
25291 static bool
25293 {
25295 {
25296 /* In C++98 the `template' keyword can only be used within templates;
25297 outside templates the parser can always figure out what is a
25298 template and what is not. In C++11, per the resolution of DR 468,
25299 `template' is allowed in cases where it is not strictly necessary. */
25302 {
25305 "in C++98 %<template%> (as a disambiguator) is only "
25307 /* If this part of the token stream is rescanned, the same
25308 error message would be generated. So, we purge the token
25309 from the stream. */
25312 }
25313 else
25314 {
25315 /* Consume the `template' keyword. */
25318 }
25319 }
25321 }
25323 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25324 set PARSER->SCOPE, and perform other related actions. */
25326 static void
25328 {
25334 /* Get the stored value. */
25336 /* Perform any access checks that were deferred. */
25339 {
25344 }
25345 /* Set the scope from the stored value. */
25349 }
25351 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25352 encounter the end of a block before what we were looking for. */
25354 static bool
25358 {
25360 {
25363 /* Abort a parenthesized expression if we encounter a semicolon. */
25367 /* If we've reached the end of the file, stop. */
25373 /* We've hit the end of an enclosing block, so there's been some
25374 kind of syntax error. */
25377 /* Consume the token. */
25379 /* See if it starts a new group. */
25381 {
25383 /* In theory this should probably check end == '}', but
25384 cp_parser_save_member_function_body needs it to exit
25385 after either '}' or ')' when called with ')'. */
25388 }
25390 {
25394 }
25399 }
25400 }
25402 /* Like above, for caching a default argument or NSDMI. Both of these are
25403 terminated by a non-nested comma, but it can be unclear whether or not a
25404 comma is nested in a template argument list unless we do more parsing.
25405 In order to handle this ambiguity, when we encounter a ',' after a '<'
25406 we try to parse what follows as a parameter-declaration-list (in the
25407 case of a default argument) or a member-declarator (in the case of an
25408 NSDMI). If that succeeds, then we stop caching. */
25410 static tree
25412 {
25417 tree default_argument;
25419 /* Add tokens until we have processed the entire default
25420 argument. We add the range [first_token, token). */
25423 {
25424 /* For list-initialization, this is straightforward. */
25427 }
25429 {
25432 /* Peek at the next token. */
25434 /* What we do depends on what token we have. */
25436 {
25437 /* In valid code, a default argument must be
25438 immediately followed by a `,' `)', or `...'. */
25441 {
25442 /* If we've seen a '<', we might be in a
25443 template-argument-list. Until Core issue 325 is
25444 resolved, we don't know how this situation ought
25445 to be handled, so try to DTRT. We check whether
25446 what comes after the comma is a valid parameter
25447 declaration list. If it is, then the comma ends
25448 the default argument; otherwise the default
25449 argument continues. */
25453 /* Set ITALP so cp_parser_parameter_declaration_list
25454 doesn't decide to commit to this parse. */
25461 {
25462 /* Parse declarators until we reach a non-comma or
25463 somthing that cannot be an initializer.
25464 Just checking whether we're looking at a single
25465 declarator is insufficient. Consider:
25466 int var = tuple<T,U>::x;
25467 The template parameter 'U' looks exactly like a
25468 declarator. */
25469 do
25470 {
25481 }
25483 /* If we met an '=' or ';' then the original comma
25484 was the end of the NSDMI. Otherwise assume
25485 we're still in the NSDMI. */
25488 }
25489 else
25490 {
25495 }
25502 }
25505 /* If we run into a non-nested `;', `}', or `]',
25506 then the code is invalid -- but the default
25507 argument is certainly over. */
25512 /* Handle correctly int n = sizeof ... ( p ); */
25515 /* Update DEPTH, if necessary. */
25530 /* This might be the comparison operator, or it might
25531 start a template argument list. */
25538 /* Fall through for C++0x, which treats the `>>'
25539 operator like two `>' tokens in certain
25540 cases. */
25544 {
25545 /* This might be an operator, or it might close a
25546 template argument list. But if a previous '<'
25547 started a template argument list, this will have
25548 closed it, so we can't be in one anymore. */
25552 }
25555 /* If we run out of tokens, issue an error message. */
25564 /* In these cases, we should look for template-ids.
25565 For example, if the default argument is
25566 `X<int, double>()', we need to do name lookup to
25567 figure out whether or not `X' is a template; if
25568 so, the `,' does not end the default argument.
25570 That is not yet done. */
25575 }
25577 /* If we've reached the end, stop. */
25581 /* Add the token to the token block. */
25583 }
25585 /* Create a DEFAULT_ARG to represent the unparsed default
25586 argument. */
25593 }
25595 /* Begin parsing tentatively. We always save tokens while parsing
25596 tentatively so that if the tentative parsing fails we can restore the
25597 tokens. */
25599 static void
25601 {
25602 /* Enter a new parsing context. */
25604 /* Begin saving tokens. */
25606 /* In order to avoid repetitive access control error messages,
25607 access checks are queued up until we are no longer parsing
25608 tentatively. */
25610 }
25612 /* Commit to the currently active tentative parse. */
25614 static void
25616 {
25620 /* Mark all of the levels as committed. */
25623 {
25630 }
25631 }
25633 /* Commit to the topmost currently active tentative parse.
25635 Note that this function shouldn't be called when there are
25636 irreversible side-effects while in a tentative state. For
25637 example, we shouldn't create a permanent entry in the symbol
25638 table, or issue an error message that might not apply if the
25639 tentative parse is aborted. */
25641 static void
25643 {
25648 {
25656 }
25657 }
25659 /* Abort the currently active tentative parse. All consumed tokens
25660 will be rolled back, and no diagnostics will be issued. */
25662 static void
25664 {
25668 /* Now, pretend that we want to see if the construct was
25669 successfully parsed. */
25671 }
25673 /* Stop parsing tentatively. If a parse error has occurred, restore the
25674 token stream. Otherwise, commit to the tokens we have consumed.
25675 Returns true if no error occurred; false otherwise. */
25677 static bool
25679 {
25683 /* Remember whether or not an error occurred, since we are about to
25684 destroy that information. */
25686 /* Remove the topmost context from the stack. */
25689 /* If no parse errors occurred, commit to the tentative parse. */
25691 {
25692 /* Commit to the tokens read tentatively, unless that was
25693 already done. */
25698 }
25699 /* Otherwise, if errors occurred, roll back our state so that things
25700 are just as they were before we began the tentative parse. */
25701 else
25702 {
25705 }
25706 /* Add the context to the front of the free list. */
25711 }
25713 /* Returns true if we are parsing tentatively and are not committed to
25714 this tentative parse. */
25716 static bool
25718 {
25721 }
25723 /* Returns nonzero iff an error has occurred during the most recent
25724 tentative parse. */
25726 static bool
25728 {
25731 }
25733 /* Returns nonzero if GNU extensions are allowed. */
25735 static bool
25737 {
25739 }
25740 \f
25741 /* Objective-C++ Productions */
25744 /* Parse an Objective-C expression, which feeds into a primary-expression
25745 above.
25747 objc-expression:
25748 objc-message-expression
25749 objc-string-literal
25750 objc-encode-expression
25751 objc-protocol-expression
25752 objc-selector-expression
25754 Returns a tree representation of the expression. */
25756 static tree
25758 {
25759 /* Try to figure out what kind of declaration is present. */
25763 {
25773 {
25785 }
25791 }
25794 }
25796 /* Parse an Objective-C message expression.
25798 objc-message-expression:
25799 [ objc-message-receiver objc-message-args ]
25801 Returns a representation of an Objective-C message. */
25803 static tree
25805 {
25814 }
25816 /* Parse an objc-message-receiver.
25818 objc-message-receiver:
25819 expression
25820 simple-type-specifier
25822 Returns a representation of the type or expression. */
25824 static tree
25826 {
25827 tree rcv;
25829 /* An Objective-C message receiver may be either (1) a type
25830 or (2) an expression. */
25834 /* If that worked out, fine. */
25841 CP_PARSER_FLAGS_NONE);
25848 }
25850 /* Parse the arguments and selectors comprising an Objective-C message.
25852 objc-message-args:
25853 objc-selector
25854 objc-selector-args
25855 objc-selector-args , objc-comma-args
25857 objc-selector-args:
25858 objc-selector [opt] : assignment-expression
25859 objc-selector-args objc-selector [opt] : assignment-expression
25861 objc-comma-args:
25862 assignment-expression
25863 objc-comma-args , assignment-expression
25865 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25866 selector arguments and TREE_VALUE containing a list of comma
25867 arguments. */
25869 static tree
25871 {
25877 {
25883 /* Detect if we have a unary selector. */
25892 sel_args
25897 }
25899 /* Handle non-selector arguments, if any. */
25901 {
25902 tree arg;
25907 addl_args
25912 }
25915 {
25918 }
25921 }
25923 /* Parse an Objective-C encode expression.
25925 objc-encode-expression:
25926 @encode objc-typename
25928 Returns an encoded representation of the type argument. */
25930 static tree
25932 {
25933 tree type;
25943 {
25947 }
25949 /* This happens if we find @encode(T) (where T is a template
25950 typename or something dependent on a template typename) when
25951 parsing a template. In that case, we can't compile it
25952 immediately, but we rather create an AT_ENCODE_EXPR which will
25953 need to be instantiated when the template is used.
25954 */
25956 {
25960 }
25963 }
25965 /* Parse an Objective-C @defs expression. */
25967 static tree
25969 {
25970 tree name;
25978 }
25980 /* Parse an Objective-C protocol expression.
25982 objc-protocol-expression:
25983 @protocol ( identifier )
25985 Returns a representation of the protocol expression. */
25987 static tree
25989 {
25990 tree proto;
25998 }
26000 /* Parse an Objective-C selector expression.
26002 objc-selector-expression:
26003 @selector ( objc-method-signature )
26005 objc-method-signature:
26006 objc-selector
26007 objc-selector-seq
26009 objc-selector-seq:
26010 objc-selector :
26011 objc-selector-seq objc-selector :
26013 Returns a representation of the method selector. */
26015 static tree
26017 {
26029 {
26038 {
26039 /* Detect if we have a unary selector. */
26041 {
26044 }
26045 else
26046 {
26048 }
26049 }
26054 {
26055 sel_seq
26058 sel_seq
26061 }
26062 else
26063 sel_seq
26068 }
26070 finish_selector:
26074 }
26076 /* Parse a list of identifiers.
26078 objc-identifier-list:
26079 identifier
26080 objc-identifier-list , identifier
26082 Returns a TREE_LIST of identifier nodes. */
26084 static tree
26086 {
26087 tree identifier;
26088 tree list;
26099 {
26106 identifier));
26108 }
26111 }
26113 /* Parse an Objective-C alias declaration.
26115 objc-alias-declaration:
26116 @compatibility_alias identifier identifier ;
26118 This function registers the alias mapping with the Objective-C front end.
26119 It returns nothing. */
26121 static void
26123 {
26131 }
26133 /* Parse an Objective-C class forward-declaration.
26135 objc-class-declaration:
26136 @class objc-identifier-list ;
26138 The function registers the forward declarations with the Objective-C
26139 front end. It returns nothing. */
26141 static void
26143 {
26146 {
26147 tree id;
26157 else
26159 }
26161 }
26163 /* Parse a list of Objective-C protocol references.
26165 objc-protocol-refs-opt:
26166 objc-protocol-refs [opt]
26168 objc-protocol-refs:
26169 < objc-identifier-list >
26171 Returns a TREE_LIST of identifiers, if any. */
26173 static tree
26175 {
26179 {
26183 }
26186 }
26188 /* Parse a Objective-C visibility specification. */
26190 static void
26192 {
26196 {
26211 }
26213 /* Eat '@private'/'@protected'/'@public'. */
26215 }
26217 /* Parse an Objective-C method type. Return 'true' if it is a class
26218 (+) method, and 'false' if it is an instance (-) method. */
26222 {
26225 else
26227 }
26229 /* Parse an Objective-C protocol qualifier. */
26231 static tree
26233 {
26246 {
26251 }
26254 }
26256 /* Parse an Objective-C typename. */
26258 static tree
26260 {
26264 {
26270 /* An ObjC type name may consist of just protocol qualifiers, in which
26271 case the type shall default to 'id'. */
26273 {
26276 /* If the type could not be parsed, an error has already
26277 been produced. For error recovery, behave as if it had
26278 not been specified, which will use the default type
26279 'id'. */
26281 {
26283 /* We need to skip to the closing parenthesis as
26284 cp_parser_type_id() does not seem to do it for
26285 us. */
26290 }
26291 }
26295 }
26298 }
26300 /* Check to see if TYPE refers to an Objective-C selector name. */
26302 static bool
26304 {
26310 }
26312 /* Parse an Objective-C selector. */
26314 static tree
26316 {
26320 {
26323 }
26325 /* C++ operator names are allowed to appear in ObjC selectors. */
26327 {
26340 }
26341 }
26343 /* Parse an Objective-C params list. */
26345 static tree
26347 {
26353 {
26363 /* Detect if we have a unary selector. */
26366 {
26369 }
26373 {
26374 /* Something went quite wrong. There should be a colon
26375 here, but there is not. Stop parsing parameters. */
26377 }
26379 /* New ObjC allows attributes on parameters too. */
26384 params
26387 type_name,
26388 identifier,
26389 parm_attr));
26392 }
26395 {
26398 }
26400 /* We allow tail attributes for the method. */
26402 {
26410 }
26413 {
26416 }
26418 }
26420 /* Parse the non-keyword Objective-C params. */
26422 static tree
26425 {
26431 {
26433 tree parm;
26439 {
26444 }
26446 /* TODO: parse attributes for tail parameters. */
26455 }
26457 /* We allow tail attributes for the method. */
26459 {
26461 {
26466 }
26467 else
26468 /* We have an error, but parse the attributes, so that we can
26469 carry on. */
26475 }
26478 }
26480 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26482 static void
26484 {
26487 /* If the next token is `extern' and the following token is a string
26488 literal, then we have a linkage specification. */
26490 && cp_parser_is_pure_string_literal
26493 /* Handle #pragma, if any. */
26496 /* Allow stray semicolons. */
26499 /* Mark methods as optional or required, when building protocols. */
26501 {
26504 }
26506 {
26509 }
26512 /* Other stray characters must generate errors. */
26514 {
26518 }
26519 /* Finally, try to parse a block-declaration, or a function-definition. */
26520 else
26522 }
26524 /* Parse a method signature. */
26526 static tree
26528 {
26544 }
26546 static bool
26548 {
26549 tree tattr;
26554 /* If the attributes are followed by a method introducer, this is not allowed.
26555 Dump the attributes and flag the situation. */
26560 /* Otherwise, the attributes introduce some interstitial code, possibly so
26561 rewind to allow that check. */
26564 }
26566 /* Parse an Objective-C method prototype list. */
26568 static void
26570 {
26574 {
26576 {
26581 else
26585 {
26589 }
26592 }
26598 OPT_Wattributes,
26600 else
26601 /* Allow for interspersed non-ObjC++ code. */
26605 }
26609 else
26613 }
26615 /* Parse an Objective-C method definition list. */
26617 static void
26619 {
26623 {
26624 tree meth;
26627 {
26633 else
26638 {
26642 }
26644 NULL_TREE);
26646 /* For historical reasons, we accept an optional semicolon. */
26653 {
26660 }
26661 }
26662 /* The following case will be removed once @synthesize is
26663 completely implemented. */
26674 else
26675 /* Allow for interspersed non-ObjC++ code. */
26679 }
26683 else
26687 }
26689 /* Parse Objective-C ivars. */
26691 static void
26693 {
26704 {
26705 cp_decl_specifier_seq declspecs;
26707 tree prefix_attributes;
26715 CP_PARSER_FLAGS_OPTIONAL,
26719 /* auto, register, static, extern, mutable. */
26721 {
26724 }
26726 /* thread_local. */
26728 {
26731 }
26733 /* typedef. */
26735 {
26738 }
26743 /* Keep going until we hit the `;' at the end of the
26744 declaration. */
26746 {
26751 /* Check for a (possibly unnamed) bitfield declaration. */
26759 {
26760 /* Get the name of the bitfield. */
26763 sfk_none);
26765 eat_colon:
26767 /* Get the width of the bitfield. */
26768 width
26770 }
26771 else
26772 {
26773 /* Parse the declarator. */
26774 declarator
26780 }
26782 /* Look for attributes that apply to the ivar. */
26784 /* Remember which attributes are prefix attributes and
26785 which are not. */
26787 /* Combine the attributes. */
26791 /* Create the bitfield declaration. */
26793 width,
26794 attributes);
26795 else
26800 /* Add the instance variable. */
26804 /* Reset PREFIX_ATTRIBUTES. */
26813 {
26816 }
26818 }
26822 }
26827 /* Do not consume the RID_AT_END, so it will be read again as terminating
26828 the @interface of @implementation. */
26832 /* For historical reasons, we accept an optional semicolon. */
26835 }
26837 /* Parse an Objective-C protocol declaration. */
26839 static void
26841 {
26847 {
26852 }
26854 /* See if we have a forward declaration or a definition. */
26857 /* Try a forward declaration first. */
26859 {
26861 {
26862 tree id;
26872 else
26874 }
26876 }
26878 /* Ok, we got a full-fledged definition (or at least should). */
26879 else
26880 {
26885 }
26886 }
26888 /* Parse an Objective-C superclass or category. */
26890 static void
26895 {
26901 {
26904 }
26906 {
26909 /* If there is no category name, and this is an @interface, we
26910 have a class extension. */
26912 {
26915 }
26916 else
26920 }
26921 }
26923 /* Parse an Objective-C class interface. */
26925 static void
26927 {
26934 {
26935 /* It's hard to recover because even if valid @interface stuff
26936 is to follow, we can't compile it (or validate it) if we
26937 don't even know which class it refers to. Let's assume this
26938 was a stray '@interface' token in the stream and skip it.
26939 */
26941 }
26946 /* We have either a class or a category on our hands. */
26949 else
26950 {
26952 /* Handle instance variable declarations, if any. */
26955 }
26958 }
26960 /* Parse an Objective-C class implementation. */
26962 static void
26964 {
26971 {
26972 /* It's hard to recover because even if valid @implementation
26973 stuff is to follow, we can't compile it (or validate it) if
26974 we don't even know which class it refers to. Let's assume
26975 this was a stray '@implementation' token in the stream and
26976 skip it.
26977 */
26979 }
26983 /* We have either a class or a category on our hands. */
26986 else
26987 {
26989 /* Handle instance variable declarations, if any. */
26992 }
26995 }
26997 /* Consume the @end token and finish off the implementation. */
26999 static void
27001 {
27004 }
27006 /* Parse an Objective-C declaration. */
27008 static void
27010 {
27011 /* Try to figure out what kind of declaration is present. */
27016 {
27032 }
27035 {
27058 }
27059 }
27061 /* Parse an Objective-C try-catch-finally statement.
27063 objc-try-catch-finally-stmt:
27064 @try compound-statement objc-catch-clause-seq [opt]
27065 objc-finally-clause [opt]
27067 objc-catch-clause-seq:
27068 objc-catch-clause objc-catch-clause-seq [opt]
27070 objc-catch-clause:
27071 @catch ( objc-exception-declaration ) compound-statement
27073 objc-finally-clause:
27074 @finally compound-statement
27076 objc-exception-declaration:
27077 parameter-declaration
27078 '...'
27080 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
27082 Returns NULL_TREE.
27084 PS: This function is identical to c_parser_objc_try_catch_finally_statement
27085 for C. Keep them in sync. */
27087 static tree
27089 {
27090 location_t location;
27091 tree stmt;
27096 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
27097 node, lest it get absorbed into the surrounding block. */
27103 {
27112 {
27113 /* We have "@catch (...)" (where the '...' are literally
27114 what is in the code). Skip the '...'.
27115 parameter_declaration is set to NULL_TREE, and
27116 objc_being_catch_clauses() knows that that means
27117 '...'. */
27120 }
27121 else
27122 {
27123 /* We have "@catch (NSException *exception)" or something
27124 like that. Parse the parameter declaration. */
27128 else
27133 }
27136 else
27137 {
27138 /* If there was no open parenthesis, we are recovering from
27139 an error, and we are trying to figure out what mistake
27140 the user has made. */
27142 /* If there is an immediate closing parenthesis, the user
27143 probably forgot the opening one (ie, they typed "@catch
27144 NSException *e)". Parse the closing parenthesis and keep
27145 going. */
27149 /* If these is no immediate closing parenthesis, the user
27150 probably doesn't know that parenthesis are required at
27151 all (ie, they typed "@catch NSException *e"). So, just
27152 forget about the closing parenthesis and keep going. */
27153 }
27157 }
27159 {
27162 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
27163 node, lest it get absorbed into the surrounding block. */
27167 }
27170 }
27172 /* Parse an Objective-C synchronized statement.
27174 objc-synchronized-stmt:
27175 @synchronized ( expression ) compound-statement
27177 Returns NULL_TREE. */
27179 static tree
27181 {
27182 location_t location;
27193 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
27194 node, lest it get absorbed into the surrounding block. */
27199 }
27201 /* Parse an Objective-C throw statement.
27203 objc-throw-stmt:
27204 @throw assignment-expression [opt] ;
27206 Returns a constructed '@throw' statement. */
27208 static tree
27210 {
27222 }
27224 /* Parse an Objective-C statement. */
27226 static tree
27228 {
27229 /* Try to figure out what kind of declaration is present. */
27233 {
27244 }
27247 }
27249 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
27250 look ahead to see if an objc keyword follows the attributes. This
27251 is to detect the use of prefix attributes on ObjC @interface and
27252 @protocol. */
27254 static bool
27256 {
27261 {
27264 }
27267 }
27269 /* This routine is a minimal replacement for
27270 c_parser_struct_declaration () used when parsing the list of
27271 types/names or ObjC++ properties. For example, when parsing the
27272 code
27274 @property (readonly) int a, b, c;
27276 this function is responsible for parsing "int a, int b, int c" and
27277 returning the declarations as CHAIN of DECLs.
27279 TODO: Share this code with cp_parser_objc_class_ivars. It's very
27280 similar parsing. */
27281 static tree
27283 {
27285 cp_decl_specifier_seq declspecs;
27287 tree prefix_attributes;
27290 CP_PARSER_FLAGS_NONE,
27297 /* auto, register, static, extern, mutable. */
27299 {
27302 }
27304 /* thread_local. */
27306 {
27309 }
27311 /* typedef. */
27313 {
27316 }
27321 /* Keep going until we hit the `;' at the end of the declaration. */
27323 {
27328 /* Parse the declarator. */
27332 /* Look for attributes that apply to the ivar. */
27334 /* Remember which attributes are prefix attributes and
27335 which are not. */
27337 /* Combine the attributes. */
27347 /* Reset PREFIX_ATTRIBUTES. */
27358 {
27361 }
27362 else
27364 }
27366 }
27368 /* Parse an Objective-C @property declaration. The syntax is:
27370 objc-property-declaration:
27371 '@property' objc-property-attributes[opt] struct-declaration ;
27373 objc-property-attributes:
27374 '(' objc-property-attribute-list ')'
27376 objc-property-attribute-list:
27377 objc-property-attribute
27378 objc-property-attribute-list, objc-property-attribute
27380 objc-property-attribute
27381 'getter' = identifier
27382 'setter' = identifier
27383 'readonly'
27384 'readwrite'
27385 'assign'
27386 'retain'
27387 'copy'
27388 'nonatomic'
27390 For example:
27391 @property NSString *name;
27392 @property (readonly) id object;
27393 @property (retain, nonatomic, getter=getTheName) id name;
27394 @property int a, b, c;
27396 PS: This function is identical to
27397 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27398 static void
27400 {
27401 /* The following variables hold the attributes of the properties as
27402 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27403 seen. When we see an attribute, we set them to 'true' (if they
27404 are boolean properties) or to the identifier (if they have an
27405 argument, ie, for getter and setter). Note that here we only
27406 parse the list of attributes, check the syntax and accumulate the
27407 attributes that we find. objc_add_property_declaration() will
27408 then process the information. */
27418 /* 'properties' is the list of properties that we read. Usually a
27419 single one, but maybe more (eg, in "@property int a, b, c;" there
27420 are three). */
27421 tree properties;
27422 location_t loc;
27428 /* Parse the optional attribute list... */
27430 {
27431 /* Eat the '('. */
27435 {
27441 {
27444 }
27448 {
27459 {
27463 else
27468 }
27471 {
27475 }
27477 {
27479 {
27482 }
27483 else
27487 else
27489 }
27490 else
27491 {
27493 {
27496 }
27497 else
27499 }
27505 }
27512 else
27514 }
27516 /* FIXME: "@property (setter, assign);" will generate a spurious
27517 "error: expected ‘)’ before ‘,’ token". This is because
27518 cp_parser_require, unlike the C counterpart, will produce an
27519 error even if we are in error recovery. */
27521 {
27526 }
27527 }
27529 /* ... and the property declaration(s). */
27533 {
27535 /* If the next token is now a `;', consume it. */
27539 }
27543 else
27544 {
27545 /* Comma-separated properties are chained together in
27546 reverse order; add them one by one. */
27555 }
27558 }
27560 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27562 objc-synthesize-declaration:
27563 @synthesize objc-synthesize-identifier-list ;
27565 objc-synthesize-identifier-list:
27566 objc-synthesize-identifier
27567 objc-synthesize-identifier-list, objc-synthesize-identifier
27569 objc-synthesize-identifier
27570 identifier
27571 identifier = identifier
27573 For example:
27574 @synthesize MyProperty;
27575 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27577 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27578 for C. Keep them in sync.
27579 */
27580 static void
27582 {
27584 location_t loc;
27589 {
27593 {
27596 }
27598 {
27602 {
27605 }
27606 }
27607 else
27612 else
27614 }
27617 }
27619 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27621 objc-dynamic-declaration:
27622 @dynamic identifier-list ;
27624 For example:
27625 @dynamic MyProperty;
27626 @dynamic MyProperty, AnotherProperty;
27628 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27629 for C. Keep them in sync.
27630 */
27631 static void
27633 {
27635 location_t loc;
27640 {
27641 tree property;
27644 {
27647 }
27651 else
27653 }
27656 }
27658 \f
27659 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27661 /* Returns name of the next clause.
27662 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27663 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27664 returned and the token is consumed. */
27666 static pragma_omp_clause
27668 {
27682 {
27687 {
27830 }
27831 }
27837 }
27839 /* Validate that a clause of the given type does not already exist. */
27841 static void
27844 {
27845 tree c;
27849 {
27852 }
27853 }
27855 /* OpenMP 2.5:
27856 variable-list:
27857 identifier
27858 variable-list , identifier
27860 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27861 colon). An opening parenthesis will have been consumed by the caller.
27863 If KIND is nonzero, create the appropriate node and install the decl
27864 in OMP_CLAUSE_DECL and add the node to the head of the list.
27866 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27867 return the list created.
27869 COLON can be NULL if only closing parenthesis should end the list,
27870 or pointer to bool which will receive false if the list is terminated
27871 by closing parenthesis or true if the list is terminated by colon. */
27873 static tree
27876 {
27880 {
27883 }
27885 {
27902 {
27904 {
27907 {
27911 }
27912 /* FALL THROUGH. */
27918 {
27926 parser->colon_corrects_to_scope_p
27930 else
27931 {
27932 /* Look for `:'. */
27936 CPP_CLOSE_SQUARE))
27938 }
27939 /* Look for the closing `]'. */
27941 RT_CLOSE_SQUARE))
27945 {
27948 {
27952 }
27956 {
27960 }
27961 }
27964 }
27968 }
27974 }
27975 else
27978 get_comma:
27982 }
27988 {
27992 }
27995 {
27998 /* Try to resync to an unnested comma. Copied from
27999 cp_parser_parenthesized_expression_list. */
28000 skip_comma:
28009 }
28012 }
28014 /* Similarly, but expect leading and trailing parenthesis. This is a very
28015 common case for omp clauses. */
28017 static tree
28019 {
28023 }
28025 /* OpenACC 2.0:
28026 copy ( variable-list )
28027 copyin ( variable-list )
28028 copyout ( variable-list )
28029 create ( variable-list )
28030 delete ( variable-list )
28031 present ( variable-list )
28032 present_or_copy ( variable-list )
28033 pcopy ( variable-list )
28034 present_or_copyin ( variable-list )
28035 pcopyin ( variable-list )
28036 present_or_copyout ( variable-list )
28037 pcopyout ( variable-list )
28038 present_or_create ( variable-list )
28039 pcreate ( variable-list ) */
28041 static tree
28043 tree list)
28044 {
28047 {
28087 }
28095 }
28097 /* OpenACC 2.0:
28098 deviceptr ( variable-list ) */
28100 static tree
28102 {
28106 /* Can't use OMP_CLAUSE_MAP here (that is, can't use the generic
28107 cp_parser_oacc_data_clause), as for PRAGMA_OACC_CLAUSE_DEVICEPTR,
28108 variable-list must only allow for pointer variables. */
28111 {
28114 /* FIXME diagnostics: Ideally we should keep individual
28115 locations for all the variables in the var list to make the
28116 following errors more precise. Perhaps
28117 c_parser_omp_var_list_parens should construct a list of
28118 locations to go along with the var list. */
28123 ;
28132 }
28135 }
28137 /* OpenACC:
28138 vector_length ( expression ) */
28140 static tree
28142 {
28152 {
28155 }
28158 {
28163 }
28166 location);
28174 }
28176 /* OpenACC 2.0
28177 Parse wait clause or directive parameters. */
28179 static tree
28181 {
28191 {
28196 }
28203 {
28207 {
28210 else
28211 {
28218 }
28219 }
28220 }
28223 }
28225 /* OpenACC:
28226 wait ( int-expr-list ) */
28228 static tree
28230 {
28239 }
28241 /* OpenMP 3.0:
28242 collapse ( constant-expression ) */
28244 static tree
28246 {
28248 location_t loc;
28249 HOST_WIDE_INT n;
28269 {
28272 }
28280 }
28282 /* OpenMP 2.5:
28283 default ( shared | none ) */
28285 static tree
28287 {
28289 tree c;
28294 {
28299 {
28314 }
28317 }
28318 else
28319 {
28320 invalid_kind:
28322 }
28338 }
28340 /* OpenMP 3.1:
28341 final ( expression ) */
28343 static tree
28345 {
28366 }
28368 /* OpenMP 2.5:
28369 if ( expression ) */
28371 static tree
28373 {
28394 }
28396 /* OpenMP 3.1:
28397 mergeable */
28399 static tree
28402 {
28403 tree c;
28406 location);
28411 }
28413 /* OpenMP 2.5:
28414 nowait */
28416 static tree
28419 {
28420 tree c;
28427 }
28429 /* OpenACC:
28430 num_gangs ( expression ) */
28432 static tree
28434 {
28450 {
28453 }
28463 }
28465 /* OpenMP 2.5:
28466 num_threads ( expression ) */
28468 static tree
28470 location_t location)
28471 {
28493 }
28495 /* OpenACC:
28496 num_workers ( expression ) */
28498 static tree
28500 {
28516 {
28519 }
28522 location);
28530 }
28532 /* OpenMP 2.5:
28533 ordered */
28535 static tree
28538 {
28539 tree c;
28547 }
28549 /* OpenMP 2.5:
28550 reduction ( reduction-operator : variable-list )
28552 reduction-operator:
28553 One of: + * - & ^ | && ||
28555 OpenMP 3.1:
28557 reduction-operator:
28558 One of: + * - & ^ | && || min max
28560 OpenMP 4.0:
28562 reduction-operator:
28563 One of: + * - & ^ | && ||
28564 id-expression */
28566 static tree
28568 {
28576 {
28586 }
28590 else
28591 {
28602 {
28632 }
28633 else
28634 {
28636 resync_fail:
28641 }
28642 }
28648 NULL);
28650 {
28653 }
28656 }
28658 /* OpenMP 2.5:
28659 schedule ( schedule-kind )
28660 schedule ( schedule-kind , expression )
28662 schedule-kind:
28663 static | dynamic | guided | runtime | auto */
28665 static tree
28667 {
28676 {
28681 {
28702 }
28703 }
28708 else
28713 {
28728 else
28733 }
28741 invalid_kind:
28743 resync_fail:
28748 }
28750 /* OpenMP 3.0:
28751 untied */
28753 static tree
28756 {
28757 tree c;
28764 }
28766 /* OpenMP 4.0:
28767 inbranch
28768 notinbranch */
28770 static tree
28773 {
28778 }
28780 /* OpenMP 4.0:
28781 parallel
28782 for
28783 sections
28784 taskgroup */
28786 static tree
28790 {
28794 }
28796 /* OpenMP 4.0:
28797 num_teams ( expression ) */
28799 static tree
28801 location_t location)
28802 {
28824 }
28826 /* OpenMP 4.0:
28827 thread_limit ( expression ) */
28829 static tree
28831 location_t location)
28832 {
28854 }
28856 /* OpenMP 4.0:
28857 aligned ( variable-list )
28858 aligned ( variable-list : constant-expression ) */
28860 static tree
28862 {
28873 {
28883 }
28889 }
28891 /* OpenMP 4.0:
28892 linear ( variable-list )
28893 linear ( variable-list : expression ) */
28895 static tree
28898 {
28909 {
28913 {
28916 }
28924 }
28930 }
28932 /* OpenMP 4.0:
28933 safelen ( constant-expression ) */
28935 static tree
28937 location_t location)
28938 {
28959 }
28961 /* OpenMP 4.0:
28962 simdlen ( constant-expression ) */
28964 static tree
28966 location_t location)
28967 {
28988 }
28990 /* OpenMP 4.0:
28991 depend ( depend-kind : variable-list )
28993 depend-kind:
28994 in | out | inout */
28996 static tree
28998 {
29006 {
29016 else
29018 }
29019 else
29027 NULL);
29034 invalid_kind:
29036 resync_fail:
29041 }
29043 /* OpenMP 4.0:
29044 map ( map-kind : variable-list )
29045 map ( variable-list )
29047 map-kind:
29048 alloc | to | from | tofrom */
29050 static tree
29052 {
29061 {
29073 else
29074 {
29080 }
29083 }
29086 NULL);
29092 }
29094 /* OpenMP 4.0:
29095 device ( expression ) */
29097 static tree
29099 location_t location)
29100 {
29122 }
29124 /* OpenMP 4.0:
29125 dist_schedule ( static )
29126 dist_schedule ( static , expression ) */
29128 static tree
29130 location_t location)
29131 {
29144 {
29155 }
29160 location);
29164 invalid_kind:
29166 resync_fail:
29171 }
29173 /* OpenMP 4.0:
29174 proc_bind ( proc-bind-kind )
29176 proc-bind-kind:
29177 master | close | spread */
29179 static tree
29181 location_t location)
29182 {
29183 tree c;
29190 {
29200 else
29202 }
29203 else
29212 location);
29217 invalid_kind:
29219 resync_fail:
29224 }
29226 /* OpenACC:
29227 async [( int-expr )] */
29229 static tree
29231 {
29238 {
29247 }
29257 }
29259 /* Parse all OpenACC clauses. The set clauses allowed by the directive
29260 is a bitmask in MASK. Return the list of clauses found. */
29262 static tree
29266 {
29271 {
29272 location_t here;
29273 pragma_omp_clause c_kind;
29284 {
29376 }
29381 {
29382 /* Remove the invalid clause(s) from the list to avoid
29383 confusing the rest of the compiler. */
29386 }
29387 }
29389 saw_error:
29396 }
29398 /* Parse all OpenMP clauses. The set clauses allowed by the directive
29399 is a bitmask in MASK. Return the list of clauses found; the result
29400 of clause default goes in *pdefault. */
29402 static tree
29406 {
29413 {
29414 pragma_omp_clause c_kind;
29425 {
29437 clauses);
29451 clauses);
29460 clauses);
29484 clauses);
29498 clauses);
29515 OMP_CLAUSE_NOTINBRANCH,
29524 {
29525 clause_not_first:
29529 }
29554 clauses);
29559 clauses);
29564 clauses);
29627 }
29632 {
29633 /* Remove the invalid clause(s) from the list to avoid
29634 confusing the rest of the compiler. */
29637 }
29638 }
29639 saw_error:
29640 /* In Cilk Plus SIMD enabled functions there is no pragma_token, so
29641 no reason to skip to the end. */
29647 }
29649 /* OpenMP 2.5:
29650 structured-block:
29651 statement
29653 In practice, we're also interested in adding the statement to an
29654 outer node. So it is convenient if we work around the fact that
29655 cp_parser_statement calls add_stmt. */
29657 static unsigned
29659 {
29662 /* Only move the values to IN_OMP_BLOCK if they weren't false.
29663 This preserves the "not within loop or switch" style error messages
29664 for nonsense cases like
29665 void foo() {
29666 #pragma omp single
29667 break;
29668 }
29669 */
29674 }
29676 static void
29678 {
29680 }
29682 static tree
29684 {
29692 }
29694 /* OpenMP 2.5:
29695 # pragma omp atomic new-line
29696 expression-stmt
29698 expression-stmt:
29699 x binop= expr | x++ | ++x | x-- | --x
29700 binop:
29701 +, *, -, /, &, ^, |, <<, >>
29703 where x is an lvalue expression with scalar type.
29705 OpenMP 3.1:
29706 # pragma omp atomic new-line
29707 update-stmt
29709 # pragma omp atomic read new-line
29710 read-stmt
29712 # pragma omp atomic write new-line
29713 write-stmt
29715 # pragma omp atomic update new-line
29716 update-stmt
29718 # pragma omp atomic capture new-line
29719 capture-stmt
29721 # pragma omp atomic capture new-line
29722 capture-block
29724 read-stmt:
29725 v = x
29726 write-stmt:
29727 x = expr
29728 update-stmt:
29729 expression-stmt | x = x binop expr
29730 capture-stmt:
29731 v = expression-stmt
29732 capture-block:
29733 { v = x; update-stmt; } | { update-stmt; v = x; }
29735 OpenMP 4.0:
29736 update-stmt:
29737 expression-stmt | x = x binop expr | x = expr binop x
29738 capture-stmt:
29739 v = update-stmt
29740 capture-block:
29741 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
29743 where x and v are lvalue expressions with scalar type. */
29745 static void
29747 {
29755 {
29760 {
29766 }
29767 }
29769 {
29781 else
29785 }
29787 {
29793 {
29798 {
29801 }
29802 }
29803 }
29807 {
29817 else
29822 {
29823 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
29824 opcode. */
29829 }
29833 {
29836 }
29837 else
29838 {
29844 }
29847 }
29849 restart:
29853 {
29860 /* FALLTHROUGH */
29870 /* FALLTHROUGH */
29885 /* Undo effects of boolean_increment for post {in,de}crement. */
29887 /* FALLTHRU */
29891 {
29892 /* Undo effects of boolean_increment. */
29894 {
29895 /* This is pre or post increment. */
29900 && !structured_block
29904 }
29905 }
29906 /* FALLTHRU */
29909 {
29944 {
29948 }
29951 {
29957 {
29962 }
29964 {
29976 {
29978 {
29983 }
29984 else
29986 }
29990 }
29993 {
30000 }
30004 }
30008 {
30011 {
30019 }
30021 {
30026 }
30061 }
30072 /* FALLTHROUGH */
30077 }
30084 }
30085 stmt_done:
30087 {
30098 }
30100 {
30103 }
30104 done:
30110 saw_error:
30113 {
30117 {
30121 }
30122 }
30123 }
30126 /* OpenMP 2.5:
30127 # pragma omp barrier new-line */
30129 static void
30131 {
30134 }
30136 /* OpenMP 2.5:
30137 # pragma omp critical [(name)] new-line
30138 structured-block */
30140 static tree
30142 {
30146 {
30158 }
30163 }
30165 /* OpenMP 2.5:
30166 # pragma omp flush flush-vars[opt] new-line
30168 flush-vars:
30169 ( variable-list ) */
30171 static void
30173 {
30179 }
30181 /* Helper function, to parse omp for increment expression. */
30183 static tree
30185 {
30190 {
30193 }
30196 {
30205 /* Fall through: OpenMP disallows NE_EXPR. */
30208 }
30210 /* If decl is an iterator, preserve LHS and RHS of the relational
30211 expr until finish_omp_for. */
30221 }
30223 /* Helper function, to parse omp for increment expression. */
30225 static tree
30227 {
30231 cp_id_kind idk;
30235 {
30243 }
30251 {
30256 }
30263 {
30267 }
30279 do
30280 {
30287 {
30289 {
30292 else
30294 tf_warning_or_error);
30295 }
30296 else
30299 }
30300 }
30304 {
30308 }
30309 else
30313 }
30315 /* Parse the initialization statement of either an OpenMP for loop or
30316 a Cilk Plus for loop.
30318 Return true if the resulting construct should have an
30319 OMP_CLAUSE_PRIVATE added to it. */
30321 static bool
30329 {
30335 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
30337 init-expr:
30338 var = lb
30339 integer-type var = lb
30340 random-access-iterator-type var = lb
30341 pointer-type var = lb
30342 */
30343 cp_decl_specifier_seq type_specifiers;
30345 /* First, try to parse as an initialized declaration. See
30346 cp_parser_condition, from whence the bulk of this is copied. */
30353 {
30354 /* If parsing a type specifier seq succeeded, then this
30355 MUST be a initialized declaration. */
30360 CP_PARSER_DECLARATOR_NAMED,
30371 else
30372 {
30382 {
30384 CPP_OPEN_PAREN))
30385 {
30389 else
30392 }
30393 else
30394 /* Trigger an error. */
30399 }
30403 {
30411 {
30414 auto_node);
30419 }
30422 asm_specification,
30423 LOOKUP_ONLYCONVERTING);
30425 {
30428 }
30429 else
30432 }
30433 else
30434 {
30435 /* Consume '='. */
30439 non_class:
30442 else
30445 asm_specification,
30446 LOOKUP_ONLYCONVERTING);
30447 }
30451 }
30452 }
30453 else
30454 {
30455 cp_id_kind idk;
30456 /* If parsing a type specifier sequence failed, then
30457 this MUST be a simple expression. */
30465 && decl
30468 {
30469 tree rhs;
30476 rhs,
30477 tf_warning_or_error));
30479 }
30480 else
30481 {
30486 {
30490 }
30491 }
30492 }
30494 }
30496 /* Parse the restricted form of the for statement allowed by OpenMP. */
30498 static tree
30501 {
30505 location_t loc_first;
30524 {
30527 location_t loc;
30531 {
30534 }
30537 {
30540 }
30549 add_private_clause
30556 {
30559 {
30565 }
30566 else
30568 }
30575 {
30580 {
30584 }
30587 {
30588 /* Move lastprivate (decl) clause to OMP_FOR_CLAUSES. */
30592 {
30595 }
30596 else
30597 {
30600 }
30602 }
30603 else
30604 {
30609 }
30610 }
30613 {
30614 tree c;
30616 {
30625 decl);
30629 decl);
30630 }
30632 {
30637 {
30640 }
30641 }
30642 }
30651 {
30652 /* If decl is an iterator, preserve the operator on decl
30653 until finish_omp_for. */
30655 && ((processing_template_decl
30659 else
30663 }
30678 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
30679 in between the collapsed for loops to be still considered perfectly
30680 nested. Hopefully the final version clarifies this.
30681 For now handle (multiple) {'s and empty statements. */
30683 do
30684 {
30688 {
30690 bracecount++;
30691 }
30695 else
30696 {
30703 }
30704 }
30708 {
30711 }
30712 }
30714 /* Note that we saved the original contents of this flag when we entered
30715 the structured block, and so we don't need to re-save it here. */
30718 else
30721 /* Note that the grammar doesn't call for a structured block here,
30722 though the loop as a whole is a structured block. */
30729 else
30734 {
30736 {
30738 nbraces--;
30739 }
30742 else
30743 {
30745 {
30748 }
30753 }
30754 }
30761 }
30763 /* Helper function for OpenMP parsing, split clauses and call
30764 finish_omp_clauses on each of the set of clauses afterwards. */
30766 static void
30769 {
30775 }
30777 /* OpenMP 4.0:
30778 #pragma omp simd simd-clause[optseq] new-line
30779 for-loop */
30781 #define OMP_SIMD_CLAUSE_MASK \
30782 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
30783 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30784 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30785 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30786 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30787 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30788 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30790 static tree
30793 {
30805 {
30808 }
30819 }
30821 /* OpenMP 2.5:
30822 #pragma omp for for-clause[optseq] new-line
30823 for-loop
30825 OpenMP 4.0:
30826 #pragma omp for simd for-simd-clause[optseq] new-line
30827 for-loop */
30829 #define OMP_FOR_CLAUSE_MASK \
30830 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30831 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30832 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30833 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30834 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
30835 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
30836 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
30837 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30839 static tree
30842 {
30853 {
30858 {
30866 cclauses);
30870 cclauses);
30882 }
30883 }
30885 {
30888 }
30893 {
30896 }
30907 }
30909 /* OpenMP 2.5:
30910 # pragma omp master new-line
30911 structured-block */
30913 static tree
30915 {
30919 }
30921 /* OpenMP 2.5:
30922 # pragma omp ordered new-line
30923 structured-block */
30925 static tree
30927 {
30931 }
30933 /* OpenMP 2.5:
30935 section-scope:
30936 { section-sequence }
30938 section-sequence:
30939 section-directive[opt] structured-block
30940 section-sequence section-directive structured-block */
30942 static tree
30944 {
30955 {
30959 }
30962 {
30970 {
30974 }
30976 {
30979 }
30984 }
30995 }
30997 /* OpenMP 2.5:
30998 # pragma omp sections sections-clause[optseq] newline
30999 sections-scope */
31001 #define OMP_SECTIONS_CLAUSE_MASK \
31002 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31003 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31004 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
31005 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31006 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31008 static tree
31011 {
31023 {
31026 }
31033 }
31035 /* OpenMP 2.5:
31036 # pragma omp parallel parallel-clause[optseq] new-line
31037 structured-block
31038 # pragma omp parallel for parallel-for-clause[optseq] new-line
31039 structured-block
31040 # pragma omp parallel sections parallel-sections-clause[optseq] new-line
31041 structured-block
31043 OpenMP 4.0:
31044 # pragma omp parallel for simd parallel-for-simd-clause[optseq] new-line
31045 structured-block */
31047 #define OMP_PARALLEL_CLAUSE_MASK \
31048 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31049 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31050 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31051 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31052 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31053 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
31054 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31055 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
31056 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
31058 static tree
31061 {
31070 {
31083 block);
31088 }
31090 {
31094 }
31096 {
31099 }
31101 {
31105 {
31115 block);
31118 }
31119 }
31129 }
31131 /* OpenMP 2.5:
31132 # pragma omp single single-clause[optseq] new-line
31133 structured-block */
31135 #define OMP_SINGLE_CLAUSE_MASK \
31136 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31137 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31138 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
31139 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
31141 static tree
31143 {
31153 }
31155 /* OpenMP 3.0:
31156 # pragma omp task task-clause[optseq] new-line
31157 structured-block */
31159 #define OMP_TASK_CLAUSE_MASK \
31160 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
31161 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
31162 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
31163 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31164 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31165 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31166 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
31167 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
31168 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
31170 static tree
31172 {
31183 }
31185 /* OpenMP 3.0:
31186 # pragma omp taskwait new-line */
31188 static void
31190 {
31193 }
31195 /* OpenMP 3.1:
31196 # pragma omp taskyield new-line */
31198 static void
31200 {
31203 }
31205 /* OpenMP 4.0:
31206 # pragma omp taskgroup new-line
31207 structured-block */
31209 static tree
31211 {
31215 }
31218 /* OpenMP 2.5:
31219 # pragma omp threadprivate (variable-list) */
31221 static void
31223 {
31224 tree vars;
31230 }
31232 /* OpenMP 4.0:
31233 # pragma omp cancel cancel-clause[optseq] new-line */
31235 #define OMP_CANCEL_CLAUSE_MASK \
31236 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31237 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31238 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31239 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
31240 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31242 static void
31244 {
31248 }
31250 /* OpenMP 4.0:
31251 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
31253 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
31254 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
31255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
31256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
31257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
31259 static void
31261 {
31262 tree clauses;
31266 {
31271 {
31274 }
31275 }
31277 {
31281 }
31284 OMP_CANCELLATION_POINT_CLAUSE_MASK,
31286 pragma_tok);
31288 }
31290 /* OpenMP 4.0:
31291 #pragma omp distribute distribute-clause[optseq] new-line
31292 for-loop */
31294 #define OMP_DISTRIBUTE_CLAUSE_MASK \
31295 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
31298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
31300 static tree
31303 {
31312 {
31320 else
31323 {
31329 {
31332 cclauses);
31333 else
31335 cclauses);
31336 }
31341 cclauses);
31342 else
31344 cclauses);
31356 }
31357 }
31359 {
31362 }
31367 {
31370 }
31381 }
31383 /* OpenMP 4.0:
31384 # pragma omp teams teams-clause[optseq] new-line
31385 structured-block */
31387 #define OMP_TEAMS_CLAUSE_MASK \
31388 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
31389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
31390 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
31391 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
31392 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
31393 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
31394 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
31396 static tree
31399 {
31408 {
31412 {
31420 cclauses);
31424 cclauses);
31436 }
31437 }
31439 {
31442 }
31447 {
31450 }
31458 }
31460 /* OpenMP 4.0:
31461 # pragma omp target data target-data-clause[optseq] new-line
31462 structured-block */
31464 #define OMP_TARGET_DATA_CLAUSE_MASK \
31465 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31466 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31467 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31469 static tree
31471 {
31483 }
31485 /* OpenMP 4.0:
31486 # pragma omp target update target-update-clause[optseq] new-line */
31488 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
31489 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
31490 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
31491 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31492 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31494 static bool
31497 {
31499 {
31501 "%<#pragma omp target update%> may only be "
31505 }
31507 tree clauses
31512 {
31514 "%<#pragma omp target update%> must contain at least one "
31517 }
31525 }
31527 /* OpenMP 4.0:
31528 # pragma omp target target-clause[optseq] new-line
31529 structured-block */
31531 #define OMP_TARGET_CLAUSE_MASK \
31532 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
31533 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
31534 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
31536 static bool
31539 {
31541 {
31545 }
31548 {
31553 {
31561 {
31563 OMP_TARGET_CLAUSE_MASK,
31564 cclauses);
31566 }
31582 }
31584 {
31587 }
31589 {
31593 }
31595 {
31598 }
31599 }
31613 }
31615 /* OpenACC 2.0:
31616 # pragma acc cache (variable-list) new-line
31617 */
31619 static tree
31621 {
31636 }
31638 /* OpenACC 2.0:
31639 # pragma acc data oacc-data-clause[optseq] new-line
31640 structured-block */
31642 #define OACC_DATA_CLAUSE_MASK \
31643 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31644 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31645 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31646 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31647 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31648 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31649 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31650 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31651 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31652 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31653 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE))
31655 static tree
31657 {
31670 }
31672 /* OpenACC 2.0:
31673 # pragma acc enter data oacc-enter-data-clause[optseq] new-line
31675 or
31677 # pragma acc exit data oacc-exit-data-clause[optseq] new-line
31679 LOC is the location of the #pragma token.
31680 */
31682 #define OACC_ENTER_DATA_CLAUSE_MASK \
31683 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31684 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31685 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31686 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31687 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31688 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31689 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31691 #define OACC_EXIT_DATA_CLAUSE_MASK \
31692 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31693 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31694 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31695 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DELETE) \
31696 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT) )
31698 static tree
31701 {
31706 {
31712 }
31717 {
31721 }
31728 else
31733 {
31737 }
31745 }
31747 /* OpenACC 2.0:
31748 # pragma acc kernels oacc-kernels-clause[optseq] new-line
31749 structured-block */
31751 #define OACC_KERNELS_CLAUSE_MASK \
31752 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31753 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31754 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31755 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31756 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31757 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31758 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31759 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31760 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31761 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31762 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31763 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31764 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31766 static tree
31768 {
31781 }
31783 /* OpenACC 2.0:
31784 # pragma acc loop oacc-loop-clause[optseq] new-line
31785 structured-block */
31787 #define OACC_LOOP_CLAUSE_MASK \
31788 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COLLAPSE) \
31789 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION))
31791 static tree
31793 {
31806 }
31808 /* OpenACC 2.0:
31809 # pragma acc parallel oacc-parallel-clause[optseq] new-line
31810 structured-block */
31812 #define OACC_PARALLEL_CLAUSE_MASK \
31813 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31814 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPY) \
31815 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYIN) \
31816 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_COPYOUT) \
31817 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_CREATE) \
31818 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICEPTR) \
31819 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31820 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_GANGS) \
31821 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_NUM_WORKERS) \
31822 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT) \
31823 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPY) \
31824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYIN) \
31825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_COPYOUT) \
31826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_PRESENT_OR_CREATE) \
31827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_REDUCTION) \
31828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_VECTOR_LENGTH) \
31829 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31831 static tree
31833 {
31846 }
31848 /* OpenACC 2.0:
31849 # pragma acc update oacc-update-clause[optseq] new-line
31850 */
31852 #define OACC_UPDATE_CLAUSE_MASK \
31853 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC) \
31854 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_DEVICE) \
31855 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_HOST) \
31856 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_IF) \
31857 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_SELF) \
31858 | (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_WAIT))
31860 static tree
31862 {
31869 {
31871 "%<#pragma acc update%> must contain at least one "
31874 }
31882 }
31884 /* OpenACC 2.0:
31885 # pragma acc wait [(intseq)] oacc-wait-clause[optseq] new-line
31887 LOC is the location of the #pragma token.
31888 */
31890 #define OACC_WAIT_CLAUSE_MASK \
31891 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OACC_CLAUSE_ASYNC))
31893 static tree
31895 {
31908 }
31910 /* OpenMP 4.0:
31911 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
31913 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
31914 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
31915 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
31916 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
31917 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
31918 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
31919 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
31921 static void
31924 {
31926 cp_omp_declare_simd_data data;
31928 {
31933 }
31944 {
31948 {
31961 }
31966 "%<#pragma omp declare simd%> not immediately followed by "
31970 }
31971 }
31973 /* Handles the delayed parsing of the Cilk Plus SIMD-enabled function.
31974 This function is modelled similar to the late parsing of omp declare
31975 simd. */
31977 static tree
31979 {
31985 {
31991 }
31993 {
31997 }
32002 {
32009 NULL);
32023 }
32028 }
32030 /* Finalize #pragma omp declare simd clauses after direct declarator has
32031 been parsed, and put that into "omp declare simd" attribute. */
32033 static tree
32035 {
32041 {
32046 }
32051 {
32069 }
32073 }
32076 /* OpenMP 4.0:
32077 # pragma omp declare target new-line
32078 declarations and definitions
32079 # pragma omp end declare target new-line */
32081 static void
32083 {
32086 }
32088 static void
32090 {
32093 {
32096 }
32098 {
32102 {
32105 }
32108 else
32109 {
32113 }
32114 }
32115 else
32116 {
32120 }
32124 "%<#pragma omp end declare target%> without corresponding "
32126 else
32128 }
32130 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
32131 expression and optional initializer clause of
32132 #pragma omp declare reduction. We store the expression(s) as
32133 either 3, 6 or 7 special statements inside of the artificial function's
32134 body. The first two statements are DECL_EXPRs for the artificial
32135 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
32136 expression that uses those variables.
32137 If there was any INITIALIZER clause, this is followed by further statements,
32138 the fourth and fifth statements are DECL_EXPRs for the artificial
32139 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
32140 constructor variant (first token after open paren is not omp_priv),
32141 then the sixth statement is a statement with the function call expression
32142 that uses the OMP_PRIV and optionally OMP_ORIG variable.
32143 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
32144 to initialize the OMP_PRIV artificial variable and there is seventh
32145 statement, a DECL_EXPR of the OMP_PRIV statement again. */
32147 static bool
32149 {
32161 tree combiner;
32176 {
32179 }
32182 {
32189 {
32192 }
32208 {
32212 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
32216 == CPP_CLOSE_PAREN
32219 {
32223 }
32228 }
32229 else
32230 {
32246 {
32251 }
32253 tree arg;
32266 }
32277 }
32283 }
32285 /* OpenMP 4.0
32286 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32287 initializer-clause[opt] new-line
32289 initializer-clause:
32290 initializer (omp_priv initializer)
32291 initializer (function-name (argument-list)) */
32293 static void
32296 {
32306 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
32313 {
32345 }
32357 /* Types may not be defined in declare reduction type list. */
32360 parser->type_definition_forbidden_message
32366 saved_colon_doesnt_start_class_def_p
32371 {
32375 ;
32396 else
32401 else
32403 }
32405 /* Restore the saved message. */
32408 parser->colon_doesnt_start_class_def_p
32413 {
32414 fail:
32417 }
32423 {
32424 tree fntype
32427 NULL_TREE);
32446 {
32451 }
32453 {
32455 {
32464 }
32471 }
32472 else
32473 {
32476 }
32479 else
32482 {
32485 }
32487 {
32490 else
32495 }
32500 else
32501 {
32510 }
32517 }
32521 done:
32522 /* Free any declarators allocated. */
32524 }
32526 /* OpenMP 4.0
32527 #pragma omp declare simd declare-simd-clauses[optseq] new-line
32528 #pragma omp declare reduction (reduction-id : typename-list : expression) \
32529 initializer-clause[opt] new-line
32530 #pragma omp declare target new-line */
32532 static void
32535 {
32537 {
32542 {
32545 context);
32547 }
32550 {
32553 context);
32555 }
32557 {
32560 }
32562 {
32566 }
32567 }
32571 }
32573 /* Main entry point to OpenMP statement pragmas. */
32575 static void
32577 {
32578 tree stmt;
32583 {
32658 }
32662 }
32663 \f
32664 /* Transactional Memory parsing routines. */
32666 /* Parse a transaction attribute.
32668 txn-attribute:
32669 attribute
32670 [ [ identifier ] ]
32672 ??? Simplify this when C++0x bracket attributes are
32673 implemented properly. */
32675 static tree
32677 {
32692 {
32696 /* For keywords, use the canonical spelling,
32697 not the parsed identifier. */
32701 }
32702 else
32706 error1:
32709 }
32711 /* Parse a __transaction_atomic or __transaction_relaxed statement.
32713 transaction-statement:
32714 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
32715 compound-statement
32716 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
32717 */
32719 static tree
32721 {
32736 else
32737 {
32741 }
32743 /* Parse a noexcept specification. */
32746 /* Keep track if we're in the lexical scope of an outer transaction. */
32758 }
32760 /* Parse a __transaction_atomic or __transaction_relaxed expression.
32762 transaction-expression:
32763 __transaction_atomic txn-noexcept-spec[opt] ( expression )
32764 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
32765 */
32767 static tree
32769 {
32794 /* Set this early. This might mean that we allow transaction_cancel in
32795 an expression that we find out later actually has to be a constexpr.
32796 However, we expect that cxx_constant_value will be able to deal with
32797 this; also, if the noexcept has no constexpr, then what we parse next
32798 really is a transaction's body. */
32801 /* Parse a noexcept specification. */
32807 {
32814 }
32815 else
32816 {
32817 /* The only expression that is available got parsed for the noexcept
32818 already. noexcept is true then. */
32821 }
32830 }
32832 /* Parse a function-transaction-block.
32834 function-transaction-block:
32835 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
32836 function-body
32837 __transaction_atomic txn-attribute[opt] function-try-block
32838 __transaction_relaxed ctor-initializer[opt] function-body
32839 __transaction_relaxed function-try-block
32840 */
32842 static bool
32844 {
32860 else
32861 {
32865 }
32873 else
32874 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
32882 }
32884 /* Parse a __transaction_cancel statement.
32886 cancel-statement:
32887 __transaction_cancel txn-attribute[opt] ;
32888 __transaction_cancel txn-attribute[opt] throw-expression ;
32890 ??? Cancel and throw is not yet implemented. */
32892 static tree
32894 {
32900 RT_TRANSACTION_CANCEL);
32907 /* ??? Parse cancel-and-throw here. */
32912 {
32916 }
32918 {
32922 }
32924 {
32927 {
32933 }
32934 }
32936 {
32940 }
32946 }
32947 \f
32948 /* The parser. */
32952 \f
32953 /* Special handling for the first token or line in the file. The first
32954 thing in the file might be #pragma GCC pch_preprocess, which loads a
32955 PCH file, which is a GC collection point. So we need to handle this
32956 first pragma without benefit of an existing lexer structure.
32958 Always returns one token to the caller in *FIRST_TOKEN. This is
32959 either the true first token of the file, or the first token after
32960 the initial pragma. */
32962 static void
32964 {
32973 {
32980 }
32981 else
32984 /* Skip to the end of the pragma. */
32988 /* Now actually load the PCH file. */
32992 /* Read one more token to return to our caller. We have to do this
32993 after reading the PCH file in, since its pointers have to be
32994 live. */
32996 }
32998 /* Parses the grainsize pragma for the _Cilk_for statement.
32999 Syntax:
33000 #pragma cilk grainsize = <VALUE>. */
33002 static void
33004 {
33006 {
33011 {
33014 }
33016 /* Make sure the next token is _Cilk_for, it is invalid otherwise. */
33019 else
33021 "%<#pragma cilk grainsize%> is not followed by "
33024 }
33026 }
33028 /* Normal parsing of a pragma token. Here we can (and must) use the
33029 regular lexer. */
33031 static bool
33033 {
33045 {
33053 {
33063 }
33068 {
33078 }
33083 {
33089 "%<#pragma omp taskwait%> may only be "
33094 }
33099 {
33105 "%<#pragma omp taskyield%> may only be "
33110 }
33115 {
33121 "%<#pragma omp cancel%> may only be "
33126 }
33131 {
33137 "%<#pragma omp cancellation point%> may only be "
33142 }
33189 "%<#pragma omp section%> may only be used in "
33194 {
33196 {
33200 }
33207 {
33210 }
33213 }
33217 {
33221 }
33227 {
33231 }
33233 /* Ignore the pragma if Cilk Plus is not enabled. */
33235 {
33238 }
33239 else
33240 {
33244 }
33251 bad_stmt:
33254 }
33258 }
33260 /* The interface the pragma parsers have to the lexer. */
33262 enum cpp_ttype
33264 {
33277 else
33278 {
33282 }
33285 }
33287 \f
33288 /* External interface. */
33290 /* Parse one entire translation unit. */
33292 void
33294 {
33307 }
33309 /* Parses the Cilk Plus #pragma simd and SIMD-enabled function attribute's
33310 vectorlength clause:
33311 Syntax:
33312 vectorlength ( constant-expression ) */
33314 static tree
33317 {
33319 tree expr;
33320 /* The vectorlength clause in #pragma simd behaves exactly like OpenMP's
33321 safelen clause. Thus, vectorlength is represented as OMP 4.0
33322 safelen. For SIMD-enabled function it is represented by OMP 4.0
33323 simdlen. */
33326 loc);
33327 else
33329 loc);
33337 /* If expr == error_mark_node, then don't emit any errors nor
33338 create a clause. if any of the above functions returns
33339 error mark node then they would have emitted an error message. */
33341 ;
33349 else
33350 {
33351 tree c;
33353 {
33358 }
33359 else
33360 {
33365 }
33366 }
33371 }
33373 /* Handles the Cilk Plus #pragma simd linear clause.
33374 Syntax:
33375 linear ( simd-linear-variable-list )
33377 simd-linear-variable-list:
33378 simd-linear-variable
33379 simd-linear-variable-list , simd-linear-variable
33381 simd-linear-variable:
33382 id-expression
33383 id-expression : simd-linear-step
33385 simd-linear-step:
33386 conditional-expression */
33388 static tree
33390 {
33396 {
33400 }
33405 {
33408 {
33412 }
33419 {
33423 }
33424 else
33425 {
33429 /* If present, parse the linear step. Otherwise, assume the default
33430 value of 1. */
33432 {
33439 {
33440 /* If an error has occurred, then the whole pragma is
33441 considered ill-formed. Thus, no reason to keep
33442 parsing. */
33445 }
33453 else
33455 "step size must be an integer constant "
33457 }
33459 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
33465 }
33470 else
33471 {
33476 }
33477 }
33481 }
33483 /* Returns the name of the next clause. If the clause is not
33484 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
33485 token is not consumed. Otherwise, the appropriate enum from the
33486 pragma_simd_clause is returned and the token is consumed. */
33488 static pragma_omp_clause
33490 {
33491 pragma_omp_clause clause_type;
33508 else
33513 }
33515 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
33517 static tree
33519 {
33524 {
33525 pragma_omp_clause c_kind;
33532 /* Use the OpenMP 4.0 equivalent function. */
33535 /* Use the OpenMP 4.0 equivalent function. */
33537 clauses);
33539 /* Use the OMP 4.0 equivalent function. */
33541 clauses);
33543 /* Use the OMP 4.0 equivalent function. */
33545 else
33546 {
33550 }
33551 }
33557 else
33559 }
33561 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
33563 static void
33565 {
33572 {
33576 }
33585 }
33587 /* Main entry-point for parsing Cilk Plus _Cilk_for
33588 loops. The return value is error_mark_node
33589 when errors happen and CILK_FOR tree on success. */
33591 static tree
33593 {
33608 else
33614 }
33616 /* Create an identifier for a generic parameter type (a synthesized
33617 template parameter implied by `auto' or a concept identifier). */
33620 static tree
33622 {
33626 }
33628 /* Predicate that behaves as is_auto_or_concept but matches the parent
33629 node of the generic type rather than the generic type itself. This
33630 allows for type transformation in add_implicit_template_parms. */
33634 {
33636 }
33638 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
33639 (creating a new template parameter list if necessary). Returns the newly
33640 created template type parm. */
33642 tree
33644 {
33647 /* We are either continuing a function template that already contains implicit
33648 template parameters, creating a new fully-implicit function template, or
33649 extending an existing explicit function template with implicit template
33650 parameters. */
33658 {
33662 }
33663 else
33664 {
33665 /* Roll back to the existing template parameter scope (in the case of
33666 extending an explicit function template) or introduce a new template
33667 parameter scope ahead of the function parameter scope (or class scope
33668 in the case of out-of-line member definitions). The function scope is
33669 added back after template parameter synthesis below. */
33674 {
33677 }
33679 {
33680 /* If not defining a class, then any class scope is a scope level in
33681 an out-of-line member definition. In this case simply wind back
33682 beyond the first such scope to inject the template parameter list.
33683 Otherwise wind back to the class being defined. The latter can
33684 occur in class member friend declarations such as:
33686 class A {
33687 void foo (auto);
33688 };
33689 class B {
33690 friend void A::foo (auto);
33691 };
33693 The template parameter list synthesized for the friend declaration
33694 must be injected in the scope of 'B'. This can also occur in
33695 erroneous cases such as:
33697 struct A {
33698 struct B {
33699 void foo (auto);
33700 };
33701 void B::foo (auto) {}
33702 };
33704 Here the attempted definition of 'B::foo' within 'A' is ill-formed
33705 but, nevertheless, the template parameter list synthesized for the
33706 declarator should be injected into the scope of 'A' as if the
33707 ill-formed template was specified explicitly. */
33710 {
33713 }
33714 }
33720 {
33721 /* Introduce a new template parameter list for implicit template
33722 parameters. */
33726 parser->implicit_template_scope
33733 }
33734 else
33735 {
33736 /* Synthesize implicit template parameters at the end of the explicit
33737 template parameter list. */
33744 parser->implicit_template_parms
33746 }
33747 }
33749 /* Synthesize a new template parameter and track the current template
33750 parameter chain with implicit_template_parms. */
33754 synth_id);
33755 tree new_parm
33757 input_location,
33764 parser->implicit_template_parms
33766 else
33771 /* If creating a fully implicit function template, start the new implicit
33772 template parameter list with this synthesized type, otherwise grow the
33773 current template parameter list. */
33776 {
33783 }
33784 else
33785 {
33790 }
33795 }
33797 /* Finish the declaration of a fully implicit function template. Such a
33798 template has no explicit template parameter list so has not been through the
33799 normal template head and tail processing. synthesize_implicit_template_parm
33800 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
33801 provided if the declaration is a class member such that its template
33802 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
33803 form is returned. Otherwise NULL_TREE is returned. */
33805 tree
33807 {
33812 {
33816 }
33826 }