| blob | 4e06e8af0b66500348a7e88f96b9fe135a1343c6 |
1 /* C++ Parser.
2 Copyright (C) 2000-2013 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/>. */
44 \f
45 /* The lexer. */
47 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
48 and c-lex.c) and the C++ parser. */
51 {
53 };
55 /* The various kinds of non integral constant we encounter. */
57 NIC_NONE,
58 /* floating-point literal */
59 NIC_FLOAT,
60 /* %<this%> */
61 NIC_THIS,
62 /* %<__FUNCTION__%> */
63 NIC_FUNC_NAME,
64 /* %<__PRETTY_FUNCTION__%> */
65 NIC_PRETTY_FUNC,
66 /* %<__func__%> */
67 NIC_C99_FUNC,
68 /* "%<va_arg%> */
69 NIC_VA_ARG,
70 /* a cast */
71 NIC_CAST,
72 /* %<typeid%> operator */
73 NIC_TYPEID,
74 /* non-constant compound literals */
75 NIC_NCC,
76 /* a function call */
77 NIC_FUNC_CALL,
78 /* an increment */
79 NIC_INC,
80 /* an decrement */
81 NIC_DEC,
82 /* an array reference */
83 NIC_ARRAY_REF,
84 /* %<->%> */
85 NIC_ARROW,
86 /* %<.%> */
87 NIC_POINT,
88 /* the address of a label */
89 NIC_ADDR_LABEL,
90 /* %<*%> */
91 NIC_STAR,
92 /* %<&%> */
93 NIC_ADDR,
94 /* %<++%> */
95 NIC_PREINCREMENT,
96 /* %<--%> */
97 NIC_PREDECREMENT,
98 /* %<new%> */
99 NIC_NEW,
100 /* %<delete%> */
101 NIC_DEL,
102 /* calls to overloaded operators */
103 NIC_OVERLOADED,
104 /* an assignment */
105 NIC_ASSIGNMENT,
106 /* a comma operator */
107 NIC_COMMA,
108 /* a call to a constructor */
109 NIC_CONSTRUCTOR,
110 /* a transaction expression */
111 NIC_TRANSACTION
114 /* The various kinds of errors about name-lookup failing. */
116 /* NULL */
117 NLE_NULL,
118 /* is not a type */
119 NLE_TYPE,
120 /* is not a class or namespace */
121 NLE_CXX98,
122 /* is not a class, namespace, or enumeration */
123 NLE_NOT_CXX98
126 /* The various kinds of required token */
128 RT_NONE,
150 /* The type is CPP_KEYWORD */
179 RT_TRANSACTION_CANCEL /* __transaction_cancel */
182 /* Prototypes. */
188 static void cp_lexer_destroy
190 static int cp_lexer_saving_tokens
194 static void cp_lexer_get_preprocessor_token
202 static bool cp_lexer_next_token_is_not
204 static bool cp_lexer_next_token_is_keyword
208 static void cp_lexer_purge_token
210 static void cp_lexer_purge_tokens_after
212 static void cp_lexer_save_tokens
214 static void cp_lexer_commit_tokens
216 static void cp_lexer_rollback_tokens
218 static void cp_lexer_print_token
222 static void cp_lexer_start_debugging
224 static void cp_lexer_stop_debugging
230 static void cp_parser_initial_pragma
233 static tree cp_literal_operator_id
236 static bool cp_parser_omp_declare_reduction_exprs
239 /* Manifest constants. */
240 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
241 #define CP_SAVED_TOKEN_STACK 5
243 /* Variables. */
245 /* The stream to which debugging output should be written. */
248 /* Nonzero if we are parsing an unevaluated operand: an operand to
249 sizeof, typeof, or alignof. */
252 /* Dump up to NUM tokens in BUFFER to FILE starting with token
253 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
254 first token in BUFFER. If NUM is 0, dump all the tokens. If
255 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
256 highlighted by surrounding it in [[ ]]. */
258 static void
262 {
279 {
282 }
287 {
294 nprinted++;
304 {
314 }
315 }
318 {
321 }
324 }
327 /* Dump all tokens in BUFFER to stderr. */
329 void
331 {
333 }
335 DEBUG_FUNCTION void
337 {
339 }
341 DEBUG_FUNCTION void
343 {
346 else
348 }
351 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
352 description for T. */
354 static void
356 {
358 {
361 }
362 }
365 /* Dump parser context C to FILE. */
367 static void
369 {
374 }
377 /* Print the stack of parsing contexts to FILE starting with FIRST. */
379 static void
381 {
387 {
390 }
391 }
394 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
396 static void
398 {
401 }
404 /* Print an unparsed function entry UF to FILE. */
406 static void
408 {
411 tree fn;
416 i++)
417 {
423 }
428 {
431 }
437 {
440 }
442 }
445 /* Print the stack of unparsed member functions S to FILE. */
447 static void
450 {
456 {
459 }
460 }
463 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
464 the given PARSER. If FILE is NULL, the output is printed on stderr. */
466 static void
468 {
480 next_token);
481 }
484 /* Dump debugging information for the given PARSER. If FILE is NULL,
485 the output is printed on stderr. */
487 void
489 {
492 expanded_location eloc;
568 }
570 DEBUG_FUNCTION void
572 {
574 }
576 DEBUG_FUNCTION void
578 {
581 else
583 }
585 /* Allocate memory for a new lexer object and return it. */
589 {
594 /* Allocate the memory. */
597 /* Initially we are not debugging. */
602 /* Create the buffer. */
606 }
609 /* Create a new main C++ lexer, the lexer that gets tokens from the
610 preprocessor. */
614 {
616 cp_token token;
618 /* It's possible that parsing the first pragma will load a PCH file,
619 which is a GC collection point. So we have to do that before
620 allocating any memory. */
625 /* Put the first token in the buffer. */
628 /* Get the remaining tokens from the preprocessor. */
630 {
633 }
642 /* Subsequent preprocessor diagnostics should use compiler
643 diagnostic functions to get the compiler source location. */
648 }
650 /* Create a new lexer whose token stream is primed with the tokens in
651 CACHE. When these tokens are exhausted, no new tokens will be read. */
655 {
660 /* We do not own the buffer. */
667 /* Initially we are not debugging. */
672 }
674 /* Frees all resources associated with LEXER. */
676 static void
678 {
682 }
684 /* Returns nonzero if debugging information should be output. */
688 {
690 }
695 {
699 }
703 {
705 }
709 {
711 }
715 {
718 else
720 }
724 {
728 }
730 /* nonzero if we are presently saving tokens. */
734 {
736 }
738 /* Store the next token from the preprocessor in *TOKEN. Return true
739 if we reach EOF. If LEXER is NULL, assume we are handling an
740 initial #pragma pch_preprocess, and thus want the lexer to return
741 processed strings. */
743 static void
745 {
748 /* Get a new token from the preprocessor. */
749 token->type
756 /* On some systems, some header files are surrounded by an
757 implicit extern "C" block. Set a flag in the token if it
758 comes from such a header. */
763 /* Check to see if this token is a keyword. */
765 {
767 {
768 /* Mark this token as a keyword. */
770 /* Record which keyword. */
772 }
773 else
774 {
778 {
779 /* Warn about the C++0x keyword (but still treat it as
780 an identifier). */
785 /* Clear out the C_RID_CODE so we don't warn about this
786 particular identifier-turned-keyword again. */
788 }
792 }
793 }
795 {
796 /* This only happens in Objective-C++; it must be a keyword. */
799 {
800 /* Replace 'class' with '@class', 'private' with '@private',
801 etc. This prevents confusion with the C++ keyword
802 'class', and makes the tokens consistent with other
803 Objective-C 'AT' keywords. For example '@class' is
804 reported as RID_AT_CLASS which is consistent with
805 '@synchronized', which is reported as
806 RID_AT_SYNCHRONIZED.
807 */
816 }
817 }
819 {
820 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
824 }
825 }
827 /* Update the globals input_location and the input file stack from TOKEN. */
830 {
832 {
834 }
835 }
837 /* Return a pointer to the next token in the token stream, but do not
838 consume it. */
842 {
844 {
848 }
850 }
852 /* Return true if the next token has the indicated TYPE. */
856 {
858 }
860 /* Return true if the next token does not have the indicated TYPE. */
864 {
866 }
868 /* Return true if the next token is the indicated KEYWORD. */
872 {
874 }
878 {
880 }
882 /* Return true if the next token is not the indicated KEYWORD. */
886 {
888 }
890 /* Return true if the next token is a keyword for a decl-specifier. */
892 static bool
894 {
899 {
900 /* auto specifier: storage-class-specifier in C++,
901 simple-type-specifier in C++0x. */
903 /* Storage classes. */
909 /* Elaborated type specifiers. */
915 /* Simple type specifiers. */
930 /* GNU extensions. */
933 /* C++0x extensions. */
940 }
941 }
943 /* Returns TRUE iff the token T begins a decltype type. */
945 static bool
947 {
950 }
952 /* Returns TRUE iff the next token begins a decltype type. */
954 static bool
956 {
959 }
961 /* Return a pointer to the Nth token in the token stream. If N is 1,
962 then this is precisely equivalent to cp_lexer_peek_token (except
963 that it is not inline). One would like to disallow that case, but
964 there is one case (cp_parser_nth_token_starts_template_id) where
965 the caller passes a variable for N and it might be 1. */
969 {
972 /* N is 1-based, not zero-based. */
983 {
986 {
989 }
993 }
996 {
999 }
1002 }
1004 /* Return the next token, and advance the lexer's next_token pointer
1005 to point to the next non-purged token. */
1009 {
1015 do
1016 {
1019 {
1022 }
1024 }
1029 /* Provide debugging output. */
1031 {
1035 }
1038 }
1040 /* Permanently remove the next token from the token stream, and
1041 advance the next_token pointer to refer to the next non-purged
1042 token. */
1044 static void
1046 {
1055 do
1056 {
1057 tok++;
1059 {
1062 }
1063 }
1066 }
1068 /* Permanently remove all tokens after TOK, up to, but not
1069 including, the token that will be returned next by
1070 cp_lexer_peek_token. */
1072 static void
1074 {
1083 {
1088 }
1089 }
1091 /* Begin saving tokens. All tokens consumed after this point will be
1092 preserved. */
1094 static void
1096 {
1097 /* Provide debugging output. */
1102 }
1104 /* Commit to the portion of the token stream most recently saved. */
1106 static void
1108 {
1109 /* Provide debugging output. */
1114 }
1116 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1117 to the token stream. Stop saving tokens. */
1119 static void
1121 {
1122 /* Provide debugging output. */
1127 }
1129 /* Print a representation of the TOKEN on the STREAM. */
1131 static void
1133 {
1134 /* We don't use cpp_type2name here because the parser defines
1135 a few tokens of its own. */
1137 /* cpplib-defined token types */
1138 #define OP(e, s) #e,
1139 #define TK(e, s) #e,
1140 TTYPE_TABLE
1141 #undef OP
1142 #undef TK
1143 /* C++ parser token types - see "Manifest constants", above. */
1147 };
1149 /* For some tokens, print the associated data. */
1151 {
1153 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1154 For example, `struct' is mapped to an INTEGER_CST. */
1157 /* else fall through */
1175 /* If we have a name for the token, print it out. Otherwise, we
1176 simply give the numeric code. */
1179 else
1182 }
1183 }
1185 DEBUG_FUNCTION void
1187 {
1190 }
1192 DEBUG_FUNCTION void
1194 {
1197 else
1199 }
1202 /* Start emitting debugging information. */
1204 static void
1206 {
1209 }
1211 /* Stop emitting debugging information. */
1213 static void
1215 {
1218 }
1220 /* Create a new cp_token_cache, representing a range of tokens. */
1224 {
1229 }
1231 /* Diagnose if #pragma omp declare simd isn't followed immediately
1232 by function declaration or definition. */
1236 {
1238 {
1242 }
1243 }
1245 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1246 and put that into "omp declare simd" attribute. */
1250 {
1252 {
1254 {
1257 }
1259 {
1262 }
1263 }
1264 }
1265 \f
1266 /* Decl-specifiers. */
1268 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1270 static void
1272 {
1274 }
1276 /* Declarators. */
1278 /* Nothing other than the parser should be creating declarators;
1279 declarators are a semi-syntactic representation of C++ entities.
1280 Other parts of the front end that need to create entities (like
1281 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1296 /* An erroneous declarator. */
1299 /* The obstack on which declarators and related data structures are
1300 allocated. */
1303 /* Alloc BYTES from the declarator memory pool. */
1307 {
1309 }
1311 /* Allocate a declarator of the indicated KIND. Clear fields that are
1312 common to all declarators. */
1316 {
1328 }
1330 /* Make a declarator for a generalized identifier. If
1331 QUALIFYING_SCOPE is non-NULL, the identifier is
1332 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1333 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1334 is, if any. */
1338 special_function_kind sfk)
1339 {
1342 /* It is valid to write:
1344 class C { void f(); };
1345 typedef C D;
1346 void D::f();
1348 The standard is not clear about whether `typedef const C D' is
1349 legal; as of 2002-09-15 the committee is considering that
1350 question. EDG 3.0 allows that syntax. Therefore, we do as
1351 well. */
1365 }
1367 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1368 of modifiers such as const or volatile to apply to the pointer
1369 type, represented as identifiers. ATTRIBUTES represent the attributes that
1370 appertain to the pointer or reference. */
1372 cp_declarator *
1374 tree attributes)
1375 {
1383 {
1387 }
1388 else
1394 }
1396 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1397 represent the attributes that appertain to the pointer or
1398 reference. */
1400 cp_declarator *
1403 {
1411 {
1415 }
1416 else
1422 }
1424 /* Like make_pointer_declarator -- but for a pointer to a non-static
1425 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1426 appertain to the pointer or reference. */
1428 cp_declarator *
1431 tree attributes)
1432 {
1441 {
1444 }
1445 else
1451 }
1453 /* Make a declarator for the function given by TARGET, with the
1454 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1455 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1456 indicates what exceptions can be thrown. */
1458 cp_declarator *
1460 tree parms,
1461 cp_cv_quals cv_qualifiers,
1462 cp_virt_specifiers virt_specifiers,
1463 cp_ref_qualifier ref_qualifier,
1464 tree exception_specification,
1465 tree late_return_type)
1466 {
1478 {
1482 }
1483 else
1487 }
1489 /* Make a declarator for an array of BOUNDS elements, each of which is
1490 defined by ELEMENT. */
1492 cp_declarator *
1494 {
1501 {
1505 }
1506 else
1510 }
1512 /* Determine whether the declarator we've seen so far can be a
1513 parameter pack, when followed by an ellipsis. */
1514 static bool
1516 {
1517 /* Search for a declarator name, or any other declarator that goes
1518 after the point where the ellipsis could appear in a parameter
1519 pack. If we find any of these, then this declarator can not be
1520 made into a parameter pack. */
1523 {
1525 {
1537 }
1538 }
1541 }
1545 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1546 DECLARATOR and DEFAULT_ARGUMENT. */
1548 cp_parameter_declarator *
1551 tree default_argument)
1552 {
1560 else
1567 }
1569 /* Returns true iff DECLARATOR is a declaration for a function. */
1571 static bool
1573 {
1575 {
1583 }
1585 }
1587 /* The parser. */
1589 /* Overview
1590 --------
1592 A cp_parser parses the token stream as specified by the C++
1593 grammar. Its job is purely parsing, not semantic analysis. For
1594 example, the parser breaks the token stream into declarators,
1595 expressions, statements, and other similar syntactic constructs.
1596 It does not check that the types of the expressions on either side
1597 of an assignment-statement are compatible, or that a function is
1598 not declared with a parameter of type `void'.
1600 The parser invokes routines elsewhere in the compiler to perform
1601 semantic analysis and to build up the abstract syntax tree for the
1602 code processed.
1604 The parser (and the template instantiation code, which is, in a
1605 way, a close relative of parsing) are the only parts of the
1606 compiler that should be calling push_scope and pop_scope, or
1607 related functions. The parser (and template instantiation code)
1608 keeps track of what scope is presently active; everything else
1609 should simply honor that. (The code that generates static
1610 initializers may also need to set the scope, in order to check
1611 access control correctly when emitting the initializers.)
1613 Methodology
1614 -----------
1616 The parser is of the standard recursive-descent variety. Upcoming
1617 tokens in the token stream are examined in order to determine which
1618 production to use when parsing a non-terminal. Some C++ constructs
1619 require arbitrary look ahead to disambiguate. For example, it is
1620 impossible, in the general case, to tell whether a statement is an
1621 expression or declaration without scanning the entire statement.
1622 Therefore, the parser is capable of "parsing tentatively." When the
1623 parser is not sure what construct comes next, it enters this mode.
1624 Then, while we attempt to parse the construct, the parser queues up
1625 error messages, rather than issuing them immediately, and saves the
1626 tokens it consumes. If the construct is parsed successfully, the
1627 parser "commits", i.e., it issues any queued error messages and
1628 the tokens that were being preserved are permanently discarded.
1629 If, however, the construct is not parsed successfully, the parser
1630 rolls back its state completely so that it can resume parsing using
1631 a different alternative.
1633 Future Improvements
1634 -------------------
1636 The performance of the parser could probably be improved substantially.
1637 We could often eliminate the need to parse tentatively by looking ahead
1638 a little bit. In some places, this approach might not entirely eliminate
1639 the need to parse tentatively, but it might still speed up the average
1640 case. */
1642 /* Flags that are passed to some parsing functions. These values can
1643 be bitwise-ored together. */
1645 enum
1646 {
1647 /* No flags. */
1649 /* The construct is optional. If it is not present, then no error
1650 should be issued. */
1652 /* When parsing a type-specifier, treat user-defined type-names
1653 as non-type identifiers. */
1655 /* When parsing a type-specifier, do not try to parse a class-specifier
1656 or enum-specifier. */
1658 /* When parsing a decl-specifier-seq, only allow type-specifier or
1659 constexpr. */
1661 };
1663 /* This type is used for parameters and variables which hold
1664 combinations of the above flags. */
1667 /* The different kinds of declarators we want to parse. */
1670 {
1671 /* We want an abstract declarator. */
1672 CP_PARSER_DECLARATOR_ABSTRACT,
1673 /* We want a named declarator. */
1674 CP_PARSER_DECLARATOR_NAMED,
1675 /* We don't mind, but the name must be an unqualified-id. */
1676 CP_PARSER_DECLARATOR_EITHER
1679 /* The precedence values used to parse binary expressions. The minimum value
1680 of PREC must be 1, because zero is reserved to quickly discriminate
1681 binary operators from other tokens. */
1683 enum cp_parser_prec
1684 {
1685 PREC_NOT_OPERATOR,
1686 PREC_LOGICAL_OR_EXPRESSION,
1687 PREC_LOGICAL_AND_EXPRESSION,
1688 PREC_INCLUSIVE_OR_EXPRESSION,
1689 PREC_EXCLUSIVE_OR_EXPRESSION,
1690 PREC_AND_EXPRESSION,
1691 PREC_EQUALITY_EXPRESSION,
1692 PREC_RELATIONAL_EXPRESSION,
1693 PREC_SHIFT_EXPRESSION,
1694 PREC_ADDITIVE_EXPRESSION,
1695 PREC_MULTIPLICATIVE_EXPRESSION,
1696 PREC_PM_EXPRESSION,
1697 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1698 };
1700 /* A mapping from a token type to a corresponding tree node type, with a
1701 precedence value. */
1704 {
1705 /* The token type. */
1707 /* The corresponding tree code. */
1709 /* The precedence of this operator. */
1714 {
1715 /* Left hand side of the binary operation we are currently
1716 parsing. */
1717 tree lhs;
1718 /* Original tree code for left hand side, if it was a binary
1719 expression itself (used for -Wparentheses). */
1721 /* Tree code for the binary operation we are parsing. */
1723 /* Precedence of the binary operation we are parsing. */
1725 /* Location of the binary operation we are parsing. */
1726 location_t loc;
1729 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1730 entries because precedence levels on the stack are monotonically
1731 increasing. */
1735 /* Prototypes. */
1737 /* Constructors and destructors. */
1742 /* Class variables. */
1746 /* The operator-precedence table used by cp_parser_binary_expression.
1747 Transformed into an associative array (binops_by_token) by
1748 cp_parser_new. */
1781 };
1783 /* The same as binops, but initialized by cp_parser_new so that
1784 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1785 for speed. */
1788 /* Constructors and destructors. */
1790 /* Construct a new context. The context below this one on the stack
1791 is given by NEXT. */
1795 {
1798 /* Allocate the storage. */
1800 {
1801 /* Pull the first entry from the free list. */
1805 }
1806 else
1809 /* No errors have occurred yet in this context. */
1811 /* If this is not the bottommost context, copy information that we
1812 need from the previous context. */
1814 {
1815 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1816 expression, then we are parsing one in this context, too. */
1818 /* Thread the stack. */
1820 }
1823 }
1825 /* Managing the unparsed function queues. */
1827 #define unparsed_funs_with_default_args \
1828 parser->unparsed_queues->last ().funs_with_default_args
1829 #define unparsed_funs_with_definitions \
1830 parser->unparsed_queues->last ().funs_with_definitions
1831 #define unparsed_nsdmis \
1832 parser->unparsed_queues->last ().nsdmis
1834 static void
1836 {
1839 }
1841 static void
1843 {
1846 }
1848 /* Prototypes. */
1850 /* Constructors and destructors. */
1855 /* Routines to parse various constructs.
1857 Those that return `tree' will return the error_mark_node (rather
1858 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1859 Sometimes, they will return an ordinary node if error-recovery was
1860 attempted, even though a parse error occurred. So, to check
1861 whether or not a parse error occurred, you should always use
1862 cp_parser_error_occurred. If the construct is optional (indicated
1863 either by an `_opt' in the name of the function that does the
1864 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1865 the construct is not present. */
1867 /* Lexical conventions [gram.lex] */
1869 static tree cp_parser_identifier
1871 static tree cp_parser_string_literal
1873 static tree cp_parser_userdef_char_literal
1875 static tree cp_parser_userdef_string_literal
1877 static tree cp_parser_userdef_numeric_literal
1880 /* Basic concepts [gram.basic] */
1882 static bool cp_parser_translation_unit
1885 /* Expressions [gram.expr] */
1887 static tree cp_parser_primary_expression
1889 static tree cp_parser_id_expression
1891 static tree cp_parser_unqualified_id
1893 static tree cp_parser_nested_name_specifier_opt
1895 static tree cp_parser_nested_name_specifier
1897 static tree cp_parser_qualifying_entity
1899 static tree cp_parser_postfix_expression
1901 static tree cp_parser_postfix_open_square_expression
1903 static tree cp_parser_postfix_dot_deref_expression
1907 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1909 static void cp_parser_pseudo_destructor_name
1911 static tree cp_parser_unary_expression
1913 static enum tree_code cp_parser_unary_operator
1915 static tree cp_parser_new_expression
1919 static tree cp_parser_new_type_id
1927 static tree cp_parser_delete_expression
1929 static tree cp_parser_cast_expression
1931 static tree cp_parser_binary_expression
1933 static tree cp_parser_question_colon_clause
1935 static tree cp_parser_assignment_expression
1937 static enum tree_code cp_parser_assignment_operator_opt
1939 static tree cp_parser_expression
1941 static tree cp_parser_expression
1943 static tree cp_parser_constant_expression
1945 static tree cp_parser_builtin_offsetof
1947 static tree cp_parser_lambda_expression
1949 static void cp_parser_lambda_introducer
1951 static bool cp_parser_lambda_declarator_opt
1953 static void cp_parser_lambda_body
1956 /* Statements [gram.stmt.stmt] */
1958 static void cp_parser_statement
1960 static void cp_parser_label_for_labeled_statement
1962 static tree cp_parser_expression_statement
1964 static tree cp_parser_compound_statement
1966 static void cp_parser_statement_seq_opt
1968 static tree cp_parser_selection_statement
1970 static tree cp_parser_condition
1972 static tree cp_parser_iteration_statement
1974 static bool cp_parser_for_init_statement
1976 static tree cp_parser_for
1978 static tree cp_parser_c_for
1980 static tree cp_parser_range_for
1982 static void do_range_for_auto_deduction
1984 static tree cp_parser_perform_range_for_lookup
1986 static tree cp_parser_range_for_member_function
1988 static tree cp_parser_jump_statement
1990 static void cp_parser_declaration_statement
1993 static tree cp_parser_implicitly_scoped_statement
1995 static void cp_parser_already_scoped_statement
1998 /* Declarations [gram.dcl.dcl] */
2000 static void cp_parser_declaration_seq_opt
2002 static void cp_parser_declaration
2004 static void cp_parser_block_declaration
2006 static void cp_parser_simple_declaration
2008 static void cp_parser_decl_specifier_seq
2010 static tree cp_parser_storage_class_specifier_opt
2012 static tree cp_parser_function_specifier_opt
2014 static tree cp_parser_type_specifier
2017 static tree cp_parser_simple_type_specifier
2019 static tree cp_parser_type_name
2021 static tree cp_parser_nonclass_name
2023 static tree cp_parser_elaborated_type_specifier
2025 static tree cp_parser_enum_specifier
2027 static void cp_parser_enumerator_list
2029 static void cp_parser_enumerator_definition
2031 static tree cp_parser_namespace_name
2033 static void cp_parser_namespace_definition
2035 static void cp_parser_namespace_body
2037 static tree cp_parser_qualified_namespace_specifier
2039 static void cp_parser_namespace_alias_definition
2041 static bool cp_parser_using_declaration
2043 static void cp_parser_using_directive
2045 static tree cp_parser_alias_declaration
2047 static void cp_parser_asm_definition
2049 static void cp_parser_linkage_specification
2051 static void cp_parser_static_assert
2053 static tree cp_parser_decltype
2056 /* Declarators [gram.dcl.decl] */
2058 static tree cp_parser_init_declarator
2059 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2064 static enum tree_code cp_parser_ptr_operator
2066 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2068 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2070 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2072 static tree cp_parser_late_return_type_opt
2074 static tree cp_parser_declarator_id
2076 static tree cp_parser_type_id
2078 static tree cp_parser_template_type_arg
2081 static tree cp_parser_type_id_1
2083 static void cp_parser_type_specifier_seq
2085 static tree cp_parser_parameter_declaration_clause
2087 static tree cp_parser_parameter_declaration_list
2091 static tree cp_parser_default_argument
2093 static void cp_parser_function_body
2095 static tree cp_parser_initializer
2097 static tree cp_parser_initializer_clause
2099 static tree cp_parser_braced_list
2104 static bool cp_parser_ctor_initializer_opt_and_function_body
2107 static tree cp_parser_late_parsing_omp_declare_simd
2110 static tree add_implicit_template_parms
2112 static tree finish_fully_implicit_template
2115 /* Classes [gram.class] */
2117 static tree cp_parser_class_name
2119 static tree cp_parser_class_specifier
2121 static tree cp_parser_class_head
2123 static enum tag_types cp_parser_class_key
2125 static void cp_parser_member_specification_opt
2127 static void cp_parser_member_declaration
2129 static tree cp_parser_pure_specifier
2131 static tree cp_parser_constant_initializer
2134 /* Derived classes [gram.class.derived] */
2136 static tree cp_parser_base_clause
2138 static tree cp_parser_base_specifier
2141 /* Special member functions [gram.special] */
2143 static tree cp_parser_conversion_function_id
2145 static tree cp_parser_conversion_type_id
2149 static bool cp_parser_ctor_initializer_opt
2151 static void cp_parser_mem_initializer_list
2153 static tree cp_parser_mem_initializer
2155 static tree cp_parser_mem_initializer_id
2158 /* Overloading [gram.over] */
2160 static tree cp_parser_operator_function_id
2162 static tree cp_parser_operator
2165 /* Templates [gram.temp] */
2167 static void cp_parser_template_declaration
2169 static tree cp_parser_template_parameter_list
2171 static tree cp_parser_template_parameter
2173 static tree cp_parser_type_parameter
2175 static tree cp_parser_template_id
2177 static tree cp_parser_template_name
2179 static tree cp_parser_template_argument_list
2181 static tree cp_parser_template_argument
2183 static void cp_parser_explicit_instantiation
2185 static void cp_parser_explicit_specialization
2188 /* Exception handling [gram.exception] */
2190 static tree cp_parser_try_block
2192 static bool cp_parser_function_try_block
2194 static void cp_parser_handler_seq
2196 static void cp_parser_handler
2198 static tree cp_parser_exception_declaration
2200 static tree cp_parser_throw_expression
2202 static tree cp_parser_exception_specification_opt
2204 static tree cp_parser_type_id_list
2207 /* GNU Extensions */
2209 static tree cp_parser_asm_specification_opt
2211 static tree cp_parser_asm_operand_list
2213 static tree cp_parser_asm_clobber_list
2215 static tree cp_parser_asm_label_list
2217 static bool cp_next_tokens_can_be_attribute_p
2219 static bool cp_next_tokens_can_be_gnu_attribute_p
2221 static bool cp_next_tokens_can_be_std_attribute_p
2223 static bool cp_nth_tokens_can_be_std_attribute_p
2225 static bool cp_nth_tokens_can_be_gnu_attribute_p
2227 static bool cp_nth_tokens_can_be_attribute_p
2229 static tree cp_parser_attributes_opt
2231 static tree cp_parser_gnu_attributes_opt
2233 static tree cp_parser_gnu_attribute_list
2235 static tree cp_parser_std_attribute
2237 static tree cp_parser_std_attribute_spec
2239 static tree cp_parser_std_attribute_spec_seq
2241 static bool cp_parser_extension_opt
2243 static void cp_parser_label_declaration
2246 /* Transactional Memory Extensions */
2248 static tree cp_parser_transaction
2250 static tree cp_parser_transaction_expression
2252 static bool cp_parser_function_transaction
2254 static tree cp_parser_transaction_cancel
2258 pragma_external,
2259 pragma_member,
2260 pragma_objc_icode,
2261 pragma_stmt,
2262 pragma_compound
2263 };
2264 static bool cp_parser_pragma
2267 /* Objective-C++ Productions */
2269 static tree cp_parser_objc_message_receiver
2271 static tree cp_parser_objc_message_args
2273 static tree cp_parser_objc_message_expression
2275 static tree cp_parser_objc_encode_expression
2277 static tree cp_parser_objc_defs_expression
2279 static tree cp_parser_objc_protocol_expression
2281 static tree cp_parser_objc_selector_expression
2283 static tree cp_parser_objc_expression
2285 static bool cp_parser_objc_selector_p
2287 static tree cp_parser_objc_selector
2289 static tree cp_parser_objc_protocol_refs_opt
2291 static void cp_parser_objc_declaration
2293 static tree cp_parser_objc_statement
2295 static bool cp_parser_objc_valid_prefix_attributes
2297 static void cp_parser_objc_at_property_declaration
2299 static void cp_parser_objc_at_synthesize_declaration
2301 static void cp_parser_objc_at_dynamic_declaration
2303 static tree cp_parser_objc_struct_declaration
2306 /* Utility Routines */
2308 static tree cp_parser_lookup_name
2310 static tree cp_parser_lookup_name_simple
2312 static tree cp_parser_maybe_treat_template_as_class
2314 static bool cp_parser_check_declarator_template_parameters
2316 static bool cp_parser_check_template_parameters
2318 static tree cp_parser_simple_cast_expression
2320 static tree cp_parser_global_scope_opt
2322 static bool cp_parser_constructor_declarator_p
2324 static tree cp_parser_function_definition_from_specifiers_and_declarator
2326 static tree cp_parser_function_definition_after_declarator
2328 static void cp_parser_template_declaration_after_export
2330 static void cp_parser_perform_template_parameter_access_checks
2332 static tree cp_parser_single_declaration
2334 static tree cp_parser_functional_cast
2336 static tree cp_parser_save_member_function_body
2338 static tree cp_parser_save_nsdmi
2340 static tree cp_parser_enclosed_template_argument_list
2342 static void cp_parser_save_default_args
2344 static void cp_parser_late_parsing_for_member
2346 static tree cp_parser_late_parse_one_default_arg
2348 static void cp_parser_late_parsing_nsdmi
2350 static void cp_parser_late_parsing_default_args
2352 static tree cp_parser_sizeof_operand
2354 static tree cp_parser_trait_expr
2356 static bool cp_parser_declares_only_class_p
2358 static void cp_parser_set_storage_class
2360 static void cp_parser_set_decl_spec_type
2362 static void set_and_check_decl_spec_loc
2365 static bool cp_parser_friend_p
2367 static void cp_parser_required_error
2373 static bool cp_parser_token_starts_function_definition_p
2375 static bool cp_parser_next_token_starts_class_definition_p
2377 static bool cp_parser_next_token_ends_template_argument_p
2379 static bool cp_parser_nth_token_starts_template_argument_list_p
2381 static enum tag_types cp_parser_token_is_class_key
2383 static void cp_parser_check_class_key
2385 static void cp_parser_check_access_in_redeclaration
2387 static bool cp_parser_optional_template_keyword
2389 static void cp_parser_pre_parsed_nested_name_specifier
2391 static bool cp_parser_cache_group
2393 static tree cp_parser_cache_defarg
2395 static void cp_parser_parse_tentatively
2397 static void cp_parser_commit_to_tentative_parse
2399 static void cp_parser_commit_to_topmost_tentative_parse
2401 static void cp_parser_abort_tentative_parse
2403 static bool cp_parser_parse_definitely
2407 static bool cp_parser_uncommitted_to_tentative_parse_p
2409 static void cp_parser_error
2411 static void cp_parser_name_lookup_error
2413 static bool cp_parser_simulate_error
2415 static bool cp_parser_check_type_definition
2417 static void cp_parser_check_for_definition_in_return_type
2419 static void cp_parser_check_for_invalid_template_id
2421 static bool cp_parser_non_integral_constant_expression
2423 static void cp_parser_diagnose_invalid_type_name
2425 static bool cp_parser_parse_and_diagnose_invalid_type_name
2427 static int cp_parser_skip_to_closing_parenthesis
2429 static void cp_parser_skip_to_end_of_statement
2431 static void cp_parser_consume_semicolon_at_end_of_statement
2433 static void cp_parser_skip_to_end_of_block_or_statement
2435 static bool cp_parser_skip_to_closing_brace
2437 static void cp_parser_skip_to_end_of_template_parameter_list
2439 static void cp_parser_skip_to_pragma_eol
2441 static bool cp_parser_error_occurred
2443 static bool cp_parser_allow_gnu_extensions_p
2445 static bool cp_parser_is_pure_string_literal
2447 static bool cp_parser_is_string_literal
2449 static bool cp_parser_is_keyword
2451 static tree cp_parser_make_typename_type
2456 /* Returns nonzero if we are parsing tentatively. */
2460 {
2462 }
2464 /* Returns nonzero if TOKEN is a string literal. */
2466 static bool
2468 {
2474 }
2476 /* Returns nonzero if TOKEN is a string literal
2477 of a user-defined string literal. */
2479 static bool
2481 {
2488 }
2490 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2492 static bool
2494 {
2496 }
2498 /* If not parsing tentatively, issue a diagnostic of the form
2499 FILE:LINE: MESSAGE before TOKEN
2500 where TOKEN is the next token in the input stream. MESSAGE
2501 (specified by the caller) is usually of the form "expected
2502 OTHER-TOKEN". */
2504 static void
2506 {
2508 {
2510 /* This diagnostic makes more sense if it is tagged to the line
2511 of the token we just peeked at. */
2515 {
2520 }
2523 /* Because c_parser_error does not understand
2524 CPP_KEYWORD, keywords are treated like
2525 identifiers. */
2528 }
2529 }
2531 /* Issue an error about name-lookup failing. NAME is the
2532 IDENTIFIER_NODE DECL is the result of
2533 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2534 the thing that we hoped to find. */
2536 static void
2538 tree name,
2539 tree decl,
2540 name_lookup_error desired,
2541 location_t location)
2542 {
2543 /* If name lookup completely failed, tell the user that NAME was not
2544 declared. */
2546 {
2559 else
2561 }
2563 {
2565 {
2582 }
2583 }
2585 {
2587 {
2597 name);
2601 }
2602 }
2603 else
2604 {
2606 {
2619 }
2620 }
2621 }
2623 /* If we are parsing tentatively, remember that an error has occurred
2624 during this tentative parse. Returns true if the error was
2625 simulated; false if a message should be issued by the caller. */
2627 static bool
2629 {
2631 {
2634 }
2636 }
2638 /* This function is called when a type is defined. If type
2639 definitions are forbidden at this point, an error message is
2640 issued. */
2642 static bool
2644 {
2645 /* If types are forbidden here, issue a message. */
2647 {
2648 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2649 in the message need to be interpreted. */
2652 }
2654 }
2656 /* This function is called when the DECLARATOR is processed. The TYPE
2657 was a type defined in the decl-specifiers. If it is invalid to
2658 define a type in the decl-specifiers for DECLARATOR, an error is
2659 issued. TYPE_LOCATION is the location of TYPE and is used
2660 for error reporting. */
2662 static void
2665 {
2666 /* [dcl.fct] forbids type definitions in return types.
2667 Unfortunately, it's not easy to know whether or not we are
2668 processing a return type until after the fact. */
2676 {
2681 type);
2682 }
2683 }
2685 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2686 "<" in any valid C++ program. If the next token is indeed "<",
2687 issue a message warning the user about what appears to be an
2688 invalid attempt to form a template-id. LOCATION is the location
2689 of the type-specifier (TYPE) */
2691 static void
2693 tree type,
2695 location_t location)
2696 {
2700 {
2704 {
2707 else
2709 }
2710 else
2712 /* Remember the location of the invalid "<". */
2715 /* Consume the "<". */
2717 /* Parse the template arguments. */
2719 /* Permanently remove the invalid template arguments so that
2720 this error message is not issued again. */
2723 }
2724 }
2726 /* If parsing an integral constant-expression, issue an error message
2727 about the fact that THING appeared and return true. Otherwise,
2728 return false. In either case, set
2729 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2731 static bool
2733 non_integral_constant thing)
2734 {
2737 {
2739 {
2742 {
2749 "enumeration type cannot appear in a "
2840 }
2844 }
2845 }
2847 }
2849 /* Emit a diagnostic for an invalid type name. SCOPE is the
2850 qualifying scope (or NULL, if none) for ID. This function commits
2851 to the current active tentative parse, if any. (Otherwise, the
2852 problematic construct might be encountered again later, resulting
2853 in duplicate error messages.) LOCATION is the location of ID. */
2855 static void
2858 location_t location)
2859 {
2862 /* Try to lookup the identifier. */
2867 /* If the lookup found a template-name, it means that the user forgot
2868 to specify an argument list. Emit a useful error message. */
2872 decl);
2876 /* Something like 'unsigned A a;' */
2879 {
2880 /* Issue an error message. */
2882 /* If we're in a template class, it's possible that the user was
2883 referring to a type from a base class. For example:
2885 template <typename T> struct A { typedef T X; };
2886 template <typename T> struct B : public A<T> { X x; };
2888 The user should have said "typename A<T>::X". */
2894 {
2895 tree b;
2898 b;
2900 {
2904 {
2905 tree field;
2906 /* Go from a particular instantiation of the
2907 template (which will have an empty TYPE_FIELDs),
2908 to the main version. */
2911 field;
2915 {
2920 }
2923 }
2924 }
2925 }
2926 }
2927 /* Here we diagnose qualified-ids where the scope is actually correct,
2928 but the identifier does not resolve to a valid type name. */
2930 {
2932 {
2937 else
2941 }
2944 {
2945 /* A<T>::A<T>() */
2951 }
2958 {
2963 else
2967 }
2968 else
2970 }
2971 }
2973 /* Check for a common situation where a type-name should be present,
2974 but is not, and issue a sensible error message. Returns true if an
2975 invalid type-name was detected.
2977 The situation handled by this function are variable declarations of the
2978 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2979 Usually, `ID' should name a type, but if we got here it means that it
2980 does not. We try to emit the best possible error message depending on
2981 how exactly the id-expression looks like. */
2983 static bool
2985 {
2986 tree id;
2989 /* Avoid duplicate error about ambiguous lookup. */
2991 {
2995 }
3004 /* If the next token is a (, this is a function with no explicit return
3005 type, i.e. constructor, destructor or conversion op. */
3008 {
3011 }
3015 /* Emit a diagnostic for the invalid type. */
3018 out:
3019 /* If we aren't in the middle of a declarator (i.e. in a
3020 parameter-declaration-clause), skip to the end of the declaration;
3021 there's no point in trying to process it. */
3025 }
3027 /* Consume tokens up to, and including, the next non-nested closing `)'.
3028 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3029 are doing error recovery. Returns -1 if OR_COMMA is true and we
3030 found an unnested comma. */
3032 static int
3037 {
3047 {
3051 {
3054 /* If we've run out of tokens, then there is no closing `)'. */
3057 /* This is good for lambda expression capture-lists. */
3067 /* This matches the processing in skip_to_end_of_statement. */
3093 {
3097 }
3102 }
3104 /* Consume the token. */
3106 }
3107 }
3109 /* Consume tokens until we reach the end of the current statement.
3110 Normally, that will be just before consuming a `;'. However, if a
3111 non-nested `}' comes first, then we stop before consuming that. */
3113 static void
3115 {
3119 {
3123 {
3126 /* If we've run out of tokens, stop. */
3130 /* If the next token is a `;', we have reached the end of the
3131 statement. */
3137 /* If this is a non-nested '}', stop before consuming it.
3138 That way, when confronted with something like:
3140 { 3 + }
3142 we stop before consuming the closing '}', even though we
3143 have not yet reached a `;'. */
3147 /* If it is the closing '}' for a block that we have
3148 scanned, stop -- but only after consuming the token.
3149 That way given:
3151 void f g () { ... }
3152 typedef int I;
3154 we will stop after the body of the erroneously declared
3155 function, but before consuming the following `typedef'
3156 declaration. */
3158 {
3161 }
3169 }
3171 /* Consume the token. */
3173 }
3174 }
3176 /* This function is called at the end of a statement or declaration.
3177 If the next token is a semicolon, it is consumed; otherwise, error
3178 recovery is attempted. */
3180 static void
3182 {
3183 /* Look for the trailing `;'. */
3185 {
3186 /* If there is additional (erroneous) input, skip to the end of
3187 the statement. */
3189 /* If the next token is now a `;', consume it. */
3192 }
3193 }
3195 /* Skip tokens until we have consumed an entire block, or until we
3196 have consumed a non-nested `;'. */
3198 static void
3200 {
3204 {
3208 {
3211 /* If we've run out of tokens, stop. */
3215 /* Stop if this is an unnested ';'. */
3221 /* Stop if this is an unnested '}', or closes the outermost
3222 nesting level. */
3223 nesting_depth--;
3231 /* Nest. */
3232 nesting_depth++;
3237 }
3239 /* Consume the token. */
3241 }
3242 }
3244 /* Skip tokens until a non-nested closing curly brace is the next
3245 token, or there are no more tokens. Return true in the first case,
3246 false otherwise. */
3248 static bool
3250 {
3254 {
3258 {
3261 /* If we've run out of tokens, stop. */
3265 /* If the next token is a non-nested `}', then we have reached
3266 the end of the current block. */
3272 /* If it the next token is a `{', then we are entering a new
3273 block. Consume the entire block. */
3279 }
3281 /* Consume the token. */
3283 }
3284 }
3286 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3287 parameter is the PRAGMA token, allowing us to purge the entire pragma
3288 sequence. */
3290 static void
3292 {
3297 do
3301 /* Ensure that the pragma is not parsed again. */
3303 }
3305 /* Require pragma end of line, resyncing with it as necessary. The
3306 arguments are as for cp_parser_skip_to_pragma_eol. */
3308 static void
3310 {
3314 }
3316 /* This is a simple wrapper around make_typename_type. When the id is
3317 an unresolved identifier node, we can provide a superior diagnostic
3318 using cp_parser_diagnose_invalid_type_name. */
3320 static tree
3323 {
3324 tree result;
3326 {
3332 }
3334 }
3336 /* This is a wrapper around the
3337 make_{pointer,ptrmem,reference}_declarator functions that decides
3338 which one to call based on the CODE and CLASS_TYPE arguments. The
3339 CODE argument should be one of the values returned by
3340 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3341 appertain to the pointer or reference. */
3345 cp_cv_quals cv_qualifiers,
3347 tree attributes)
3348 {
3355 else
3365 }
3367 /* Create a new C++ parser. */
3371 {
3376 /* cp_lexer_new_main is called before doing GC allocation because
3377 cp_lexer_new_main might load a PCH file. */
3380 /* Initialize the binops_by_token so that we can get the tree
3381 directly from the token. */
3389 /* For now, we always accept GNU extensions. */
3392 /* The `>' token is a greater-than operator, not the end of a
3393 template-id. */
3398 /* We are not parsing a constant-expression. */
3403 /* Local variable names are not forbidden. */
3406 /* We are not processing an `extern "C"' declaration. */
3409 /* We are not processing a declarator. */
3412 /* We are not processing a template-argument-list. */
3415 /* We are not in an iteration statement. */
3418 /* We are not in a switch statement. */
3421 /* We are not parsing a type-id inside an expression. */
3424 /* Declarations aren't implicitly extern "C". */
3427 /* String literals should be translated to the execution character set. */
3430 /* We are not parsing a function body. */
3433 /* We can correct until told otherwise. */
3436 /* The unparsed function queue is empty. */
3439 /* There are no classes being defined. */
3442 /* No template parameters apply. */
3445 /* Not declaring an implicit function template. */
3449 }
3451 /* Create a cp_lexer structure which will emit the tokens in CACHE
3452 and push it onto the parser's lexer stack. This is used for delayed
3453 parsing of in-class method bodies and default arguments, and should
3454 not be confused with tentative parsing. */
3455 static void
3457 {
3462 /* Move the current source position to that of the first token in the
3463 new lexer. */
3465 }
3467 /* Pop the top lexer off the parser stack. This is never used for the
3468 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3469 static void
3471 {
3476 /* Put the current source position back where it was before this
3477 lexer was pushed. */
3479 }
3481 /* Lexical conventions [gram.lex] */
3483 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3484 identifier. */
3486 static tree
3488 {
3491 /* Look for the identifier. */
3493 /* Return the value. */
3495 }
3497 /* Parse a sequence of adjacent string constants. Returns a
3498 TREE_STRING representing the combined, nul-terminated string
3499 constant. If TRANSLATE is true, translate the string to the
3500 execution character set. If WIDE_OK is true, a wide string is
3501 invalid here.
3503 C++98 [lex.string] says that if a narrow string literal token is
3504 adjacent to a wide string literal token, the behavior is undefined.
3505 However, C99 6.4.5p4 says that this results in a wide string literal.
3506 We follow C99 here, for consistency with the C front end.
3508 This code is largely lifted from lex_string() in c-lex.c.
3510 FUTURE: ObjC++ will need to handle @-strings here. */
3511 static tree
3513 {
3514 tree value;
3521 tree string_tree;
3527 {
3530 }
3533 {
3537 }
3538 else
3539 {
3542 }
3545 /* Try to avoid the overhead of creating and destroying an obstack
3546 for the common case of just one string. */
3549 {
3557 {
3561 }
3562 else
3566 }
3567 else
3568 {
3572 do
3573 {
3575 count++;
3580 {
3583 {
3586 }
3589 {
3594 }
3596 }
3597 else
3601 {
3606 "unsupported non-standard concatenation "
3608 }
3614 {
3618 }
3619 else
3620 {
3624 }
3625 }
3629 }
3632 {
3635 }
3639 {
3644 {
3659 }
3664 {
3669 }
3670 }
3671 else
3672 /* cpp_interpret_string has issued an error. */
3679 }
3681 /* Look up a literal operator with the name and the exact arguments. */
3683 static tree
3685 {
3692 {
3698 {
3701 {
3711 }
3714 /* May be this should be sufficient_parms_p instead,
3715 depending on how exactly should user-defined literals
3716 work in presence of default arguments on the literal
3717 operator parameters. */
3720 }
3721 }
3724 }
3726 /* Parse a user-defined char constant. Returns a call to a user-defined
3727 literal operator taking the character as an argument. */
3729 static tree
3731 {
3739 /* Build up a call to the user-defined operator */
3740 /* Lookup the name we got back from the id-expression. */
3745 {
3750 }
3759 }
3761 /* A subroutine of cp_parser_userdef_numeric_literal to
3762 create a char... template parameter pack from a string node. */
3764 static tree
3766 {
3767 tree charvec;
3773 /* Fill in CHARVEC with all of the parameters. */
3778 /* Build the argument packs. */
3785 }
3787 /* A subroutine of cp_parser_userdef_numeric_literal to
3788 create a char... template parameter pack from a string node. */
3790 static tree
3792 {
3793 tree charvec;
3803 /* First template parm is character type. */
3806 /* Fill in CHARVEC with all of the parameters. */
3809 {
3812 }
3814 {
3818 }
3820 {
3824 }
3826 /* Build the argument packs. */
3833 }
3835 /* Parse a user-defined numeric constant. returns a call to a user-defined
3836 literal operator. */
3838 static tree
3840 {
3851 /* Look for a literal operator taking the exact type of numeric argument
3852 as the literal value. */
3857 {
3860 {
3864 long_long_unsigned_type_node);
3865 else
3866 {
3870 long_double_type_node);
3874 }
3877 }
3878 }
3881 /* If the numeric argument didn't work, look for a raw literal
3882 operator taking a const char* argument consisting of the number
3883 in string format. */
3888 {
3891 {
3894 }
3895 }
3898 /* If the raw literal didn't work, look for a non-type template
3899 function with parameter pack char.... Call the function with
3900 template parameter characters representing the number. */
3904 {
3909 {
3912 }
3913 }
3918 }
3920 /* Parse a user-defined string constant. Returns a call to a user-defined
3921 literal operator taking a character pointer and the length of the string
3922 as arguments. */
3924 static tree
3926 {
3936 /* Look for a template function with typename parameter CharT
3937 and parameter pack CharT... Call the function with
3938 template parameter characters representing the string. */
3942 {
3947 {
3950 }
3951 }
3954 /* Build up a call to the user-defined operator */
3955 /* Lookup the name we got back from the id-expression. */
3961 {
3965 }
3974 }
3977 /* Basic concepts [gram.basic] */
3979 /* Parse a translation-unit.
3981 translation-unit:
3982 declaration-seq [opt]
3984 Returns TRUE if all went well. */
3986 static bool
3988 {
3989 /* The address of the first non-permanent object on the declarator
3990 obstack. */
3995 /* Create the declarator obstack, if necessary. */
3997 {
3999 /* Create the error declarator. */
4001 /* Create the empty parameter list. */
4003 /* Remember where the base of the declarator obstack lies. */
4005 }
4009 /* If there are no tokens left then all went well. */
4011 {
4012 /* Get rid of the token array; we don't need it any more. */
4016 /* This file might have been a context that's implicitly extern
4017 "C". If so, pop the lang context. (Only relevant for PCH.) */
4019 {
4022 }
4024 /* Finish up. */
4028 }
4029 else
4030 {
4033 }
4035 /* Make sure the declarator obstack was fully cleaned up. */
4039 /* All went well. */
4041 }
4043 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4044 decltype context. */
4048 {
4053 }
4055 /* Expressions [gram.expr] */
4057 /* Parse a primary-expression.
4059 primary-expression:
4060 literal
4061 this
4062 ( expression )
4063 id-expression
4065 GNU Extensions:
4067 primary-expression:
4068 ( compound-statement )
4069 __builtin_va_arg ( assignment-expression , type-id )
4070 __builtin_offsetof ( type-id , offsetof-expression )
4072 C++ Extensions:
4073 __has_nothrow_assign ( type-id )
4074 __has_nothrow_constructor ( type-id )
4075 __has_nothrow_copy ( type-id )
4076 __has_trivial_assign ( type-id )
4077 __has_trivial_constructor ( type-id )
4078 __has_trivial_copy ( type-id )
4079 __has_trivial_destructor ( type-id )
4080 __has_virtual_destructor ( type-id )
4081 __is_abstract ( type-id )
4082 __is_base_of ( type-id , type-id )
4083 __is_class ( type-id )
4084 __is_convertible_to ( type-id , type-id )
4085 __is_empty ( type-id )
4086 __is_enum ( type-id )
4087 __is_final ( type-id )
4088 __is_literal_type ( type-id )
4089 __is_pod ( type-id )
4090 __is_polymorphic ( type-id )
4091 __is_std_layout ( type-id )
4092 __is_trivial ( type-id )
4093 __is_union ( type-id )
4095 Objective-C++ Extension:
4097 primary-expression:
4098 objc-expression
4100 literal:
4101 __null
4103 ADDRESS_P is true iff this expression was immediately preceded by
4104 "&" and therefore might denote a pointer-to-member. CAST_P is true
4105 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4106 true iff this expression is a template argument.
4108 Returns a representation of the expression. Upon return, *IDK
4109 indicates what kind of id-expression (if any) was present. */
4111 static tree
4118 {
4121 /* Assume the primary expression is not an id-expression. */
4124 /* Peek at the next token. */
4127 {
4128 /* literal:
4129 integer-literal
4130 character-literal
4131 floating-literal
4132 string-literal
4133 boolean-literal
4134 pointer-literal
4135 user-defined-literal */
4145 {
4149 }
4150 /* Floating-point literals are only allowed in an integral
4151 constant expression if they are cast to an integral or
4152 enumeration type. */
4156 {
4157 /* CAST_P will be set even in invalid code like "int(2.7 +
4158 ...)". Therefore, we have to check that the next token
4159 is sure to end the cast. */
4161 {
4166 enumerator-definition. */
4168 /* The curly brace at the end of an enum-specifier. */
4170 /* The end of a statement. */
4172 /* The end of the cast-expression. */
4174 /* The end of an array bound. */
4176 /* The closing ">" in a template-argument-list. */
4179 /* C++0x only: A ">>" treated like two ">" tokens,
4180 in a template-argument-list. */
4185 }
4187 /* If we are within a cast, then the constraint that the
4188 cast is to an integral or enumeration type will be
4189 checked at that point. If we are not within a cast, then
4190 this code is invalid. */
4193 }
4212 /* ??? Should wide strings be allowed when parser->translate_strings_p
4213 is false (i.e. in attributes)? If not, we can kill the third
4214 argument to cp_parser_string_literal. */
4220 {
4221 tree expr;
4224 /* Consume the `('. */
4226 /* Within a parenthesized expression, a `>' token is always
4227 the greater-than operator. */
4228 saved_greater_than_is_operator_p
4231 /* If we see `( { ' then we are looking at the beginning of
4232 a GNU statement-expression. */
4235 {
4236 /* Statement-expressions are not allowed by the standard. */
4240 /* And they're not allowed outside of a function-body; you
4241 cannot, for example, write:
4243 int i = ({ int j = 3; j + 1; });
4245 at class or namespace scope. */
4248 {
4250 "statement-expressions are not allowed outside "
4254 }
4255 else
4256 {
4257 /* Start the statement-expression. */
4259 /* Parse the compound-statement. */
4261 /* Finish up. */
4263 }
4264 }
4265 else
4266 {
4267 /* Parse the parenthesized expression. */
4269 /* Let the front end know that this expression was
4270 enclosed in parentheses. This matters in case, for
4271 example, the expression is of the form `A::B', since
4272 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4273 not. */
4275 /* DR 705: Wrapping an unqualified name in parentheses
4276 suppresses arg-dependent lookup. We want to pass back
4277 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4278 (c++/37862), but none of the others. */
4281 }
4282 /* The `>' token might be the end of a template-id or
4283 template-parameter-list now. */
4284 parser->greater_than_is_operator_p
4286 /* Consume the `)'. */
4291 }
4295 /* We have an Objective-C++ message. */
4297 {
4299 /* Don't warn about a failed tentative parse. */
4304 }
4308 /* We have an Objective-C++ string literal. */
4315 {
4316 /* These two are the boolean literals. */
4324 /* The `__null' literal. */
4329 /* The `nullptr' literal. */
4334 /* Recognize the `this' keyword. */
4338 {
4342 }
4343 /* Pointers cannot appear in constant-expressions. */
4348 /* The `operator' keyword can be the beginning of an
4349 id-expression. */
4356 {
4357 non_integral_constant name;
4359 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4360 __func__ are the names of variables -- but they are
4361 treated specially. Therefore, they are handled here,
4362 rather than relying on the generic id-expression logic
4363 below. Grammatically, these names are id-expressions.
4365 Consume the token. */
4369 {
4381 }
4386 /* Look up the name. */
4388 }
4391 {
4392 tree expression;
4393 tree type;
4394 source_location type_location;
4396 /* The `__builtin_va_arg' construct is used to handle
4397 `va_arg'. Consume the `__builtin_va_arg' token. */
4399 /* Look for the opening `('. */
4401 /* Now, parse the assignment-expression. */
4404 /* Look for the `,'. */
4407 /* Parse the type-id. */
4409 /* Look for the closing `)'. */
4411 /* Using `va_arg' in a constant-expression is not
4412 allowed. */
4414 NIC_VA_ARG))
4417 }
4445 /* Objective-C++ expressions. */
4455 {
4460 }
4464 }
4466 /* An id-expression can start with either an identifier, a
4467 `::' as the beginning of a qualified-id, or the "operator"
4468 keyword. */
4473 {
4474 tree id_expression;
4475 tree decl;
4481 id_expression:
4482 /* Parse the id-expression. */
4483 id_expression
4500 /* If we have a template-id, then no further lookup is
4501 required. If the template-id was for a template-class, we
4502 will sometimes have a TYPE_DECL at this point. */
4506 /* Look up the name. */
4507 else
4508 {
4509 tree ambiguous_decls;
4511 /* If we already know that this lookup is ambiguous, then
4512 we've already issued an error message; there's no reason
4513 to check again. */
4516 {
4519 }
4522 none_type,
4523 template_p,
4528 /* If the lookup was ambiguous, an error will already have
4529 been issued. */
4533 /* In Objective-C++, we may have an Objective-C 2.0
4534 dot-syntax for classes here. */
4539 {
4540 tree component;
4547 }
4549 /* In Objective-C++, an instance variable (ivar) may be preferred
4550 to whatever cp_parser_lookup_name() found. */
4553 /* If name lookup gives us a SCOPE_REF, then the
4554 qualifying scope was dependent. */
4556 {
4557 /* At this point, we do not know if DECL is a valid
4558 integral constant expression. We assume that it is
4559 in fact such an expression, so that code like:
4561 template <int N> struct A {
4562 int a[B<N>::i];
4563 };
4565 is accepted. At template-instantiation time, we
4566 will check that B<N>::i is actually a constant. */
4568 }
4569 /* Check to see if DECL is a local variable in a context
4570 where that is forbidden. */
4573 {
4574 /* It might be that we only found DECL because we are
4575 trying to be generous with pre-ISO scoping rules.
4576 For example, consider:
4578 int i;
4579 void g() {
4580 for (int i = 0; i < 10; ++i) {}
4581 extern void f(int j = i);
4582 }
4584 Here, name look up will originally find the out
4585 of scope `i'. We need to issue a warning message,
4586 but then use the global `i'. */
4589 {
4592 decl);
4594 }
4595 }
4596 }
4598 decl = (finish_id_expression
4600 idk,
4605 template_arg_p,
4611 }
4613 /* Anything else is an error. */
4617 }
4618 }
4626 {
4629 }
4631 /* Parse an id-expression.
4633 id-expression:
4634 unqualified-id
4635 qualified-id
4637 qualified-id:
4638 :: [opt] nested-name-specifier template [opt] unqualified-id
4639 :: identifier
4640 :: operator-function-id
4641 :: template-id
4643 Return a representation of the unqualified portion of the
4644 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4645 a `::' or nested-name-specifier.
4647 Often, if the id-expression was a qualified-id, the caller will
4648 want to make a SCOPE_REF to represent the qualified-id. This
4649 function does not do this in order to avoid wastefully creating
4650 SCOPE_REFs when they are not required.
4652 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4653 `template' keyword.
4655 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4656 uninstantiated templates.
4658 If *TEMPLATE_P is non-NULL, it is set to true iff the
4659 `template' keyword is used to explicitly indicate that the entity
4660 named is a template.
4662 If DECLARATOR_P is true, the id-expression is appearing as part of
4663 a declarator, rather than as part of an expression. */
4665 static tree
4672 {
4676 /* Assume the `template' keyword was not used. */
4680 /* Look for the optional `::' operator. */
4681 global_scope_p
4684 /* Look for the optional nested-name-specifier. */
4685 nested_name_specifier_p
4688 check_dependency_p,
4690 declarator_p)
4692 /* If there is a nested-name-specifier, then we are looking at
4693 the first qualified-id production. */
4695 {
4696 tree saved_scope;
4697 tree saved_object_scope;
4698 tree saved_qualifying_scope;
4699 tree unqualified_id;
4702 /* See if the next token is the `template' keyword. */
4706 /* Name lookup we do during the processing of the
4707 unqualified-id might obliterate SCOPE. */
4711 /* Process the final unqualified-id. */
4713 check_dependency_p,
4714 declarator_p,
4716 /* Restore the SAVED_SCOPE for our caller. */
4722 }
4723 /* Otherwise, if we are in global scope, then we are looking at one
4724 of the other qualified-id productions. */
4726 {
4728 tree id;
4730 /* Peek at the next token. */
4733 /* If it's an identifier, and the next token is not a "<", then
4734 we can avoid the template-id case. This is an optimization
4735 for this common case. */
4737 && !cp_parser_nth_token_starts_template_argument_list_p
4742 /* Try a template-id. */
4746 none_type,
4747 declarator_p);
4748 /* If that worked, we're done. */
4752 /* Peek at the next token. (Changes in the token buffer may
4753 have invalidated the pointer obtained above.) */
4757 {
4764 /* Fall through. */
4769 }
4770 }
4771 else
4774 declarator_p,
4775 optional_p);
4776 }
4778 /* Parse an unqualified-id.
4780 unqualified-id:
4781 identifier
4782 operator-function-id
4783 conversion-function-id
4784 ~ class-name
4785 template-id
4787 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4788 keyword, in a construct like `A::template ...'.
4790 Returns a representation of unqualified-id. For the `identifier'
4791 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4792 production a BIT_NOT_EXPR is returned; the operand of the
4793 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4794 other productions, see the documentation accompanying the
4795 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4796 names are looked up in uninstantiated templates. If DECLARATOR_P
4797 is true, the unqualified-id is appearing as part of a declarator,
4798 rather than as part of an expression. */
4800 static tree
4806 {
4809 /* Peek at the next token. */
4813 {
4815 {
4816 tree id;
4818 /* We don't know yet whether or not this will be a
4819 template-id. */
4821 /* Try a template-id. */
4823 check_dependency_p,
4824 none_type,
4825 declarator_p);
4826 /* If it worked, we're done. */
4829 /* Otherwise, it's an ordinary identifier. */
4831 }
4835 check_dependency_p,
4836 none_type,
4837 declarator_p);
4840 {
4841 tree type_decl;
4842 tree qualifying_scope;
4843 tree object_scope;
4844 tree scope;
4847 /* Consume the `~' token. */
4849 /* Parse the class-name. The standard, as written, seems to
4850 say that:
4852 template <typename T> struct S { ~S (); };
4853 template <typename T> S<T>::~S() {}
4855 is invalid, since `~' must be followed by a class-name, but
4856 `S<T>' is dependent, and so not known to be a class.
4857 That's not right; we need to look in uninstantiated
4858 templates. A further complication arises from:
4860 template <typename T> void f(T t) {
4861 t.T::~T();
4862 }
4864 Here, it is not possible to look up `T' in the scope of `T'
4865 itself. We must look in both the current scope, and the
4866 scope of the containing complete expression.
4868 Yet another issue is:
4870 struct S {
4871 int S;
4872 ~S();
4873 };
4875 S::~S() {}
4877 The standard does not seem to say that the `S' in `~S'
4878 should refer to the type `S' and not the data member
4879 `S::S'. */
4881 /* DR 244 says that we look up the name after the "~" in the
4882 same scope as we looked up the qualifying name. That idea
4883 isn't fully worked out; it's more complicated than that. */
4888 /* Check for invalid scopes. */
4890 {
4894 }
4896 {
4900 scope);
4905 }
4908 /* If the name is of the form "X::~X" it's OK even if X is a
4909 typedef. */
4918 {
4921 }
4923 /* ~auto means the destructor of whatever the object is. */
4925 {
4928 "%<~auto%> only available with "
4932 }
4934 /* If there was an explicit qualification (S::~T), first look
4935 in the scope given by the qualification (i.e., S).
4937 Note: in the calls to cp_parser_class_name below we pass
4938 typename_type so that lookup finds the injected-class-name
4939 rather than the constructor. */
4943 {
4948 typename_type,
4951 declarator_p);
4954 }
4955 /* In "N::S::~S", look in "N" as well. */
4957 {
4962 type_decl
4966 typename_type,
4969 declarator_p);
4972 }
4973 /* In "p->S::~T", look in the scope given by "*p" as well. */
4975 {
4980 type_decl
4984 typename_type,
4987 declarator_p);
4990 }
4991 /* Look in the surrounding context. */
4993 {
4999 type_decl
5003 typename_type,
5006 declarator_p);
5009 {
5010 /* We couldn't find a type with this name, so just accept
5011 it and check for a match at instantiation time. */
5016 }
5017 }
5018 /* If an error occurred, assume that the name of the
5019 destructor is the same as the name of the qualifying
5020 class. That allows us to keep parsing after running
5021 into ill-formed destructor names. */
5027 /* Check that destructor name and scope match. */
5029 {
5036 }
5038 /* [class.dtor]
5040 A typedef-name that names a class shall not be used as the
5041 identifier in the declarator for a destructor declaration. */
5048 type_decl);
5051 }
5055 {
5056 tree id;
5058 /* This could be a template-id, so we try that first. */
5060 /* Try a template-id. */
5063 none_type,
5064 declarator_p);
5065 /* If that worked, we're done. */
5068 /* We still don't know whether we're looking at an
5069 operator-function-id or a conversion-function-id. */
5071 /* Try an operator-function-id. */
5073 /* If that didn't work, try a conversion-function-id. */
5077 {
5078 /* 17.6.3.3.5 */
5083 }
5086 }
5087 /* Fall through. */
5094 }
5095 }
5097 /* Parse an (optional) nested-name-specifier.
5099 nested-name-specifier: [C++98]
5100 class-or-namespace-name :: nested-name-specifier [opt]
5101 class-or-namespace-name :: template nested-name-specifier [opt]
5103 nested-name-specifier: [C++0x]
5104 type-name ::
5105 namespace-name ::
5106 nested-name-specifier identifier ::
5107 nested-name-specifier template [opt] simple-template-id ::
5109 PARSER->SCOPE should be set appropriately before this function is
5110 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5111 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5112 in name lookups.
5114 Sets PARSER->SCOPE to the class (TYPE) or namespace
5115 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5116 it unchanged if there is no nested-name-specifier. Returns the new
5117 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5119 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5120 part of a declaration and/or decl-specifier. */
5122 static tree
5128 {
5133 /* Remember where the nested-name-specifier starts. */
5135 {
5138 }
5141 {
5142 tree new_scope;
5143 tree old_scope;
5144 tree saved_qualifying_scope;
5147 /* Spot cases that cannot be the beginning of a
5148 nested-name-specifier. */
5151 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5152 the already parsed nested-name-specifier. */
5154 {
5155 /* Grab the nested-name-specifier and continue the loop. */
5157 /* If we originally encountered this nested-name-specifier
5158 with IS_DECLARATION set to false, we will not have
5159 resolved TYPENAME_TYPEs, so we must do so here. */
5162 {
5167 }
5170 }
5172 /* Spot cases that cannot be the beginning of a
5173 nested-name-specifier. On the second and subsequent times
5174 through the loop, we look for the `template' keyword. */
5176 ;
5177 /* A template-id can start a nested-name-specifier. */
5179 ;
5180 /* DR 743: decltype can be used in a nested-name-specifier. */
5182 ;
5183 else
5184 {
5185 /* If the next token is not an identifier, then it is
5186 definitely not a type-name or namespace-name. */
5189 /* If the following token is neither a `<' (to begin a
5190 template-id), nor a `::', then we are not looking at a
5191 nested-name-specifier. */
5197 {
5201 }
5204 && !cp_parser_nth_token_starts_template_argument_list_p
5207 }
5209 /* The nested-name-specifier is optional, so we parse
5210 tentatively. */
5213 /* Look for the optional `template' keyword, if this isn't the
5214 first time through the loop. */
5217 else
5220 /* Save the old scope since the name lookup we are about to do
5221 might destroy it. */
5224 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5225 look up names in "X<T>::I" in order to determine that "Y" is
5226 a template. So, if we have a typename at this point, we make
5227 an effort to look through it. */
5229 && !typename_keyword_p
5234 /* Parse the qualifying entity. */
5235 new_scope
5237 typename_keyword_p,
5238 template_keyword_p,
5239 check_dependency_p,
5240 type_p,
5241 is_declaration);
5242 /* Look for the `::' token. */
5245 /* If we found what we wanted, we keep going; otherwise, we're
5246 done. */
5248 {
5251 /* Restore the OLD_SCOPE since it was valid before the
5252 failed attempt at finding the last
5253 class-or-namespace-name. */
5257 /* If the next token is a decltype, and the one after that is a
5258 `::', then the decltype has failed to resolve to a class or
5259 enumeration type. Give this error even when parsing
5260 tentatively since it can't possibly be valid--and we're going
5261 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5262 won't get another chance.*/
5266 {
5273 /* As below. */
5276 }
5280 /* If the next token is an identifier, and the one after
5281 that is a `::', then any valid interpretation would have
5282 found a class-or-namespace-name. */
5288 {
5291 {
5293 {
5294 tree decl;
5295 tree ambiguous_decls;
5298 none_type,
5307 decl);
5309 {
5310 // cp_parser_lookup_name has the same diagnostic,
5311 // thus make sure to emit it at most once.
5314 {
5319 }
5321 }
5322 else
5323 {
5325 cp_parser_name_lookup_error
5328 else
5329 cp_parser_name_lookup_error
5332 }
5333 }
5336 /* Treat this as a successful nested-name-specifier
5337 due to:
5339 [basic.lookup.qual]
5341 If the name found is not a class-name (clause
5342 _class_) or namespace-name (_namespace.def_), the
5343 program is ill-formed. */
5345 }
5347 }
5349 }
5350 /* We've found one valid nested-name-specifier. */
5352 /* Name lookup always gives us a DECL. */
5355 /* Uses of "template" must be followed by actual templates. */
5367 new_scope);
5368 /* If it is a class scope, try to complete it; we are about to
5369 be looking up names inside the class. */
5371 /* Since checking types for dependency can be expensive,
5372 avoid doing it if the type is already complete. */
5374 /* Do not try to complete dependent types. */
5376 {
5378 /* If it is a typedef to current class, use the current
5379 class instead, as the typedef won't have any names inside
5380 it yet. */
5384 }
5385 /* Make sure we look in the right scope the next time through
5386 the loop. */
5388 }
5390 /* If parsing tentatively, replace the sequence of tokens that makes
5391 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5392 token. That way, should we re-parse the token stream, we will
5393 not have to repeat the effort required to do the parse, nor will
5394 we issue duplicate error messages. */
5396 {
5400 /* Reset the contents of the START token. */
5402 /* Retrieve any deferred checks. Do not pop this access checks yet
5403 so the memory will not be reclaimed during token replacing below. */
5411 /* Purge all subsequent tokens. */
5413 }
5419 }
5421 /* Parse a nested-name-specifier. See
5422 cp_parser_nested_name_specifier_opt for details. This function
5423 behaves identically, except that it will an issue an error if no
5424 nested-name-specifier is present. */
5426 static tree
5432 {
5433 tree scope;
5435 /* Look for the nested-name-specifier. */
5437 typename_keyword_p,
5438 check_dependency_p,
5439 type_p,
5440 is_declaration);
5441 /* If it was not present, issue an error message. */
5443 {
5446 }
5449 }
5451 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5452 this is either a class-name or a namespace-name (which corresponds
5453 to the class-or-namespace-name production in the grammar). For
5454 C++0x, it can also be a type-name that refers to an enumeration
5455 type or a simple-template-id.
5457 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5458 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5459 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5460 TYPE_P is TRUE iff the next name should be taken as a class-name,
5461 even the same name is declared to be another entity in the same
5462 scope.
5464 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5465 specified by the class-or-namespace-name. If neither is found the
5466 ERROR_MARK_NODE is returned. */
5468 static tree
5475 {
5476 tree saved_scope;
5477 tree saved_qualifying_scope;
5478 tree saved_object_scope;
5479 tree scope;
5483 /* DR 743: decltype can appear in a nested-name-specifier. */
5485 {
5489 {
5492 }
5496 }
5498 /* Before we try to parse the class-name, we must save away the
5499 current PARSER->SCOPE since cp_parser_class_name will destroy
5500 it. */
5504 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5505 there is no need to look for a namespace-name. */
5506 only_class_p = template_keyword_p
5511 typename_keyword_p,
5512 template_keyword_p,
5514 check_dependency_p,
5516 is_declaration);
5518 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5522 {
5523 /* Restore the saved scope. */
5528 /* Parse tentatively. */
5531 /* Parse a type-name */
5534 /* "If the name found does not designate a namespace or a class,
5535 enumeration, or dependent type, the program is ill-formed."
5537 We cover classes and dependent types above and namespaces below,
5538 so this code is only looking for enums. */
5544 }
5545 /* If that didn't work, try for a namespace-name. */
5547 {
5548 /* Restore the saved scope. */
5552 /* If we are not looking at an identifier followed by the scope
5553 resolution operator, then this is not part of a
5554 nested-name-specifier. (Note that this function is only used
5555 to parse the components of a nested-name-specifier.) */
5560 }
5563 }
5565 /* Parse a postfix-expression.
5567 postfix-expression:
5568 primary-expression
5569 postfix-expression [ expression ]
5570 postfix-expression ( expression-list [opt] )
5571 simple-type-specifier ( expression-list [opt] )
5572 typename :: [opt] nested-name-specifier identifier
5573 ( expression-list [opt] )
5574 typename :: [opt] nested-name-specifier template [opt] template-id
5575 ( expression-list [opt] )
5576 postfix-expression . template [opt] id-expression
5577 postfix-expression -> template [opt] id-expression
5578 postfix-expression . pseudo-destructor-name
5579 postfix-expression -> pseudo-destructor-name
5580 postfix-expression ++
5581 postfix-expression --
5582 dynamic_cast < type-id > ( expression )
5583 static_cast < type-id > ( expression )
5584 reinterpret_cast < type-id > ( expression )
5585 const_cast < type-id > ( expression )
5586 typeid ( expression )
5587 typeid ( type-id )
5589 GNU Extension:
5591 postfix-expression:
5592 ( type-id ) { initializer-list , [opt] }
5594 This extension is a GNU version of the C99 compound-literal
5595 construct. (The C99 grammar uses `type-name' instead of `type-id',
5596 but they are essentially the same concept.)
5598 If ADDRESS_P is true, the postfix expression is the operand of the
5599 `&' operator. CAST_P is true if this expression is the target of a
5600 cast.
5602 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5603 class member access expressions [expr.ref].
5605 Returns a representation of the expression. */
5607 static tree
5611 {
5613 location_t loc;
5619 /* Peek at the next token. */
5622 /* Some of the productions are determined by keywords. */
5625 {
5630 {
5631 tree type;
5632 tree expression;
5636 /* All of these can be handled in the same way from the point
5637 of view of parsing. Begin by consuming the token
5638 identifying the cast. */
5641 /* New types cannot be defined in the cast. */
5643 parser->type_definition_forbidden_message
5646 /* Look for the opening `<'. */
5648 /* Parse the type to which we are casting. */
5653 /* Look for the closing `>'. */
5655 /* Restore the old message. */
5658 bool saved_greater_than_is_operator_p
5662 /* And the expression which is being cast. */
5667 parser->greater_than_is_operator_p
5670 /* Only type conversions to integral or enumeration types
5671 can be used in constant-expressions. */
5677 {
5679 postfix_expression
5683 postfix_expression
5687 postfix_expression
5689 tf_warning_or_error);
5692 postfix_expression
5697 }
5698 }
5702 {
5703 tree type;
5707 /* Consume the `typeid' token. */
5709 /* Look for the `(' token. */
5711 /* Types cannot be defined in a `typeid' expression. */
5713 parser->type_definition_forbidden_message
5715 /* We can't be sure yet whether we're looking at a type-id or an
5716 expression. */
5718 /* Try a type-id first. */
5723 /* Look for the `)' token. Otherwise, we can't be sure that
5724 we're not looking at an expression: consider `typeid (int
5725 (3))', for example. */
5727 /* If all went well, simply lookup the type-id. */
5730 /* Otherwise, fall back to the expression variant. */
5731 else
5732 {
5733 tree expression;
5735 /* Look for an expression. */
5737 /* Compute its typeid. */
5739 /* Look for the `)' token. */
5741 }
5742 /* Restore the saved message. */
5744 /* `typeid' may not appear in an integral constant expression. */
5747 }
5751 {
5752 tree type;
5753 /* The syntax permitted here is the same permitted for an
5754 elaborated-type-specifier. */
5759 }
5763 {
5766 tree p;
5780 tf_warning_or_error);
5783 tf_warning_or_error);
5784 else
5785 {
5789 }
5791 }
5794 {
5795 tree type;
5797 /* If the next thing is a simple-type-specifier, we may be
5798 looking at a functional cast. We could also be looking at
5799 an id-expression. So, we try the functional cast, and if
5800 that doesn't work we fall back to the primary-expression. */
5802 /* Look for the simple-type-specifier. */
5805 CP_PARSER_FLAGS_NONE);
5806 /* Parse the cast itself. */
5808 postfix_expression
5810 /* If that worked, we're done. */
5814 /* If the functional-cast didn't work out, try a
5815 compound-literal. */
5818 {
5823 /* Consume the `('. */
5826 /* Avoid calling cp_parser_type_id pointlessly, see comment
5827 in cp_parser_cast_expression about c++/29234. */
5830 compound_literal_p
5835 /* Roll back the tokens we skipped. */
5840 else
5841 {
5842 /* Parse the type. */
5847 /* Look for the `)'. */
5849 }
5851 /* If things aren't going well, there's no need to
5852 keep going. */
5854 {
5856 /* Parse the brace-enclosed initializer list. */
5859 }
5860 /* If that worked, we're definitely looking at a
5861 compound-literal expression. */
5863 {
5864 /* Warn the user that a compound literal is not
5865 allowed in standard C++. */
5868 /* For simplicity, we disallow compound literals in
5869 constant-expressions. We could
5870 allow compound literals of integer type, whose
5871 initializer was a constant, in constant
5872 expressions. Permitting that usage, as a further
5873 extension, would not change the meaning of any
5874 currently accepted programs. (Of course, as
5875 compound literals are not part of ISO C++, the
5876 standard has nothing to say.) */
5878 NIC_NCC))
5879 {
5882 }
5883 /* Form the representation of the compound-literal. */
5884 postfix_expression
5886 tf_warning_or_error);
5888 }
5889 }
5891 /* It must be a primary-expression. */
5892 postfix_expression
5895 decltype_p,
5897 }
5899 }
5901 /* Note that we don't need to worry about calling build_cplus_new on a
5902 class-valued CALL_EXPR in decltype when it isn't the end of the
5903 postfix-expression; unary_complex_lvalue will take care of that for
5904 all these cases. */
5906 /* Keep looping until the postfix-expression is complete. */
5908 {
5912 /* It is not a Koenig lookup function call. */
5913 postfix_expression
5916 /* Peek at the next token. */
5920 {
5923 {
5925 "two consecutive %<[%> shall "
5928 }
5929 postfix_expression
5931 postfix_expression,
5933 decltype_p);
5939 /* postfix-expression ( expression-list [opt] ) */
5940 {
5950 is_builtin_constant_p
5953 {
5954 /* The whole point of __builtin_constant_p is to allow
5955 non-constant expressions to appear as arguments. */
5956 saved_integral_constant_expression_p
5958 saved_non_integral_constant_expression_p
5961 }
5962 args = (cp_parser_parenthesized_expression_list
5967 {
5968 parser->integral_constant_expression_p
5970 parser->non_integral_constant_expression_p
5972 }
5975 {
5978 }
5980 /* Function calls are not permitted in
5981 constant-expressions. */
5984 NIC_FUNC_CALL))
5985 {
5989 }
5994 {
5996 {
5998 {
6001 postfix_expression
6004 complain);
6005 }
6006 else
6007 postfix_expression
6009 }
6010 /* We do not perform argument-dependent lookup if
6011 normal lookup finds a non-function, in accordance
6012 with the expected resolution of DR 218. */
6015 {
6019 /* Do not do argument dependent lookup if regular
6020 lookup finds a member function or a block-scope
6021 function declaration. [basic.lookup.argdep]/3 */
6024 {
6027 postfix_expression
6030 complain);
6031 }
6032 }
6033 }
6036 {
6046 {
6047 postfix_expression
6051 }
6054 {
6055 postfix_expression
6056 = (build_new_method_call
6062 complain));
6063 }
6064 else
6065 postfix_expression
6069 complain);
6070 }
6074 postfix_expression = (build_offset_ref_call_from_tree
6076 complain));
6078 /* A call to a static class member, or a namespace-scope
6079 function. */
6080 postfix_expression
6083 koenig_p,
6084 complain);
6085 else
6086 /* All other function calls. */
6087 postfix_expression
6090 koenig_p,
6091 complain);
6093 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6097 }
6102 /* postfix-expression . template [opt] id-expression
6103 postfix-expression . pseudo-destructor-name
6104 postfix-expression -> template [opt] id-expression
6105 postfix-expression -> pseudo-destructor-name */
6107 /* Consume the `.' or `->' operator. */
6110 postfix_expression
6112 postfix_expression,
6119 /* postfix-expression ++ */
6120 /* Consume the `++' token. */
6122 /* Generate a representation for the complete expression. */
6123 postfix_expression
6125 POSTINCREMENT_EXPR);
6126 /* Increments may not appear in constant-expressions. */
6134 /* postfix-expression -- */
6135 /* Consume the `--' token. */
6137 /* Generate a representation for the complete expression. */
6138 postfix_expression
6140 POSTDECREMENT_EXPR);
6141 /* Decrements may not appear in constant-expressions. */
6153 else
6155 }
6156 }
6158 /* We should never get here. */
6161 }
6163 /* This function parses Cilk Plus array notations. If a normal array expr. is
6164 parsed then the array index is passed back to the caller through *INIT_INDEX
6165 and the function returns a NULL_TREE. If array notation expr. is parsed,
6166 then *INIT_INDEX is ignored by the caller and the function returns
6167 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6168 error_mark_node. */
6170 static tree
6172 tree array_value)
6173 {
6177 {
6180 }
6189 {
6192 }
6194 {
6195 /* Consume the ':'. */
6198 /* If we are here, then we have a case like this A[:]. */
6200 {
6204 }
6208 }
6209 else
6210 {
6211 /* If we are here, then there are three valid possibilities:
6212 1. ARRAY [ EXP ]
6213 2. ARRAY [ EXP : EXP ]
6214 3. ARRAY [ EXP : EXP : EXP ] */
6218 {
6219 /* This indicates that we have a normal array expression. */
6222 }
6224 /* Consume the ':'. */
6228 {
6231 }
6232 }
6237 {
6241 }
6247 }
6249 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6250 by cp_parser_builtin_offsetof. We're looking for
6252 postfix-expression [ expression ]
6253 postfix-expression [ braced-init-list ] (C++11)
6255 FOR_OFFSETOF is set if we're being called in that context, which
6256 changes how we deal with integer constant expressions. */
6258 static tree
6260 tree postfix_expression,
6263 {
6268 /* Consume the `[' token. */
6274 /* Parse the index expression. */
6275 /* ??? For offsetof, there is a question of what to allow here. If
6276 offsetof is not being used in an integral constant expression context,
6277 then we *could* get the right answer by computing the value at runtime.
6278 If we are in an integral constant expression context, then we might
6279 could accept any constant expression; hard to say without analysis.
6280 Rather than open the barn door too wide right away, allow only integer
6281 constant expressions here. */
6284 else
6285 {
6287 {
6293 {
6295 "braced list index is not allowed with array "
6299 }
6300 }
6302 {
6303 /* Here are have these two options:
6304 ARRAY[EXP : EXP] - Array notation expr with default
6305 stride of 1.
6306 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6307 stride. */
6309 postfix_expression);
6312 }
6313 else
6315 }
6319 /* Look for the closing `]'. */
6322 /* Build the ARRAY_REF. */
6326 /* When not doing offsetof, array references are not permitted in
6327 constant-expressions. */
6333 }
6335 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6336 by cp_parser_builtin_offsetof. We're looking for
6338 postfix-expression . template [opt] id-expression
6339 postfix-expression . pseudo-destructor-name
6340 postfix-expression -> template [opt] id-expression
6341 postfix-expression -> pseudo-destructor-name
6343 FOR_OFFSETOF is set if we're being called in that context. That sorta
6344 limits what of the above we'll actually accept, but nevermind.
6345 TOKEN_TYPE is the "." or "->" token, which will already have been
6346 removed from the stream. */
6348 static tree
6351 tree postfix_expression,
6353 location_t location)
6354 {
6355 tree name;
6360 /* If this is a `->' operator, dereference the pointer. */
6363 tf_warning_or_error);
6364 /* Check to see whether or not the expression is type-dependent. */
6366 /* The identifier following the `->' or `.' is not qualified. */
6372 /* Enter the scope corresponding to the type of the object
6373 given by the POSTFIX_EXPRESSION. */
6375 {
6377 /* According to the standard, no expression should ever have
6378 reference type. Unfortunately, we do not currently match
6379 the standard in this respect in that our internal representation
6380 of an expression may have reference type even when the standard
6381 says it does not. Therefore, we have to manually obtain the
6382 underlying type here. */
6384 /* The type of the POSTFIX_EXPRESSION must be complete. */
6386 {
6388 postfix_expression);
6390 }
6391 /* Unlike the object expression in other contexts, *this is not
6392 required to be of complete type for purposes of class member
6393 access (5.2.5) outside the member function body. */
6397 /* Let the name lookup machinery know that we are processing a
6398 class member access expression. */
6400 /* If something went wrong, we want to be able to discern that case,
6401 as opposed to the case where there was no SCOPE due to the type
6402 of expression being dependent. */
6405 /* If the SCOPE was erroneous, make the various semantic analysis
6406 functions exit quickly -- and without issuing additional error
6407 messages. */
6410 }
6412 /* Assume this expression is not a pseudo-destructor access. */
6415 /* If the SCOPE is a scalar type, then, if this is a valid program,
6416 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6417 is type dependent, it can be pseudo-destructor-name or something else.
6418 Try to parse it as pseudo-destructor-name first. */
6420 {
6421 tree s;
6422 tree type;
6425 /* Parse the pseudo-destructor-name. */
6434 {
6436 postfix_expression
6439 }
6440 }
6443 {
6444 /* If the SCOPE is not a scalar type, we are looking at an
6445 ordinary class member access expression, rather than a
6446 pseudo-destructor-name. */
6449 /* Parse the id-expression. */
6450 name = (cp_parser_id_expression
6457 /* In general, build a SCOPE_REF if the member name is qualified.
6458 However, if the name was not dependent and has already been
6459 resolved; there is no need to build the SCOPE_REF. For example;
6461 struct X { void f(); };
6462 template <typename T> void f(T* t) { t->X::f(); }
6464 Even though "t" is dependent, "X::f" is not and has been resolved
6465 to a BASELINK; there is no need to include scope information. */
6467 /* But we do need to remember that there was an explicit scope for
6468 virtual function calls. */
6472 /* If the name is a template-id that names a type, we will get a
6473 TYPE_DECL here. That is invalid code. */
6475 {
6478 }
6479 else
6480 {
6482 {
6484 {
6488 }
6489 else
6492 name,
6493 template_p);
6497 }
6499 adjust_result_of_qualified_name_lookup
6501 postfix_expression
6503 template_p,
6504 tf_warning_or_error);
6505 }
6506 }
6508 /* We no longer need to look up names in the scope of the object on
6509 the left-hand side of the `.' or `->' operator. */
6512 /* Outside of offsetof, these operators may not appear in
6513 constant-expressions. */
6515 && (cp_parser_non_integral_constant_expression
6520 }
6522 /* Parse a parenthesized expression-list.
6524 expression-list:
6525 assignment-expression
6526 expression-list, assignment-expression
6528 attribute-list:
6529 expression-list
6530 identifier
6531 identifier, expression-list
6533 CAST_P is true if this expression is the target of a cast.
6535 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6536 argument pack.
6538 Returns a vector of trees. Each element is a representation of an
6539 assignment-expression. NULL is returned if the ( and or ) are
6540 missing. An empty, but allocated, vector is returned on no
6541 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6542 if we are parsing an attribute list for an attribute that wants a
6543 plain identifier argument, normal_attr for an attribute that wants
6544 an expression, or non_attr if we aren't parsing an attribute list. If
6545 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6546 not all of the expressions in the list were constant. */
6554 {
6560 /* Assume all the expressions will be constant. */
6569 /* Within a parenthesized expression, a `>' token is always
6570 the greater-than operator. */
6571 saved_greater_than_is_operator_p
6575 /* Consume expressions until there are no more. */
6578 {
6579 tree expr;
6581 /* At the beginning of attribute lists, check to see if the
6582 next token is an identifier. */
6585 {
6588 /* Consume the identifier. */
6590 /* Save the identifier. */
6592 }
6593 else
6594 {
6597 /* Parse the next assignment-expression. */
6599 {
6600 /* A braced-init-list. */
6605 }
6607 {
6608 expr = (cp_parser_constant_expression
6613 }
6614 else
6620 /* If we have an ellipsis, then this is an expression
6621 expansion. */
6624 {
6625 /* Consume the `...'. */
6628 /* Build the argument pack. */
6630 }
6632 /* Add it to the list. We add error_mark_node
6633 expressions to the list, so that we can still tell if
6634 the correct form for a parenthesized expression-list
6635 is found. That gives better errors. */
6640 }
6642 /* After the first item, attribute lists look the same as
6643 expression lists. */
6646 get_comma:;
6647 /* If the next token isn't a `,', then we are done. */
6651 /* Otherwise, consume the `,' and keep going. */
6653 }
6656 {
6659 skip_comma:;
6660 /* We try and resync to an unnested comma, as that will give the
6661 user better diagnostics. */
6669 {
6670 parser->greater_than_is_operator_p
6673 }
6674 }
6676 parser->greater_than_is_operator_p
6683 }
6685 /* Parse a pseudo-destructor-name.
6687 pseudo-destructor-name:
6688 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6689 :: [opt] nested-name-specifier template template-id :: ~ type-name
6690 :: [opt] nested-name-specifier [opt] ~ type-name
6692 If either of the first two productions is used, sets *SCOPE to the
6693 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6694 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6695 or ERROR_MARK_NODE if the parse fails. */
6697 static void
6699 tree object,
6702 {
6705 /* Handle ~auto. */
6709 {
6712 "%<~auto%> only available with "
6719 }
6721 /* Assume that things will not work out. */
6724 /* Look for the optional `::' operator. */
6726 /* Look for the optional nested-name-specifier. */
6727 nested_name_specifier_p
6734 /* Now, if we saw a nested-name-specifier, we might be doing the
6735 second production. */
6738 {
6739 /* Consume the `template' keyword. */
6741 /* Parse the template-id. */
6745 class_type,
6747 /* Look for the `::' token. */
6749 }
6750 /* If the next token is not a `~', then there might be some
6751 additional qualification. */
6753 {
6754 /* At this point, we're looking for "type-name :: ~". The type-name
6755 must not be a class-name, since this is a pseudo-destructor. So,
6756 it must be either an enum-name, or a typedef-name -- both of which
6757 are just identifiers. So, we peek ahead to check that the "::"
6758 and "~" tokens are present; if they are not, then we can avoid
6759 calling type_name. */
6763 {
6766 }
6768 /* Look for the type-name. */
6773 /* Look for the `::' token. */
6775 }
6776 else
6779 /* Look for the `~'. */
6782 /* Once we see the ~, this has to be a pseudo-destructor. */
6786 /* Look for the type-name again. We are not responsible for
6787 checking that it matches the first type-name. */
6789 }
6791 /* Parse a unary-expression.
6793 unary-expression:
6794 postfix-expression
6795 ++ cast-expression
6796 -- cast-expression
6797 unary-operator cast-expression
6798 sizeof unary-expression
6799 sizeof ( type-id )
6800 alignof ( type-id ) [C++0x]
6801 new-expression
6802 delete-expression
6804 GNU Extensions:
6806 unary-expression:
6807 __extension__ cast-expression
6808 __alignof__ unary-expression
6809 __alignof__ ( type-id )
6810 alignof unary-expression [C++0x]
6811 __real__ cast-expression
6812 __imag__ cast-expression
6813 && identifier
6814 sizeof ( type-id ) { initializer-list , [opt] }
6815 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
6816 __alignof__ ( type-id ) { initializer-list , [opt] }
6818 ADDRESS_P is true iff the unary-expression is appearing as the
6819 operand of the `&' operator. CAST_P is true if this expression is
6820 the target of a cast.
6822 Returns a representation of the expression. */
6824 static tree
6827 {
6831 /* Peek at the next token. */
6833 /* Some keywords give away the kind of expression. */
6835 {
6839 {
6842 {
6845 location_t first_loc;
6848 /* Consume the token. */
6851 /* Parse the operand. */
6856 else
6857 {
6858 /* ISO C++ defines alignof only with types, not with
6859 expressions. So pedwarn if alignof is used with a non-
6860 type expression. However, __alignof__ is ok. */
6863 "ISO C++ does not allow %<alignof%> "
6867 }
6868 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6869 SIZEOF_EXPR with the original operand. */
6871 {
6873 {
6875 {
6878 error_mark_node));
6880 }
6881 else
6885 }
6887 }
6889 }
6898 {
6899 /* The saved value of the PEDANTIC flag. */
6901 tree expr;
6903 /* Save away the PEDANTIC flag. */
6905 /* Parse the cast-expression. */
6907 /* Restore the PEDANTIC flag. */
6911 }
6915 {
6916 tree expression;
6918 /* Consume the `__real__' or `__imag__' token. */
6920 /* Parse the cast-expression. */
6922 /* Create the complete representation. */
6926 expression,
6927 tf_warning_or_error);
6928 }
6936 {
6937 tree expr;
6947 parser->type_definition_forbidden_message
6950 saved_integral_constant_expression_p
6952 saved_non_integral_constant_expression_p
6956 saved_greater_than_is_operator_p
6966 parser->greater_than_is_operator_p
6969 parser->integral_constant_expression_p
6971 parser->non_integral_constant_expression_p
6978 }
6982 }
6983 }
6985 /* Look for the `:: new' and `:: delete', which also signal the
6986 beginning of a new-expression, or delete-expression,
6987 respectively. If the next token is `::', then it might be one of
6988 these. */
6990 {
6993 /* See if the token after the `::' is one of the keywords in
6994 which we're interested. */
6996 /* If it's `new', we have a new-expression. */
6999 /* Similarly, for `delete'. */
7002 }
7004 /* Look for a unary operator. */
7006 /* The `++' and `--' operators can be handled similarly, even though
7007 they are not technically unary-operators in the grammar. */
7009 {
7014 /* Handle the GNU address-of-label extension. */
7017 {
7018 tree identifier;
7019 tree expression;
7022 /* Consume the '&&' token. */
7024 /* Look for the identifier. */
7026 /* Create an expression representing the address. */
7029 NIC_ADDR_LABEL))
7032 }
7033 }
7035 {
7036 tree cast_expression;
7042 /* Consume the operator token. */
7044 /* Parse the cast-expression. */
7045 cast_expression
7050 pidk);
7051 /* Now, build an appropriate representation. */
7053 {
7057 RO_UNARY_STAR,
7058 complain);
7063 /* Fall through. */
7066 cast_expression,
7067 complain);
7074 /* Fall through. */
7084 }
7088 non_constant_p))
7092 }
7096 decltype_p,
7097 pidk);
7098 }
7103 {
7106 }
7108 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7109 unary-operator, the corresponding tree code is returned. */
7111 static enum tree_code
7113 {
7115 {
7136 }
7137 }
7139 /* Parse a new-expression.
7141 new-expression:
7142 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7143 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7145 Returns a representation of the expression. */
7147 static tree
7149 {
7152 tree type;
7155 tree ret;
7157 /* Look for the optional `::' operator. */
7158 global_scope_p
7162 /* Look for the `new' operator. */
7164 /* There's no easy way to tell a new-placement from the
7165 `( type-id )' construct. */
7167 /* Look for a new-placement. */
7169 /* If that didn't work out, there's no new-placement. */
7171 {
7175 }
7177 /* If the next token is a `(', then we have a parenthesized
7178 type-id. */
7180 {
7184 /* Consume the `('. */
7187 /* Parse the type-id. */
7188 parser->type_definition_forbidden_message
7193 /* Look for the closing `)'. */
7196 /* There should not be a direct-new-declarator in this production,
7197 but GCC used to allowed this, so we check and emit a sensible error
7198 message for this case. */
7200 {
7206 }
7207 }
7208 /* Otherwise, there must be a new-type-id. */
7209 else
7212 /* If the next token is a `(' or '{', then we have a new-initializer. */
7216 else
7219 /* A new-expression may not appear in an integral constant
7220 expression. */
7223 else
7224 {
7225 /* Create a representation of the new-expression. */
7227 tf_warning_or_error);
7228 }
7236 }
7238 /* Parse a new-placement.
7240 new-placement:
7241 ( expression-list )
7243 Returns the same representation as for an expression-list. */
7247 {
7250 /* Parse the expression-list. */
7251 expression_list = (cp_parser_parenthesized_expression_list
7257 }
7259 /* Parse a new-type-id.
7261 new-type-id:
7262 type-specifier-seq new-declarator [opt]
7264 Returns the TYPE allocated. If the new-type-id indicates an array
7265 type, *NELTS is set to the number of elements in the last array
7266 bound; the TYPE will not include the last array bound. */
7268 static tree
7270 {
7271 cp_decl_specifier_seq type_specifier_seq;
7277 /* The type-specifier sequence must not contain type definitions.
7278 (It cannot contain declarations of new types either, but if they
7279 are not definitions we will catch that because they are not
7280 complete.) */
7282 parser->type_definition_forbidden_message
7284 /* Parse the type-specifier-seq. */
7288 /* Restore the old message. */
7294 /* Parse the new-declarator. */
7297 /* Determine the number of elements in the last array dimension, if
7298 any. */
7300 /* Skip down to the last array dimension. */
7305 {
7308 }
7313 {
7316 }
7319 {
7326 else
7328 }
7331 }
7333 /* Parse an (optional) new-declarator.
7335 new-declarator:
7336 ptr-operator new-declarator [opt]
7337 direct-new-declarator
7339 Returns the declarator. */
7343 {
7346 cp_cv_quals cv_quals;
7348 /* We don't know if there's a ptr-operator next, or not. */
7350 /* Look for a ptr-operator. */
7352 /* If that worked, look for more new-declarators. */
7354 {
7357 /* Parse another optional declarator. */
7360 declarator = cp_parser_make_indirect_declarator
7364 }
7366 /* If the next token is a `[', there is a direct-new-declarator. */
7371 }
7373 /* Parse a direct-new-declarator.
7375 direct-new-declarator:
7376 [ expression ]
7377 direct-new-declarator [constant-expression]
7379 */
7383 {
7387 {
7388 tree expression;
7391 /* Look for the opening `['. */
7396 /* The standard requires that the expression have integral
7397 type. DR 74 adds enumeration types. We believe that the
7398 real intent is that these expressions be handled like the
7399 expression in a `switch' condition, which also allows
7400 classes with a single conversion to integral or
7401 enumeration type. */
7403 {
7404 expression
7406 expression,
7409 {
7411 "expression in new-declarator must have integral "
7414 }
7415 }
7417 /* Look for the closing `]'. */
7420 /* Add this bound to the declarator. */
7423 /* If the next token is not a `[', then there are no more
7424 bounds. */
7427 }
7430 }
7432 /* Parse a new-initializer.
7434 new-initializer:
7435 ( expression-list [opt] )
7436 braced-init-list
7438 Returns a representation of the expression-list. */
7442 {
7446 {
7447 tree t;
7453 }
7454 else
7455 expression_list = (cp_parser_parenthesized_expression_list
7461 }
7463 /* Parse a delete-expression.
7465 delete-expression:
7466 :: [opt] delete cast-expression
7467 :: [opt] delete [ ] cast-expression
7469 Returns a representation of the expression. */
7471 static tree
7473 {
7476 tree expression;
7478 /* Look for the optional `::' operator. */
7479 global_scope_p
7483 /* Look for the `delete' keyword. */
7485 /* See if the array syntax is in use. */
7487 {
7488 /* Consume the `[' token. */
7490 /* Look for the `]' token. */
7492 /* Remember that this is the `[]' construct. */
7494 }
7495 else
7498 /* Parse the cast-expression. */
7501 /* A delete-expression may not appear in an integral constant
7502 expression. */
7507 tf_warning_or_error);
7508 }
7510 /* Returns true if TOKEN may start a cast-expression and false
7511 otherwise. */
7513 static bool
7515 {
7518 {
7559 /* In ((type ()) () the last () isn't a valid cast-expression,
7560 so the whole must be parsed as postfix-expression. */
7564 /* '[' may start a primary-expression in obj-c++. */
7570 }
7571 }
7573 /* Parse a cast-expression.
7575 cast-expression:
7576 unary-expression
7577 ( type-id ) cast-expression
7579 ADDRESS_P is true iff the unary-expression is appearing as the
7580 operand of the `&' operator. CAST_P is true if this expression is
7581 the target of a cast.
7583 Returns a representation of the expression. */
7585 static tree
7588 {
7589 /* If it's a `(', then we might be looking at a cast. */
7591 {
7597 /* There's no way to know yet whether or not this is a cast.
7598 For example, `(int (3))' is a unary-expression, while `(int)
7599 3' is a cast. So, we resort to parsing tentatively. */
7601 /* Types may not be defined in a cast. */
7603 parser->type_definition_forbidden_message
7605 /* Consume the `('. */
7607 /* A very tricky bit is that `(struct S) { 3 }' is a
7608 compound-literal (which we permit in C++ as an extension).
7609 But, that construct is not a cast-expression -- it is a
7610 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7611 is legal; if the compound-literal were a cast-expression,
7612 you'd need an extra set of parentheses.) But, if we parse
7613 the type-id, and it happens to be a class-specifier, then we
7614 will commit to the parse at that point, because we cannot
7615 undo the action that is done when creating a new class. So,
7616 then we cannot back up and do a postfix-expression.
7617 Another tricky case is the following (c++/29234):
7619 struct S { void operator () (); };
7621 void foo ()
7622 {
7623 ( S()() );
7624 }
7626 As a type-id we parse the parenthesized S()() as a function
7627 returning a function, groktypename complains and we cannot
7628 back up in this case either.
7630 Therefore, we scan ahead to the closing `)', and check to see
7631 if the tokens after the `)' can start a cast-expression. Otherwise
7632 we are dealing with an unary-expression, a postfix-expression
7633 or something else.
7635 Save tokens so that we can put them back. */
7638 /* We may be looking at a cast-expression. */
7639 cast_expression_p
7644 /* Roll back the tokens we skipped. */
7646 /* If we aren't looking at a cast-expression, simulate an error so
7647 that the call to cp_parser_parse_definitely below will fail. */
7650 else
7651 {
7654 /* Look for the type-id. */
7656 /* Look for the closing `)'. */
7659 }
7661 /* Restore the saved message. */
7664 /* At this point this can only be either a cast or a
7665 parenthesized ctor such as `(T ())' that looks like a cast to
7666 function returning T. */
7668 {
7674 pidk);
7676 /* Warn about old-style casts, if so requested. */
7678 && !in_system_header
7683 /* Only type conversions to integral or enumeration types
7684 can be used in constant-expressions. */
7687 NIC_CAST))
7690 /* Perform the cast. */
7693 }
7694 else
7696 }
7698 /* If we get here, then it's not a cast, so it must be a
7699 unary-expression. */
7702 }
7704 /* Parse a binary expression of the general form:
7706 pm-expression:
7707 cast-expression
7708 pm-expression .* cast-expression
7709 pm-expression ->* cast-expression
7711 multiplicative-expression:
7712 pm-expression
7713 multiplicative-expression * pm-expression
7714 multiplicative-expression / pm-expression
7715 multiplicative-expression % pm-expression
7717 additive-expression:
7718 multiplicative-expression
7719 additive-expression + multiplicative-expression
7720 additive-expression - multiplicative-expression
7722 shift-expression:
7723 additive-expression
7724 shift-expression << additive-expression
7725 shift-expression >> additive-expression
7727 relational-expression:
7728 shift-expression
7729 relational-expression < shift-expression
7730 relational-expression > shift-expression
7731 relational-expression <= shift-expression
7732 relational-expression >= shift-expression
7734 GNU Extension:
7736 relational-expression:
7737 relational-expression <? shift-expression
7738 relational-expression >? shift-expression
7740 equality-expression:
7741 relational-expression
7742 equality-expression == relational-expression
7743 equality-expression != relational-expression
7745 and-expression:
7746 equality-expression
7747 and-expression & equality-expression
7749 exclusive-or-expression:
7750 and-expression
7751 exclusive-or-expression ^ and-expression
7753 inclusive-or-expression:
7754 exclusive-or-expression
7755 inclusive-or-expression | exclusive-or-expression
7757 logical-and-expression:
7758 inclusive-or-expression
7759 logical-and-expression && inclusive-or-expression
7761 logical-or-expression:
7762 logical-and-expression
7763 logical-or-expression || logical-and-expression
7765 All these are implemented with a single function like:
7767 binary-expression:
7768 simple-cast-expression
7769 binary-expression <token> binary-expression
7771 CAST_P is true if this expression is the target of a cast.
7773 The binops_by_token map is used to get the tree codes for each <token> type.
7774 binary-expressions are associated according to a precedence table. */
7776 #define TOKEN_PRECEDENCE(token) \
7777 (((token->type == CPP_GREATER \
7778 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7779 && !parser->greater_than_is_operator_p) \
7780 ? PREC_NOT_OPERATOR \
7781 : binops_by_token[token->type].prec)
7783 static tree
7789 {
7790 cp_parser_expression_stack stack;
7792 cp_parser_expression_stack_entry current;
7793 tree rhs;
7797 tree overload;
7799 /* Parse the first expression. */
7809 {
7810 /* Get an operator token. */
7816 {
7818 "%<>>%> operator is treated"
7822 }
7826 /* Popping an entry off the stack means we completed a subexpression:
7827 - either we found a token which is not an operator (`>' where it is not
7828 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7829 will happen repeatedly;
7830 - or, we found an operator which has lower priority. This is the case
7831 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7832 parsing `3 * 4'. */
7834 {
7837 else
7839 }
7841 get_rhs:
7845 /* We used the operator token. */
7848 /* For "false && x" or "true || x", x will never be executed;
7849 disable warnings while evaluating it. */
7855 /* Extract another operand. It may be the RHS of this expression
7856 or the LHS of a new, higher priority expression. */
7860 /* Get another operator token. Look up its precedence to avoid
7861 building a useless (immediately popped) stack entry for common
7862 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7866 {
7867 /* ... and prepare to parse the RHS of the new, higher priority
7868 expression. Since precedence levels on the stack are
7869 monotonically increasing, we do not have to care about
7870 stack overflows. */
7879 pop:
7881 /* If the stack is not empty, we have parsed into LHS the right side
7882 (`4' in the example above) of an expression we had suspended.
7883 We can use the information on the stack to recover the LHS (`3')
7884 from the stack together with the tree code (`MULT_EXPR'), and
7885 the precedence of the higher level subexpression
7886 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7887 which will be used to actually build the additive expression. */
7892 }
7894 /* Undo the disabling of warnings done above. */
7901 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7902 ERROR_MARK for everything that is not a binary expression.
7903 This makes warn_about_parentheses miss some warnings that
7904 involve unary operators. For unary expressions we should
7905 pass the correct tree_code unless the unary expression was
7906 surrounded by parentheses.
7907 */
7913 == tcc_comparison
7916 else
7925 /* If the binary operator required the use of an overloaded operator,
7926 then this expression cannot be an integral constant-expression.
7927 An overloaded operator can be used even if both operands are
7928 otherwise permissible in an integral constant-expression if at
7929 least one of the operands is of enumeration type. */
7933 NIC_OVERLOADED))
7935 }
7938 }
7940 static tree
7945 {
7948 }
7950 /* Parse the `? expression : assignment-expression' part of a
7951 conditional-expression. The LOGICAL_OR_EXPR is the
7952 logical-or-expression that started the conditional-expression.
7953 Returns a representation of the entire conditional-expression.
7955 This routine is used by cp_parser_assignment_expression.
7957 ? expression : assignment-expression
7959 GNU Extensions:
7961 ? : assignment-expression */
7963 static tree
7965 {
7966 tree expr;
7967 tree assignment_expr;
7971 /* Consume the `?' token. */
7976 {
7979 /* Implicit true clause. */
7983 }
7984 else
7985 {
7988 /* Parse the expression. */
7991 c_inhibit_evaluation_warnings +=
7995 }
7997 /* The next token should be a `:'. */
7999 /* Parse the assignment-expression. */
8003 /* Build the conditional-expression. */
8005 expr,
8006 assignment_expr,
8007 tf_warning_or_error);
8008 }
8010 /* Parse an assignment-expression.
8012 assignment-expression:
8013 conditional-expression
8014 logical-or-expression assignment-operator assignment_expression
8015 throw-expression
8017 CAST_P is true if this expression is the target of a cast.
8018 DECLTYPE_P is true if this expression is the operand of decltype.
8020 Returns a representation for the expression. */
8022 static tree
8025 {
8026 tree expr;
8028 /* If the next token is the `throw' keyword, then we're looking at
8029 a throw-expression. */
8032 /* Otherwise, it must be that we are looking at a
8033 logical-or-expression. */
8034 else
8035 {
8036 /* Parse the binary expressions (logical-or-expression). */
8038 decltype_p,
8040 /* If the next token is a `?' then we're actually looking at a
8041 conditional-expression. */
8044 else
8045 {
8048 /* If it's an assignment-operator, we're using the second
8049 production. */
8050 enum tree_code assignment_operator
8053 {
8055 location_t saved_input_location;
8057 /* Parse the right-hand side of the assignment. */
8063 /* An assignment may not appear in a
8064 constant-expression. */
8066 NIC_ASSIGNMENT))
8068 /* Build the assignment expression. Its default
8069 location is the location of the '=' token. */
8073 assignment_operator,
8074 rhs,
8077 }
8078 }
8079 }
8082 }
8084 static tree
8087 {
8090 }
8092 /* Parse an (optional) assignment-operator.
8094 assignment-operator: one of
8095 = *= /= %= += -= >>= <<= &= ^= |=
8097 GNU Extension:
8099 assignment-operator: one of
8100 <?= >?=
8102 If the next token is an assignment operator, the corresponding tree
8103 code is returned, and the token is consumed. For example, for
8104 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8105 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8106 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8107 operator, ERROR_MARK is returned. */
8109 static enum tree_code
8111 {
8115 /* Peek at the next token. */
8119 {
8165 /* Nothing else is an assignment operator. */
8167 }
8169 /* If it was an assignment operator, consume it. */
8174 }
8176 /* Parse an expression.
8178 expression:
8179 assignment-expression
8180 expression , assignment-expression
8182 CAST_P is true if this expression is the target of a cast.
8183 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8184 except possibly parenthesized or on the RHS of a comma (N3276).
8186 Returns a representation of the expression. */
8188 static tree
8191 {
8196 {
8197 tree assignment_expression;
8199 /* Parse the next assignment-expression. */
8200 assignment_expression
8203 /* We don't create a temporary for a call that is the immediate operand
8204 of decltype or on the RHS of a comma. But when we see a comma, we
8205 need to create a temporary for a call on the LHS. */
8210 assignment_expression
8214 /* If this is the first assignment-expression, we can just
8215 save it away. */
8218 else
8220 assignment_expression,
8222 /* If the next token is not a comma, then we are done with the
8223 expression. */
8226 /* Consume the `,'. */
8229 /* A comma operator cannot appear in a constant-expression. */
8232 }
8235 }
8239 {
8241 }
8243 /* Parse a constant-expression.
8245 constant-expression:
8246 conditional-expression
8248 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8249 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8250 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8251 is false, NON_CONSTANT_P should be NULL. */
8253 static tree
8257 {
8261 tree expression;
8263 /* It might seem that we could simply parse the
8264 conditional-expression, and then check to see if it were
8265 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8266 one that the compiler can figure out is constant, possibly after
8267 doing some simplifications or optimizations. The standard has a
8268 precise definition of constant-expression, and we must honor
8269 that, even though it is somewhat more restrictive.
8271 For example:
8273 int i[(2, 3)];
8275 is not a legal declaration, because `(2, 3)' is not a
8276 constant-expression. The `,' operator is forbidden in a
8277 constant-expression. However, GCC's constant-folding machinery
8278 will fold this operation to an INTEGER_CST for `3'. */
8280 /* Save the old settings. */
8282 saved_allow_non_integral_constant_expression_p
8285 /* We are now parsing a constant-expression. */
8287 parser->allow_non_integral_constant_expression_p
8290 /* Although the grammar says "conditional-expression", we parse an
8291 "assignment-expression", which also permits "throw-expression"
8292 and the use of assignment operators. In the case that
8293 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8294 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8295 actually essential that we look for an assignment-expression.
8296 For example, cp_parser_initializer_clauses uses this function to
8297 determine whether a particular assignment-expression is in fact
8298 constant. */
8300 /* Restore the old settings. */
8301 parser->integral_constant_expression_p
8303 parser->allow_non_integral_constant_expression_p
8306 {
8307 /* Require an rvalue constant expression here; that's what our
8308 callers expect. Reference constant expressions are handled
8309 separately in e.g. cp_parser_template_argument. */
8314 }
8317 parser->non_integral_constant_expression_p
8321 }
8323 /* Parse __builtin_offsetof.
8325 offsetof-expression:
8326 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8328 offsetof-member-designator:
8329 id-expression
8330 | offsetof-member-designator "." id-expression
8331 | offsetof-member-designator "[" expression "]"
8332 | offsetof-member-designator "->" id-expression */
8334 static tree
8336 {
8339 cp_id_kind dummy;
8342 /* We're about to accept non-integral-constant things, but will
8343 definitely yield an integral constant expression. Save and
8344 restore these values around our local parsing. */
8348 /* Consume the "__builtin_offsetof" token. */
8350 /* Consume the opening `('. */
8352 /* Parse the type-id. */
8354 /* Look for the `,'. */
8358 /* Build the (type *)null that begins the traditional offsetof macro. */
8360 tf_warning_or_error);
8362 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8366 {
8369 {
8371 /* offsetof-member-designator "[" expression "]" */
8377 /* offsetof-member-designator "->" identifier */
8380 /* FALLTHRU */
8383 /* offsetof-member-designator "." identifier */
8391 /* Consume the ")" token. */
8396 /* Error. We know the following require will fail, but
8397 that gives the proper error message. */
8402 }
8403 }
8405 success:
8406 /* If we're processing a template, we can't finish the semantics yet.
8407 Otherwise we can fold the entire expression now. */
8410 else
8413 failure:
8418 }
8420 /* Parse a trait expression.
8422 Returns a representation of the expression, the underlying type
8423 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8425 static tree
8427 {
8428 cp_trait_kind kind;
8431 cp_decl_specifier_seq decl_specs;
8434 {
8511 }
8513 /* Consume the token. */
8523 /* Build a trivial decl-specifier-seq. */
8527 /* Call grokdeclarator to figure out what type this is. */
8532 {
8540 /* Build a trivial decl-specifier-seq. */
8544 /* Call grokdeclarator to figure out what type this is. */
8547 }
8551 /* Complete the trait expression, which may mean either processing
8552 the trait expr now or saving it for template instantiation. */
8554 {
8563 }
8564 }
8566 /* Lambdas that appear in variable initializer or default argument scope
8567 get that in their mangling, so we need to record it. We might as well
8568 use the count for function and namespace scopes as well. */
8572 {
8573 tree t;
8578 static void
8580 {
8581 tree_int ti;
8583 /* Once we're inside a function, we ignore other scopes and just push
8584 the function again so that popping works properly. */
8591 {
8592 /* Don't reset the count if we're still in the same function. */
8595 }
8596 }
8598 static void
8600 {
8603 }
8605 static void
8607 {
8610 {
8613 }
8615 }
8617 /* Parse a lambda expression.
8619 lambda-expression:
8620 lambda-introducer lambda-declarator [opt] compound-statement
8622 Returns a representation of the expression. */
8624 static tree
8626 {
8628 tree type;
8638 /* We may be in the middle of deferred access check. Disable
8639 it now. */
8650 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8653 /* Now that we've started the type, add the capture fields for any
8654 explicit captures. */
8657 {
8658 /* Inside the class, surrounding template-parameter-lists do not apply. */
8659 unsigned int saved_num_template_parameter_lists
8670 /* By virtue of defining a local class, a lambda expression has access to
8671 the private variables of enclosing classes. */
8680 /* The capture list was built up in reverse order; fix that now. */
8693 }
8697 /* This field is only used during parsing of the lambda. */
8700 /* This lambda shouldn't have any proxies left at this point. */
8702 /* And now that we're done, push proxies for an enclosing lambda. */
8707 else
8709 }
8711 /* Parse the beginning of a lambda expression.
8713 lambda-introducer:
8714 [ lambda-capture [opt] ]
8716 LAMBDA_EXPR is the current representation of the lambda expression. */
8718 static void
8720 {
8721 /* Need commas after the first capture. */
8724 /* Eat the leading `['. */
8727 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8735 {
8738 }
8741 {
8743 tree capture_id;
8744 tree capture_init_expr;
8748 enum capture_kind_type
8749 {
8750 BY_COPY,
8751 BY_REFERENCE
8752 };
8756 {
8759 }
8763 else
8766 /* Possibly capture `this'. */
8768 {
8778 explicit_init_p);
8780 }
8782 /* Remember whether we want to capture as a reference or not. */
8784 {
8787 }
8789 /* Get the identifier. */
8794 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8795 delimiters, but I modified this to stop on unnested ']' as well. It
8796 was already changed to stop on unnested '}', so the
8797 "closing_parenthesis" name is no more misleading with my change. */
8798 {
8804 }
8806 /* Find the initializer for this capture. */
8810 {
8812 /* An explicit initializer exists. */
8815 "lambda capture initializers "
8820 }
8821 else
8822 {
8825 /* Turn the identifier into an id-expression. */
8826 capture_init_expr
8831 {
8834 }
8838 {
8841 capture_init_expr);
8844 }
8847 {
8850 capture_init_expr);
8853 }
8855 capture_init_expr
8856 = finish_id_expression
8858 capture_init_expr,
8872 {
8875 }
8876 else
8878 }
8882 {
8887 capture_id);
8891 "capture of %qD redundant with by-reference capture "
8893 }
8896 capture_id,
8897 capture_init_expr,
8899 explicit_init_p);
8900 }
8903 }
8905 /* Parse the (optional) middle of a lambda expression.
8907 lambda-declarator:
8908 < template-parameter-list [opt] >
8909 ( parameter-declaration-clause [opt] )
8910 attribute-specifier [opt]
8911 mutable [opt]
8912 exception-specification [opt]
8913 lambda-return-type-clause [opt]
8915 LAMBDA_EXPR is the current representation of the lambda expression. */
8917 static bool
8919 {
8920 /* 5.1.1.4 of the standard says:
8921 If a lambda-expression does not include a lambda-declarator, it is as if
8922 the lambda-declarator were ().
8923 This means an empty parameter list, no attributes, and no exception
8924 specification. */
8930 /* The template-parameter-list is optional, but must begin with
8931 an opening angle if present. */
8933 {
8936 "lambda templates are only available with "
8945 /* We just processed one more parameter list. */
8947 }
8949 /* The parameter-declaration-clause is optional (unless
8950 template-parameter-list was given), but must begin with an
8951 opening parenthesis if present. */
8953 {
8958 /* Parse parameters. */
8961 /* Default arguments shall not be specified in the
8962 parameter-declaration-clause of a lambda-declarator. */
8972 /* Parse optional `mutable' keyword. */
8974 {
8977 }
8979 /* Parse optional exception specification. */
8982 /* Parse optional trailing return type. */
8984 {
8988 }
8990 /* The function parameters must be in scope all the way until after the
8991 trailing-return-type in case of decltype. */
8993 }
8997 /* Create the function call operator.
8999 Messing with declarators like this is no uglier than building up the
9000 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9001 other code. */
9002 {
9003 cp_decl_specifier_seq return_type_specs;
9005 tree fco;
9012 else
9013 /* Maybe we will deduce the return type later. */
9019 sfk_none);
9024 VIRT_SPEC_UNSPECIFIED,
9025 REF_QUAL_NONE,
9026 exception_spec,
9031 declarator,
9032 attributes);
9034 {
9037 /* Give the object parameter a different name. */
9040 {
9044 }
9047 }
9054 }
9055 }
9057 /* Parse the body of a lambda expression, which is simply
9059 compound-statement
9061 but which requires special handling.
9062 LAMBDA_EXPR is the current representation of the lambda expression. */
9064 static void
9066 {
9071 else
9072 /* Still increment function_depth so that we don't GC in the
9073 middle of an expression. */
9075 /* Clear this in case we're in the middle of a default argument. */
9078 /* Finish the function call operator
9079 - class_specifier
9080 + late_parsing_for_member
9081 + function_definition_after_declarator
9082 + ctor_initializer_opt_and_function_body */
9083 {
9085 tree body;
9087 tree compound_stmt;
9088 tree cap;
9090 /* Let the front end know that we are going to be defining this
9091 function. */
9093 NULL_TREE,
9102 /* Push the proxies for any explicit captures. */
9109 /* 5.1.1.4 of the standard says:
9110 If a lambda-expression does not include a trailing-return-type, it
9111 is as if the trailing-return-type denotes the following type:
9112 * if the compound-statement is of the form
9113 { return attribute-specifier [opt] expression ; }
9114 the type of the returned expression after lvalue-to-rvalue
9115 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9116 (_conv.array_ 4.2), and function-to-pointer conversion
9117 (_conv.func_ 4.3);
9118 * otherwise, void. */
9120 /* In a lambda that has neither a lambda-return-type-clause
9121 nor a deducible form, errors should be reported for return statements
9122 in the body. Since we used void as the placeholder return type, parsing
9123 the body as usual will give such desired behavior. */
9127 {
9131 /* Parse tentatively in case there's more after the initial return
9132 statement. */
9143 {
9147 /* Will get error here if type not deduced yet. */
9151 }
9152 }
9155 {
9160 }
9164 out:
9168 /* Finish the function and generate code for it if necessary. */
9171 /* Only expand if the call op is not a template. */
9174 }
9179 else
9181 }
9183 /* Statements [gram.stmt.stmt] */
9185 /* Parse a statement.
9187 statement:
9188 labeled-statement
9189 expression-statement
9190 compound-statement
9191 selection-statement
9192 iteration-statement
9193 jump-statement
9194 declaration-statement
9195 try-block
9197 C++11:
9199 statement:
9200 labeled-statement
9201 attribute-specifier-seq (opt) expression-statement
9202 attribute-specifier-seq (opt) compound-statement
9203 attribute-specifier-seq (opt) selection-statement
9204 attribute-specifier-seq (opt) iteration-statement
9205 attribute-specifier-seq (opt) jump-statement
9206 declaration-statement
9207 attribute-specifier-seq (opt) try-block
9209 TM Extension:
9211 statement:
9212 atomic-statement
9214 IN_COMPOUND is true when the statement is nested inside a
9215 cp_parser_compound_statement; this matters for certain pragmas.
9217 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9218 is a (possibly labeled) if statement which is not enclosed in braces
9219 and has an else clause. This is used to implement -Wparentheses. */
9221 static void
9224 {
9229 restart:
9232 /* There is no statement yet. */
9238 /* In obj-c++, seeing '[[' might be the either the beginning of
9239 c++11 attributes, or a nested objc-message-expression. So
9240 let's parse the c++11 attributes tentatively. */
9244 {
9247 }
9249 /* Peek at the next token. */
9251 /* Remember the location of the first token in the statement. */
9253 /* If this is a keyword, then that will often determine what kind of
9254 statement we have. */
9256 {
9260 {
9263 /* Looks like a labeled-statement with a case label.
9264 Parse the label, and then use tail recursion to parse
9265 the statement. */
9287 /* Objective-C++ exception-handling constructs. */
9301 /* This must be a namespace alias definition. */
9314 /* It might be a keyword like `int' that can start a
9315 declaration-statement. */
9317 }
9318 }
9320 {
9321 /* If the next token is a `:', then we are looking at a
9322 labeled-statement. */
9325 {
9326 /* Looks like a labeled-statement with an ordinary label.
9327 Parse the label, and then use tail recursion to parse
9328 the statement. */
9332 }
9333 }
9334 /* Anything that starts with a `{' must be a compound-statement. */
9337 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9338 a statement all its own. */
9340 {
9341 /* Only certain OpenMP pragmas are attached to statements, and thus
9342 are considered statements themselves. All others are not. In
9343 the context of a compound, accept the pragma as a "statement" and
9344 return so that we can check for a close brace. Otherwise we
9345 require a real statement and must go back and read one. */
9351 }
9353 {
9356 }
9358 /* Everything else must be a declaration-statement or an
9359 expression-statement. Try for the declaration-statement
9360 first, unless we are looking at a `;', in which case we know that
9361 we have an expression-statement. */
9363 {
9365 {
9367 {
9368 /* Attributes should be parsed as part of the the
9369 declaration, so let's un-parse them. */
9372 }
9375 /* Try to parse the declaration-statement. */
9377 /* If that worked, we're done. */
9380 }
9381 /* Look for an expression-statement instead. */
9383 }
9385 /* Set the line number for the statement. */
9389 /* Note that for now, we don't do anything with c++11 statements
9390 parsed at this level. */
9393 OPT_Wattributes,
9395 }
9397 /* Parse the label for a labeled-statement, i.e.
9399 identifier :
9400 case constant-expression :
9401 default :
9403 GNU Extension:
9404 case constant-expression ... constant-expression : statement
9406 When a label is parsed without errors, the label is added to the
9407 parse tree by the finish_* functions, so this function doesn't
9408 have to return the label. */
9410 static void
9412 {
9417 /* The next token should be an identifier. */
9421 {
9424 }
9428 {
9430 {
9434 /* Consume the `case' token. */
9436 /* Parse the constant-expression. */
9439 NULL);
9443 {
9444 /* Consume the `...' token. */
9446 expr_hi =
9449 NULL);
9450 /* We don't need to emit warnings here, as the common code
9451 will do this for us. */
9452 }
9453 else
9458 else
9461 expr);
9462 }
9466 /* Consume the `default' token. */
9471 else
9476 /* Anything else must be an ordinary label. */
9479 }
9481 /* Require the `:' token. */
9484 /* An ordinary label may optionally be followed by attributes.
9485 However, this is only permitted if the attributes are then
9486 followed by a semicolon. This is because, for backward
9487 compatibility, when parsing
9488 lab: __attribute__ ((unused)) int i;
9489 we want the attribute to attach to "i", not "lab". */
9492 {
9493 tree attrs;
9500 ;
9501 else
9503 }
9509 }
9511 /* Parse an expression-statement.
9513 expression-statement:
9514 expression [opt] ;
9516 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9517 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9518 indicates whether this expression-statement is part of an
9519 expression statement. */
9521 static tree
9523 {
9527 /* If the next token is a ';', then there is no expression
9528 statement. */
9530 {
9534 {
9537 }
9538 }
9540 /* Give a helpful message for "A<T>::type t;" and the like. */
9543 {
9550 {
9551 /* A::A a; */
9556 }
9557 }
9559 /* Consume the final `;'. */
9564 /* This is the final expression statement of a statement
9565 expression. */
9571 }
9573 /* Parse a compound-statement.
9575 compound-statement:
9576 { statement-seq [opt] }
9578 GNU extension:
9580 compound-statement:
9581 { label-declaration-seq [opt] statement-seq [opt] }
9583 label-declaration-seq:
9584 label-declaration
9585 label-declaration-seq label-declaration
9587 Returns a tree representing the statement. */
9589 static tree
9592 {
9593 tree compound_stmt;
9595 /* Consume the `{'. */
9602 /* Begin the compound-statement. */
9604 /* If the next keyword is `__label__' we have a label declaration. */
9607 /* Parse an (optional) statement-seq. */
9609 /* Finish the compound-statement. */
9611 /* Consume the `}'. */
9615 }
9617 /* Parse an (optional) statement-seq.
9619 statement-seq:
9620 statement
9621 statement-seq [opt] statement */
9623 static void
9625 {
9626 /* Scan statements until there aren't any more. */
9628 {
9631 /* If we are looking at a `}', then we have run out of
9632 statements; the same is true if we have reached the end
9633 of file, or have stumbled upon a stray '@end'. */
9640 /* If we are in a compound statement and find 'else' then
9641 something went wrong. */
9643 {
9646 else
9647 {
9650 }
9651 }
9653 /* Parse the statement. */
9655 }
9656 }
9658 /* Parse a selection-statement.
9660 selection-statement:
9661 if ( condition ) statement
9662 if ( condition ) statement else statement
9663 switch ( condition ) statement
9665 Returns the new IF_STMT or SWITCH_STMT.
9667 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9668 is a (possibly labeled) if statement which is not enclosed in
9669 braces and has an else clause. This is used to implement
9670 -Wparentheses. */
9672 static tree
9674 {
9681 /* Peek at the next token. */
9684 /* See what kind of keyword it is. */
9687 {
9690 {
9691 tree statement;
9692 tree condition;
9694 /* Look for the `('. */
9696 {
9699 }
9701 /* Begin the selection-statement. */
9704 else
9707 /* Parse the condition. */
9709 /* Look for the `)'. */
9715 {
9719 /* Add the condition. */
9722 /* Parse the then-clause. */
9726 {
9734 }
9735 else
9741 /* If the next token is `else', parse the else-clause. */
9743 RID_ELSE))
9744 {
9745 /* Consume the `else' keyword. */
9748 /* Parse the else-clause. */
9750 {
9751 location_t loc;
9758 }
9759 else
9764 /* If we are currently parsing a then-clause, then
9765 IF_P will not be NULL. We set it to true to
9766 indicate that this if statement has an else clause.
9767 This may trigger the Wparentheses warning below
9768 when we get back up to the parent if statement. */
9771 }
9772 else
9773 {
9774 /* This if statement does not have an else clause. If
9775 NESTED_IF is true, then the then-clause is an if
9776 statement which does have an else clause. We warn
9777 about the potential ambiguity. */
9780 "suggest explicit braces to avoid ambiguous"
9782 }
9784 /* Now we're all done with the if-statement. */
9786 }
9787 else
9788 {
9792 /* Add the condition. */
9795 /* Parse the body of the switch-statement. */
9804 /* Now we're all done with the switch-statement. */
9806 }
9809 }
9815 }
9816 }
9818 /* Parse a condition.
9820 condition:
9821 expression
9822 type-specifier-seq declarator = initializer-clause
9823 type-specifier-seq declarator braced-init-list
9825 GNU Extension:
9827 condition:
9828 type-specifier-seq declarator asm-specification [opt]
9829 attributes [opt] = assignment-expression
9831 Returns the expression that should be tested. */
9833 static tree
9835 {
9836 cp_decl_specifier_seq type_specifiers;
9840 /* Try the declaration first. */
9842 /* New types are not allowed in the type-specifier-seq for a
9843 condition. */
9845 parser->type_definition_forbidden_message
9847 /* Parse the type-specifier-seq. */
9849 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9852 /* Restore the saved message. */
9854 /* If all is well, we might be looking at a declaration. */
9856 {
9857 tree decl;
9858 tree asm_specification;
9859 tree attributes;
9863 /* Parse the declarator. */
9868 /* Parse the attributes. */
9870 /* Parse the asm-specification. */
9872 /* If the next token is not an `=' or '{', then we might still be
9873 looking at an expression. For example:
9875 if (A(a).x)
9877 looks like a decl-specifier-seq and a declarator -- but then
9878 there is no `=', so this is an expression. */
9883 /* If we did see an `=' or '{', then we are looking at a declaration
9884 for sure. */
9886 {
9887 tree pushed_scope;
9891 /* Create the declaration. */
9897 /* Parse the initializer. */
9899 {
9903 }
9904 else
9905 {
9906 /* Consume the `='. */
9909 }
9913 /* Process the initializer. */
9916 asm_specification,
9917 flags);
9923 }
9924 }
9925 /* If we didn't even get past the declarator successfully, we are
9926 definitely not looking at a declaration. */
9927 else
9930 /* Otherwise, we are looking at an expression. */
9932 }
9934 /* Parses a for-statement or range-for-statement until the closing ')',
9935 not included. */
9937 static tree
9939 {
9943 /* Begin the for-statement. */
9946 /* Parse the initialization. */
9951 else
9953 }
9955 static tree
9957 {
9958 /* Normal for loop */
9961 tree stmt;
9964 /* The for-init-statement has already been parsed in
9965 cp_parser_for_init_statement, so no work is needed here. */
9968 /* If there's a condition, process it. */
9972 {
9976 }
9978 /* Look for the `;'. */
9981 /* If there's an expression, process it. */
9987 }
9989 /* Tries to parse a range-based for-statement:
9991 range-based-for:
9992 decl-specifier-seq declarator : expression
9994 The decl-specifier-seq declarator and the `:' are already parsed by
9995 cp_parser_for_init_statement. If processing_template_decl it returns a
9996 newly created RANGE_FOR_STMT; if not, it is converted to a
9997 regular FOR_STMT. */
9999 static tree
10002 {
10006 {
10009 }
10010 else
10013 /* If in template, STMT is converted to a normal for-statement
10014 at instantiation. If not, it is done just ahead. */
10016 {
10024 /* do_auto_deduction doesn't mess with template init-lists. */
10027 }
10028 else
10029 {
10032 }
10034 }
10036 /* Subroutine of cp_convert_range_for: given the initializer expression,
10037 builds up the range temporary. */
10039 static tree
10041 {
10044 /* Find out the type deduced by the declaration
10045 `auto &&__range = range_expr'. */
10050 /* Create the __range variable. */
10057 }
10059 /* Used by cp_parser_range_for in template context: we aren't going to
10060 do a full conversion yet, but we still need to resolve auto in the
10061 type of the for-range-declaration if present. This is basically
10062 a shortcut version of cp_convert_range_for. */
10064 static void
10066 {
10069 {
10072 iter_type = (cp_parser_perform_range_for_lookup
10075 {
10077 iter_type);
10079 tf_warning_or_error);
10082 }
10083 }
10084 }
10086 /* Converts a range-based for-statement into a normal
10087 for-statement, as per the definition.
10089 for (RANGE_DECL : RANGE_EXPR)
10090 BLOCK
10092 should be equivalent to:
10094 {
10095 auto &&__range = RANGE_EXPR;
10096 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10097 __begin != __end;
10098 ++__begin)
10099 {
10100 RANGE_DECL = *__begin;
10101 BLOCK
10102 }
10103 }
10105 If RANGE_EXPR is an array:
10106 BEGIN_EXPR = __range
10107 END_EXPR = __range + ARRAY_SIZE(__range)
10108 Else if RANGE_EXPR has a member 'begin' or 'end':
10109 BEGIN_EXPR = __range.begin()
10110 END_EXPR = __range.end()
10111 Else:
10112 BEGIN_EXPR = begin(__range)
10113 END_EXPR = end(__range);
10115 If __range has a member 'begin' but not 'end', or vice versa, we must
10116 still use the second alternative (it will surely fail, however).
10117 When calling begin()/end() in the third alternative we must use
10118 argument dependent lookup, but always considering 'std' as an associated
10119 namespace. */
10121 tree
10124 {
10130 /* If an error happened previously do nothing or else a lot of
10131 unhelpful errors would be issued. */
10133 else
10134 {
10135 tree range_temp;
10139 /* Can't bind a reference to an array of runtime bound. */
10141 else
10142 {
10147 LOOKUP_ONLYCONVERTING);
10149 }
10152 }
10154 /* The new for initialization statement. */
10162 LOOKUP_ONLYCONVERTING);
10171 LOOKUP_ONLYCONVERTING);
10175 /* The new for condition. */
10182 /* The new increment expression. */
10185 tf_warning_or_error);
10188 /* The declaration is initialized with *__begin inside the loop body. */
10191 tf_warning_or_error),
10193 LOOKUP_ONLYCONVERTING);
10196 }
10198 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10199 We need to solve both at the same time because the method used
10200 depends on the existence of members begin or end.
10201 Returns the type deduced for the iterator expression. */
10203 static tree
10205 {
10207 {
10210 }
10213 {
10218 }
10220 {
10221 /* If RANGE is an array, we will use pointer arithmetic. */
10224 range,
10228 }
10229 else
10230 {
10231 /* If it is not an array, we must do a bit of magic. */
10241 tf_warning_or_error);
10244 tf_warning_or_error);
10247 {
10248 /* Use the member functions. */
10251 else
10257 else
10260 }
10261 else
10262 {
10263 /* Use global functions with ADL. */
10271 tf_warning_or_error);
10273 tf_warning_or_error);
10276 tf_warning_or_error);
10278 tf_warning_or_error);
10281 }
10283 /* Last common checks. */
10285 {
10286 /* If one of the expressions is an error do no more checks. */
10289 }
10292 /* Can happen, when, eg, in a template context, Koenig lookup
10293 can't resolve begin/end (c++/58503). */
10295 else
10296 {
10298 /* The unqualified type of the __begin and __end temporaries should
10299 be the same, as required by the multiple auto declaration. */
10305 }
10306 }
10307 }
10309 /* Helper function for cp_parser_perform_range_for_lookup.
10310 Builds a tree for RANGE.IDENTIFIER(). */
10312 static tree
10314 {
10327 tf_warning_or_error);
10330 }
10332 /* Parse an iteration-statement.
10334 iteration-statement:
10335 while ( condition ) statement
10336 do statement while ( expression ) ;
10337 for ( for-init-statement condition [opt] ; expression [opt] )
10338 statement
10340 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10342 static tree
10344 {
10347 tree statement;
10350 /* Peek at the next token. */
10355 /* Remember whether or not we are already within an iteration
10356 statement. */
10359 /* See what kind of keyword it is. */
10362 {
10364 {
10365 tree condition;
10367 /* Begin the while-statement. */
10369 /* Look for the `('. */
10371 /* Parse the condition. */
10374 /* Look for the `)'. */
10376 /* Parse the dependent statement. */
10380 /* We're done with the while-statement. */
10382 }
10386 {
10387 tree expression;
10389 /* Begin the do-statement. */
10391 /* Parse the body of the do-statement. */
10396 /* Look for the `while' keyword. */
10398 /* Look for the `('. */
10400 /* Parse the expression. */
10402 /* We're done with the do-statement. */
10404 /* Look for the `)'. */
10406 /* Look for the `;'. */
10408 }
10412 {
10413 /* Look for the `('. */
10418 /* Look for the `)'. */
10421 /* Parse the body of the for-statement. */
10426 /* We're done with the for-statement. */
10428 }
10435 }
10438 }
10440 /* Parse a for-init-statement or the declarator of a range-based-for.
10441 Returns true if a range-based-for declaration is seen.
10443 for-init-statement:
10444 expression-statement
10445 simple-declaration */
10447 static bool
10449 {
10450 /* If the next token is a `;', then we have an empty
10451 expression-statement. Grammatically, this is also a
10452 simple-declaration, but an invalid one, because it does not
10453 declare anything. Therefore, if we did not handle this case
10454 specially, we would issue an error message about an invalid
10455 declaration. */
10457 {
10463 /* We're going to speculatively look for a declaration, falling back
10464 to an expression, if necessary. */
10466 /* Parse the declaration. */
10469 decl);
10472 {
10473 /* It is a range-for, consume the ':' */
10477 {
10479 "range-based %<for%> loops are not allowed "
10482 }
10483 }
10484 else
10485 /* The ';' is not consumed yet because we told
10486 cp_parser_simple_declaration not to. */
10491 /* If the tentative parse failed, then we shall need to look for an
10492 expression-statement. */
10493 }
10494 /* If we are here, it is an expression-statement. */
10497 }
10499 /* Parse a jump-statement.
10501 jump-statement:
10502 break ;
10503 continue ;
10504 return expression [opt] ;
10505 return braced-init-list ;
10506 goto identifier ;
10508 GNU extension:
10510 jump-statement:
10511 goto * expression ;
10513 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10515 static tree
10517 {
10523 /* Peek at the next token. */
10528 /* See what kind of keyword it is. */
10531 {
10535 {
10550 }
10556 {
10569 }
10574 {
10575 tree expr;
10579 {
10582 }
10585 else
10586 /* If the next token is a `;', then there is no
10587 expression. */
10589 /* Build the return-statement. */
10591 /* Look for the final `;'. */
10593 }
10597 /* Create the goto-statement. */
10599 {
10600 /* Issue a warning about this use of a GNU extension. */
10602 /* Consume the '*' token. */
10604 /* Parse the dependent expression. */
10606 }
10607 else
10609 /* Look for the final `;'. */
10616 }
10619 }
10621 /* Parse a declaration-statement.
10623 declaration-statement:
10624 block-declaration */
10626 static void
10628 {
10631 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10634 /* Parse the block-declaration. */
10637 /* Free any declarators allocated. */
10639 }
10641 /* Some dependent statements (like `if (cond) statement'), are
10642 implicitly in their own scope. In other words, if the statement is
10643 a single statement (as opposed to a compound-statement), it is
10644 none-the-less treated as if it were enclosed in braces. Any
10645 declarations appearing in the dependent statement are out of scope
10646 after control passes that point. This function parses a statement,
10647 but ensures that is in its own scope, even if it is not a
10648 compound-statement.
10650 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10651 is a (possibly labeled) if statement which is not enclosed in
10652 braces and has an else clause. This is used to implement
10653 -Wparentheses.
10655 Returns the new statement. */
10657 static tree
10659 {
10660 tree statement;
10665 /* Mark if () ; with a special NOP_EXPR. */
10667 {
10671 }
10672 /* if a compound is opened, we simply parse the statement directly. */
10675 /* If the token is not a `{', then we must take special action. */
10676 else
10677 {
10678 /* Create a compound-statement. */
10680 /* Parse the dependent-statement. */
10682 /* Finish the dummy compound-statement. */
10684 }
10686 /* Return the statement. */
10688 }
10690 /* For some dependent statements (like `while (cond) statement'), we
10691 have already created a scope. Therefore, even if the dependent
10692 statement is a compound-statement, we do not want to create another
10693 scope. */
10695 static void
10697 {
10698 /* If the token is a `{', then we must take special action. */
10701 else
10702 {
10703 /* Avoid calling cp_parser_compound_statement, so that we
10704 don't create a new scope. Do everything else by hand. */
10706 /* If the next keyword is `__label__' we have a label declaration. */
10709 /* Parse an (optional) statement-seq. */
10712 }
10713 }
10715 /* Declarations [gram.dcl.dcl] */
10717 /* Parse an optional declaration-sequence.
10719 declaration-seq:
10720 declaration
10721 declaration-seq declaration */
10723 static void
10725 {
10727 {
10738 {
10739 /* A declaration consisting of a single semicolon is
10740 invalid. Allow it unless we're being pedantic. */
10745 }
10747 /* If we're entering or exiting a region that's implicitly
10748 extern "C", modify the lang context appropriately. */
10750 {
10753 }
10755 {
10758 }
10761 {
10762 /* A top-level declaration can consist solely of a #pragma.
10763 A nested declaration cannot, so this is done here and not
10764 in cp_parser_declaration. (A #pragma at block scope is
10765 handled in cp_parser_statement.) */
10768 }
10770 /* Parse the declaration itself. */
10772 }
10773 }
10775 /* Parse a declaration.
10777 declaration:
10778 block-declaration
10779 function-definition
10780 template-declaration
10781 explicit-instantiation
10782 explicit-specialization
10783 linkage-specification
10784 namespace-definition
10786 GNU extension:
10788 declaration:
10789 __extension__ declaration */
10791 static void
10793 {
10794 cp_token token1;
10795 cp_token token2;
10800 /* Check for the `__extension__' keyword. */
10802 {
10803 /* Parse the qualified declaration. */
10805 /* Restore the PEDANTIC flag. */
10809 }
10811 /* Try to figure out what kind of declaration is present. */
10816 else
10817 {
10820 }
10822 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10825 /* If the next token is `extern' and the following token is a string
10826 literal, then we have a linkage specification. */
10830 /* If the next token is `template', then we have either a template
10831 declaration, an explicit instantiation, or an explicit
10832 specialization. */
10834 {
10835 /* `template <>' indicates a template specialization. */
10839 /* `template <' indicates a template declaration. */
10842 /* Anything else must be an explicit instantiation. */
10843 else
10845 }
10846 /* If the next token is `export', then we have a template
10847 declaration. */
10850 /* If the next token is `extern', 'static' or 'inline' and the one
10851 after that is `template', we have a GNU extended explicit
10852 instantiation directive. */
10859 /* If the next token is `namespace', check for a named or unnamed
10860 namespace definition. */
10866 /* An unnamed namespace definition. */
10870 /* An inline (associated) namespace definition. */
10874 /* Objective-C++ declaration/definition. */
10881 /* We must have either a block declaration or a function
10882 definition. */
10883 else
10884 /* Try to parse a block-declaration, or a function-definition. */
10887 /* Free any declarators allocated. */
10889 }
10891 /* Parse a block-declaration.
10893 block-declaration:
10894 simple-declaration
10895 asm-definition
10896 namespace-alias-definition
10897 using-declaration
10898 using-directive
10900 GNU Extension:
10902 block-declaration:
10903 __extension__ block-declaration
10905 C++0x Extension:
10907 block-declaration:
10908 static_assert-declaration
10910 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10911 part of a declaration-statement. */
10913 static void
10916 {
10920 /* Check for the `__extension__' keyword. */
10922 {
10923 /* Parse the qualified declaration. */
10925 /* Restore the PEDANTIC flag. */
10929 }
10931 /* Peek at the next token to figure out which kind of declaration is
10932 present. */
10935 /* If the next keyword is `asm', we have an asm-definition. */
10937 {
10941 }
10942 /* If the next keyword is `namespace', we have a
10943 namespace-alias-definition. */
10946 /* If the next keyword is `using', we have a
10947 using-declaration, a using-directive, or an alias-declaration. */
10949 {
10954 /* If the token after `using' is `namespace', then we have a
10955 using-directive. */
10959 /* If the second token after 'using' is '=', then we have an
10960 alias-declaration. */
10966 /* Otherwise, it's a using-declaration. */
10967 else
10970 }
10971 /* If the next keyword is `__label__' we have a misplaced label
10972 declaration. */
10974 {
10978 /* If the next token is now a `;', consume it. */
10981 }
10982 /* If the next token is `static_assert' we have a static assertion. */
10985 /* Anything else must be a simple-declaration. */
10986 else
10989 }
10991 /* Parse a simple-declaration.
10993 simple-declaration:
10994 decl-specifier-seq [opt] init-declarator-list [opt] ;
10996 init-declarator-list:
10997 init-declarator
10998 init-declarator-list , init-declarator
11000 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11001 function-definition as a simple-declaration.
11003 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11004 parsed declaration if it is an uninitialized single declarator not followed
11005 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11006 if present, will not be consumed. */
11008 static void
11012 {
11013 cp_decl_specifier_seq decl_specifiers;
11020 /* Defer access checks until we know what is being declared; the
11021 checks for names appearing in the decl-specifier-seq should be
11022 done as if we were in the scope of the thing being declared. */
11025 /* Parse the decl-specifier-seq. We have to keep track of whether
11026 or not the decl-specifier-seq declares a named class or
11027 enumeration type, since that is the only case in which the
11028 init-declarator-list is allowed to be empty.
11030 [dcl.dcl]
11032 In a simple-declaration, the optional init-declarator-list can be
11033 omitted only when declaring a class or enumeration, that is when
11034 the decl-specifier-seq contains either a class-specifier, an
11035 elaborated-type-specifier, or an enum-specifier. */
11037 CP_PARSER_FLAGS_OPTIONAL,
11040 /* We no longer need to defer access checks. */
11043 /* In a block scope, a valid declaration must always have a
11044 decl-specifier-seq. By not trying to parse declarators, we can
11045 resolve the declaration/expression ambiguity more quickly. */
11048 {
11051 }
11053 /* If the next two tokens are both identifiers, the code is
11054 erroneous. The usual cause of this situation is code like:
11056 T t;
11058 where "T" should name a type -- but does not. */
11061 {
11062 /* If parsing tentatively, we should commit; we really are
11063 looking at a declaration. */
11065 /* Give up. */
11067 }
11069 /* If we have seen at least one decl-specifier, and the next token
11070 is not a parenthesis, then we must be looking at a declaration.
11071 (After "int (" we might be looking at a functional cast.) */
11078 /* Keep going until we hit the `;' at the end of the simple
11079 declaration. */
11082 CPP_SEMICOLON))
11083 {
11086 tree decl;
11089 {
11090 /* If we are processing next declarator, coma is expected */
11096 }
11097 else
11100 /* Parse the init-declarator. */
11103 function_definition_allowed_p,
11105 declares_class_or_enum,
11107 maybe_range_for_decl);
11108 /* If an error occurred while parsing tentatively, exit quickly.
11109 (That usually happens when in the body of a function; each
11110 statement is treated as a declaration-statement until proven
11111 otherwise.) */
11114 /* Handle function definitions specially. */
11116 {
11117 /* If the next token is a `,', then we are probably
11118 processing something like:
11120 void f() {}, *p;
11122 which is erroneous. */
11124 {
11127 "mixing"
11129 }
11130 /* Otherwise, we're done with the list of declarators. */
11131 else
11132 {
11135 }
11136 }
11139 /* The next token should be either a `,' or a `;'. */
11141 /* If it's a `,', there are more declarators to come. */
11144 /* If it's a `;', we are done. */
11147 /* Anything else is an error. */
11148 else
11149 {
11150 /* If we have already issued an error message we don't need
11151 to issue another one. */
11155 /* Skip tokens until we reach the end of the statement. */
11157 /* If the next token is now a `;', consume it. */
11161 }
11162 /* After the first time around, a function-definition is not
11163 allowed -- even if it was OK at first. For example:
11165 int i, f() {}
11167 is not valid. */
11169 }
11171 /* Issue an error message if no declarators are present, and the
11172 decl-specifier-seq does not itself declare a class or
11173 enumeration: [dcl.dcl]/3. */
11175 {
11177 {
11181 /* Ensure an error is issued anyway when finish_decltype_type,
11182 called via cp_parser_decl_specifier_seq, returns a class or
11183 an enumeration (c++/51786). */
11186 }
11187 /* Perform any deferred access checks. */
11189 }
11191 /* Consume the `;'. */
11195 done:
11197 }
11199 /* Parse a decl-specifier-seq.
11201 decl-specifier-seq:
11202 decl-specifier-seq [opt] decl-specifier
11203 decl-specifier attribute-specifier-seq [opt] (C++11)
11205 decl-specifier:
11206 storage-class-specifier
11207 type-specifier
11208 function-specifier
11209 friend
11210 typedef
11212 GNU Extension:
11214 decl-specifier:
11215 attributes
11217 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11219 The parser flags FLAGS is used to control type-specifier parsing.
11221 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11222 flags:
11224 1: one of the decl-specifiers is an elaborated-type-specifier
11225 (i.e., a type declaration)
11226 2: one of the decl-specifiers is an enum-specifier or a
11227 class-specifier (i.e., a type definition)
11229 */
11231 static void
11233 cp_parser_flags flags,
11236 {
11240 cp_decl_spec ds;
11242 /* Clear DECL_SPECS. */
11245 /* Assume no class or enumeration type is declared. */
11248 /* Keep reading specifiers until there are no more to read. */
11250 {
11255 /* Peek at the next token. */
11258 /* Save the first token of the decl spec list for error
11259 reporting. */
11262 /* Handle attributes. */
11264 {
11265 /* Parse the attributes. */
11268 /* In a sequence of declaration specifiers, c++11 attributes
11269 appertain to the type that precede them. In that case
11270 [dcl.spec]/1 says:
11272 The attribute-specifier-seq affects the type only for
11273 the declaration it appears in, not other declarations
11274 involving the same type.
11276 But for now let's force the user to position the
11277 attribute either at the beginning of the declaration or
11278 after the declarator-id, which would clearly mean that it
11279 applies to the declarator. */
11281 {
11283 /* The c++11 attribute is at the beginning of the
11284 declaration. It appertains to the entity being
11286 else
11287 {
11289 {
11290 /* This is an attribute following a
11291 class-specifier. */
11296 }
11297 else
11298 {
11299 decl_specs->std_attributes
11301 attrs);
11304 }
11306 }
11307 }
11309 decl_specs->attributes
11311 attrs);
11315 }
11316 /* Assume we will find a decl-specifier keyword. */
11318 /* If the next token is an appropriate keyword, we can simply
11319 add it to the list. */
11321 {
11322 /* decl-specifier:
11323 friend
11324 constexpr */
11327 {
11330 }
11331 else
11332 {
11334 /* Consume the token. */
11336 }
11344 /* function-specifier:
11345 inline
11346 virtual
11347 explicit */
11354 /* decl-specifier:
11355 typedef */
11358 /* Consume the token. */
11360 /* A constructor declarator cannot appear in a typedef. */
11362 /* The "typedef" keyword can only occur in a declaration; we
11363 may as well commit at this point. */
11370 /* storage-class-specifier:
11371 auto
11372 register
11373 static
11374 extern
11375 mutable
11377 GNU Extension:
11378 thread */
11381 {
11382 /* Consume the token. */
11385 /* Complain about `auto' as a storage specifier, if
11386 we're complaining about C++0x compatibility. */
11390 /* Set the storage class anyway. */
11392 token);
11393 }
11394 else
11395 /* C++0x auto type-specifier. */
11403 /* Consume the token. */
11406 token);
11409 /* Consume the token. */
11415 /* We did not yet find a decl-specifier yet. */
11418 }
11428 /* Constructors are a special case. The `S' in `S()' is not a
11429 decl-specifier; it is the beginning of the declarator. */
11430 constructor_p
11431 = (!found_decl_spec
11432 && constructor_possible_p
11433 && (cp_parser_constructor_declarator_p
11436 /* If we don't have a DECL_SPEC yet, then we must be looking at
11437 a type-specifier. */
11439 {
11442 tree type_spec;
11444 type_spec
11446 decl_specs,
11452 /* If this type-specifier referenced a user-defined type
11453 (a typedef, class-name, etc.), then we can't allow any
11454 more such type-specifiers henceforth.
11456 [dcl.spec]
11458 The longest sequence of decl-specifiers that could
11459 possibly be a type name is taken as the
11460 decl-specifier-seq of a declaration. The sequence shall
11461 be self-consistent as described below.
11463 [dcl.type]
11465 As a general rule, at most one type-specifier is allowed
11466 in the complete decl-specifier-seq of a declaration. The
11467 only exceptions are the following:
11469 -- const or volatile can be combined with any other
11470 type-specifier.
11472 -- signed or unsigned can be combined with char, long,
11473 short, or int.
11475 -- ..
11477 Example:
11479 typedef char* Pc;
11480 void g (const int Pc);
11482 Here, Pc is *not* part of the decl-specifier seq; it's
11483 the declarator. Therefore, once we see a type-specifier
11484 (other than a cv-qualifier), we forbid any additional
11485 user-defined types. We *do* still allow things like `int
11486 int' to be considered a decl-specifier-seq, and issue the
11487 error message later. */
11490 /* A constructor declarator cannot follow a type-specifier. */
11492 {
11497 }
11498 }
11500 /* If we still do not have a DECL_SPEC, then there are no more
11501 decl-specifiers. */
11506 /* After we see one decl-specifier, further decl-specifiers are
11507 always optional. */
11509 }
11511 /* Don't allow a friend specifier with a class definition. */
11516 }
11518 /* Parse an (optional) storage-class-specifier.
11520 storage-class-specifier:
11521 auto
11522 register
11523 static
11524 extern
11525 mutable
11527 GNU Extension:
11529 storage-class-specifier:
11530 thread
11532 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11534 static tree
11536 {
11538 {
11542 /* Fall through for C++98. */
11549 /* Consume the token. */
11554 }
11555 }
11557 /* Parse an (optional) function-specifier.
11559 function-specifier:
11560 inline
11561 virtual
11562 explicit
11564 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11565 Updates DECL_SPECS, if it is non-NULL. */
11567 static tree
11570 {
11573 {
11579 /* 14.5.2.3 [temp.mem]
11581 A member function template shall not be virtual. */
11584 else
11594 }
11596 /* Consume the token. */
11598 }
11600 /* Parse a linkage-specification.
11602 linkage-specification:
11603 extern string-literal { declaration-seq [opt] }
11604 extern string-literal declaration */
11606 static void
11608 {
11609 tree linkage;
11611 /* Look for the `extern' keyword. */
11614 /* Look for the string-literal. */
11617 /* Transform the literal into an identifier. If the literal is a
11618 wide-character string, or contains embedded NULs, then we can't
11619 handle it as the user wants. */
11622 {
11624 /* Assume C++ linkage. */
11626 }
11627 else
11630 /* We're now using the new linkage. */
11633 /* If the next token is a `{', then we're using the first
11634 production. */
11636 {
11639 /* Consume the `{' token. */
11641 /* Parse the declarations. */
11643 /* Look for the closing `}'. */
11645 }
11646 /* Otherwise, there's just one declaration. */
11647 else
11648 {
11651 saved_in_unbraced_linkage_specification_p
11655 parser->in_unbraced_linkage_specification_p
11657 }
11659 /* We're done with the linkage-specification. */
11661 }
11663 /* Parse a static_assert-declaration.
11665 static_assert-declaration:
11666 static_assert ( constant-expression , string-literal ) ;
11668 If MEMBER_P, this static_assert is a class member. */
11670 static void
11672 {
11673 tree condition;
11674 tree message;
11676 location_t saved_loc;
11679 /* Peek at the `static_assert' token so we can keep track of exactly
11680 where the static assertion started. */
11684 /* Look for the `static_assert' keyword. */
11686 RT_STATIC_ASSERT))
11689 /* We know we are in a static assertion; commit to any tentative
11690 parse. */
11694 /* Parse the `(' starting the static assertion condition. */
11697 /* Parse the constant-expression. Allow a non-constant expression
11698 here in order to give better diagnostics in finish_static_assert. */
11699 condition =
11704 /* Parse the separating `,'. */
11707 /* Parse the string-literal message. */
11712 /* A `)' completes the static assertion. */
11719 /* A semicolon terminates the declaration. */
11722 /* Complete the static assertion, which may mean either processing
11723 the static assert now or saving it for template instantiation. */
11725 }
11727 /* Parse the expression in decltype ( expression ). */
11729 static tree
11732 {
11734 tree expr;
11736 /* First, try parsing an id-expression. */
11747 {
11750 cp_id_kind idk;
11754 /* Lookup the name we got back from the id-expression. */
11765 {
11766 /* Complete lookup of the id-expression. */
11767 expr = (finish_id_expression
11780 /* We found an id-expression, but it was something that we
11781 should not have found. This is an error, not something
11782 we can recover from, so note that we found an
11783 id-expression and we'll recover as gracefully as
11784 possible. */
11786 }
11791 /* We have an id-expression. */
11793 }
11796 {
11797 /* Abort the id-expression parse. */
11800 /* Parsing tentatively, again. */
11803 /* Parse a class member access. */
11811 /* We have an id-expression. */
11813 }
11816 /* We have parsed the complete id-expression or member access. */
11818 else
11819 {
11820 /* Abort our attempt to parse an id-expression or member access
11821 expression. */
11824 /* Parse a full expression. */
11827 }
11830 }
11832 /* Parse a `decltype' type. Returns the type.
11834 simple-type-specifier:
11835 decltype ( expression )
11836 C++14 proposal:
11837 decltype ( auto ) */
11839 static tree
11841 {
11842 tree expr;
11851 {
11852 /* Already parsed. */
11855 }
11857 /* Look for the `decltype' token. */
11861 /* Parse the opening `('. */
11865 /* decltype (auto) */
11868 {
11875 }
11877 /* Types cannot be defined in a `decltype' expression. Save away the
11878 old message. */
11881 /* And create the new one. */
11882 parser->type_definition_forbidden_message
11885 /* The restrictions on constant-expressions do not apply inside
11886 decltype expressions. */
11887 saved_integral_constant_expression_p
11889 saved_non_integral_constant_expression_p
11893 /* Within a parenthesized expression, a `>' token is always
11894 the greater-than operator. */
11895 saved_greater_than_is_operator_p
11899 /* Do not actually evaluate the expression. */
11902 /* Do not warn about problems with the expression. */
11907 /* Go back to evaluating expressions. */
11911 /* The `>' token might be the end of a template-id or
11912 template-parameter-list now. */
11913 parser->greater_than_is_operator_p
11916 /* Restore the old message and the integral constant expression
11917 flags. */
11919 parser->integral_constant_expression_p
11921 parser->non_integral_constant_expression_p
11924 /* Parse to the closing `)'. */
11926 {
11930 }
11933 tf_warning_or_error);
11935 rewrite:
11936 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11937 it again. */
11944 }
11946 /* Special member functions [gram.special] */
11948 /* Parse a conversion-function-id.
11950 conversion-function-id:
11951 operator conversion-type-id
11953 Returns an IDENTIFIER_NODE representing the operator. */
11955 static tree
11957 {
11958 tree type;
11959 tree saved_scope;
11960 tree saved_qualifying_scope;
11961 tree saved_object_scope;
11964 /* Look for the `operator' token. */
11967 /* When we parse the conversion-type-id, the current scope will be
11968 reset. However, we need that information in able to look up the
11969 conversion function later, so we save it here. */
11973 /* We must enter the scope of the class so that the names of
11974 entities declared within the class are available in the
11975 conversion-type-id. For example, consider:
11977 struct S {
11978 typedef int I;
11979 operator I();
11980 };
11982 S::operator I() { ... }
11984 In order to see that `I' is a type-name in the definition, we
11985 must be in the scope of `S'. */
11988 /* Parse the conversion-type-id. */
11990 /* Leave the scope of the class, if any. */
11993 /* Restore the saved scope. */
11997 /* If the TYPE is invalid, indicate failure. */
12001 }
12003 /* Parse a conversion-type-id:
12005 conversion-type-id:
12006 type-specifier-seq conversion-declarator [opt]
12008 Returns the TYPE specified. */
12010 static tree
12012 {
12013 tree attributes;
12014 cp_decl_specifier_seq type_specifiers;
12016 tree type_specified;
12019 /* Parse the attributes. */
12023 parser->type_definition_forbidden_message
12026 /* Parse the type-specifiers. */
12033 /* If that didn't work, stop. */
12036 /* Parse the conversion-declarator. */
12044 /* Don't give this error when parsing tentatively. This happens to
12045 work because we always parse this definitively once. */
12048 {
12050 {
12053 }
12057 }
12060 }
12062 /* Parse an (optional) conversion-declarator.
12064 conversion-declarator:
12065 ptr-operator conversion-declarator [opt]
12067 */
12071 {
12074 cp_cv_quals cv_quals;
12076 /* We don't know if there's a ptr-operator next, or not. */
12078 /* Try the ptr-operator. */
12081 /* If it worked, look for more conversion-declarators. */
12083 {
12086 /* Parse another optional declarator. */
12089 declarator = cp_parser_make_indirect_declarator
12093 }
12096 }
12098 /* Parse an (optional) ctor-initializer.
12100 ctor-initializer:
12101 : mem-initializer-list
12103 Returns TRUE iff the ctor-initializer was actually present. */
12105 static bool
12107 {
12108 /* If the next token is not a `:', then there is no
12109 ctor-initializer. */
12111 {
12112 /* Do default initialization of any bases and members. */
12117 }
12119 /* Consume the `:' token. */
12121 /* And the mem-initializer-list. */
12125 }
12127 /* Parse a mem-initializer-list.
12129 mem-initializer-list:
12130 mem-initializer ... [opt]
12131 mem-initializer ... [opt] , mem-initializer-list */
12133 static void
12135 {
12140 /* Let the semantic analysis code know that we are starting the
12141 mem-initializer-list. */
12146 /* Loop through the list. */
12148 {
12149 tree mem_initializer;
12152 /* Parse the mem-initializer. */
12154 /* If the next token is a `...', we're expanding member initializers. */
12156 {
12157 /* Consume the `...'. */
12160 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12161 can be expanded but members cannot. */
12164 {
12169 }
12171 /* Construct the pack expansion type. */
12174 }
12177 {
12181 }
12182 /* Look for a target constructor. */
12186 {
12189 {
12193 }
12195 }
12196 /* Add it to the list, unless it was erroneous. */
12198 {
12201 }
12202 /* If the next token is not a `,', we're done. */
12205 /* Consume the `,' token. */
12207 }
12209 /* Perform semantic analysis. */
12212 }
12214 /* Parse a mem-initializer.
12216 mem-initializer:
12217 mem-initializer-id ( expression-list [opt] )
12218 mem-initializer-id braced-init-list
12220 GNU extension:
12222 mem-initializer:
12223 ( expression-list [opt] )
12225 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12226 class) or FIELD_DECL (for a non-static data member) to initialize;
12227 the TREE_VALUE is the expression-list. An empty initialization
12228 list is represented by void_list_node. */
12230 static tree
12232 {
12233 tree mem_initializer_id;
12234 tree expression_list;
12235 tree member;
12238 /* Find out what is being initialized. */
12240 {
12244 }
12245 else
12246 {
12250 }
12256 {
12262 }
12263 else
12264 {
12274 }
12284 }
12286 /* Parse a mem-initializer-id.
12288 mem-initializer-id:
12289 :: [opt] nested-name-specifier [opt] class-name
12290 identifier
12292 Returns a TYPE indicating the class to be initializer for the first
12293 production. Returns an IDENTIFIER_NODE indicating the data member
12294 to be initialized for the second production. */
12296 static tree
12298 {
12302 tree id;
12306 /* `typename' is not allowed in this context ([temp.res]). */
12308 {
12310 "keyword %<typename%> not allowed in this context (a qualified "
12313 }
12314 /* Look for the optional `::' operator. */
12315 global_scope_p
12319 /* Look for the optional nested-name-specifier. The simplest way to
12320 implement:
12322 [temp.res]
12324 The keyword `typename' is not permitted in a base-specifier or
12325 mem-initializer; in these contexts a qualified name that
12326 depends on a template-parameter is implicitly assumed to be a
12327 type name.
12329 is to assume that we have seen the `typename' keyword at this
12330 point. */
12331 nested_name_specifier_p
12340 /* If there is a `::' operator or a nested-name-specifier, then we
12341 are definitely looking for a class-name. */
12346 typename_type,
12350 /* Otherwise, we could also be looking for an ordinary identifier. */
12352 /* Try a class-name. */
12356 none_type,
12360 /* If we found one, we're done. */
12363 /* Otherwise, look for an ordinary identifier. */
12365 }
12367 /* Overloading [gram.over] */
12369 /* Parse an operator-function-id.
12371 operator-function-id:
12372 operator operator
12374 Returns an IDENTIFIER_NODE for the operator which is a
12375 human-readable spelling of the identifier, e.g., `operator +'. */
12377 static tree
12379 {
12380 /* Look for the `operator' keyword. */
12383 /* And then the name of the operator itself. */
12385 }
12387 /* Return an identifier node for a user-defined literal operator.
12388 The suffix identifier is chained to the operator name identifier. */
12390 static tree
12392 {
12393 tree identifier;
12400 }
12402 /* Parse an operator.
12404 operator:
12405 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12406 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12407 || ++ -- , ->* -> () []
12409 GNU Extensions:
12411 operator:
12412 <? >? <?= >?=
12414 Returns an IDENTIFIER_NODE for the operator which is a
12415 human-readable spelling of the identifier, e.g., `operator +'. */
12417 static tree
12419 {
12424 /* Peek at the next token. */
12426 /* Figure out which operator we have. */
12428 {
12430 {
12433 /* The keyword should be either `new' or `delete'. */
12438 else
12441 /* Consume the `new' or `delete' token. */
12444 /* Peek at the next token. */
12446 /* If it's a `[' token then this is the array variant of the
12447 operator. */
12449 {
12450 /* Consume the `[' token. */
12452 /* Look for the `]' token. */
12456 }
12457 /* Otherwise, we have the non-array variant. */
12458 else
12462 }
12609 /* Consume the `('. */
12611 /* Look for the matching `)'. */
12616 /* Consume the `['. */
12618 /* Look for the matching `]'. */
12627 /* Fall through. */
12633 {
12636 }
12638 {
12641 }
12642 /* Consume the string. */
12644 /* Look for the suffix identifier. */
12647 {
12650 {
12653 }
12654 }
12656 {
12660 }
12661 else
12662 {
12665 }
12672 /* Fall through. */
12678 {
12681 }
12682 {
12685 {
12688 }
12690 /* Consume the user-defined string literal. */
12693 {
12696 }
12697 else
12699 }
12702 /* Anything else is an error. */
12704 }
12706 /* If we have selected an identifier, we need to consume the
12707 operator token. */
12710 /* Otherwise, no valid operator name was present. */
12711 else
12712 {
12715 }
12718 }
12720 /* Parse a template-declaration.
12722 template-declaration:
12723 export [opt] template < template-parameter-list > declaration
12725 If MEMBER_P is TRUE, this template-declaration occurs within a
12726 class-specifier.
12728 The grammar rule given by the standard isn't correct. What
12729 is really meant is:
12731 template-declaration:
12732 export [opt] template-parameter-list-seq
12733 decl-specifier-seq [opt] init-declarator [opt] ;
12734 export [opt] template-parameter-list-seq
12735 function-definition
12737 template-parameter-list-seq:
12738 template-parameter-list-seq [opt]
12739 template < template-parameter-list > */
12741 static void
12743 {
12744 /* Check for `export'. */
12746 {
12747 /* Consume the `export' token. */
12749 /* Warn that we do not support `export'. */
12751 }
12754 }
12756 /* Parse a template-parameter-list.
12758 template-parameter-list:
12759 template-parameter
12760 template-parameter-list , template-parameter
12762 Returns a TREE_LIST. Each node represents a template parameter.
12763 The nodes are connected via their TREE_CHAINs. */
12765 static tree
12767 {
12772 /* The loop below parses the template parms. We first need to know
12773 the total number of template parms to be able to compute proper
12774 canonical types of each dependent type. So after the loop, when
12775 we know the total number of template parms,
12776 end_template_parm_list computes the proper canonical types and
12777 fixes up the dependent types accordingly. */
12779 {
12780 tree parameter;
12783 location_t parm_loc;
12785 /* Parse the template-parameter. */
12790 /* Add it to the list. */
12793 parm_loc,
12794 parameter,
12795 is_non_type,
12796 is_parameter_pack);
12797 else
12798 {
12801 }
12803 /* If the next token is not a `,', we're done. */
12806 /* Otherwise, consume the `,' token. */
12808 }
12811 }
12813 /* Parse a template-parameter.
12815 template-parameter:
12816 type-parameter
12817 parameter-declaration
12819 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12820 the parameter. The TREE_PURPOSE is the default value, if any.
12821 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12822 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12823 set to true iff this parameter is a parameter pack. */
12825 static tree
12828 {
12832 tree parm;
12834 /* Assume it is a type parameter or a template parameter. */
12836 /* Assume it not a parameter pack. */
12838 /* Peek at the next token. */
12840 /* If it is `class' or `template', we have a type-parameter. */
12843 /* If it is `class' or `typename' we do not know yet whether it is a
12844 type parameter or a non-type parameter. Consider:
12846 template <typename T, typename T::X X> ...
12848 or:
12850 template <class C, class D*> ...
12852 Here, the first parameter is a type parameter, and the second is
12853 a non-type parameter. We can tell by looking at the token after
12854 the identifier -- if it is a `,', `=', or `>' then we have a type
12855 parameter. */
12857 {
12858 /* Peek at the token after `class' or `typename'. */
12860 /* If it's an ellipsis, we have a template type parameter
12861 pack. */
12864 /* If it's an identifier, skip it. */
12867 /* Now, see if the token looks like the end of a template
12868 parameter. */
12873 }
12875 /* Otherwise, it is a non-type parameter.
12877 [temp.param]
12879 When parsing a default template-argument for a non-type
12880 template-parameter, the first non-nested `>' is taken as the end
12881 of the template parameter-list rather than a greater-than
12882 operator. */
12884 parameter_declarator
12888 /* If the parameter declaration is marked as a parameter pack, set
12889 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12890 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12891 grokdeclarator. */
12895 {
12898 }
12902 {
12903 /* Can happen in some cases of erroneous input (c++/34892). */
12905 /* Consume the `...' for better error recovery. */
12907 }
12908 /* If the next token is an ellipsis, and we don't already have it
12909 marked as a parameter pack, then we have a parameter pack (that
12910 has no declarator). */
12913 && (declarator_can_be_parameter_pack
12915 {
12916 /* Consume the `...'. */
12921 }
12922 /* We might end up with a pack expansion as the type of the non-type
12923 template parameter, in which case this is a non-type template
12924 parameter pack. */
12928 {
12932 }
12935 {
12936 /* Parameter packs cannot have default arguments. However, a
12937 user may try to do so, so we'll parse them and give an
12938 appropriate diagnostic here. */
12942 /* Find the name of the parameter pack. */
12951 else
12955 /* Parse the default argument, but throw away the result. */
12957 }
12967 }
12969 /* Parse a type-parameter.
12971 type-parameter:
12972 class identifier [opt]
12973 class identifier [opt] = type-id
12974 typename identifier [opt]
12975 typename identifier [opt] = type-id
12976 template < template-parameter-list > class identifier [opt]
12977 template < template-parameter-list > class identifier [opt]
12978 = id-expression
12980 GNU Extension (variadic templates):
12982 type-parameter:
12983 class ... identifier [opt]
12984 typename ... identifier [opt]
12986 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12987 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12988 the declaration of the parameter.
12990 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12992 static tree
12994 {
12996 tree parameter;
12998 /* Look for a keyword to tell us what kind of parameter this is. */
13004 {
13007 {
13008 tree identifier;
13009 tree default_argument;
13011 /* If the next token is an ellipsis, we have a template
13012 argument pack. */
13014 {
13015 /* Consume the `...' token. */
13020 }
13022 /* If the next token is an identifier, then it names the
13023 parameter. */
13026 else
13029 /* Create the parameter. */
13032 /* If the next token is an `=', we have a default argument. */
13034 {
13035 /* Consume the `=' token. */
13037 /* Parse the default-argument. */
13041 /* Template parameter packs cannot have default
13042 arguments. */
13044 {
13047 "template parameter pack %qD cannot have a "
13049 else
13051 "template parameter packs cannot have "
13054 }
13056 }
13057 else
13060 /* Create the combined representation of the parameter and the
13061 default argument. */
13063 }
13067 {
13068 tree identifier;
13069 tree default_argument;
13071 /* Look for the `<'. */
13073 /* Parse the template-parameter-list. */
13075 /* Look for the `>'. */
13077 /* Look for the `class' keyword. */
13079 /* If the next token is an ellipsis, we have a template
13080 argument pack. */
13082 {
13083 /* Consume the `...' token. */
13088 }
13089 /* If the next token is an `=', then there is a
13090 default-argument. If the next token is a `>', we are at
13091 the end of the parameter-list. If the next token is a `,',
13092 then we are at the end of this parameter. */
13096 {
13098 /* Treat invalid names as if the parameter were nameless. */
13101 }
13102 else
13105 /* Create the template parameter. */
13107 identifier);
13109 /* If the next token is an `=', then there is a
13110 default-argument. */
13112 {
13115 /* Consume the `='. */
13117 /* Parse the id-expression. */
13119 /* save token before parsing the id-expression, for error
13120 reporting */
13122 default_argument
13130 /* If the id-expression was a template-id that refers to
13131 a template-class, we already have the declaration here,
13132 so no further lookup is needed. */
13133 ;
13134 else
13135 /* Look up the name. */
13136 default_argument
13138 none_type,
13144 /* See if the default argument is valid. */
13145 default_argument
13148 /* Template parameter packs cannot have default
13149 arguments. */
13151 {
13154 "template parameter pack %qD cannot "
13156 identifier);
13157 else
13161 }
13163 }
13164 else
13167 /* Create the combined representation of the parameter and the
13168 default argument. */
13170 }
13176 }
13179 }
13181 /* Parse a template-id.
13183 template-id:
13184 template-name < template-argument-list [opt] >
13186 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13187 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13188 returned. Otherwise, if the template-name names a function, or set
13189 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13190 names a class, returns a TYPE_DECL for the specialization.
13192 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13193 uninstantiated templates. */
13195 static tree
13201 {
13203 tree templ;
13204 tree arguments;
13205 tree template_id;
13212 /* If the next token corresponds to a template-id, there is no need
13213 to reparse it. */
13216 {
13219 /* Get the stored value. */
13221 /* Perform any access checks that were deferred. */
13224 {
13229 tf_warning_or_error);
13230 }
13231 /* Return the stored value. */
13233 }
13235 /* Avoid performing name lookup if there is no possibility of
13236 finding a template-id. */
13239 && !cp_parser_nth_token_starts_template_argument_list_p
13241 {
13244 }
13246 /* Remember where the template-id starts. */
13252 /* Parse the template-name. */
13255 check_dependency_p,
13256 is_declaration,
13257 tag_type,
13260 {
13263 }
13265 /* If we find the sequence `[:' after a template-name, it's probably
13266 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13267 parse correctly the argument list. */
13274 {
13276 /* Change `:' into `::'. */
13278 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13279 CPP_LESS. */
13282 /* Parse the arguments. */
13285 {
13286 /* If we couldn't parse an argument list, then we revert our changes
13287 and return simply an error. Maybe this is not a template-id
13288 after all. */
13293 }
13294 /* Otherwise, emit an error about the invalid digraph, but continue
13295 parsing because we got our argument list. */
13298 {
13301 "%<<:%> is an alternate spelling for %<[%>."
13304 {
13306 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13309 }
13310 }
13311 }
13312 else
13313 {
13314 /* Look for the `<' that starts the template-argument-list. */
13316 {
13319 }
13320 /* Parse the arguments. */
13322 }
13324 /* Build a representation of the specialization. */
13327 TEMPLATE_ID_EXPR,
13331 {
13333 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13334 template (rather than some instantiation thereof) only if
13335 is not nested within some other construct. For example, in
13336 "template <typename T> void f(T) { A<T>::", A<T> is just an
13337 instantiation of A. */
13340 CPP_SCOPE));
13341 template_id
13343 }
13344 else
13345 {
13346 /* If it's not a class-template or a template-template, it should be
13347 a function-template. */
13353 }
13355 /* If parsing tentatively, replace the sequence of tokens that makes
13356 up the template-id with a CPP_TEMPLATE_ID token. That way,
13357 should we re-parse the token stream, we will not have to repeat
13358 the effort required to do the parse, nor will we issue duplicate
13359 error messages about problems during instantiation of the
13360 template. */
13362 {
13365 /* Reset the contents of the START_OF_ID token. */
13367 /* Retrieve any deferred checks. Do not pop this access checks yet
13368 so the memory will not be reclaimed during token replacing below. */
13374 /* Purge all subsequent tokens. */
13377 /* ??? Can we actually assume that, if template_id ==
13378 error_mark_node, we will have issued a diagnostic to the
13379 user, as opposed to simply marking the tentative parse as
13380 failed? */
13383 }
13387 }
13389 /* Parse a template-name.
13391 template-name:
13392 identifier
13394 The standard should actually say:
13396 template-name:
13397 identifier
13398 operator-function-id
13400 A defect report has been filed about this issue.
13402 A conversion-function-id cannot be a template name because they cannot
13403 be part of a template-id. In fact, looking at this code:
13405 a.operator K<int>()
13407 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13408 It is impossible to call a templated conversion-function-id with an
13409 explicit argument list, since the only allowed template parameter is
13410 the type to which it is converting.
13412 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13413 `template' keyword, in a construction like:
13415 T::template f<3>()
13417 In that case `f' is taken to be a template-name, even though there
13418 is no way of knowing for sure.
13420 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13421 name refers to a set of overloaded functions, at least one of which
13422 is a template, or an IDENTIFIER_NODE with the name of the template,
13423 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13424 names are looked up inside uninstantiated templates. */
13426 static tree
13433 {
13434 tree identifier;
13435 tree decl;
13436 tree fns;
13439 /* If the next token is `operator', then we have either an
13440 operator-function-id or a conversion-function-id. */
13442 {
13443 /* We don't know whether we're looking at an
13444 operator-function-id or a conversion-function-id. */
13446 /* Try an operator-function-id. */
13448 /* If that didn't work, try a conversion-function-id. */
13450 {
13453 }
13454 }
13455 /* Look for the identifier. */
13456 else
13459 /* If we didn't find an identifier, we don't have a template-id. */
13463 /* If the name immediately followed the `template' keyword, then it
13464 is a template-name. However, if the next token is not `<', then
13465 we do not treat it as a template-name, since it is not being used
13466 as part of a template-id. This enables us to handle constructs
13467 like:
13469 template <typename T> struct S { S(); };
13470 template <typename T> S<T>::S();
13472 correctly. We would treat `S' as a template -- if it were `S<T>'
13473 -- but we do not if there is no `<'. */
13477 {
13478 /* In a declaration, in a dependent context, we pretend that the
13479 "template" keyword was present in order to improve error
13480 recovery. For example, given:
13482 template <typename T> void f(T::X<int>);
13484 we want to treat "X<int>" as a template-id. */
13486 && !template_keyword_p
13488 && check_dependency_p
13490 /* Do not do this for dtors (or ctors), since they never
13491 need the template keyword before their name. */
13493 {
13496 /* Explain what went wrong. */
13498 identifier);
13501 /* If parsing tentatively, find the location of the "<" token. */
13504 /* Parse the template arguments so that we can issue error
13505 messages about them. */
13508 /* Skip tokens until we find a good place from which to
13509 continue parsing. */
13514 /* If parsing tentatively, permanently remove the
13515 template argument list. That will prevent duplicate
13516 error messages from being issued about the missing
13517 "template" keyword. */
13523 }
13525 /* If the "template" keyword is present, then there is generally
13526 no point in doing name-lookup, so we just return IDENTIFIER.
13527 But, if the qualifying scope is non-dependent then we can
13528 (and must) do name-lookup normally. */
13534 }
13536 /* Look up the name. */
13538 tag_type,
13541 check_dependency_p,
13545 /* If DECL is a template, then the name was a template-name. */
13547 ;
13548 else
13549 {
13552 /* The standard does not explicitly indicate whether a name that
13553 names a set of overloaded declarations, some of which are
13554 templates, is a template-name. However, such a name should
13555 be a template-name; otherwise, there is no way to form a
13556 template-id for the overloaded templates. */
13564 {
13565 /* The name does not name a template. */
13568 }
13569 }
13571 /* If DECL is dependent, and refers to a function, then just return
13572 its name; we will look it up again during template instantiation. */
13574 {
13578 }
13581 }
13583 /* Parse a template-argument-list.
13585 template-argument-list:
13586 template-argument ... [opt]
13587 template-argument-list , template-argument ... [opt]
13589 Returns a TREE_VEC containing the arguments. */
13591 static tree
13593 {
13598 tree vec;
13605 /* Even if the template-id appears in an integral
13606 constant-expression, the contents of the argument list do
13607 not. */
13613 /* Parse the arguments. */
13614 do
13615 {
13616 tree argument;
13619 /* Consume the comma. */
13622 /* Parse the template-argument. */
13625 /* If the next token is an ellipsis, we're expanding a template
13626 argument pack. */
13628 {
13630 {
13634 }
13635 /* Consume the `...' token. */
13638 /* Make the argument into a TYPE_PACK_EXPANSION or
13639 EXPR_PACK_EXPANSION. */
13641 }
13644 {
13648 {
13651 }
13652 else
13654 }
13656 }
13669 #ifdef ENABLE_CHECKING
13671 #endif
13673 }
13675 /* Parse a template-argument.
13677 template-argument:
13678 assignment-expression
13679 type-id
13680 id-expression
13682 The representation is that of an assignment-expression, type-id, or
13683 id-expression -- except that the qualified id-expression is
13684 evaluated, so that the value returned is either a DECL or an
13685 OVERLOAD.
13687 Although the standard says "assignment-expression", it forbids
13688 throw-expressions or assignments in the template argument.
13689 Therefore, we use "conditional-expression" instead. */
13691 static tree
13693 {
13694 tree argument;
13700 cp_id_kind idk;
13702 /* There's really no way to know what we're looking at, so we just
13703 try each alternative in order.
13705 [temp.arg]
13707 In a template-argument, an ambiguity between a type-id and an
13708 expression is resolved to a type-id, regardless of the form of
13709 the corresponding template-parameter.
13711 Therefore, we try a type-id first. */
13714 /* If there was no error parsing the type-id but the next token is a
13715 '>>', our behavior depends on which dialect of C++ we're
13716 parsing. In C++98, we probably found a typo for '> >'. But there
13717 are type-id which are also valid expressions. For instance:
13719 struct X { int operator >> (int); };
13720 template <int V> struct Foo {};
13721 Foo<X () >> 5> r;
13723 Here 'X()' is a valid type-id of a function type, but the user just
13724 wanted to write the expression "X() >> 5". Thus, we remember that we
13725 found a valid type-id, but we still try to parse the argument as an
13726 expression to see what happens.
13728 In C++0x, the '>>' will be considered two separate '>'
13729 tokens. */
13733 {
13736 }
13737 else
13738 {
13739 /* If the next token isn't a `,' or a `>', then this argument wasn't
13740 really finished. This means that the argument is not a valid
13741 type-id. */
13744 /* If that worked, we're done. */
13747 }
13748 /* We're still not sure what the argument will be. */
13750 /* Try a template. */
13758 /* If the next token isn't a `,' or a `>', then this argument wasn't
13759 really finished. */
13763 {
13764 /* Figure out what is being referred to. If the id-expression
13765 was for a class template specialization, then we will have a
13766 TYPE_DECL at this point. There is no need to do name lookup
13767 at this point in that case. */
13770 none_type,
13779 }
13782 /* It must be a non-type argument. There permitted cases are given
13783 in [temp.arg.nontype]:
13785 -- an integral constant-expression of integral or enumeration
13786 type; or
13788 -- the name of a non-type template-parameter; or
13790 -- the name of an object or function with external linkage...
13792 -- the address of an object or function with external linkage...
13794 -- a pointer to member... */
13795 /* Look for a non-type template parameter. */
13797 {
13809 }
13811 /* If the next token is "&", the argument must be the address of an
13812 object or function with external linkage. */
13815 {
13818 }
13819 /* See if we might have an id-expression. */
13826 {
13829 address_p,
13836 else
13837 {
13838 tree probe;
13841 {
13844 }
13846 /* If we're in a template, we represent a qualified-id referring
13847 to a static data member as a SCOPE_REF even if the scope isn't
13848 dependent so that we can check access control later. */
13853 {
13854 /* A variable without external linkage might still be a
13855 valid constant-expression, so no error is issued here
13856 if the external-linkage check fails. */
13859 }
13861 /* All overloaded functions are allowed; if the external
13862 linkage test does not pass, an error will be issued
13863 later. */
13864 ;
13868 /* A pointer-to-member. */
13869 ;
13871 ;
13872 else
13876 {
13879 tf_warning_or_error);
13881 }
13882 }
13883 }
13884 /* If the argument started with "&", there are no other valid
13885 alternatives at this point. */
13887 {
13890 }
13892 /* If the argument wasn't successfully parsed as a type-id followed
13893 by '>>', the argument can only be a constant expression now.
13894 Otherwise, we try parsing the constant-expression tentatively,
13895 because the argument could really be a type-id. */
13907 /* We did our best to parse the argument as a non type-id, but that
13908 was the only alternative that matched (albeit with a '>' after
13909 it). We can assume it's just a typo from the user, and a
13910 diagnostic will then be issued. */
13912 }
13914 /* Parse an explicit-instantiation.
13916 explicit-instantiation:
13917 template declaration
13919 Although the standard says `declaration', what it really means is:
13921 explicit-instantiation:
13922 template decl-specifier-seq [opt] declarator [opt] ;
13924 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13925 supposed to be allowed. A defect report has been filed about this
13926 issue.
13928 GNU Extension:
13930 explicit-instantiation:
13931 storage-class-specifier template
13932 decl-specifier-seq [opt] declarator [opt] ;
13933 function-specifier template
13934 decl-specifier-seq [opt] declarator [opt] ; */
13936 static void
13938 {
13940 cp_decl_specifier_seq decl_specifiers;
13945 /* Look for an (optional) storage-class-specifier or
13946 function-specifier. */
13948 {
13949 extension_specifier
13952 extension_specifier
13955 }
13957 /* Look for the `template' keyword. */
13959 /* Let the front end know that we are processing an explicit
13960 instantiation. */
13962 /* [temp.explicit] says that we are supposed to ignore access
13963 control while processing explicit instantiation directives. */
13965 /* Parse a decl-specifier-seq. */
13967 CP_PARSER_FLAGS_OPTIONAL,
13970 /* If there was exactly one decl-specifier, and it declared a class,
13971 and there's no declarator, then we have an explicit type
13972 instantiation. */
13974 {
13975 tree type;
13979 /* Turn access control back on for names used during
13980 template instantiation. */
13985 }
13986 else
13987 {
13989 tree decl;
13991 /* Parse the declarator. */
13992 declarator
14002 {
14005 "explicit instantiation shall not use"
14009 "explicit instantiation shall not use"
14014 /* Turn access control back on for names used during
14015 template instantiation. */
14017 /* Do the explicit instantiation. */
14019 }
14020 else
14021 {
14023 /* Skip the body of the explicit instantiation. */
14025 }
14026 }
14027 /* We're done with the instantiation. */
14033 }
14035 /* Parse an explicit-specialization.
14037 explicit-specialization:
14038 template < > declaration
14040 Although the standard says `declaration', what it really means is:
14042 explicit-specialization:
14043 template <> decl-specifier [opt] init-declarator [opt] ;
14044 template <> function-definition
14045 template <> explicit-specialization
14046 template <> template-declaration */
14048 static void
14050 {
14054 /* Look for the `template' keyword. */
14056 /* Look for the `<'. */
14058 /* Look for the `>'. */
14060 /* We have processed another parameter list. */
14062 /* [temp]
14064 A template ... explicit specialization ... shall not have C
14065 linkage. */
14067 {
14069 /* Give it C++ linkage to avoid confusing other parts of the
14070 front end. */
14073 }
14074 else
14076 /* Let the front end know that we are beginning a specialization. */
14078 {
14081 }
14083 /* If the next keyword is `template', we need to figure out whether
14084 or not we're looking a template-declaration. */
14086 {
14091 else
14093 }
14094 else
14095 /* Parse the dependent declaration. */
14101 /* We're done with the specialization. */
14103 /* For the erroneous case of a template with C linkage, we pushed an
14104 implicit C++ linkage scope; exit that scope now. */
14107 /* We're done with this parameter list. */
14109 }
14111 /* Parse a type-specifier.
14113 type-specifier:
14114 simple-type-specifier
14115 class-specifier
14116 enum-specifier
14117 elaborated-type-specifier
14118 cv-qualifier
14120 GNU Extension:
14122 type-specifier:
14123 __complex__
14125 Returns a representation of the type-specifier. For a
14126 class-specifier, enum-specifier, or elaborated-type-specifier, a
14127 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14129 The parser flags FLAGS is used to control type-specifier parsing.
14131 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14132 in a decl-specifier-seq.
14134 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14135 class-specifier, enum-specifier, or elaborated-type-specifier, then
14136 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14137 if a type is declared; 2 if it is defined. Otherwise, it is set to
14138 zero.
14140 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14141 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14142 is set to FALSE. */
14144 static tree
14146 cp_parser_flags flags,
14151 {
14157 /* Assume this type-specifier does not declare a new type. */
14160 /* And that it does not specify a cv-qualifier. */
14163 /* Peek at the next token. */
14166 /* If we're looking at a keyword, we can use that to guide the
14167 production we choose. */
14170 {
14175 /* Look for the enum-specifier. */
14177 /* If that worked, we're done. */
14179 {
14184 type_spec,
14185 token,
14188 }
14189 else
14192 /* Any of these indicate either a class-specifier, or an
14193 elaborated-type-specifier. */
14200 /* Parse tentatively so that we can back up if we don't find a
14201 class-specifier. */
14203 /* Look for the class-specifier. */
14206 /* If that worked, we're done. */
14208 {
14213 type_spec,
14214 token,
14217 }
14219 /* Fall through. */
14220 elaborated_type_specifier:
14221 /* We're declaring (not defining) a class or enum. */
14225 /* Fall through. */
14227 /* Look for an elaborated-type-specifier. */
14228 type_spec
14229 = (cp_parser_elaborated_type_specifier
14232 is_declaration));
14235 type_spec,
14236 token,
14259 /* The `__complex__' keyword is a GNU extension. */
14265 }
14267 /* Handle simple keywords. */
14269 {
14271 {
14274 }
14276 }
14278 /* If we do not already have a type-specifier, assume we are looking
14279 at a simple-type-specifier. */
14281 decl_specs,
14282 flags);
14284 /* If we didn't find a type-specifier, and a type-specifier was not
14285 optional in this context, issue an error message. */
14287 {
14290 }
14293 }
14295 /* Parse a simple-type-specifier.
14297 simple-type-specifier:
14298 :: [opt] nested-name-specifier [opt] type-name
14299 :: [opt] nested-name-specifier template template-id
14300 char
14301 wchar_t
14302 bool
14303 short
14304 int
14305 long
14306 signed
14307 unsigned
14308 float
14309 double
14310 void
14312 C++0x Extension:
14314 simple-type-specifier:
14315 auto
14316 decltype ( expression )
14317 char16_t
14318 char32_t
14319 __underlying_type ( type-id )
14321 GNU Extension:
14323 simple-type-specifier:
14324 __int128
14325 __typeof__ unary-expression
14326 __typeof__ ( type-id )
14327 __typeof__ ( type-id ) { initializer-list , [opt] }
14329 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14330 appropriately updated. */
14332 static tree
14335 cp_parser_flags flags)
14336 {
14340 /* Peek at the next token. */
14343 /* If we're looking at a keyword, things are easy. */
14345 {
14408 /* Since DR 743, decltype can either be a simple-type-specifier by
14409 itself or begin a nested-name-specifier. Parsing it will replace
14410 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14411 handling below decide what to do. */
14417 /* Consume the `typeof' token. */
14419 /* Parse the operand to `typeof'. */
14421 /* If it is not already a TYPE, take its type. */
14427 token,
14436 token,
14446 token,
14451 }
14453 /* If token is an already-parsed decltype not followed by ::,
14454 it's a simple-type-specifier. */
14457 {
14461 token,
14465 }
14467 /* If the type-specifier was for a built-in type, we're done. */
14469 {
14470 /* Record the type. */
14477 type,
14478 token,
14483 /* Consume the token. */
14486 /* There is no valid C++ program where a non-template type is
14487 followed by a "<". That usually indicates that the user thought
14488 that the type was a template. */
14493 }
14495 /* The type-specifier must be a user-defined type. */
14497 {
14501 /* Don't gobble tokens or issue error messages if this is an
14502 optional type-specifier. */
14506 /* Look for the optional `::' operator. */
14507 global_p
14511 /* Look for the nested-name specifier. */
14512 qualified_p
14520 /* If we have seen a nested-name-specifier, and the next token
14521 is `template', then we are using the template-id production. */
14524 {
14525 /* Look for the template-id. */
14529 none_type,
14531 /* If the template-id did not name a type, we are out of
14532 luck. */
14534 {
14537 }
14538 }
14539 /* Otherwise, look for a type-name. */
14540 else
14542 /* Keep track of all name-lookups performed in class scopes. */
14544 && !global_p
14545 && !qualified_p
14549 /* If it didn't work out, we don't have a TYPE. */
14555 token,
14557 }
14559 /* If we didn't get a type-name, issue an error message. */
14561 {
14564 }
14567 {
14568 /* See if TYPE is an Objective-C type, and if so, parse and
14569 accept any protocol references following it. Do this before
14570 the cp_parser_check_for_invalid_template_id() call, because
14571 Objective-C types can be followed by '<...>' which would
14572 enclose protocol names rather than template arguments, and so
14573 everything is fine. */
14576 {
14580 /* Clobber the "unqualified" type previously entered into
14581 DECL_SPECS with the new, improved protocol-qualified version. */
14586 }
14588 /* There is no valid C++ program where a non-template type is
14589 followed by a "<". That usually indicates that the user
14590 thought that the type was a template. */
14592 none_type,
14594 }
14597 }
14599 /* Parse a type-name.
14601 type-name:
14602 class-name
14603 enum-name
14604 typedef-name
14605 simple-template-id [in c++0x]
14607 enum-name:
14608 identifier
14610 typedef-name:
14611 identifier
14613 Returns a TYPE_DECL for the type. */
14615 static tree
14617 {
14618 tree type_decl;
14620 /* We can't know yet whether it is a class-name or not. */
14622 /* Try a class-name. */
14626 none_type,
14630 /* If it's not a class-name, keep looking. */
14632 {
14634 /* It must be a typedef-name or an enum-name. */
14638 /* It is either a simple-template-id representing an
14639 instantiation of an alias template... */
14643 none_type,
14645 /* Note that this must be an instantiation of an alias template
14646 because [temp.names]/6 says:
14648 A template-id that names an alias template specialization
14649 is a type-name.
14651 Whereas [temp.names]/7 says:
14653 A simple-template-id that names a class template
14654 specialization is a class-name. */
14659 else
14663 /* ... Or a typedef-name or an enum-name. */
14665 }
14668 }
14670 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14672 enum-name:
14673 identifier
14675 typedef-name:
14676 identifier
14678 Returns a TYPE_DECL for the type. */
14680 static tree
14682 {
14683 tree type_decl;
14684 tree identifier;
14691 /* Look up the type-name. */
14695 {
14699 {
14700 /* We have found a type introduced by a using
14701 declaration at class scope that refers to a dependent
14702 type.
14704 using typename :: [opt] nested-name-specifier unqualified-id ;
14705 */
14711 }
14712 }
14716 {
14717 /* See if this is an Objective-C type. */
14722 }
14724 /* Issue an error if we did not find a type-name. */
14726 /* In Objective-C, we have the complication that class names are
14727 normally type names and start declarations (eg, the
14728 "NSObject" in "NSObject *object;"), but can be used in an
14729 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14730 is an expression. So, a classname followed by a dot is not a
14731 valid type-name. */
14734 {
14739 }
14740 /* Remember that the name was used in the definition of the
14741 current class so that we can check later to see if the
14742 meaning would have been different after the class was
14743 entirely defined. */
14749 }
14751 /* Parse an elaborated-type-specifier. Note that the grammar given
14752 here incorporates the resolution to DR68.
14754 elaborated-type-specifier:
14755 class-key :: [opt] nested-name-specifier [opt] identifier
14756 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14757 enum-key :: [opt] nested-name-specifier [opt] identifier
14758 typename :: [opt] nested-name-specifier identifier
14759 typename :: [opt] nested-name-specifier template [opt]
14760 template-id
14762 GNU extension:
14764 elaborated-type-specifier:
14765 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14766 class-key attributes :: [opt] nested-name-specifier [opt]
14767 template [opt] template-id
14768 enum attributes :: [opt] nested-name-specifier [opt] identifier
14770 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14771 declared `friend'. If IS_DECLARATION is TRUE, then this
14772 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14773 something is being declared.
14775 Returns the TYPE specified. */
14777 static tree
14781 {
14783 tree identifier;
14786 tree globalscope;
14789 /* See if we're looking at the `enum' keyword. */
14791 {
14792 /* Consume the `enum' token. */
14794 /* Remember that it's an enumeration type. */
14796 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14797 enums) is used here. */
14800 {
14804 /* Consume the `struct' or `class' and parse it anyway. */
14806 }
14807 /* Parse the attributes. */
14809 }
14810 /* Or, it might be `typename'. */
14812 RID_TYPENAME))
14813 {
14814 /* Consume the `typename' token. */
14816 /* Remember that it's a `typename' type. */
14818 }
14819 /* Otherwise it must be a class-key. */
14820 else
14821 {
14825 /* Parse the attributes. */
14827 }
14829 /* Look for the `::' operator. */
14832 /* Look for the nested-name-specifier. */
14834 {
14839 is_declaration))
14841 }
14842 else
14843 /* Even though `typename' is not present, the proposed resolution
14844 to Core Issue 180 says that in `class A<T>::B', `B' should be
14845 considered a type-name, even if `A<T>' is dependent. */
14850 is_declaration);
14851 /* For everything but enumeration types, consider a template-id.
14852 For an enumeration type, consider only a plain identifier. */
14854 {
14856 tree decl;
14858 /* Allow the `template' keyword. */
14860 /* If we didn't see `template', we don't know if there's a
14861 template-id or not. */
14864 /* Parse the template-id. */
14868 tag_type,
14869 is_declaration);
14870 /* If we didn't find a template-id, look for an ordinary
14871 identifier. */
14873 ;
14874 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14875 in effect, then we must assume that, upon instantiation, the
14876 template will correspond to a class. */
14880 typename_type,
14882 /* If the `typename' keyword is in effect and DECL is not a type
14883 decl, then type is non existent. */
14885 ;
14891 }
14894 {
14899 {
14902 }
14904 /* For a `typename', we needn't call xref_tag. */
14908 identifier,
14910 /* Look up a qualified name in the usual way. */
14912 {
14913 tree decl;
14914 tree ambiguous_decls;
14917 tag_type,
14924 /* If the lookup was ambiguous, an error will already have been
14925 issued. */
14929 /* If we are parsing friend declaration, DECL may be a
14930 TEMPLATE_DECL tree node here. However, we need to check
14931 whether this TEMPLATE_DECL results in valid code. Consider
14932 the following example:
14934 namespace N {
14935 template <class T> class C {};
14936 }
14937 class X {
14938 template <class T> friend class N::C; // #1, valid code
14939 };
14940 template <class T> class Y {
14941 friend class N::C; // #2, invalid code
14942 };
14944 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14945 name lookup of `N::C'. We see that friend declaration must
14946 be template for the code to be valid. Note that
14947 processing_template_decl does not work here since it is
14948 always 1 for the above two cases. */
14950 decl = (cp_parser_maybe_treat_template_as_class
14955 {
14958 identifier,
14961 }
14964 {
14968 allow_template);
14972 }
14974 /* Forward declarations of nested types, such as
14976 class C1::C2;
14977 class C1::C2::C3;
14979 are invalid unless all components preceding the final '::'
14980 are complete. If all enclosing types are complete, these
14981 declarations become merely pointless.
14983 Invalid forward declarations of nested types are errors
14984 caught elsewhere in parsing. Those that are pointless arrive
14985 here. */
14992 }
14993 else
14994 {
14995 /* An elaborated-type-specifier sometimes introduces a new type and
14996 sometimes names an existing type. Normally, the rule is that it
14997 introduces a new type only if there is not an existing type of
14998 the same name already in scope. For example, given:
15000 struct S {};
15001 void f() { struct S s; }
15003 the `struct S' in the body of `f' is the same `struct S' as in
15004 the global scope; the existing definition is used. However, if
15005 there were no global declaration, this would introduce a new
15006 local class named `S'.
15008 An exception to this rule applies to the following code:
15010 namespace N { struct S; }
15012 Here, the elaborated-type-specifier names a new type
15013 unconditionally; even if there is already an `S' in the
15014 containing scope this declaration names a new type.
15015 This exception only applies if the elaborated-type-specifier
15016 forms the complete declaration:
15018 [class.name]
15020 A declaration consisting solely of `class-key identifier ;' is
15021 either a redeclaration of the name in the current scope or a
15022 forward declaration of the identifier as a class name. It
15023 introduces the name into the current scope.
15025 We are in this situation precisely when the next token is a `;'.
15027 An exception to the exception is that a `friend' declaration does
15028 *not* name a new type; i.e., given:
15030 struct S { friend struct T; };
15032 `T' is not a new type in the scope of `S'.
15034 Also, `new struct S' or `sizeof (struct S)' never results in the
15035 definition of a new type; a new type can only be declared in a
15036 declaration context. */
15038 tag_scope ts;
15042 /* Friends have special name lookup rules. */
15046 CPP_SEMICOLON))
15047 /* This is a `class-key identifier ;' */
15049 else
15052 template_p =
15056 /* An unqualified name was used to reference this type, so
15057 there were no qualifying templates. */
15064 }
15065 }
15070 /* Allow attributes on forward declarations of classes. */
15072 {
15082 else
15085 }
15088 {
15089 /* Indicate whether this class was declared as a `class' or as a
15090 `struct'. */
15094 }
15096 /* A "<" cannot follow an elaborated type specifier. If that
15097 happens, the user was probably trying to form a template-id. */
15102 }
15104 /* Parse an enum-specifier.
15106 enum-specifier:
15107 enum-head { enumerator-list [opt] }
15108 enum-head { enumerator-list , } [C++0x]
15110 enum-head:
15111 enum-key identifier [opt] enum-base [opt]
15112 enum-key nested-name-specifier identifier enum-base [opt]
15114 enum-key:
15115 enum
15116 enum class [C++0x]
15117 enum struct [C++0x]
15119 enum-base: [C++0x]
15120 : type-specifier-seq
15122 opaque-enum-specifier:
15123 enum-key identifier enum-base [opt] ;
15125 GNU Extensions:
15126 enum-key attributes[opt] identifier [opt] enum-base [opt]
15127 { enumerator-list [opt] }attributes[opt]
15128 enum-key attributes[opt] identifier [opt] enum-base [opt]
15129 { enumerator-list, }attributes[opt] [C++0x]
15131 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15132 if the token stream isn't an enum-specifier after all. */
15134 static tree
15136 {
15137 tree identifier;
15139 tree prev_scope;
15141 tree attributes;
15154 /* Parse tentatively so that we can back up if we don't find a
15155 enum-specifier. */
15158 /* Caller guarantees that the current token is 'enum', an identifier
15159 possibly follows, and the token after that is an opening brace.
15160 If we don't have an identifier, fabricate an anonymous name for
15161 the enumeration being defined. */
15164 /* Parse the "class" or "struct", which indicates a scoped
15165 enumeration type in C++0x. */
15168 {
15172 /* Consume the `struct' or `class' token. */
15176 }
15180 /* Clear the qualification. */
15185 /* Figure out in what scope the declaration is being placed. */
15191 nested_name_specifier
15199 {
15200 tree name;
15204 enum_type,
15209 input_location);
15211 {
15214 {
15215 /* Are template enums allowed in ISO? */
15219 /* ignore a typename reference, for it will be solved by name
15220 in start_enum. */
15222 }
15223 }
15226 else
15229 }
15230 else
15231 {
15234 else
15235 {
15241 }
15242 }
15245 /* Check for the `:' that denotes a specified underlying type in C++0x.
15246 Note that a ':' could also indicate a bitfield width, however. */
15248 {
15249 cp_decl_specifier_seq type_specifiers;
15251 /* Consume the `:'. */
15254 /* Parse the type-specifier-seq. */
15259 /* At this point this is surely not elaborated type specifier. */
15268 /* If that didn't work, stop. */
15270 {
15275 }
15276 }
15278 /* Look for the `{' but don't consume it yet. */
15280 {
15282 {
15285 {
15288 }
15289 }
15290 /* An opaque-enum-specifier must have a ';' here. */
15293 {
15296 {
15299 }
15300 }
15301 }
15307 {
15309 {
15313 }
15315 {
15317 }
15318 }
15320 /* Issue an error message if type-definitions are forbidden here. */
15323 else
15324 /* Create the new type. We do this before consuming the opening
15325 brace so the enum will be recorded as being on the line of its
15326 tag (or the 'enum' keyword, if there is no tag). */
15330 /* If the next token is not '{' it is an opaque-enum-specifier or an
15331 elaborated-type-specifier. */
15333 {
15337 {
15338 /* The following catches invalid code such as:
15339 enum class S<int>::E { A, B, C }; */
15346 /* If that scope does not contain the scope in which the
15347 class was originally declared, the program is invalid. */
15349 {
15352 "declaration of %qD in namespace %qD which does not "
15355 else
15360 }
15361 }
15366 /* Consume the opening brace. */
15373 {
15377 }
15378 else
15379 {
15384 }
15388 /* If the next token is not '}', then there are some enumerators. */
15390 {
15394 }
15395 else
15398 /* Consume the final '}'. */
15404 }
15405 else
15406 {
15407 /* If a ';' follows, then it is an opaque-enum-specifier
15408 and additional restrictions apply. */
15410 {
15417 }
15418 }
15420 /* Look for trailing attributes to apply to this enumeration, and
15421 apply them if appropriate. */
15423 {
15427 trailing_attr,
15429 }
15431 /* Finish up the enumeration. */
15433 {
15438 }
15441 {
15443 {
15446 }
15448 {
15450 }
15451 }
15452 out:
15455 }
15457 /* Parse an enumerator-list. The enumerators all have the indicated
15458 TYPE.
15460 enumerator-list:
15461 enumerator-definition
15462 enumerator-list , enumerator-definition */
15464 static void
15466 {
15468 {
15469 /* Parse an enumerator-definition. */
15472 /* If the next token is not a ',', we've reached the end of
15473 the list. */
15476 /* Otherwise, consume the `,' and keep going. */
15478 /* If the next token is a `}', there is a trailing comma. */
15480 {
15485 }
15486 }
15487 }
15489 /* Parse an enumerator-definition. The enumerator has the indicated
15490 TYPE.
15492 enumerator-definition:
15493 enumerator
15494 enumerator = constant-expression
15496 enumerator:
15497 identifier */
15499 static void
15501 {
15502 tree identifier;
15503 tree value;
15504 location_t loc;
15506 /* Save the input location because we are interested in the location
15507 of the identifier and not the location of the explicit value. */
15510 /* Look for the identifier. */
15515 /* If the next token is an '=', then there is an explicit value. */
15517 {
15518 /* Consume the `=' token. */
15520 /* Parse the value. */
15523 NULL);
15524 }
15525 else
15528 /* If we are processing a template, make sure the initializer of the
15529 enumerator doesn't contain any bare template parameter pack. */
15533 /* integral_constant_value will pull out this expression, so make sure
15534 it's folded as appropriate. */
15537 /* Create the enumerator. */
15539 }
15541 /* Parse a namespace-name.
15543 namespace-name:
15544 original-namespace-name
15545 namespace-alias
15547 Returns the NAMESPACE_DECL for the namespace. */
15549 static tree
15551 {
15552 tree identifier;
15553 tree namespace_decl;
15557 /* Get the name of the namespace. */
15562 /* Look up the identifier in the currently active scope. Look only
15563 for namespaces, due to:
15565 [basic.lookup.udir]
15567 When looking up a namespace-name in a using-directive or alias
15568 definition, only namespace names are considered.
15570 And:
15572 [basic.lookup.qual]
15574 During the lookup of a name preceding the :: scope resolution
15575 operator, object, function, and enumerator names are ignored.
15577 (Note that cp_parser_qualifying_entity only calls this
15578 function if the token after the name is the scope resolution
15579 operator.) */
15581 none_type,
15587 /* If it's not a namespace, issue an error. */
15590 {
15595 }
15598 }
15600 /* Parse a namespace-definition.
15602 namespace-definition:
15603 named-namespace-definition
15604 unnamed-namespace-definition
15606 named-namespace-definition:
15607 original-namespace-definition
15608 extension-namespace-definition
15610 original-namespace-definition:
15611 namespace identifier { namespace-body }
15613 extension-namespace-definition:
15614 namespace original-namespace-name { namespace-body }
15616 unnamed-namespace-definition:
15617 namespace { namespace-body } */
15619 static void
15621 {
15628 {
15632 }
15633 else
15636 /* Look for the `namespace' keyword. */
15639 /* Get the name of the namespace. We do not attempt to distinguish
15640 between an original-namespace-definition and an
15641 extension-namespace-definition at this point. The semantic
15642 analysis routines are responsible for that. */
15645 else
15648 /* Parse any specified attributes. */
15651 /* Look for the `{' to start the namespace. */
15653 /* Start the namespace. */
15656 /* "inline namespace" is equivalent to a stub namespace definition
15657 followed by a strong using directive. */
15659 {
15661 /* Set up namespace association. */
15665 /* Import the contents of the inline namespace. */
15669 }
15673 /* Parse the body of the namespace. */
15679 /* Finish the namespace. */
15681 /* Look for the final `}'. */
15683 }
15685 /* Parse a namespace-body.
15687 namespace-body:
15688 declaration-seq [opt] */
15690 static void
15692 {
15694 }
15696 /* Parse a namespace-alias-definition.
15698 namespace-alias-definition:
15699 namespace identifier = qualified-namespace-specifier ; */
15701 static void
15703 {
15704 tree identifier;
15705 tree namespace_specifier;
15709 /* Look for the `namespace' keyword. */
15711 /* Look for the identifier. */
15715 /* Look for the `=' token. */
15718 {
15720 /* Skip the definition. */
15725 }
15727 /* Look for the qualified-namespace-specifier. */
15728 namespace_specifier
15730 /* Look for the `;' token. */
15733 /* Register the alias in the symbol table. */
15735 }
15737 /* Parse a qualified-namespace-specifier.
15739 qualified-namespace-specifier:
15740 :: [opt] nested-name-specifier [opt] namespace-name
15742 Returns a NAMESPACE_DECL corresponding to the specified
15743 namespace. */
15745 static tree
15747 {
15748 /* Look for the optional `::'. */
15752 /* Look for the optional nested-name-specifier. */
15760 }
15762 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15763 access declaration.
15765 using-declaration:
15766 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15767 using :: unqualified-id ;
15769 access-declaration:
15770 qualified-id ;
15772 */
15774 static bool
15777 {
15781 tree decl;
15782 tree identifier;
15783 tree qscope;
15788 {
15791 }
15792 else
15793 {
15794 /* Look for the `using' keyword. */
15797 /* Peek at the next token. */
15799 /* See if it's `typename'. */
15801 {
15802 /* Remember that we've seen it. */
15804 /* Consume the `typename' token. */
15806 }
15807 }
15809 /* Look for the optional global scope qualification. */
15810 global_scope_p
15815 /* If we saw `typename', or didn't see `::', then there must be a
15816 nested-name-specifier present. */
15822 /* Otherwise, we could be in either of the two productions. In that
15823 case, treat the nested-name-specifier as optional. */
15824 else
15834 /* Something has already gone wrong; there's no need to parse
15835 further. Since an error has occurred, the return value of
15836 cp_parser_parse_definitely will be false, as required. */
15840 /* Parse the unqualified-id. */
15848 {
15853 }
15855 /* The function we call to handle a using-declaration is different
15856 depending on what scope we are in. */
15858 ;
15861 /* [namespace.udecl]
15863 A using declaration shall not name a template-id. */
15866 else
15867 {
15869 {
15870 /* Create the USING_DECL. */
15878 else
15879 /* Add it to the list of members in this class. */
15881 }
15882 else
15883 {
15885 identifier,
15895 else
15897 }
15898 }
15900 /* Look for the final `;'. */
15905 "access declarations are deprecated "
15906 "in favour of using-declarations; "
15910 }
15912 /* Parse an alias-declaration.
15914 alias-declaration:
15915 using identifier attribute-specifier-seq [opt] = type-id */
15917 static tree
15919 {
15921 location_t id_location;
15923 cp_decl_specifier_seq decl_specs;
15927 /* Look for the `using' keyword. */
15928 cp_token *using_token
15950 /* Now we are going to parse the type-id of the declaration. */
15952 /*
15953 [dcl.type]/3 says:
15955 "A type-specifier-seq shall not define a class or enumeration
15956 unless it appears in the type-id of an alias-declaration (7.1.3) that
15957 is not the declaration of a template-declaration."
15959 In other words, if we currently are in an alias template, the
15960 type-id should not define a type.
15962 So let's set parser->type_definition_forbidden_message in that
15963 case; cp_parser_check_type_definition (called by
15964 cp_parser_class_specifier) will then emit an error if a type is
15965 defined in the type-id. */
15967 {
15971 }
15975 /* Restore the error message if need be. */
15980 {
15983 }
15988 {
15991 }
15993 /* A typedef-name can also be introduced by an alias-declaration. The
15994 identifier following the using keyword becomes a typedef-name. It has
15995 the same semantics as if it were introduced by the typedef
15996 specifier. In particular, it does not define a new type and it shall
15997 not appear in the type-id. */
16002 {
16005 ds_attribute,
16006 attrs_token);
16007 }
16009 ds_typedef,
16010 using_token);
16012 ds_alias,
16013 using_token);
16022 else
16033 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16034 added into the symbol table; otherwise, return the TYPE_DECL. */
16038 {
16042 }
16045 }
16047 /* Parse a using-directive.
16049 using-directive:
16050 using namespace :: [opt] nested-name-specifier [opt]
16051 namespace-name ; */
16053 static void
16055 {
16056 tree namespace_decl;
16057 tree attribs;
16059 /* Look for the `using' keyword. */
16061 /* And the `namespace' keyword. */
16063 /* Look for the optional `::' operator. */
16065 /* And the optional nested-name-specifier. */
16071 /* Get the namespace being used. */
16073 /* And any specified attributes. */
16075 /* Update the symbol table. */
16077 /* Look for the final `;'. */
16079 }
16081 /* Parse an asm-definition.
16083 asm-definition:
16084 asm ( string-literal ) ;
16086 GNU Extension:
16088 asm-definition:
16089 asm volatile [opt] ( string-literal ) ;
16090 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16091 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16092 : asm-operand-list [opt] ) ;
16093 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16094 : asm-operand-list [opt]
16095 : asm-clobber-list [opt] ) ;
16096 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16097 : asm-clobber-list [opt]
16098 : asm-goto-list ) ; */
16100 static void
16102 {
16103 tree string;
16108 tree asm_stmt;
16116 /* Look for the `asm' keyword. */
16118 /* See if the next token is `volatile'. */
16121 {
16122 /* Remember that we saw the `volatile' keyword. */
16124 /* Consume the token. */
16126 }
16130 {
16131 /* Remember that we saw the `goto' keyword. */
16133 /* Consume the token. */
16135 }
16136 /* Look for the opening `('. */
16139 /* Look for the string. */
16142 {
16146 }
16148 /* If we're allowing GNU extensions, check for the extended assembly
16149 syntax. Unfortunately, the `:' tokens need not be separated by
16150 a space in C, and so, for compatibility, we tolerate that here
16151 too. Doing that means that we have to treat the `::' operator as
16152 two `:' tokens. */
16157 {
16162 /* The extended syntax was used. */
16165 /* Look for outputs. */
16167 {
16168 /* Consume the `:'. */
16170 /* Parse the output-operands. */
16172 CPP_COLON)
16174 CPP_SCOPE)
16176 CPP_CLOSE_PAREN)
16182 }
16183 /* If the next token is `::', there are no outputs, and the
16184 next token is the beginning of the inputs. */
16186 /* The inputs are coming next. */
16189 /* Look for inputs. */
16192 {
16193 /* Consume the `:' or `::'. */
16195 /* Parse the output-operands. */
16197 CPP_COLON)
16199 CPP_SCOPE)
16201 CPP_CLOSE_PAREN))
16206 }
16208 /* The clobbers are coming next. */
16211 /* Look for clobbers. */
16214 {
16216 /* Consume the `:' or `::'. */
16218 /* Parse the clobbers. */
16220 CPP_COLON)
16222 CPP_CLOSE_PAREN))
16224 }
16227 /* The labels are coming next. */
16230 /* Look for labels. */
16233 {
16235 /* Consume the `:' or `::'. */
16237 /* Parse the labels. */
16239 }
16243 }
16247 /* Look for the closing `)'. */
16255 {
16256 /* Create the ASM_EXPR. */
16258 {
16261 /* If the extended syntax was not used, mark the ASM_EXPR. */
16263 {
16269 }
16270 }
16271 else
16273 }
16274 }
16276 /* Declarators [gram.dcl.decl] */
16278 /* Parse an init-declarator.
16280 init-declarator:
16281 declarator initializer [opt]
16283 GNU Extension:
16285 init-declarator:
16286 declarator asm-specification [opt] attributes [opt] initializer [opt]
16288 function-definition:
16289 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16290 function-body
16291 decl-specifier-seq [opt] declarator function-try-block
16293 GNU Extension:
16295 function-definition:
16296 __extension__ function-definition
16298 TM Extension:
16300 function-definition:
16301 decl-specifier-seq [opt] declarator function-transaction-block
16303 The DECL_SPECIFIERS apply to this declarator. Returns a
16304 representation of the entity declared. If MEMBER_P is TRUE, then
16305 this declarator appears in a class scope. The new DECL created by
16306 this declarator is returned.
16308 The CHECKS are access checks that should be performed once we know
16309 what entity is being declared (and, therefore, what classes have
16310 befriended it).
16312 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16313 for a function-definition here as well. If the declarator is a
16314 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16315 be TRUE upon return. By that point, the function-definition will
16316 have been completely parsed.
16318 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16319 is FALSE.
16321 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16322 parsed declaration if it is an uninitialized single declarator not followed
16323 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16324 if present, will not be consumed. If returned, this declarator will be
16325 created with SD_INITIALIZED but will not call cp_finish_decl. */
16327 static tree
16336 {
16340 tree prefix_attributes;
16342 tree asm_specification;
16343 tree initializer;
16345 tree scope;
16347 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16348 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16349 "(...)". */
16359 /* Gather the attributes that were provided with the
16360 decl-specifiers. */
16363 /* Assume that this is not the declarator for a function
16364 definition. */
16368 /* Default arguments are only permitted for function parameters. */
16372 /* Defer access checks while parsing the declarator; we cannot know
16373 what names are accessible until we know what is being
16374 declared. */
16377 /* Parse the declarator. */
16379 declarator
16383 member_p);
16384 /* Gather up the deferred checks. */
16389 /* If the DECLARATOR was erroneous, there's no need to go
16390 further. */
16394 /* Check that the number of template-parameter-lists is OK. */
16404 /* Figure out what scope the entity declared by the DECLARATOR is
16405 located in. `grokdeclarator' sometimes changes the scope, so
16406 we compute it now. */
16409 /* Perform any lookups in the declared type which were thought to be
16410 dependent, but are not in the scope of the declarator. */
16411 decl_specifiers->type
16414 /* If we're allowing GNU extensions, look for an
16415 asm-specification. */
16417 {
16418 /* Look for an asm-specification. */
16421 }
16422 else
16425 /* Look for attributes. */
16429 /* Peek at the next token. */
16433 {
16434 /* Check to see if the token indicates the start of a
16435 function-definition. */
16437 {
16439 {
16440 /* If a function-definition should not appear here, issue an
16441 error message. */
16445 }
16447 location_t func_brace_location
16450 /* Neither attributes nor an asm-specification are allowed
16451 on a function-definition. */
16454 "an asm-specification is not allowed "
16458 "attributes are not allowed "
16460 /* This is a function-definition. */
16463 /* Parse the function definition. */
16466 decl_specifiers,
16467 declarator,
16468 prefix_attributes);
16469 else
16470 decl =
16471 (cp_parser_function_definition_from_specifiers_and_declarator
16475 {
16476 /* This is where the prologue starts... */
16479 }
16482 }
16483 }
16485 /* [dcl.dcl]
16487 Only in function declarations for constructors, destructors, and
16488 type conversions can the decl-specifier-seq be omitted.
16490 We explicitly postpone this check past the point where we handle
16491 function-definitions because we tolerate function-definitions
16492 that are missing their return types in some modes. */
16494 {
16498 }
16500 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16504 {
16512 {
16518 }
16519 }
16520 else
16521 {
16522 /* If the init-declarator isn't initialized and isn't followed by a
16523 `,' or `;', it's not a valid init-declarator. */
16526 {
16529 else
16530 {
16533 }
16534 }
16537 }
16539 /* Because start_decl has side-effects, we should only call it if we
16540 know we're going ahead. By this point, we know that we cannot
16541 possibly be looking at any other construct. */
16544 /* If the decl specifiers were bad, issue an error now that we're
16545 sure this was intended to be a declarator. Then continue
16546 declaring the variable(s), as int, to try to cut down on further
16547 errors. */
16550 {
16553 }
16555 /* Check to see whether or not this declaration is a friend. */
16558 /* Enter the newly declared entry in the symbol table. If we're
16559 processing a declaration in a class-specifier, we wait until
16560 after processing the initializer. */
16562 {
16569 /* Adjust location of decl if declarator->id_loc is more appropriate:
16570 set, and decl wasn't merged with another decl, in which case its
16571 location would be different from input_location, and more accurate. */
16576 }
16578 /* Enter the SCOPE. That way unqualified names appearing in the
16579 initializer will be looked up in SCOPE. */
16582 /* Perform deferred access control checks, now that we know in which
16583 SCOPE the declared entity resides. */
16585 {
16588 /* If the entity being declared is a function, pretend that we
16589 are in its scope. If it is a `friend', it may have access to
16590 things that would not otherwise be accessible. */
16592 {
16595 }
16597 /* Perform access checks for template parameters. */
16600 /* Perform the access control checks for the declarator and the
16601 decl-specifiers. */
16604 /* Restore the saved value. */
16607 }
16609 /* Parse the initializer. */
16614 {
16616 {
16620 else
16621 {
16622 /* If the declaration was erroneous, we don't really
16623 know what the user intended, so just silently
16624 consume the initializer. */
16632 }
16633 }
16634 else
16635 {
16636 /* We want to record the extra mangling scope for in-class
16637 initializers of class members and initializers of static data
16638 member templates. The former involves deferring
16639 parsing of the initializer until end of class as with default
16640 arguments. So right here we only handle the latter. */
16650 }
16651 }
16653 /* The old parser allows attributes to appear after a parenthesized
16654 initializer. Mark Mitchell proposed removing this functionality
16655 on the GCC mailing lists on 2002-08-13. This parser accepts the
16656 attributes -- but ignores them. */
16663 /* For an in-class declaration, use `grokfield' to create the
16664 declaration. */
16666 {
16668 {
16671 }
16679 }
16681 /* Finish processing the declaration. But, skip member
16682 declarations. */
16684 {
16687 asm_specification,
16688 /* If the initializer is in parentheses, then this is
16689 a direct-initialization, which means that an
16690 `explicit' constructor is OK. Otherwise, an
16691 `explicit' constructor cannot be used. */
16694 }
16697 /* Core issue #226 (C++0x only): A default template-argument
16698 shall not be specified in a friend class template
16699 declaration. */
16708 {
16711 else
16713 }
16716 }
16718 /* Parse a declarator.
16720 declarator:
16721 direct-declarator
16722 ptr-operator declarator
16724 abstract-declarator:
16725 ptr-operator abstract-declarator [opt]
16726 direct-abstract-declarator
16728 GNU Extensions:
16730 declarator:
16731 attributes [opt] direct-declarator
16732 attributes [opt] ptr-operator declarator
16734 abstract-declarator:
16735 attributes [opt] ptr-operator abstract-declarator [opt]
16736 attributes [opt] direct-abstract-declarator
16738 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16739 detect constructor, destructor or conversion operators. It is set
16740 to -1 if the declarator is a name, and +1 if it is a
16741 function. Otherwise it is set to zero. Usually you just want to
16742 test for >0, but internally the negative value is used.
16744 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16745 a decl-specifier-seq unless it declares a constructor, destructor,
16746 or conversion. It might seem that we could check this condition in
16747 semantic analysis, rather than parsing, but that makes it difficult
16748 to handle something like `f()'. We want to notice that there are
16749 no decl-specifiers, and therefore realize that this is an
16750 expression, not a declaration.)
16752 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16753 the declarator is a direct-declarator of the form "(...)".
16755 MEMBER_P is true iff this declarator is a member-declarator. */
16759 cp_parser_declarator_kind dcl_kind,
16763 {
16766 cp_cv_quals cv_quals;
16767 tree class_type;
16770 /* Assume this is not a constructor, destructor, or type-conversion
16771 operator. */
16778 /* Check for the ptr-operator production. */
16780 /* Parse the ptr-operator. */
16786 /* If that worked, then we have a ptr-operator. */
16788 {
16789 /* If a ptr-operator was found, then this declarator was not
16790 parenthesized. */
16793 /* The dependent declarator is optional if we are parsing an
16794 abstract-declarator. */
16798 /* Parse the dependent declarator. */
16804 /* If we are parsing an abstract-declarator, we must handle the
16805 case where the dependent declarator is absent. */
16810 declarator = cp_parser_make_indirect_declarator
16812 }
16813 /* Everything else is a direct-declarator. */
16814 else
16815 {
16818 CPP_OPEN_PAREN);
16820 ctor_dtor_or_conv_p,
16821 member_p);
16822 }
16827 }
16829 /* Parse a direct-declarator or direct-abstract-declarator.
16831 direct-declarator:
16832 declarator-id
16833 direct-declarator ( parameter-declaration-clause )
16834 cv-qualifier-seq [opt]
16835 ref-qualifier [opt]
16836 exception-specification [opt]
16837 direct-declarator [ constant-expression [opt] ]
16838 ( declarator )
16840 direct-abstract-declarator:
16841 direct-abstract-declarator [opt]
16842 ( parameter-declaration-clause )
16843 cv-qualifier-seq [opt]
16844 ref-qualifier [opt]
16845 exception-specification [opt]
16846 direct-abstract-declarator [opt] [ constant-expression [opt] ]
16847 ( abstract-declarator )
16849 Returns a representation of the declarator. DCL_KIND is
16850 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
16851 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
16852 we are parsing a direct-declarator. It is
16853 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
16854 of ambiguity we prefer an abstract declarator, as per
16855 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
16856 cp_parser_declarator. */
16860 cp_parser_declarator_kind dcl_kind,
16863 {
16873 {
16874 /* Peek at the next token. */
16877 {
16878 /* This is either a parameter-declaration-clause, or a
16879 parenthesized declarator. When we know we are parsing a
16880 named declarator, it must be a parenthesized declarator
16881 if FIRST is true. For instance, `(int)' is a
16882 parameter-declaration-clause, with an omitted
16883 direct-abstract-declarator. But `((*))', is a
16884 parenthesized abstract declarator. Finally, when T is a
16885 template parameter `(T)' is a
16886 parameter-declaration-clause, and not a parenthesized
16887 named declarator.
16889 We first try and parse a parameter-declaration-clause,
16890 and then try a nested declarator (if FIRST is true).
16892 It is not an error for it not to be a
16893 parameter-declaration-clause, even when FIRST is
16894 false. Consider,
16896 int i (int);
16897 int i (3);
16899 The first is the declaration of a function while the
16900 second is the definition of a variable, including its
16901 initializer.
16903 Having seen only the parenthesis, we cannot know which of
16904 these two alternatives should be selected. Even more
16905 complex are examples like:
16907 int i (int (a));
16908 int i (int (3));
16910 The former is a function-declaration; the latter is a
16911 variable initialization.
16913 Thus again, we try a parameter-declaration-clause, and if
16914 that fails, we back out and return. */
16917 {
16918 tree params;
16922 /* In a member-declarator, the only valid interpretation
16923 of a parenthesis is the start of a
16924 parameter-declaration-clause. (It is invalid to
16925 initialize a static data member with a parenthesized
16926 initializer; only the "=" form of initialization is
16927 permitted.) */
16931 /* Consume the `('. */
16934 {
16935 /* If this is going to be an abstract declarator, we're
16936 in a declarator and we can't have default args. */
16939 }
16941 /* Inside the function parameter list, surrounding
16942 template-parameter-lists do not apply. */
16943 saved_num_template_parameter_lists
16949 /* Parse the parameter-declaration-clause. */
16952 /* Restore saved template parameter lists accounting for implicit
16953 template parameters. */
16954 parser->num_template_parameter_lists
16957 /* Consume the `)'. */
16960 /* If all went well, parse the cv-qualifier-seq,
16961 ref-qualifier and the exception-specification. */
16963 {
16964 cp_cv_quals cv_quals;
16965 cp_virt_specifiers virt_specifiers;
16966 cp_ref_qualifier ref_qual;
16967 tree exception_specification;
16968 tree late_return;
16969 tree attrs;
16979 /* Parse the cv-qualifier-seq. */
16981 /* Parse the ref-qualifier. */
16983 /* And the exception-specification. */
16984 exception_specification
16989 late_return = (cp_parser_late_return_type_opt
16994 /* Parse the virt-specifier-seq. */
16997 /* Create the function-declarator. */
16999 params,
17000 cv_quals,
17001 virt_specifiers,
17002 ref_qual,
17003 exception_specification,
17004 late_return);
17006 /* Any subsequent parameter lists are to do with
17007 return type, so are not those of the declared
17008 function. */
17010 }
17012 /* Remove the function parms from scope. */
17016 /* Repeat the main loop. */
17018 }
17020 /* If this is the first, we can try a parenthesized
17021 declarator. */
17023 {
17029 /* Consume the `('. */
17031 /* Parse the nested declarator. */
17034 declarator
17037 member_p);
17040 /* Expect a `)'. */
17047 }
17048 /* Otherwise, we must be done. */
17049 else
17051 }
17055 {
17056 /* Parse an array-declarator. */
17065 /* Consume the `['. */
17067 /* Peek at the next token. */
17069 /* If the next token is `]', then there is no
17070 constant-expression. */
17072 {
17074 bounds
17084 {
17085 /* Normally, the array bound must be an integral constant
17086 expression. However, as an extension, we allow VLAs
17087 in function scopes as long as they aren't part of a
17088 parameter declaration. */
17092 }
17094 {
17095 /* Remember this wasn't a constant-expression. */
17098 }
17099 }
17100 else
17102 /* Look for the closing `]'. */
17104 {
17107 }
17112 }
17114 {
17115 {
17116 tree qualifying_scope;
17117 tree unqualified_name;
17118 tree attrs;
17119 special_function_kind sfk;
17124 /* Parse a declarator-id */
17127 {
17130 /* If we see an ellipsis, we should be looking at a
17131 parameter pack. */
17133 {
17134 /* Consume the `...' */
17138 }
17139 }
17142 unqualified_name
17146 {
17150 {
17151 /* Check whether an error occurred. */
17154 /* We already consumed the ellipsis to mark a
17155 parameter pack, but we have no way to report it,
17156 so abort the tentative parse. We will be exiting
17157 immediately anyway. */
17159 }
17160 else
17166 && (qualifying_scope
17168 {
17171 }
17172 }
17177 {
17182 }
17188 {
17189 /* In the declaration of a member of a template class
17190 outside of the class itself, the SCOPE will sometimes
17191 be a TYPENAME_TYPE. For example, given:
17193 template <typename T>
17194 int S<T>::R::i = 3;
17196 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17197 this context, we must resolve S<T>::R to an ordinary
17198 type, rather than a typename type.
17200 The reason we normally avoid resolving TYPENAME_TYPEs
17201 is that a specialization of `S' might render
17202 `S<T>::R' not a type. However, if `S' is
17203 specialized, then this `i' will not be used, so there
17204 is no harm in resolving the types here. */
17205 tree type;
17207 /* Resolve the TYPENAME_TYPE. */
17210 /* If that failed, the declarator is invalid. */
17212 {
17215 "cannot define member of dependent typedef "
17217 else
17222 }
17224 }
17229 {
17230 tree class_type;
17235 else
17239 {
17242 {
17245 {
17249 "use %<%T::%D%> instead of %<%T::%D%> to "
17251 class_type,
17256 }
17257 else
17259 }
17260 else
17261 {
17262 /* We do not attempt to print the declarator
17263 here because we do not have enough
17264 information about its original syntactic
17265 form. */
17269 }
17270 }
17273 {
17279 for an anonymous type, even if the type
17280 got a name for linkage purposes. */
17283 class_type))
17284 {
17287 }
17295 }
17296 }
17298 unqualified_name,
17299 sfk);
17306 }
17308 handle_declarator:;
17311 {
17312 /* Any names that appear after the declarator-id for a
17313 member are looked up in the containing scope. */
17315 {
17316 /* But declarations with qualified-ids can't appear in a
17317 function. */
17320 }
17322 }
17326 /* Default args are only allowed on function
17327 declarations. */
17329 else
17333 }
17334 /* We're done. */
17335 else
17337 }
17339 /* For an abstract declarator, we might wind up with nothing at this
17340 point. That's an error; the declarator is not optional. */
17344 /* If we entered a scope, we must exit it now. */
17352 }
17354 /* Parse a ptr-operator.
17356 ptr-operator:
17357 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17358 * cv-qualifier-seq [opt]
17359 &
17360 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17361 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17363 GNU Extension:
17365 ptr-operator:
17366 & cv-qualifier-seq [opt]
17368 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17369 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17370 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17371 filled in with the TYPE containing the member. *CV_QUALS is
17372 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17373 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17374 Note that the tree codes returned by this function have nothing
17375 to do with the types of trees that will be eventually be created
17376 to represent the pointer or reference type being parsed. They are
17377 just constants with suggestive names. */
17378 static enum tree_code
17383 {
17388 /* Assume that it's not a pointer-to-member. */
17390 /* And that there are no cv-qualifiers. */
17393 /* Peek at the next token. */
17396 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17406 {
17407 /* Consume the `*', `&' or `&&'. */
17410 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17411 `&', if we are allowing GNU extensions. (The only qualifier
17412 that can legally appear after `&' is `restrict', but that is
17413 enforced during semantic analysis. */
17421 }
17422 else
17423 {
17424 /* Try the pointer-to-member case. */
17426 /* Look for the optional `::' operator. */
17429 /* Look for the nested-name specifier. */
17436 /* If we found it, and the next token is a `*', then we are
17437 indeed looking at a pointer-to-member operator. */
17440 {
17441 /* Indicate that the `*' operator was used. */
17449 else
17450 {
17451 /* The type of which the member is a member is given by the
17452 current SCOPE. */
17454 /* The next name will not be qualified. */
17458 /* Look for optional c++11 attributes. */
17462 /* Look for the optional cv-qualifier-seq. */
17464 }
17465 }
17466 /* If that didn't work we don't have a ptr-operator. */
17469 }
17472 }
17474 /* Parse an (optional) cv-qualifier-seq.
17476 cv-qualifier-seq:
17477 cv-qualifier cv-qualifier-seq [opt]
17479 cv-qualifier:
17480 const
17481 volatile
17483 GNU Extension:
17485 cv-qualifier:
17486 __restrict__
17488 Returns a bitmask representing the cv-qualifiers. */
17490 static cp_cv_quals
17492 {
17496 {
17498 cp_cv_quals cv_qualifier;
17500 /* Peek at the next token. */
17502 /* See if it's a cv-qualifier. */
17504 {
17520 }
17526 {
17529 }
17530 else
17531 {
17534 }
17535 }
17538 }
17540 /* Parse an (optional) ref-qualifier
17542 ref-qualifier:
17543 &
17544 &&
17546 Returns cp_ref_qualifier representing ref-qualifier. */
17548 static cp_ref_qualifier
17550 {
17553 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17558 {
17563 {
17575 }
17580 {
17583 }
17584 else
17585 {
17588 }
17589 }
17592 }
17594 /* Parse an (optional) virt-specifier-seq.
17596 virt-specifier-seq:
17597 virt-specifier virt-specifier-seq [opt]
17599 virt-specifier:
17600 override
17601 final
17603 Returns a bitmask representing the virt-specifiers. */
17605 static cp_virt_specifiers
17607 {
17611 {
17613 cp_virt_specifiers virt_specifier;
17615 /* Peek at the next token. */
17617 /* See if it's a virt-specifier-qualifier. */
17621 {
17624 }
17626 {
17629 }
17631 {
17633 }
17634 else
17638 {
17641 }
17642 else
17643 {
17646 }
17647 }
17649 }
17651 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
17652 is in scope even though it isn't real. */
17654 static void
17656 {
17657 tree this_parm;
17660 {
17661 /* We don't clear this between NSDMIs. Is it already what we want? */
17666 }
17669 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
17671 current_class_ref
17674 }
17676 /* Return true iff our current scope is a non-static data member
17677 initializer. */
17679 bool
17681 {
17682 /* We recognize NSDMI context by the context-less 'this' pointer set up
17683 by the function above. */
17687 }
17689 /* Parse a late-specified return type, if any. This is not a separate
17690 non-terminal, but part of a function declarator, which looks like
17692 -> trailing-type-specifier-seq abstract-declarator(opt)
17694 Returns the type indicated by the type-id.
17696 In addition to this this parses any queued up omp declare simd
17697 clauses.
17699 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
17700 function. */
17702 static tree
17704 cp_cv_quals quals)
17705 {
17709 && declarator
17712 /* Peek at the next token. */
17714 /* A late-specified return type is indicated by an initial '->'. */
17721 {
17722 /* DR 1207: 'this' is in scope in the trailing return type. */
17724 }
17727 {
17728 /* Consume the ->. */
17732 }
17735 declarator->std_attributes
17740 {
17743 }
17746 }
17748 /* Parse a declarator-id.
17750 declarator-id:
17751 id-expression
17752 :: [opt] nested-name-specifier [opt] type-name
17754 In the `id-expression' case, the value returned is as for
17755 cp_parser_id_expression if the id-expression was an unqualified-id.
17756 If the id-expression was a qualified-id, then a SCOPE_REF is
17757 returned. The first operand is the scope (either a NAMESPACE_DECL
17758 or TREE_TYPE), but the second is still just a representation of an
17759 unqualified-id. */
17761 static tree
17763 {
17764 tree id;
17765 /* The expression must be an id-expression. Assume that qualified
17766 names are the names of types so that:
17768 template <class T>
17769 int S<T>::R::i = 3;
17771 will work; we must treat `S<T>::R' as the name of a type.
17772 Similarly, assume that qualified names are templates, where
17773 required, so that:
17775 template <class T>
17776 int S<T>::R<T>::i = 3;
17778 will work, too. */
17784 optional_p);
17788 }
17790 /* Parse a type-id.
17792 type-id:
17793 type-specifier-seq abstract-declarator [opt]
17795 Returns the TYPE specified. */
17797 static tree
17800 {
17801 cp_decl_specifier_seq type_specifier_seq;
17804 /* Parse the type-specifier-seq. */
17806 is_trailing_return,
17811 /* There might or might not be an abstract declarator. */
17813 /* Look for the declarator. */
17814 abstract_declarator
17818 /* Check to see if there really was a declarator. */
17825 {
17826 /* A type-id with type 'auto' is only ok if the abstract declarator
17827 is a function declarator with a late-specified return type. */
17832 else
17833 {
17836 }
17837 }
17840 is_template_arg);
17841 }
17844 {
17846 }
17849 {
17850 tree r;
17852 parser->type_definition_forbidden_message
17857 }
17860 {
17862 }
17864 /* Parse a type-specifier-seq.
17866 type-specifier-seq:
17867 type-specifier type-specifier-seq [opt]
17869 GNU extension:
17871 type-specifier-seq:
17872 attributes type-specifier-seq [opt]
17874 If IS_DECLARATION is true, we are at the start of a "condition" or
17875 exception-declaration, so we might be followed by a declarator-id.
17877 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
17878 i.e. we've just seen "->".
17880 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
17882 static void
17887 {
17892 /* Clear the TYPE_SPECIFIER_SEQ. */
17895 /* In the context of a trailing return type, enum E { } is an
17896 elaborated-type-specifier followed by a function-body, not an
17897 enum-specifier. */
17901 /* Parse the type-specifiers and attributes. */
17903 {
17904 tree type_specifier;
17907 /* Check for attributes first. */
17909 {
17914 }
17916 /* record the token of the beginning of the type specifier seq,
17917 for error reporting purposes*/
17921 /* Look for the type-specifier. */
17923 flags,
17924 type_specifier_seq,
17926 NULL,
17929 {
17930 /* If the first type-specifier could not be found, this is not a
17931 type-specifier-seq at all. */
17933 {
17937 }
17938 /* If subsequent type-specifiers could not be found, the
17939 type-specifier-seq is complete. */
17941 }
17944 /* The standard says that a condition can be:
17946 type-specifier-seq declarator = assignment-expression
17948 However, given:
17950 struct S {};
17951 if (int S = ...)
17953 we should treat the "S" as a declarator, not as a
17954 type-specifier. The standard doesn't say that explicitly for
17955 type-specifier-seq, but it does say that for
17956 decl-specifier-seq in an ordinary declaration. Perhaps it
17957 would be clearer just to allow a decl-specifier-seq here, and
17958 then add a semantic restriction that if any decl-specifiers
17959 that are not type-specifiers appear, the program is invalid. */
17962 }
17963 }
17965 /* Parse a parameter-declaration-clause.
17967 parameter-declaration-clause:
17968 parameter-declaration-list [opt] ... [opt]
17969 parameter-declaration-list , ...
17971 Returns a representation for the parameter declarations. A return
17972 value of NULL indicates a parameter-declaration-clause consisting
17973 only of an ellipsis. */
17975 static tree
17977 {
17978 tree parameters;
17983 /* Peek at the next token. */
17985 /* Check for trivial parameter-declaration-clauses. */
17987 {
17988 /* Consume the `...' token. */
17991 }
17993 /* There are no parameters. */
17994 {
17995 #ifndef NO_IMPLICIT_EXTERN_C
17999 else
18000 #endif
18002 }
18003 /* Check for `(void)', too, which is a special case. */
18007 {
18008 /* Consume the `void' token. */
18010 /* There are no parameters. */
18012 }
18014 /* Parse the parameter-declaration-list. */
18016 /* If a parse error occurred while parsing the
18017 parameter-declaration-list, then the entire
18018 parameter-declaration-clause is erroneous. */
18022 /* Peek at the next token. */
18024 /* If it's a `,', the clause should terminate with an ellipsis. */
18026 {
18027 /* Consume the `,'. */
18029 /* Expect an ellipsis. */
18030 ellipsis_p
18032 }
18033 /* It might also be `...' if the optional trailing `,' was
18034 omitted. */
18036 {
18037 /* Consume the `...' token. */
18039 /* And remember that we saw it. */
18041 }
18042 else
18045 /* Finish the parameter list. */
18050 }
18052 /* Parse a parameter-declaration-list.
18054 parameter-declaration-list:
18055 parameter-declaration
18056 parameter-declaration-list , parameter-declaration
18058 Returns a representation of the parameter-declaration-list, as for
18059 cp_parser_parameter_declaration_clause. However, the
18060 `void_list_node' is never appended to the list. Upon return,
18061 *IS_ERROR will be true iff an error occurred. */
18063 static tree
18065 {
18072 /* Assume all will go well. */
18074 /* The special considerations that apply to a function within an
18075 unbraced linkage specifications do not apply to the parameters
18076 to the function. */
18077 saved_in_unbraced_linkage_specification_p
18081 /* Look for more parameters. */
18083 {
18087 /* Parse the parameter. */
18088 parameter
18093 /* We don't know yet if the enclosing context is deprecated, so wait
18094 and warn in grokparms if appropriate. */
18098 {
18101 PARM,
18109 }
18113 /* If a parse error occurred parsing the parameter declaration,
18114 then the entire parameter-declaration-list is erroneous. */
18116 {
18120 }
18130 {
18134 }
18136 /* Add the new parameter to the list. */
18140 /* Peek at the next token. */
18143 /* These are for Objective-C++ */
18146 /* The parameter-declaration-list is complete. */
18149 {
18152 /* Peek at the next token. */
18154 /* If it's an ellipsis, then the list is complete. */
18157 /* Otherwise, there must be more parameters. Consume the
18158 `,'. */
18160 /* When parsing something like:
18162 int i(float f, double d)
18164 we can tell after seeing the declaration for "f" that we
18165 are not looking at an initialization of a variable "i",
18166 but rather at the declaration of a function "i".
18168 Due to the fact that the parsing of template arguments
18169 (as specified to a template-id) requires backtracking we
18170 cannot use this technique when inside a template argument
18171 list. */
18175 /* However, a parameter-declaration of the form
18176 "float(f)" (which is a valid declaration of a
18177 parameter "f") can also be interpreted as an
18178 expression (the conversion of "f" to "float"). */
18181 }
18182 else
18183 {
18191 }
18192 }
18194 parser->in_unbraced_linkage_specification_p
18199 implicit_template_parms,
18200 parameters);
18203 }
18205 /* Parse a parameter declaration.
18207 parameter-declaration:
18208 decl-specifier-seq ... [opt] declarator
18209 decl-specifier-seq declarator = assignment-expression
18210 decl-specifier-seq ... [opt] abstract-declarator [opt]
18211 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18213 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18214 declares a template parameter. (In that case, a non-nested `>'
18215 token encountered during the parsing of the assignment-expression
18216 is not interpreted as a greater-than operator.)
18218 Returns a representation of the parameter, or NULL if an error
18219 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18220 true iff the declarator is of the form "(p)". */
18226 {
18228 cp_decl_specifier_seq decl_specifiers;
18230 tree default_argument;
18234 /* In a template parameter, `>' is not an operator.
18236 [temp.param]
18238 When parsing a default template-argument for a non-type
18239 template-parameter, the first non-nested `>' is taken as the end
18240 of the template parameter-list rather than a greater-than
18241 operator. */
18243 /* Type definitions may not appear in parameter types. */
18245 parser->type_definition_forbidden_message
18248 /* Parse the declaration-specifiers. */
18250 CP_PARSER_FLAGS_NONE,
18254 /* Complain about missing 'typename' or other invalid type names. */
18259 /* If an error occurred, there's no reason to attempt to parse the
18260 rest of the declaration. */
18262 {
18265 }
18267 /* Peek at the next token. */
18270 /* If the next token is a `)', `,', `=', `>', or `...', then there
18271 is no declarator. However, when variadic templates are enabled,
18272 there may be a declarator following `...'. */
18277 {
18281 }
18282 /* Otherwise, there should be a declarator. */
18283 else
18284 {
18288 /* After seeing a decl-specifier-seq, if the next token is not a
18289 "(", there is no possibility that the code is a valid
18290 expression. Therefore, if parsing tentatively, we commit at
18291 this point. */
18293 /* In an expression context, having seen:
18295 (int((char ...
18297 we cannot be sure whether we are looking at a
18298 function-type (taking a "char" as a parameter) or a cast
18299 of some object of type "char" to "int". */
18305 /* Parse the declarator. */
18308 CP_PARSER_DECLARATOR_EITHER,
18310 parenthesized_p,
18313 /* After the declarator, allow more attributes. */
18314 decl_specifiers.attributes
18317 }
18319 /* If the next token is an ellipsis, and we have not seen a
18320 declarator name, and the type of the declarator contains parameter
18321 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18322 a parameter pack expansion expression. Otherwise, leave the
18323 ellipsis for a C-style variadic function. */
18326 {
18337 {
18338 /* Consume the `...'. */
18342 /* Build a pack expansion type */
18345 else
18347 }
18348 }
18350 /* The restriction on defining new types applies only to the type
18351 of the parameter, not to the default argument. */
18354 /* If the next token is `=', then process a default argument. */
18356 {
18358 /* If we are defining a class, then the tokens that make up the
18359 default argument must be saved and processed later. */
18364 /* Outside of a class definition, we can just parse the
18365 assignment-expression. */
18366 else
18367 default_argument
18371 {
18374 else
18375 {
18377 "default arguments are only "
18380 }
18381 }
18385 {
18386 /* Find the name of the parameter pack. */
18393 template_parm_p
18399 else
18401 template_parm_p
18408 }
18409 }
18410 else
18414 declarator,
18415 default_argument);
18416 }
18418 /* Parse a default argument and return it.
18420 TEMPLATE_PARM_P is true if this is a default argument for a
18421 non-type template parameter. */
18422 static tree
18424 {
18430 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18431 set correctly. */
18434 /* Local variable names (and the `this' keyword) may not
18435 appear in a default argument. */
18438 /* Parse the assignment-expression. */
18441 default_argument
18451 }
18453 /* Parse a function-body.
18455 function-body:
18456 compound_statement */
18458 static void
18460 {
18462 }
18464 /* Parse a ctor-initializer-opt followed by a function-body. Return
18465 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18466 is true we are parsing a function-try-block. */
18468 static bool
18471 {
18479 /* Begin the function body. */
18481 /* Parse the optional ctor-initializer. */
18484 /* If we're parsing a constexpr constructor definition, we need
18485 to check that the constructor body is indeed empty. However,
18486 before we get to cp_parser_function_body lot of junk has been
18487 generated, so we can't just check that we have an empty block.
18488 Rather we take a snapshot of the outermost block, and check whether
18489 cp_parser_function_body changed its state. */
18491 {
18495 }
18496 /* Parse the function-body. */
18500 /* Finish the function body. */
18504 }
18506 /* Parse an initializer.
18508 initializer:
18509 = initializer-clause
18510 ( expression-list )
18512 Returns an expression representing the initializer. If no
18513 initializer is present, NULL_TREE is returned.
18515 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
18516 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
18517 set to TRUE if there is no initializer present. If there is an
18518 initializer, and it is not a constant-expression, *NON_CONSTANT_P
18519 is set to true; otherwise it is set to false. */
18521 static tree
18524 {
18526 tree init;
18528 /* Peek at the next token. */
18531 /* Let our caller know whether or not this initializer was
18532 parenthesized. */
18534 /* Assume that the initializer is constant. */
18538 {
18539 /* Consume the `='. */
18541 /* Parse the initializer-clause. */
18543 }
18545 {
18550 non_constant_p);
18555 }
18557 {
18561 }
18562 else
18563 {
18564 /* Anything else is an error. */
18567 }
18570 }
18572 /* Parse an initializer-clause.
18574 initializer-clause:
18575 assignment-expression
18576 braced-init-list
18578 Returns an expression representing the initializer.
18580 If the `assignment-expression' production is used the value
18581 returned is simply a representation for the expression.
18583 Otherwise, calls cp_parser_braced_list. */
18585 static tree
18587 {
18588 tree initializer;
18590 /* Assume the expression is constant. */
18593 /* If it is not a `{', then we are looking at an
18594 assignment-expression. */
18596 {
18597 initializer
18600 non_constant_p);
18601 }
18602 else
18606 }
18608 /* Parse a brace-enclosed initializer list.
18610 braced-init-list:
18611 { initializer-list , [opt] }
18612 { }
18614 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
18615 the elements of the initializer-list (or NULL, if the last
18616 production is used). The TREE_TYPE for the CONSTRUCTOR will be
18617 NULL_TREE. There is no way to detect whether or not the optional
18618 trailing `,' was provided. NON_CONSTANT_P is as for
18619 cp_parser_initializer. */
18621 static tree
18623 {
18624 tree initializer;
18626 /* Consume the `{' token. */
18628 /* Create a CONSTRUCTOR to represent the braced-initializer. */
18630 /* If it's not a `}', then there is a non-trivial initializer. */
18632 {
18633 /* Parse the initializer list. */
18636 /* A trailing `,' token is allowed. */
18639 }
18640 else
18642 /* Now, there should be a trailing `}'. */
18646 }
18648 /* Parse an initializer-list.
18650 initializer-list:
18651 initializer-clause ... [opt]
18652 initializer-list , initializer-clause ... [opt]
18654 GNU Extension:
18656 initializer-list:
18657 designation initializer-clause ...[opt]
18658 initializer-list , designation initializer-clause ...[opt]
18660 designation:
18661 . identifier =
18662 identifier :
18663 [ constant-expression ] =
18665 Returns a vec of constructor_elt. The VALUE of each elt is an expression
18666 for the initializer. If the INDEX of the elt is non-NULL, it is the
18667 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
18668 as for cp_parser_initializer. */
18672 {
18675 /* Assume all of the expressions are constant. */
18678 /* Parse the rest of the list. */
18680 {
18682 tree designator;
18683 tree initializer;
18686 /* If the next token is an identifier and the following one is a
18687 colon, we are looking at the GNU designated-initializer
18688 syntax. */
18692 {
18693 /* Warn the user that they are using an extension. */
18696 /* Consume the identifier. */
18698 /* Consume the `:'. */
18700 }
18701 /* Also handle the C99 syntax, '. id ='. */
18706 {
18707 /* Warn the user that they are using an extension. */
18710 /* Consume the `.'. */
18712 /* Consume the identifier. */
18714 /* Consume the `='. */
18716 }
18717 /* Also handle C99 array designators, '[ const ] ='. */
18721 {
18722 /* In C++11, [ could start a lambda-introducer. */
18734 }
18735 else
18738 /* Parse the initializer. */
18741 /* If any clause is non-constant, so is the entire initializer. */
18745 /* If we have an ellipsis, this is an initializer pack
18746 expansion. */
18748 {
18749 /* Consume the `...'. */
18752 /* Turn the initializer into an initializer expansion. */
18754 }
18756 /* Add it to the vector. */
18759 /* If the next token is not a comma, we have reached the end of
18760 the list. */
18764 /* Peek at the next token. */
18766 /* If the next token is a `}', then we're still done. An
18767 initializer-clause can have a trailing `,' after the
18768 initializer-list and before the closing `}'. */
18772 /* Consume the `,' token. */
18774 }
18777 }
18779 /* Classes [gram.class] */
18781 /* Parse a class-name.
18783 class-name:
18784 identifier
18785 template-id
18787 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
18788 to indicate that names looked up in dependent types should be
18789 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
18790 keyword has been used to indicate that the name that appears next
18791 is a template. TAG_TYPE indicates the explicit tag given before
18792 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
18793 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
18794 is the class being defined in a class-head.
18796 Returns the TYPE_DECL representing the class. */
18798 static tree
18806 {
18807 tree decl;
18808 tree scope;
18813 /* All class-names start with an identifier. */
18816 {
18819 }
18821 /* PARSER->SCOPE can be cleared when parsing the template-arguments
18822 to a template-id, so we save it here. */
18827 /* Any name names a type if we're following the `typename' keyword
18828 in a qualified name where the enclosing scope is type-dependent. */
18831 /* Handle the common case (an identifier, but not a template-id)
18832 efficiently. */
18835 {
18839 /* Look for the identifier. */
18843 /* If the next token isn't an identifier, we are certainly not
18844 looking at a class-name. */
18847 /* If we know this is a type-name, there's no need to look it
18848 up. */
18851 else
18852 {
18853 tree ambiguous_decls;
18854 /* If we already know that this lookup is ambiguous, then
18855 we've already issued an error message; there's no reason
18856 to check again. */
18858 {
18861 }
18862 /* If the next token is a `::', then the name must be a type
18863 name.
18865 [basic.lookup.qual]
18867 During the lookup for a name preceding the :: scope
18868 resolution operator, object, function, and enumerator
18869 names are ignored. */
18872 /* Look up the name. */
18874 tag_type,
18877 check_dependency_p,
18881 {
18885 }
18886 }
18887 }
18888 else
18889 {
18890 /* Try a template-id. */
18892 check_dependency_p,
18893 tag_type,
18894 is_declaration);
18897 }
18901 /* If this is a typename, create a TYPENAME_TYPE. */
18903 {
18908 }
18912 /* Check to see that it is really the name of a class. */
18916 /* Situations like this:
18918 template <typename T> struct A {
18919 typename T::template X<int>::I i;
18920 };
18922 are problematic. Is `T::template X<int>' a class-name? The
18923 standard does not seem to be definitive, but there is no other
18924 valid interpretation of the following `::'. Therefore, those
18925 names are considered class-names. */
18926 {
18930 }
18934 /* In Objective-C 2.0, a classname followed by '.' starts a
18935 dot-syntax expression, and it's not a type-name. */
18947 }
18949 /* Parse a class-specifier.
18951 class-specifier:
18952 class-head { member-specification [opt] }
18954 Returns the TREE_TYPE representing the class. */
18956 static tree
18958 {
18959 tree type;
18973 /* Parse the class-head. */
18976 /* If the class-head was a semantic disaster, skip the entire body
18977 of the class. */
18979 {
18983 }
18985 /* Look for the `{'. */
18987 {
18990 }
18994 /* Issue an error message if type-definitions are forbidden here. */
18996 /* Remember that we are defining one more class. */
18998 /* Inside the class, surrounding template-parameter-lists do not
18999 apply. */
19000 saved_num_template_parameter_lists
19003 /* We are not in a function body. */
19006 /* Or in a loop. */
19009 /* Or in a switch. */
19012 /* We are not immediately inside an extern "lang" block. */
19013 saved_in_unbraced_linkage_specification_p
19017 /* Start the class. */
19019 {
19022 }
19026 /* If the type is erroneous, skip the entire body of the class. */
19028 else
19029 /* Parse the member-specification. */
19032 /* Look for the trailing `}'. */
19034 /* Look for trailing attributes to apply to this class. */
19042 /* We've finished a type definition. Check for the common syntax
19043 error of forgetting a semicolon after the definition. We need to
19044 be careful, as we can't just check for not-a-semicolon and be done
19045 with it; the user might have typed:
19047 class X { } c = ...;
19048 class X { } *p = ...;
19050 and so forth. Instead, enumerate all the possible tokens that
19051 might follow this production; if we don't see one of them, then
19052 complain and silently insert the semicolon. */
19053 {
19058 /* Don't try to parse c++11 attributes here. As per the
19059 grammar, that should be a task for
19060 cp_parser_decl_specifier_seq. */
19064 {
19075 /* While it's legal for type qualifiers and storage class
19076 specifiers to follow type definitions in the grammar, only
19077 compiler testsuites contain code like that. Assume that if
19078 we see such code, then what we're really seeing is a case
19079 like:
19081 class X { }
19082 const <type> var = ...;
19084 or
19086 class Y { }
19087 static <type> func (...) ...
19089 i.e. the qualifier or specifier applies to the next
19090 declaration. To do so, however, we need to look ahead one
19091 more token to see if *that* token is a type specifier.
19093 This code could be improved to handle:
19095 class Z { }
19096 static const <type> var = ...; */
19099 {
19102 /* Handling user-defined types here would be nice, but very
19103 tricky. */
19104 want_semicolon
19107 }
19111 }
19113 /* If we don't have a type, then something is very wrong and we
19114 shouldn't try to do anything clever. Likewise for not seeing the
19115 closing brace. */
19117 {
19118 cp_token_position prev
19129 else
19132 /* Unget one token and smash it to look as though we encountered
19133 a semicolon in the input stream. */
19138 }
19139 }
19141 /* If this class is not itself within the scope of another class,
19142 then we need to parse the bodies of all of the queued function
19143 definitions. Note that the queued functions defined in a class
19144 are not always processed immediately following the
19145 class-specifier for that class. Consider:
19147 struct A {
19148 struct B { void f() { sizeof (A); } };
19149 };
19151 If `f' were processed before the processing of `A' were
19152 completed, there would be no way to compute the size of `A'.
19153 Note that the nesting we are interested in here is lexical --
19154 not the semantic nesting given by TYPE_CONTEXT. In particular,
19155 for:
19157 struct A { struct B; };
19158 struct A::B { void f() { } };
19160 there is no need to delay the parsing of `A::B::f'. */
19162 {
19163 tree decl;
19170 /* In a first pass, parse default arguments to the functions.
19171 Then, in a second pass, parse the bodies of the functions.
19172 This two-phased approach handles cases like:
19174 struct S {
19175 void f() { g(); }
19176 void g(int i = 3);
19177 };
19179 */
19181 {
19183 /* If there are default arguments that have not yet been processed,
19184 take care of them now. */
19186 {
19191 }
19192 /* Make sure that any template parameters are in scope. */
19194 /* Parse the default argument expressions. */
19196 /* Remove any template parameters from the symbol table. */
19198 }
19200 /* Now parse any NSDMIs. */
19204 {
19206 {
19211 }
19214 }
19220 /* Now parse the body of the functions. */
19222 {
19223 /* OpenMP UDRs need to be parsed before all other functions. */
19230 }
19231 else
19235 }
19237 /* Put back any saved access checks. */
19240 /* Restore saved state. */
19244 parser->num_template_parameter_lists
19246 parser->in_unbraced_linkage_specification_p
19250 }
19252 static tree
19254 {
19255 tree ret;
19260 }
19262 /* Parse a class-head.
19264 class-head:
19265 class-key identifier [opt] base-clause [opt]
19266 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19267 class-key nested-name-specifier [opt] template-id
19268 base-clause [opt]
19270 class-virt-specifier:
19271 final
19273 GNU Extensions:
19274 class-key attributes identifier [opt] base-clause [opt]
19275 class-key attributes nested-name-specifier identifier base-clause [opt]
19276 class-key attributes nested-name-specifier [opt] template-id
19277 base-clause [opt]
19279 Upon return BASES is initialized to the list of base classes (or
19280 NULL, if there are none) in the same form returned by
19281 cp_parser_base_clause.
19283 Returns the TYPE of the indicated class. Sets
19284 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19285 involving a nested-name-specifier was used, and FALSE otherwise.
19287 Returns error_mark_node if this is not a class-head.
19289 Returns NULL_TREE if the class-head is syntactically valid, but
19290 semantically invalid in a way that means we should skip the entire
19291 body of the class. */
19293 static tree
19296 {
19297 tree nested_name_specifier;
19301 tree attributes;
19302 tree bases;
19312 /* Assume no nested-name-specifier will be present. */
19314 /* Assume no template parameter lists will be used in defining the
19315 type. */
19319 /* Look for the class-key. */
19324 /* Parse the attributes. */
19327 /* If the next token is `::', that is invalid -- but sometimes
19328 people do try to write:
19330 struct ::S {};
19332 Handle this gracefully by accepting the extra qualifier, and then
19333 issuing an error about it later if this really is a
19334 class-head. If it turns out just to be an elaborated type
19335 specifier, remain silent. */
19341 /* Determine the name of the class. Begin by looking for an
19342 optional nested-name-specifier. */
19344 nested_name_specifier
19350 /* If there was a nested-name-specifier, then there *must* be an
19351 identifier. */
19353 {
19355 /* Although the grammar says `identifier', it really means
19356 `class-name' or `template-name'. You are only allowed to
19357 define a class that has already been declared with this
19358 syntax.
19360 The proposed resolution for Core Issue 180 says that wherever
19361 you see `class T::X' you should treat `X' as a type-name.
19363 It is OK to define an inaccessible class; for example:
19365 class A { class B; };
19366 class A::B {};
19368 We do not know if we will see a class-name, or a
19369 template-name. We look for a class-name first, in case the
19370 class-name is a template-id; if we looked for the
19371 template-name first we would stop after the template-name. */
19376 class_type,
19380 /* If that didn't work, ignore the nested-name-specifier. */
19382 {
19388 }
19389 /* If we could not find a corresponding TYPE, treat this
19390 declaration like an unqualified declaration. */
19393 /* Otherwise, count the number of templates used in TYPE and its
19394 containing scopes. */
19395 else
19396 {
19397 tree scope;
19409 }
19410 }
19411 /* Otherwise, the identifier is optional. */
19412 else
19413 {
19414 /* We don't know whether what comes next is a template-id,
19415 an identifier, or nothing at all. */
19417 /* Check for a template-id. */
19422 class_key,
19424 /* If that didn't work, it could still be an identifier. */
19426 {
19428 {
19431 }
19432 else
19434 }
19435 else
19436 {
19439 }
19440 }
19445 {
19447 class_key,
19449 }
19452 /* If it's not a `:' or a `{' then we can't really be looking at a
19453 class-head, since a class-head only appears as part of a
19454 class-specifier. We have to detect this situation before calling
19455 xref_tag, since that has irreversible side-effects. */
19457 {
19461 }
19463 /* At this point, we're going ahead with the class-specifier, even
19464 if some other problem occurs. */
19467 {
19472 }
19473 /* Issue the error about the overly-qualified name now. */
19475 {
19480 }
19482 {
19487 }
19489 {
19490 tree scope;
19492 /* Reject typedef-names in class heads. */
19494 {
19497 type);
19500 }
19502 /* Figure out in what scope the declaration is being placed. */
19504 /* If that scope does not contain the scope in which the
19505 class was originally declared, the program is invalid. */
19507 {
19510 "declaration of %qD in namespace %qD which does not "
19513 else
19519 }
19520 /* [dcl.meaning]
19522 A declarator-id shall not be qualified except for the
19523 definition of a ... nested class outside of its class
19524 ... [or] the definition or explicit instantiation of a
19525 class member of a namespace outside of its namespace. */
19527 {
19532 }
19533 }
19534 /* An explicit-specialization must be preceded by "template <>". If
19535 it is not, try to recover gracefully. */
19539 {
19543 /* Take the same action that would have been taken by
19544 cp_parser_explicit_specialization. */
19547 }
19548 /* There must be no "return" statements between this point and the
19549 end of this function; set "type "to the correct return value and
19550 use "goto done;" to return. */
19551 /* Make sure that the right number of template parameters were
19552 present. */
19556 {
19557 /* If something went wrong, there is no point in even trying to
19558 process the class-definition. */
19561 }
19563 /* Look up the type. */
19565 {
19569 {
19573 }
19574 else
19575 {
19578 }
19581 }
19583 {
19584 tree class_type;
19586 /* Given:
19588 template <typename T> struct S { struct T };
19589 template <typename T> struct S<T>::T { };
19591 we will get a TYPENAME_TYPE when processing the definition of
19592 `S::T'. We need to resolve it to the actual type before we
19593 try to define it. */
19595 {
19600 else
19601 {
19604 }
19605 }
19609 {
19612 }
19615 /* Enter the scope indicated by the nested-name-specifier. */
19617 /* Get the canonical version of this type. */
19621 {
19624 {
19627 }
19628 }
19632 }
19634 {
19635 /* If the class was unnamed, create a dummy name. */
19640 }
19642 /* Indicate whether this class was declared as a `class' or as a
19643 `struct'. */
19648 /* If this type was already complete, and we see another definition,
19649 that's an error. */
19651 {
19653 type);
19655 type);
19658 }
19663 {
19664 /* Apply attributes now, before any use of the class as a template
19665 argument in its base list. */
19668 }
19670 /* We will have entered the scope containing the class; the names of
19671 base classes should be looked up in that context. For example:
19673 struct A { struct B {}; struct C; };
19674 struct A::C : B {};
19676 is valid. */
19678 /* Get the list of base-classes, if there is one. */
19681 else
19684 /* If we're really defining a class, process the base classes.
19685 If they're invalid, fail. */
19690 done:
19691 /* Leave the scope given by the nested-name-specifier. We will
19692 enter the class scope itself while processing the members. */
19697 {
19700 }
19706 out:
19709 }
19711 /* Parse a class-key.
19713 class-key:
19714 class
19715 struct
19716 union
19718 Returns the kind of class-key specified, or none_type to indicate
19719 error. */
19721 static enum tag_types
19723 {
19727 /* Look for the class-key. */
19732 /* Check to see if the TOKEN is a class-key. */
19737 }
19739 /* Parse an (optional) member-specification.
19741 member-specification:
19742 member-declaration member-specification [opt]
19743 access-specifier : member-specification [opt] */
19745 static void
19747 {
19749 {
19753 /* Peek at the next token. */
19755 /* If it's a `}', or EOF then we've seen all the members. */
19761 /* See if this token is a keyword. */
19764 {
19768 /* Consume the access-specifier. */
19770 /* Remember which access-specifier is active. */
19772 /* Look for the `:'. */
19777 /* Accept #pragmas at class scope. */
19779 {
19782 }
19784 /* Otherwise, the next construction must be a
19785 member-declaration. */
19787 }
19788 }
19789 }
19791 /* Parse a member-declaration.
19793 member-declaration:
19794 decl-specifier-seq [opt] member-declarator-list [opt] ;
19795 function-definition ; [opt]
19796 :: [opt] nested-name-specifier template [opt] unqualified-id ;
19797 using-declaration
19798 template-declaration
19799 alias-declaration
19801 member-declarator-list:
19802 member-declarator
19803 member-declarator-list , member-declarator
19805 member-declarator:
19806 declarator pure-specifier [opt]
19807 declarator constant-initializer [opt]
19808 identifier [opt] : constant-expression
19810 GNU Extensions:
19812 member-declaration:
19813 __extension__ member-declaration
19815 member-declarator:
19816 declarator attributes [opt] pure-specifier [opt]
19817 declarator attributes [opt] constant-initializer [opt]
19818 identifier [opt] attributes [opt] : constant-expression
19820 C++0x Extensions:
19822 member-declaration:
19823 static_assert-declaration */
19825 static void
19827 {
19828 cp_decl_specifier_seq decl_specifiers;
19829 tree prefix_attributes;
19830 tree decl;
19839 /* Check for the `__extension__' keyword. */
19841 {
19842 /* Recurse. */
19844 /* Restore the old value of the PEDANTIC flag. */
19848 }
19850 /* Check for a template-declaration. */
19852 {
19853 /* An explicit specialization here is an error condition, and we
19854 expect the specialization handler to detect and report this. */
19858 else
19862 }
19864 /* Check for a using-declaration. */
19866 {
19868 {
19869 /* Parse the using-declaration. */
19873 }
19874 else
19875 {
19876 tree decl;
19880 /* Note that if we actually see the '=' token after the
19881 identifier, cp_parser_alias_declaration commits the
19882 tentative parse. In that case, we really expects an
19883 alias-declaration. Otherwise, we expect a using
19884 declaration. */
19885 alias_decl_expected =
19891 else
19895 }
19896 }
19898 /* Check for @defs. */
19900 {
19905 {
19910 }
19912 }
19914 /* If the next token is `static_assert' we have a static assertion. */
19916 {
19919 }
19926 /* Parse the decl-specifier-seq. */
19929 CP_PARSER_FLAGS_OPTIONAL,
19932 /* Check for an invalid type-name. */
19936 /* If there is no declarator, then the decl-specifier-seq should
19937 specify a type. */
19939 {
19940 /* If there was no decl-specifier-seq, and the next token is a
19941 `;', then we have something like:
19943 struct S { ; };
19945 [class.mem]
19947 Each member-declaration shall declare at least one member
19948 name of the class. */
19950 {
19954 }
19955 else
19956 {
19957 tree type;
19959 /* See if this declaration is a friend. */
19961 /* If there were decl-specifiers, check to see if there was
19962 a class-declaration. */
19965 /* Nested classes have already been added to the class, but
19966 a `friend' needs to be explicitly registered. */
19968 {
19969 /* If the `friend' keyword was present, the friend must
19970 be introduced with a class-key. */
19973 "in C++03 a class-key must be used "
19975 /* In this case:
19977 template <typename T> struct A {
19978 friend struct A<T>::B;
19979 };
19981 A<T>::B will be represented by a TYPENAME_TYPE, and
19982 therefore not recognized by check_tag_decl. */
19984 {
19988 }
19991 "friend declaration does not name a class or "
19993 else
19996 }
19997 /* If there is no TYPE, an error message will already have
19998 been issued. */
20000 ;
20001 /* An anonymous aggregate has to be handled specially; such
20002 a declaration really declares a data member (with a
20003 particular type), as opposed to a nested class. */
20005 {
20006 /* C++11 9.5/6. */
20009 "a storage class on an anonymous aggregate "
20012 /* Remove constructors and such from TYPE, now that we
20013 know it is an anonymous aggregate. */
20015 /* And make the corresponding data member. */
20018 /* Add it to the class. */
20020 }
20021 else
20022 cp_parser_check_access_in_redeclaration
20025 }
20026 }
20027 else
20028 {
20031 /* Clear attributes from the decl_specifiers but keep them
20032 around as prefix attributes that apply them to the entity
20033 being declared. */
20037 /* See if these declarations will be friends. */
20040 /* Keep going until we hit the `;' at the end of the
20041 declaration. */
20043 {
20045 tree first_attribute;
20047 /* Peek at the next token. */
20050 /* Check for a bitfield declaration. */
20055 {
20056 tree identifier;
20057 tree width;
20059 /* Get the name of the bitfield. Note that we cannot just
20060 check TOKEN here because it may have been invalidated by
20061 the call to cp_lexer_peek_nth_token above. */
20064 else
20067 /* Consume the `:' token. */
20069 /* Get the width of the bitfield. */
20070 width
20073 NULL);
20075 /* Look for attributes that apply to the bitfield. */
20077 /* Remember which attributes are prefix attributes and
20078 which are not. */
20080 /* Combine the attributes. */
20083 /* Create the bitfield declaration. */
20086 identifier,
20087 sfk_none)
20090 width,
20091 attributes);
20092 }
20093 else
20094 {
20096 tree initializer;
20097 tree asm_specification;
20100 /* Parse the declarator. */
20101 declarator
20107 /* If something went wrong parsing the declarator, make sure
20108 that we at least consume some tokens. */
20110 {
20111 /* Skip to the end of the statement. */
20113 /* If the next token is not a semicolon, that is
20114 probably because we just skipped over the body of
20115 a function. So, we consume a semicolon if
20116 present, but do not issue an error message if it
20117 is not present. */
20119 CPP_SEMICOLON))
20122 }
20125 cp_parser_check_for_definition_in_return_type
20129 /* Look for an asm-specification. */
20131 /* Look for attributes that apply to the declaration. */
20133 /* Remember which attributes are prefix attributes and
20134 which are not. */
20136 /* Combine the attributes. */
20139 /* If it's an `=', then we have a constant-initializer or a
20140 pure-specifier. It is not correct to parse the
20141 initializer before registering the member declaration
20142 since the member declaration should be in scope while
20143 its initializer is processed. However, the rest of the
20144 front end does not yet provide an interface that allows
20145 us to handle this correctly. */
20147 {
20148 /* In [class.mem]:
20150 A pure-specifier shall be used only in the declaration of
20151 a virtual function.
20153 A member-declarator can contain a constant-initializer
20154 only if it declares a static member of integral or
20155 enumeration type.
20157 Therefore, if the DECLARATOR is for a function, we look
20158 for a pure-specifier; otherwise, we look for a
20159 constant-initializer. When we call `grokfield', it will
20160 perform more stringent semantics checks. */
20172 {
20174 /* Don't require a constant rvalue in C++11, since we
20175 might want a reference constant. We'll enforce
20176 constancy later. */
20178 /* Parse the initializer. */
20181 }
20182 else
20183 /* Parse the initializer. */
20185 }
20188 {
20192 else
20194 }
20195 /* Otherwise, there is no initializer. */
20196 else
20199 /* See if we are probably looking at a function
20200 definition. We are certainly not looking at a
20201 member-declarator. Calling `grokfield' has
20202 side-effects, so we must not do it unless we are sure
20203 that we are looking at a member-declarator. */
20206 {
20207 /* The grammar does not allow a pure-specifier to be
20208 used when a member function is defined. (It is
20209 possible that this fact is an oversight in the
20210 standard, since a pure function may be defined
20211 outside of the class-specifier. */
20217 declarator,
20218 attributes);
20219 /* If the member was not a friend, declare it here. */
20221 {
20225 }
20226 /* Peek at the next token. */
20228 /* If the next token is a semicolon, consume it. */
20232 }
20233 else
20236 /* Create the declaration. */
20242 }
20246 /* Reset PREFIX_ATTRIBUTES. */
20252 /* If there is any qualification still in effect, clear it
20253 now; we will be starting fresh with the next declarator. */
20257 /* If it's a `,', then there are more declarators. */
20259 {
20262 {
20266 }
20267 }
20268 /* If the next token isn't a `;', then we have a parse error. */
20270 CPP_SEMICOLON))
20271 {
20272 /* The next token might be a ways away from where the
20273 actual semicolon is missing. Find the previous token
20274 and use that for our error position. */
20279 /* Assume that the user meant to provide a semicolon. If
20280 we were to cp_parser_skip_to_end_of_statement, we might
20281 skip to a semicolon inside a member function definition
20282 and issue nonsensical error messages. */
20284 }
20287 {
20288 /* Add DECL to the list of members. */
20297 /* Add DECL to the queue of NSDMI to be parsed later. */
20299 }
20303 }
20304 }
20307 out:
20309 }
20311 /* Parse a pure-specifier.
20313 pure-specifier:
20314 = 0
20316 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20317 Otherwise, ERROR_MARK_NODE is returned. */
20319 static tree
20321 {
20324 /* Look for the `=' token. */
20327 /* Look for the `0' token. */
20336 /* Accept = default or = delete in c++0x mode. */
20339 {
20342 }
20344 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20346 {
20351 }
20353 {
20356 }
20359 }
20361 /* Parse a constant-initializer.
20363 constant-initializer:
20364 = constant-expression
20366 Returns a representation of the constant-expression. */
20368 static tree
20370 {
20371 /* Look for the `=' token. */
20375 /* It is invalid to write:
20377 struct S { static const int i = { 7 }; };
20379 */
20381 {
20384 /* Consume the opening brace. */
20386 /* Skip the initializer. */
20388 /* Look for the trailing `}'. */
20392 }
20396 NULL);
20397 }
20399 /* Derived classes [gram.class.derived] */
20401 /* Parse a base-clause.
20403 base-clause:
20404 : base-specifier-list
20406 base-specifier-list:
20407 base-specifier ... [opt]
20408 base-specifier-list , base-specifier ... [opt]
20410 Returns a TREE_LIST representing the base-classes, in the order in
20411 which they were declared. The representation of each node is as
20412 described by cp_parser_base_specifier.
20414 In the case that no bases are specified, this function will return
20415 NULL_TREE, not ERROR_MARK_NODE. */
20417 static tree
20419 {
20422 /* Look for the `:' that begins the list. */
20425 /* Scan the base-specifier-list. */
20427 {
20429 tree base;
20432 /* Look for the base-specifier. */
20434 /* Look for the (optional) ellipsis. */
20436 {
20437 /* Consume the `...'. */
20441 }
20443 /* Add BASE to the front of the list. */
20445 {
20447 /* Make this a pack expansion type. */
20451 {
20454 }
20455 }
20456 /* Peek at the next token. */
20458 /* If it's not a comma, then the list is complete. */
20461 /* Consume the `,'. */
20463 }
20465 /* PARSER->SCOPE may still be non-NULL at this point, if the last
20466 base class had a qualified name. However, the next name that
20467 appears is certainly not qualified. */
20473 }
20475 /* Parse a base-specifier.
20477 base-specifier:
20478 :: [opt] nested-name-specifier [opt] class-name
20479 virtual access-specifier [opt] :: [opt] nested-name-specifier
20480 [opt] class-name
20481 access-specifier virtual [opt] :: [opt] nested-name-specifier
20482 [opt] class-name
20484 Returns a TREE_LIST. The TREE_PURPOSE will be one of
20485 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
20486 indicate the specifiers provided. The TREE_VALUE will be a TYPE
20487 (or the ERROR_MARK_NODE) indicating the type that was specified. */
20489 static tree
20491 {
20499 tree type;
20501 /* Process the optional `virtual' and `access-specifier'. */
20503 {
20504 /* Peek at the next token. */
20506 /* Process `virtual'. */
20508 {
20510 /* If `virtual' appears more than once, issue an error. */
20512 {
20516 }
20520 /* Consume the `virtual' token. */
20528 /* If more than one access specifier appears, issue an
20529 error. */
20532 {
20536 }
20540 /* Consume the access-specifier. */
20548 }
20549 }
20550 /* It is not uncommon to see programs mechanically, erroneously, use
20551 the 'typename' keyword to denote (dependent) qualified types
20552 as base classes. */
20554 {
20559 else
20561 "keyword %<typename%> not allowed in this context "
20564 }
20566 /* Look for the optional `::' operator. */
20568 /* Look for the nested-name-specifier. The simplest way to
20569 implement:
20571 [temp.res]
20573 The keyword `typename' is not permitted in a base-specifier or
20574 mem-initializer; in these contexts a qualified name that
20575 depends on a template-parameter is implicitly assumed to be a
20576 type name.
20578 is to pretend that we have seen the `typename' keyword at this
20579 point. */
20583 typename_type,
20585 /* If the base class is given by a qualified name, assume that names
20586 we see are type names or templates, as appropriate. */
20592 /* DR 950 allows decltype as a base-specifier. */
20594 else
20595 {
20596 /* Otherwise, look for the class-name. */
20598 class_scope_p,
20599 template_p,
20600 typename_type,
20605 }
20611 }
20613 /* Exception handling [gram.exception] */
20615 /* Parse an (optional) noexcept-specification.
20617 noexcept-specification:
20618 noexcept ( constant-expression ) [opt]
20620 If no noexcept-specification is present, returns NULL_TREE.
20621 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
20622 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
20623 there are no parentheses. CONSUMED_EXPR will be set accordingly.
20624 Otherwise, returns a noexcept specification unless RETURN_COND is true,
20625 in which case a boolean condition is returned instead. */
20627 static tree
20632 {
20636 /* Peek at the next token. */
20639 /* Is it a noexcept-specification? */
20641 {
20642 tree expr;
20646 {
20650 {
20651 /* Types may not be defined in an exception-specification. */
20653 parser->type_definition_forbidden_message
20658 /* Restore the saved message. */
20660 }
20661 else
20662 {
20665 }
20668 }
20669 else
20670 {
20674 }
20676 /* We cannot build a noexcept-spec right away because this will check
20677 that expr is a constexpr. */
20680 else
20682 }
20683 else
20685 }
20687 /* Parse an (optional) exception-specification.
20689 exception-specification:
20690 throw ( type-id-list [opt] )
20692 Returns a TREE_LIST representing the exception-specification. The
20693 TREE_VALUE of each node is a type. */
20695 static tree
20697 {
20699 tree type_id_list;
20702 /* Peek at the next token. */
20705 /* Is it a noexcept-specification? */
20711 /* If it's not `throw', then there's no exception-specification. */
20715 #if 0
20716 /* Enable this once a lot of code has transitioned to noexcept? */
20720 #endif
20722 /* Consume the `throw'. */
20725 /* Look for the `('. */
20728 /* Peek at the next token. */
20730 /* If it's not a `)', then there is a type-id-list. */
20732 {
20733 /* Types may not be defined in an exception-specification. */
20735 parser->type_definition_forbidden_message
20737 /* Parse the type-id-list. */
20739 /* Restore the saved message. */
20741 }
20742 else
20745 /* Look for the `)'. */
20749 }
20751 /* Parse an (optional) type-id-list.
20753 type-id-list:
20754 type-id ... [opt]
20755 type-id-list , type-id ... [opt]
20757 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
20758 in the order that the types were presented. */
20760 static tree
20762 {
20766 {
20768 tree type;
20770 /* Get the next type-id. */
20772 /* Parse the optional ellipsis. */
20774 {
20775 /* Consume the `...'. */
20778 /* Turn the type into a pack expansion expression. */
20780 }
20781 /* Add it to the list. */
20783 /* Peek at the next token. */
20785 /* If it is not a `,', we are done. */
20788 /* Consume the `,'. */
20790 }
20793 }
20795 /* Parse a try-block.
20797 try-block:
20798 try compound-statement handler-seq */
20800 static tree
20802 {
20803 tree try_block;
20813 }
20815 /* Parse a function-try-block.
20817 function-try-block:
20818 try ctor-initializer [opt] function-body handler-seq */
20820 static bool
20822 {
20823 tree compound_stmt;
20824 tree try_block;
20827 /* Look for the `try' keyword. */
20830 /* Let the rest of the front end know where we are. */
20832 /* Parse the function-body. */
20833 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
20835 /* We're done with the `try' part. */
20837 /* Parse the handlers. */
20839 /* We're done with the handlers. */
20843 }
20845 /* Parse a handler-seq.
20847 handler-seq:
20848 handler handler-seq [opt] */
20850 static void
20852 {
20854 {
20857 /* Parse the handler. */
20859 /* Peek at the next token. */
20861 /* If it's not `catch' then there are no more handlers. */
20864 }
20865 }
20867 /* Parse a handler.
20869 handler:
20870 catch ( exception-declaration ) compound-statement */
20872 static void
20874 {
20875 tree handler;
20876 tree declaration;
20886 }
20888 /* Parse an exception-declaration.
20890 exception-declaration:
20891 type-specifier-seq declarator
20892 type-specifier-seq abstract-declarator
20893 type-specifier-seq
20894 ...
20896 Returns a VAR_DECL for the declaration, or NULL_TREE if the
20897 ellipsis variant is used. */
20899 static tree
20901 {
20902 cp_decl_specifier_seq type_specifiers;
20906 /* If it's an ellipsis, it's easy to handle. */
20908 {
20909 /* Consume the `...' token. */
20912 }
20914 /* Types may not be defined in exception-declarations. */
20916 parser->type_definition_forbidden_message
20919 /* Parse the type-specifier-seq. */
20923 /* If it's a `)', then there is no declarator. */
20926 else
20932 /* Restore the saved message. */
20939 }
20941 /* Parse a throw-expression.
20943 throw-expression:
20944 throw assignment-expression [opt]
20946 Returns a THROW_EXPR representing the throw-expression. */
20948 static tree
20950 {
20951 tree expression;
20956 /* Figure out whether or not there is an assignment-expression
20957 following the "throw" keyword. */
20965 else
20970 }
20972 /* GNU Extensions */
20974 /* Parse an (optional) asm-specification.
20976 asm-specification:
20977 asm ( string-literal )
20979 If the asm-specification is present, returns a STRING_CST
20980 corresponding to the string-literal. Otherwise, returns
20981 NULL_TREE. */
20983 static tree
20985 {
20987 tree asm_specification;
20989 /* Peek at the next token. */
20991 /* If the next token isn't the `asm' keyword, then there's no
20992 asm-specification. */
20996 /* Consume the `asm' token. */
20998 /* Look for the `('. */
21001 /* Look for the string-literal. */
21004 /* Look for the `)'. */
21008 }
21010 /* Parse an asm-operand-list.
21012 asm-operand-list:
21013 asm-operand
21014 asm-operand-list , asm-operand
21016 asm-operand:
21017 string-literal ( expression )
21018 [ string-literal ] string-literal ( expression )
21020 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21021 each node is the expression. The TREE_PURPOSE is itself a
21022 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21023 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21024 is a STRING_CST for the string literal before the parenthesis. Returns
21025 ERROR_MARK_NODE if any of the operands are invalid. */
21027 static tree
21029 {
21034 {
21035 tree string_literal;
21036 tree expression;
21037 tree name;
21040 {
21041 /* Consume the `[' token. */
21043 /* Read the operand name. */
21048 /* Look for the closing `]'. */
21050 }
21051 else
21053 /* Look for the string-literal. */
21056 /* Look for the `('. */
21058 /* Parse the expression. */
21060 /* Look for the `)'. */
21068 /* Add this operand to the list. */
21070 expression,
21071 asm_operands);
21072 /* If the next token is not a `,', there are no more
21073 operands. */
21076 /* Consume the `,'. */
21078 }
21081 }
21083 /* Parse an asm-clobber-list.
21085 asm-clobber-list:
21086 string-literal
21087 asm-clobber-list , string-literal
21089 Returns a TREE_LIST, indicating the clobbers in the order that they
21090 appeared. The TREE_VALUE of each node is a STRING_CST. */
21092 static tree
21094 {
21098 {
21099 tree string_literal;
21101 /* Look for the string literal. */
21103 /* Add it to the list. */
21105 /* If the next token is not a `,', then the list is
21106 complete. */
21109 /* Consume the `,' token. */
21111 }
21114 }
21116 /* Parse an asm-label-list.
21118 asm-label-list:
21119 identifier
21120 asm-label-list , identifier
21122 Returns a TREE_LIST, indicating the labels in the order that they
21123 appeared. The TREE_VALUE of each node is a label. */
21125 static tree
21127 {
21131 {
21134 /* Look for the identifier. */
21137 {
21140 {
21146 }
21147 }
21148 /* If the next token is not a `,', then the list is
21149 complete. */
21152 /* Consume the `,' token. */
21154 }
21157 }
21159 /* Return TRUE iff the next tokens in the stream are possibly the
21160 beginning of a GNU extension attribute. */
21162 static bool
21164 {
21166 }
21168 /* Return TRUE iff the next tokens in the stream are possibly the
21169 beginning of a standard C++-11 attribute specifier. */
21171 static bool
21173 {
21175 }
21177 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21178 beginning of a standard C++-11 attribute specifier. */
21180 static bool
21182 {
21190 }
21192 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21193 beginning of a GNU extension attribute. */
21195 static bool
21197 {
21201 }
21203 /* Return true iff the next tokens can be the beginning of either a
21204 GNU attribute list, or a standard C++11 attribute sequence. */
21206 static bool
21208 {
21211 }
21213 /* Return true iff the next Nth tokens can be the beginning of either
21214 a GNU attribute list, or a standard C++11 attribute sequence. */
21216 static bool
21218 {
21221 }
21223 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21224 of GNU attributes, or return NULL. */
21226 static tree
21228 {
21232 }
21234 /* Parse an (optional) series of attributes.
21236 attributes:
21237 attributes attribute
21239 attribute:
21240 __attribute__ (( attribute-list [opt] ))
21242 The return value is as for cp_parser_gnu_attribute_list. */
21244 static tree
21246 {
21250 {
21252 tree attribute_list;
21255 /* Peek at the next token. */
21257 /* If it's not `__attribute__', then we're done. */
21261 /* Consume the `__attribute__' keyword. */
21263 /* Look for the two `(' tokens. */
21267 /* Peek at the next token. */
21270 /* Parse the attribute-list. */
21272 else
21273 /* If the next token is a `)', then there is no attribute
21274 list. */
21277 /* Look for the two `)' tokens. */
21285 /* Add these new attributes to the list. */
21287 }
21290 }
21292 /* Parse a GNU attribute-list.
21294 attribute-list:
21295 attribute
21296 attribute-list , attribute
21298 attribute:
21299 identifier
21300 identifier ( identifier )
21301 identifier ( identifier , expression-list )
21302 identifier ( expression-list )
21304 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21305 to an attribute. The TREE_PURPOSE of each node is the identifier
21306 indicating which attribute is in use. The TREE_VALUE represents
21307 the arguments, if any. */
21309 static tree
21311 {
21317 {
21319 tree identifier;
21320 tree attribute;
21322 /* Look for the identifier. We also allow keywords here; for
21323 example `__attribute__ ((const))' is legal. */
21327 {
21330 /* Consume the token. */
21333 /* Save away the identifier that indicates which attribute
21334 this is. */
21336 /* For keywords, use the canonical spelling, not the
21337 parsed identifier. */
21343 /* Peek at the next token. */
21345 /* If it's an `(', then parse the attribute arguments. */
21347 {
21351 vec = cp_parser_parenthesized_expression_list
21357 else
21358 {
21361 }
21362 /* Save the arguments away. */
21364 }
21367 {
21368 /* Add this attribute to the list. */
21371 }
21374 }
21375 /* Now, look for more attributes. If the next token isn't a
21376 `,', we're done. */
21380 /* Consume the comma and keep going. */
21382 }
21385 /* We built up the list in reverse order. */
21387 }
21389 /* Parse a standard C++11 attribute.
21391 The returned representation is a TREE_LIST which TREE_PURPOSE is
21392 the scoped name of the attribute, and the TREE_VALUE is its
21393 arguments list.
21395 Note that the scoped name of the attribute is itself a TREE_LIST
21396 which TREE_PURPOSE is the namespace of the attribute, and
21397 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
21398 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
21399 and which TREE_PURPOSE is directly the attribute name.
21401 Clients of the attribute code should use get_attribute_namespace
21402 and get_attribute_name to get the actual namespace and name of
21403 attributes, regardless of their being GNU or C++11 attributes.
21405 attribute:
21406 attribute-token attribute-argument-clause [opt]
21408 attribute-token:
21409 identifier
21410 attribute-scoped-token
21412 attribute-scoped-token:
21413 attribute-namespace :: identifier
21415 attribute-namespace:
21416 identifier
21418 attribute-argument-clause:
21419 ( balanced-token-seq )
21421 balanced-token-seq:
21422 balanced-token [opt]
21423 balanced-token-seq balanced-token
21425 balanced-token:
21426 ( balanced-token-seq )
21427 [ balanced-token-seq ]
21428 { balanced-token-seq }. */
21430 static tree
21432 {
21436 /* First, parse name of the the attribute, a.k.a
21437 attribute-token. */
21454 {
21455 /* We are seeing a scoped attribute token. */
21465 else
21466 {
21470 }
21472 NULL_TREE);
21474 }
21475 else
21476 {
21478 NULL_TREE);
21479 /* C++11 noreturn attribute is equivalent to GNU's. */
21482 /* C++14 deprecated attribute is equivalent to GNU's. */
21485 }
21487 /* Now parse the optional argument clause of the attribute. */
21492 {
21498 /* A GNU attribute that takes an identifier in parameter. */
21501 vec = cp_parser_parenthesized_expression_list
21507 else
21508 {
21511 }
21515 else
21517 }
21520 }
21522 /* Parse a list of standard C++-11 attributes.
21524 attribute-list:
21525 attribute [opt]
21526 attribute-list , attribute[opt]
21527 attribute ...
21528 attribute-list , attribute ...
21529 */
21531 static tree
21533 {
21538 {
21543 {
21546 }
21551 }
21554 }
21556 /* Parse a standard C++-11 attribute specifier.
21558 attribute-specifier:
21559 [ [ attribute-list ] ]
21560 alignment-specifier
21562 alignment-specifier:
21563 alignas ( type-id ... [opt] )
21564 alignas ( alignment-expression ... [opt] ). */
21566 static tree
21568 {
21574 {
21583 else
21584 /* Warn about parsing c++11 attribute in non-c++1 mode, only
21585 when we are sure that we have actually parsed them. */
21587 }
21588 else
21589 {
21590 tree alignas_expr;
21592 /* Look for an alignment-specifier. */
21604 {
21607 }
21613 {
21617 alignas_expr =
21625 }
21628 {
21631 }
21635 /* Build the C++-11 representation of an 'aligned'
21636 attribute. */
21637 attributes =
21641 }
21644 }
21646 /* Parse a standard C++-11 attribute-specifier-seq.
21648 attribute-specifier-seq:
21649 attribute-specifier-seq [opt] attribute-specifier
21650 */
21652 static tree
21654 {
21658 {
21667 }
21671 }
21673 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
21674 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
21675 current value of the PEDANTIC flag, regardless of whether or not
21676 the `__extension__' keyword is present. The caller is responsible
21677 for restoring the value of the PEDANTIC flag. */
21679 static bool
21681 {
21682 /* Save the old value of the PEDANTIC flag. */
21686 {
21687 /* Consume the `__extension__' token. */
21689 /* We're not being pedantic while the `__extension__' keyword is
21690 in effect. */
21694 }
21697 }
21699 /* Parse a label declaration.
21701 label-declaration:
21702 __label__ label-declarator-seq ;
21704 label-declarator-seq:
21705 identifier , label-declarator-seq
21706 identifier */
21708 static void
21710 {
21711 /* Look for the `__label__' keyword. */
21715 {
21716 tree identifier;
21718 /* Look for an identifier. */
21720 /* If we failed, stop. */
21723 /* Declare it as a label. */
21725 /* If the next token is a `;', stop. */
21728 /* Look for the `,' separating the label declarations. */
21730 }
21732 /* Look for the final `;'. */
21734 }
21736 /* Support Functions */
21738 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
21739 NAME should have one of the representations used for an
21740 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
21741 is returned. If PARSER->SCOPE is a dependent type, then a
21742 SCOPE_REF is returned.
21744 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
21745 returned; the name was already resolved when the TEMPLATE_ID_EXPR
21746 was formed. Abstractly, such entities should not be passed to this
21747 function, because they do not need to be looked up, but it is
21748 simpler to check for this special case here, rather than at the
21749 call-sites.
21751 In cases not explicitly covered above, this function returns a
21752 DECL, OVERLOAD, or baselink representing the result of the lookup.
21753 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
21754 is returned.
21756 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
21757 (e.g., "struct") that was used. In that case bindings that do not
21758 refer to types are ignored.
21760 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
21761 ignored.
21763 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
21764 are ignored.
21766 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
21767 types.
21769 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
21770 TREE_LIST of candidates if name-lookup results in an ambiguity, and
21771 NULL_TREE otherwise. */
21773 static tree
21780 location_t name_location)
21781 {
21782 tree decl;
21785 /* Assume that the lookup will be unambiguous. */
21789 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
21790 no longer valid. Note that if we are parsing tentatively, and
21791 the parse fails, OBJECT_TYPE will be automatically restored. */
21797 /* A template-id has already been resolved; there is no lookup to
21798 do. */
21802 {
21806 }
21808 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
21809 it should already have been checked to make sure that the name
21810 used matches the type being destroyed. */
21812 {
21813 tree type;
21815 /* Figure out to which type this destructor applies. */
21820 else
21822 /* If that's not a class type, there is no destructor. */
21829 /* If it was a class type, return the destructor. */
21831 }
21833 /* By this point, the NAME should be an ordinary identifier. If
21834 the id-expression was a qualified name, the qualifying scope is
21835 stored in PARSER->SCOPE at this point. */
21838 /* Perform the lookup. */
21840 {
21846 /* If the SCOPE is dependent, the lookup must be deferred until
21847 the template is instantiated -- unless we are explicitly
21848 looking up names in uninstantiated templates. Even then, we
21849 cannot look up the name if the scope is not a class type; it
21850 might, for example, be a template type parameter. */
21855 /* Defer lookup. */
21857 else
21858 {
21861 /* If PARSER->SCOPE is a dependent type, then it must be a
21862 class type, and we must not be checking dependencies;
21863 otherwise, we would have processed this lookup above. So
21864 that PARSER->SCOPE is not considered a dependent base by
21865 lookup_member, we must enter the scope here. */
21869 /* If the PARSER->SCOPE is a template specialization, it
21870 may be instantiated during name lookup. In that case,
21871 errors may be issued. Even if we rollback the current
21872 tentative parse, those errors are valid. */
21877 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
21878 lookup result and the nested-name-specifier nominates a class C:
21879 * if the name specified after the nested-name-specifier, when
21880 looked up in C, is the injected-class-name of C (Clause 9), or
21881 * if the name specified after the nested-name-specifier is the
21882 same as the identifier or the simple-template-id's template-
21883 name in the last component of the nested-name-specifier,
21884 the name is instead considered to name the constructor of
21885 class C. [ Note: for example, the constructor is not an
21886 acceptable lookup result in an elaborated-type-specifier so
21887 the constructor would not be used in place of the
21888 injected-class-name. --end note ] Such a constructor name
21889 shall be used only in the declarator-id of a declaration that
21890 names a constructor or in a using-declaration. */
21898 /* If we have a single function from a using decl, pull it out. */
21905 }
21907 /* If the scope is a dependent type and either we deferred lookup or
21908 we did lookup but didn't find the name, rememeber the name. */
21911 {
21913 {
21914 tree type;
21916 /* The resolution to Core Issue 180 says that `struct
21917 A::B' should be considered a type-name, even if `A'
21918 is dependent. */
21923 }
21927 CPP_CLOSE_PAREN)))
21931 else
21934 is_template);
21935 }
21938 }
21940 {
21941 /* Look up the name in the scope of the OBJECT_TYPE, unless the
21942 OBJECT_TYPE is not a class. */
21944 /* If the OBJECT_TYPE is a template specialization, it may
21945 be instantiated during name lookup. In that case, errors
21946 may be issued. Even if we rollback the current tentative
21947 parse, those errors are valid. */
21949 name,
21952 tf_warning_or_error);
21953 else
21957 /* Look it up in the enclosing context. */
21963 }
21964 else
21965 {
21971 }
21973 /* If the lookup failed, let our caller know. */
21977 /* Pull out the template from an injected-class-name (or multiple). */
21981 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
21983 {
21986 /* The error message we have to print is too complicated for
21987 cp_parser_error, so we incorporate its actions directly. */
21989 {
21991 name);
21993 }
21995 }
22003 /* If we have resolved the name of a member declaration, check to
22004 see if the declaration is accessible. When the name resolves to
22005 set of overloaded functions, accessibility is checked when
22006 overload resolution is done.
22008 During an explicit instantiation, access is not checked at all,
22009 as per [temp.explicit]. */
22016 }
22018 /* Like cp_parser_lookup_name, but for use in the typical case where
22019 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22020 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22022 static tree
22024 {
22026 none_type,
22031 location);
22032 }
22034 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22035 the current context, return the TYPE_DECL. If TAG_NAME_P is
22036 true, the DECL indicates the class being defined in a class-head,
22037 or declared in an elaborated-type-specifier.
22039 Otherwise, return DECL. */
22041 static tree
22043 {
22044 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22045 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22047 struct A {
22048 template <typename T> struct B;
22049 };
22051 template <typename T> struct A::B {};
22053 Similarly, in an elaborated-type-specifier:
22055 namespace N { struct X{}; }
22057 struct A {
22058 template <typename T> friend struct N::X;
22059 };
22061 However, if the DECL refers to a class type, and we are in
22062 the scope of the class, then the name lookup automatically
22063 finds the TYPE_DECL created by build_self_reference rather
22064 than a TEMPLATE_DECL. For example, in:
22066 template <class T> struct S {
22067 S s;
22068 };
22070 there is no need to handle such case. */
22076 }
22078 /* If too many, or too few, template-parameter lists apply to the
22079 declarator, issue an error message. Returns TRUE if all went well,
22080 and FALSE otherwise. */
22082 static bool
22085 location_t declarator_location)
22086 {
22088 {
22090 {
22098 /* If the DECLARATOR has the form `X<y>' then it uses one
22099 additional level of template parameters. */
22102 return cp_parser_check_template_parameters
22104 }
22119 }
22121 }
22123 /* NUM_TEMPLATES were used in the current declaration. If that is
22124 invalid, return FALSE and issue an error messages. Otherwise,
22125 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22126 declarator and we can print more accurate diagnostics. */
22128 static bool
22131 location_t location,
22133 {
22134 /* If there are the same number of template classes and parameter
22135 lists, that's OK. */
22138 /* If there are more, but only one more, then we are referring to a
22139 member template. That's OK too. */
22142 /* If there are more template classes than parameter lists, we have
22143 something like:
22145 template <class T> void S<T>::R<T>::f (); */
22147 {
22157 else
22160 }
22161 /* Otherwise, there are too many template parameter lists. We have
22162 something like:
22164 template <class T> template <class U> void S::f(); */
22167 }
22169 /* Parse an optional `::' token indicating that the following name is
22170 from the global namespace. If so, PARSER->SCOPE is set to the
22171 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22172 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22173 Returns the new value of PARSER->SCOPE, if the `::' token is
22174 present, and NULL_TREE otherwise. */
22176 static tree
22178 {
22181 /* Peek at the next token. */
22183 /* If we're looking at a `::' token then we're starting from the
22184 global namespace, not our current location. */
22186 {
22187 /* Consume the `::' token. */
22189 /* Set the SCOPE so that we know where to start the lookup. */
22195 }
22197 {
22201 }
22204 }
22206 /* Returns TRUE if the upcoming token sequence is the start of a
22207 constructor declarator. If FRIEND_P is true, the declarator is
22208 preceded by the `friend' specifier. */
22210 static bool
22212 {
22214 tree nested_name_specifier;
22217 /* The common case is that this is not a constructor declarator, so
22218 try to avoid doing lots of work if at all possible. It's not
22219 valid declare a constructor at function scope. */
22222 /* And only certain tokens can begin a constructor declarator. */
22230 /* Parse tentatively; we are going to roll back all of the tokens
22231 consumed here. */
22233 /* Assume that we are looking at a constructor declarator. */
22236 /* Look for the optional `::' operator. */
22239 /* Look for the nested-name-specifier. */
22240 nested_name_specifier
22246 /* Outside of a class-specifier, there must be a
22247 nested-name-specifier. */
22255 /* If we have a class scope, this is easy; DR 147 says that S::S always
22256 names the constructor, and no other qualified name could. */
22259 {
22269 }
22270 /* If we still think that this might be a constructor-declarator,
22271 look for a class-name. */
22273 {
22274 /* If we have:
22276 template <typename T> struct S {
22277 S();
22278 };
22280 we must recognize that the nested `S' names a class. */
22281 tree type_decl;
22285 none_type,
22289 /* If there was no class-name, then this is not a constructor. */
22292 /* If we're still considering a constructor, we have to see a `(',
22293 to begin the parameter-declaration-clause, followed by either a
22294 `)', an `...', or a decl-specifier. We need to check for a
22295 type-specifier to avoid being fooled into thinking that:
22297 S (f) (int);
22299 is a constructor. (It is actually a function named `f' that
22300 takes one parameter (of type `int') and returns a value of type
22301 `S'. */
22309 /* A parameter declaration begins with a decl-specifier,
22310 which is either the "attribute" keyword, a storage class
22311 specifier, or (usually) a type-specifier. */
22313 {
22314 tree type;
22318 /* Names appearing in the type-specifier should be looked up
22319 in the scope of the class. */
22322 else
22323 {
22326 {
22330 {
22333 }
22334 }
22336 }
22338 /* Inside the constructor parameter list, surrounding
22339 template-parameter-lists do not apply. */
22340 saved_num_template_parameter_lists
22344 /* Look for the type-specifier. */
22346 CP_PARSER_FLAGS_NONE,
22352 parser->num_template_parameter_lists
22355 /* Leave the scope of the class. */
22360 }
22361 }
22363 /* We did not really want to consume any tokens. */
22367 }
22369 /* Parse the definition of the function given by the DECL_SPECIFIERS,
22370 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
22371 they must be performed once we are in the scope of the function.
22373 Returns the function defined. */
22375 static tree
22376 cp_parser_function_definition_from_specifiers_and_declarator
22379 tree attributes,
22381 {
22382 tree fn;
22385 /* Begin the function-definition. */
22388 /* The things we're about to see are not directly qualified by any
22389 template headers we've seen thus far. */
22392 /* If there were names looked up in the decl-specifier-seq that we
22393 did not check, check them now. We must wait until we are in the
22394 scope of the function to perform the checks, since the function
22395 might be a friend. */
22399 {
22402 }
22405 {
22406 /* Skip the entire function. */
22409 }
22411 {
22412 /* Seen already, skip it. An error message has already been output. */
22416 /* If this is a function from a class, pop the nested class. */
22419 }
22420 else
22421 {
22422 timevar_id_t tv;
22425 else
22431 }
22434 }
22436 /* Parse the part of a function-definition that follows the
22437 declarator. INLINE_P is TRUE iff this function is an inline
22438 function defined within a class-specifier.
22440 Returns the function defined. */
22442 static tree
22445 {
22446 tree fn;
22455 /* If the next token is `return', then the code may be trying to
22456 make use of the "named return value" extension that G++ used to
22457 support. */
22460 {
22461 /* Consume the `return' keyword. */
22463 /* Look for the identifier that indicates what value is to be
22464 returned. */
22466 /* Issue an error message. */
22469 /* Skip tokens until we reach the start of the function body. */
22471 {
22478 }
22479 }
22480 /* The `extern' in `extern "C" void f () { ... }' does not apply to
22481 anything declared inside `f'. */
22482 saved_in_unbraced_linkage_specification_p
22485 /* Inside the function, surrounding template-parameter-lists do not
22486 apply. */
22487 saved_num_template_parameter_lists
22493 /* If the next token is `try', `__transaction_atomic', or
22494 `__transaction_relaxed`, then we are looking at either function-try-block
22495 or function-transaction-block. Note that all of these include the
22496 function-body. */
22499 RID_TRANSACTION_ATOMIC);
22501 RID_TRANSACTION_RELAXED))
22503 RID_TRANSACTION_RELAXED);
22506 else
22507 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22512 /* Finish the function. */
22515 /* Generate code for it, if necessary. */
22517 /* Restore the saved values. */
22518 parser->in_unbraced_linkage_specification_p
22520 parser->num_template_parameter_lists
22528 }
22530 /* Parse a template-declaration, assuming that the `export' (and
22531 `extern') keywords, if present, has already been scanned. MEMBER_P
22532 is as for cp_parser_template_declaration. */
22534 static void
22536 {
22539 tree parameter_list;
22544 /* Look for the `template' keyword. */
22549 /* And the `<'. */
22553 {
22554 /* 14.5.2.2 [temp.mem]
22556 A local class shall not have member templates. */
22561 }
22562 /* [temp]
22564 A template ... shall not have C linkage. */
22566 {
22568 /* Give it C++ linkage to avoid confusing other parts of the
22569 front end. */
22572 }
22573 else
22576 /* We cannot perform access checks on the template parameter
22577 declarations until we know what is being declared, just as we
22578 cannot check the decl-specifier list. */
22581 /* If the next token is `>', then we have an invalid
22582 specialization. Rather than complain about an invalid template
22583 parameter, issue an error message here. */
22585 {
22589 }
22590 else
22591 {
22592 /* Parse the template parameters. */
22594 }
22596 /* Get the deferred access checks from the parameter list. These
22597 will be checked once we know what is being declared, as for a
22598 member template the checks must be performed in the scope of the
22599 class containing the member. */
22602 /* Look for the `>'. */
22604 /* We just processed one more parameter list. */
22606 /* If the next token is `template', there are more template
22607 parameters. */
22609 RID_TEMPLATE))
22614 else
22615 {
22616 /* There are no access checks when parsing a template, as we do not
22617 know if a specialization will be a friend. */
22621 checks,
22622 member_p,
22627 /* If this is a member template declaration, let the front
22628 end know. */
22630 {
22635 }
22640 }
22641 /* We are done with the current parameter list. */
22646 /* Finish up. */
22649 /* Check the template arguments for a literal operator template. */
22653 {
22657 else
22658 {
22661 {
22667 }
22669 {
22677 }
22678 else
22680 }
22683 " Expected non-type template argument pack <char...>"
22685 decl);
22686 }
22687 /* Register member declarations. */
22690 /* For the erroneous case of a template with C linkage, we pushed an
22691 implicit C++ linkage scope; exit that scope now. */
22694 /* If DECL is a function template, we must return to parse it later.
22695 (Even though there is no definition, there might be default
22696 arguments that need handling.) */
22700 }
22702 /* Perform the deferred access checks from a template-parameter-list.
22703 CHECKS is a TREE_LIST of access checks, as returned by
22704 get_deferred_access_checks. */
22706 static void
22707 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
22708 {
22712 }
22714 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
22715 `function-definition' sequence that follows a template header.
22716 If MEMBER_P is true, this declaration appears in a class scope.
22718 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
22719 *FRIEND_P is set to TRUE iff the declaration is a friend. */
22721 static tree
22727 {
22730 cp_decl_specifier_seq decl_specifiers;
22734 /* This function is only used when processing a template
22735 declaration. */
22739 /* Defer access checks until we know what is being declared. */
22742 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
22743 alternative. */
22746 CP_PARSER_FLAGS_OPTIONAL,
22752 /* There are no template typedefs. */
22754 {
22758 }
22760 /* Gather up the access checks that occurred the
22761 decl-specifier-seq. */
22764 /* Check for the declaration of a template class. */
22766 {
22768 {
22771 /* In this case:
22773 struct C {
22774 friend template <typename T> struct A<T>::B;
22775 };
22777 A<T>::B will be represented by a TYPENAME_TYPE, and
22778 therefore not recognized by shadow_tag. */
22780 && !decl
22787 else
22790 /* Perform access checks for template parameters. */
22792 }
22793 }
22795 /* Complain about missing 'typename' or other invalid type names. */
22798 {
22799 /* cp_parser_parse_and_diagnose_invalid_type_name calls
22800 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
22801 the rest of this declaration. */
22804 }
22806 /* If it's not a template class, try for a template function. If
22807 the next token is a `;', then this declaration does not declare
22808 anything. But, if there were errors in the decl-specifiers, then
22809 the error might well have come from an attempted class-specifier.
22810 In that case, there's no need to warn about a missing declarator. */
22814 {
22817 checks,
22819 member_p,
22820 declares_class_or_enum,
22822 NULL);
22824 /* 7.1.1-1 [dcl.stc]
22826 A storage-class-specifier shall not be specified in an explicit
22827 specialization... */
22829 && explicit_specialization_p
22831 {
22835 }
22839 }
22841 /* Look for a trailing `;' after the declaration. */
22847 out:
22850 /* Clear any current qualification; whatever comes next is the start
22851 of something new. */
22857 }
22859 /* Parse a cast-expression that is not the operand of a unary "&". */
22861 static tree
22863 {
22866 }
22868 /* Parse a functional cast to TYPE. Returns an expression
22869 representing the cast. */
22871 static tree
22873 {
22875 tree expression_list;
22876 tree cast;
22880 {
22887 tf_warning_or_error);
22888 }
22897 else
22898 {
22901 }
22904 tf_warning_or_error);
22905 /* [expr.const]/1: In an integral constant expression "only type
22906 conversions to integral or enumeration type can be used". */
22912 NIC_CONSTRUCTOR))
22915 }
22917 /* Save the tokens that make up the body of a member function defined
22918 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
22919 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
22920 specifiers applied to the declaration. Returns the FUNCTION_DECL
22921 for the member function. */
22923 static tree
22927 tree attributes)
22928 {
22931 tree fn;
22933 /* Create the FUNCTION_DECL. */
22936 /* If something went badly wrong, bail out now. */
22938 {
22939 /* If there's a function-body, skip it. */
22944 }
22946 /* Remember it, if there default args to post process. */
22949 /* Save away the tokens that make up the body of the
22950 function. */
22952 /* Handle function try blocks. */
22955 /* We can have braced-init-list mem-initializers before the fn body. */
22957 {
22960 {
22961 /* cache_group will stop after an un-nested { } pair, too. */
22965 /* variadic mem-inits have ... after the ')'. */
22968 }
22969 }
22971 /* Handle function try blocks. */
22976 /* Save away the inline definition; we will process it when the
22977 class is complete. */
22981 /* We need to know that this was defined in the class, so that
22982 friend templates are handled correctly. */
22985 /* Add FN to the queue of functions to be parsed later. */
22989 }
22991 /* Save the tokens that make up the in-class initializer for a non-static
22992 data member. Returns a DEFAULT_ARG. */
22994 static tree
22996 {
22998 }
23000 /* Parse a template-argument-list, as well as the trailing ">" (but
23001 not the opening "<"). See cp_parser_template_argument_list for the
23002 return value. */
23004 static tree
23006 {
23007 tree arguments;
23008 tree saved_scope;
23009 tree saved_qualifying_scope;
23010 tree saved_object_scope;
23015 /* [temp.names]
23017 When parsing a template-id, the first non-nested `>' is taken as
23018 the end of the template-argument-list rather than a greater-than
23019 operator. */
23020 saved_greater_than_is_operator_p
23023 /* Parsing the argument list may modify SCOPE, so we save it
23024 here. */
23028 /* We need to evaluate the template arguments, even though this
23029 template-id may be nested within a "sizeof". */
23034 /* Parse the template-argument-list itself. */
23038 else
23040 /* Look for the `>' that ends the template-argument-list. If we find
23041 a '>>' instead, it's probably just a typo. */
23043 {
23045 {
23046 /* In C++0x, a `>>' in a template argument list or cast
23047 expression is considered to be two separate `>'
23048 tokens. So, change the current token to a `>', but don't
23049 consume it: it will be consumed later when the outer
23050 template argument list (or cast expression) is parsed.
23051 Note that this replacement of `>' for `>>' is necessary
23052 even if we are parsing tentatively: in the tentative
23053 case, after calling
23054 cp_parser_enclosed_template_argument_list we will always
23055 throw away all of the template arguments and the first
23056 closing `>', either because the template argument list
23057 was erroneous or because we are replacing those tokens
23058 with a CPP_TEMPLATE_ID token. The second `>' (which will
23059 not have been thrown away) is needed either to close an
23060 outer template argument list or to complete a new-style
23061 cast. */
23064 }
23066 {
23067 /* If we're in a nested template argument list, the '>>' has
23068 to be a typo for '> >'. We emit the error message, but we
23069 continue parsing and we push a '>' as next token, so that
23070 the argument list will be parsed correctly. Note that the
23071 global source location is still on the token before the
23072 '>>', so we need to say explicitly where we want it. */
23078 }
23079 else
23080 {
23081 /* If this is not a nested template argument list, the '>>'
23082 is a typo for '>'. Emit an error message and continue.
23083 Same deal about the token location, but here we can get it
23084 right by consuming the '>>' before issuing the diagnostic. */
23087 "spurious %<>>%>, use %<>%> to terminate "
23089 }
23090 }
23091 else
23093 /* The `>' token might be a greater-than operator again now. */
23094 parser->greater_than_is_operator_p
23096 /* Restore the SAVED_SCOPE. */
23104 }
23106 /* MEMBER_FUNCTION is a member function, or a friend. If default
23107 arguments, or the body of the function have not yet been parsed,
23108 parse them now. */
23110 static void
23112 {
23114 /* If this member is a template, get the underlying
23115 FUNCTION_DECL. */
23119 /* There should not be any class definitions in progress at this
23120 point; the bodies of members are only parsed outside of all class
23121 definitions. */
23123 /* While we're parsing the member functions we might encounter more
23124 classes. We want to handle them right away, but we don't want
23125 them getting mixed up with functions that are currently in the
23126 queue. */
23129 /* Make sure that any template parameters are in scope. */
23132 /* If the body of the function has not yet been parsed, parse it
23133 now. */
23135 {
23136 tree function_scope;
23139 /* The function is no longer pending; we are processing it. */
23144 /* If this is a local class, enter the scope of the containing
23145 function. */
23150 /* Push the body of the function onto the lexer stack. */
23153 /* Let the front end know that we going to be defining this
23154 function. */
23158 /* Don't do access checking if it is a templated function. */
23162 /* #pragma omp declare reduction needs special parsing. */
23164 {
23169 }
23170 else
23171 /* Now, parse the body of the function. */
23178 /* Leave the scope of the containing function. */
23182 }
23184 /* Remove any template parameters from the symbol table. */
23187 /* Restore the queue. */
23190 }
23192 /* If DECL contains any default args, remember it on the unparsed
23193 functions queue. */
23195 static void
23197 {
23198 tree probe;
23201 probe;
23204 {
23208 }
23209 }
23211 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23212 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23213 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23214 from the parameter-type-list. */
23216 static tree
23219 {
23221 tree parsed_arg;
23227 /* Push the saved tokens for the default argument onto the parser's
23228 lexer stack. */
23234 /* Parse the default argument. */
23245 {
23246 /* In a non-template class, check conversions now. In a template,
23247 we'll wait and instantiate these as needed. */
23250 tf_warning_or_error);
23251 else
23252 {
23259 /* This represents the whole initialization. */
23261 }
23262 }
23264 /* If the token stream has not been completely used up, then
23265 there was extra junk after the end of the default
23266 argument. */
23268 {
23271 else
23273 }
23275 /* Revert to the main lexer. */
23279 }
23281 /* FIELD is a non-static data member with an initializer which we saved for
23282 later; parse it now. */
23284 static void
23286 {
23287 tree def;
23292 NULL_TREE);
23296 }
23298 /* FN is a FUNCTION_DECL which may contains a parameter with an
23299 unparsed DEFAULT_ARG. Parse the default args now. This function
23300 assumes that the current scope is the scope in which the default
23301 argument should be processed. */
23303 static void
23305 {
23309 /* While we're parsing the default args, we might (due to the
23310 statement expression extension) encounter more classes. We want
23311 to handle them right away, but we don't want them getting mixed
23312 up with default args that are currently in the queue. */
23315 /* Local variable names (and the `this' keyword) may not appear
23316 in a default argument. */
23327 {
23329 tree parsed_arg;
23331 tree copy;
23338 /* This can happen for a friend declaration for a function
23339 already declared with default arguments. */
23342 parsed_arg
23344 default_arg,
23347 {
23349 }
23353 /* Update any instantiations we've already created. */
23357 }
23361 /* Make sure no default arg is missing. */
23364 /* Restore the state of local_variables_forbidden_p. */
23367 /* Restore the queue. */
23369 }
23371 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
23373 sizeof ... ( identifier )
23375 where the 'sizeof' token has already been consumed. */
23377 static tree
23379 {
23380 /* Consume the `...'. */
23387 else
23395 /* The name is not qualified. */
23413 }
23415 /* Parse the operand of `sizeof' (or a similar operator). Returns
23416 either a TYPE or an expression, depending on the form of the
23417 input. The KEYWORD indicates which kind of expression we have
23418 encountered. */
23420 static tree
23422 {
23429 /* If it's a `...', then we are computing the length of a parameter
23430 pack. */
23435 /* Types cannot be defined in a `sizeof' expression. Save away the
23436 old message. */
23438 /* And create the new one. */
23444 /* The restrictions on constant-expressions do not apply inside
23445 sizeof expressions. */
23446 saved_integral_constant_expression_p
23448 saved_non_integral_constant_expression_p
23452 /* Do not actually evaluate the expression. */
23455 /* If it's a `(', then we might be looking at the type-id
23456 construction. */
23458 {
23462 /* We can't be sure yet whether we're looking at a type-id or an
23463 expression. */
23465 /* Consume the `('. */
23467 /* Note: as a GNU Extension, compound literals are considered
23468 postfix-expressions as they are in C99, so they are valid
23469 arguments to sizeof. See comment in cp_parser_cast_expression
23470 for details. */
23472 /* Skip tokens until the next token is a closing parenthesis.
23473 If we find the closing `)', and the next token is a `{', then
23474 we are looking at a compound-literal. */
23475 compound_literal_p
23479 /* Roll back the tokens we skipped. */
23481 /* If we were looking at a compound-literal, simulate an error
23482 so that the call to cp_parser_parse_definitely below will
23483 fail. */
23486 else
23487 {
23490 /* Look for the type-id. */
23492 /* Look for the closing `)'. */
23495 }
23497 /* If all went well, then we're done. */
23499 {
23500 cp_decl_specifier_seq decl_specs;
23502 /* Build a trivial decl-specifier-seq. */
23506 /* Call grokdeclarator to figure out what type this is. */
23509 TYPENAME,
23512 }
23513 }
23515 /* If the type-id production did not work out, then we must be
23516 looking at the unary-expression production. */
23521 /* Go back to evaluating expressions. */
23525 /* Free the message we created. */
23527 /* And restore the old one. */
23529 parser->integral_constant_expression_p
23531 parser->non_integral_constant_expression_p
23535 }
23537 /* If the current declaration has no declarator, return true. */
23539 static bool
23541 {
23542 /* If the next token is a `;' or a `,' then there is no
23543 declarator. */
23546 }
23548 /* Update the DECL_SPECS to reflect the storage class indicated by
23549 KEYWORD. */
23551 static void
23556 {
23557 cp_storage_class storage_class;
23560 {
23564 }
23566 {
23569 }
23574 {
23577 }
23580 {
23598 }
23602 /* A storage class specifier cannot be applied alongside a typedef
23603 specifier. If there is a typedef specifier present then set
23604 conflicting_specifiers_p which will trigger an error later
23605 on in grokdeclarator. */
23608 }
23610 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
23611 is true, the type is a class or enum definition. */
23613 static void
23615 tree type_spec,
23618 {
23621 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
23622 (with, for example, in "typedef int wchar_t;") we remember that
23623 this is what happened. In system headers, we ignore these
23624 declarations so that G++ can work with system headers that are not
23625 C++-safe. */
23627 && !type_definition_p
23637 {
23640 ds_redefined_builtin_type_spec,
23641 token);
23643 {
23647 }
23648 }
23651 else
23652 {
23657 }
23658 }
23660 /* True iff TOKEN is the GNU keyword __thread. */
23662 static bool
23664 {
23667 }
23669 /* Set the location for a declarator specifier and check if it is
23670 duplicated.
23672 DECL_SPECS is the sequence of declarator specifiers onto which to
23673 set the location.
23675 DS is the single declarator specifier to set which location is to
23676 be set onto the existing sequence of declarators.
23678 LOCATION is the location for the declarator specifier to
23679 consider. */
23681 static void
23684 {
23693 {
23697 }
23698 else
23699 {
23701 {
23705 else
23706 {
23709 OPT_Wlong_long,
23711 }
23712 }
23714 {
23719 else
23721 }
23722 else
23723 {
23739 "__complex"
23740 };
23743 }
23744 }
23745 }
23747 /* Return true iff the declarator specifier DS is present in the
23748 sequence of declarator specifiers DECL_SPECS. */
23750 bool
23752 cp_decl_spec ds)
23753 {
23760 }
23762 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
23763 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
23765 static bool
23767 {
23769 }
23771 /* Issue an error message indicating that TOKEN_DESC was expected.
23772 If KEYWORD is true, it indicated this function is called by
23773 cp_parser_require_keword and the required token can only be
23774 a indicated keyword. */
23776 static void
23778 required_token token_desc,
23780 {
23782 {
23851 }
23853 {
23855 {
23934 }
23935 }
23936 else
23938 }
23942 /* If the next token is of the indicated TYPE, consume it. Otherwise,
23943 issue an error message indicating that TOKEN_DESC was expected.
23945 Returns the token consumed, if the token had the appropriate type.
23946 Otherwise, returns NULL. */
23951 required_token token_desc)
23952 {
23955 else
23956 {
23957 /* Output the MESSAGE -- unless we're parsing tentatively. */
23961 }
23962 }
23964 /* An error message is produced if the next token is not '>'.
23965 All further tokens are skipped until the desired token is
23966 found or '{', '}', ';' or an unbalanced ')' or ']'. */
23968 static void
23970 {
23971 /* Current level of '< ... >'. */
23973 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
23976 /* Are we ready, yet? If not, issue error message. */
23980 /* Skip tokens until the desired token is found. */
23982 {
23983 /* Peek at the next token. */
23985 {
23993 /* C++0x views the `>>' operator as two `>' tokens, but
23994 C++98 does not. */
23997 {
23998 /* We've hit a `>>' where the first `>' closes the
23999 template argument list, and the second `>' is
24000 spurious. Just consume the `>>' and stop; we've
24001 already produced at least one error. */
24004 }
24005 /* Fall through for C++0x, so we handle the second `>' in
24006 the `>>'. */
24010 {
24011 /* We've reached the token we want, consume it and stop. */
24014 }
24033 /* The '>' was probably forgotten, don't look further. */
24038 }
24040 /* Consume this token. */
24042 }
24043 }
24045 /* If the next token is the indicated keyword, consume it. Otherwise,
24046 issue an error message indicating that TOKEN_DESC was expected.
24048 Returns the token consumed, if the token had the appropriate type.
24049 Otherwise, returns NULL. */
24054 required_token token_desc)
24055 {
24059 {
24062 }
24065 }
24067 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24068 function-definition. */
24070 static bool
24072 {
24075 /* A ctor-initializer begins with a `:'. */
24077 /* A function-try-block begins with `try'. */
24079 /* A function-transaction-block begins with `__transaction_atomic'
24080 or `__transaction_relaxed'. */
24083 /* The named return value extension begins with `return'. */
24085 }
24087 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24088 definition. */
24090 static bool
24092 {
24099 }
24101 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24102 C++0x) ending a template-argument. */
24104 static bool
24106 {
24114 }
24116 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24117 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24119 static bool
24122 {
24128 /* Check for the sequence `<::' in the original code. It would be lexed as
24129 `[:', where `[' is a digraph, and there is no whitespace before
24130 `:'. */
24132 {
24137 }
24139 }
24141 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24142 or none_type otherwise. */
24144 static enum tag_types
24146 {
24148 {
24158 }
24159 }
24161 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24163 static void
24165 {
24169 {
24173 type))
24176 }
24177 }
24179 /* Issue an error message if DECL is redeclared with different
24180 access than its original declaration [class.access.spec/3].
24181 This applies to nested classes and nested class templates.
24182 [class.mem/1]. */
24184 static void
24186 {
24195 }
24197 /* Look for the `template' keyword, as a syntactic disambiguator.
24198 Return TRUE iff it is present, in which case it will be
24199 consumed. */
24201 static bool
24203 {
24205 {
24206 /* In C++98 the `template' keyword can only be used within templates;
24207 outside templates the parser can always figure out what is a
24208 template and what is not. In C++11, per the resolution of DR 468,
24209 `template' is allowed in cases where it is not strictly necessary. */
24212 {
24215 "in C++98 %<template%> (as a disambiguator) is only "
24217 /* If this part of the token stream is rescanned, the same
24218 error message would be generated. So, we purge the token
24219 from the stream. */
24222 }
24223 else
24224 {
24225 /* Consume the `template' keyword. */
24228 }
24229 }
24231 }
24233 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24234 set PARSER->SCOPE, and perform other related actions. */
24236 static void
24238 {
24244 /* Get the stored value. */
24246 /* Perform any access checks that were deferred. */
24249 {
24254 }
24255 /* Set the scope from the stored value. */
24259 }
24261 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24262 encounter the end of a block before what we were looking for. */
24264 static bool
24268 {
24270 {
24273 /* Abort a parenthesized expression if we encounter a semicolon. */
24277 /* If we've reached the end of the file, stop. */
24283 /* We've hit the end of an enclosing block, so there's been some
24284 kind of syntax error. */
24287 /* Consume the token. */
24289 /* See if it starts a new group. */
24291 {
24293 /* In theory this should probably check end == '}', but
24294 cp_parser_save_member_function_body needs it to exit
24295 after either '}' or ')' when called with ')'. */
24298 }
24300 {
24304 }
24309 }
24310 }
24312 /* Like above, for caching a default argument or NSDMI. Both of these are
24313 terminated by a non-nested comma, but it can be unclear whether or not a
24314 comma is nested in a template argument list unless we do more parsing.
24315 In order to handle this ambiguity, when we encounter a ',' after a '<'
24316 we try to parse what follows as a parameter-declaration-list (in the
24317 case of a default argument) or a member-declarator (in the case of an
24318 NSDMI). If that succeeds, then we stop caching. */
24320 static tree
24322 {
24327 tree default_argument;
24329 /* Add tokens until we have processed the entire default
24330 argument. We add the range [first_token, token). */
24333 {
24334 /* For list-initialization, this is straightforward. */
24337 }
24339 {
24342 /* Peek at the next token. */
24344 /* What we do depends on what token we have. */
24346 {
24347 /* In valid code, a default argument must be
24348 immediately followed by a `,' `)', or `...'. */
24351 {
24352 /* If we've seen a '<', we might be in a
24353 template-argument-list. Until Core issue 325 is
24354 resolved, we don't know how this situation ought
24355 to be handled, so try to DTRT. We check whether
24356 what comes after the comma is a valid parameter
24357 declaration list. If it is, then the comma ends
24358 the default argument; otherwise the default
24359 argument continues. */
24362 /* Set ITALP so cp_parser_parameter_declaration_list
24363 doesn't decide to commit to this parse. */
24371 {
24377 }
24378 else
24379 {
24383 }
24390 }
24393 /* If we run into a non-nested `;', `}', or `]',
24394 then the code is invalid -- but the default
24395 argument is certainly over. */
24400 /* Handle correctly int n = sizeof ... ( p ); */
24403 /* Update DEPTH, if necessary. */
24418 /* This might be the comparison operator, or it might
24419 start a template argument list. */
24426 /* Fall through for C++0x, which treats the `>>'
24427 operator like two `>' tokens in certain
24428 cases. */
24432 {
24433 /* This might be an operator, or it might close a
24434 template argument list. But if a previous '<'
24435 started a template argument list, this will have
24436 closed it, so we can't be in one anymore. */
24440 }
24443 /* If we run out of tokens, issue an error message. */
24452 /* In these cases, we should look for template-ids.
24453 For example, if the default argument is
24454 `X<int, double>()', we need to do name lookup to
24455 figure out whether or not `X' is a template; if
24456 so, the `,' does not end the default argument.
24458 That is not yet done. */
24463 }
24465 /* If we've reached the end, stop. */
24469 /* Add the token to the token block. */
24471 }
24473 /* Create a DEFAULT_ARG to represent the unparsed default
24474 argument. */
24481 }
24483 /* Begin parsing tentatively. We always save tokens while parsing
24484 tentatively so that if the tentative parsing fails we can restore the
24485 tokens. */
24487 static void
24489 {
24490 /* Enter a new parsing context. */
24492 /* Begin saving tokens. */
24494 /* In order to avoid repetitive access control error messages,
24495 access checks are queued up until we are no longer parsing
24496 tentatively. */
24498 }
24500 /* Commit to the currently active tentative parse. */
24502 static void
24504 {
24508 /* Mark all of the levels as committed. */
24511 {
24518 }
24519 }
24521 /* Commit to the topmost currently active tentative parse.
24523 Note that this function shouldn't be called when there are
24524 irreversible side-effects while in a tentative state. For
24525 example, we shouldn't create a permanent entry in the symbol
24526 table, or issue an error message that might not apply if the
24527 tentative parse is aborted. */
24529 static void
24531 {
24536 {
24544 }
24545 }
24547 /* Abort the currently active tentative parse. All consumed tokens
24548 will be rolled back, and no diagnostics will be issued. */
24550 static void
24552 {
24556 /* Now, pretend that we want to see if the construct was
24557 successfully parsed. */
24559 }
24561 /* Stop parsing tentatively. If a parse error has occurred, restore the
24562 token stream. Otherwise, commit to the tokens we have consumed.
24563 Returns true if no error occurred; false otherwise. */
24565 static bool
24567 {
24571 /* Remember whether or not an error occurred, since we are about to
24572 destroy that information. */
24574 /* Remove the topmost context from the stack. */
24577 /* If no parse errors occurred, commit to the tentative parse. */
24579 {
24580 /* Commit to the tokens read tentatively, unless that was
24581 already done. */
24586 }
24587 /* Otherwise, if errors occurred, roll back our state so that things
24588 are just as they were before we began the tentative parse. */
24589 else
24590 {
24593 }
24594 /* Add the context to the front of the free list. */
24599 }
24601 /* Returns true if we are parsing tentatively and are not committed to
24602 this tentative parse. */
24604 static bool
24606 {
24609 }
24611 /* Returns nonzero iff an error has occurred during the most recent
24612 tentative parse. */
24614 static bool
24616 {
24619 }
24621 /* Returns nonzero if GNU extensions are allowed. */
24623 static bool
24625 {
24627 }
24628 \f
24629 /* Objective-C++ Productions */
24632 /* Parse an Objective-C expression, which feeds into a primary-expression
24633 above.
24635 objc-expression:
24636 objc-message-expression
24637 objc-string-literal
24638 objc-encode-expression
24639 objc-protocol-expression
24640 objc-selector-expression
24642 Returns a tree representation of the expression. */
24644 static tree
24646 {
24647 /* Try to figure out what kind of declaration is present. */
24651 {
24661 {
24673 }
24679 }
24682 }
24684 /* Parse an Objective-C message expression.
24686 objc-message-expression:
24687 [ objc-message-receiver objc-message-args ]
24689 Returns a representation of an Objective-C message. */
24691 static tree
24693 {
24702 }
24704 /* Parse an objc-message-receiver.
24706 objc-message-receiver:
24707 expression
24708 simple-type-specifier
24710 Returns a representation of the type or expression. */
24712 static tree
24714 {
24715 tree rcv;
24717 /* An Objective-C message receiver may be either (1) a type
24718 or (2) an expression. */
24727 CP_PARSER_FLAGS_NONE);
24730 }
24732 /* Parse the arguments and selectors comprising an Objective-C message.
24734 objc-message-args:
24735 objc-selector
24736 objc-selector-args
24737 objc-selector-args , objc-comma-args
24739 objc-selector-args:
24740 objc-selector [opt] : assignment-expression
24741 objc-selector-args objc-selector [opt] : assignment-expression
24743 objc-comma-args:
24744 assignment-expression
24745 objc-comma-args , assignment-expression
24747 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
24748 selector arguments and TREE_VALUE containing a list of comma
24749 arguments. */
24751 static tree
24753 {
24759 {
24765 /* Detect if we have a unary selector. */
24774 sel_args
24779 }
24781 /* Handle non-selector arguments, if any. */
24783 {
24784 tree arg;
24789 addl_args
24794 }
24797 {
24800 }
24803 }
24805 /* Parse an Objective-C encode expression.
24807 objc-encode-expression:
24808 @encode objc-typename
24810 Returns an encoded representation of the type argument. */
24812 static tree
24814 {
24815 tree type;
24825 {
24829 }
24831 /* This happens if we find @encode(T) (where T is a template
24832 typename or something dependent on a template typename) when
24833 parsing a template. In that case, we can't compile it
24834 immediately, but we rather create an AT_ENCODE_EXPR which will
24835 need to be instantiated when the template is used.
24836 */
24838 {
24842 }
24845 }
24847 /* Parse an Objective-C @defs expression. */
24849 static tree
24851 {
24852 tree name;
24860 }
24862 /* Parse an Objective-C protocol expression.
24864 objc-protocol-expression:
24865 @protocol ( identifier )
24867 Returns a representation of the protocol expression. */
24869 static tree
24871 {
24872 tree proto;
24880 }
24882 /* Parse an Objective-C selector expression.
24884 objc-selector-expression:
24885 @selector ( objc-method-signature )
24887 objc-method-signature:
24888 objc-selector
24889 objc-selector-seq
24891 objc-selector-seq:
24892 objc-selector :
24893 objc-selector-seq objc-selector :
24895 Returns a representation of the method selector. */
24897 static tree
24899 {
24911 {
24920 {
24921 /* Detect if we have a unary selector. */
24923 {
24926 }
24927 else
24928 {
24930 }
24931 }
24936 {
24937 sel_seq
24940 sel_seq
24943 }
24944 else
24945 sel_seq
24950 }
24952 finish_selector:
24956 }
24958 /* Parse a list of identifiers.
24960 objc-identifier-list:
24961 identifier
24962 objc-identifier-list , identifier
24964 Returns a TREE_LIST of identifier nodes. */
24966 static tree
24968 {
24969 tree identifier;
24970 tree list;
24981 {
24988 identifier));
24990 }
24993 }
24995 /* Parse an Objective-C alias declaration.
24997 objc-alias-declaration:
24998 @compatibility_alias identifier identifier ;
25000 This function registers the alias mapping with the Objective-C front end.
25001 It returns nothing. */
25003 static void
25005 {
25013 }
25015 /* Parse an Objective-C class forward-declaration.
25017 objc-class-declaration:
25018 @class objc-identifier-list ;
25020 The function registers the forward declarations with the Objective-C
25021 front end. It returns nothing. */
25023 static void
25025 {
25028 {
25029 tree id;
25039 else
25041 }
25043 }
25045 /* Parse a list of Objective-C protocol references.
25047 objc-protocol-refs-opt:
25048 objc-protocol-refs [opt]
25050 objc-protocol-refs:
25051 < objc-identifier-list >
25053 Returns a TREE_LIST of identifiers, if any. */
25055 static tree
25057 {
25061 {
25065 }
25068 }
25070 /* Parse a Objective-C visibility specification. */
25072 static void
25074 {
25078 {
25093 }
25095 /* Eat '@private'/'@protected'/'@public'. */
25097 }
25099 /* Parse an Objective-C method type. Return 'true' if it is a class
25100 (+) method, and 'false' if it is an instance (-) method. */
25104 {
25107 else
25109 }
25111 /* Parse an Objective-C protocol qualifier. */
25113 static tree
25115 {
25128 {
25133 }
25136 }
25138 /* Parse an Objective-C typename. */
25140 static tree
25142 {
25146 {
25152 /* An ObjC type name may consist of just protocol qualifiers, in which
25153 case the type shall default to 'id'. */
25155 {
25158 /* If the type could not be parsed, an error has already
25159 been produced. For error recovery, behave as if it had
25160 not been specified, which will use the default type
25161 'id'. */
25163 {
25165 /* We need to skip to the closing parenthesis as
25166 cp_parser_type_id() does not seem to do it for
25167 us. */
25172 }
25173 }
25177 }
25180 }
25182 /* Check to see if TYPE refers to an Objective-C selector name. */
25184 static bool
25186 {
25192 }
25194 /* Parse an Objective-C selector. */
25196 static tree
25198 {
25202 {
25205 }
25207 /* C++ operator names are allowed to appear in ObjC selectors. */
25209 {
25222 }
25223 }
25225 /* Parse an Objective-C params list. */
25227 static tree
25229 {
25235 {
25245 /* Detect if we have a unary selector. */
25248 {
25251 }
25255 {
25256 /* Something went quite wrong. There should be a colon
25257 here, but there is not. Stop parsing parameters. */
25259 }
25261 /* New ObjC allows attributes on parameters too. */
25266 params
25269 type_name,
25270 identifier,
25271 parm_attr));
25274 }
25277 {
25280 }
25282 /* We allow tail attributes for the method. */
25284 {
25292 }
25295 {
25298 }
25300 }
25302 /* Parse the non-keyword Objective-C params. */
25304 static tree
25307 {
25313 {
25315 tree parm;
25321 {
25326 }
25328 /* TODO: parse attributes for tail parameters. */
25337 }
25339 /* We allow tail attributes for the method. */
25341 {
25343 {
25348 }
25349 else
25350 /* We have an error, but parse the attributes, so that we can
25351 carry on. */
25357 }
25360 }
25362 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
25364 static void
25366 {
25369 /* If the next token is `extern' and the following token is a string
25370 literal, then we have a linkage specification. */
25372 && cp_parser_is_pure_string_literal
25375 /* Handle #pragma, if any. */
25378 /* Allow stray semicolons. */
25381 /* Mark methods as optional or required, when building protocols. */
25383 {
25386 }
25388 {
25391 }
25394 /* Other stray characters must generate errors. */
25396 {
25400 }
25401 /* Finally, try to parse a block-declaration, or a function-definition. */
25402 else
25404 }
25406 /* Parse a method signature. */
25408 static tree
25410 {
25426 }
25428 static bool
25430 {
25431 tree tattr;
25436 /* If the attributes are followed by a method introducer, this is not allowed.
25437 Dump the attributes and flag the situation. */
25442 /* Otherwise, the attributes introduce some interstitial code, possibly so
25443 rewind to allow that check. */
25446 }
25448 /* Parse an Objective-C method prototype list. */
25450 static void
25452 {
25456 {
25458 {
25463 else
25467 {
25471 }
25474 }
25480 OPT_Wattributes,
25482 else
25483 /* Allow for interspersed non-ObjC++ code. */
25487 }
25491 else
25495 }
25497 /* Parse an Objective-C method definition list. */
25499 static void
25501 {
25505 {
25506 tree meth;
25509 {
25515 else
25520 {
25524 }
25526 NULL_TREE);
25528 /* For historical reasons, we accept an optional semicolon. */
25535 {
25542 }
25543 }
25544 /* The following case will be removed once @synthesize is
25545 completely implemented. */
25556 else
25557 /* Allow for interspersed non-ObjC++ code. */
25561 }
25565 else
25569 }
25571 /* Parse Objective-C ivars. */
25573 static void
25575 {
25586 {
25587 cp_decl_specifier_seq declspecs;
25589 tree prefix_attributes;
25597 CP_PARSER_FLAGS_OPTIONAL,
25601 /* auto, register, static, extern, mutable. */
25603 {
25606 }
25608 /* thread_local. */
25610 {
25613 }
25615 /* typedef. */
25617 {
25620 }
25625 /* Keep going until we hit the `;' at the end of the
25626 declaration. */
25628 {
25633 /* Check for a (possibly unnamed) bitfield declaration. */
25641 {
25642 /* Get the name of the bitfield. */
25645 sfk_none);
25647 eat_colon:
25649 /* Get the width of the bitfield. */
25650 width
25653 NULL);
25654 }
25655 else
25656 {
25657 /* Parse the declarator. */
25658 declarator
25663 }
25665 /* Look for attributes that apply to the ivar. */
25667 /* Remember which attributes are prefix attributes and
25668 which are not. */
25670 /* Combine the attributes. */
25674 /* Create the bitfield declaration. */
25676 width,
25677 attributes);
25678 else
25683 /* Add the instance variable. */
25687 /* Reset PREFIX_ATTRIBUTES. */
25696 {
25699 }
25701 }
25705 }
25710 /* Do not consume the RID_AT_END, so it will be read again as terminating
25711 the @interface of @implementation. */
25715 /* For historical reasons, we accept an optional semicolon. */
25718 }
25720 /* Parse an Objective-C protocol declaration. */
25722 static void
25724 {
25730 {
25735 }
25737 /* See if we have a forward declaration or a definition. */
25740 /* Try a forward declaration first. */
25742 {
25744 {
25745 tree id;
25755 else
25757 }
25759 }
25761 /* Ok, we got a full-fledged definition (or at least should). */
25762 else
25763 {
25768 }
25769 }
25771 /* Parse an Objective-C superclass or category. */
25773 static void
25778 {
25784 {
25787 }
25789 {
25792 /* If there is no category name, and this is an @interface, we
25793 have a class extension. */
25795 {
25798 }
25799 else
25803 }
25804 }
25806 /* Parse an Objective-C class interface. */
25808 static void
25810 {
25817 {
25818 /* It's hard to recover because even if valid @interface stuff
25819 is to follow, we can't compile it (or validate it) if we
25820 don't even know which class it refers to. Let's assume this
25821 was a stray '@interface' token in the stream and skip it.
25822 */
25824 }
25829 /* We have either a class or a category on our hands. */
25832 else
25833 {
25835 /* Handle instance variable declarations, if any. */
25838 }
25841 }
25843 /* Parse an Objective-C class implementation. */
25845 static void
25847 {
25854 {
25855 /* It's hard to recover because even if valid @implementation
25856 stuff is to follow, we can't compile it (or validate it) if
25857 we don't even know which class it refers to. Let's assume
25858 this was a stray '@implementation' token in the stream and
25859 skip it.
25860 */
25862 }
25866 /* We have either a class or a category on our hands. */
25869 else
25870 {
25872 /* Handle instance variable declarations, if any. */
25875 }
25878 }
25880 /* Consume the @end token and finish off the implementation. */
25882 static void
25884 {
25887 }
25889 /* Parse an Objective-C declaration. */
25891 static void
25893 {
25894 /* Try to figure out what kind of declaration is present. */
25899 {
25915 }
25918 {
25941 }
25942 }
25944 /* Parse an Objective-C try-catch-finally statement.
25946 objc-try-catch-finally-stmt:
25947 @try compound-statement objc-catch-clause-seq [opt]
25948 objc-finally-clause [opt]
25950 objc-catch-clause-seq:
25951 objc-catch-clause objc-catch-clause-seq [opt]
25953 objc-catch-clause:
25954 @catch ( objc-exception-declaration ) compound-statement
25956 objc-finally-clause:
25957 @finally compound-statement
25959 objc-exception-declaration:
25960 parameter-declaration
25961 '...'
25963 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
25965 Returns NULL_TREE.
25967 PS: This function is identical to c_parser_objc_try_catch_finally_statement
25968 for C. Keep them in sync. */
25970 static tree
25972 {
25973 location_t location;
25974 tree stmt;
25979 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
25980 node, lest it get absorbed into the surrounding block. */
25986 {
25995 {
25996 /* We have "@catch (...)" (where the '...' are literally
25997 what is in the code). Skip the '...'.
25998 parameter_declaration is set to NULL_TREE, and
25999 objc_being_catch_clauses() knows that that means
26000 '...'. */
26003 }
26004 else
26005 {
26006 /* We have "@catch (NSException *exception)" or something
26007 like that. Parse the parameter declaration. */
26011 else
26016 }
26019 else
26020 {
26021 /* If there was no open parenthesis, we are recovering from
26022 an error, and we are trying to figure out what mistake
26023 the user has made. */
26025 /* If there is an immediate closing parenthesis, the user
26026 probably forgot the opening one (ie, they typed "@catch
26027 NSException *e)". Parse the closing parenthesis and keep
26028 going. */
26032 /* If these is no immediate closing parenthesis, the user
26033 probably doesn't know that parenthesis are required at
26034 all (ie, they typed "@catch NSException *e"). So, just
26035 forget about the closing parenthesis and keep going. */
26036 }
26040 }
26042 {
26045 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26046 node, lest it get absorbed into the surrounding block. */
26050 }
26053 }
26055 /* Parse an Objective-C synchronized statement.
26057 objc-synchronized-stmt:
26058 @synchronized ( expression ) compound-statement
26060 Returns NULL_TREE. */
26062 static tree
26064 {
26065 location_t location;
26076 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26077 node, lest it get absorbed into the surrounding block. */
26082 }
26084 /* Parse an Objective-C throw statement.
26086 objc-throw-stmt:
26087 @throw assignment-expression [opt] ;
26089 Returns a constructed '@throw' statement. */
26091 static tree
26093 {
26105 }
26107 /* Parse an Objective-C statement. */
26109 static tree
26111 {
26112 /* Try to figure out what kind of declaration is present. */
26116 {
26127 }
26130 }
26132 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26133 look ahead to see if an objc keyword follows the attributes. This
26134 is to detect the use of prefix attributes on ObjC @interface and
26135 @protocol. */
26137 static bool
26139 {
26144 {
26147 }
26150 }
26152 /* This routine is a minimal replacement for
26153 c_parser_struct_declaration () used when parsing the list of
26154 types/names or ObjC++ properties. For example, when parsing the
26155 code
26157 @property (readonly) int a, b, c;
26159 this function is responsible for parsing "int a, int b, int c" and
26160 returning the declarations as CHAIN of DECLs.
26162 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26163 similar parsing. */
26164 static tree
26166 {
26168 cp_decl_specifier_seq declspecs;
26170 tree prefix_attributes;
26173 CP_PARSER_FLAGS_NONE,
26180 /* auto, register, static, extern, mutable. */
26182 {
26185 }
26187 /* thread_local. */
26189 {
26192 }
26194 /* typedef. */
26196 {
26199 }
26204 /* Keep going until we hit the `;' at the end of the declaration. */
26206 {
26211 /* Parse the declarator. */
26215 /* Look for attributes that apply to the ivar. */
26217 /* Remember which attributes are prefix attributes and
26218 which are not. */
26220 /* Combine the attributes. */
26230 /* Reset PREFIX_ATTRIBUTES. */
26241 {
26244 }
26245 else
26247 }
26249 }
26251 /* Parse an Objective-C @property declaration. The syntax is:
26253 objc-property-declaration:
26254 '@property' objc-property-attributes[opt] struct-declaration ;
26256 objc-property-attributes:
26257 '(' objc-property-attribute-list ')'
26259 objc-property-attribute-list:
26260 objc-property-attribute
26261 objc-property-attribute-list, objc-property-attribute
26263 objc-property-attribute
26264 'getter' = identifier
26265 'setter' = identifier
26266 'readonly'
26267 'readwrite'
26268 'assign'
26269 'retain'
26270 'copy'
26271 'nonatomic'
26273 For example:
26274 @property NSString *name;
26275 @property (readonly) id object;
26276 @property (retain, nonatomic, getter=getTheName) id name;
26277 @property int a, b, c;
26279 PS: This function is identical to
26280 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26281 static void
26283 {
26284 /* The following variables hold the attributes of the properties as
26285 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26286 seen. When we see an attribute, we set them to 'true' (if they
26287 are boolean properties) or to the identifier (if they have an
26288 argument, ie, for getter and setter). Note that here we only
26289 parse the list of attributes, check the syntax and accumulate the
26290 attributes that we find. objc_add_property_declaration() will
26291 then process the information. */
26301 /* 'properties' is the list of properties that we read. Usually a
26302 single one, but maybe more (eg, in "@property int a, b, c;" there
26303 are three). */
26304 tree properties;
26305 location_t loc;
26311 /* Parse the optional attribute list... */
26313 {
26314 /* Eat the '('. */
26318 {
26324 {
26327 }
26331 {
26342 {
26346 else
26351 }
26354 {
26358 }
26360 {
26362 {
26365 }
26366 else
26370 else
26372 }
26373 else
26374 {
26376 {
26379 }
26380 else
26382 }
26388 }
26395 else
26397 }
26399 /* FIXME: "@property (setter, assign);" will generate a spurious
26400 "error: expected ‘)’ before ‘,’ token". This is because
26401 cp_parser_require, unlike the C counterpart, will produce an
26402 error even if we are in error recovery. */
26404 {
26409 }
26410 }
26412 /* ... and the property declaration(s). */
26416 {
26418 /* If the next token is now a `;', consume it. */
26422 }
26426 else
26427 {
26428 /* Comma-separated properties are chained together in
26429 reverse order; add them one by one. */
26438 }
26441 }
26443 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
26445 objc-synthesize-declaration:
26446 @synthesize objc-synthesize-identifier-list ;
26448 objc-synthesize-identifier-list:
26449 objc-synthesize-identifier
26450 objc-synthesize-identifier-list, objc-synthesize-identifier
26452 objc-synthesize-identifier
26453 identifier
26454 identifier = identifier
26456 For example:
26457 @synthesize MyProperty;
26458 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
26460 PS: This function is identical to c_parser_objc_at_synthesize_declaration
26461 for C. Keep them in sync.
26462 */
26463 static void
26465 {
26467 location_t loc;
26472 {
26476 {
26479 }
26481 {
26485 {
26488 }
26489 }
26490 else
26495 else
26497 }
26500 }
26502 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
26504 objc-dynamic-declaration:
26505 @dynamic identifier-list ;
26507 For example:
26508 @dynamic MyProperty;
26509 @dynamic MyProperty, AnotherProperty;
26511 PS: This function is identical to c_parser_objc_at_dynamic_declaration
26512 for C. Keep them in sync.
26513 */
26514 static void
26516 {
26518 location_t loc;
26523 {
26524 tree property;
26527 {
26530 }
26534 else
26536 }
26539 }
26541 \f
26542 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
26544 /* Returns name of the next clause.
26545 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
26546 the token is not consumed. Otherwise appropriate pragma_omp_clause is
26547 returned and the token is consumed. */
26549 static pragma_omp_clause
26551 {
26563 {
26568 {
26663 }
26664 }
26670 }
26672 /* Validate that a clause of the given type does not already exist. */
26674 static void
26677 {
26678 tree c;
26682 {
26685 }
26686 }
26688 /* OpenMP 2.5:
26689 variable-list:
26690 identifier
26691 variable-list , identifier
26693 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
26694 colon). An opening parenthesis will have been consumed by the caller.
26696 If KIND is nonzero, create the appropriate node and install the decl
26697 in OMP_CLAUSE_DECL and add the node to the head of the list.
26699 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
26700 return the list created.
26702 COLON can be NULL if only closing parenthesis should end the list,
26703 or pointer to bool which will receive false if the list is terminated
26704 by closing parenthesis or true if the list is terminated by colon. */
26706 static tree
26709 {
26713 {
26716 }
26718 {
26735 {
26737 {
26743 {
26750 NULL);
26752 parser->colon_corrects_to_scope_p
26756 else
26757 {
26758 /* Look for `:'. */
26762 CPP_CLOSE_SQUARE))
26765 NULL);
26766 }
26767 /* Look for the closing `]'. */
26769 RT_CLOSE_SQUARE))
26772 }
26776 }
26782 }
26783 else
26786 get_comma:
26790 }
26796 {
26800 }
26803 {
26806 /* Try to resync to an unnested comma. Copied from
26807 cp_parser_parenthesized_expression_list. */
26808 skip_comma:
26817 }
26820 }
26822 /* Similarly, but expect leading and trailing parenthesis. This is a very
26823 common case for omp clauses. */
26825 static tree
26827 {
26831 }
26833 /* OpenMP 3.0:
26834 collapse ( constant-expression ) */
26836 static tree
26838 {
26840 location_t loc;
26841 HOST_WIDE_INT n;
26861 {
26864 }
26872 }
26874 /* OpenMP 2.5:
26875 default ( shared | none ) */
26877 static tree
26879 {
26881 tree c;
26886 {
26891 {
26906 }
26909 }
26910 else
26911 {
26912 invalid_kind:
26914 }
26930 }
26932 /* OpenMP 3.1:
26933 final ( expression ) */
26935 static tree
26937 {
26958 }
26960 /* OpenMP 2.5:
26961 if ( expression ) */
26963 static tree
26965 {
26986 }
26988 /* OpenMP 3.1:
26989 mergeable */
26991 static tree
26994 {
26995 tree c;
26998 location);
27003 }
27005 /* OpenMP 2.5:
27006 nowait */
27008 static tree
27011 {
27012 tree c;
27019 }
27021 /* OpenMP 2.5:
27022 num_threads ( expression ) */
27024 static tree
27026 location_t location)
27027 {
27049 }
27051 /* OpenMP 2.5:
27052 ordered */
27054 static tree
27057 {
27058 tree c;
27066 }
27068 /* OpenMP 2.5:
27069 reduction ( reduction-operator : variable-list )
27071 reduction-operator:
27072 One of: + * - & ^ | && ||
27074 OpenMP 3.1:
27076 reduction-operator:
27077 One of: + * - & ^ | && || min max
27079 OpenMP 4.0:
27081 reduction-operator:
27082 One of: + * - & ^ | && ||
27083 id-expression */
27085 static tree
27087 {
27095 {
27105 }
27109 else
27110 {
27121 {
27151 }
27152 else
27153 {
27155 resync_fail:
27160 }
27161 }
27167 NULL);
27169 {
27172 }
27175 }
27177 /* OpenMP 2.5:
27178 schedule ( schedule-kind )
27179 schedule ( schedule-kind , expression )
27181 schedule-kind:
27182 static | dynamic | guided | runtime | auto */
27184 static tree
27186 {
27195 {
27200 {
27221 }
27222 }
27227 else
27232 {
27247 else
27252 }
27260 invalid_kind:
27262 resync_fail:
27267 }
27269 /* OpenMP 3.0:
27270 untied */
27272 static tree
27275 {
27276 tree c;
27283 }
27285 /* OpenMP 4.0:
27286 inbranch
27287 notinbranch */
27289 static tree
27292 {
27297 }
27299 /* OpenMP 4.0:
27300 parallel
27301 for
27302 sections
27303 taskgroup */
27305 static tree
27309 {
27313 }
27315 /* OpenMP 4.0:
27316 num_teams ( expression ) */
27318 static tree
27320 location_t location)
27321 {
27343 }
27345 /* OpenMP 4.0:
27346 thread_limit ( expression ) */
27348 static tree
27350 location_t location)
27351 {
27373 }
27375 /* OpenMP 4.0:
27376 aligned ( variable-list )
27377 aligned ( variable-list : constant-expression ) */
27379 static tree
27381 {
27392 {
27402 }
27408 }
27410 /* OpenMP 4.0:
27411 linear ( variable-list )
27412 linear ( variable-list : expression ) */
27414 static tree
27416 {
27427 {
27437 }
27443 }
27445 /* OpenMP 4.0:
27446 safelen ( constant-expression ) */
27448 static tree
27450 location_t location)
27451 {
27472 }
27474 /* OpenMP 4.0:
27475 simdlen ( constant-expression ) */
27477 static tree
27479 location_t location)
27480 {
27501 }
27503 /* OpenMP 4.0:
27504 depend ( depend-kind : variable-list )
27506 depend-kind:
27507 in | out | inout */
27509 static tree
27511 {
27519 {
27529 else
27531 }
27532 else
27540 NULL);
27547 invalid_kind:
27549 resync_fail:
27554 }
27556 /* OpenMP 4.0:
27557 map ( map-kind : variable-list )
27558 map ( variable-list )
27560 map-kind:
27561 alloc | to | from | tofrom */
27563 static tree
27565 {
27574 {
27586 else
27587 {
27593 }
27596 }
27599 NULL);
27605 }
27607 /* OpenMP 4.0:
27608 device ( expression ) */
27610 static tree
27612 location_t location)
27613 {
27635 }
27637 /* OpenMP 4.0:
27638 dist_schedule ( static )
27639 dist_schedule ( static , expression ) */
27641 static tree
27643 location_t location)
27644 {
27657 {
27668 }
27673 location);
27677 invalid_kind:
27679 resync_fail:
27684 }
27686 /* OpenMP 4.0:
27687 proc_bind ( proc-bind-kind )
27689 proc-bind-kind:
27690 master | close | spread */
27692 static tree
27694 location_t location)
27695 {
27696 tree c;
27703 {
27713 else
27715 }
27716 else
27725 location);
27730 invalid_kind:
27732 resync_fail:
27737 }
27739 /* Parse all OpenMP clauses. The set clauses allowed by the directive
27740 is a bitmask in MASK. Return the list of clauses found; the result
27741 of clause default goes in *pdefault. */
27743 static tree
27747 {
27753 {
27754 pragma_omp_clause c_kind;
27765 {
27777 clauses);
27791 clauses);
27800 clauses);
27824 clauses);
27838 clauses);
27853 OMP_CLAUSE_NOTINBRANCH,
27862 {
27863 clause_not_first:
27867 }
27892 clauses);
27897 clauses);
27902 clauses);
27959 }
27964 {
27965 /* Remove the invalid clause(s) from the list to avoid
27966 confusing the rest of the compiler. */
27969 }
27970 }
27971 saw_error:
27976 }
27978 /* OpenMP 2.5:
27979 structured-block:
27980 statement
27982 In practice, we're also interested in adding the statement to an
27983 outer node. So it is convenient if we work around the fact that
27984 cp_parser_statement calls add_stmt. */
27986 static unsigned
27988 {
27991 /* Only move the values to IN_OMP_BLOCK if they weren't false.
27992 This preserves the "not within loop or switch" style error messages
27993 for nonsense cases like
27994 void foo() {
27995 #pragma omp single
27996 break;
27997 }
27998 */
28003 }
28005 static void
28007 {
28009 }
28011 static tree
28013 {
28021 }
28023 /* OpenMP 2.5:
28024 # pragma omp atomic new-line
28025 expression-stmt
28027 expression-stmt:
28028 x binop= expr | x++ | ++x | x-- | --x
28029 binop:
28030 +, *, -, /, &, ^, |, <<, >>
28032 where x is an lvalue expression with scalar type.
28034 OpenMP 3.1:
28035 # pragma omp atomic new-line
28036 update-stmt
28038 # pragma omp atomic read new-line
28039 read-stmt
28041 # pragma omp atomic write new-line
28042 write-stmt
28044 # pragma omp atomic update new-line
28045 update-stmt
28047 # pragma omp atomic capture new-line
28048 capture-stmt
28050 # pragma omp atomic capture new-line
28051 capture-block
28053 read-stmt:
28054 v = x
28055 write-stmt:
28056 x = expr
28057 update-stmt:
28058 expression-stmt | x = x binop expr
28059 capture-stmt:
28060 v = expression-stmt
28061 capture-block:
28062 { v = x; update-stmt; } | { update-stmt; v = x; }
28064 OpenMP 4.0:
28065 update-stmt:
28066 expression-stmt | x = x binop expr | x = expr binop x
28067 capture-stmt:
28068 v = update-stmt
28069 capture-block:
28070 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28072 where x and v are lvalue expressions with scalar type. */
28074 static void
28076 {
28084 {
28096 else
28100 }
28103 {
28108 {
28111 }
28112 }
28116 {
28127 else
28133 {
28134 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28135 opcode. */
28140 }
28144 {
28147 }
28148 else
28149 {
28156 }
28159 }
28161 restart:
28166 {
28173 /* FALLTHROUGH */
28183 /* FALLTHROUGH */
28198 /* Undo effects of boolean_increment for post {in,de}crement. */
28200 /* FALLTHRU */
28204 {
28205 /* Undo effects of boolean_increment. */
28207 {
28208 /* This is pre or post increment. */
28213 && !structured_block
28217 }
28218 }
28219 /* FALLTHRU */
28222 {
28257 {
28261 }
28264 {
28270 {
28275 }
28277 {
28288 {
28290 {
28295 }
28296 else
28298 }
28302 }
28305 {
28312 }
28316 }
28320 {
28323 {
28331 }
28333 {
28338 }
28373 }
28384 /* FALLTHROUGH */
28389 }
28396 }
28397 stmt_done:
28399 {
28412 }
28414 {
28417 }
28418 done:
28424 saw_error:
28427 {
28431 {
28435 }
28436 }
28437 }
28440 /* OpenMP 2.5:
28441 # pragma omp barrier new-line */
28443 static void
28445 {
28448 }
28450 /* OpenMP 2.5:
28451 # pragma omp critical [(name)] new-line
28452 structured-block */
28454 static tree
28456 {
28460 {
28472 }
28477 }
28479 /* OpenMP 2.5:
28480 # pragma omp flush flush-vars[opt] new-line
28482 flush-vars:
28483 ( variable-list ) */
28485 static void
28487 {
28493 }
28495 /* Helper function, to parse omp for increment expression. */
28497 static tree
28499 {
28504 {
28507 }
28510 {
28518 }
28520 /* If decl is an iterator, preserve LHS and RHS of the relational
28521 expr until finish_omp_for. */
28531 }
28533 /* Helper function, to parse omp for increment expression. */
28535 static tree
28537 {
28541 cp_id_kind idk;
28545 {
28553 }
28561 {
28566 }
28573 {
28577 }
28589 do
28590 {
28597 {
28599 {
28602 else
28604 tf_warning_or_error);
28605 }
28606 else
28609 }
28610 }
28614 {
28618 }
28619 else
28623 }
28625 /* Parse the restricted form of the for statement allowed by OpenMP. */
28627 static tree
28630 {
28634 location_t loc_first;
28653 {
28656 location_t loc;
28659 {
28662 }
28671 {
28672 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
28674 init-expr:
28675 var = lb
28676 integer-type var = lb
28677 random-access-iterator-type var = lb
28678 pointer-type var = lb
28679 */
28680 cp_decl_specifier_seq type_specifiers;
28682 /* First, try to parse as an initialized declaration. See
28683 cp_parser_condition, from whence the bulk of this is copied. */
28690 {
28691 /* If parsing a type specifier seq succeeded, then this
28692 MUST be a initialized declaration. */
28697 CP_PARSER_DECLARATOR_NAMED,
28707 else
28708 {
28718 {
28720 CPP_OPEN_PAREN))
28723 else
28724 /* Trigger an error. */
28729 }
28733 {
28741 {
28744 auto_node);
28749 }
28752 asm_specification,
28753 LOOKUP_ONLYCONVERTING);
28755 {
28758 }
28759 else
28762 }
28763 else
28764 {
28765 /* Consume '='. */
28769 non_class:
28772 else
28775 asm_specification,
28776 LOOKUP_ONLYCONVERTING);
28777 }
28781 }
28782 }
28783 else
28784 {
28785 cp_id_kind idk;
28786 /* If parsing a type specifier sequence failed, then
28787 this MUST be a simple expression. */
28792 && decl
28795 {
28796 tree rhs;
28803 rhs,
28804 tf_warning_or_error));
28806 }
28807 else
28808 {
28813 {
28817 }
28818 }
28819 }
28820 }
28823 {
28826 {
28832 }
28833 else
28835 }
28842 {
28847 {
28851 }
28854 {
28855 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
28856 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
28865 }
28866 else
28867 {
28872 }
28873 }
28876 {
28877 tree c;
28879 {
28888 decl);
28892 decl);
28893 }
28895 {
28900 {
28903 }
28904 }
28905 }
28914 {
28915 /* If decl is an iterator, preserve the operator on decl
28916 until finish_omp_for. */
28918 && ((processing_template_decl
28922 else
28926 }
28941 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
28942 in between the collapsed for loops to be still considered perfectly
28943 nested. Hopefully the final version clarifies this.
28944 For now handle (multiple) {'s and empty statements. */
28946 do
28947 {
28951 {
28953 bracecount++;
28954 }
28958 else
28959 {
28966 }
28967 }
28971 {
28974 }
28975 }
28977 /* Note that we saved the original contents of this flag when we entered
28978 the structured block, and so we don't need to re-save it here. */
28981 /* Note that the grammar doesn't call for a structured block here,
28982 though the loop as a whole is a structured block. */
28989 else
28994 {
28996 {
28998 nbraces--;
28999 }
29002 else
29003 {
29005 {
29008 }
29013 }
29014 }
29021 }
29023 /* Helper function for OpenMP parsing, split clauses and call
29024 finish_omp_clauses on each of the set of clauses afterwards. */
29026 static void
29029 {
29035 }
29037 /* OpenMP 4.0:
29038 #pragma omp simd simd-clause[optseq] new-line
29039 for-loop */
29041 #define OMP_SIMD_CLAUSE_MASK \
29042 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29043 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29044 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29045 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29046 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29047 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29048 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29050 static tree
29053 {
29065 {
29068 }
29079 }
29081 /* OpenMP 2.5:
29082 #pragma omp for for-clause[optseq] new-line
29083 for-loop
29085 OpenMP 4.0:
29086 #pragma omp for simd for-simd-clause[optseq] new-line
29087 for-loop */
29089 #define OMP_FOR_CLAUSE_MASK \
29090 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29091 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29092 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29093 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29094 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29095 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29096 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29097 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29099 static tree
29102 {
29113 {
29118 {
29127 cclauses);
29139 }
29140 }
29145 {
29148 }
29159 }
29161 /* OpenMP 2.5:
29162 # pragma omp master new-line
29163 structured-block */
29165 static tree
29167 {
29171 }
29173 /* OpenMP 2.5:
29174 # pragma omp ordered new-line
29175 structured-block */
29177 static tree
29179 {
29183 }
29185 /* OpenMP 2.5:
29187 section-scope:
29188 { section-sequence }
29190 section-sequence:
29191 section-directive[opt] structured-block
29192 section-sequence section-directive structured-block */
29194 static tree
29196 {
29207 {
29211 }
29214 {
29222 {
29226 }
29228 {
29231 }
29236 }
29247 }
29249 /* OpenMP 2.5:
29250 # pragma omp sections sections-clause[optseq] newline
29251 sections-scope */
29253 #define OMP_SECTIONS_CLAUSE_MASK \
29254 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29255 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29256 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29257 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29258 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29260 static tree
29263 {
29275 {
29278 }
29285 }
29287 /* OpenMP 2.5:
29288 # pragma parallel parallel-clause new-line
29289 # pragma parallel for parallel-for-clause new-line
29290 # pragma parallel sections parallel-sections-clause new-line
29292 OpenMP 4.0:
29293 # pragma parallel for simd parallel-for-simd-clause new-line */
29295 #define OMP_PARALLEL_CLAUSE_MASK \
29296 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29301 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
29302 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29303 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
29304 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
29306 static tree
29309 {
29318 {
29329 block);
29332 }
29334 {
29338 }
29340 {
29344 {
29354 block);
29357 }
29358 }
29368 }
29370 /* OpenMP 2.5:
29371 # pragma omp single single-clause[optseq] new-line
29372 structured-block */
29374 #define OMP_SINGLE_CLAUSE_MASK \
29375 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
29378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29380 static tree
29382 {
29392 }
29394 /* OpenMP 3.0:
29395 # pragma omp task task-clause[optseq] new-line
29396 structured-block */
29398 #define OMP_TASK_CLAUSE_MASK \
29399 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29400 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
29401 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29402 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29403 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29404 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29405 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
29406 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
29407 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
29409 static tree
29411 {
29422 }
29424 /* OpenMP 3.0:
29425 # pragma omp taskwait new-line */
29427 static void
29429 {
29432 }
29434 /* OpenMP 3.1:
29435 # pragma omp taskyield new-line */
29437 static void
29439 {
29442 }
29444 /* OpenMP 4.0:
29445 # pragma omp taskgroup new-line
29446 structured-block */
29448 static tree
29450 {
29454 }
29457 /* OpenMP 2.5:
29458 # pragma omp threadprivate (variable-list) */
29460 static void
29462 {
29463 tree vars;
29469 }
29471 /* OpenMP 4.0:
29472 # pragma omp cancel cancel-clause[optseq] new-line */
29474 #define OMP_CANCEL_CLAUSE_MASK \
29475 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29476 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29477 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29478 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
29479 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29481 static void
29483 {
29487 }
29489 /* OpenMP 4.0:
29490 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
29492 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
29493 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29494 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29495 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29496 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
29498 static void
29500 {
29501 tree clauses;
29505 {
29510 {
29513 }
29514 }
29516 {
29520 }
29523 OMP_CANCELLATION_POINT_CLAUSE_MASK,
29525 pragma_tok);
29527 }
29529 /* OpenMP 4.0:
29530 #pragma omp distribute distribute-clause[optseq] new-line
29531 for-loop */
29533 #define OMP_DISTRIBUTE_CLAUSE_MASK \
29534 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29535 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29536 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
29537 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29539 static tree
29542 {
29551 {
29559 else
29562 {
29571 cclauses);
29572 else
29574 cclauses);
29586 }
29587 }
29592 {
29595 }
29606 }
29608 /* OpenMP 4.0:
29609 # pragma omp teams teams-clause[optseq] new-line
29610 structured-block */
29612 #define OMP_TEAMS_CLAUSE_MASK \
29613 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29614 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29615 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29616 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29617 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
29618 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
29619 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
29621 static tree
29624 {
29633 {
29637 {
29646 cclauses);
29657 }
29658 }
29663 {
29666 }
29674 }
29676 /* OpenMP 4.0:
29677 # pragma omp target data target-data-clause[optseq] new-line
29678 structured-block */
29680 #define OMP_TARGET_DATA_CLAUSE_MASK \
29681 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
29682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
29683 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29685 static tree
29687 {
29699 }
29701 /* OpenMP 4.0:
29702 # pragma omp target update target-update-clause[optseq] new-line */
29704 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
29705 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
29706 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
29707 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
29708 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29710 static bool
29713 {
29715 {
29717 "%<#pragma omp target update%> may only be "
29721 }
29723 tree clauses
29728 {
29730 "%<#pragma omp target update must contain at least one "
29733 }
29741 }
29743 /* OpenMP 4.0:
29744 # pragma omp target target-clause[optseq] new-line
29745 structured-block */
29747 #define OMP_TARGET_CLAUSE_MASK \
29748 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
29749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
29750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29752 static bool
29755 {
29757 {
29761 }
29764 {
29769 {
29773 }
29775 {
29778 }
29780 {
29802 }
29803 }
29817 }
29819 /* OpenMP 4.0:
29820 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
29822 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
29823 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
29824 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29825 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29826 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
29827 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
29828 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
29830 static void
29833 {
29835 cp_omp_declare_simd_data data;
29837 {
29842 }
29853 {
29857 {
29870 }
29875 "%<#pragma omp declare simd%> not immediately followed by "
29879 }
29880 }
29882 /* Finalize #pragma omp declare simd clauses after direct declarator has
29883 been parsed, and put that into "omp declare simd" attribute. */
29885 static tree
29887 {
29893 {
29898 }
29903 {
29921 }
29925 }
29928 /* OpenMP 4.0:
29929 # pragma omp declare target new-line
29930 declarations and definitions
29931 # pragma omp end declare target new-line */
29933 static void
29935 {
29938 }
29940 static void
29942 {
29945 {
29948 }
29950 {
29954 {
29957 }
29960 else
29961 {
29965 }
29966 }
29967 else
29968 {
29972 }
29976 "%<#pragma omp end declare target%> without corresponding "
29978 else
29980 }
29982 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
29983 expression and optional initializer clause of
29984 #pragma omp declare reduction. We store the expression(s) as
29985 either 3, 6 or 7 special statements inside of the artificial function's
29986 body. The first two statements are DECL_EXPRs for the artificial
29987 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
29988 expression that uses those variables.
29989 If there was any INITIALIZER clause, this is followed by further statements,
29990 the fourth and fifth statements are DECL_EXPRs for the artificial
29991 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
29992 constructor variant (first token after open paren is not omp_priv),
29993 then the sixth statement is a statement with the function call expression
29994 that uses the OMP_PRIV and optionally OMP_ORIG variable.
29995 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
29996 to initialize the OMP_PRIV artificial variable and there is seventh
29997 statement, a DECL_EXPR of the OMP_PRIV statement again. */
29999 static bool
30001 {
30013 tree combiner;
30028 {
30031 }
30034 {
30041 {
30044 }
30060 {
30064 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30068 == CPP_CLOSE_PAREN
30071 {
30075 }
30080 }
30081 else
30082 {
30098 {
30103 }
30105 tree arg;
30118 }
30129 }
30135 }
30137 /* OpenMP 4.0
30138 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30139 initializer-clause[opt] new-line
30141 initializer-clause:
30142 initializer (omp_priv initializer)
30143 initializer (function-name (argument-list)) */
30145 static void
30148 {
30161 {
30193 }
30205 /* Types may not be defined in declare reduction type list. */
30208 parser->type_definition_forbidden_message
30214 saved_colon_doesnt_start_class_def_p
30219 {
30223 ;
30244 else
30249 else
30251 }
30253 /* Restore the saved message. */
30256 parser->colon_doesnt_start_class_def_p
30261 {
30262 fail:
30266 }
30272 {
30273 tree fntype
30276 NULL_TREE);
30295 {
30300 }
30302 {
30304 {
30313 }
30320 }
30321 else
30322 {
30325 }
30328 else
30331 {
30334 }
30336 {
30339 else
30344 }
30349 else
30350 {
30359 }
30366 }
30370 }
30372 /* OpenMP 4.0
30373 #pragma omp declare simd declare-simd-clauses[optseq] new-line
30374 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30375 initializer-clause[opt] new-line
30376 #pragma omp declare target new-line */
30378 static void
30381 {
30383 {
30388 {
30391 context);
30393 }
30396 {
30399 context);
30401 }
30403 {
30407 }
30408 }
30412 }
30414 /* Main entry point to OpenMP statement pragmas. */
30416 static void
30418 {
30419 tree stmt;
30424 {
30472 }
30476 }
30477 \f
30478 /* Transactional Memory parsing routines. */
30480 /* Parse a transaction attribute.
30482 txn-attribute:
30483 attribute
30484 [ [ identifier ] ]
30486 ??? Simplify this when C++0x bracket attributes are
30487 implemented properly. */
30489 static tree
30491 {
30506 {
30510 /* For keywords, use the canonical spelling,
30511 not the parsed identifier. */
30515 }
30516 else
30520 error1:
30523 }
30525 /* Parse a __transaction_atomic or __transaction_relaxed statement.
30527 transaction-statement:
30528 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
30529 compound-statement
30530 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
30531 */
30533 static tree
30535 {
30550 else
30551 {
30555 }
30557 /* Parse a noexcept specification. */
30560 /* Keep track if we're in the lexical scope of an outer transaction. */
30572 }
30574 /* Parse a __transaction_atomic or __transaction_relaxed expression.
30576 transaction-expression:
30577 __transaction_atomic txn-noexcept-spec[opt] ( expression )
30578 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
30579 */
30581 static tree
30583 {
30608 /* Set this early. This might mean that we allow transaction_cancel in
30609 an expression that we find out later actually has to be a constexpr.
30610 However, we expect that cxx_constant_value will be able to deal with
30611 this; also, if the noexcept has no constexpr, then what we parse next
30612 really is a transaction's body. */
30615 /* Parse a noexcept specification. */
30621 {
30628 }
30629 else
30630 {
30631 /* The only expression that is available got parsed for the noexcept
30632 already. noexcept is true then. */
30635 }
30644 }
30646 /* Parse a function-transaction-block.
30648 function-transaction-block:
30649 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
30650 function-body
30651 __transaction_atomic txn-attribute[opt] function-try-block
30652 __transaction_relaxed ctor-initializer[opt] function-body
30653 __transaction_relaxed function-try-block
30654 */
30656 static bool
30658 {
30674 else
30675 {
30679 }
30687 else
30688 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
30696 }
30698 /* Parse a __transaction_cancel statement.
30700 cancel-statement:
30701 __transaction_cancel txn-attribute[opt] ;
30702 __transaction_cancel txn-attribute[opt] throw-expression ;
30704 ??? Cancel and throw is not yet implemented. */
30706 static tree
30708 {
30714 RT_TRANSACTION_CANCEL);
30721 /* ??? Parse cancel-and-throw here. */
30726 {
30730 }
30732 {
30736 }
30738 {
30741 {
30747 }
30748 }
30750 {
30754 }
30760 }
30761 \f
30762 /* The parser. */
30766 \f
30767 /* Special handling for the first token or line in the file. The first
30768 thing in the file might be #pragma GCC pch_preprocess, which loads a
30769 PCH file, which is a GC collection point. So we need to handle this
30770 first pragma without benefit of an existing lexer structure.
30772 Always returns one token to the caller in *FIRST_TOKEN. This is
30773 either the true first token of the file, or the first token after
30774 the initial pragma. */
30776 static void
30778 {
30787 {
30794 }
30795 else
30798 /* Skip to the end of the pragma. */
30802 /* Now actually load the PCH file. */
30806 /* Read one more token to return to our caller. We have to do this
30807 after reading the PCH file in, since its pointers have to be
30808 live. */
30810 }
30812 /* Normal parsing of a pragma token. Here we can (and must) use the
30813 regular lexer. */
30815 static bool
30817 {
30829 {
30837 {
30847 }
30852 {
30862 }
30867 {
30873 "%<#pragma omp taskwait%> may only be "
30878 }
30883 {
30889 "%<#pragma omp taskyield%> may only be "
30894 }
30899 {
30905 "%<#pragma omp cancel%> may only be "
30910 }
30915 {
30921 "%<#pragma omp cancellation point%> may only be "
30926 }
30964 "%<#pragma omp section%> may only be used in "
30969 {
30976 {
30979 }
30982 }
30989 bad_stmt:
30992 }
30996 }
30998 /* The interface the pragma parsers have to the lexer. */
31000 enum cpp_ttype
31002 {
31015 else
31016 {
31020 }
31023 }
31025 \f
31026 /* External interface. */
31028 /* Parse one entire translation unit. */
31030 void
31032 {
31036 {
31039 }
31047 }
31049 /* Create an identifier for a generic parameter type (a synthesized
31050 template parameter implied by `auto' or a concept identifier). */
31053 static tree
31055 {
31059 }
31061 /* Predicate that behaves as is_auto_or_concept but matches the parent
31062 node of the generic type rather than the generic type itself. This
31063 allows for type transformation in add_implicit_template_parms. */
31067 {
31069 }
31071 /* Add EXPECT_COUNT implicit template parameters gleaned from the generic
31072 type parameters in PARAMETERS to the CURRENT_TEMPLATE_PARMS (creating a new
31073 template parameter list if necessary). Returns PARAMETERS suitably rewritten
31074 to reference the newly created types or ERROR_MARK_NODE on failure. */
31076 tree
31078 tree parameters)
31079 {
31089 /* Roll back a scope level and either introduce a new template parameter list
31090 or update an existing one. The function scope is added back after template
31091 parameter synthesis below. */
31094 /* TPARMS tracks the function's template parameter list. This is either a new
31095 chain in the case of a fully implicit function template or an extension of
31096 the function's explicitly specified template parameter list. */
31100 {
31106 }
31107 else
31108 {
31109 /* Roll back the innermost template parameter list such that it may be
31110 extended in the loop below as if it were being explicitly declared. */
31114 /* Pop the innermost template parms into TPARMS. */
31120 {
31124 }
31127 }
31130 {
31131 tree generic_type_ptr
31141 synth_id);
31145 synth_tmpl_parm),
31149 /* Rewrite the type of P to be the template_parm added above (getdecls is
31150 used to retrieve it since it is the most recent declaration in this
31151 scope). Qualifiers need to be preserved also. */
31158 else
31160 }
31169 }
31171 /* Finish the declaration of a fully implicit function template. Such a
31172 template has no explicit template parameter list so has not been through the
31173 normal template head and tail processing. add_implicit_template_parms tries
31174 to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
31175 provided if the declaration is a class member such that its template
31176 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
31177 form is returned. Otherwise NULL_TREE is returned. */
31179 tree
31181 {
31186 {
31190 }
31201 }