| blob | ed8eac8cc4e007a57349ac3443c340c33065877f |
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/>. */
42 \f
43 /* The lexer. */
45 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
46 and c-lex.c) and the C++ parser. */
49 {
51 };
53 /* The various kinds of non integral constant we encounter. */
55 NIC_NONE,
56 /* floating-point literal */
57 NIC_FLOAT,
58 /* %<this%> */
59 NIC_THIS,
60 /* %<__FUNCTION__%> */
61 NIC_FUNC_NAME,
62 /* %<__PRETTY_FUNCTION__%> */
63 NIC_PRETTY_FUNC,
64 /* %<__func__%> */
65 NIC_C99_FUNC,
66 /* "%<va_arg%> */
67 NIC_VA_ARG,
68 /* a cast */
69 NIC_CAST,
70 /* %<typeid%> operator */
71 NIC_TYPEID,
72 /* non-constant compound literals */
73 NIC_NCC,
74 /* a function call */
75 NIC_FUNC_CALL,
76 /* an increment */
77 NIC_INC,
78 /* an decrement */
79 NIC_DEC,
80 /* an array reference */
81 NIC_ARRAY_REF,
82 /* %<->%> */
83 NIC_ARROW,
84 /* %<.%> */
85 NIC_POINT,
86 /* the address of a label */
87 NIC_ADDR_LABEL,
88 /* %<*%> */
89 NIC_STAR,
90 /* %<&%> */
91 NIC_ADDR,
92 /* %<++%> */
93 NIC_PREINCREMENT,
94 /* %<--%> */
95 NIC_PREDECREMENT,
96 /* %<new%> */
97 NIC_NEW,
98 /* %<delete%> */
99 NIC_DEL,
100 /* calls to overloaded operators */
101 NIC_OVERLOADED,
102 /* an assignment */
103 NIC_ASSIGNMENT,
104 /* a comma operator */
105 NIC_COMMA,
106 /* a call to a constructor */
107 NIC_CONSTRUCTOR,
108 /* a transaction expression */
109 NIC_TRANSACTION
112 /* The various kinds of errors about name-lookup failing. */
114 /* NULL */
115 NLE_NULL,
116 /* is not a type */
117 NLE_TYPE,
118 /* is not a class or namespace */
119 NLE_CXX98,
120 /* is not a class, namespace, or enumeration */
121 NLE_NOT_CXX98
124 /* The various kinds of required token */
126 RT_NONE,
148 /* The type is CPP_KEYWORD */
177 RT_TRANSACTION_CANCEL /* __transaction_cancel */
180 /* Prototypes. */
186 static void cp_lexer_destroy
188 static int cp_lexer_saving_tokens
192 static void cp_lexer_get_preprocessor_token
200 static bool cp_lexer_next_token_is_not
202 static bool cp_lexer_next_token_is_keyword
206 static void cp_lexer_purge_token
208 static void cp_lexer_purge_tokens_after
210 static void cp_lexer_save_tokens
212 static void cp_lexer_commit_tokens
214 static void cp_lexer_rollback_tokens
216 static void cp_lexer_print_token
220 static void cp_lexer_start_debugging
222 static void cp_lexer_stop_debugging
228 static void cp_parser_initial_pragma
231 static tree cp_literal_operator_id
234 /* Manifest constants. */
235 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
236 #define CP_SAVED_TOKEN_STACK 5
238 /* Variables. */
240 /* The stream to which debugging output should be written. */
243 /* Nonzero if we are parsing an unevaluated operand: an operand to
244 sizeof, typeof, or alignof. */
247 /* Dump up to NUM tokens in BUFFER to FILE starting with token
248 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
249 first token in BUFFER. If NUM is 0, dump all the tokens. If
250 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
251 highlighted by surrounding it in [[ ]]. */
253 static void
257 {
274 {
277 }
282 {
289 nprinted++;
299 {
309 }
310 }
313 {
316 }
319 }
322 /* Dump all tokens in BUFFER to stderr. */
324 void
326 {
328 }
330 DEBUG_FUNCTION void
332 {
334 }
336 DEBUG_FUNCTION void
338 {
341 else
343 }
346 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
347 description for T. */
349 static void
351 {
353 {
356 }
357 }
360 /* Dump parser context C to FILE. */
362 static void
364 {
369 }
372 /* Print the stack of parsing contexts to FILE starting with FIRST. */
374 static void
376 {
382 {
385 }
386 }
389 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
391 static void
393 {
396 }
399 /* Print an unparsed function entry UF to FILE. */
401 static void
403 {
406 tree fn;
411 i++)
412 {
418 }
423 {
426 }
432 {
435 }
437 }
440 /* Print the stack of unparsed member functions S to FILE. */
442 static void
445 {
451 {
454 }
455 }
458 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
459 the given PARSER. If FILE is NULL, the output is printed on stderr. */
461 static void
463 {
475 next_token);
476 }
479 /* Dump debugging information for the given PARSER. If FILE is NULL,
480 the output is printed on stderr. */
482 void
484 {
487 expanded_location eloc;
561 }
563 DEBUG_FUNCTION void
565 {
567 }
569 DEBUG_FUNCTION void
571 {
574 else
576 }
578 /* Allocate memory for a new lexer object and return it. */
582 {
587 /* Allocate the memory. */
590 /* Initially we are not debugging. */
595 /* Create the buffer. */
599 }
602 /* Create a new main C++ lexer, the lexer that gets tokens from the
603 preprocessor. */
607 {
609 cp_token token;
611 /* It's possible that parsing the first pragma will load a PCH file,
612 which is a GC collection point. So we have to do that before
613 allocating any memory. */
618 /* Put the first token in the buffer. */
621 /* Get the remaining tokens from the preprocessor. */
623 {
626 }
635 /* Subsequent preprocessor diagnostics should use compiler
636 diagnostic functions to get the compiler source location. */
641 }
643 /* Create a new lexer whose token stream is primed with the tokens in
644 CACHE. When these tokens are exhausted, no new tokens will be read. */
648 {
653 /* We do not own the buffer. */
660 /* Initially we are not debugging. */
665 }
667 /* Frees all resources associated with LEXER. */
669 static void
671 {
675 }
677 /* Returns nonzero if debugging information should be output. */
681 {
683 }
688 {
692 }
696 {
698 }
702 {
704 }
708 {
711 else
713 }
717 {
721 }
723 /* nonzero if we are presently saving tokens. */
727 {
729 }
731 /* Store the next token from the preprocessor in *TOKEN. Return true
732 if we reach EOF. If LEXER is NULL, assume we are handling an
733 initial #pragma pch_preprocess, and thus want the lexer to return
734 processed strings. */
736 static void
738 {
741 /* Get a new token from the preprocessor. */
742 token->type
749 /* On some systems, some header files are surrounded by an
750 implicit extern "C" block. Set a flag in the token if it
751 comes from such a header. */
756 /* Check to see if this token is a keyword. */
758 {
760 {
761 /* Mark this token as a keyword. */
763 /* Record which keyword. */
765 }
766 else
767 {
771 {
772 /* Warn about the C++0x keyword (but still treat it as
773 an identifier). */
778 /* Clear out the C_RID_CODE so we don't warn about this
779 particular identifier-turned-keyword again. */
781 }
785 }
786 }
788 {
789 /* This only happens in Objective-C++; it must be a keyword. */
792 {
793 /* Replace 'class' with '@class', 'private' with '@private',
794 etc. This prevents confusion with the C++ keyword
795 'class', and makes the tokens consistent with other
796 Objective-C 'AT' keywords. For example '@class' is
797 reported as RID_AT_CLASS which is consistent with
798 '@synchronized', which is reported as
799 RID_AT_SYNCHRONIZED.
800 */
809 }
810 }
812 {
813 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
817 }
818 }
820 /* Update the globals input_location and the input file stack from TOKEN. */
823 {
825 {
827 }
828 }
830 /* Return a pointer to the next token in the token stream, but do not
831 consume it. */
835 {
837 {
841 }
843 }
845 /* Return true if the next token has the indicated TYPE. */
849 {
851 }
853 /* Return true if the next token does not have the indicated TYPE. */
857 {
859 }
861 /* Return true if the next token is the indicated KEYWORD. */
865 {
867 }
869 /* Return true if the next token is not the indicated KEYWORD. */
873 {
875 }
877 /* Return true if the next token is a keyword for a decl-specifier. */
879 static bool
881 {
886 {
887 /* auto specifier: storage-class-specifier in C++,
888 simple-type-specifier in C++0x. */
890 /* Storage classes. */
896 /* Elaborated type specifiers. */
902 /* Simple type specifiers. */
917 /* GNU extensions. */
920 /* C++0x extensions. */
927 }
928 }
930 /* Returns TRUE iff the token T begins a decltype type. */
932 static bool
934 {
937 }
939 /* Returns TRUE iff the next token begins a decltype type. */
941 static bool
943 {
946 }
948 /* Return a pointer to the Nth token in the token stream. If N is 1,
949 then this is precisely equivalent to cp_lexer_peek_token (except
950 that it is not inline). One would like to disallow that case, but
951 there is one case (cp_parser_nth_token_starts_template_id) where
952 the caller passes a variable for N and it might be 1. */
956 {
959 /* N is 1-based, not zero-based. */
970 {
973 {
976 }
980 }
983 {
986 }
989 }
991 /* Return the next token, and advance the lexer's next_token pointer
992 to point to the next non-purged token. */
996 {
1002 do
1003 {
1006 {
1009 }
1011 }
1016 /* Provide debugging output. */
1018 {
1022 }
1025 }
1027 /* Permanently remove the next token from the token stream, and
1028 advance the next_token pointer to refer to the next non-purged
1029 token. */
1031 static void
1033 {
1042 do
1043 {
1044 tok++;
1046 {
1049 }
1050 }
1053 }
1055 /* Permanently remove all tokens after TOK, up to, but not
1056 including, the token that will be returned next by
1057 cp_lexer_peek_token. */
1059 static void
1061 {
1070 {
1075 }
1076 }
1078 /* Begin saving tokens. All tokens consumed after this point will be
1079 preserved. */
1081 static void
1083 {
1084 /* Provide debugging output. */
1089 }
1091 /* Commit to the portion of the token stream most recently saved. */
1093 static void
1095 {
1096 /* Provide debugging output. */
1101 }
1103 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1104 to the token stream. Stop saving tokens. */
1106 static void
1108 {
1109 /* Provide debugging output. */
1114 }
1116 /* Print a representation of the TOKEN on the STREAM. */
1118 static void
1120 {
1121 /* We don't use cpp_type2name here because the parser defines
1122 a few tokens of its own. */
1124 /* cpplib-defined token types */
1125 #define OP(e, s) #e,
1126 #define TK(e, s) #e,
1127 TTYPE_TABLE
1128 #undef OP
1129 #undef TK
1130 /* C++ parser token types - see "Manifest constants", above. */
1134 };
1136 /* For some tokens, print the associated data. */
1138 {
1140 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1141 For example, `struct' is mapped to an INTEGER_CST. */
1144 /* else fall through */
1162 /* If we have a name for the token, print it out. Otherwise, we
1163 simply give the numeric code. */
1166 else
1169 }
1170 }
1172 DEBUG_FUNCTION void
1174 {
1177 }
1179 DEBUG_FUNCTION void
1181 {
1184 else
1186 }
1189 /* Start emitting debugging information. */
1191 static void
1193 {
1196 }
1198 /* Stop emitting debugging information. */
1200 static void
1202 {
1205 }
1207 /* Create a new cp_token_cache, representing a range of tokens. */
1211 {
1216 }
1218 \f
1219 /* Decl-specifiers. */
1221 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1223 static void
1225 {
1227 }
1229 /* Declarators. */
1231 /* Nothing other than the parser should be creating declarators;
1232 declarators are a semi-syntactic representation of C++ entities.
1233 Other parts of the front end that need to create entities (like
1234 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1249 /* An erroneous declarator. */
1252 /* The obstack on which declarators and related data structures are
1253 allocated. */
1256 /* Alloc BYTES from the declarator memory pool. */
1260 {
1262 }
1264 /* Allocate a declarator of the indicated KIND. Clear fields that are
1265 common to all declarators. */
1269 {
1281 }
1283 /* Make a declarator for a generalized identifier. If
1284 QUALIFYING_SCOPE is non-NULL, the identifier is
1285 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1286 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1287 is, if any. */
1291 special_function_kind sfk)
1292 {
1295 /* It is valid to write:
1297 class C { void f(); };
1298 typedef C D;
1299 void D::f();
1301 The standard is not clear about whether `typedef const C D' is
1302 legal; as of 2002-09-15 the committee is considering that
1303 question. EDG 3.0 allows that syntax. Therefore, we do as
1304 well. */
1318 }
1320 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1321 of modifiers such as const or volatile to apply to the pointer
1322 type, represented as identifiers. ATTRIBUTES represent the attributes that
1323 appertain to the pointer or reference. */
1325 cp_declarator *
1327 tree attributes)
1328 {
1336 {
1340 }
1341 else
1347 }
1349 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1350 represent the attributes that appertain to the pointer or
1351 reference. */
1353 cp_declarator *
1356 {
1364 {
1368 }
1369 else
1375 }
1377 /* Like make_pointer_declarator -- but for a pointer to a non-static
1378 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1379 appertain to the pointer or reference. */
1381 cp_declarator *
1384 tree attributes)
1385 {
1394 {
1397 }
1398 else
1404 }
1406 /* Make a declarator for the function given by TARGET, with the
1407 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1408 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1409 indicates what exceptions can be thrown. */
1411 cp_declarator *
1413 tree parms,
1414 cp_cv_quals cv_qualifiers,
1415 cp_virt_specifiers virt_specifiers,
1416 cp_ref_qualifier ref_qualifier,
1417 tree exception_specification,
1418 tree late_return_type)
1419 {
1431 {
1435 }
1436 else
1440 }
1442 /* Make a declarator for an array of BOUNDS elements, each of which is
1443 defined by ELEMENT. */
1445 cp_declarator *
1447 {
1454 {
1458 }
1459 else
1463 }
1465 /* Determine whether the declarator we've seen so far can be a
1466 parameter pack, when followed by an ellipsis. */
1467 static bool
1469 {
1470 /* Search for a declarator name, or any other declarator that goes
1471 after the point where the ellipsis could appear in a parameter
1472 pack. If we find any of these, then this declarator can not be
1473 made into a parameter pack. */
1476 {
1478 {
1490 }
1491 }
1494 }
1498 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1499 DECLARATOR and DEFAULT_ARGUMENT. */
1501 cp_parameter_declarator *
1504 tree default_argument)
1505 {
1513 else
1520 }
1522 /* Returns true iff DECLARATOR is a declaration for a function. */
1524 static bool
1526 {
1528 {
1536 }
1538 }
1540 /* The parser. */
1542 /* Overview
1543 --------
1545 A cp_parser parses the token stream as specified by the C++
1546 grammar. Its job is purely parsing, not semantic analysis. For
1547 example, the parser breaks the token stream into declarators,
1548 expressions, statements, and other similar syntactic constructs.
1549 It does not check that the types of the expressions on either side
1550 of an assignment-statement are compatible, or that a function is
1551 not declared with a parameter of type `void'.
1553 The parser invokes routines elsewhere in the compiler to perform
1554 semantic analysis and to build up the abstract syntax tree for the
1555 code processed.
1557 The parser (and the template instantiation code, which is, in a
1558 way, a close relative of parsing) are the only parts of the
1559 compiler that should be calling push_scope and pop_scope, or
1560 related functions. The parser (and template instantiation code)
1561 keeps track of what scope is presently active; everything else
1562 should simply honor that. (The code that generates static
1563 initializers may also need to set the scope, in order to check
1564 access control correctly when emitting the initializers.)
1566 Methodology
1567 -----------
1569 The parser is of the standard recursive-descent variety. Upcoming
1570 tokens in the token stream are examined in order to determine which
1571 production to use when parsing a non-terminal. Some C++ constructs
1572 require arbitrary look ahead to disambiguate. For example, it is
1573 impossible, in the general case, to tell whether a statement is an
1574 expression or declaration without scanning the entire statement.
1575 Therefore, the parser is capable of "parsing tentatively." When the
1576 parser is not sure what construct comes next, it enters this mode.
1577 Then, while we attempt to parse the construct, the parser queues up
1578 error messages, rather than issuing them immediately, and saves the
1579 tokens it consumes. If the construct is parsed successfully, the
1580 parser "commits", i.e., it issues any queued error messages and
1581 the tokens that were being preserved are permanently discarded.
1582 If, however, the construct is not parsed successfully, the parser
1583 rolls back its state completely so that it can resume parsing using
1584 a different alternative.
1586 Future Improvements
1587 -------------------
1589 The performance of the parser could probably be improved substantially.
1590 We could often eliminate the need to parse tentatively by looking ahead
1591 a little bit. In some places, this approach might not entirely eliminate
1592 the need to parse tentatively, but it might still speed up the average
1593 case. */
1595 /* Flags that are passed to some parsing functions. These values can
1596 be bitwise-ored together. */
1598 enum
1599 {
1600 /* No flags. */
1602 /* The construct is optional. If it is not present, then no error
1603 should be issued. */
1605 /* When parsing a type-specifier, treat user-defined type-names
1606 as non-type identifiers. */
1608 /* When parsing a type-specifier, do not try to parse a class-specifier
1609 or enum-specifier. */
1611 /* When parsing a decl-specifier-seq, only allow type-specifier or
1612 constexpr. */
1614 };
1616 /* This type is used for parameters and variables which hold
1617 combinations of the above flags. */
1620 /* The different kinds of declarators we want to parse. */
1623 {
1624 /* We want an abstract declarator. */
1625 CP_PARSER_DECLARATOR_ABSTRACT,
1626 /* We want a named declarator. */
1627 CP_PARSER_DECLARATOR_NAMED,
1628 /* We don't mind, but the name must be an unqualified-id. */
1629 CP_PARSER_DECLARATOR_EITHER
1632 /* The precedence values used to parse binary expressions. The minimum value
1633 of PREC must be 1, because zero is reserved to quickly discriminate
1634 binary operators from other tokens. */
1636 enum cp_parser_prec
1637 {
1638 PREC_NOT_OPERATOR,
1639 PREC_LOGICAL_OR_EXPRESSION,
1640 PREC_LOGICAL_AND_EXPRESSION,
1641 PREC_INCLUSIVE_OR_EXPRESSION,
1642 PREC_EXCLUSIVE_OR_EXPRESSION,
1643 PREC_AND_EXPRESSION,
1644 PREC_EQUALITY_EXPRESSION,
1645 PREC_RELATIONAL_EXPRESSION,
1646 PREC_SHIFT_EXPRESSION,
1647 PREC_ADDITIVE_EXPRESSION,
1648 PREC_MULTIPLICATIVE_EXPRESSION,
1649 PREC_PM_EXPRESSION,
1650 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1651 };
1653 /* A mapping from a token type to a corresponding tree node type, with a
1654 precedence value. */
1657 {
1658 /* The token type. */
1660 /* The corresponding tree code. */
1662 /* The precedence of this operator. */
1667 {
1668 /* Left hand side of the binary operation we are currently
1669 parsing. */
1670 tree lhs;
1671 /* Original tree code for left hand side, if it was a binary
1672 expression itself (used for -Wparentheses). */
1674 /* Tree code for the binary operation we are parsing. */
1676 /* Precedence of the binary operation we are parsing. */
1678 /* Location of the binary operation we are parsing. */
1679 location_t loc;
1682 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1683 entries because precedence levels on the stack are monotonically
1684 increasing. */
1688 /* Prototypes. */
1690 /* Constructors and destructors. */
1695 /* Class variables. */
1699 /* The operator-precedence table used by cp_parser_binary_expression.
1700 Transformed into an associative array (binops_by_token) by
1701 cp_parser_new. */
1734 };
1736 /* The same as binops, but initialized by cp_parser_new so that
1737 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1738 for speed. */
1741 /* Constructors and destructors. */
1743 /* Construct a new context. The context below this one on the stack
1744 is given by NEXT. */
1748 {
1751 /* Allocate the storage. */
1753 {
1754 /* Pull the first entry from the free list. */
1758 }
1759 else
1762 /* No errors have occurred yet in this context. */
1764 /* If this is not the bottommost context, copy information that we
1765 need from the previous context. */
1767 {
1768 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1769 expression, then we are parsing one in this context, too. */
1771 /* Thread the stack. */
1773 }
1776 }
1778 /* Managing the unparsed function queues. */
1780 #define unparsed_funs_with_default_args \
1781 parser->unparsed_queues->last ().funs_with_default_args
1782 #define unparsed_funs_with_definitions \
1783 parser->unparsed_queues->last ().funs_with_definitions
1784 #define unparsed_nsdmis \
1785 parser->unparsed_queues->last ().nsdmis
1787 static void
1789 {
1792 }
1794 static void
1796 {
1799 }
1801 /* Prototypes. */
1803 /* Constructors and destructors. */
1808 /* Routines to parse various constructs.
1810 Those that return `tree' will return the error_mark_node (rather
1811 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1812 Sometimes, they will return an ordinary node if error-recovery was
1813 attempted, even though a parse error occurred. So, to check
1814 whether or not a parse error occurred, you should always use
1815 cp_parser_error_occurred. If the construct is optional (indicated
1816 either by an `_opt' in the name of the function that does the
1817 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1818 the construct is not present. */
1820 /* Lexical conventions [gram.lex] */
1822 static tree cp_parser_identifier
1824 static tree cp_parser_string_literal
1826 static tree cp_parser_userdef_char_literal
1828 static tree cp_parser_userdef_string_literal
1830 static tree cp_parser_userdef_numeric_literal
1833 /* Basic concepts [gram.basic] */
1835 static bool cp_parser_translation_unit
1838 /* Expressions [gram.expr] */
1840 static tree cp_parser_primary_expression
1842 static tree cp_parser_id_expression
1844 static tree cp_parser_unqualified_id
1846 static tree cp_parser_nested_name_specifier_opt
1848 static tree cp_parser_nested_name_specifier
1850 static tree cp_parser_qualifying_entity
1852 static tree cp_parser_postfix_expression
1854 static tree cp_parser_postfix_open_square_expression
1856 static tree cp_parser_postfix_dot_deref_expression
1860 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1862 static void cp_parser_pseudo_destructor_name
1864 static tree cp_parser_unary_expression
1866 static enum tree_code cp_parser_unary_operator
1868 static tree cp_parser_new_expression
1872 static tree cp_parser_new_type_id
1880 static tree cp_parser_delete_expression
1882 static tree cp_parser_cast_expression
1884 static tree cp_parser_binary_expression
1886 static tree cp_parser_question_colon_clause
1888 static tree cp_parser_assignment_expression
1890 static enum tree_code cp_parser_assignment_operator_opt
1892 static tree cp_parser_expression
1894 static tree cp_parser_expression
1896 static tree cp_parser_constant_expression
1898 static tree cp_parser_builtin_offsetof
1900 static tree cp_parser_lambda_expression
1902 static void cp_parser_lambda_introducer
1904 static bool cp_parser_lambda_declarator_opt
1906 static void cp_parser_lambda_body
1909 /* Statements [gram.stmt.stmt] */
1911 static void cp_parser_statement
1913 static void cp_parser_label_for_labeled_statement
1915 static tree cp_parser_expression_statement
1917 static tree cp_parser_compound_statement
1919 static void cp_parser_statement_seq_opt
1921 static tree cp_parser_selection_statement
1923 static tree cp_parser_condition
1925 static tree cp_parser_iteration_statement
1927 static bool cp_parser_for_init_statement
1929 static tree cp_parser_for
1931 static tree cp_parser_c_for
1933 static tree cp_parser_range_for
1935 static void do_range_for_auto_deduction
1937 static tree cp_parser_perform_range_for_lookup
1939 static tree cp_parser_range_for_member_function
1941 static tree cp_parser_jump_statement
1943 static void cp_parser_declaration_statement
1946 static tree cp_parser_implicitly_scoped_statement
1948 static void cp_parser_already_scoped_statement
1951 /* Declarations [gram.dcl.dcl] */
1953 static void cp_parser_declaration_seq_opt
1955 static void cp_parser_declaration
1957 static void cp_parser_block_declaration
1959 static void cp_parser_simple_declaration
1961 static void cp_parser_decl_specifier_seq
1963 static tree cp_parser_storage_class_specifier_opt
1965 static tree cp_parser_function_specifier_opt
1967 static tree cp_parser_type_specifier
1970 static tree cp_parser_simple_type_specifier
1972 static tree cp_parser_type_name
1974 static tree cp_parser_nonclass_name
1976 static tree cp_parser_elaborated_type_specifier
1978 static tree cp_parser_enum_specifier
1980 static void cp_parser_enumerator_list
1982 static void cp_parser_enumerator_definition
1984 static tree cp_parser_namespace_name
1986 static void cp_parser_namespace_definition
1988 static void cp_parser_namespace_body
1990 static tree cp_parser_qualified_namespace_specifier
1992 static void cp_parser_namespace_alias_definition
1994 static bool cp_parser_using_declaration
1996 static void cp_parser_using_directive
1998 static tree cp_parser_alias_declaration
2000 static void cp_parser_asm_definition
2002 static void cp_parser_linkage_specification
2004 static void cp_parser_static_assert
2006 static tree cp_parser_decltype
2009 /* Declarators [gram.dcl.decl] */
2011 static tree cp_parser_init_declarator
2012 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2017 static enum tree_code cp_parser_ptr_operator
2019 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2021 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2023 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2025 static tree cp_parser_late_return_type_opt
2027 static tree cp_parser_declarator_id
2029 static tree cp_parser_type_id
2031 static tree cp_parser_template_type_arg
2034 static tree cp_parser_type_id_1
2036 static void cp_parser_type_specifier_seq
2038 static tree cp_parser_parameter_declaration_clause
2040 static tree cp_parser_parameter_declaration_list
2044 static tree cp_parser_default_argument
2046 static void cp_parser_function_body
2048 static tree cp_parser_initializer
2050 static tree cp_parser_initializer_clause
2052 static tree cp_parser_braced_list
2057 static bool cp_parser_ctor_initializer_opt_and_function_body
2060 /* Classes [gram.class] */
2062 static tree cp_parser_class_name
2064 static tree cp_parser_class_specifier
2066 static tree cp_parser_class_head
2068 static enum tag_types cp_parser_class_key
2070 static void cp_parser_member_specification_opt
2072 static void cp_parser_member_declaration
2074 static tree cp_parser_pure_specifier
2076 static tree cp_parser_constant_initializer
2079 /* Derived classes [gram.class.derived] */
2081 static tree cp_parser_base_clause
2083 static tree cp_parser_base_specifier
2086 /* Special member functions [gram.special] */
2088 static tree cp_parser_conversion_function_id
2090 static tree cp_parser_conversion_type_id
2094 static bool cp_parser_ctor_initializer_opt
2096 static void cp_parser_mem_initializer_list
2098 static tree cp_parser_mem_initializer
2100 static tree cp_parser_mem_initializer_id
2103 /* Overloading [gram.over] */
2105 static tree cp_parser_operator_function_id
2107 static tree cp_parser_operator
2110 /* Templates [gram.temp] */
2112 static void cp_parser_template_declaration
2114 static tree cp_parser_template_parameter_list
2116 static tree cp_parser_template_parameter
2118 static tree cp_parser_type_parameter
2120 static tree cp_parser_template_id
2122 static tree cp_parser_template_name
2124 static tree cp_parser_template_argument_list
2126 static tree cp_parser_template_argument
2128 static void cp_parser_explicit_instantiation
2130 static void cp_parser_explicit_specialization
2133 /* Exception handling [gram.exception] */
2135 static tree cp_parser_try_block
2137 static bool cp_parser_function_try_block
2139 static void cp_parser_handler_seq
2141 static void cp_parser_handler
2143 static tree cp_parser_exception_declaration
2145 static tree cp_parser_throw_expression
2147 static tree cp_parser_exception_specification_opt
2149 static tree cp_parser_type_id_list
2152 /* GNU Extensions */
2154 static tree cp_parser_asm_specification_opt
2156 static tree cp_parser_asm_operand_list
2158 static tree cp_parser_asm_clobber_list
2160 static tree cp_parser_asm_label_list
2162 static bool cp_next_tokens_can_be_attribute_p
2164 static bool cp_next_tokens_can_be_gnu_attribute_p
2166 static bool cp_next_tokens_can_be_std_attribute_p
2168 static bool cp_nth_tokens_can_be_std_attribute_p
2170 static bool cp_nth_tokens_can_be_gnu_attribute_p
2172 static bool cp_nth_tokens_can_be_attribute_p
2174 static tree cp_parser_attributes_opt
2176 static tree cp_parser_gnu_attributes_opt
2178 static tree cp_parser_gnu_attribute_list
2180 static tree cp_parser_std_attribute
2182 static tree cp_parser_std_attribute_spec
2184 static tree cp_parser_std_attribute_spec_seq
2186 static bool cp_parser_extension_opt
2188 static void cp_parser_label_declaration
2191 /* Transactional Memory Extensions */
2193 static tree cp_parser_transaction
2195 static tree cp_parser_transaction_expression
2197 static bool cp_parser_function_transaction
2199 static tree cp_parser_transaction_cancel
2203 static bool cp_parser_pragma
2206 /* Objective-C++ Productions */
2208 static tree cp_parser_objc_message_receiver
2210 static tree cp_parser_objc_message_args
2212 static tree cp_parser_objc_message_expression
2214 static tree cp_parser_objc_encode_expression
2216 static tree cp_parser_objc_defs_expression
2218 static tree cp_parser_objc_protocol_expression
2220 static tree cp_parser_objc_selector_expression
2222 static tree cp_parser_objc_expression
2224 static bool cp_parser_objc_selector_p
2226 static tree cp_parser_objc_selector
2228 static tree cp_parser_objc_protocol_refs_opt
2230 static void cp_parser_objc_declaration
2232 static tree cp_parser_objc_statement
2234 static bool cp_parser_objc_valid_prefix_attributes
2236 static void cp_parser_objc_at_property_declaration
2238 static void cp_parser_objc_at_synthesize_declaration
2240 static void cp_parser_objc_at_dynamic_declaration
2242 static tree cp_parser_objc_struct_declaration
2245 /* Utility Routines */
2247 static tree cp_parser_lookup_name
2249 static tree cp_parser_lookup_name_simple
2251 static tree cp_parser_maybe_treat_template_as_class
2253 static bool cp_parser_check_declarator_template_parameters
2255 static bool cp_parser_check_template_parameters
2257 static tree cp_parser_simple_cast_expression
2259 static tree cp_parser_global_scope_opt
2261 static bool cp_parser_constructor_declarator_p
2263 static tree cp_parser_function_definition_from_specifiers_and_declarator
2265 static tree cp_parser_function_definition_after_declarator
2267 static void cp_parser_template_declaration_after_export
2269 static void cp_parser_perform_template_parameter_access_checks
2271 static tree cp_parser_single_declaration
2273 static tree cp_parser_functional_cast
2275 static tree cp_parser_save_member_function_body
2277 static tree cp_parser_save_nsdmi
2279 static tree cp_parser_enclosed_template_argument_list
2281 static void cp_parser_save_default_args
2283 static void cp_parser_late_parsing_for_member
2285 static tree cp_parser_late_parse_one_default_arg
2287 static void cp_parser_late_parsing_nsdmi
2289 static void cp_parser_late_parsing_default_args
2291 static tree cp_parser_sizeof_operand
2293 static tree cp_parser_trait_expr
2295 static bool cp_parser_declares_only_class_p
2297 static void cp_parser_set_storage_class
2299 static void cp_parser_set_decl_spec_type
2301 static void set_and_check_decl_spec_loc
2304 static bool cp_parser_friend_p
2306 static void cp_parser_required_error
2312 static bool cp_parser_token_starts_function_definition_p
2314 static bool cp_parser_next_token_starts_class_definition_p
2316 static bool cp_parser_next_token_ends_template_argument_p
2318 static bool cp_parser_nth_token_starts_template_argument_list_p
2320 static enum tag_types cp_parser_token_is_class_key
2322 static void cp_parser_check_class_key
2324 static void cp_parser_check_access_in_redeclaration
2326 static bool cp_parser_optional_template_keyword
2328 static void cp_parser_pre_parsed_nested_name_specifier
2330 static bool cp_parser_cache_group
2332 static tree cp_parser_cache_defarg
2334 static void cp_parser_parse_tentatively
2336 static void cp_parser_commit_to_tentative_parse
2338 static void cp_parser_abort_tentative_parse
2340 static bool cp_parser_parse_definitely
2344 static bool cp_parser_uncommitted_to_tentative_parse_p
2346 static void cp_parser_error
2348 static void cp_parser_name_lookup_error
2350 static bool cp_parser_simulate_error
2352 static bool cp_parser_check_type_definition
2354 static void cp_parser_check_for_definition_in_return_type
2356 static void cp_parser_check_for_invalid_template_id
2358 static bool cp_parser_non_integral_constant_expression
2360 static void cp_parser_diagnose_invalid_type_name
2362 static bool cp_parser_parse_and_diagnose_invalid_type_name
2364 static int cp_parser_skip_to_closing_parenthesis
2366 static void cp_parser_skip_to_end_of_statement
2368 static void cp_parser_consume_semicolon_at_end_of_statement
2370 static void cp_parser_skip_to_end_of_block_or_statement
2372 static bool cp_parser_skip_to_closing_brace
2374 static void cp_parser_skip_to_end_of_template_parameter_list
2376 static void cp_parser_skip_to_pragma_eol
2378 static bool cp_parser_error_occurred
2380 static bool cp_parser_allow_gnu_extensions_p
2382 static bool cp_parser_is_pure_string_literal
2384 static bool cp_parser_is_string_literal
2386 static bool cp_parser_is_keyword
2388 static tree cp_parser_make_typename_type
2393 /* Returns nonzero if we are parsing tentatively. */
2397 {
2399 }
2401 /* Returns nonzero if TOKEN is a string literal. */
2403 static bool
2405 {
2411 }
2413 /* Returns nonzero if TOKEN is a string literal
2414 of a user-defined string literal. */
2416 static bool
2418 {
2425 }
2427 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2429 static bool
2431 {
2433 }
2435 /* If not parsing tentatively, issue a diagnostic of the form
2436 FILE:LINE: MESSAGE before TOKEN
2437 where TOKEN is the next token in the input stream. MESSAGE
2438 (specified by the caller) is usually of the form "expected
2439 OTHER-TOKEN". */
2441 static void
2443 {
2445 {
2447 /* This diagnostic makes more sense if it is tagged to the line
2448 of the token we just peeked at. */
2452 {
2457 }
2460 /* Because c_parser_error does not understand
2461 CPP_KEYWORD, keywords are treated like
2462 identifiers. */
2465 }
2466 }
2468 /* Issue an error about name-lookup failing. NAME is the
2469 IDENTIFIER_NODE DECL is the result of
2470 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2471 the thing that we hoped to find. */
2473 static void
2475 tree name,
2476 tree decl,
2477 name_lookup_error desired,
2478 location_t location)
2479 {
2480 /* If name lookup completely failed, tell the user that NAME was not
2481 declared. */
2483 {
2496 else
2498 }
2500 {
2502 {
2519 }
2520 }
2522 {
2524 {
2534 name);
2538 }
2539 }
2540 else
2541 {
2543 {
2556 }
2557 }
2558 }
2560 /* If we are parsing tentatively, remember that an error has occurred
2561 during this tentative parse. Returns true if the error was
2562 simulated; false if a message should be issued by the caller. */
2564 static bool
2566 {
2568 {
2571 }
2573 }
2575 /* This function is called when a type is defined. If type
2576 definitions are forbidden at this point, an error message is
2577 issued. */
2579 static bool
2581 {
2582 /* If types are forbidden here, issue a message. */
2584 {
2585 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2586 in the message need to be interpreted. */
2589 }
2591 }
2593 /* This function is called when the DECLARATOR is processed. The TYPE
2594 was a type defined in the decl-specifiers. If it is invalid to
2595 define a type in the decl-specifiers for DECLARATOR, an error is
2596 issued. TYPE_LOCATION is the location of TYPE and is used
2597 for error reporting. */
2599 static void
2602 {
2603 /* [dcl.fct] forbids type definitions in return types.
2604 Unfortunately, it's not easy to know whether or not we are
2605 processing a return type until after the fact. */
2613 {
2618 type);
2619 }
2620 }
2622 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2623 "<" in any valid C++ program. If the next token is indeed "<",
2624 issue a message warning the user about what appears to be an
2625 invalid attempt to form a template-id. LOCATION is the location
2626 of the type-specifier (TYPE) */
2628 static void
2630 tree type,
2632 location_t location)
2633 {
2637 {
2641 {
2644 else
2646 }
2647 else
2649 /* Remember the location of the invalid "<". */
2652 /* Consume the "<". */
2654 /* Parse the template arguments. */
2656 /* Permanently remove the invalid template arguments so that
2657 this error message is not issued again. */
2660 }
2661 }
2663 /* If parsing an integral constant-expression, issue an error message
2664 about the fact that THING appeared and return true. Otherwise,
2665 return false. In either case, set
2666 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2668 static bool
2670 non_integral_constant thing)
2671 {
2674 {
2676 {
2679 {
2686 "enumeration type cannot appear in a "
2777 }
2781 }
2782 }
2784 }
2786 /* Emit a diagnostic for an invalid type name. SCOPE is the
2787 qualifying scope (or NULL, if none) for ID. This function commits
2788 to the current active tentative parse, if any. (Otherwise, the
2789 problematic construct might be encountered again later, resulting
2790 in duplicate error messages.) LOCATION is the location of ID. */
2792 static void
2795 location_t location)
2796 {
2799 /* Try to lookup the identifier. */
2804 /* If the lookup found a template-name, it means that the user forgot
2805 to specify an argument list. Emit a useful error message. */
2809 decl);
2813 /* Something like 'unsigned A a;' */
2816 {
2817 /* Issue an error message. */
2819 /* If we're in a template class, it's possible that the user was
2820 referring to a type from a base class. For example:
2822 template <typename T> struct A { typedef T X; };
2823 template <typename T> struct B : public A<T> { X x; };
2825 The user should have said "typename A<T>::X". */
2831 {
2832 tree b;
2835 b;
2837 {
2841 {
2842 tree field;
2843 /* Go from a particular instantiation of the
2844 template (which will have an empty TYPE_FIELDs),
2845 to the main version. */
2848 field;
2852 {
2857 }
2860 }
2861 }
2862 }
2863 }
2864 /* Here we diagnose qualified-ids where the scope is actually correct,
2865 but the identifier does not resolve to a valid type name. */
2867 {
2873 {
2874 /* A<T>::A<T>() */
2880 }
2889 else
2891 }
2892 }
2894 /* Check for a common situation where a type-name should be present,
2895 but is not, and issue a sensible error message. Returns true if an
2896 invalid type-name was detected.
2898 The situation handled by this function are variable declarations of the
2899 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2900 Usually, `ID' should name a type, but if we got here it means that it
2901 does not. We try to emit the best possible error message depending on
2902 how exactly the id-expression looks like. */
2904 static bool
2906 {
2907 tree id;
2910 /* Avoid duplicate error about ambiguous lookup. */
2912 {
2916 }
2925 /* If the next token is a (, this is a function with no explicit return
2926 type, i.e. constructor, destructor or conversion op. */
2929 {
2932 }
2936 /* Emit a diagnostic for the invalid type. */
2939 out:
2940 /* If we aren't in the middle of a declarator (i.e. in a
2941 parameter-declaration-clause), skip to the end of the declaration;
2942 there's no point in trying to process it. */
2946 }
2948 /* Consume tokens up to, and including, the next non-nested closing `)'.
2949 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2950 are doing error recovery. Returns -1 if OR_COMMA is true and we
2951 found an unnested comma. */
2953 static int
2958 {
2968 {
2972 {
2975 /* If we've run out of tokens, then there is no closing `)'. */
2978 /* This is good for lambda expression capture-lists. */
2988 /* This matches the processing in skip_to_end_of_statement. */
3014 {
3018 }
3023 }
3025 /* Consume the token. */
3027 }
3028 }
3030 /* Consume tokens until we reach the end of the current statement.
3031 Normally, that will be just before consuming a `;'. However, if a
3032 non-nested `}' comes first, then we stop before consuming that. */
3034 static void
3036 {
3040 {
3044 {
3047 /* If we've run out of tokens, stop. */
3051 /* If the next token is a `;', we have reached the end of the
3052 statement. */
3058 /* If this is a non-nested '}', stop before consuming it.
3059 That way, when confronted with something like:
3061 { 3 + }
3063 we stop before consuming the closing '}', even though we
3064 have not yet reached a `;'. */
3068 /* If it is the closing '}' for a block that we have
3069 scanned, stop -- but only after consuming the token.
3070 That way given:
3072 void f g () { ... }
3073 typedef int I;
3075 we will stop after the body of the erroneously declared
3076 function, but before consuming the following `typedef'
3077 declaration. */
3079 {
3082 }
3090 }
3092 /* Consume the token. */
3094 }
3095 }
3097 /* This function is called at the end of a statement or declaration.
3098 If the next token is a semicolon, it is consumed; otherwise, error
3099 recovery is attempted. */
3101 static void
3103 {
3104 /* Look for the trailing `;'. */
3106 {
3107 /* If there is additional (erroneous) input, skip to the end of
3108 the statement. */
3110 /* If the next token is now a `;', consume it. */
3113 }
3114 }
3116 /* Skip tokens until we have consumed an entire block, or until we
3117 have consumed a non-nested `;'. */
3119 static void
3121 {
3125 {
3129 {
3132 /* If we've run out of tokens, stop. */
3136 /* Stop if this is an unnested ';'. */
3142 /* Stop if this is an unnested '}', or closes the outermost
3143 nesting level. */
3144 nesting_depth--;
3152 /* Nest. */
3153 nesting_depth++;
3158 }
3160 /* Consume the token. */
3162 }
3163 }
3165 /* Skip tokens until a non-nested closing curly brace is the next
3166 token, or there are no more tokens. Return true in the first case,
3167 false otherwise. */
3169 static bool
3171 {
3175 {
3179 {
3182 /* If we've run out of tokens, stop. */
3186 /* If the next token is a non-nested `}', then we have reached
3187 the end of the current block. */
3193 /* If it the next token is a `{', then we are entering a new
3194 block. Consume the entire block. */
3200 }
3202 /* Consume the token. */
3204 }
3205 }
3207 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3208 parameter is the PRAGMA token, allowing us to purge the entire pragma
3209 sequence. */
3211 static void
3213 {
3218 do
3222 /* Ensure that the pragma is not parsed again. */
3224 }
3226 /* Require pragma end of line, resyncing with it as necessary. The
3227 arguments are as for cp_parser_skip_to_pragma_eol. */
3229 static void
3231 {
3235 }
3237 /* This is a simple wrapper around make_typename_type. When the id is
3238 an unresolved identifier node, we can provide a superior diagnostic
3239 using cp_parser_diagnose_invalid_type_name. */
3241 static tree
3244 {
3245 tree result;
3247 {
3253 }
3255 }
3257 /* This is a wrapper around the
3258 make_{pointer,ptrmem,reference}_declarator functions that decides
3259 which one to call based on the CODE and CLASS_TYPE arguments. The
3260 CODE argument should be one of the values returned by
3261 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3262 appertain to the pointer or reference. */
3266 cp_cv_quals cv_qualifiers,
3268 tree attributes)
3269 {
3276 else
3286 }
3288 /* Create a new C++ parser. */
3292 {
3297 /* cp_lexer_new_main is called before doing GC allocation because
3298 cp_lexer_new_main might load a PCH file. */
3301 /* Initialize the binops_by_token so that we can get the tree
3302 directly from the token. */
3310 /* For now, we always accept GNU extensions. */
3313 /* The `>' token is a greater-than operator, not the end of a
3314 template-id. */
3319 /* We are not parsing a constant-expression. */
3324 /* Local variable names are not forbidden. */
3327 /* We are not processing an `extern "C"' declaration. */
3330 /* We are not processing a declarator. */
3333 /* We are not processing a template-argument-list. */
3336 /* We are not in an iteration statement. */
3339 /* We are not in a switch statement. */
3342 /* We are not parsing a type-id inside an expression. */
3345 /* Declarations aren't implicitly extern "C". */
3348 /* String literals should be translated to the execution character set. */
3351 /* We are not parsing a function body. */
3354 /* We can correct until told otherwise. */
3357 /* The unparsed function queue is empty. */
3360 /* There are no classes being defined. */
3363 /* No template parameters apply. */
3367 }
3369 /* Create a cp_lexer structure which will emit the tokens in CACHE
3370 and push it onto the parser's lexer stack. This is used for delayed
3371 parsing of in-class method bodies and default arguments, and should
3372 not be confused with tentative parsing. */
3373 static void
3375 {
3380 /* Move the current source position to that of the first token in the
3381 new lexer. */
3383 }
3385 /* Pop the top lexer off the parser stack. This is never used for the
3386 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3387 static void
3389 {
3394 /* Put the current source position back where it was before this
3395 lexer was pushed. */
3397 }
3399 /* Lexical conventions [gram.lex] */
3401 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3402 identifier. */
3404 static tree
3406 {
3409 /* Look for the identifier. */
3411 /* Return the value. */
3413 }
3415 /* Parse a sequence of adjacent string constants. Returns a
3416 TREE_STRING representing the combined, nul-terminated string
3417 constant. If TRANSLATE is true, translate the string to the
3418 execution character set. If WIDE_OK is true, a wide string is
3419 invalid here.
3421 C++98 [lex.string] says that if a narrow string literal token is
3422 adjacent to a wide string literal token, the behavior is undefined.
3423 However, C99 6.4.5p4 says that this results in a wide string literal.
3424 We follow C99 here, for consistency with the C front end.
3426 This code is largely lifted from lex_string() in c-lex.c.
3428 FUTURE: ObjC++ will need to handle @-strings here. */
3429 static tree
3431 {
3432 tree value;
3439 tree string_tree;
3445 {
3448 }
3451 {
3455 }
3456 else
3457 {
3460 }
3463 /* Try to avoid the overhead of creating and destroying an obstack
3464 for the common case of just one string. */
3467 {
3475 {
3479 }
3480 else
3484 }
3485 else
3486 {
3490 do
3491 {
3493 count++;
3498 {
3501 {
3504 }
3507 {
3512 }
3514 }
3515 else
3519 {
3524 "unsupported non-standard concatenation "
3526 }
3532 {
3536 }
3537 else
3538 {
3542 }
3543 }
3547 }
3550 {
3553 }
3557 {
3562 {
3577 }
3582 {
3587 }
3588 }
3589 else
3590 /* cpp_interpret_string has issued an error. */
3597 }
3599 /* Look up a literal operator with the name and the exact arguments. */
3601 static tree
3603 {
3610 {
3616 {
3619 {
3629 }
3632 /* May be this should be sufficient_parms_p instead,
3633 depending on how exactly should user-defined literals
3634 work in presence of default arguments on the literal
3635 operator parameters. */
3638 }
3639 }
3642 }
3644 /* Parse a user-defined char constant. Returns a call to a user-defined
3645 literal operator taking the character as an argument. */
3647 static tree
3649 {
3657 /* Build up a call to the user-defined operator */
3658 /* Lookup the name we got back from the id-expression. */
3663 {
3668 }
3677 }
3679 /* A subroutine of cp_parser_userdef_numeric_literal to
3680 create a char... template parameter pack from a string node. */
3682 static tree
3684 {
3685 tree charvec;
3691 /* Fill in CHARVEC with all of the parameters. */
3696 /* Build the argument packs. */
3703 }
3705 /* Parse a user-defined numeric constant. returns a call to a user-defined
3706 literal operator. */
3708 static tree
3710 {
3721 /* Look for a literal operator taking the exact type of numeric argument
3722 as the literal value. */
3727 {
3730 {
3734 long_long_unsigned_type_node);
3735 else
3736 {
3740 long_double_type_node);
3744 }
3747 }
3748 }
3751 /* If the numeric argument didn't work, look for a raw literal
3752 operator taking a const char* argument consisting of the number
3753 in string format. */
3758 {
3761 {
3764 }
3765 }
3768 /* If the raw literal didn't work, look for a non-type template
3769 function with parameter pack char.... Call the function with
3770 template parameter characters representing the number. */
3774 {
3779 {
3782 }
3783 }
3788 }
3790 /* Parse a user-defined string constant. Returns a call to a user-defined
3791 literal operator taking a character pointer and the length of the string
3792 as arguments. */
3794 static tree
3796 {
3805 /* Build up a call to the user-defined operator */
3806 /* Lookup the name we got back from the id-expression. */
3812 {
3816 }
3825 }
3828 /* Basic concepts [gram.basic] */
3830 /* Parse a translation-unit.
3832 translation-unit:
3833 declaration-seq [opt]
3835 Returns TRUE if all went well. */
3837 static bool
3839 {
3840 /* The address of the first non-permanent object on the declarator
3841 obstack. */
3846 /* Create the declarator obstack, if necessary. */
3848 {
3850 /* Create the error declarator. */
3852 /* Create the empty parameter list. */
3854 /* Remember where the base of the declarator obstack lies. */
3856 }
3860 /* If there are no tokens left then all went well. */
3862 {
3863 /* Get rid of the token array; we don't need it any more. */
3867 /* This file might have been a context that's implicitly extern
3868 "C". If so, pop the lang context. (Only relevant for PCH.) */
3870 {
3873 }
3875 /* Finish up. */
3879 }
3880 else
3881 {
3884 }
3886 /* Make sure the declarator obstack was fully cleaned up. */
3890 /* All went well. */
3892 }
3894 /* Expressions [gram.expr] */
3896 /* Parse a primary-expression.
3898 primary-expression:
3899 literal
3900 this
3901 ( expression )
3902 id-expression
3904 GNU Extensions:
3906 primary-expression:
3907 ( compound-statement )
3908 __builtin_va_arg ( assignment-expression , type-id )
3909 __builtin_offsetof ( type-id , offsetof-expression )
3911 C++ Extensions:
3912 __has_nothrow_assign ( type-id )
3913 __has_nothrow_constructor ( type-id )
3914 __has_nothrow_copy ( type-id )
3915 __has_trivial_assign ( type-id )
3916 __has_trivial_constructor ( type-id )
3917 __has_trivial_copy ( type-id )
3918 __has_trivial_destructor ( type-id )
3919 __has_virtual_destructor ( type-id )
3920 __is_abstract ( type-id )
3921 __is_base_of ( type-id , type-id )
3922 __is_class ( type-id )
3923 __is_convertible_to ( type-id , type-id )
3924 __is_empty ( type-id )
3925 __is_enum ( type-id )
3926 __is_final ( type-id )
3927 __is_literal_type ( type-id )
3928 __is_pod ( type-id )
3929 __is_polymorphic ( type-id )
3930 __is_std_layout ( type-id )
3931 __is_trivial ( type-id )
3932 __is_union ( type-id )
3934 Objective-C++ Extension:
3936 primary-expression:
3937 objc-expression
3939 literal:
3940 __null
3942 ADDRESS_P is true iff this expression was immediately preceded by
3943 "&" and therefore might denote a pointer-to-member. CAST_P is true
3944 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3945 true iff this expression is a template argument.
3947 Returns a representation of the expression. Upon return, *IDK
3948 indicates what kind of id-expression (if any) was present. */
3950 static tree
3957 {
3960 /* Assume the primary expression is not an id-expression. */
3963 /* Peek at the next token. */
3966 {
3967 /* literal:
3968 integer-literal
3969 character-literal
3970 floating-literal
3971 string-literal
3972 boolean-literal
3973 pointer-literal
3974 user-defined-literal */
3984 {
3988 }
3989 /* Floating-point literals are only allowed in an integral
3990 constant expression if they are cast to an integral or
3991 enumeration type. */
3995 {
3996 /* CAST_P will be set even in invalid code like "int(2.7 +
3997 ...)". Therefore, we have to check that the next token
3998 is sure to end the cast. */
4000 {
4005 enumerator-definition. */
4007 /* The curly brace at the end of an enum-specifier. */
4009 /* The end of a statement. */
4011 /* The end of the cast-expression. */
4013 /* The end of an array bound. */
4015 /* The closing ">" in a template-argument-list. */
4018 /* C++0x only: A ">>" treated like two ">" tokens,
4019 in a template-argument-list. */
4024 }
4026 /* If we are within a cast, then the constraint that the
4027 cast is to an integral or enumeration type will be
4028 checked at that point. If we are not within a cast, then
4029 this code is invalid. */
4032 }
4051 /* ??? Should wide strings be allowed when parser->translate_strings_p
4052 is false (i.e. in attributes)? If not, we can kill the third
4053 argument to cp_parser_string_literal. */
4059 {
4060 tree expr;
4063 /* Consume the `('. */
4065 /* Within a parenthesized expression, a `>' token is always
4066 the greater-than operator. */
4067 saved_greater_than_is_operator_p
4070 /* If we see `( { ' then we are looking at the beginning of
4071 a GNU statement-expression. */
4074 {
4075 /* Statement-expressions are not allowed by the standard. */
4079 /* And they're not allowed outside of a function-body; you
4080 cannot, for example, write:
4082 int i = ({ int j = 3; j + 1; });
4084 at class or namespace scope. */
4087 {
4089 "statement-expressions are not allowed outside "
4093 }
4094 else
4095 {
4096 /* Start the statement-expression. */
4098 /* Parse the compound-statement. */
4100 /* Finish up. */
4102 }
4103 }
4104 else
4105 {
4106 /* Parse the parenthesized expression. */
4108 /* Let the front end know that this expression was
4109 enclosed in parentheses. This matters in case, for
4110 example, the expression is of the form `A::B', since
4111 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4112 not. */
4114 /* DR 705: Wrapping an unqualified name in parentheses
4115 suppresses arg-dependent lookup. We want to pass back
4116 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4117 (c++/37862), but none of the others. */
4120 }
4121 /* The `>' token might be the end of a template-id or
4122 template-parameter-list now. */
4123 parser->greater_than_is_operator_p
4125 /* Consume the `)'. */
4130 }
4134 /* We have an Objective-C++ message. */
4136 {
4138 /* Don't warn about a failed tentative parse. */
4143 }
4147 /* We have an Objective-C++ string literal. */
4154 {
4155 /* These two are the boolean literals. */
4163 /* The `__null' literal. */
4168 /* The `nullptr' literal. */
4173 /* Recognize the `this' keyword. */
4177 {
4181 }
4182 /* Pointers cannot appear in constant-expressions. */
4187 /* The `operator' keyword can be the beginning of an
4188 id-expression. */
4195 {
4196 non_integral_constant name;
4198 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4199 __func__ are the names of variables -- but they are
4200 treated specially. Therefore, they are handled here,
4201 rather than relying on the generic id-expression logic
4202 below. Grammatically, these names are id-expressions.
4204 Consume the token. */
4208 {
4220 }
4225 /* Look up the name. */
4227 }
4230 {
4231 tree expression;
4232 tree type;
4233 source_location type_location;
4235 /* The `__builtin_va_arg' construct is used to handle
4236 `va_arg'. Consume the `__builtin_va_arg' token. */
4238 /* Look for the opening `('. */
4240 /* Now, parse the assignment-expression. */
4243 /* Look for the `,'. */
4246 /* Parse the type-id. */
4248 /* Look for the closing `)'. */
4250 /* Using `va_arg' in a constant-expression is not
4251 allowed. */
4253 NIC_VA_ARG))
4256 }
4284 /* Objective-C++ expressions. */
4294 {
4299 }
4303 }
4305 /* An id-expression can start with either an identifier, a
4306 `::' as the beginning of a qualified-id, or the "operator"
4307 keyword. */
4312 {
4313 tree id_expression;
4314 tree decl;
4320 id_expression:
4321 /* Parse the id-expression. */
4322 id_expression
4339 /* If we have a template-id, then no further lookup is
4340 required. If the template-id was for a template-class, we
4341 will sometimes have a TYPE_DECL at this point. */
4345 /* Look up the name. */
4346 else
4347 {
4348 tree ambiguous_decls;
4350 /* If we already know that this lookup is ambiguous, then
4351 we've already issued an error message; there's no reason
4352 to check again. */
4355 {
4358 }
4361 none_type,
4362 template_p,
4367 /* If the lookup was ambiguous, an error will already have
4368 been issued. */
4372 /* In Objective-C++, we may have an Objective-C 2.0
4373 dot-syntax for classes here. */
4378 {
4379 tree component;
4386 }
4388 /* In Objective-C++, an instance variable (ivar) may be preferred
4389 to whatever cp_parser_lookup_name() found. */
4392 /* If name lookup gives us a SCOPE_REF, then the
4393 qualifying scope was dependent. */
4395 {
4396 /* At this point, we do not know if DECL is a valid
4397 integral constant expression. We assume that it is
4398 in fact such an expression, so that code like:
4400 template <int N> struct A {
4401 int a[B<N>::i];
4402 };
4404 is accepted. At template-instantiation time, we
4405 will check that B<N>::i is actually a constant. */
4407 }
4408 /* Check to see if DECL is a local variable in a context
4409 where that is forbidden. */
4412 {
4413 /* It might be that we only found DECL because we are
4414 trying to be generous with pre-ISO scoping rules.
4415 For example, consider:
4417 int i;
4418 void g() {
4419 for (int i = 0; i < 10; ++i) {}
4420 extern void f(int j = i);
4421 }
4423 Here, name look up will originally find the out
4424 of scope `i'. We need to issue a warning message,
4425 but then use the global `i'. */
4428 {
4431 decl);
4433 }
4434 }
4435 }
4437 decl = (finish_id_expression
4439 idk,
4444 template_arg_p,
4450 }
4452 /* Anything else is an error. */
4456 }
4457 }
4465 {
4468 }
4470 /* Parse an id-expression.
4472 id-expression:
4473 unqualified-id
4474 qualified-id
4476 qualified-id:
4477 :: [opt] nested-name-specifier template [opt] unqualified-id
4478 :: identifier
4479 :: operator-function-id
4480 :: template-id
4482 Return a representation of the unqualified portion of the
4483 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4484 a `::' or nested-name-specifier.
4486 Often, if the id-expression was a qualified-id, the caller will
4487 want to make a SCOPE_REF to represent the qualified-id. This
4488 function does not do this in order to avoid wastefully creating
4489 SCOPE_REFs when they are not required.
4491 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4492 `template' keyword.
4494 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4495 uninstantiated templates.
4497 If *TEMPLATE_P is non-NULL, it is set to true iff the
4498 `template' keyword is used to explicitly indicate that the entity
4499 named is a template.
4501 If DECLARATOR_P is true, the id-expression is appearing as part of
4502 a declarator, rather than as part of an expression. */
4504 static tree
4511 {
4515 /* Assume the `template' keyword was not used. */
4519 /* Look for the optional `::' operator. */
4520 global_scope_p
4523 /* Look for the optional nested-name-specifier. */
4524 nested_name_specifier_p
4527 check_dependency_p,
4529 declarator_p)
4531 /* If there is a nested-name-specifier, then we are looking at
4532 the first qualified-id production. */
4534 {
4535 tree saved_scope;
4536 tree saved_object_scope;
4537 tree saved_qualifying_scope;
4538 tree unqualified_id;
4541 /* See if the next token is the `template' keyword. */
4545 /* Name lookup we do during the processing of the
4546 unqualified-id might obliterate SCOPE. */
4550 /* Process the final unqualified-id. */
4552 check_dependency_p,
4553 declarator_p,
4555 /* Restore the SAVED_SCOPE for our caller. */
4561 }
4562 /* Otherwise, if we are in global scope, then we are looking at one
4563 of the other qualified-id productions. */
4565 {
4567 tree id;
4569 /* Peek at the next token. */
4572 /* If it's an identifier, and the next token is not a "<", then
4573 we can avoid the template-id case. This is an optimization
4574 for this common case. */
4576 && !cp_parser_nth_token_starts_template_argument_list_p
4581 /* Try a template-id. */
4585 none_type,
4586 declarator_p);
4587 /* If that worked, we're done. */
4591 /* Peek at the next token. (Changes in the token buffer may
4592 have invalidated the pointer obtained above.) */
4596 {
4603 /* Fall through. */
4608 }
4609 }
4610 else
4613 declarator_p,
4614 optional_p);
4615 }
4617 /* Parse an unqualified-id.
4619 unqualified-id:
4620 identifier
4621 operator-function-id
4622 conversion-function-id
4623 ~ class-name
4624 template-id
4626 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4627 keyword, in a construct like `A::template ...'.
4629 Returns a representation of unqualified-id. For the `identifier'
4630 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4631 production a BIT_NOT_EXPR is returned; the operand of the
4632 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4633 other productions, see the documentation accompanying the
4634 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4635 names are looked up in uninstantiated templates. If DECLARATOR_P
4636 is true, the unqualified-id is appearing as part of a declarator,
4637 rather than as part of an expression. */
4639 static tree
4645 {
4648 /* Peek at the next token. */
4652 {
4654 {
4655 tree id;
4657 /* We don't know yet whether or not this will be a
4658 template-id. */
4660 /* Try a template-id. */
4662 check_dependency_p,
4663 none_type,
4664 declarator_p);
4665 /* If it worked, we're done. */
4668 /* Otherwise, it's an ordinary identifier. */
4670 }
4674 check_dependency_p,
4675 none_type,
4676 declarator_p);
4679 {
4680 tree type_decl;
4681 tree qualifying_scope;
4682 tree object_scope;
4683 tree scope;
4686 /* Consume the `~' token. */
4688 /* Parse the class-name. The standard, as written, seems to
4689 say that:
4691 template <typename T> struct S { ~S (); };
4692 template <typename T> S<T>::~S() {}
4694 is invalid, since `~' must be followed by a class-name, but
4695 `S<T>' is dependent, and so not known to be a class.
4696 That's not right; we need to look in uninstantiated
4697 templates. A further complication arises from:
4699 template <typename T> void f(T t) {
4700 t.T::~T();
4701 }
4703 Here, it is not possible to look up `T' in the scope of `T'
4704 itself. We must look in both the current scope, and the
4705 scope of the containing complete expression.
4707 Yet another issue is:
4709 struct S {
4710 int S;
4711 ~S();
4712 };
4714 S::~S() {}
4716 The standard does not seem to say that the `S' in `~S'
4717 should refer to the type `S' and not the data member
4718 `S::S'. */
4720 /* DR 244 says that we look up the name after the "~" in the
4721 same scope as we looked up the qualifying name. That idea
4722 isn't fully worked out; it's more complicated than that. */
4727 /* Check for invalid scopes. */
4729 {
4733 }
4735 {
4739 scope);
4744 }
4747 /* If the name is of the form "X::~X" it's OK even if X is a
4748 typedef. */
4757 {
4760 }
4762 /* If there was an explicit qualification (S::~T), first look
4763 in the scope given by the qualification (i.e., S).
4765 Note: in the calls to cp_parser_class_name below we pass
4766 typename_type so that lookup finds the injected-class-name
4767 rather than the constructor. */
4771 {
4776 typename_type,
4779 declarator_p);
4782 }
4783 /* In "N::S::~S", look in "N" as well. */
4785 {
4790 type_decl
4794 typename_type,
4797 declarator_p);
4800 }
4801 /* In "p->S::~T", look in the scope given by "*p" as well. */
4803 {
4808 type_decl
4812 typename_type,
4815 declarator_p);
4818 }
4819 /* Look in the surrounding context. */
4821 {
4827 type_decl
4831 typename_type,
4834 declarator_p);
4837 {
4838 /* We couldn't find a type with this name, so just accept
4839 it and check for a match at instantiation time. */
4844 }
4845 }
4846 /* If an error occurred, assume that the name of the
4847 destructor is the same as the name of the qualifying
4848 class. That allows us to keep parsing after running
4849 into ill-formed destructor names. */
4855 /* Check that destructor name and scope match. */
4857 {
4864 }
4866 /* [class.dtor]
4868 A typedef-name that names a class shall not be used as the
4869 identifier in the declarator for a destructor declaration. */
4876 type_decl);
4879 }
4883 {
4884 tree id;
4886 /* This could be a template-id, so we try that first. */
4888 /* Try a template-id. */
4891 none_type,
4892 declarator_p);
4893 /* If that worked, we're done. */
4896 /* We still don't know whether we're looking at an
4897 operator-function-id or a conversion-function-id. */
4899 /* Try an operator-function-id. */
4901 /* If that didn't work, try a conversion-function-id. */
4905 {
4906 /* 17.6.3.3.5 */
4911 }
4914 }
4915 /* Fall through. */
4922 }
4923 }
4925 /* Parse an (optional) nested-name-specifier.
4927 nested-name-specifier: [C++98]
4928 class-or-namespace-name :: nested-name-specifier [opt]
4929 class-or-namespace-name :: template nested-name-specifier [opt]
4931 nested-name-specifier: [C++0x]
4932 type-name ::
4933 namespace-name ::
4934 nested-name-specifier identifier ::
4935 nested-name-specifier template [opt] simple-template-id ::
4937 PARSER->SCOPE should be set appropriately before this function is
4938 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4939 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4940 in name lookups.
4942 Sets PARSER->SCOPE to the class (TYPE) or namespace
4943 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4944 it unchanged if there is no nested-name-specifier. Returns the new
4945 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4947 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4948 part of a declaration and/or decl-specifier. */
4950 static tree
4956 {
4961 /* Remember where the nested-name-specifier starts. */
4963 {
4966 }
4969 {
4970 tree new_scope;
4971 tree old_scope;
4972 tree saved_qualifying_scope;
4975 /* Spot cases that cannot be the beginning of a
4976 nested-name-specifier. */
4979 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4980 the already parsed nested-name-specifier. */
4982 {
4983 /* Grab the nested-name-specifier and continue the loop. */
4985 /* If we originally encountered this nested-name-specifier
4986 with IS_DECLARATION set to false, we will not have
4987 resolved TYPENAME_TYPEs, so we must do so here. */
4990 {
4995 }
4998 }
5000 /* Spot cases that cannot be the beginning of a
5001 nested-name-specifier. On the second and subsequent times
5002 through the loop, we look for the `template' keyword. */
5004 ;
5005 /* A template-id can start a nested-name-specifier. */
5007 ;
5008 /* DR 743: decltype can be used in a nested-name-specifier. */
5010 ;
5011 else
5012 {
5013 /* If the next token is not an identifier, then it is
5014 definitely not a type-name or namespace-name. */
5017 /* If the following token is neither a `<' (to begin a
5018 template-id), nor a `::', then we are not looking at a
5019 nested-name-specifier. */
5025 {
5029 }
5032 && !cp_parser_nth_token_starts_template_argument_list_p
5035 }
5037 /* The nested-name-specifier is optional, so we parse
5038 tentatively. */
5041 /* Look for the optional `template' keyword, if this isn't the
5042 first time through the loop. */
5045 else
5048 /* Save the old scope since the name lookup we are about to do
5049 might destroy it. */
5052 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5053 look up names in "X<T>::I" in order to determine that "Y" is
5054 a template. So, if we have a typename at this point, we make
5055 an effort to look through it. */
5057 && !typename_keyword_p
5062 /* Parse the qualifying entity. */
5063 new_scope
5065 typename_keyword_p,
5066 template_keyword_p,
5067 check_dependency_p,
5068 type_p,
5069 is_declaration);
5070 /* Look for the `::' token. */
5073 /* If we found what we wanted, we keep going; otherwise, we're
5074 done. */
5076 {
5079 /* Restore the OLD_SCOPE since it was valid before the
5080 failed attempt at finding the last
5081 class-or-namespace-name. */
5085 /* If the next token is a decltype, and the one after that is a
5086 `::', then the decltype has failed to resolve to a class or
5087 enumeration type. Give this error even when parsing
5088 tentatively since it can't possibly be valid--and we're going
5089 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5090 won't get another chance.*/
5094 {
5101 /* As below. */
5104 }
5108 /* If the next token is an identifier, and the one after
5109 that is a `::', then any valid interpretation would have
5110 found a class-or-namespace-name. */
5116 {
5119 {
5121 {
5122 tree decl;
5123 tree ambiguous_decls;
5126 none_type,
5135 decl);
5137 {
5143 }
5144 else
5145 {
5147 cp_parser_name_lookup_error
5150 else
5151 cp_parser_name_lookup_error
5154 }
5155 }
5158 /* Treat this as a successful nested-name-specifier
5159 due to:
5161 [basic.lookup.qual]
5163 If the name found is not a class-name (clause
5164 _class_) or namespace-name (_namespace.def_), the
5165 program is ill-formed. */
5167 }
5169 }
5171 }
5172 /* We've found one valid nested-name-specifier. */
5174 /* Name lookup always gives us a DECL. */
5177 /* Uses of "template" must be followed by actual templates. */
5189 new_scope);
5190 /* If it is a class scope, try to complete it; we are about to
5191 be looking up names inside the class. */
5193 /* Since checking types for dependency can be expensive,
5194 avoid doing it if the type is already complete. */
5196 /* Do not try to complete dependent types. */
5198 {
5200 /* If it is a typedef to current class, use the current
5201 class instead, as the typedef won't have any names inside
5202 it yet. */
5206 }
5207 /* Make sure we look in the right scope the next time through
5208 the loop. */
5210 }
5212 /* If parsing tentatively, replace the sequence of tokens that makes
5213 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5214 token. That way, should we re-parse the token stream, we will
5215 not have to repeat the effort required to do the parse, nor will
5216 we issue duplicate error messages. */
5218 {
5222 /* Reset the contents of the START token. */
5224 /* Retrieve any deferred checks. Do not pop this access checks yet
5225 so the memory will not be reclaimed during token replacing below. */
5233 /* Purge all subsequent tokens. */
5235 }
5241 }
5243 /* Parse a nested-name-specifier. See
5244 cp_parser_nested_name_specifier_opt for details. This function
5245 behaves identically, except that it will an issue an error if no
5246 nested-name-specifier is present. */
5248 static tree
5254 {
5255 tree scope;
5257 /* Look for the nested-name-specifier. */
5259 typename_keyword_p,
5260 check_dependency_p,
5261 type_p,
5262 is_declaration);
5263 /* If it was not present, issue an error message. */
5265 {
5268 }
5271 }
5273 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5274 this is either a class-name or a namespace-name (which corresponds
5275 to the class-or-namespace-name production in the grammar). For
5276 C++0x, it can also be a type-name that refers to an enumeration
5277 type or a simple-template-id.
5279 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5280 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5281 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5282 TYPE_P is TRUE iff the next name should be taken as a class-name,
5283 even the same name is declared to be another entity in the same
5284 scope.
5286 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5287 specified by the class-or-namespace-name. If neither is found the
5288 ERROR_MARK_NODE is returned. */
5290 static tree
5297 {
5298 tree saved_scope;
5299 tree saved_qualifying_scope;
5300 tree saved_object_scope;
5301 tree scope;
5305 /* DR 743: decltype can appear in a nested-name-specifier. */
5307 {
5311 {
5314 }
5318 }
5320 /* Before we try to parse the class-name, we must save away the
5321 current PARSER->SCOPE since cp_parser_class_name will destroy
5322 it. */
5326 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5327 there is no need to look for a namespace-name. */
5328 only_class_p = template_keyword_p
5333 typename_keyword_p,
5334 template_keyword_p,
5336 check_dependency_p,
5338 is_declaration);
5340 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5344 {
5345 /* Restore the saved scope. */
5350 /* Parse tentatively. */
5353 /* Parse a type-name */
5356 /* "If the name found does not designate a namespace or a class,
5357 enumeration, or dependent type, the program is ill-formed."
5359 We cover classes and dependent types above and namespaces below,
5360 so this code is only looking for enums. */
5366 }
5367 /* If that didn't work, try for a namespace-name. */
5369 {
5370 /* Restore the saved scope. */
5374 /* If we are not looking at an identifier followed by the scope
5375 resolution operator, then this is not part of a
5376 nested-name-specifier. (Note that this function is only used
5377 to parse the components of a nested-name-specifier.) */
5382 }
5385 }
5387 /* Parse a postfix-expression.
5389 postfix-expression:
5390 primary-expression
5391 postfix-expression [ expression ]
5392 postfix-expression ( expression-list [opt] )
5393 simple-type-specifier ( expression-list [opt] )
5394 typename :: [opt] nested-name-specifier identifier
5395 ( expression-list [opt] )
5396 typename :: [opt] nested-name-specifier template [opt] template-id
5397 ( expression-list [opt] )
5398 postfix-expression . template [opt] id-expression
5399 postfix-expression -> template [opt] id-expression
5400 postfix-expression . pseudo-destructor-name
5401 postfix-expression -> pseudo-destructor-name
5402 postfix-expression ++
5403 postfix-expression --
5404 dynamic_cast < type-id > ( expression )
5405 static_cast < type-id > ( expression )
5406 reinterpret_cast < type-id > ( expression )
5407 const_cast < type-id > ( expression )
5408 typeid ( expression )
5409 typeid ( type-id )
5411 GNU Extension:
5413 postfix-expression:
5414 ( type-id ) { initializer-list , [opt] }
5416 This extension is a GNU version of the C99 compound-literal
5417 construct. (The C99 grammar uses `type-name' instead of `type-id',
5418 but they are essentially the same concept.)
5420 If ADDRESS_P is true, the postfix expression is the operand of the
5421 `&' operator. CAST_P is true if this expression is the target of a
5422 cast.
5424 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5425 class member access expressions [expr.ref].
5427 Returns a representation of the expression. */
5429 static tree
5433 {
5440 /* Peek at the next token. */
5442 /* Some of the productions are determined by keywords. */
5445 {
5450 {
5451 tree type;
5452 tree expression;
5455 /* All of these can be handled in the same way from the point
5456 of view of parsing. Begin by consuming the token
5457 identifying the cast. */
5460 /* New types cannot be defined in the cast. */
5462 parser->type_definition_forbidden_message
5465 /* Look for the opening `<'. */
5467 /* Parse the type to which we are casting. */
5469 /* Look for the closing `>'. */
5471 /* Restore the old message. */
5474 /* And the expression which is being cast. */
5479 /* Only type conversions to integral or enumeration types
5480 can be used in constant-expressions. */
5486 {
5488 postfix_expression
5492 postfix_expression
5496 postfix_expression
5498 tf_warning_or_error);
5501 postfix_expression
5506 }
5507 }
5511 {
5512 tree type;
5516 /* Consume the `typeid' token. */
5518 /* Look for the `(' token. */
5520 /* Types cannot be defined in a `typeid' expression. */
5522 parser->type_definition_forbidden_message
5524 /* We can't be sure yet whether we're looking at a type-id or an
5525 expression. */
5527 /* Try a type-id first. */
5532 /* Look for the `)' token. Otherwise, we can't be sure that
5533 we're not looking at an expression: consider `typeid (int
5534 (3))', for example. */
5536 /* If all went well, simply lookup the type-id. */
5539 /* Otherwise, fall back to the expression variant. */
5540 else
5541 {
5542 tree expression;
5544 /* Look for an expression. */
5546 /* Compute its typeid. */
5548 /* Look for the `)' token. */
5550 }
5551 /* Restore the saved message. */
5553 /* `typeid' may not appear in an integral constant expression. */
5556 }
5560 {
5561 tree type;
5562 /* The syntax permitted here is the same permitted for an
5563 elaborated-type-specifier. */
5568 }
5572 {
5575 tree p;
5592 else
5593 {
5597 }
5599 }
5602 {
5603 tree type;
5605 /* If the next thing is a simple-type-specifier, we may be
5606 looking at a functional cast. We could also be looking at
5607 an id-expression. So, we try the functional cast, and if
5608 that doesn't work we fall back to the primary-expression. */
5610 /* Look for the simple-type-specifier. */
5613 CP_PARSER_FLAGS_NONE);
5614 /* Parse the cast itself. */
5616 postfix_expression
5618 /* If that worked, we're done. */
5622 /* If the functional-cast didn't work out, try a
5623 compound-literal. */
5626 {
5631 /* Consume the `('. */
5633 /* Parse the type. */
5638 /* Look for the `)'. */
5640 /* Look for the `{'. */
5642 /* If things aren't going well, there's no need to
5643 keep going. */
5645 {
5647 /* Parse the initializer-list. */
5648 initializer_list
5650 /* Allow a trailing `,'. */
5653 /* Look for the final `}'. */
5655 }
5656 /* If that worked, we're definitely looking at a
5657 compound-literal expression. */
5659 {
5660 /* Warn the user that a compound literal is not
5661 allowed in standard C++. */
5663 /* For simplicity, we disallow compound literals in
5664 constant-expressions. We could
5665 allow compound literals of integer type, whose
5666 initializer was a constant, in constant
5667 expressions. Permitting that usage, as a further
5668 extension, would not change the meaning of any
5669 currently accepted programs. (Of course, as
5670 compound literals are not part of ISO C++, the
5671 standard has nothing to say.) */
5673 NIC_NCC))
5674 {
5677 }
5678 /* Form the representation of the compound-literal. */
5679 postfix_expression
5680 = (finish_compound_literal
5682 initializer_list),
5683 tf_warning_or_error));
5685 }
5686 }
5688 /* It must be a primary-expression. */
5689 postfix_expression
5692 decltype_p,
5694 }
5696 }
5698 /* Note that we don't need to worry about calling build_cplus_new on a
5699 class-valued CALL_EXPR in decltype when it isn't the end of the
5700 postfix-expression; unary_complex_lvalue will take care of that for
5701 all these cases. */
5703 /* Keep looping until the postfix-expression is complete. */
5705 {
5709 /* It is not a Koenig lookup function call. */
5710 postfix_expression
5713 /* Peek at the next token. */
5717 {
5720 {
5722 "two consecutive %<[%> shall "
5725 }
5726 postfix_expression
5728 postfix_expression,
5735 /* postfix-expression ( expression-list [opt] ) */
5736 {
5749 is_builtin_constant_p
5752 {
5753 /* The whole point of __builtin_constant_p is to allow
5754 non-constant expressions to appear as arguments. */
5755 saved_integral_constant_expression_p
5757 saved_non_integral_constant_expression_p
5760 }
5761 args = (cp_parser_parenthesized_expression_list
5766 {
5767 parser->integral_constant_expression_p
5769 parser->non_integral_constant_expression_p
5771 }
5774 {
5777 }
5779 /* Function calls are not permitted in
5780 constant-expressions. */
5783 NIC_FUNC_CALL))
5784 {
5788 }
5793 {
5795 {
5797 {
5800 postfix_expression
5803 complain);
5804 }
5805 else
5806 postfix_expression
5808 }
5809 /* We do not perform argument-dependent lookup if
5810 normal lookup finds a non-function, in accordance
5811 with the expected resolution of DR 218. */
5814 {
5818 /* Do not do argument dependent lookup if regular
5819 lookup finds a member function or a block-scope
5820 function declaration. [basic.lookup.argdep]/3 */
5823 {
5826 postfix_expression
5829 complain);
5830 }
5831 }
5832 }
5835 {
5845 {
5846 postfix_expression
5850 }
5853 {
5854 postfix_expression
5855 = (build_new_method_call
5861 complain));
5862 }
5863 else
5864 postfix_expression
5868 complain);
5869 }
5873 postfix_expression = (build_offset_ref_call_from_tree
5875 complain));
5877 /* A call to a static class member, or a namespace-scope
5878 function. */
5879 postfix_expression
5882 koenig_p,
5883 complain);
5884 else
5885 /* All other function calls. */
5886 postfix_expression
5889 koenig_p,
5890 complain);
5892 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5896 }
5901 /* postfix-expression . template [opt] id-expression
5902 postfix-expression . pseudo-destructor-name
5903 postfix-expression -> template [opt] id-expression
5904 postfix-expression -> pseudo-destructor-name */
5906 /* Consume the `.' or `->' operator. */
5909 postfix_expression
5911 postfix_expression,
5919 /* postfix-expression ++ */
5920 /* Consume the `++' token. */
5922 /* Generate a representation for the complete expression. */
5923 postfix_expression
5925 POSTINCREMENT_EXPR);
5926 /* Increments may not appear in constant-expressions. */
5934 /* postfix-expression -- */
5935 /* Consume the `--' token. */
5937 /* Generate a representation for the complete expression. */
5938 postfix_expression
5940 POSTDECREMENT_EXPR);
5941 /* Decrements may not appear in constant-expressions. */
5953 else
5955 }
5956 }
5958 /* We should never get here. */
5961 }
5963 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5964 by cp_parser_builtin_offsetof. We're looking for
5966 postfix-expression [ expression ]
5967 postfix-expression [ braced-init-list ] (C++11)
5969 FOR_OFFSETOF is set if we're being called in that context, which
5970 changes how we deal with integer constant expressions. */
5972 static tree
5974 tree postfix_expression,
5976 {
5977 tree index;
5980 /* Consume the `[' token. */
5983 /* Parse the index expression. */
5984 /* ??? For offsetof, there is a question of what to allow here. If
5985 offsetof is not being used in an integral constant expression context,
5986 then we *could* get the right answer by computing the value at runtime.
5987 If we are in an integral constant expression context, then we might
5988 could accept any constant expression; hard to say without analysis.
5989 Rather than open the barn door too wide right away, allow only integer
5990 constant expressions here. */
5993 else
5994 {
5996 {
6000 }
6001 else
6003 }
6005 /* Look for the closing `]'. */
6008 /* Build the ARRAY_REF. */
6011 /* When not doing offsetof, array references are not permitted in
6012 constant-expressions. */
6018 }
6020 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6021 by cp_parser_builtin_offsetof. We're looking for
6023 postfix-expression . template [opt] id-expression
6024 postfix-expression . pseudo-destructor-name
6025 postfix-expression -> template [opt] id-expression
6026 postfix-expression -> pseudo-destructor-name
6028 FOR_OFFSETOF is set if we're being called in that context. That sorta
6029 limits what of the above we'll actually accept, but nevermind.
6030 TOKEN_TYPE is the "." or "->" token, which will already have been
6031 removed from the stream. */
6033 static tree
6036 tree postfix_expression,
6038 location_t location)
6039 {
6040 tree name;
6045 /* If this is a `->' operator, dereference the pointer. */
6048 tf_warning_or_error);
6049 /* Check to see whether or not the expression is type-dependent. */
6051 /* The identifier following the `->' or `.' is not qualified. */
6057 /* Enter the scope corresponding to the type of the object
6058 given by the POSTFIX_EXPRESSION. */
6060 {
6062 /* According to the standard, no expression should ever have
6063 reference type. Unfortunately, we do not currently match
6064 the standard in this respect in that our internal representation
6065 of an expression may have reference type even when the standard
6066 says it does not. Therefore, we have to manually obtain the
6067 underlying type here. */
6069 /* The type of the POSTFIX_EXPRESSION must be complete. */
6071 {
6073 postfix_expression);
6075 }
6076 /* Unlike the object expression in other contexts, *this is not
6077 required to be of complete type for purposes of class member
6078 access (5.2.5) outside the member function body. */
6082 /* Let the name lookup machinery know that we are processing a
6083 class member access expression. */
6085 /* If something went wrong, we want to be able to discern that case,
6086 as opposed to the case where there was no SCOPE due to the type
6087 of expression being dependent. */
6090 /* If the SCOPE was erroneous, make the various semantic analysis
6091 functions exit quickly -- and without issuing additional error
6092 messages. */
6095 }
6097 /* Assume this expression is not a pseudo-destructor access. */
6100 /* If the SCOPE is a scalar type, then, if this is a valid program,
6101 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6102 is type dependent, it can be pseudo-destructor-name or something else.
6103 Try to parse it as pseudo-destructor-name first. */
6105 {
6106 tree s;
6107 tree type;
6110 /* Parse the pseudo-destructor-name. */
6119 {
6121 postfix_expression
6124 }
6125 }
6128 {
6129 /* If the SCOPE is not a scalar type, we are looking at an
6130 ordinary class member access expression, rather than a
6131 pseudo-destructor-name. */
6134 /* Parse the id-expression. */
6135 name = (cp_parser_id_expression
6142 /* In general, build a SCOPE_REF if the member name is qualified.
6143 However, if the name was not dependent and has already been
6144 resolved; there is no need to build the SCOPE_REF. For example;
6146 struct X { void f(); };
6147 template <typename T> void f(T* t) { t->X::f(); }
6149 Even though "t" is dependent, "X::f" is not and has been resolved
6150 to a BASELINK; there is no need to include scope information. */
6152 /* But we do need to remember that there was an explicit scope for
6153 virtual function calls. */
6157 /* If the name is a template-id that names a type, we will get a
6158 TYPE_DECL here. That is invalid code. */
6160 {
6163 }
6164 else
6165 {
6167 {
6169 {
6173 }
6174 else
6177 name,
6178 template_p);
6182 }
6184 adjust_result_of_qualified_name_lookup
6186 postfix_expression
6188 template_p,
6189 tf_warning_or_error);
6190 }
6191 }
6193 /* We no longer need to look up names in the scope of the object on
6194 the left-hand side of the `.' or `->' operator. */
6197 /* Outside of offsetof, these operators may not appear in
6198 constant-expressions. */
6200 && (cp_parser_non_integral_constant_expression
6205 }
6207 /* Parse a parenthesized expression-list.
6209 expression-list:
6210 assignment-expression
6211 expression-list, assignment-expression
6213 attribute-list:
6214 expression-list
6215 identifier
6216 identifier, expression-list
6218 CAST_P is true if this expression is the target of a cast.
6220 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6221 argument pack.
6223 Returns a vector of trees. Each element is a representation of an
6224 assignment-expression. NULL is returned if the ( and or ) are
6225 missing. An empty, but allocated, vector is returned on no
6226 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6227 if we are parsing an attribute list for an attribute that wants a
6228 plain identifier argument, normal_attr for an attribute that wants
6229 an expression, or non_attr if we aren't parsing an attribute list. If
6230 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6231 not all of the expressions in the list were constant. */
6239 {
6245 /* Assume all the expressions will be constant. */
6254 /* Within a parenthesized expression, a `>' token is always
6255 the greater-than operator. */
6256 saved_greater_than_is_operator_p
6260 /* Consume expressions until there are no more. */
6263 {
6264 tree expr;
6266 /* At the beginning of attribute lists, check to see if the
6267 next token is an identifier. */
6270 {
6273 /* Consume the identifier. */
6275 /* Save the identifier. */
6277 }
6278 else
6279 {
6282 /* Parse the next assignment-expression. */
6284 {
6285 /* A braced-init-list. */
6290 }
6292 {
6293 expr = (cp_parser_constant_expression
6298 }
6299 else
6305 /* If we have an ellipsis, then this is an expression
6306 expansion. */
6309 {
6310 /* Consume the `...'. */
6313 /* Build the argument pack. */
6315 }
6317 /* Add it to the list. We add error_mark_node
6318 expressions to the list, so that we can still tell if
6319 the correct form for a parenthesized expression-list
6320 is found. That gives better errors. */
6325 }
6327 /* After the first item, attribute lists look the same as
6328 expression lists. */
6331 get_comma:;
6332 /* If the next token isn't a `,', then we are done. */
6336 /* Otherwise, consume the `,' and keep going. */
6338 }
6341 {
6344 skip_comma:;
6345 /* We try and resync to an unnested comma, as that will give the
6346 user better diagnostics. */
6354 {
6355 parser->greater_than_is_operator_p
6358 }
6359 }
6361 parser->greater_than_is_operator_p
6368 }
6370 /* Parse a pseudo-destructor-name.
6372 pseudo-destructor-name:
6373 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6374 :: [opt] nested-name-specifier template template-id :: ~ type-name
6375 :: [opt] nested-name-specifier [opt] ~ type-name
6377 If either of the first two productions is used, sets *SCOPE to the
6378 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6379 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6380 or ERROR_MARK_NODE if the parse fails. */
6382 static void
6386 {
6389 /* Assume that things will not work out. */
6392 /* Look for the optional `::' operator. */
6394 /* Look for the optional nested-name-specifier. */
6395 nested_name_specifier_p
6402 /* Now, if we saw a nested-name-specifier, we might be doing the
6403 second production. */
6406 {
6407 /* Consume the `template' keyword. */
6409 /* Parse the template-id. */
6413 class_type,
6415 /* Look for the `::' token. */
6417 }
6418 /* If the next token is not a `~', then there might be some
6419 additional qualification. */
6421 {
6422 /* At this point, we're looking for "type-name :: ~". The type-name
6423 must not be a class-name, since this is a pseudo-destructor. So,
6424 it must be either an enum-name, or a typedef-name -- both of which
6425 are just identifiers. So, we peek ahead to check that the "::"
6426 and "~" tokens are present; if they are not, then we can avoid
6427 calling type_name. */
6431 {
6434 }
6436 /* Look for the type-name. */
6441 /* Look for the `::' token. */
6443 }
6444 else
6447 /* Look for the `~'. */
6450 /* Once we see the ~, this has to be a pseudo-destructor. */
6454 /* Look for the type-name again. We are not responsible for
6455 checking that it matches the first type-name. */
6457 }
6459 /* Parse a unary-expression.
6461 unary-expression:
6462 postfix-expression
6463 ++ cast-expression
6464 -- cast-expression
6465 unary-operator cast-expression
6466 sizeof unary-expression
6467 sizeof ( type-id )
6468 alignof ( type-id ) [C++0x]
6469 new-expression
6470 delete-expression
6472 GNU Extensions:
6474 unary-expression:
6475 __extension__ cast-expression
6476 __alignof__ unary-expression
6477 __alignof__ ( type-id )
6478 alignof unary-expression [C++0x]
6479 __real__ cast-expression
6480 __imag__ cast-expression
6481 && identifier
6483 ADDRESS_P is true iff the unary-expression is appearing as the
6484 operand of the `&' operator. CAST_P is true if this expression is
6485 the target of a cast.
6487 Returns a representation of the expression. */
6489 static tree
6492 {
6496 /* Peek at the next token. */
6498 /* Some keywords give away the kind of expression. */
6500 {
6504 {
6507 {
6510 location_t first_loc;
6513 /* Consume the token. */
6516 /* Parse the operand. */
6521 else
6522 {
6523 /* ISO C++ defines alignof only with types, not with
6524 expressions. So pedwarn if alignof is used with a non-
6525 type expression. However, __alignof__ is ok. */
6528 "ISO C++ does not allow %<alignof%> "
6532 }
6533 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6534 SIZEOF_EXPR with the original operand. */
6536 {
6538 {
6540 {
6543 error_mark_node));
6545 }
6546 else
6550 }
6552 }
6554 }
6563 {
6564 /* The saved value of the PEDANTIC flag. */
6566 tree expr;
6568 /* Save away the PEDANTIC flag. */
6570 /* Parse the cast-expression. */
6572 /* Restore the PEDANTIC flag. */
6576 }
6580 {
6581 tree expression;
6583 /* Consume the `__real__' or `__imag__' token. */
6585 /* Parse the cast-expression. */
6587 /* Create the complete representation. */
6591 expression,
6592 tf_warning_or_error);
6593 }
6601 {
6602 tree expr;
6612 parser->type_definition_forbidden_message
6615 saved_integral_constant_expression_p
6617 saved_non_integral_constant_expression_p
6621 saved_greater_than_is_operator_p
6631 parser->greater_than_is_operator_p
6634 parser->integral_constant_expression_p
6636 parser->non_integral_constant_expression_p
6643 }
6647 }
6648 }
6650 /* Look for the `:: new' and `:: delete', which also signal the
6651 beginning of a new-expression, or delete-expression,
6652 respectively. If the next token is `::', then it might be one of
6653 these. */
6655 {
6658 /* See if the token after the `::' is one of the keywords in
6659 which we're interested. */
6661 /* If it's `new', we have a new-expression. */
6664 /* Similarly, for `delete'. */
6667 }
6669 /* Look for a unary operator. */
6671 /* The `++' and `--' operators can be handled similarly, even though
6672 they are not technically unary-operators in the grammar. */
6674 {
6679 /* Handle the GNU address-of-label extension. */
6682 {
6683 tree identifier;
6684 tree expression;
6687 /* Consume the '&&' token. */
6689 /* Look for the identifier. */
6691 /* Create an expression representing the address. */
6694 NIC_ADDR_LABEL))
6697 }
6698 }
6700 {
6701 tree cast_expression;
6706 /* Consume the operator token. */
6708 /* Parse the cast-expression. */
6709 cast_expression
6714 pidk);
6715 /* Now, build an appropriate representation. */
6717 {
6721 RO_UNARY_STAR,
6722 tf_warning_or_error);
6727 /* Fall through. */
6730 cast_expression,
6731 tf_warning_or_error);
6738 /* Fall through. */
6743 cast_expression);
6748 }
6752 non_constant_p))
6756 }
6760 decltype_p,
6761 pidk);
6762 }
6767 {
6770 }
6772 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6773 unary-operator, the corresponding tree code is returned. */
6775 static enum tree_code
6777 {
6779 {
6800 }
6801 }
6803 /* Parse a new-expression.
6805 new-expression:
6806 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6807 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6809 Returns a representation of the expression. */
6811 static tree
6813 {
6816 tree type;
6819 tree ret;
6821 /* Look for the optional `::' operator. */
6822 global_scope_p
6826 /* Look for the `new' operator. */
6828 /* There's no easy way to tell a new-placement from the
6829 `( type-id )' construct. */
6831 /* Look for a new-placement. */
6833 /* If that didn't work out, there's no new-placement. */
6835 {
6839 }
6841 /* If the next token is a `(', then we have a parenthesized
6842 type-id. */
6844 {
6848 /* Consume the `('. */
6851 /* Parse the type-id. */
6852 parser->type_definition_forbidden_message
6857 /* Look for the closing `)'. */
6860 /* There should not be a direct-new-declarator in this production,
6861 but GCC used to allowed this, so we check and emit a sensible error
6862 message for this case. */
6864 {
6870 }
6871 }
6872 /* Otherwise, there must be a new-type-id. */
6873 else
6876 /* If the next token is a `(' or '{', then we have a new-initializer. */
6880 else
6883 /* A new-expression may not appear in an integral constant
6884 expression. */
6887 else
6888 {
6889 /* Create a representation of the new-expression. */
6891 tf_warning_or_error);
6892 }
6900 }
6902 /* Parse a new-placement.
6904 new-placement:
6905 ( expression-list )
6907 Returns the same representation as for an expression-list. */
6911 {
6914 /* Parse the expression-list. */
6915 expression_list = (cp_parser_parenthesized_expression_list
6921 }
6923 /* Parse a new-type-id.
6925 new-type-id:
6926 type-specifier-seq new-declarator [opt]
6928 Returns the TYPE allocated. If the new-type-id indicates an array
6929 type, *NELTS is set to the number of elements in the last array
6930 bound; the TYPE will not include the last array bound. */
6932 static tree
6934 {
6935 cp_decl_specifier_seq type_specifier_seq;
6941 /* The type-specifier sequence must not contain type definitions.
6942 (It cannot contain declarations of new types either, but if they
6943 are not definitions we will catch that because they are not
6944 complete.) */
6946 parser->type_definition_forbidden_message
6948 /* Parse the type-specifier-seq. */
6952 /* Restore the old message. */
6958 /* Parse the new-declarator. */
6961 /* Determine the number of elements in the last array dimension, if
6962 any. */
6964 /* Skip down to the last array dimension. */
6969 {
6972 }
6977 {
6980 }
6983 {
6990 else
6992 }
6995 }
6997 /* Parse an (optional) new-declarator.
6999 new-declarator:
7000 ptr-operator new-declarator [opt]
7001 direct-new-declarator
7003 Returns the declarator. */
7007 {
7010 cp_cv_quals cv_quals;
7012 /* We don't know if there's a ptr-operator next, or not. */
7014 /* Look for a ptr-operator. */
7016 /* If that worked, look for more new-declarators. */
7018 {
7021 /* Parse another optional declarator. */
7024 declarator = cp_parser_make_indirect_declarator
7028 }
7030 /* If the next token is a `[', there is a direct-new-declarator. */
7035 }
7037 /* Parse a direct-new-declarator.
7039 direct-new-declarator:
7040 [ expression ]
7041 direct-new-declarator [constant-expression]
7043 */
7047 {
7051 {
7052 tree expression;
7055 /* Look for the opening `['. */
7060 /* The standard requires that the expression have integral
7061 type. DR 74 adds enumeration types. We believe that the
7062 real intent is that these expressions be handled like the
7063 expression in a `switch' condition, which also allows
7064 classes with a single conversion to integral or
7065 enumeration type. */
7067 {
7068 expression
7070 expression,
7073 {
7075 "expression in new-declarator must have integral "
7078 }
7079 }
7081 /* Look for the closing `]'. */
7084 /* Add this bound to the declarator. */
7087 /* If the next token is not a `[', then there are no more
7088 bounds. */
7091 }
7094 }
7096 /* Parse a new-initializer.
7098 new-initializer:
7099 ( expression-list [opt] )
7100 braced-init-list
7102 Returns a representation of the expression-list. */
7106 {
7110 {
7111 tree t;
7117 }
7118 else
7119 expression_list = (cp_parser_parenthesized_expression_list
7125 }
7127 /* Parse a delete-expression.
7129 delete-expression:
7130 :: [opt] delete cast-expression
7131 :: [opt] delete [ ] cast-expression
7133 Returns a representation of the expression. */
7135 static tree
7137 {
7140 tree expression;
7142 /* Look for the optional `::' operator. */
7143 global_scope_p
7147 /* Look for the `delete' keyword. */
7149 /* See if the array syntax is in use. */
7151 {
7152 /* Consume the `[' token. */
7154 /* Look for the `]' token. */
7156 /* Remember that this is the `[]' construct. */
7158 }
7159 else
7162 /* Parse the cast-expression. */
7165 /* A delete-expression may not appear in an integral constant
7166 expression. */
7171 tf_warning_or_error);
7172 }
7174 /* Returns true if TOKEN may start a cast-expression and false
7175 otherwise. */
7177 static bool
7179 {
7182 {
7222 /* In ((type ()) () the last () isn't a valid cast-expression,
7223 so the whole must be parsed as postfix-expression. */
7227 /* '[' may start a primary-expression in obj-c++. */
7233 }
7234 }
7236 /* Parse a cast-expression.
7238 cast-expression:
7239 unary-expression
7240 ( type-id ) cast-expression
7242 ADDRESS_P is true iff the unary-expression is appearing as the
7243 operand of the `&' operator. CAST_P is true if this expression is
7244 the target of a cast.
7246 Returns a representation of the expression. */
7248 static tree
7251 {
7252 /* If it's a `(', then we might be looking at a cast. */
7254 {
7260 /* There's no way to know yet whether or not this is a cast.
7261 For example, `(int (3))' is a unary-expression, while `(int)
7262 3' is a cast. So, we resort to parsing tentatively. */
7264 /* Types may not be defined in a cast. */
7266 parser->type_definition_forbidden_message
7268 /* Consume the `('. */
7270 /* A very tricky bit is that `(struct S) { 3 }' is a
7271 compound-literal (which we permit in C++ as an extension).
7272 But, that construct is not a cast-expression -- it is a
7273 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7274 is legal; if the compound-literal were a cast-expression,
7275 you'd need an extra set of parentheses.) But, if we parse
7276 the type-id, and it happens to be a class-specifier, then we
7277 will commit to the parse at that point, because we cannot
7278 undo the action that is done when creating a new class. So,
7279 then we cannot back up and do a postfix-expression.
7281 Therefore, we scan ahead to the closing `)', and check to see
7282 if the token after the `)' is a `{'. If so, we are not
7283 looking at a cast-expression.
7285 Save tokens so that we can put them back. */
7287 /* Skip tokens until the next token is a closing parenthesis.
7288 If we find the closing `)', and the next token is a `{', then
7289 we are looking at a compound-literal. */
7290 compound_literal_p
7294 /* Roll back the tokens we skipped. */
7296 /* If we were looking at a compound-literal, simulate an error
7297 so that the call to cp_parser_parse_definitely below will
7298 fail. */
7301 else
7302 {
7305 /* Look for the type-id. */
7307 /* Look for the closing `)'. */
7310 }
7312 /* Restore the saved message. */
7315 /* At this point this can only be either a cast or a
7316 parenthesized ctor such as `(T ())' that looks like a cast to
7317 function returning T. */
7320 {
7326 pidk);
7328 /* Warn about old-style casts, if so requested. */
7330 && !in_system_header
7335 /* Only type conversions to integral or enumeration types
7336 can be used in constant-expressions. */
7339 NIC_CAST))
7342 /* Perform the cast. */
7345 }
7346 else
7348 }
7350 /* If we get here, then it's not a cast, so it must be a
7351 unary-expression. */
7354 }
7356 /* Parse a binary expression of the general form:
7358 pm-expression:
7359 cast-expression
7360 pm-expression .* cast-expression
7361 pm-expression ->* cast-expression
7363 multiplicative-expression:
7364 pm-expression
7365 multiplicative-expression * pm-expression
7366 multiplicative-expression / pm-expression
7367 multiplicative-expression % pm-expression
7369 additive-expression:
7370 multiplicative-expression
7371 additive-expression + multiplicative-expression
7372 additive-expression - multiplicative-expression
7374 shift-expression:
7375 additive-expression
7376 shift-expression << additive-expression
7377 shift-expression >> additive-expression
7379 relational-expression:
7380 shift-expression
7381 relational-expression < shift-expression
7382 relational-expression > shift-expression
7383 relational-expression <= shift-expression
7384 relational-expression >= shift-expression
7386 GNU Extension:
7388 relational-expression:
7389 relational-expression <? shift-expression
7390 relational-expression >? shift-expression
7392 equality-expression:
7393 relational-expression
7394 equality-expression == relational-expression
7395 equality-expression != relational-expression
7397 and-expression:
7398 equality-expression
7399 and-expression & equality-expression
7401 exclusive-or-expression:
7402 and-expression
7403 exclusive-or-expression ^ and-expression
7405 inclusive-or-expression:
7406 exclusive-or-expression
7407 inclusive-or-expression | exclusive-or-expression
7409 logical-and-expression:
7410 inclusive-or-expression
7411 logical-and-expression && inclusive-or-expression
7413 logical-or-expression:
7414 logical-and-expression
7415 logical-or-expression || logical-and-expression
7417 All these are implemented with a single function like:
7419 binary-expression:
7420 simple-cast-expression
7421 binary-expression <token> binary-expression
7423 CAST_P is true if this expression is the target of a cast.
7425 The binops_by_token map is used to get the tree codes for each <token> type.
7426 binary-expressions are associated according to a precedence table. */
7428 #define TOKEN_PRECEDENCE(token) \
7429 (((token->type == CPP_GREATER \
7430 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7431 && !parser->greater_than_is_operator_p) \
7432 ? PREC_NOT_OPERATOR \
7433 : binops_by_token[token->type].prec)
7435 static tree
7441 {
7442 cp_parser_expression_stack stack;
7444 cp_parser_expression_stack_entry current;
7445 tree rhs;
7449 tree overload;
7451 /* Parse the first expression. */
7461 {
7462 /* Get an operator token. */
7468 {
7470 "%<>>%> operator is treated"
7474 }
7478 /* Popping an entry off the stack means we completed a subexpression:
7479 - either we found a token which is not an operator (`>' where it is not
7480 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7481 will happen repeatedly;
7482 - or, we found an operator which has lower priority. This is the case
7483 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7484 parsing `3 * 4'. */
7486 {
7489 else
7491 }
7493 get_rhs:
7497 /* We used the operator token. */
7500 /* For "false && x" or "true || x", x will never be executed;
7501 disable warnings while evaluating it. */
7507 /* Extract another operand. It may be the RHS of this expression
7508 or the LHS of a new, higher priority expression. */
7512 /* Get another operator token. Look up its precedence to avoid
7513 building a useless (immediately popped) stack entry for common
7514 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7518 {
7519 /* ... and prepare to parse the RHS of the new, higher priority
7520 expression. Since precedence levels on the stack are
7521 monotonically increasing, we do not have to care about
7522 stack overflows. */
7531 pop:
7533 /* If the stack is not empty, we have parsed into LHS the right side
7534 (`4' in the example above) of an expression we had suspended.
7535 We can use the information on the stack to recover the LHS (`3')
7536 from the stack together with the tree code (`MULT_EXPR'), and
7537 the precedence of the higher level subexpression
7538 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7539 which will be used to actually build the additive expression. */
7544 }
7546 /* Undo the disabling of warnings done above. */
7553 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7554 ERROR_MARK for everything that is not a binary expression.
7555 This makes warn_about_parentheses miss some warnings that
7556 involve unary operators. For unary expressions we should
7557 pass the correct tree_code unless the unary expression was
7558 surrounded by parentheses.
7559 */
7566 else
7570 tf_warning_or_error);
7575 /* If the binary operator required the use of an overloaded operator,
7576 then this expression cannot be an integral constant-expression.
7577 An overloaded operator can be used even if both operands are
7578 otherwise permissible in an integral constant-expression if at
7579 least one of the operands is of enumeration type. */
7583 NIC_OVERLOADED))
7585 }
7588 }
7590 static tree
7595 {
7598 }
7600 /* Parse the `? expression : assignment-expression' part of a
7601 conditional-expression. The LOGICAL_OR_EXPR is the
7602 logical-or-expression that started the conditional-expression.
7603 Returns a representation of the entire conditional-expression.
7605 This routine is used by cp_parser_assignment_expression.
7607 ? expression : assignment-expression
7609 GNU Extensions:
7611 ? : assignment-expression */
7613 static tree
7615 {
7616 tree expr;
7617 tree assignment_expr;
7621 /* Consume the `?' token. */
7626 {
7629 /* Implicit true clause. */
7633 }
7634 else
7635 {
7638 /* Parse the expression. */
7641 c_inhibit_evaluation_warnings +=
7645 }
7647 /* The next token should be a `:'. */
7649 /* Parse the assignment-expression. */
7653 /* Build the conditional-expression. */
7655 expr,
7656 assignment_expr,
7657 tf_warning_or_error);
7658 }
7660 /* Parse an assignment-expression.
7662 assignment-expression:
7663 conditional-expression
7664 logical-or-expression assignment-operator assignment_expression
7665 throw-expression
7667 CAST_P is true if this expression is the target of a cast.
7668 DECLTYPE_P is true if this expression is the operand of decltype.
7670 Returns a representation for the expression. */
7672 static tree
7675 {
7676 tree expr;
7678 /* If the next token is the `throw' keyword, then we're looking at
7679 a throw-expression. */
7682 /* Otherwise, it must be that we are looking at a
7683 logical-or-expression. */
7684 else
7685 {
7686 /* Parse the binary expressions (logical-or-expression). */
7688 decltype_p,
7690 /* If the next token is a `?' then we're actually looking at a
7691 conditional-expression. */
7694 else
7695 {
7698 /* If it's an assignment-operator, we're using the second
7699 production. */
7700 enum tree_code assignment_operator
7703 {
7705 location_t saved_input_location;
7707 /* Parse the right-hand side of the assignment. */
7713 /* An assignment may not appear in a
7714 constant-expression. */
7716 NIC_ASSIGNMENT))
7718 /* Build the assignment expression. Its default
7719 location is the location of the '=' token. */
7723 assignment_operator,
7724 rhs,
7725 tf_warning_or_error);
7727 }
7728 }
7729 }
7732 }
7734 static tree
7737 {
7740 }
7742 /* Parse an (optional) assignment-operator.
7744 assignment-operator: one of
7745 = *= /= %= += -= >>= <<= &= ^= |=
7747 GNU Extension:
7749 assignment-operator: one of
7750 <?= >?=
7752 If the next token is an assignment operator, the corresponding tree
7753 code is returned, and the token is consumed. For example, for
7754 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7755 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7756 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7757 operator, ERROR_MARK is returned. */
7759 static enum tree_code
7761 {
7765 /* Peek at the next token. */
7769 {
7815 /* Nothing else is an assignment operator. */
7817 }
7819 /* If it was an assignment operator, consume it. */
7824 }
7826 /* Parse an expression.
7828 expression:
7829 assignment-expression
7830 expression , assignment-expression
7832 CAST_P is true if this expression is the target of a cast.
7833 DECLTYPE_P is true if this expression is the immediate operand of decltype,
7834 except possibly parenthesized or on the RHS of a comma (N3276).
7836 Returns a representation of the expression. */
7838 static tree
7841 {
7846 {
7847 tree assignment_expression;
7849 /* Parse the next assignment-expression. */
7850 assignment_expression
7853 /* We don't create a temporary for a call that is the immediate operand
7854 of decltype or on the RHS of a comma. But when we see a comma, we
7855 need to create a temporary for a call on the LHS. */
7860 assignment_expression
7864 /* If this is the first assignment-expression, we can just
7865 save it away. */
7868 else
7870 assignment_expression,
7871 tf_warning_or_error);
7872 /* If the next token is not a comma, then we are done with the
7873 expression. */
7876 /* Consume the `,'. */
7879 /* A comma operator cannot appear in a constant-expression. */
7882 }
7885 }
7889 {
7891 }
7893 /* Parse a constant-expression.
7895 constant-expression:
7896 conditional-expression
7898 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7899 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7900 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7901 is false, NON_CONSTANT_P should be NULL. */
7903 static tree
7907 {
7911 tree expression;
7913 /* It might seem that we could simply parse the
7914 conditional-expression, and then check to see if it were
7915 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7916 one that the compiler can figure out is constant, possibly after
7917 doing some simplifications or optimizations. The standard has a
7918 precise definition of constant-expression, and we must honor
7919 that, even though it is somewhat more restrictive.
7921 For example:
7923 int i[(2, 3)];
7925 is not a legal declaration, because `(2, 3)' is not a
7926 constant-expression. The `,' operator is forbidden in a
7927 constant-expression. However, GCC's constant-folding machinery
7928 will fold this operation to an INTEGER_CST for `3'. */
7930 /* Save the old settings. */
7932 saved_allow_non_integral_constant_expression_p
7935 /* We are now parsing a constant-expression. */
7937 parser->allow_non_integral_constant_expression_p
7940 /* Although the grammar says "conditional-expression", we parse an
7941 "assignment-expression", which also permits "throw-expression"
7942 and the use of assignment operators. In the case that
7943 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7944 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7945 actually essential that we look for an assignment-expression.
7946 For example, cp_parser_initializer_clauses uses this function to
7947 determine whether a particular assignment-expression is in fact
7948 constant. */
7950 /* Restore the old settings. */
7951 parser->integral_constant_expression_p
7953 parser->allow_non_integral_constant_expression_p
7956 {
7957 /* Require an rvalue constant expression here; that's what our
7958 callers expect. Reference constant expressions are handled
7959 separately in e.g. cp_parser_template_argument. */
7964 }
7967 parser->non_integral_constant_expression_p
7971 }
7973 /* Parse __builtin_offsetof.
7975 offsetof-expression:
7976 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7978 offsetof-member-designator:
7979 id-expression
7980 | offsetof-member-designator "." id-expression
7981 | offsetof-member-designator "[" expression "]"
7982 | offsetof-member-designator "->" id-expression */
7984 static tree
7986 {
7989 cp_id_kind dummy;
7992 /* We're about to accept non-integral-constant things, but will
7993 definitely yield an integral constant expression. Save and
7994 restore these values around our local parsing. */
7998 /* Consume the "__builtin_offsetof" token. */
8000 /* Consume the opening `('. */
8002 /* Parse the type-id. */
8004 /* Look for the `,'. */
8008 /* Build the (type *)null that begins the traditional offsetof macro. */
8010 tf_warning_or_error);
8012 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8016 {
8019 {
8021 /* offsetof-member-designator "[" expression "]" */
8026 /* offsetof-member-designator "->" identifier */
8028 /* FALLTHRU */
8031 /* offsetof-member-designator "." identifier */
8039 /* Consume the ")" token. */
8044 /* Error. We know the following require will fail, but
8045 that gives the proper error message. */
8050 }
8051 }
8053 success:
8054 /* If we're processing a template, we can't finish the semantics yet.
8055 Otherwise we can fold the entire expression now. */
8058 else
8061 failure:
8066 }
8068 /* Parse a trait expression.
8070 Returns a representation of the expression, the underlying type
8071 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8073 static tree
8075 {
8076 cp_trait_kind kind;
8079 cp_decl_specifier_seq decl_specs;
8082 {
8159 }
8161 /* Consume the token. */
8171 /* Build a trivial decl-specifier-seq. */
8175 /* Call grokdeclarator to figure out what type this is. */
8180 {
8188 /* Build a trivial decl-specifier-seq. */
8192 /* Call grokdeclarator to figure out what type this is. */
8195 }
8199 /* Complete the trait expression, which may mean either processing
8200 the trait expr now or saving it for template instantiation. */
8202 {
8211 }
8212 }
8214 /* Lambdas that appear in variable initializer or default argument scope
8215 get that in their mangling, so we need to record it. We might as well
8216 use the count for function and namespace scopes as well. */
8220 {
8221 tree t;
8226 static void
8228 {
8229 tree_int ti;
8231 /* Once we're inside a function, we ignore other scopes and just push
8232 the function again so that popping works properly. */
8239 {
8240 /* Don't reset the count if we're still in the same function. */
8243 }
8244 }
8246 static void
8248 {
8251 }
8253 static void
8255 {
8258 {
8261 }
8263 }
8265 /* Parse a lambda expression.
8267 lambda-expression:
8268 lambda-introducer lambda-declarator [opt] compound-statement
8270 Returns a representation of the expression. */
8272 static tree
8274 {
8276 tree type;
8286 /* We may be in the middle of deferred access check. Disable
8287 it now. */
8298 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8301 /* Now that we've started the type, add the capture fields for any
8302 explicit captures. */
8305 {
8306 /* Inside the class, surrounding template-parameter-lists do not apply. */
8307 unsigned int saved_num_template_parameter_lists
8316 /* By virtue of defining a local class, a lambda expression has access to
8317 the private variables of enclosing classes. */
8326 /* The capture list was built up in reverse order; fix that now. */
8338 }
8342 /* This field is only used during parsing of the lambda. */
8345 /* This lambda shouldn't have any proxies left at this point. */
8347 /* And now that we're done, push proxies for an enclosing lambda. */
8352 else
8354 }
8356 /* Parse the beginning of a lambda expression.
8358 lambda-introducer:
8359 [ lambda-capture [opt] ]
8361 LAMBDA_EXPR is the current representation of the lambda expression. */
8363 static void
8365 {
8366 /* Need commas after the first capture. */
8369 /* Eat the leading `['. */
8372 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8380 {
8383 }
8386 {
8388 tree capture_id;
8389 tree capture_init_expr;
8393 enum capture_kind_type
8394 {
8395 BY_COPY,
8396 BY_REFERENCE
8397 };
8401 {
8404 }
8408 else
8411 /* Possibly capture `this'. */
8413 {
8423 explicit_init_p);
8425 }
8427 /* Remember whether we want to capture as a reference or not. */
8429 {
8432 }
8434 /* Get the identifier. */
8439 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8440 delimiters, but I modified this to stop on unnested ']' as well. It
8441 was already changed to stop on unnested '}', so the
8442 "closing_parenthesis" name is no more misleading with my change. */
8443 {
8449 }
8451 /* Find the initializer for this capture. */
8453 {
8454 /* An explicit expression exists. */
8457 "ISO C++ does not allow initializers "
8463 }
8464 else
8465 {
8468 /* Turn the identifier into an id-expression. */
8469 capture_init_expr
8470 = cp_parser_lookup_name
8472 capture_id,
8473 none_type,
8481 {
8484 }
8488 {
8491 capture_init_expr);
8494 }
8497 {
8500 capture_init_expr);
8503 }
8505 capture_init_expr
8506 = finish_id_expression
8508 capture_init_expr,
8520 }
8524 {
8529 capture_id);
8533 "capture of %qD redundant with by-reference capture "
8535 }
8538 capture_id,
8539 capture_init_expr,
8541 explicit_init_p);
8542 }
8545 }
8547 /* Parse the (optional) middle of a lambda expression.
8549 lambda-declarator:
8550 ( parameter-declaration-clause [opt] )
8551 attribute-specifier [opt]
8552 mutable [opt]
8553 exception-specification [opt]
8554 lambda-return-type-clause [opt]
8556 LAMBDA_EXPR is the current representation of the lambda expression. */
8558 static bool
8560 {
8561 /* 5.1.1.4 of the standard says:
8562 If a lambda-expression does not include a lambda-declarator, it is as if
8563 the lambda-declarator were ().
8564 This means an empty parameter list, no attributes, and no exception
8565 specification. */
8569 tree t;
8571 /* The lambda-declarator is optional, but must begin with an opening
8572 parenthesis if present. */
8574 {
8579 /* Parse parameters. */
8582 /* Default arguments shall not be specified in the
8583 parameter-declaration-clause of a lambda-declarator. */
8593 /* Parse optional `mutable' keyword. */
8595 {
8598 }
8600 /* Parse optional exception specification. */
8603 /* Parse optional trailing return type. */
8605 {
8609 }
8611 /* The function parameters must be in scope all the way until after the
8612 trailing-return-type in case of decltype. */
8617 }
8619 /* Create the function call operator.
8621 Messing with declarators like this is no uglier than building up the
8622 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8623 other code. */
8624 {
8625 cp_decl_specifier_seq return_type_specs;
8627 tree fco;
8634 else
8635 /* Maybe we will deduce the return type later. */
8641 sfk_none);
8646 VIRT_SPEC_UNSPECIFIED,
8647 REF_QUAL_NONE,
8648 exception_spec,
8653 declarator,
8654 attributes);
8656 {
8659 /* Give the object parameter a different name. */
8661 }
8668 }
8669 }
8671 /* Parse the body of a lambda expression, which is simply
8673 compound-statement
8675 but which requires special handling.
8676 LAMBDA_EXPR is the current representation of the lambda expression. */
8678 static void
8680 {
8685 else
8686 /* Still increment function_depth so that we don't GC in the
8687 middle of an expression. */
8689 /* Clear this in case we're in the middle of a default argument. */
8692 /* Finish the function call operator
8693 - class_specifier
8694 + late_parsing_for_member
8695 + function_definition_after_declarator
8696 + ctor_initializer_opt_and_function_body */
8697 {
8699 tree body;
8701 tree compound_stmt;
8702 tree cap;
8704 /* Let the front end know that we are going to be defining this
8705 function. */
8707 NULL_TREE,
8716 /* Push the proxies for any explicit captures. */
8723 /* 5.1.1.4 of the standard says:
8724 If a lambda-expression does not include a trailing-return-type, it
8725 is as if the trailing-return-type denotes the following type:
8726 * if the compound-statement is of the form
8727 { return attribute-specifier [opt] expression ; }
8728 the type of the returned expression after lvalue-to-rvalue
8729 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8730 (_conv.array_ 4.2), and function-to-pointer conversion
8731 (_conv.func_ 4.3);
8732 * otherwise, void. */
8734 /* In a lambda that has neither a lambda-return-type-clause
8735 nor a deducible form, errors should be reported for return statements
8736 in the body. Since we used void as the placeholder return type, parsing
8737 the body as usual will give such desired behavior. */
8741 {
8745 /* Parse tentatively in case there's more after the initial return
8746 statement. */
8757 {
8761 /* Will get error here if type not deduced yet. */
8765 }
8766 }
8769 {
8774 }
8778 out:
8782 /* Finish the function and generate code for it if necessary. */
8784 }
8789 else
8791 }
8793 /* Statements [gram.stmt.stmt] */
8795 /* Parse a statement.
8797 statement:
8798 labeled-statement
8799 expression-statement
8800 compound-statement
8801 selection-statement
8802 iteration-statement
8803 jump-statement
8804 declaration-statement
8805 try-block
8807 C++11:
8809 statement:
8810 labeled-statement
8811 attribute-specifier-seq (opt) expression-statement
8812 attribute-specifier-seq (opt) compound-statement
8813 attribute-specifier-seq (opt) selection-statement
8814 attribute-specifier-seq (opt) iteration-statement
8815 attribute-specifier-seq (opt) jump-statement
8816 declaration-statement
8817 attribute-specifier-seq (opt) try-block
8819 TM Extension:
8821 statement:
8822 atomic-statement
8824 IN_COMPOUND is true when the statement is nested inside a
8825 cp_parser_compound_statement; this matters for certain pragmas.
8827 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8828 is a (possibly labeled) if statement which is not enclosed in braces
8829 and has an else clause. This is used to implement -Wparentheses. */
8831 static void
8834 {
8839 restart:
8842 /* There is no statement yet. */
8848 /* In obj-c++, seing '[[' might be the either the beginning of
8849 c++11 attributes, or a nested objc-message-expression. So
8850 let's parse the c++11 attributes tentatively. */
8854 {
8857 }
8859 /* Peek at the next token. */
8861 /* Remember the location of the first token in the statement. */
8863 /* If this is a keyword, then that will often determine what kind of
8864 statement we have. */
8866 {
8870 {
8873 /* Looks like a labeled-statement with a case label.
8874 Parse the label, and then use tail recursion to parse
8875 the statement. */
8897 /* Objective-C++ exception-handling constructs. */
8911 /* This must be a namespace alias definition. */
8924 /* It might be a keyword like `int' that can start a
8925 declaration-statement. */
8927 }
8928 }
8930 {
8931 /* If the next token is a `:', then we are looking at a
8932 labeled-statement. */
8935 {
8936 /* Looks like a labeled-statement with an ordinary label.
8937 Parse the label, and then use tail recursion to parse
8938 the statement. */
8942 }
8943 }
8944 /* Anything that starts with a `{' must be a compound-statement. */
8947 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8948 a statement all its own. */
8950 {
8951 /* Only certain OpenMP pragmas are attached to statements, and thus
8952 are considered statements themselves. All others are not. In
8953 the context of a compound, accept the pragma as a "statement" and
8954 return so that we can check for a close brace. Otherwise we
8955 require a real statement and must go back and read one. */
8961 }
8963 {
8966 }
8968 /* Everything else must be a declaration-statement or an
8969 expression-statement. Try for the declaration-statement
8970 first, unless we are looking at a `;', in which case we know that
8971 we have an expression-statement. */
8973 {
8975 {
8977 {
8978 /* Attributes should be parsed as part of the the
8979 declaration, so let's un-parse them. */
8982 }
8985 /* Try to parse the declaration-statement. */
8987 /* If that worked, we're done. */
8990 }
8991 /* Look for an expression-statement instead. */
8993 }
8995 /* Set the line number for the statement. */
8999 /* Note that for now, we don't do anything with c++11 statements
9000 parsed at this level. */
9003 OPT_Wattributes,
9005 }
9007 /* Parse the label for a labeled-statement, i.e.
9009 identifier :
9010 case constant-expression :
9011 default :
9013 GNU Extension:
9014 case constant-expression ... constant-expression : statement
9016 When a label is parsed without errors, the label is added to the
9017 parse tree by the finish_* functions, so this function doesn't
9018 have to return the label. */
9020 static void
9022 {
9027 /* The next token should be an identifier. */
9031 {
9034 }
9038 {
9040 {
9044 /* Consume the `case' token. */
9046 /* Parse the constant-expression. */
9049 NULL);
9053 {
9054 /* Consume the `...' token. */
9056 expr_hi =
9059 NULL);
9060 /* We don't need to emit warnings here, as the common code
9061 will do this for us. */
9062 }
9063 else
9068 else
9071 expr);
9072 }
9076 /* Consume the `default' token. */
9081 else
9086 /* Anything else must be an ordinary label. */
9089 }
9091 /* Require the `:' token. */
9094 /* An ordinary label may optionally be followed by attributes.
9095 However, this is only permitted if the attributes are then
9096 followed by a semicolon. This is because, for backward
9097 compatibility, when parsing
9098 lab: __attribute__ ((unused)) int i;
9099 we want the attribute to attach to "i", not "lab". */
9102 {
9103 tree attrs;
9110 ;
9111 else
9113 }
9119 }
9121 /* Parse an expression-statement.
9123 expression-statement:
9124 expression [opt] ;
9126 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9127 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9128 indicates whether this expression-statement is part of an
9129 expression statement. */
9131 static tree
9133 {
9137 /* If the next token is a ';', then there is no expression
9138 statement. */
9142 /* Give a helpful message for "A<T>::type t;" and the like. */
9145 {
9152 {
9153 /* A::A a; */
9158 }
9159 }
9161 /* Consume the final `;'. */
9166 /* This is the final expression statement of a statement
9167 expression. */
9171 else
9175 }
9177 /* Parse a compound-statement.
9179 compound-statement:
9180 { statement-seq [opt] }
9182 GNU extension:
9184 compound-statement:
9185 { label-declaration-seq [opt] statement-seq [opt] }
9187 label-declaration-seq:
9188 label-declaration
9189 label-declaration-seq label-declaration
9191 Returns a tree representing the statement. */
9193 static tree
9196 {
9197 tree compound_stmt;
9199 /* Consume the `{'. */
9206 /* Begin the compound-statement. */
9208 /* If the next keyword is `__label__' we have a label declaration. */
9211 /* Parse an (optional) statement-seq. */
9213 /* Finish the compound-statement. */
9215 /* Consume the `}'. */
9219 }
9221 /* Parse an (optional) statement-seq.
9223 statement-seq:
9224 statement
9225 statement-seq [opt] statement */
9227 static void
9229 {
9230 /* Scan statements until there aren't any more. */
9232 {
9235 /* If we are looking at a `}', then we have run out of
9236 statements; the same is true if we have reached the end
9237 of file, or have stumbled upon a stray '@end'. */
9244 /* If we are in a compound statement and find 'else' then
9245 something went wrong. */
9247 {
9250 else
9251 {
9254 }
9255 }
9257 /* Parse the statement. */
9259 }
9260 }
9262 /* Parse a selection-statement.
9264 selection-statement:
9265 if ( condition ) statement
9266 if ( condition ) statement else statement
9267 switch ( condition ) statement
9269 Returns the new IF_STMT or SWITCH_STMT.
9271 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9272 is a (possibly labeled) if statement which is not enclosed in
9273 braces and has an else clause. This is used to implement
9274 -Wparentheses. */
9276 static tree
9278 {
9285 /* Peek at the next token. */
9288 /* See what kind of keyword it is. */
9291 {
9294 {
9295 tree statement;
9296 tree condition;
9298 /* Look for the `('. */
9300 {
9303 }
9305 /* Begin the selection-statement. */
9308 else
9311 /* Parse the condition. */
9313 /* Look for the `)'. */
9319 {
9323 /* Add the condition. */
9326 /* Parse the then-clause. */
9330 {
9338 }
9339 else
9345 /* If the next token is `else', parse the else-clause. */
9347 RID_ELSE))
9348 {
9349 /* Consume the `else' keyword. */
9352 /* Parse the else-clause. */
9354 {
9355 location_t loc;
9362 }
9363 else
9368 /* If we are currently parsing a then-clause, then
9369 IF_P will not be NULL. We set it to true to
9370 indicate that this if statement has an else clause.
9371 This may trigger the Wparentheses warning below
9372 when we get back up to the parent if statement. */
9375 }
9376 else
9377 {
9378 /* This if statement does not have an else clause. If
9379 NESTED_IF is true, then the then-clause is an if
9380 statement which does have an else clause. We warn
9381 about the potential ambiguity. */
9384 "suggest explicit braces to avoid ambiguous"
9386 }
9388 /* Now we're all done with the if-statement. */
9390 }
9391 else
9392 {
9396 /* Add the condition. */
9399 /* Parse the body of the switch-statement. */
9408 /* Now we're all done with the switch-statement. */
9410 }
9413 }
9419 }
9420 }
9422 /* Parse a condition.
9424 condition:
9425 expression
9426 type-specifier-seq declarator = initializer-clause
9427 type-specifier-seq declarator braced-init-list
9429 GNU Extension:
9431 condition:
9432 type-specifier-seq declarator asm-specification [opt]
9433 attributes [opt] = assignment-expression
9435 Returns the expression that should be tested. */
9437 static tree
9439 {
9440 cp_decl_specifier_seq type_specifiers;
9444 /* Try the declaration first. */
9446 /* New types are not allowed in the type-specifier-seq for a
9447 condition. */
9449 parser->type_definition_forbidden_message
9451 /* Parse the type-specifier-seq. */
9453 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9456 /* Restore the saved message. */
9458 /* If all is well, we might be looking at a declaration. */
9460 {
9461 tree decl;
9462 tree asm_specification;
9463 tree attributes;
9467 /* Parse the declarator. */
9472 /* Parse the attributes. */
9474 /* Parse the asm-specification. */
9476 /* If the next token is not an `=' or '{', then we might still be
9477 looking at an expression. For example:
9479 if (A(a).x)
9481 looks like a decl-specifier-seq and a declarator -- but then
9482 there is no `=', so this is an expression. */
9487 /* If we did see an `=' or '{', then we are looking at a declaration
9488 for sure. */
9490 {
9491 tree pushed_scope;
9495 /* Create the declaration. */
9501 /* Parse the initializer. */
9503 {
9507 }
9508 else
9509 {
9510 /* Consume the `='. */
9513 }
9517 /* Process the initializer. */
9520 asm_specification,
9521 flags);
9527 }
9528 }
9529 /* If we didn't even get past the declarator successfully, we are
9530 definitely not looking at a declaration. */
9531 else
9534 /* Otherwise, we are looking at an expression. */
9536 }
9538 /* Parses a for-statement or range-for-statement until the closing ')',
9539 not included. */
9541 static tree
9543 {
9547 /* Begin the for-statement. */
9550 /* Parse the initialization. */
9555 else
9557 }
9559 static tree
9561 {
9562 /* Normal for loop */
9565 tree stmt;
9568 /* The for-init-statement has already been parsed in
9569 cp_parser_for_init_statement, so no work is needed here. */
9572 /* If there's a condition, process it. */
9576 /* Look for the `;'. */
9579 /* If there's an expression, process it. */
9585 }
9587 /* Tries to parse a range-based for-statement:
9589 range-based-for:
9590 decl-specifier-seq declarator : expression
9592 The decl-specifier-seq declarator and the `:' are already parsed by
9593 cp_parser_for_init_statement. If processing_template_decl it returns a
9594 newly created RANGE_FOR_STMT; if not, it is converted to a
9595 regular FOR_STMT. */
9597 static tree
9599 {
9603 {
9606 }
9607 else
9610 /* If in template, STMT is converted to a normal for-statement
9611 at instantiation. If not, it is done just ahead. */
9613 {
9620 /* The length of an array might be dependent. */
9622 /* do_auto_deduction doesn't mess with template init-lists. */
9625 }
9626 else
9627 {
9630 }
9632 }
9634 /* Subroutine of cp_convert_range_for: given the initializer expression,
9635 builds up the range temporary. */
9637 static tree
9639 {
9642 /* Find out the type deduced by the declaration
9643 `auto &&__range = range_expr'. */
9648 /* Create the __range variable. */
9655 }
9657 /* Used by cp_parser_range_for in template context: we aren't going to
9658 do a full conversion yet, but we still need to resolve auto in the
9659 type of the for-range-declaration if present. This is basically
9660 a shortcut version of cp_convert_range_for. */
9662 static void
9664 {
9667 {
9670 iter_type = (cp_parser_perform_range_for_lookup
9674 tf_warning_or_error);
9677 }
9678 }
9680 /* Converts a range-based for-statement into a normal
9681 for-statement, as per the definition.
9683 for (RANGE_DECL : RANGE_EXPR)
9684 BLOCK
9686 should be equivalent to:
9688 {
9689 auto &&__range = RANGE_EXPR;
9690 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9691 __begin != __end;
9692 ++__begin)
9693 {
9694 RANGE_DECL = *__begin;
9695 BLOCK
9696 }
9697 }
9699 If RANGE_EXPR is an array:
9700 BEGIN_EXPR = __range
9701 END_EXPR = __range + ARRAY_SIZE(__range)
9702 Else if RANGE_EXPR has a member 'begin' or 'end':
9703 BEGIN_EXPR = __range.begin()
9704 END_EXPR = __range.end()
9705 Else:
9706 BEGIN_EXPR = begin(__range)
9707 END_EXPR = end(__range);
9709 If __range has a member 'begin' but not 'end', or vice versa, we must
9710 still use the second alternative (it will surely fail, however).
9711 When calling begin()/end() in the third alternative we must use
9712 argument dependent lookup, but always considering 'std' as an associated
9713 namespace. */
9715 tree
9717 {
9723 /* If an error happened previously do nothing or else a lot of
9724 unhelpful errors would be issued. */
9726 else
9727 {
9732 LOOKUP_ONLYCONVERTING);
9737 }
9739 /* The new for initialization statement. */
9747 LOOKUP_ONLYCONVERTING);
9756 LOOKUP_ONLYCONVERTING);
9760 /* The new for condition. */
9767 /* The new increment expression. */
9772 /* The declaration is initialized with *__begin inside the loop body. */
9775 tf_warning_or_error),
9777 LOOKUP_ONLYCONVERTING);
9780 }
9782 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9783 We need to solve both at the same time because the method used
9784 depends on the existence of members begin or end.
9785 Returns the type deduced for the iterator expression. */
9787 static tree
9789 {
9791 {
9794 }
9797 {
9802 }
9804 {
9805 /* If RANGE is an array, we will use pointer arithmetic. */
9808 range,
9812 }
9813 else
9814 {
9815 /* If it is not an array, we must do a bit of magic. */
9825 tf_warning_or_error);
9828 tf_warning_or_error);
9831 {
9832 /* Use the member functions. */
9835 else
9841 else
9844 }
9845 else
9846 {
9847 /* Use global functions with ADL. */
9855 tf_warning_or_error);
9857 tf_warning_or_error);
9860 tf_warning_or_error);
9862 tf_warning_or_error);
9865 }
9867 /* Last common checks. */
9869 {
9870 /* If one of the expressions is an error do no more checks. */
9873 }
9874 else
9875 {
9877 /* The unqualified type of the __begin and __end temporaries should
9878 be the same, as required by the multiple auto declaration. */
9884 }
9885 }
9886 }
9888 /* Helper function for cp_parser_perform_range_for_lookup.
9889 Builds a tree for RANGE.IDENTIFIER(). */
9891 static tree
9893 {
9906 tf_warning_or_error);
9909 }
9911 /* Parse an iteration-statement.
9913 iteration-statement:
9914 while ( condition ) statement
9915 do statement while ( expression ) ;
9916 for ( for-init-statement condition [opt] ; expression [opt] )
9917 statement
9919 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9921 static tree
9923 {
9926 tree statement;
9929 /* Peek at the next token. */
9934 /* Remember whether or not we are already within an iteration
9935 statement. */
9938 /* See what kind of keyword it is. */
9941 {
9943 {
9944 tree condition;
9946 /* Begin the while-statement. */
9948 /* Look for the `('. */
9950 /* Parse the condition. */
9953 /* Look for the `)'. */
9955 /* Parse the dependent statement. */
9959 /* We're done with the while-statement. */
9961 }
9965 {
9966 tree expression;
9968 /* Begin the do-statement. */
9970 /* Parse the body of the do-statement. */
9975 /* Look for the `while' keyword. */
9977 /* Look for the `('. */
9979 /* Parse the expression. */
9981 /* We're done with the do-statement. */
9983 /* Look for the `)'. */
9985 /* Look for the `;'. */
9987 }
9991 {
9992 /* Look for the `('. */
9997 /* Look for the `)'. */
10000 /* Parse the body of the for-statement. */
10005 /* We're done with the for-statement. */
10007 }
10014 }
10017 }
10019 /* Parse a for-init-statement or the declarator of a range-based-for.
10020 Returns true if a range-based-for declaration is seen.
10022 for-init-statement:
10023 expression-statement
10024 simple-declaration */
10026 static bool
10028 {
10029 /* If the next token is a `;', then we have an empty
10030 expression-statement. Grammatically, this is also a
10031 simple-declaration, but an invalid one, because it does not
10032 declare anything. Therefore, if we did not handle this case
10033 specially, we would issue an error message about an invalid
10034 declaration. */
10036 {
10042 /* We're going to speculatively look for a declaration, falling back
10043 to an expression, if necessary. */
10045 /* Parse the declaration. */
10048 decl);
10051 {
10052 /* It is a range-for, consume the ':' */
10056 {
10058 "range-based %<for%> loops are not allowed "
10061 }
10062 }
10063 else
10064 /* The ';' is not consumed yet because we told
10065 cp_parser_simple_declaration not to. */
10070 /* If the tentative parse failed, then we shall need to look for an
10071 expression-statement. */
10072 }
10073 /* If we are here, it is an expression-statement. */
10076 }
10078 /* Parse a jump-statement.
10080 jump-statement:
10081 break ;
10082 continue ;
10083 return expression [opt] ;
10084 return braced-init-list ;
10085 goto identifier ;
10087 GNU extension:
10089 jump-statement:
10090 goto * expression ;
10092 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10094 static tree
10096 {
10102 /* Peek at the next token. */
10107 /* See what kind of keyword it is. */
10110 {
10114 {
10129 }
10135 {
10148 }
10153 {
10154 tree expr;
10158 {
10161 }
10164 else
10165 /* If the next token is a `;', then there is no
10166 expression. */
10168 /* Build the return-statement. */
10170 /* Look for the final `;'. */
10172 }
10176 /* Create the goto-statement. */
10178 {
10179 /* Issue a warning about this use of a GNU extension. */
10181 /* Consume the '*' token. */
10183 /* Parse the dependent expression. */
10185 }
10186 else
10188 /* Look for the final `;'. */
10195 }
10198 }
10200 /* Parse a declaration-statement.
10202 declaration-statement:
10203 block-declaration */
10205 static void
10207 {
10210 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10213 /* Parse the block-declaration. */
10216 /* Free any declarators allocated. */
10219 /* Finish off the statement. */
10221 }
10223 /* Some dependent statements (like `if (cond) statement'), are
10224 implicitly in their own scope. In other words, if the statement is
10225 a single statement (as opposed to a compound-statement), it is
10226 none-the-less treated as if it were enclosed in braces. Any
10227 declarations appearing in the dependent statement are out of scope
10228 after control passes that point. This function parses a statement,
10229 but ensures that is in its own scope, even if it is not a
10230 compound-statement.
10232 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10233 is a (possibly labeled) if statement which is not enclosed in
10234 braces and has an else clause. This is used to implement
10235 -Wparentheses.
10237 Returns the new statement. */
10239 static tree
10241 {
10242 tree statement;
10247 /* Mark if () ; with a special NOP_EXPR. */
10249 {
10253 }
10254 /* if a compound is opened, we simply parse the statement directly. */
10257 /* If the token is not a `{', then we must take special action. */
10258 else
10259 {
10260 /* Create a compound-statement. */
10262 /* Parse the dependent-statement. */
10264 /* Finish the dummy compound-statement. */
10266 }
10268 /* Return the statement. */
10270 }
10272 /* For some dependent statements (like `while (cond) statement'), we
10273 have already created a scope. Therefore, even if the dependent
10274 statement is a compound-statement, we do not want to create another
10275 scope. */
10277 static void
10279 {
10280 /* If the token is a `{', then we must take special action. */
10283 else
10284 {
10285 /* Avoid calling cp_parser_compound_statement, so that we
10286 don't create a new scope. Do everything else by hand. */
10288 /* If the next keyword is `__label__' we have a label declaration. */
10291 /* Parse an (optional) statement-seq. */
10294 }
10295 }
10297 /* Declarations [gram.dcl.dcl] */
10299 /* Parse an optional declaration-sequence.
10301 declaration-seq:
10302 declaration
10303 declaration-seq declaration */
10305 static void
10307 {
10309 {
10320 {
10321 /* A declaration consisting of a single semicolon is
10322 invalid. Allow it unless we're being pedantic. */
10327 }
10329 /* If we're entering or exiting a region that's implicitly
10330 extern "C", modify the lang context appropriately. */
10332 {
10335 }
10337 {
10340 }
10343 {
10344 /* A top-level declaration can consist solely of a #pragma.
10345 A nested declaration cannot, so this is done here and not
10346 in cp_parser_declaration. (A #pragma at block scope is
10347 handled in cp_parser_statement.) */
10350 }
10352 /* Parse the declaration itself. */
10354 }
10355 }
10357 /* Parse a declaration.
10359 declaration:
10360 block-declaration
10361 function-definition
10362 template-declaration
10363 explicit-instantiation
10364 explicit-specialization
10365 linkage-specification
10366 namespace-definition
10368 GNU extension:
10370 declaration:
10371 __extension__ declaration */
10373 static void
10375 {
10376 cp_token token1;
10377 cp_token token2;
10382 /* Check for the `__extension__' keyword. */
10384 {
10385 /* Parse the qualified declaration. */
10387 /* Restore the PEDANTIC flag. */
10391 }
10393 /* Try to figure out what kind of declaration is present. */
10398 else
10399 {
10402 }
10404 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10407 /* If the next token is `extern' and the following token is a string
10408 literal, then we have a linkage specification. */
10412 /* If the next token is `template', then we have either a template
10413 declaration, an explicit instantiation, or an explicit
10414 specialization. */
10416 {
10417 /* `template <>' indicates a template specialization. */
10421 /* `template <' indicates a template declaration. */
10424 /* Anything else must be an explicit instantiation. */
10425 else
10427 }
10428 /* If the next token is `export', then we have a template
10429 declaration. */
10432 /* If the next token is `extern', 'static' or 'inline' and the one
10433 after that is `template', we have a GNU extended explicit
10434 instantiation directive. */
10441 /* If the next token is `namespace', check for a named or unnamed
10442 namespace definition. */
10448 /* An unnamed namespace definition. */
10452 /* An inline (associated) namespace definition. */
10456 /* Objective-C++ declaration/definition. */
10463 /* We must have either a block declaration or a function
10464 definition. */
10465 else
10466 /* Try to parse a block-declaration, or a function-definition. */
10469 /* Free any declarators allocated. */
10471 }
10473 /* Parse a block-declaration.
10475 block-declaration:
10476 simple-declaration
10477 asm-definition
10478 namespace-alias-definition
10479 using-declaration
10480 using-directive
10482 GNU Extension:
10484 block-declaration:
10485 __extension__ block-declaration
10487 C++0x Extension:
10489 block-declaration:
10490 static_assert-declaration
10492 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10493 part of a declaration-statement. */
10495 static void
10498 {
10502 /* Check for the `__extension__' keyword. */
10504 {
10505 /* Parse the qualified declaration. */
10507 /* Restore the PEDANTIC flag. */
10511 }
10513 /* Peek at the next token to figure out which kind of declaration is
10514 present. */
10517 /* If the next keyword is `asm', we have an asm-definition. */
10519 {
10523 }
10524 /* If the next keyword is `namespace', we have a
10525 namespace-alias-definition. */
10528 /* If the next keyword is `using', we have a
10529 using-declaration, a using-directive, or an alias-declaration. */
10531 {
10536 /* If the token after `using' is `namespace', then we have a
10537 using-directive. */
10541 /* If the second token after 'using' is '=', then we have an
10542 alias-declaration. */
10548 /* Otherwise, it's a using-declaration. */
10549 else
10552 }
10553 /* If the next keyword is `__label__' we have a misplaced label
10554 declaration. */
10556 {
10560 /* If the next token is now a `;', consume it. */
10563 }
10564 /* If the next token is `static_assert' we have a static assertion. */
10567 /* Anything else must be a simple-declaration. */
10568 else
10571 }
10573 /* Parse a simple-declaration.
10575 simple-declaration:
10576 decl-specifier-seq [opt] init-declarator-list [opt] ;
10578 init-declarator-list:
10579 init-declarator
10580 init-declarator-list , init-declarator
10582 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10583 function-definition as a simple-declaration.
10585 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10586 parsed declaration if it is an uninitialized single declarator not followed
10587 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10588 if present, will not be consumed. */
10590 static void
10594 {
10595 cp_decl_specifier_seq decl_specifiers;
10602 /* Defer access checks until we know what is being declared; the
10603 checks for names appearing in the decl-specifier-seq should be
10604 done as if we were in the scope of the thing being declared. */
10607 /* Parse the decl-specifier-seq. We have to keep track of whether
10608 or not the decl-specifier-seq declares a named class or
10609 enumeration type, since that is the only case in which the
10610 init-declarator-list is allowed to be empty.
10612 [dcl.dcl]
10614 In a simple-declaration, the optional init-declarator-list can be
10615 omitted only when declaring a class or enumeration, that is when
10616 the decl-specifier-seq contains either a class-specifier, an
10617 elaborated-type-specifier, or an enum-specifier. */
10619 CP_PARSER_FLAGS_OPTIONAL,
10622 /* We no longer need to defer access checks. */
10625 /* In a block scope, a valid declaration must always have a
10626 decl-specifier-seq. By not trying to parse declarators, we can
10627 resolve the declaration/expression ambiguity more quickly. */
10630 {
10633 }
10635 /* If the next two tokens are both identifiers, the code is
10636 erroneous. The usual cause of this situation is code like:
10638 T t;
10640 where "T" should name a type -- but does not. */
10643 {
10644 /* If parsing tentatively, we should commit; we really are
10645 looking at a declaration. */
10647 /* Give up. */
10649 }
10651 /* If we have seen at least one decl-specifier, and the next token
10652 is not a parenthesis, then we must be looking at a declaration.
10653 (After "int (" we might be looking at a functional cast.) */
10660 /* Keep going until we hit the `;' at the end of the simple
10661 declaration. */
10664 CPP_SEMICOLON))
10665 {
10668 tree decl;
10671 {
10672 /* If we are processing next declarator, coma is expected */
10678 }
10679 else
10682 /* Parse the init-declarator. */
10685 function_definition_allowed_p,
10687 declares_class_or_enum,
10689 maybe_range_for_decl);
10690 /* If an error occurred while parsing tentatively, exit quickly.
10691 (That usually happens when in the body of a function; each
10692 statement is treated as a declaration-statement until proven
10693 otherwise.) */
10696 /* Handle function definitions specially. */
10698 {
10699 /* If the next token is a `,', then we are probably
10700 processing something like:
10702 void f() {}, *p;
10704 which is erroneous. */
10706 {
10709 "mixing"
10711 }
10712 /* Otherwise, we're done with the list of declarators. */
10713 else
10714 {
10717 }
10718 }
10721 /* The next token should be either a `,' or a `;'. */
10723 /* If it's a `,', there are more declarators to come. */
10726 /* If it's a `;', we are done. */
10729 /* Anything else is an error. */
10730 else
10731 {
10732 /* If we have already issued an error message we don't need
10733 to issue another one. */
10737 /* Skip tokens until we reach the end of the statement. */
10739 /* If the next token is now a `;', consume it. */
10743 }
10744 /* After the first time around, a function-definition is not
10745 allowed -- even if it was OK at first. For example:
10747 int i, f() {}
10749 is not valid. */
10751 }
10753 /* Issue an error message if no declarators are present, and the
10754 decl-specifier-seq does not itself declare a class or
10755 enumeration. */
10757 {
10760 /* Perform any deferred access checks. */
10762 }
10764 /* Consume the `;'. */
10768 done:
10770 }
10772 /* Parse a decl-specifier-seq.
10774 decl-specifier-seq:
10775 decl-specifier-seq [opt] decl-specifier
10776 decl-specifier attribute-specifier-seq [opt] (C++11)
10778 decl-specifier:
10779 storage-class-specifier
10780 type-specifier
10781 function-specifier
10782 friend
10783 typedef
10785 GNU Extension:
10787 decl-specifier:
10788 attributes
10790 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10792 The parser flags FLAGS is used to control type-specifier parsing.
10794 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10795 flags:
10797 1: one of the decl-specifiers is an elaborated-type-specifier
10798 (i.e., a type declaration)
10799 2: one of the decl-specifiers is an enum-specifier or a
10800 class-specifier (i.e., a type definition)
10802 */
10804 static void
10806 cp_parser_flags flags,
10809 {
10813 cp_decl_spec ds;
10815 /* Clear DECL_SPECS. */
10818 /* Assume no class or enumeration type is declared. */
10821 /* Keep reading specifiers until there are no more to read. */
10823 {
10828 /* Peek at the next token. */
10831 /* Save the first token of the decl spec list for error
10832 reporting. */
10835 /* Handle attributes. */
10837 {
10838 /* Parse the attributes. */
10841 /* In a sequence of declaration specifiers, c++11 attributes
10842 appertain to the type that precede them. In that case
10843 [dcl.spec]/1 says:
10845 The attribute-specifier-seq affects the type only for
10846 the declaration it appears in, not other declarations
10847 involving the same type.
10849 But for now let's force the user to position the
10850 attribute either at the beginning of the declaration or
10851 after the declarator-id, which would clearly mean that it
10852 applies to the declarator. */
10854 {
10856 /* The c++11 attribute is at the beginning of the
10857 declaration. It appertains to the entity being
10859 else
10860 {
10862 {
10863 /* This is an attribute following a
10864 class-specifier. */
10869 }
10870 else
10871 {
10872 decl_specs->std_attributes
10874 attrs);
10877 }
10879 }
10880 }
10882 decl_specs->attributes
10884 attrs);
10888 }
10889 /* Assume we will find a decl-specifier keyword. */
10891 /* If the next token is an appropriate keyword, we can simply
10892 add it to the list. */
10894 {
10895 /* decl-specifier:
10896 friend
10897 constexpr */
10900 {
10903 }
10904 else
10905 {
10907 /* Consume the token. */
10909 }
10917 /* function-specifier:
10918 inline
10919 virtual
10920 explicit */
10927 /* decl-specifier:
10928 typedef */
10931 /* Consume the token. */
10933 /* A constructor declarator cannot appear in a typedef. */
10935 /* The "typedef" keyword can only occur in a declaration; we
10936 may as well commit at this point. */
10943 /* storage-class-specifier:
10944 auto
10945 register
10946 static
10947 extern
10948 mutable
10950 GNU Extension:
10951 thread */
10954 {
10955 /* Consume the token. */
10958 /* Complain about `auto' as a storage specifier, if
10959 we're complaining about C++0x compatibility. */
10963 /* Set the storage class anyway. */
10965 token);
10966 }
10967 else
10968 /* C++0x auto type-specifier. */
10976 /* Consume the token. */
10979 token);
10982 /* Consume the token. */
10988 /* We did not yet find a decl-specifier yet. */
10991 }
11001 /* Constructors are a special case. The `S' in `S()' is not a
11002 decl-specifier; it is the beginning of the declarator. */
11003 constructor_p
11004 = (!found_decl_spec
11005 && constructor_possible_p
11006 && (cp_parser_constructor_declarator_p
11009 /* If we don't have a DECL_SPEC yet, then we must be looking at
11010 a type-specifier. */
11012 {
11015 tree type_spec;
11017 type_spec
11019 decl_specs,
11025 /* If this type-specifier referenced a user-defined type
11026 (a typedef, class-name, etc.), then we can't allow any
11027 more such type-specifiers henceforth.
11029 [dcl.spec]
11031 The longest sequence of decl-specifiers that could
11032 possibly be a type name is taken as the
11033 decl-specifier-seq of a declaration. The sequence shall
11034 be self-consistent as described below.
11036 [dcl.type]
11038 As a general rule, at most one type-specifier is allowed
11039 in the complete decl-specifier-seq of a declaration. The
11040 only exceptions are the following:
11042 -- const or volatile can be combined with any other
11043 type-specifier.
11045 -- signed or unsigned can be combined with char, long,
11046 short, or int.
11048 -- ..
11050 Example:
11052 typedef char* Pc;
11053 void g (const int Pc);
11055 Here, Pc is *not* part of the decl-specifier seq; it's
11056 the declarator. Therefore, once we see a type-specifier
11057 (other than a cv-qualifier), we forbid any additional
11058 user-defined types. We *do* still allow things like `int
11059 int' to be considered a decl-specifier-seq, and issue the
11060 error message later. */
11063 /* A constructor declarator cannot follow a type-specifier. */
11065 {
11070 }
11071 }
11073 /* If we still do not have a DECL_SPEC, then there are no more
11074 decl-specifiers. */
11079 /* After we see one decl-specifier, further decl-specifiers are
11080 always optional. */
11082 }
11084 /* Don't allow a friend specifier with a class definition. */
11089 }
11091 /* Parse an (optional) storage-class-specifier.
11093 storage-class-specifier:
11094 auto
11095 register
11096 static
11097 extern
11098 mutable
11100 GNU Extension:
11102 storage-class-specifier:
11103 thread
11105 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11107 static tree
11109 {
11111 {
11115 /* Fall through for C++98. */
11122 /* Consume the token. */
11127 }
11128 }
11130 /* Parse an (optional) function-specifier.
11132 function-specifier:
11133 inline
11134 virtual
11135 explicit
11137 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11138 Updates DECL_SPECS, if it is non-NULL. */
11140 static tree
11143 {
11146 {
11152 /* 14.5.2.3 [temp.mem]
11154 A member function template shall not be virtual. */
11166 }
11168 /* Consume the token. */
11170 }
11172 /* Parse a linkage-specification.
11174 linkage-specification:
11175 extern string-literal { declaration-seq [opt] }
11176 extern string-literal declaration */
11178 static void
11180 {
11181 tree linkage;
11183 /* Look for the `extern' keyword. */
11186 /* Look for the string-literal. */
11189 /* Transform the literal into an identifier. If the literal is a
11190 wide-character string, or contains embedded NULs, then we can't
11191 handle it as the user wants. */
11194 {
11196 /* Assume C++ linkage. */
11198 }
11199 else
11202 /* We're now using the new linkage. */
11205 /* If the next token is a `{', then we're using the first
11206 production. */
11208 {
11209 /* Consume the `{' token. */
11211 /* Parse the declarations. */
11213 /* Look for the closing `}'. */
11215 }
11216 /* Otherwise, there's just one declaration. */
11217 else
11218 {
11221 saved_in_unbraced_linkage_specification_p
11225 parser->in_unbraced_linkage_specification_p
11227 }
11229 /* We're done with the linkage-specification. */
11231 }
11233 /* Parse a static_assert-declaration.
11235 static_assert-declaration:
11236 static_assert ( constant-expression , string-literal ) ;
11238 If MEMBER_P, this static_assert is a class member. */
11240 static void
11242 {
11243 tree condition;
11244 tree message;
11246 location_t saved_loc;
11249 /* Peek at the `static_assert' token so we can keep track of exactly
11250 where the static assertion started. */
11254 /* Look for the `static_assert' keyword. */
11256 RT_STATIC_ASSERT))
11259 /* We know we are in a static assertion; commit to any tentative
11260 parse. */
11264 /* Parse the `(' starting the static assertion condition. */
11267 /* Parse the constant-expression. Allow a non-constant expression
11268 here in order to give better diagnostics in finish_static_assert. */
11269 condition =
11274 /* Parse the separating `,'. */
11277 /* Parse the string-literal message. */
11282 /* A `)' completes the static assertion. */
11289 /* A semicolon terminates the declaration. */
11292 /* Complete the static assertion, which may mean either processing
11293 the static assert now or saving it for template instantiation. */
11295 }
11297 /* Parse the expression in decltype ( expression ). */
11299 static tree
11302 {
11304 tree expr;
11306 /* First, try parsing an id-expression. */
11317 {
11320 cp_id_kind idk;
11324 /* Lookup the name we got back from the id-expression. */
11326 none_type,
11340 {
11341 /* Complete lookup of the id-expression. */
11342 expr = (finish_id_expression
11355 /* We found an id-expression, but it was something that we
11356 should not have found. This is an error, not something
11357 we can recover from, so note that we found an
11358 id-expression and we'll recover as gracefully as
11359 possible. */
11361 }
11366 /* We have an id-expression. */
11368 }
11371 {
11372 /* Abort the id-expression parse. */
11375 /* Parsing tentatively, again. */
11378 /* Parse a class member access. */
11386 /* We have an id-expression. */
11388 }
11391 /* We have parsed the complete id-expression or member access. */
11393 else
11394 {
11395 /* Abort our attempt to parse an id-expression or member access
11396 expression. */
11399 /* Parse a full expression. */
11402 }
11405 }
11407 /* Parse a `decltype' type. Returns the type.
11409 simple-type-specifier:
11410 decltype ( expression )
11411 C++14 proposal:
11412 decltype ( auto ) */
11414 static tree
11416 {
11417 tree expr;
11426 {
11427 /* Already parsed. */
11430 }
11432 /* Look for the `decltype' token. */
11436 /* Parse the opening `('. */
11440 /* decltype (auto) */
11443 {
11450 }
11452 /* Types cannot be defined in a `decltype' expression. Save away the
11453 old message. */
11456 /* And create the new one. */
11457 parser->type_definition_forbidden_message
11460 /* The restrictions on constant-expressions do not apply inside
11461 decltype expressions. */
11462 saved_integral_constant_expression_p
11464 saved_non_integral_constant_expression_p
11468 /* Within a parenthesized expression, a `>' token is always
11469 the greater-than operator. */
11470 saved_greater_than_is_operator_p
11474 /* Do not actually evaluate the expression. */
11477 /* Do not warn about problems with the expression. */
11482 /* Go back to evaluating expressions. */
11486 /* The `>' token might be the end of a template-id or
11487 template-parameter-list now. */
11488 parser->greater_than_is_operator_p
11491 /* Restore the old message and the integral constant expression
11492 flags. */
11494 parser->integral_constant_expression_p
11496 parser->non_integral_constant_expression_p
11499 /* Parse to the closing `)'. */
11501 {
11505 }
11508 tf_warning_or_error);
11510 rewrite:
11511 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11512 it again. */
11519 }
11521 /* Special member functions [gram.special] */
11523 /* Parse a conversion-function-id.
11525 conversion-function-id:
11526 operator conversion-type-id
11528 Returns an IDENTIFIER_NODE representing the operator. */
11530 static tree
11532 {
11533 tree type;
11534 tree saved_scope;
11535 tree saved_qualifying_scope;
11536 tree saved_object_scope;
11539 /* Look for the `operator' token. */
11542 /* When we parse the conversion-type-id, the current scope will be
11543 reset. However, we need that information in able to look up the
11544 conversion function later, so we save it here. */
11548 /* We must enter the scope of the class so that the names of
11549 entities declared within the class are available in the
11550 conversion-type-id. For example, consider:
11552 struct S {
11553 typedef int I;
11554 operator I();
11555 };
11557 S::operator I() { ... }
11559 In order to see that `I' is a type-name in the definition, we
11560 must be in the scope of `S'. */
11563 /* Parse the conversion-type-id. */
11565 /* Leave the scope of the class, if any. */
11568 /* Restore the saved scope. */
11572 /* If the TYPE is invalid, indicate failure. */
11576 }
11578 /* Parse a conversion-type-id:
11580 conversion-type-id:
11581 type-specifier-seq conversion-declarator [opt]
11583 Returns the TYPE specified. */
11585 static tree
11587 {
11588 tree attributes;
11589 cp_decl_specifier_seq type_specifiers;
11591 tree type_specified;
11593 /* Parse the attributes. */
11595 /* Parse the type-specifiers. */
11599 /* If that didn't work, stop. */
11602 /* Parse the conversion-declarator. */
11610 /* Don't give this error when parsing tentatively. This happens to
11611 work because we always parse this definitively once. */
11614 {
11616 {
11619 }
11623 }
11626 }
11628 /* Parse an (optional) conversion-declarator.
11630 conversion-declarator:
11631 ptr-operator conversion-declarator [opt]
11633 */
11637 {
11640 cp_cv_quals cv_quals;
11642 /* We don't know if there's a ptr-operator next, or not. */
11644 /* Try the ptr-operator. */
11647 /* If it worked, look for more conversion-declarators. */
11649 {
11652 /* Parse another optional declarator. */
11655 declarator = cp_parser_make_indirect_declarator
11659 }
11662 }
11664 /* Parse an (optional) ctor-initializer.
11666 ctor-initializer:
11667 : mem-initializer-list
11669 Returns TRUE iff the ctor-initializer was actually present. */
11671 static bool
11673 {
11674 /* If the next token is not a `:', then there is no
11675 ctor-initializer. */
11677 {
11678 /* Do default initialization of any bases and members. */
11683 }
11685 /* Consume the `:' token. */
11687 /* And the mem-initializer-list. */
11691 }
11693 /* Parse a mem-initializer-list.
11695 mem-initializer-list:
11696 mem-initializer ... [opt]
11697 mem-initializer ... [opt] , mem-initializer-list */
11699 static void
11701 {
11706 /* Let the semantic analysis code know that we are starting the
11707 mem-initializer-list. */
11712 /* Loop through the list. */
11714 {
11715 tree mem_initializer;
11718 /* Parse the mem-initializer. */
11720 /* If the next token is a `...', we're expanding member initializers. */
11722 {
11723 /* Consume the `...'. */
11726 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11727 can be expanded but members cannot. */
11730 {
11735 }
11737 /* Construct the pack expansion type. */
11740 }
11743 {
11747 }
11748 /* Look for a target constructor. */
11752 {
11755 {
11759 }
11761 }
11762 /* Add it to the list, unless it was erroneous. */
11764 {
11767 }
11768 /* If the next token is not a `,', we're done. */
11771 /* Consume the `,' token. */
11773 }
11775 /* Perform semantic analysis. */
11778 }
11780 /* Parse a mem-initializer.
11782 mem-initializer:
11783 mem-initializer-id ( expression-list [opt] )
11784 mem-initializer-id braced-init-list
11786 GNU extension:
11788 mem-initializer:
11789 ( expression-list [opt] )
11791 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11792 class) or FIELD_DECL (for a non-static data member) to initialize;
11793 the TREE_VALUE is the expression-list. An empty initialization
11794 list is represented by void_list_node. */
11796 static tree
11798 {
11799 tree mem_initializer_id;
11800 tree expression_list;
11801 tree member;
11804 /* Find out what is being initialized. */
11806 {
11810 }
11811 else
11812 {
11816 }
11822 {
11828 }
11829 else
11830 {
11840 }
11850 }
11852 /* Parse a mem-initializer-id.
11854 mem-initializer-id:
11855 :: [opt] nested-name-specifier [opt] class-name
11856 identifier
11858 Returns a TYPE indicating the class to be initializer for the first
11859 production. Returns an IDENTIFIER_NODE indicating the data member
11860 to be initialized for the second production. */
11862 static tree
11864 {
11868 tree id;
11872 /* `typename' is not allowed in this context ([temp.res]). */
11874 {
11876 "keyword %<typename%> not allowed in this context (a qualified "
11879 }
11880 /* Look for the optional `::' operator. */
11881 global_scope_p
11885 /* Look for the optional nested-name-specifier. The simplest way to
11886 implement:
11888 [temp.res]
11890 The keyword `typename' is not permitted in a base-specifier or
11891 mem-initializer; in these contexts a qualified name that
11892 depends on a template-parameter is implicitly assumed to be a
11893 type name.
11895 is to assume that we have seen the `typename' keyword at this
11896 point. */
11897 nested_name_specifier_p
11906 /* If there is a `::' operator or a nested-name-specifier, then we
11907 are definitely looking for a class-name. */
11912 typename_type,
11916 /* Otherwise, we could also be looking for an ordinary identifier. */
11918 /* Try a class-name. */
11922 none_type,
11926 /* If we found one, we're done. */
11929 /* Otherwise, look for an ordinary identifier. */
11931 }
11933 /* Overloading [gram.over] */
11935 /* Parse an operator-function-id.
11937 operator-function-id:
11938 operator operator
11940 Returns an IDENTIFIER_NODE for the operator which is a
11941 human-readable spelling of the identifier, e.g., `operator +'. */
11943 static tree
11945 {
11946 /* Look for the `operator' keyword. */
11949 /* And then the name of the operator itself. */
11951 }
11953 /* Return an identifier node for a user-defined literal operator.
11954 The suffix identifier is chained to the operator name identifier. */
11956 static tree
11958 {
11959 tree identifier;
11964 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11967 }
11969 /* Parse an operator.
11971 operator:
11972 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11973 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11974 || ++ -- , ->* -> () []
11976 GNU Extensions:
11978 operator:
11979 <? >? <?= >?=
11981 Returns an IDENTIFIER_NODE for the operator which is a
11982 human-readable spelling of the identifier, e.g., `operator +'. */
11984 static tree
11986 {
11990 /* Peek at the next token. */
11992 /* Figure out which operator we have. */
11994 {
11996 {
11999 /* The keyword should be either `new' or `delete'. */
12004 else
12007 /* Consume the `new' or `delete' token. */
12010 /* Peek at the next token. */
12012 /* If it's a `[' token then this is the array variant of the
12013 operator. */
12015 {
12016 /* Consume the `[' token. */
12018 /* Look for the `]' token. */
12022 }
12023 /* Otherwise, we have the non-array variant. */
12024 else
12028 }
12175 /* Consume the `('. */
12177 /* Look for the matching `)'. */
12182 /* Consume the `['. */
12184 /* Look for the matching `]'. */
12192 {
12195 }
12196 /* Consume the string. */
12198 /* Look for the suffix identifier. */
12201 {
12204 {
12207 }
12208 }
12209 else
12210 {
12213 }
12220 /* Anything else is an error. */
12222 }
12224 /* If we have selected an identifier, we need to consume the
12225 operator token. */
12228 /* Otherwise, no valid operator name was present. */
12229 else
12230 {
12233 }
12236 }
12238 /* Parse a template-declaration.
12240 template-declaration:
12241 export [opt] template < template-parameter-list > declaration
12243 If MEMBER_P is TRUE, this template-declaration occurs within a
12244 class-specifier.
12246 The grammar rule given by the standard isn't correct. What
12247 is really meant is:
12249 template-declaration:
12250 export [opt] template-parameter-list-seq
12251 decl-specifier-seq [opt] init-declarator [opt] ;
12252 export [opt] template-parameter-list-seq
12253 function-definition
12255 template-parameter-list-seq:
12256 template-parameter-list-seq [opt]
12257 template < template-parameter-list > */
12259 static void
12261 {
12262 /* Check for `export'. */
12264 {
12265 /* Consume the `export' token. */
12267 /* Warn that we do not support `export'. */
12269 }
12272 }
12274 /* Parse a template-parameter-list.
12276 template-parameter-list:
12277 template-parameter
12278 template-parameter-list , template-parameter
12280 Returns a TREE_LIST. Each node represents a template parameter.
12281 The nodes are connected via their TREE_CHAINs. */
12283 static tree
12285 {
12290 /* The loop below parses the template parms. We first need to know
12291 the total number of template parms to be able to compute proper
12292 canonical types of each dependent type. So after the loop, when
12293 we know the total number of template parms,
12294 end_template_parm_list computes the proper canonical types and
12295 fixes up the dependent types accordingly. */
12297 {
12298 tree parameter;
12301 location_t parm_loc;
12303 /* Parse the template-parameter. */
12308 /* Add it to the list. */
12311 parm_loc,
12312 parameter,
12313 is_non_type,
12314 is_parameter_pack);
12315 else
12316 {
12319 }
12321 /* If the next token is not a `,', we're done. */
12324 /* Otherwise, consume the `,' token. */
12326 }
12329 }
12331 /* Parse a template-parameter.
12333 template-parameter:
12334 type-parameter
12335 parameter-declaration
12337 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12338 the parameter. The TREE_PURPOSE is the default value, if any.
12339 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12340 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12341 set to true iff this parameter is a parameter pack. */
12343 static tree
12346 {
12350 tree parm;
12352 /* Assume it is a type parameter or a template parameter. */
12354 /* Assume it not a parameter pack. */
12356 /* Peek at the next token. */
12358 /* If it is `class' or `template', we have a type-parameter. */
12361 /* If it is `class' or `typename' we do not know yet whether it is a
12362 type parameter or a non-type parameter. Consider:
12364 template <typename T, typename T::X X> ...
12366 or:
12368 template <class C, class D*> ...
12370 Here, the first parameter is a type parameter, and the second is
12371 a non-type parameter. We can tell by looking at the token after
12372 the identifier -- if it is a `,', `=', or `>' then we have a type
12373 parameter. */
12375 {
12376 /* Peek at the token after `class' or `typename'. */
12378 /* If it's an ellipsis, we have a template type parameter
12379 pack. */
12382 /* If it's an identifier, skip it. */
12385 /* Now, see if the token looks like the end of a template
12386 parameter. */
12391 }
12393 /* Otherwise, it is a non-type parameter.
12395 [temp.param]
12397 When parsing a default template-argument for a non-type
12398 template-parameter, the first non-nested `>' is taken as the end
12399 of the template parameter-list rather than a greater-than
12400 operator. */
12402 parameter_declarator
12406 /* If the parameter declaration is marked as a parameter pack, set
12407 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12408 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12409 grokdeclarator. */
12413 {
12416 }
12420 {
12421 /* Can happen in some cases of erroneous input (c++/34892). */
12423 /* Consume the `...' for better error recovery. */
12425 }
12426 /* If the next token is an ellipsis, and we don't already have it
12427 marked as a parameter pack, then we have a parameter pack (that
12428 has no declarator). */
12431 && (declarator_can_be_parameter_pack
12433 {
12434 /* Consume the `...'. */
12439 }
12440 /* We might end up with a pack expansion as the type of the non-type
12441 template parameter, in which case this is a non-type template
12442 parameter pack. */
12446 {
12450 }
12453 {
12454 /* Parameter packs cannot have default arguments. However, a
12455 user may try to do so, so we'll parse them and give an
12456 appropriate diagnostic here. */
12460 /* Find the name of the parameter pack. */
12469 else
12473 /* Parse the default argument, but throw away the result. */
12475 }
12485 }
12487 /* Parse a type-parameter.
12489 type-parameter:
12490 class identifier [opt]
12491 class identifier [opt] = type-id
12492 typename identifier [opt]
12493 typename identifier [opt] = type-id
12494 template < template-parameter-list > class identifier [opt]
12495 template < template-parameter-list > class identifier [opt]
12496 = id-expression
12498 GNU Extension (variadic templates):
12500 type-parameter:
12501 class ... identifier [opt]
12502 typename ... identifier [opt]
12504 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12505 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12506 the declaration of the parameter.
12508 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12510 static tree
12512 {
12514 tree parameter;
12516 /* Look for a keyword to tell us what kind of parameter this is. */
12522 {
12525 {
12526 tree identifier;
12527 tree default_argument;
12529 /* If the next token is an ellipsis, we have a template
12530 argument pack. */
12532 {
12533 /* Consume the `...' token. */
12538 }
12540 /* If the next token is an identifier, then it names the
12541 parameter. */
12544 else
12547 /* Create the parameter. */
12550 /* If the next token is an `=', we have a default argument. */
12552 {
12553 /* Consume the `=' token. */
12555 /* Parse the default-argument. */
12559 /* Template parameter packs cannot have default
12560 arguments. */
12562 {
12565 "template parameter pack %qD cannot have a "
12567 else
12569 "template parameter packs cannot have "
12572 }
12574 }
12575 else
12578 /* Create the combined representation of the parameter and the
12579 default argument. */
12581 }
12585 {
12586 tree identifier;
12587 tree default_argument;
12589 /* Look for the `<'. */
12591 /* Parse the template-parameter-list. */
12593 /* Look for the `>'. */
12595 /* Look for the `class' keyword. */
12597 /* If the next token is an ellipsis, we have a template
12598 argument pack. */
12600 {
12601 /* Consume the `...' token. */
12606 }
12607 /* If the next token is an `=', then there is a
12608 default-argument. If the next token is a `>', we are at
12609 the end of the parameter-list. If the next token is a `,',
12610 then we are at the end of this parameter. */
12614 {
12616 /* Treat invalid names as if the parameter were nameless. */
12619 }
12620 else
12623 /* Create the template parameter. */
12625 identifier);
12627 /* If the next token is an `=', then there is a
12628 default-argument. */
12630 {
12633 /* Consume the `='. */
12635 /* Parse the id-expression. */
12637 /* save token before parsing the id-expression, for error
12638 reporting */
12640 default_argument
12648 /* If the id-expression was a template-id that refers to
12649 a template-class, we already have the declaration here,
12650 so no further lookup is needed. */
12651 ;
12652 else
12653 /* Look up the name. */
12654 default_argument
12656 none_type,
12662 /* See if the default argument is valid. */
12663 default_argument
12666 /* Template parameter packs cannot have default
12667 arguments. */
12669 {
12672 "template parameter pack %qD cannot "
12674 identifier);
12675 else
12679 }
12681 }
12682 else
12685 /* Create the combined representation of the parameter and the
12686 default argument. */
12688 }
12694 }
12697 }
12699 /* Parse a template-id.
12701 template-id:
12702 template-name < template-argument-list [opt] >
12704 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12705 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12706 returned. Otherwise, if the template-name names a function, or set
12707 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12708 names a class, returns a TYPE_DECL for the specialization.
12710 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12711 uninstantiated templates. */
12713 static tree
12719 {
12721 tree templ;
12722 tree arguments;
12723 tree template_id;
12730 /* If the next token corresponds to a template-id, there is no need
12731 to reparse it. */
12734 {
12737 /* Get the stored value. */
12739 /* Perform any access checks that were deferred. */
12742 {
12747 tf_warning_or_error);
12748 }
12749 /* Return the stored value. */
12751 }
12753 /* Avoid performing name lookup if there is no possibility of
12754 finding a template-id. */
12757 && !cp_parser_nth_token_starts_template_argument_list_p
12759 {
12762 }
12764 /* Remember where the template-id starts. */
12770 /* Parse the template-name. */
12773 check_dependency_p,
12774 is_declaration,
12775 tag_type,
12778 {
12781 }
12783 /* If we find the sequence `[:' after a template-name, it's probably
12784 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12785 parse correctly the argument list. */
12792 {
12794 /* Change `:' into `::'. */
12796 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12797 CPP_LESS. */
12800 /* Parse the arguments. */
12803 {
12804 /* If we couldn't parse an argument list, then we revert our changes
12805 and return simply an error. Maybe this is not a template-id
12806 after all. */
12811 }
12812 /* Otherwise, emit an error about the invalid digraph, but continue
12813 parsing because we got our argument list. */
12816 {
12819 "%<<:%> is an alternate spelling for %<[%>."
12822 {
12824 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
12827 }
12828 }
12829 }
12830 else
12831 {
12832 /* Look for the `<' that starts the template-argument-list. */
12834 {
12837 }
12838 /* Parse the arguments. */
12840 }
12842 /* Build a representation of the specialization. */
12845 TEMPLATE_ID_EXPR,
12849 {
12851 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12852 template (rather than some instantiation thereof) only if
12853 is not nested within some other construct. For example, in
12854 "template <typename T> void f(T) { A<T>::", A<T> is just an
12855 instantiation of A. */
12858 CPP_SCOPE));
12859 template_id
12861 }
12862 else
12863 {
12864 /* If it's not a class-template or a template-template, it should be
12865 a function-template. */
12871 }
12873 /* If parsing tentatively, replace the sequence of tokens that makes
12874 up the template-id with a CPP_TEMPLATE_ID token. That way,
12875 should we re-parse the token stream, we will not have to repeat
12876 the effort required to do the parse, nor will we issue duplicate
12877 error messages about problems during instantiation of the
12878 template. */
12880 {
12883 /* Reset the contents of the START_OF_ID token. */
12885 /* Retrieve any deferred checks. Do not pop this access checks yet
12886 so the memory will not be reclaimed during token replacing below. */
12892 /* Purge all subsequent tokens. */
12895 /* ??? Can we actually assume that, if template_id ==
12896 error_mark_node, we will have issued a diagnostic to the
12897 user, as opposed to simply marking the tentative parse as
12898 failed? */
12901 }
12905 }
12907 /* Parse a template-name.
12909 template-name:
12910 identifier
12912 The standard should actually say:
12914 template-name:
12915 identifier
12916 operator-function-id
12918 A defect report has been filed about this issue.
12920 A conversion-function-id cannot be a template name because they cannot
12921 be part of a template-id. In fact, looking at this code:
12923 a.operator K<int>()
12925 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12926 It is impossible to call a templated conversion-function-id with an
12927 explicit argument list, since the only allowed template parameter is
12928 the type to which it is converting.
12930 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12931 `template' keyword, in a construction like:
12933 T::template f<3>()
12935 In that case `f' is taken to be a template-name, even though there
12936 is no way of knowing for sure.
12938 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12939 name refers to a set of overloaded functions, at least one of which
12940 is a template, or an IDENTIFIER_NODE with the name of the template,
12941 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12942 names are looked up inside uninstantiated templates. */
12944 static tree
12951 {
12952 tree identifier;
12953 tree decl;
12954 tree fns;
12957 /* If the next token is `operator', then we have either an
12958 operator-function-id or a conversion-function-id. */
12960 {
12961 /* We don't know whether we're looking at an
12962 operator-function-id or a conversion-function-id. */
12964 /* Try an operator-function-id. */
12966 /* If that didn't work, try a conversion-function-id. */
12968 {
12971 }
12972 }
12973 /* Look for the identifier. */
12974 else
12977 /* If we didn't find an identifier, we don't have a template-id. */
12981 /* If the name immediately followed the `template' keyword, then it
12982 is a template-name. However, if the next token is not `<', then
12983 we do not treat it as a template-name, since it is not being used
12984 as part of a template-id. This enables us to handle constructs
12985 like:
12987 template <typename T> struct S { S(); };
12988 template <typename T> S<T>::S();
12990 correctly. We would treat `S' as a template -- if it were `S<T>'
12991 -- but we do not if there is no `<'. */
12995 {
12996 /* In a declaration, in a dependent context, we pretend that the
12997 "template" keyword was present in order to improve error
12998 recovery. For example, given:
13000 template <typename T> void f(T::X<int>);
13002 we want to treat "X<int>" as a template-id. */
13004 && !template_keyword_p
13006 && check_dependency_p
13008 /* Do not do this for dtors (or ctors), since they never
13009 need the template keyword before their name. */
13011 {
13014 /* Explain what went wrong. */
13016 identifier);
13019 /* If parsing tentatively, find the location of the "<" token. */
13022 /* Parse the template arguments so that we can issue error
13023 messages about them. */
13026 /* Skip tokens until we find a good place from which to
13027 continue parsing. */
13032 /* If parsing tentatively, permanently remove the
13033 template argument list. That will prevent duplicate
13034 error messages from being issued about the missing
13035 "template" keyword. */
13041 }
13043 /* If the "template" keyword is present, then there is generally
13044 no point in doing name-lookup, so we just return IDENTIFIER.
13045 But, if the qualifying scope is non-dependent then we can
13046 (and must) do name-lookup normally. */
13052 }
13054 /* Look up the name. */
13056 tag_type,
13059 check_dependency_p,
13063 /* If DECL is a template, then the name was a template-name. */
13065 ;
13066 else
13067 {
13070 /* The standard does not explicitly indicate whether a name that
13071 names a set of overloaded declarations, some of which are
13072 templates, is a template-name. However, such a name should
13073 be a template-name; otherwise, there is no way to form a
13074 template-id for the overloaded templates. */
13082 {
13083 /* The name does not name a template. */
13086 }
13087 }
13089 /* If DECL is dependent, and refers to a function, then just return
13090 its name; we will look it up again during template instantiation. */
13092 {
13096 }
13099 }
13101 /* Parse a template-argument-list.
13103 template-argument-list:
13104 template-argument ... [opt]
13105 template-argument-list , template-argument ... [opt]
13107 Returns a TREE_VEC containing the arguments. */
13109 static tree
13111 {
13116 tree vec;
13123 /* Even if the template-id appears in an integral
13124 constant-expression, the contents of the argument list do
13125 not. */
13131 /* Parse the arguments. */
13132 do
13133 {
13134 tree argument;
13137 /* Consume the comma. */
13140 /* Parse the template-argument. */
13143 /* If the next token is an ellipsis, we're expanding a template
13144 argument pack. */
13146 {
13148 {
13152 }
13153 /* Consume the `...' token. */
13156 /* Make the argument into a TYPE_PACK_EXPANSION or
13157 EXPR_PACK_EXPANSION. */
13159 }
13162 {
13166 {
13169 }
13170 else
13172 }
13174 }
13187 #ifdef ENABLE_CHECKING
13189 #endif
13191 }
13193 /* Parse a template-argument.
13195 template-argument:
13196 assignment-expression
13197 type-id
13198 id-expression
13200 The representation is that of an assignment-expression, type-id, or
13201 id-expression -- except that the qualified id-expression is
13202 evaluated, so that the value returned is either a DECL or an
13203 OVERLOAD.
13205 Although the standard says "assignment-expression", it forbids
13206 throw-expressions or assignments in the template argument.
13207 Therefore, we use "conditional-expression" instead. */
13209 static tree
13211 {
13212 tree argument;
13218 cp_id_kind idk;
13220 /* There's really no way to know what we're looking at, so we just
13221 try each alternative in order.
13223 [temp.arg]
13225 In a template-argument, an ambiguity between a type-id and an
13226 expression is resolved to a type-id, regardless of the form of
13227 the corresponding template-parameter.
13229 Therefore, we try a type-id first. */
13232 /* If there was no error parsing the type-id but the next token is a
13233 '>>', our behavior depends on which dialect of C++ we're
13234 parsing. In C++98, we probably found a typo for '> >'. But there
13235 are type-id which are also valid expressions. For instance:
13237 struct X { int operator >> (int); };
13238 template <int V> struct Foo {};
13239 Foo<X () >> 5> r;
13241 Here 'X()' is a valid type-id of a function type, but the user just
13242 wanted to write the expression "X() >> 5". Thus, we remember that we
13243 found a valid type-id, but we still try to parse the argument as an
13244 expression to see what happens.
13246 In C++0x, the '>>' will be considered two separate '>'
13247 tokens. */
13251 {
13254 }
13255 else
13256 {
13257 /* If the next token isn't a `,' or a `>', then this argument wasn't
13258 really finished. This means that the argument is not a valid
13259 type-id. */
13262 /* If that worked, we're done. */
13265 }
13266 /* We're still not sure what the argument will be. */
13268 /* Try a template. */
13276 /* If the next token isn't a `,' or a `>', then this argument wasn't
13277 really finished. */
13281 {
13282 /* Figure out what is being referred to. If the id-expression
13283 was for a class template specialization, then we will have a
13284 TYPE_DECL at this point. There is no need to do name lookup
13285 at this point in that case. */
13288 none_type,
13297 }
13300 /* It must be a non-type argument. There permitted cases are given
13301 in [temp.arg.nontype]:
13303 -- an integral constant-expression of integral or enumeration
13304 type; or
13306 -- the name of a non-type template-parameter; or
13308 -- the name of an object or function with external linkage...
13310 -- the address of an object or function with external linkage...
13312 -- a pointer to member... */
13313 /* Look for a non-type template parameter. */
13315 {
13327 }
13329 /* If the next token is "&", the argument must be the address of an
13330 object or function with external linkage. */
13333 {
13336 }
13337 /* See if we might have an id-expression. */
13344 {
13347 address_p,
13354 else
13355 {
13356 tree probe;
13359 {
13362 }
13364 /* If we're in a template, we represent a qualified-id referring
13365 to a static data member as a SCOPE_REF even if the scope isn't
13366 dependent so that we can check access control later. */
13371 {
13372 /* A variable without external linkage might still be a
13373 valid constant-expression, so no error is issued here
13374 if the external-linkage check fails. */
13377 }
13379 /* All overloaded functions are allowed; if the external
13380 linkage test does not pass, an error will be issued
13381 later. */
13382 ;
13386 /* A pointer-to-member. */
13387 ;
13389 ;
13390 else
13394 {
13397 tf_warning_or_error);
13399 }
13400 }
13401 }
13402 /* If the argument started with "&", there are no other valid
13403 alternatives at this point. */
13405 {
13408 }
13410 /* If the argument wasn't successfully parsed as a type-id followed
13411 by '>>', the argument can only be a constant expression now.
13412 Otherwise, we try parsing the constant-expression tentatively,
13413 because the argument could really be a type-id. */
13425 /* We did our best to parse the argument as a non type-id, but that
13426 was the only alternative that matched (albeit with a '>' after
13427 it). We can assume it's just a typo from the user, and a
13428 diagnostic will then be issued. */
13430 }
13432 /* Parse an explicit-instantiation.
13434 explicit-instantiation:
13435 template declaration
13437 Although the standard says `declaration', what it really means is:
13439 explicit-instantiation:
13440 template decl-specifier-seq [opt] declarator [opt] ;
13442 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13443 supposed to be allowed. A defect report has been filed about this
13444 issue.
13446 GNU Extension:
13448 explicit-instantiation:
13449 storage-class-specifier template
13450 decl-specifier-seq [opt] declarator [opt] ;
13451 function-specifier template
13452 decl-specifier-seq [opt] declarator [opt] ; */
13454 static void
13456 {
13458 cp_decl_specifier_seq decl_specifiers;
13463 /* Look for an (optional) storage-class-specifier or
13464 function-specifier. */
13466 {
13467 extension_specifier
13470 extension_specifier
13473 }
13475 /* Look for the `template' keyword. */
13477 /* Let the front end know that we are processing an explicit
13478 instantiation. */
13480 /* [temp.explicit] says that we are supposed to ignore access
13481 control while processing explicit instantiation directives. */
13483 /* Parse a decl-specifier-seq. */
13485 CP_PARSER_FLAGS_OPTIONAL,
13488 /* If there was exactly one decl-specifier, and it declared a class,
13489 and there's no declarator, then we have an explicit type
13490 instantiation. */
13492 {
13493 tree type;
13497 /* Turn access control back on for names used during
13498 template instantiation. */
13503 }
13504 else
13505 {
13507 tree decl;
13509 /* Parse the declarator. */
13510 declarator
13520 {
13523 "explicit instantiation shall not use"
13527 "explicit instantiation shall not use"
13532 /* Turn access control back on for names used during
13533 template instantiation. */
13535 /* Do the explicit instantiation. */
13537 }
13538 else
13539 {
13541 /* Skip the body of the explicit instantiation. */
13543 }
13544 }
13545 /* We're done with the instantiation. */
13551 }
13553 /* Parse an explicit-specialization.
13555 explicit-specialization:
13556 template < > declaration
13558 Although the standard says `declaration', what it really means is:
13560 explicit-specialization:
13561 template <> decl-specifier [opt] init-declarator [opt] ;
13562 template <> function-definition
13563 template <> explicit-specialization
13564 template <> template-declaration */
13566 static void
13568 {
13572 /* Look for the `template' keyword. */
13574 /* Look for the `<'. */
13576 /* Look for the `>'. */
13578 /* We have processed another parameter list. */
13580 /* [temp]
13582 A template ... explicit specialization ... shall not have C
13583 linkage. */
13585 {
13587 /* Give it C++ linkage to avoid confusing other parts of the
13588 front end. */
13591 }
13592 else
13594 /* Let the front end know that we are beginning a specialization. */
13596 {
13599 }
13601 /* If the next keyword is `template', we need to figure out whether
13602 or not we're looking a template-declaration. */
13604 {
13609 else
13611 }
13612 else
13613 /* Parse the dependent declaration. */
13619 /* We're done with the specialization. */
13621 /* For the erroneous case of a template with C linkage, we pushed an
13622 implicit C++ linkage scope; exit that scope now. */
13625 /* We're done with this parameter list. */
13627 }
13629 /* Parse a type-specifier.
13631 type-specifier:
13632 simple-type-specifier
13633 class-specifier
13634 enum-specifier
13635 elaborated-type-specifier
13636 cv-qualifier
13638 GNU Extension:
13640 type-specifier:
13641 __complex__
13643 Returns a representation of the type-specifier. For a
13644 class-specifier, enum-specifier, or elaborated-type-specifier, a
13645 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13647 The parser flags FLAGS is used to control type-specifier parsing.
13649 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13650 in a decl-specifier-seq.
13652 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13653 class-specifier, enum-specifier, or elaborated-type-specifier, then
13654 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13655 if a type is declared; 2 if it is defined. Otherwise, it is set to
13656 zero.
13658 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13659 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13660 is set to FALSE. */
13662 static tree
13664 cp_parser_flags flags,
13669 {
13675 /* Assume this type-specifier does not declare a new type. */
13678 /* And that it does not specify a cv-qualifier. */
13681 /* Peek at the next token. */
13684 /* If we're looking at a keyword, we can use that to guide the
13685 production we choose. */
13688 {
13693 /* Look for the enum-specifier. */
13695 /* If that worked, we're done. */
13697 {
13702 type_spec,
13703 token,
13706 }
13707 else
13710 /* Any of these indicate either a class-specifier, or an
13711 elaborated-type-specifier. */
13718 /* Parse tentatively so that we can back up if we don't find a
13719 class-specifier. */
13721 /* Look for the class-specifier. */
13724 /* If that worked, we're done. */
13726 {
13731 type_spec,
13732 token,
13735 }
13737 /* Fall through. */
13738 elaborated_type_specifier:
13739 /* We're declaring (not defining) a class or enum. */
13743 /* Fall through. */
13745 /* Look for an elaborated-type-specifier. */
13746 type_spec
13747 = (cp_parser_elaborated_type_specifier
13750 is_declaration));
13753 type_spec,
13754 token,
13777 /* The `__complex__' keyword is a GNU extension. */
13783 }
13785 /* Handle simple keywords. */
13787 {
13789 {
13792 }
13794 }
13796 /* If we do not already have a type-specifier, assume we are looking
13797 at a simple-type-specifier. */
13799 decl_specs,
13800 flags);
13802 /* If we didn't find a type-specifier, and a type-specifier was not
13803 optional in this context, issue an error message. */
13805 {
13808 }
13811 }
13813 /* Parse a simple-type-specifier.
13815 simple-type-specifier:
13816 :: [opt] nested-name-specifier [opt] type-name
13817 :: [opt] nested-name-specifier template template-id
13818 char
13819 wchar_t
13820 bool
13821 short
13822 int
13823 long
13824 signed
13825 unsigned
13826 float
13827 double
13828 void
13830 C++0x Extension:
13832 simple-type-specifier:
13833 auto
13834 decltype ( expression )
13835 char16_t
13836 char32_t
13837 __underlying_type ( type-id )
13839 GNU Extension:
13841 simple-type-specifier:
13842 __int128
13843 __typeof__ unary-expression
13844 __typeof__ ( type-id )
13846 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13847 appropriately updated. */
13849 static tree
13852 cp_parser_flags flags)
13853 {
13857 /* Peek at the next token. */
13860 /* If we're looking at a keyword, things are easy. */
13862 {
13925 /* Since DR 743, decltype can either be a simple-type-specifier by
13926 itself or begin a nested-name-specifier. Parsing it will replace
13927 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13928 handling below decide what to do. */
13934 /* Consume the `typeof' token. */
13936 /* Parse the operand to `typeof'. */
13938 /* If it is not already a TYPE, take its type. */
13944 token,
13953 token,
13963 token,
13968 }
13970 /* If token is an already-parsed decltype not followed by ::,
13971 it's a simple-type-specifier. */
13974 {
13978 token,
13982 }
13984 /* If the type-specifier was for a built-in type, we're done. */
13986 {
13987 /* Record the type. */
13994 type,
13995 token,
14000 /* Consume the token. */
14003 /* There is no valid C++ program where a non-template type is
14004 followed by a "<". That usually indicates that the user thought
14005 that the type was a template. */
14010 }
14012 /* The type-specifier must be a user-defined type. */
14014 {
14018 /* Don't gobble tokens or issue error messages if this is an
14019 optional type-specifier. */
14023 /* Look for the optional `::' operator. */
14024 global_p
14028 /* Look for the nested-name specifier. */
14029 qualified_p
14037 /* If we have seen a nested-name-specifier, and the next token
14038 is `template', then we are using the template-id production. */
14041 {
14042 /* Look for the template-id. */
14046 none_type,
14048 /* If the template-id did not name a type, we are out of
14049 luck. */
14051 {
14054 }
14055 }
14056 /* Otherwise, look for a type-name. */
14057 else
14059 /* Keep track of all name-lookups performed in class scopes. */
14061 && !global_p
14062 && !qualified_p
14066 /* If it didn't work out, we don't have a TYPE. */
14072 token,
14074 }
14076 /* If we didn't get a type-name, issue an error message. */
14078 {
14081 }
14084 {
14085 /* See if TYPE is an Objective-C type, and if so, parse and
14086 accept any protocol references following it. Do this before
14087 the cp_parser_check_for_invalid_template_id() call, because
14088 Objective-C types can be followed by '<...>' which would
14089 enclose protocol names rather than template arguments, and so
14090 everything is fine. */
14093 {
14097 /* Clobber the "unqualified" type previously entered into
14098 DECL_SPECS with the new, improved protocol-qualified version. */
14103 }
14105 /* There is no valid C++ program where a non-template type is
14106 followed by a "<". That usually indicates that the user
14107 thought that the type was a template. */
14109 none_type,
14111 }
14114 }
14116 /* Parse a type-name.
14118 type-name:
14119 class-name
14120 enum-name
14121 typedef-name
14122 simple-template-id [in c++0x]
14124 enum-name:
14125 identifier
14127 typedef-name:
14128 identifier
14130 Returns a TYPE_DECL for the type. */
14132 static tree
14134 {
14135 tree type_decl;
14137 /* We can't know yet whether it is a class-name or not. */
14139 /* Try a class-name. */
14143 none_type,
14147 /* If it's not a class-name, keep looking. */
14149 {
14151 /* It must be a typedef-name or an enum-name. */
14155 /* It is either a simple-template-id representing an
14156 instantiation of an alias template... */
14160 none_type,
14162 /* Note that this must be an instantiation of an alias template
14163 because [temp.names]/6 says:
14165 A template-id that names an alias template specialization
14166 is a type-name.
14168 Whereas [temp.names]/7 says:
14170 A simple-template-id that names a class template
14171 specialization is a class-name. */
14176 else
14180 /* ... Or a typedef-name or an enum-name. */
14182 }
14185 }
14187 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14189 enum-name:
14190 identifier
14192 typedef-name:
14193 identifier
14195 Returns a TYPE_DECL for the type. */
14197 static tree
14199 {
14200 tree type_decl;
14201 tree identifier;
14208 /* Look up the type-name. */
14212 {
14216 {
14217 /* We have found a type introduced by a using
14218 declaration at class scope that refers to a dependent
14219 type.
14221 using typename :: [opt] nested-name-specifier unqualified-id ;
14222 */
14228 }
14229 }
14233 {
14234 /* See if this is an Objective-C type. */
14239 }
14241 /* Issue an error if we did not find a type-name. */
14243 /* In Objective-C, we have the complication that class names are
14244 normally type names and start declarations (eg, the
14245 "NSObject" in "NSObject *object;"), but can be used in an
14246 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14247 is an expression. So, a classname followed by a dot is not a
14248 valid type-name. */
14251 {
14256 }
14257 /* Remember that the name was used in the definition of the
14258 current class so that we can check later to see if the
14259 meaning would have been different after the class was
14260 entirely defined. */
14266 }
14268 /* Parse an elaborated-type-specifier. Note that the grammar given
14269 here incorporates the resolution to DR68.
14271 elaborated-type-specifier:
14272 class-key :: [opt] nested-name-specifier [opt] identifier
14273 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14274 enum-key :: [opt] nested-name-specifier [opt] identifier
14275 typename :: [opt] nested-name-specifier identifier
14276 typename :: [opt] nested-name-specifier template [opt]
14277 template-id
14279 GNU extension:
14281 elaborated-type-specifier:
14282 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14283 class-key attributes :: [opt] nested-name-specifier [opt]
14284 template [opt] template-id
14285 enum attributes :: [opt] nested-name-specifier [opt] identifier
14287 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14288 declared `friend'. If IS_DECLARATION is TRUE, then this
14289 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14290 something is being declared.
14292 Returns the TYPE specified. */
14294 static tree
14298 {
14300 tree identifier;
14303 tree globalscope;
14306 /* See if we're looking at the `enum' keyword. */
14308 {
14309 /* Consume the `enum' token. */
14311 /* Remember that it's an enumeration type. */
14313 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14314 enums) is used here. */
14317 {
14321 /* Consume the `struct' or `class' and parse it anyway. */
14323 }
14324 /* Parse the attributes. */
14326 }
14327 /* Or, it might be `typename'. */
14329 RID_TYPENAME))
14330 {
14331 /* Consume the `typename' token. */
14333 /* Remember that it's a `typename' type. */
14335 }
14336 /* Otherwise it must be a class-key. */
14337 else
14338 {
14342 /* Parse the attributes. */
14344 }
14346 /* Look for the `::' operator. */
14349 /* Look for the nested-name-specifier. */
14351 {
14356 is_declaration))
14358 }
14359 else
14360 /* Even though `typename' is not present, the proposed resolution
14361 to Core Issue 180 says that in `class A<T>::B', `B' should be
14362 considered a type-name, even if `A<T>' is dependent. */
14367 is_declaration);
14368 /* For everything but enumeration types, consider a template-id.
14369 For an enumeration type, consider only a plain identifier. */
14371 {
14373 tree decl;
14375 /* Allow the `template' keyword. */
14377 /* If we didn't see `template', we don't know if there's a
14378 template-id or not. */
14381 /* Parse the template-id. */
14385 tag_type,
14386 is_declaration);
14387 /* If we didn't find a template-id, look for an ordinary
14388 identifier. */
14390 ;
14391 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14392 in effect, then we must assume that, upon instantiation, the
14393 template will correspond to a class. */
14397 typename_type,
14399 /* If the `typename' keyword is in effect and DECL is not a type
14400 decl, then type is non existent. */
14402 ;
14408 }
14411 {
14416 {
14419 }
14421 /* For a `typename', we needn't call xref_tag. */
14425 identifier,
14427 /* Look up a qualified name in the usual way. */
14429 {
14430 tree decl;
14431 tree ambiguous_decls;
14434 tag_type,
14441 /* If the lookup was ambiguous, an error will already have been
14442 issued. */
14446 /* If we are parsing friend declaration, DECL may be a
14447 TEMPLATE_DECL tree node here. However, we need to check
14448 whether this TEMPLATE_DECL results in valid code. Consider
14449 the following example:
14451 namespace N {
14452 template <class T> class C {};
14453 }
14454 class X {
14455 template <class T> friend class N::C; // #1, valid code
14456 };
14457 template <class T> class Y {
14458 friend class N::C; // #2, invalid code
14459 };
14461 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14462 name lookup of `N::C'. We see that friend declaration must
14463 be template for the code to be valid. Note that
14464 processing_template_decl does not work here since it is
14465 always 1 for the above two cases. */
14467 decl = (cp_parser_maybe_treat_template_as_class
14472 {
14475 identifier,
14478 }
14481 {
14485 allow_template);
14489 }
14491 /* Forward declarations of nested types, such as
14493 class C1::C2;
14494 class C1::C2::C3;
14496 are invalid unless all components preceding the final '::'
14497 are complete. If all enclosing types are complete, these
14498 declarations become merely pointless.
14500 Invalid forward declarations of nested types are errors
14501 caught elsewhere in parsing. Those that are pointless arrive
14502 here. */
14509 }
14510 else
14511 {
14512 /* An elaborated-type-specifier sometimes introduces a new type and
14513 sometimes names an existing type. Normally, the rule is that it
14514 introduces a new type only if there is not an existing type of
14515 the same name already in scope. For example, given:
14517 struct S {};
14518 void f() { struct S s; }
14520 the `struct S' in the body of `f' is the same `struct S' as in
14521 the global scope; the existing definition is used. However, if
14522 there were no global declaration, this would introduce a new
14523 local class named `S'.
14525 An exception to this rule applies to the following code:
14527 namespace N { struct S; }
14529 Here, the elaborated-type-specifier names a new type
14530 unconditionally; even if there is already an `S' in the
14531 containing scope this declaration names a new type.
14532 This exception only applies if the elaborated-type-specifier
14533 forms the complete declaration:
14535 [class.name]
14537 A declaration consisting solely of `class-key identifier ;' is
14538 either a redeclaration of the name in the current scope or a
14539 forward declaration of the identifier as a class name. It
14540 introduces the name into the current scope.
14542 We are in this situation precisely when the next token is a `;'.
14544 An exception to the exception is that a `friend' declaration does
14545 *not* name a new type; i.e., given:
14547 struct S { friend struct T; };
14549 `T' is not a new type in the scope of `S'.
14551 Also, `new struct S' or `sizeof (struct S)' never results in the
14552 definition of a new type; a new type can only be declared in a
14553 declaration context. */
14555 tag_scope ts;
14559 /* Friends have special name lookup rules. */
14563 CPP_SEMICOLON))
14564 /* This is a `class-key identifier ;' */
14566 else
14569 template_p =
14573 /* An unqualified name was used to reference this type, so
14574 there were no qualifying templates. */
14581 }
14582 }
14587 /* Allow attributes on forward declarations of classes. */
14589 {
14599 else
14602 }
14605 {
14606 /* Indicate whether this class was declared as a `class' or as a
14607 `struct'. */
14611 }
14613 /* A "<" cannot follow an elaborated type specifier. If that
14614 happens, the user was probably trying to form a template-id. */
14619 }
14621 /* Parse an enum-specifier.
14623 enum-specifier:
14624 enum-head { enumerator-list [opt] }
14625 enum-head { enumerator-list , } [C++0x]
14627 enum-head:
14628 enum-key identifier [opt] enum-base [opt]
14629 enum-key nested-name-specifier identifier enum-base [opt]
14631 enum-key:
14632 enum
14633 enum class [C++0x]
14634 enum struct [C++0x]
14636 enum-base: [C++0x]
14637 : type-specifier-seq
14639 opaque-enum-specifier:
14640 enum-key identifier enum-base [opt] ;
14642 GNU Extensions:
14643 enum-key attributes[opt] identifier [opt] enum-base [opt]
14644 { enumerator-list [opt] }attributes[opt]
14645 enum-key attributes[opt] identifier [opt] enum-base [opt]
14646 { enumerator-list, }attributes[opt] [C++0x]
14648 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14649 if the token stream isn't an enum-specifier after all. */
14651 static tree
14653 {
14654 tree identifier;
14656 tree prev_scope;
14658 tree attributes;
14671 /* Parse tentatively so that we can back up if we don't find a
14672 enum-specifier. */
14675 /* Caller guarantees that the current token is 'enum', an identifier
14676 possibly follows, and the token after that is an opening brace.
14677 If we don't have an identifier, fabricate an anonymous name for
14678 the enumeration being defined. */
14681 /* Parse the "class" or "struct", which indicates a scoped
14682 enumeration type in C++0x. */
14685 {
14689 /* Consume the `struct' or `class' token. */
14693 }
14697 /* Clear the qualification. */
14702 /* Figure out in what scope the declaration is being placed. */
14708 nested_name_specifier
14716 {
14717 tree name;
14721 enum_type,
14726 input_location);
14728 {
14731 {
14732 /* Are template enums allowed in ISO? */
14736 /* ignore a typename reference, for it will be solved by name
14737 in start_enum. */
14739 }
14740 }
14741 else
14744 }
14745 else
14746 {
14749 else
14750 {
14753 }
14754 }
14757 /* Check for the `:' that denotes a specified underlying type in C++0x.
14758 Note that a ':' could also indicate a bitfield width, however. */
14760 {
14761 cp_decl_specifier_seq type_specifiers;
14763 /* Consume the `:'. */
14766 /* Parse the type-specifier-seq. */
14771 /* At this point this is surely not elaborated type specifier. */
14780 /* If that didn't work, stop. */
14782 {
14787 }
14788 }
14790 /* Look for the `{' but don't consume it yet. */
14792 {
14794 {
14797 {
14800 }
14801 }
14802 /* An opaque-enum-specifier must have a ';' here. */
14805 {
14808 {
14811 }
14812 }
14813 }
14819 {
14821 {
14825 }
14827 {
14829 }
14830 }
14832 /* Issue an error message if type-definitions are forbidden here. */
14835 else
14836 /* Create the new type. We do this before consuming the opening
14837 brace so the enum will be recorded as being on the line of its
14838 tag (or the 'enum' keyword, if there is no tag). */
14842 /* If the next token is not '{' it is an opaque-enum-specifier or an
14843 elaborated-type-specifier. */
14845 {
14848 {
14849 /* The following catches invalid code such as:
14850 enum class S<int>::E { A, B, C }; */
14857 /* If that scope does not contain the scope in which the
14858 class was originally declared, the program is invalid. */
14860 {
14863 "declaration of %qD in namespace %qD which does not "
14866 else
14871 }
14872 }
14877 /* Consume the opening brace. */
14884 {
14888 }
14889 else
14890 {
14895 }
14899 /* If the next token is not '}', then there are some enumerators. */
14903 /* Consume the final '}'. */
14909 }
14910 else
14911 {
14912 /* If a ';' follows, then it is an opaque-enum-specifier
14913 and additional restrictions apply. */
14915 {
14922 }
14923 }
14925 /* Look for trailing attributes to apply to this enumeration, and
14926 apply them if appropriate. */
14928 {
14932 trailing_attr,
14934 }
14936 /* Finish up the enumeration. */
14938 {
14943 }
14946 {
14948 {
14951 }
14953 {
14955 }
14956 }
14957 out:
14960 }
14962 /* Parse an enumerator-list. The enumerators all have the indicated
14963 TYPE.
14965 enumerator-list:
14966 enumerator-definition
14967 enumerator-list , enumerator-definition */
14969 static void
14971 {
14973 {
14974 /* Parse an enumerator-definition. */
14977 /* If the next token is not a ',', we've reached the end of
14978 the list. */
14981 /* Otherwise, consume the `,' and keep going. */
14983 /* If the next token is a `}', there is a trailing comma. */
14985 {
14990 }
14991 }
14992 }
14994 /* Parse an enumerator-definition. The enumerator has the indicated
14995 TYPE.
14997 enumerator-definition:
14998 enumerator
14999 enumerator = constant-expression
15001 enumerator:
15002 identifier */
15004 static void
15006 {
15007 tree identifier;
15008 tree value;
15009 location_t loc;
15011 /* Save the input location because we are interested in the location
15012 of the identifier and not the location of the explicit value. */
15015 /* Look for the identifier. */
15020 /* If the next token is an '=', then there is an explicit value. */
15022 {
15023 /* Consume the `=' token. */
15025 /* Parse the value. */
15028 NULL);
15029 }
15030 else
15033 /* If we are processing a template, make sure the initializer of the
15034 enumerator doesn't contain any bare template parameter pack. */
15038 /* integral_constant_value will pull out this expression, so make sure
15039 it's folded as appropriate. */
15042 /* Create the enumerator. */
15044 }
15046 /* Parse a namespace-name.
15048 namespace-name:
15049 original-namespace-name
15050 namespace-alias
15052 Returns the NAMESPACE_DECL for the namespace. */
15054 static tree
15056 {
15057 tree identifier;
15058 tree namespace_decl;
15062 /* Get the name of the namespace. */
15067 /* Look up the identifier in the currently active scope. Look only
15068 for namespaces, due to:
15070 [basic.lookup.udir]
15072 When looking up a namespace-name in a using-directive or alias
15073 definition, only namespace names are considered.
15075 And:
15077 [basic.lookup.qual]
15079 During the lookup of a name preceding the :: scope resolution
15080 operator, object, function, and enumerator names are ignored.
15082 (Note that cp_parser_qualifying_entity only calls this
15083 function if the token after the name is the scope resolution
15084 operator.) */
15086 none_type,
15092 /* If it's not a namespace, issue an error. */
15095 {
15100 }
15103 }
15105 /* Parse a namespace-definition.
15107 namespace-definition:
15108 named-namespace-definition
15109 unnamed-namespace-definition
15111 named-namespace-definition:
15112 original-namespace-definition
15113 extension-namespace-definition
15115 original-namespace-definition:
15116 namespace identifier { namespace-body }
15118 extension-namespace-definition:
15119 namespace original-namespace-name { namespace-body }
15121 unnamed-namespace-definition:
15122 namespace { namespace-body } */
15124 static void
15126 {
15132 {
15136 }
15137 else
15140 /* Look for the `namespace' keyword. */
15143 /* Get the name of the namespace. We do not attempt to distinguish
15144 between an original-namespace-definition and an
15145 extension-namespace-definition at this point. The semantic
15146 analysis routines are responsible for that. */
15149 else
15152 /* Parse any specified attributes. */
15155 /* Look for the `{' to start the namespace. */
15157 /* Start the namespace. */
15160 /* "inline namespace" is equivalent to a stub namespace definition
15161 followed by a strong using directive. */
15163 {
15165 /* Set up namespace association. */
15169 /* Import the contents of the inline namespace. */
15173 }
15177 /* Parse the body of the namespace. */
15183 /* Finish the namespace. */
15185 /* Look for the final `}'. */
15187 }
15189 /* Parse a namespace-body.
15191 namespace-body:
15192 declaration-seq [opt] */
15194 static void
15196 {
15198 }
15200 /* Parse a namespace-alias-definition.
15202 namespace-alias-definition:
15203 namespace identifier = qualified-namespace-specifier ; */
15205 static void
15207 {
15208 tree identifier;
15209 tree namespace_specifier;
15213 /* Look for the `namespace' keyword. */
15215 /* Look for the identifier. */
15219 /* Look for the `=' token. */
15222 {
15224 /* Skip the definition. */
15229 }
15231 /* Look for the qualified-namespace-specifier. */
15232 namespace_specifier
15234 /* Look for the `;' token. */
15237 /* Register the alias in the symbol table. */
15239 }
15241 /* Parse a qualified-namespace-specifier.
15243 qualified-namespace-specifier:
15244 :: [opt] nested-name-specifier [opt] namespace-name
15246 Returns a NAMESPACE_DECL corresponding to the specified
15247 namespace. */
15249 static tree
15251 {
15252 /* Look for the optional `::'. */
15256 /* Look for the optional nested-name-specifier. */
15264 }
15266 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15267 access declaration.
15269 using-declaration:
15270 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15271 using :: unqualified-id ;
15273 access-declaration:
15274 qualified-id ;
15276 */
15278 static bool
15281 {
15285 tree decl;
15286 tree identifier;
15287 tree qscope;
15292 {
15295 }
15296 else
15297 {
15298 /* Look for the `using' keyword. */
15301 /* Peek at the next token. */
15303 /* See if it's `typename'. */
15305 {
15306 /* Remember that we've seen it. */
15308 /* Consume the `typename' token. */
15310 }
15311 }
15313 /* Look for the optional global scope qualification. */
15314 global_scope_p
15319 /* If we saw `typename', or didn't see `::', then there must be a
15320 nested-name-specifier present. */
15326 /* Otherwise, we could be in either of the two productions. In that
15327 case, treat the nested-name-specifier as optional. */
15328 else
15338 /* Something has already gone wrong; there's no need to parse
15339 further. Since an error has occurred, the return value of
15340 cp_parser_parse_definitely will be false, as required. */
15344 /* Parse the unqualified-id. */
15352 {
15357 }
15359 /* The function we call to handle a using-declaration is different
15360 depending on what scope we are in. */
15362 ;
15365 /* [namespace.udecl]
15367 A using declaration shall not name a template-id. */
15370 else
15371 {
15373 {
15374 /* Create the USING_DECL. */
15382 else
15383 /* Add it to the list of members in this class. */
15385 }
15386 else
15387 {
15389 identifier,
15399 else
15401 }
15402 }
15404 /* Look for the final `;'. */
15409 "access declarations are deprecated "
15410 "in favour of using-declarations; "
15414 }
15416 /* Parse an alias-declaration.
15418 alias-declaration:
15419 using identifier attribute-specifier-seq [opt] = type-id */
15421 static tree
15423 {
15425 location_t id_location;
15427 cp_decl_specifier_seq decl_specs;
15431 /* Look for the `using' keyword. */
15432 cp_token *using_token
15454 /* Now we are going to parse the type-id of the declaration. */
15456 /*
15457 [dcl.type]/3 says:
15459 "A type-specifier-seq shall not define a class or enumeration
15460 unless it appears in the type-id of an alias-declaration (7.1.3) that
15461 is not the declaration of a template-declaration."
15463 In other words, if we currently are in an alias template, the
15464 type-id should not define a type.
15466 So let's set parser->type_definition_forbidden_message in that
15467 case; cp_parser_check_type_definition (called by
15468 cp_parser_class_specifier) will then emit an error if a type is
15469 defined in the type-id. */
15471 {
15475 }
15479 /* Restore the error message if need be. */
15484 {
15487 }
15492 {
15495 }
15497 /* A typedef-name can also be introduced by an alias-declaration. The
15498 identifier following the using keyword becomes a typedef-name. It has
15499 the same semantics as if it were introduced by the typedef
15500 specifier. In particular, it does not define a new type and it shall
15501 not appear in the type-id. */
15506 {
15509 ds_attribute,
15510 attrs_token);
15511 }
15513 ds_typedef,
15514 using_token);
15516 ds_alias,
15517 using_token);
15526 else
15537 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15538 added into the symbol table; otherwise, return the TYPE_DECL. */
15542 {
15546 }
15549 }
15551 /* Parse a using-directive.
15553 using-directive:
15554 using namespace :: [opt] nested-name-specifier [opt]
15555 namespace-name ; */
15557 static void
15559 {
15560 tree namespace_decl;
15561 tree attribs;
15563 /* Look for the `using' keyword. */
15565 /* And the `namespace' keyword. */
15567 /* Look for the optional `::' operator. */
15569 /* And the optional nested-name-specifier. */
15575 /* Get the namespace being used. */
15577 /* And any specified attributes. */
15579 /* Update the symbol table. */
15581 /* Look for the final `;'. */
15583 }
15585 /* Parse an asm-definition.
15587 asm-definition:
15588 asm ( string-literal ) ;
15590 GNU Extension:
15592 asm-definition:
15593 asm volatile [opt] ( string-literal ) ;
15594 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15595 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15596 : asm-operand-list [opt] ) ;
15597 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15598 : asm-operand-list [opt]
15599 : asm-clobber-list [opt] ) ;
15600 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15601 : asm-clobber-list [opt]
15602 : asm-goto-list ) ; */
15604 static void
15606 {
15607 tree string;
15612 tree asm_stmt;
15620 /* Look for the `asm' keyword. */
15622 /* See if the next token is `volatile'. */
15625 {
15626 /* Remember that we saw the `volatile' keyword. */
15628 /* Consume the token. */
15630 }
15634 {
15635 /* Remember that we saw the `goto' keyword. */
15637 /* Consume the token. */
15639 }
15640 /* Look for the opening `('. */
15643 /* Look for the string. */
15646 {
15650 }
15652 /* If we're allowing GNU extensions, check for the extended assembly
15653 syntax. Unfortunately, the `:' tokens need not be separated by
15654 a space in C, and so, for compatibility, we tolerate that here
15655 too. Doing that means that we have to treat the `::' operator as
15656 two `:' tokens. */
15661 {
15666 /* The extended syntax was used. */
15669 /* Look for outputs. */
15671 {
15672 /* Consume the `:'. */
15674 /* Parse the output-operands. */
15676 CPP_COLON)
15678 CPP_SCOPE)
15680 CPP_CLOSE_PAREN)
15686 }
15687 /* If the next token is `::', there are no outputs, and the
15688 next token is the beginning of the inputs. */
15690 /* The inputs are coming next. */
15693 /* Look for inputs. */
15696 {
15697 /* Consume the `:' or `::'. */
15699 /* Parse the output-operands. */
15701 CPP_COLON)
15703 CPP_SCOPE)
15705 CPP_CLOSE_PAREN))
15710 }
15712 /* The clobbers are coming next. */
15715 /* Look for clobbers. */
15718 {
15720 /* Consume the `:' or `::'. */
15722 /* Parse the clobbers. */
15724 CPP_COLON)
15726 CPP_CLOSE_PAREN))
15728 }
15731 /* The labels are coming next. */
15734 /* Look for labels. */
15737 {
15739 /* Consume the `:' or `::'. */
15741 /* Parse the labels. */
15743 }
15747 }
15751 /* Look for the closing `)'. */
15759 {
15760 /* Create the ASM_EXPR. */
15762 {
15765 /* If the extended syntax was not used, mark the ASM_EXPR. */
15767 {
15773 }
15774 }
15775 else
15777 }
15778 }
15780 /* Declarators [gram.dcl.decl] */
15782 /* Parse an init-declarator.
15784 init-declarator:
15785 declarator initializer [opt]
15787 GNU Extension:
15789 init-declarator:
15790 declarator asm-specification [opt] attributes [opt] initializer [opt]
15792 function-definition:
15793 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15794 function-body
15795 decl-specifier-seq [opt] declarator function-try-block
15797 GNU Extension:
15799 function-definition:
15800 __extension__ function-definition
15802 TM Extension:
15804 function-definition:
15805 decl-specifier-seq [opt] declarator function-transaction-block
15807 The DECL_SPECIFIERS apply to this declarator. Returns a
15808 representation of the entity declared. If MEMBER_P is TRUE, then
15809 this declarator appears in a class scope. The new DECL created by
15810 this declarator is returned.
15812 The CHECKS are access checks that should be performed once we know
15813 what entity is being declared (and, therefore, what classes have
15814 befriended it).
15816 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15817 for a function-definition here as well. If the declarator is a
15818 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15819 be TRUE upon return. By that point, the function-definition will
15820 have been completely parsed.
15822 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15823 is FALSE.
15825 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15826 parsed declaration if it is an uninitialized single declarator not followed
15827 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15828 if present, will not be consumed. If returned, this declarator will be
15829 created with SD_INITIALIZED but will not call cp_finish_decl. */
15831 static tree
15840 {
15844 tree prefix_attributes;
15846 tree asm_specification;
15847 tree initializer;
15849 tree scope;
15851 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15852 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15853 "(...)". */
15862 /* Gather the attributes that were provided with the
15863 decl-specifiers. */
15866 /* Assume that this is not the declarator for a function
15867 definition. */
15871 /* Defer access checks while parsing the declarator; we cannot know
15872 what names are accessible until we know what is being
15873 declared. */
15876 /* Parse the declarator. */
15878 declarator
15882 member_p);
15883 /* Gather up the deferred checks. */
15886 /* If the DECLARATOR was erroneous, there's no need to go
15887 further. */
15891 /* Check that the number of template-parameter-lists is OK. */
15901 /* Figure out what scope the entity declared by the DECLARATOR is
15902 located in. `grokdeclarator' sometimes changes the scope, so
15903 we compute it now. */
15906 /* Perform any lookups in the declared type which were thought to be
15907 dependent, but are not in the scope of the declarator. */
15908 decl_specifiers->type
15911 /* If we're allowing GNU extensions, look for an
15912 asm-specification. */
15914 {
15915 /* Look for an asm-specification. */
15918 }
15919 else
15922 /* Look for attributes. */
15926 /* Peek at the next token. */
15928 /* Check to see if the token indicates the start of a
15929 function-definition. */
15932 {
15934 {
15935 /* If a function-definition should not appear here, issue an
15936 error message. */
15940 }
15941 else
15942 {
15943 location_t func_brace_location
15946 /* Neither attributes nor an asm-specification are allowed
15947 on a function-definition. */
15950 "an asm-specification is not allowed "
15955 /* This is a function-definition. */
15958 /* Parse the function definition. */
15961 decl_specifiers,
15962 declarator,
15963 prefix_attributes);
15964 else
15965 decl
15966 = (cp_parser_function_definition_from_specifiers_and_declarator
15970 {
15971 /* This is where the prologue starts... */
15974 }
15977 }
15978 }
15980 /* [dcl.dcl]
15982 Only in function declarations for constructors, destructors, and
15983 type conversions can the decl-specifier-seq be omitted.
15985 We explicitly postpone this check past the point where we handle
15986 function-definitions because we tolerate function-definitions
15987 that are missing their return types in some modes. */
15989 {
15993 }
15995 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15999 {
16007 {
16013 }
16014 }
16015 else
16016 {
16017 /* If the init-declarator isn't initialized and isn't followed by a
16018 `,' or `;', it's not a valid init-declarator. */
16021 {
16024 else
16025 {
16028 }
16029 }
16032 }
16034 /* Because start_decl has side-effects, we should only call it if we
16035 know we're going ahead. By this point, we know that we cannot
16036 possibly be looking at any other construct. */
16039 /* If the decl specifiers were bad, issue an error now that we're
16040 sure this was intended to be a declarator. Then continue
16041 declaring the variable(s), as int, to try to cut down on further
16042 errors. */
16045 {
16048 }
16050 /* Check to see whether or not this declaration is a friend. */
16053 /* Enter the newly declared entry in the symbol table. If we're
16054 processing a declaration in a class-specifier, we wait until
16055 after processing the initializer. */
16057 {
16064 /* Adjust location of decl if declarator->id_loc is more appropriate:
16065 set, and decl wasn't merged with another decl, in which case its
16066 location would be different from input_location, and more accurate. */
16071 }
16073 /* Enter the SCOPE. That way unqualified names appearing in the
16074 initializer will be looked up in SCOPE. */
16077 /* Perform deferred access control checks, now that we know in which
16078 SCOPE the declared entity resides. */
16080 {
16083 /* If the entity being declared is a function, pretend that we
16084 are in its scope. If it is a `friend', it may have access to
16085 things that would not otherwise be accessible. */
16087 {
16090 }
16092 /* Perform access checks for template parameters. */
16095 /* Perform the access control checks for the declarator and the
16096 decl-specifiers. */
16099 /* Restore the saved value. */
16102 }
16104 /* Parse the initializer. */
16109 {
16111 {
16115 else
16116 {
16117 /* If the declaration was erroneous, we don't really
16118 know what the user intended, so just silently
16119 consume the initializer. */
16127 }
16128 }
16129 else
16130 {
16131 /* We want to record the extra mangling scope for in-class
16132 initializers of class members and initializers of static data
16133 member templates. The former involves deferring
16134 parsing of the initializer until end of class as with default
16135 arguments. So right here we only handle the latter. */
16145 }
16146 }
16148 /* The old parser allows attributes to appear after a parenthesized
16149 initializer. Mark Mitchell proposed removing this functionality
16150 on the GCC mailing lists on 2002-08-13. This parser accepts the
16151 attributes -- but ignores them. */
16158 /* For an in-class declaration, use `grokfield' to create the
16159 declaration. */
16161 {
16163 {
16166 }
16170 prefix_attributes);
16173 }
16175 /* Finish processing the declaration. But, skip member
16176 declarations. */
16178 {
16181 asm_specification,
16182 /* If the initializer is in parentheses, then this is
16183 a direct-initialization, which means that an
16184 `explicit' constructor is OK. Otherwise, an
16185 `explicit' constructor cannot be used. */
16188 }
16191 /* Core issue #226 (C++0x only): A default template-argument
16192 shall not be specified in a friend class template
16193 declaration. */
16201 }
16203 /* Parse a declarator.
16205 declarator:
16206 direct-declarator
16207 ptr-operator declarator
16209 abstract-declarator:
16210 ptr-operator abstract-declarator [opt]
16211 direct-abstract-declarator
16213 GNU Extensions:
16215 declarator:
16216 attributes [opt] direct-declarator
16217 attributes [opt] ptr-operator declarator
16219 abstract-declarator:
16220 attributes [opt] ptr-operator abstract-declarator [opt]
16221 attributes [opt] direct-abstract-declarator
16223 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16224 detect constructor, destructor or conversion operators. It is set
16225 to -1 if the declarator is a name, and +1 if it is a
16226 function. Otherwise it is set to zero. Usually you just want to
16227 test for >0, but internally the negative value is used.
16229 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16230 a decl-specifier-seq unless it declares a constructor, destructor,
16231 or conversion. It might seem that we could check this condition in
16232 semantic analysis, rather than parsing, but that makes it difficult
16233 to handle something like `f()'. We want to notice that there are
16234 no decl-specifiers, and therefore realize that this is an
16235 expression, not a declaration.)
16237 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16238 the declarator is a direct-declarator of the form "(...)".
16240 MEMBER_P is true iff this declarator is a member-declarator. */
16244 cp_parser_declarator_kind dcl_kind,
16248 {
16251 cp_cv_quals cv_quals;
16252 tree class_type;
16255 /* Assume this is not a constructor, destructor, or type-conversion
16256 operator. */
16263 /* Check for the ptr-operator production. */
16265 /* Parse the ptr-operator. */
16271 /* If that worked, then we have a ptr-operator. */
16273 {
16274 /* If a ptr-operator was found, then this declarator was not
16275 parenthesized. */
16278 /* The dependent declarator is optional if we are parsing an
16279 abstract-declarator. */
16283 /* Parse the dependent declarator. */
16289 /* If we are parsing an abstract-declarator, we must handle the
16290 case where the dependent declarator is absent. */
16295 declarator = cp_parser_make_indirect_declarator
16297 }
16298 /* Everything else is a direct-declarator. */
16299 else
16300 {
16303 CPP_OPEN_PAREN);
16305 ctor_dtor_or_conv_p,
16306 member_p);
16307 }
16312 }
16314 /* Parse a direct-declarator or direct-abstract-declarator.
16316 direct-declarator:
16317 declarator-id
16318 direct-declarator ( parameter-declaration-clause )
16319 cv-qualifier-seq [opt]
16320 ref-qualifier [opt]
16321 exception-specification [opt]
16322 direct-declarator [ constant-expression [opt] ]
16323 ( declarator )
16325 direct-abstract-declarator:
16326 direct-abstract-declarator [opt]
16327 ( parameter-declaration-clause )
16328 cv-qualifier-seq [opt]
16329 ref-qualifier [opt]
16330 exception-specification [opt]
16331 direct-abstract-declarator [opt] [ constant-expression [opt] ]
16332 ( abstract-declarator )
16334 Returns a representation of the declarator. DCL_KIND is
16335 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
16336 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
16337 we are parsing a direct-declarator. It is
16338 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
16339 of ambiguity we prefer an abstract declarator, as per
16340 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
16341 cp_parser_declarator. */
16345 cp_parser_declarator_kind dcl_kind,
16348 {
16358 {
16359 /* Peek at the next token. */
16362 {
16363 /* This is either a parameter-declaration-clause, or a
16364 parenthesized declarator. When we know we are parsing a
16365 named declarator, it must be a parenthesized declarator
16366 if FIRST is true. For instance, `(int)' is a
16367 parameter-declaration-clause, with an omitted
16368 direct-abstract-declarator. But `((*))', is a
16369 parenthesized abstract declarator. Finally, when T is a
16370 template parameter `(T)' is a
16371 parameter-declaration-clause, and not a parenthesized
16372 named declarator.
16374 We first try and parse a parameter-declaration-clause,
16375 and then try a nested declarator (if FIRST is true).
16377 It is not an error for it not to be a
16378 parameter-declaration-clause, even when FIRST is
16379 false. Consider,
16381 int i (int);
16382 int i (3);
16384 The first is the declaration of a function while the
16385 second is the definition of a variable, including its
16386 initializer.
16388 Having seen only the parenthesis, we cannot know which of
16389 these two alternatives should be selected. Even more
16390 complex are examples like:
16392 int i (int (a));
16393 int i (int (3));
16395 The former is a function-declaration; the latter is a
16396 variable initialization.
16398 Thus again, we try a parameter-declaration-clause, and if
16399 that fails, we back out and return. */
16402 {
16403 tree params;
16406 tree t;
16408 /* In a member-declarator, the only valid interpretation
16409 of a parenthesis is the start of a
16410 parameter-declaration-clause. (It is invalid to
16411 initialize a static data member with a parenthesized
16412 initializer; only the "=" form of initialization is
16413 permitted.) */
16417 /* Consume the `('. */
16420 {
16421 /* If this is going to be an abstract declarator, we're
16422 in a declarator and we can't have default args. */
16425 }
16427 /* Inside the function parameter list, surrounding
16428 template-parameter-lists do not apply. */
16429 saved_num_template_parameter_lists
16435 /* Parse the parameter-declaration-clause. */
16438 parser->num_template_parameter_lists
16441 /* Consume the `)'. */
16444 /* If all went well, parse the cv-qualifier-seq,
16445 ref-qualifier and the exception-specification. */
16447 {
16448 cp_cv_quals cv_quals;
16449 cp_virt_specifiers virt_specifiers;
16450 cp_ref_qualifier ref_qual;
16451 tree exception_specification;
16452 tree late_return;
16453 tree attrs;
16463 /* Parse the cv-qualifier-seq. */
16465 /* Parse the ref-qualifier. */
16467 /* And the exception-specification. */
16468 exception_specification
16473 late_return = (cp_parser_late_return_type_opt
16476 /* Parse the virt-specifier-seq. */
16479 /* Create the function-declarator. */
16481 params,
16482 cv_quals,
16483 virt_specifiers,
16484 ref_qual,
16485 exception_specification,
16486 late_return);
16488 /* Any subsequent parameter lists are to do with
16489 return type, so are not those of the declared
16490 function. */
16492 }
16494 /* Remove the function parms from scope. */
16500 /* Repeat the main loop. */
16502 }
16504 /* If this is the first, we can try a parenthesized
16505 declarator. */
16507 {
16513 /* Consume the `('. */
16515 /* Parse the nested declarator. */
16518 declarator
16521 member_p);
16524 /* Expect a `)'. */
16531 }
16532 /* Otherwise, we must be done. */
16533 else
16535 }
16539 {
16540 /* Parse an array-declarator. */
16549 /* Consume the `['. */
16551 /* Peek at the next token. */
16553 /* If the next token is `]', then there is no
16554 constant-expression. */
16556 {
16559 bounds
16569 {
16570 /* Normally, the array bound must be an integral constant
16571 expression. However, as an extension, we allow VLAs
16572 in function scopes as long as they aren't part of a
16573 parameter declaration. */
16577 }
16579 {
16580 /* Remember this wasn't a constant-expression. */
16583 }
16584 }
16585 else
16587 /* Look for the closing `]'. */
16589 {
16592 }
16597 }
16599 {
16600 {
16601 tree qualifying_scope;
16602 tree unqualified_name;
16603 tree attrs;
16604 special_function_kind sfk;
16609 /* Parse a declarator-id */
16612 {
16615 /* If we see an ellipsis, we should be looking at a
16616 parameter pack. */
16618 {
16619 /* Consume the `...' */
16623 }
16624 }
16627 unqualified_name
16631 {
16635 {
16636 /* Check whether an error occurred. */
16639 /* We already consumed the ellipsis to mark a
16640 parameter pack, but we have no way to report it,
16641 so abort the tentative parse. We will be exiting
16642 immediately anyway. */
16644 }
16645 else
16651 && (qualifying_scope
16653 {
16656 }
16657 }
16662 {
16667 }
16673 {
16674 /* In the declaration of a member of a template class
16675 outside of the class itself, the SCOPE will sometimes
16676 be a TYPENAME_TYPE. For example, given:
16678 template <typename T>
16679 int S<T>::R::i = 3;
16681 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16682 this context, we must resolve S<T>::R to an ordinary
16683 type, rather than a typename type.
16685 The reason we normally avoid resolving TYPENAME_TYPEs
16686 is that a specialization of `S' might render
16687 `S<T>::R' not a type. However, if `S' is
16688 specialized, then this `i' will not be used, so there
16689 is no harm in resolving the types here. */
16690 tree type;
16692 /* Resolve the TYPENAME_TYPE. */
16695 /* If that failed, the declarator is invalid. */
16697 {
16700 "cannot define member of dependent typedef "
16702 else
16707 }
16709 }
16714 {
16715 tree class_type;
16720 else
16724 {
16727 {
16730 {
16734 "use %<%T::%D%> instead of %<%T::%D%> to "
16736 class_type,
16741 }
16742 else
16744 }
16745 else
16746 {
16747 /* We do not attempt to print the declarator
16748 here because we do not have enough
16749 information about its original syntactic
16750 form. */
16754 }
16755 }
16758 {
16764 for an anonymous type, even if the type
16765 got a name for linkage purposes. */
16768 class_type))
16769 {
16772 }
16780 }
16781 }
16783 unqualified_name,
16784 sfk);
16791 }
16793 handle_declarator:;
16796 {
16797 /* Any names that appear after the declarator-id for a
16798 member are looked up in the containing scope. */
16800 {
16801 /* But declarations with qualified-ids can't appear in a
16802 function. */
16805 }
16807 }
16811 /* Default args are only allowed on function
16812 declarations. */
16814 else
16818 }
16819 /* We're done. */
16820 else
16822 }
16824 /* For an abstract declarator, we might wind up with nothing at this
16825 point. That's an error; the declarator is not optional. */
16829 /* If we entered a scope, we must exit it now. */
16837 }
16839 /* Parse a ptr-operator.
16841 ptr-operator:
16842 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16843 * cv-qualifier-seq [opt]
16844 &
16845 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16846 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16848 GNU Extension:
16850 ptr-operator:
16851 & cv-qualifier-seq [opt]
16853 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16854 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16855 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16856 filled in with the TYPE containing the member. *CV_QUALS is
16857 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16858 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16859 Note that the tree codes returned by this function have nothing
16860 to do with the types of trees that will be eventually be created
16861 to represent the pointer or reference type being parsed. They are
16862 just constants with suggestive names. */
16863 static enum tree_code
16868 {
16873 /* Assume that it's not a pointer-to-member. */
16875 /* And that there are no cv-qualifiers. */
16878 /* Peek at the next token. */
16881 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16891 {
16892 /* Consume the `*', `&' or `&&'. */
16895 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16896 `&', if we are allowing GNU extensions. (The only qualifier
16897 that can legally appear after `&' is `restrict', but that is
16898 enforced during semantic analysis. */
16906 }
16907 else
16908 {
16909 /* Try the pointer-to-member case. */
16911 /* Look for the optional `::' operator. */
16914 /* Look for the nested-name specifier. */
16921 /* If we found it, and the next token is a `*', then we are
16922 indeed looking at a pointer-to-member operator. */
16925 {
16926 /* Indicate that the `*' operator was used. */
16934 else
16935 {
16936 /* The type of which the member is a member is given by the
16937 current SCOPE. */
16939 /* The next name will not be qualified. */
16943 /* Look for optional c++11 attributes. */
16947 /* Look for the optional cv-qualifier-seq. */
16949 }
16950 }
16951 /* If that didn't work we don't have a ptr-operator. */
16954 }
16957 }
16959 /* Parse an (optional) cv-qualifier-seq.
16961 cv-qualifier-seq:
16962 cv-qualifier cv-qualifier-seq [opt]
16964 cv-qualifier:
16965 const
16966 volatile
16968 GNU Extension:
16970 cv-qualifier:
16971 __restrict__
16973 Returns a bitmask representing the cv-qualifiers. */
16975 static cp_cv_quals
16977 {
16981 {
16983 cp_cv_quals cv_qualifier;
16985 /* Peek at the next token. */
16987 /* See if it's a cv-qualifier. */
16989 {
17005 }
17011 {
17014 }
17015 else
17016 {
17019 }
17020 }
17023 }
17025 /* Parse an (optional) ref-qualifier
17027 ref-qualifier:
17028 &
17029 &&
17031 Returns cp_ref_qualifier representing ref-qualifier. */
17033 static cp_ref_qualifier
17035 {
17039 {
17044 {
17056 }
17061 {
17064 }
17065 else
17066 {
17069 }
17070 }
17076 }
17078 /* Parse an (optional) virt-specifier-seq.
17080 virt-specifier-seq:
17081 virt-specifier virt-specifier-seq [opt]
17083 virt-specifier:
17084 override
17085 final
17087 Returns a bitmask representing the virt-specifiers. */
17089 static cp_virt_specifiers
17091 {
17095 {
17097 cp_virt_specifiers virt_specifier;
17099 /* Peek at the next token. */
17101 /* See if it's a virt-specifier-qualifier. */
17105 {
17108 }
17110 {
17113 }
17115 {
17117 }
17118 else
17122 {
17125 }
17126 else
17127 {
17130 }
17131 }
17133 }
17135 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
17136 is in scope even though it isn't real. */
17138 static void
17140 {
17141 tree this_parm;
17144 {
17145 /* We don't clear this between NSDMIs. Is it already what we want? */
17150 }
17153 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
17155 current_class_ref
17158 }
17160 /* Return true iff our current scope is a non-static data member
17161 initializer. */
17163 bool
17165 {
17166 /* We recognize NSDMI context by the context-less 'this' pointer set up
17167 by the function above. */
17171 }
17173 /* Parse a late-specified return type, if any. This is not a separate
17174 non-terminal, but part of a function declarator, which looks like
17176 -> trailing-type-specifier-seq abstract-declarator(opt)
17178 Returns the type indicated by the type-id.
17180 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
17181 function. */
17183 static tree
17185 {
17187 tree type;
17189 /* Peek at the next token. */
17191 /* A late-specified return type is indicated by an initial '->'. */
17195 /* Consume the ->. */
17201 {
17202 /* DR 1207: 'this' is in scope in the trailing return type. */
17204 }
17209 {
17212 }
17215 }
17217 /* Parse a declarator-id.
17219 declarator-id:
17220 id-expression
17221 :: [opt] nested-name-specifier [opt] type-name
17223 In the `id-expression' case, the value returned is as for
17224 cp_parser_id_expression if the id-expression was an unqualified-id.
17225 If the id-expression was a qualified-id, then a SCOPE_REF is
17226 returned. The first operand is the scope (either a NAMESPACE_DECL
17227 or TREE_TYPE), but the second is still just a representation of an
17228 unqualified-id. */
17230 static tree
17232 {
17233 tree id;
17234 /* The expression must be an id-expression. Assume that qualified
17235 names are the names of types so that:
17237 template <class T>
17238 int S<T>::R::i = 3;
17240 will work; we must treat `S<T>::R' as the name of a type.
17241 Similarly, assume that qualified names are templates, where
17242 required, so that:
17244 template <class T>
17245 int S<T>::R<T>::i = 3;
17247 will work, too. */
17253 optional_p);
17257 }
17259 /* Parse a type-id.
17261 type-id:
17262 type-specifier-seq abstract-declarator [opt]
17264 Returns the TYPE specified. */
17266 static tree
17269 {
17270 cp_decl_specifier_seq type_specifier_seq;
17273 /* Parse the type-specifier-seq. */
17275 is_trailing_return,
17280 /* There might or might not be an abstract declarator. */
17282 /* Look for the declarator. */
17283 abstract_declarator
17287 /* Check to see if there really was a declarator. */
17294 {
17295 /* A type-id with type 'auto' is only ok if the abstract declarator
17296 is a function declarator with a late-specified return type. */
17301 else
17302 {
17305 }
17306 }
17309 is_template_arg);
17310 }
17313 {
17315 }
17318 {
17319 tree r;
17321 parser->type_definition_forbidden_message
17326 }
17329 {
17331 }
17333 /* Parse a type-specifier-seq.
17335 type-specifier-seq:
17336 type-specifier type-specifier-seq [opt]
17338 GNU extension:
17340 type-specifier-seq:
17341 attributes type-specifier-seq [opt]
17343 If IS_DECLARATION is true, we are at the start of a "condition" or
17344 exception-declaration, so we might be followed by a declarator-id.
17346 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
17347 i.e. we've just seen "->".
17349 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
17351 static void
17356 {
17361 /* Clear the TYPE_SPECIFIER_SEQ. */
17364 /* In the context of a trailing return type, enum E { } is an
17365 elaborated-type-specifier followed by a function-body, not an
17366 enum-specifier. */
17370 /* Parse the type-specifiers and attributes. */
17372 {
17373 tree type_specifier;
17376 /* Check for attributes first. */
17378 {
17383 }
17385 /* record the token of the beginning of the type specifier seq,
17386 for error reporting purposes*/
17390 /* Look for the type-specifier. */
17392 flags,
17393 type_specifier_seq,
17395 NULL,
17398 {
17399 /* If the first type-specifier could not be found, this is not a
17400 type-specifier-seq at all. */
17402 {
17406 }
17407 /* If subsequent type-specifiers could not be found, the
17408 type-specifier-seq is complete. */
17410 }
17413 /* The standard says that a condition can be:
17415 type-specifier-seq declarator = assignment-expression
17417 However, given:
17419 struct S {};
17420 if (int S = ...)
17422 we should treat the "S" as a declarator, not as a
17423 type-specifier. The standard doesn't say that explicitly for
17424 type-specifier-seq, but it does say that for
17425 decl-specifier-seq in an ordinary declaration. Perhaps it
17426 would be clearer just to allow a decl-specifier-seq here, and
17427 then add a semantic restriction that if any decl-specifiers
17428 that are not type-specifiers appear, the program is invalid. */
17431 }
17432 }
17434 /* Parse a parameter-declaration-clause.
17436 parameter-declaration-clause:
17437 parameter-declaration-list [opt] ... [opt]
17438 parameter-declaration-list , ...
17440 Returns a representation for the parameter declarations. A return
17441 value of NULL indicates a parameter-declaration-clause consisting
17442 only of an ellipsis. */
17444 static tree
17446 {
17447 tree parameters;
17452 /* Peek at the next token. */
17454 /* Check for trivial parameter-declaration-clauses. */
17456 {
17457 /* Consume the `...' token. */
17460 }
17462 /* There are no parameters. */
17463 {
17464 #ifndef NO_IMPLICIT_EXTERN_C
17468 else
17469 #endif
17471 }
17472 /* Check for `(void)', too, which is a special case. */
17476 {
17477 /* Consume the `void' token. */
17479 /* There are no parameters. */
17481 }
17483 /* Parse the parameter-declaration-list. */
17485 /* If a parse error occurred while parsing the
17486 parameter-declaration-list, then the entire
17487 parameter-declaration-clause is erroneous. */
17491 /* Peek at the next token. */
17493 /* If it's a `,', the clause should terminate with an ellipsis. */
17495 {
17496 /* Consume the `,'. */
17498 /* Expect an ellipsis. */
17499 ellipsis_p
17501 }
17502 /* It might also be `...' if the optional trailing `,' was
17503 omitted. */
17505 {
17506 /* Consume the `...' token. */
17508 /* And remember that we saw it. */
17510 }
17511 else
17514 /* Finish the parameter list. */
17519 }
17521 /* Parse a parameter-declaration-list.
17523 parameter-declaration-list:
17524 parameter-declaration
17525 parameter-declaration-list , parameter-declaration
17527 Returns a representation of the parameter-declaration-list, as for
17528 cp_parser_parameter_declaration_clause. However, the
17529 `void_list_node' is never appended to the list. Upon return,
17530 *IS_ERROR will be true iff an error occurred. */
17532 static tree
17534 {
17540 /* Assume all will go well. */
17542 /* The special considerations that apply to a function within an
17543 unbraced linkage specifications do not apply to the parameters
17544 to the function. */
17545 saved_in_unbraced_linkage_specification_p
17549 /* Look for more parameters. */
17551 {
17555 /* Parse the parameter. */
17556 parameter
17561 /* We don't know yet if the enclosing context is deprecated, so wait
17562 and warn in grokparms if appropriate. */
17568 PARM,
17574 /* If a parse error occurred parsing the parameter declaration,
17575 then the entire parameter-declaration-list is erroneous. */
17577 {
17581 }
17591 {
17595 }
17597 /* Add the new parameter to the list. */
17601 /* Peek at the next token. */
17604 /* These are for Objective-C++ */
17607 /* The parameter-declaration-list is complete. */
17610 {
17613 /* Peek at the next token. */
17615 /* If it's an ellipsis, then the list is complete. */
17618 /* Otherwise, there must be more parameters. Consume the
17619 `,'. */
17621 /* When parsing something like:
17623 int i(float f, double d)
17625 we can tell after seeing the declaration for "f" that we
17626 are not looking at an initialization of a variable "i",
17627 but rather at the declaration of a function "i".
17629 Due to the fact that the parsing of template arguments
17630 (as specified to a template-id) requires backtracking we
17631 cannot use this technique when inside a template argument
17632 list. */
17636 /* However, a parameter-declaration of the form
17637 "foat(f)" (which is a valid declaration of a
17638 parameter "f") can also be interpreted as an
17639 expression (the conversion of "f" to "float"). */
17642 }
17643 else
17644 {
17652 }
17653 }
17655 parser->in_unbraced_linkage_specification_p
17659 }
17661 /* Parse a parameter declaration.
17663 parameter-declaration:
17664 decl-specifier-seq ... [opt] declarator
17665 decl-specifier-seq declarator = assignment-expression
17666 decl-specifier-seq ... [opt] abstract-declarator [opt]
17667 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17669 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17670 declares a template parameter. (In that case, a non-nested `>'
17671 token encountered during the parsing of the assignment-expression
17672 is not interpreted as a greater-than operator.)
17674 Returns a representation of the parameter, or NULL if an error
17675 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17676 true iff the declarator is of the form "(p)". */
17682 {
17684 cp_decl_specifier_seq decl_specifiers;
17686 tree default_argument;
17690 /* In a template parameter, `>' is not an operator.
17692 [temp.param]
17694 When parsing a default template-argument for a non-type
17695 template-parameter, the first non-nested `>' is taken as the end
17696 of the template parameter-list rather than a greater-than
17697 operator. */
17699 /* Type definitions may not appear in parameter types. */
17701 parser->type_definition_forbidden_message
17704 /* Parse the declaration-specifiers. */
17706 CP_PARSER_FLAGS_NONE,
17710 /* Complain about missing 'typename' or other invalid type names. */
17714 /* If an error occurred, there's no reason to attempt to parse the
17715 rest of the declaration. */
17717 {
17720 }
17722 /* Peek at the next token. */
17725 /* If the next token is a `)', `,', `=', `>', or `...', then there
17726 is no declarator. However, when variadic templates are enabled,
17727 there may be a declarator following `...'. */
17732 {
17736 }
17737 /* Otherwise, there should be a declarator. */
17738 else
17739 {
17743 /* After seeing a decl-specifier-seq, if the next token is not a
17744 "(", there is no possibility that the code is a valid
17745 expression. Therefore, if parsing tentatively, we commit at
17746 this point. */
17748 /* In an expression context, having seen:
17750 (int((char ...
17752 we cannot be sure whether we are looking at a
17753 function-type (taking a "char" as a parameter) or a cast
17754 of some object of type "char" to "int". */
17760 /* Parse the declarator. */
17763 CP_PARSER_DECLARATOR_EITHER,
17765 parenthesized_p,
17768 /* After the declarator, allow more attributes. */
17769 decl_specifiers.attributes
17772 }
17774 /* If the next token is an ellipsis, and we have not seen a
17775 declarator name, and the type of the declarator contains parameter
17776 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17777 a parameter pack expansion expression. Otherwise, leave the
17778 ellipsis for a C-style variadic function. */
17781 {
17792 {
17793 /* Consume the `...'. */
17797 /* Build a pack expansion type */
17800 else
17802 }
17803 }
17805 /* The restriction on defining new types applies only to the type
17806 of the parameter, not to the default argument. */
17809 /* If the next token is `=', then process a default argument. */
17811 {
17813 /* If we are defining a class, then the tokens that make up the
17814 default argument must be saved and processed later. */
17819 /* Outside of a class definition, we can just parse the
17820 assignment-expression. */
17821 else
17822 default_argument
17826 {
17829 else
17830 {
17832 "default arguments are only "
17835 }
17836 }
17840 {
17841 /* Find the name of the parameter pack. */
17848 template_parm_p
17854 else
17856 template_parm_p
17863 }
17864 }
17865 else
17869 declarator,
17870 default_argument);
17871 }
17873 /* Parse a default argument and return it.
17875 TEMPLATE_PARM_P is true if this is a default argument for a
17876 non-type template parameter. */
17877 static tree
17879 {
17885 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17886 set correctly. */
17889 /* Local variable names (and the `this' keyword) may not
17890 appear in a default argument. */
17893 /* Parse the assignment-expression. */
17896 default_argument
17906 }
17908 /* Parse a function-body.
17910 function-body:
17911 compound_statement */
17913 static void
17915 {
17917 }
17919 /* Parse a ctor-initializer-opt followed by a function-body. Return
17920 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17921 is true we are parsing a function-try-block. */
17923 static bool
17926 {
17934 /* Begin the function body. */
17936 /* Parse the optional ctor-initializer. */
17939 /* If we're parsing a constexpr constructor definition, we need
17940 to check that the constructor body is indeed empty. However,
17941 before we get to cp_parser_function_body lot of junk has been
17942 generated, so we can't just check that we have an empty block.
17943 Rather we take a snapshot of the outermost block, and check whether
17944 cp_parser_function_body changed its state. */
17946 {
17950 }
17951 /* Parse the function-body. */
17955 /* Finish the function body. */
17959 }
17961 /* Parse an initializer.
17963 initializer:
17964 = initializer-clause
17965 ( expression-list )
17967 Returns an expression representing the initializer. If no
17968 initializer is present, NULL_TREE is returned.
17970 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17971 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17972 set to TRUE if there is no initializer present. If there is an
17973 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17974 is set to true; otherwise it is set to false. */
17976 static tree
17979 {
17981 tree init;
17983 /* Peek at the next token. */
17986 /* Let our caller know whether or not this initializer was
17987 parenthesized. */
17989 /* Assume that the initializer is constant. */
17993 {
17994 /* Consume the `='. */
17996 /* Parse the initializer-clause. */
17998 }
18000 {
18005 non_constant_p);
18010 }
18012 {
18016 }
18017 else
18018 {
18019 /* Anything else is an error. */
18022 }
18025 }
18027 /* Parse an initializer-clause.
18029 initializer-clause:
18030 assignment-expression
18031 braced-init-list
18033 Returns an expression representing the initializer.
18035 If the `assignment-expression' production is used the value
18036 returned is simply a representation for the expression.
18038 Otherwise, calls cp_parser_braced_list. */
18040 static tree
18042 {
18043 tree initializer;
18045 /* Assume the expression is constant. */
18048 /* If it is not a `{', then we are looking at an
18049 assignment-expression. */
18051 {
18052 initializer
18055 non_constant_p);
18056 }
18057 else
18061 }
18063 /* Parse a brace-enclosed initializer list.
18065 braced-init-list:
18066 { initializer-list , [opt] }
18067 { }
18069 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
18070 the elements of the initializer-list (or NULL, if the last
18071 production is used). The TREE_TYPE for the CONSTRUCTOR will be
18072 NULL_TREE. There is no way to detect whether or not the optional
18073 trailing `,' was provided. NON_CONSTANT_P is as for
18074 cp_parser_initializer. */
18076 static tree
18078 {
18079 tree initializer;
18081 /* Consume the `{' token. */
18083 /* Create a CONSTRUCTOR to represent the braced-initializer. */
18085 /* If it's not a `}', then there is a non-trivial initializer. */
18087 {
18088 /* Parse the initializer list. */
18091 /* A trailing `,' token is allowed. */
18094 }
18095 else
18097 /* Now, there should be a trailing `}'. */
18101 }
18103 /* Parse an initializer-list.
18105 initializer-list:
18106 initializer-clause ... [opt]
18107 initializer-list , initializer-clause ... [opt]
18109 GNU Extension:
18111 initializer-list:
18112 designation initializer-clause ...[opt]
18113 initializer-list , designation initializer-clause ...[opt]
18115 designation:
18116 . identifier =
18117 identifier :
18118 [ constant-expression ] =
18120 Returns a vec of constructor_elt. The VALUE of each elt is an expression
18121 for the initializer. If the INDEX of the elt is non-NULL, it is the
18122 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
18123 as for cp_parser_initializer. */
18127 {
18130 /* Assume all of the expressions are constant. */
18133 /* Parse the rest of the list. */
18135 {
18137 tree designator;
18138 tree initializer;
18141 /* If the next token is an identifier and the following one is a
18142 colon, we are looking at the GNU designated-initializer
18143 syntax. */
18147 {
18148 /* Warn the user that they are using an extension. */
18151 /* Consume the identifier. */
18153 /* Consume the `:'. */
18155 }
18156 /* Also handle the C99 syntax, '. id ='. */
18161 {
18162 /* Warn the user that they are using an extension. */
18165 /* Consume the `.'. */
18167 /* Consume the identifier. */
18169 /* Consume the `='. */
18171 }
18172 /* Also handle C99 array designators, '[ const ] ='. */
18176 {
18177 /* In C++11, [ could start a lambda-introducer. */
18189 }
18190 else
18193 /* Parse the initializer. */
18196 /* If any clause is non-constant, so is the entire initializer. */
18200 /* If we have an ellipsis, this is an initializer pack
18201 expansion. */
18203 {
18204 /* Consume the `...'. */
18207 /* Turn the initializer into an initializer expansion. */
18209 }
18211 /* Add it to the vector. */
18214 /* If the next token is not a comma, we have reached the end of
18215 the list. */
18219 /* Peek at the next token. */
18221 /* If the next token is a `}', then we're still done. An
18222 initializer-clause can have a trailing `,' after the
18223 initializer-list and before the closing `}'. */
18227 /* Consume the `,' token. */
18229 }
18232 }
18234 /* Classes [gram.class] */
18236 /* Parse a class-name.
18238 class-name:
18239 identifier
18240 template-id
18242 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
18243 to indicate that names looked up in dependent types should be
18244 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
18245 keyword has been used to indicate that the name that appears next
18246 is a template. TAG_TYPE indicates the explicit tag given before
18247 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
18248 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
18249 is the class being defined in a class-head.
18251 Returns the TYPE_DECL representing the class. */
18253 static tree
18261 {
18262 tree decl;
18263 tree scope;
18268 /* All class-names start with an identifier. */
18271 {
18274 }
18276 /* PARSER->SCOPE can be cleared when parsing the template-arguments
18277 to a template-id, so we save it here. */
18282 /* Any name names a type if we're following the `typename' keyword
18283 in a qualified name where the enclosing scope is type-dependent. */
18286 /* Handle the common case (an identifier, but not a template-id)
18287 efficiently. */
18290 {
18294 /* Look for the identifier. */
18298 /* If the next token isn't an identifier, we are certainly not
18299 looking at a class-name. */
18302 /* If we know this is a type-name, there's no need to look it
18303 up. */
18306 else
18307 {
18308 tree ambiguous_decls;
18309 /* If we already know that this lookup is ambiguous, then
18310 we've already issued an error message; there's no reason
18311 to check again. */
18313 {
18316 }
18317 /* If the next token is a `::', then the name must be a type
18318 name.
18320 [basic.lookup.qual]
18322 During the lookup for a name preceding the :: scope
18323 resolution operator, object, function, and enumerator
18324 names are ignored. */
18327 /* Look up the name. */
18329 tag_type,
18332 check_dependency_p,
18336 {
18340 }
18341 }
18342 }
18343 else
18344 {
18345 /* Try a template-id. */
18347 check_dependency_p,
18348 tag_type,
18349 is_declaration);
18352 }
18356 /* If this is a typename, create a TYPENAME_TYPE. */
18358 {
18363 }
18367 /* Check to see that it is really the name of a class. */
18371 /* Situations like this:
18373 template <typename T> struct A {
18374 typename T::template X<int>::I i;
18375 };
18377 are problematic. Is `T::template X<int>' a class-name? The
18378 standard does not seem to be definitive, but there is no other
18379 valid interpretation of the following `::'. Therefore, those
18380 names are considered class-names. */
18381 {
18385 }
18389 /* In Objective-C 2.0, a classname followed by '.' starts a
18390 dot-syntax expression, and it's not a type-name. */
18402 }
18404 /* Parse a class-specifier.
18406 class-specifier:
18407 class-head { member-specification [opt] }
18409 Returns the TREE_TYPE representing the class. */
18411 static tree
18413 {
18414 tree type;
18428 /* Parse the class-head. */
18431 /* If the class-head was a semantic disaster, skip the entire body
18432 of the class. */
18434 {
18438 }
18440 /* Look for the `{'. */
18442 {
18445 }
18447 /* Issue an error message if type-definitions are forbidden here. */
18449 /* Remember that we are defining one more class. */
18451 /* Inside the class, surrounding template-parameter-lists do not
18452 apply. */
18453 saved_num_template_parameter_lists
18456 /* We are not in a function body. */
18459 /* Or in a loop. */
18462 /* Or in a switch. */
18465 /* We are not immediately inside an extern "lang" block. */
18466 saved_in_unbraced_linkage_specification_p
18470 /* Start the class. */
18472 {
18475 }
18479 /* If the type is erroneous, skip the entire body of the class. */
18481 else
18482 /* Parse the member-specification. */
18485 /* Look for the trailing `}'. */
18487 /* Look for trailing attributes to apply to this class. */
18495 /* We've finished a type definition. Check for the common syntax
18496 error of forgetting a semicolon after the definition. We need to
18497 be careful, as we can't just check for not-a-semicolon and be done
18498 with it; the user might have typed:
18500 class X { } c = ...;
18501 class X { } *p = ...;
18503 and so forth. Instead, enumerate all the possible tokens that
18504 might follow this production; if we don't see one of them, then
18505 complain and silently insert the semicolon. */
18506 {
18511 /* Don't try to parse c++11 attributes here. As per the
18512 grammar, that should be a task for
18513 cp_parser_decl_specifier_seq. */
18517 {
18528 /* While it's legal for type qualifiers and storage class
18529 specifiers to follow type definitions in the grammar, only
18530 compiler testsuites contain code like that. Assume that if
18531 we see such code, then what we're really seeing is a case
18532 like:
18534 class X { }
18535 const <type> var = ...;
18537 or
18539 class Y { }
18540 static <type> func (...) ...
18542 i.e. the qualifier or specifier applies to the next
18543 declaration. To do so, however, we need to look ahead one
18544 more token to see if *that* token is a type specifier.
18546 This code could be improved to handle:
18548 class Z { }
18549 static const <type> var = ...; */
18552 {
18555 /* Handling user-defined types here would be nice, but very
18556 tricky. */
18557 want_semicolon
18560 }
18564 }
18566 /* If we don't have a type, then something is very wrong and we
18567 shouldn't try to do anything clever. Likewise for not seeing the
18568 closing brace. */
18570 {
18571 cp_token_position prev
18582 else
18585 /* Unget one token and smash it to look as though we encountered
18586 a semicolon in the input stream. */
18591 }
18592 }
18594 /* If this class is not itself within the scope of another class,
18595 then we need to parse the bodies of all of the queued function
18596 definitions. Note that the queued functions defined in a class
18597 are not always processed immediately following the
18598 class-specifier for that class. Consider:
18600 struct A {
18601 struct B { void f() { sizeof (A); } };
18602 };
18604 If `f' were processed before the processing of `A' were
18605 completed, there would be no way to compute the size of `A'.
18606 Note that the nesting we are interested in here is lexical --
18607 not the semantic nesting given by TYPE_CONTEXT. In particular,
18608 for:
18610 struct A { struct B; };
18611 struct A::B { void f() { } };
18613 there is no need to delay the parsing of `A::B::f'. */
18615 {
18616 tree decl;
18623 /* In a first pass, parse default arguments to the functions.
18624 Then, in a second pass, parse the bodies of the functions.
18625 This two-phased approach handles cases like:
18627 struct S {
18628 void f() { g(); }
18629 void g(int i = 3);
18630 };
18632 */
18634 {
18636 /* If there are default arguments that have not yet been processed,
18637 take care of them now. */
18639 {
18644 }
18645 /* Make sure that any template parameters are in scope. */
18647 /* Parse the default argument expressions. */
18649 /* Remove any template parameters from the symbol table. */
18651 }
18653 /* Now parse any NSDMIs. */
18657 {
18659 {
18664 }
18667 }
18673 /* Now parse the body of the functions. */
18677 }
18679 /* Put back any saved access checks. */
18682 /* Restore saved state. */
18686 parser->num_template_parameter_lists
18688 parser->in_unbraced_linkage_specification_p
18692 }
18694 static tree
18696 {
18697 tree ret;
18702 }
18704 /* Parse a class-head.
18706 class-head:
18707 class-key identifier [opt] base-clause [opt]
18708 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18709 class-key nested-name-specifier [opt] template-id
18710 base-clause [opt]
18712 class-virt-specifier:
18713 final
18715 GNU Extensions:
18716 class-key attributes identifier [opt] base-clause [opt]
18717 class-key attributes nested-name-specifier identifier base-clause [opt]
18718 class-key attributes nested-name-specifier [opt] template-id
18719 base-clause [opt]
18721 Upon return BASES is initialized to the list of base classes (or
18722 NULL, if there are none) in the same form returned by
18723 cp_parser_base_clause.
18725 Returns the TYPE of the indicated class. Sets
18726 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18727 involving a nested-name-specifier was used, and FALSE otherwise.
18729 Returns error_mark_node if this is not a class-head.
18731 Returns NULL_TREE if the class-head is syntactically valid, but
18732 semantically invalid in a way that means we should skip the entire
18733 body of the class. */
18735 static tree
18738 {
18739 tree nested_name_specifier;
18743 tree attributes;
18744 tree bases;
18754 /* Assume no nested-name-specifier will be present. */
18756 /* Assume no template parameter lists will be used in defining the
18757 type. */
18761 /* Look for the class-key. */
18766 /* Parse the attributes. */
18769 /* If the next token is `::', that is invalid -- but sometimes
18770 people do try to write:
18772 struct ::S {};
18774 Handle this gracefully by accepting the extra qualifier, and then
18775 issuing an error about it later if this really is a
18776 class-head. If it turns out just to be an elaborated type
18777 specifier, remain silent. */
18783 /* Determine the name of the class. Begin by looking for an
18784 optional nested-name-specifier. */
18786 nested_name_specifier
18792 /* If there was a nested-name-specifier, then there *must* be an
18793 identifier. */
18795 {
18797 /* Although the grammar says `identifier', it really means
18798 `class-name' or `template-name'. You are only allowed to
18799 define a class that has already been declared with this
18800 syntax.
18802 The proposed resolution for Core Issue 180 says that wherever
18803 you see `class T::X' you should treat `X' as a type-name.
18805 It is OK to define an inaccessible class; for example:
18807 class A { class B; };
18808 class A::B {};
18810 We do not know if we will see a class-name, or a
18811 template-name. We look for a class-name first, in case the
18812 class-name is a template-id; if we looked for the
18813 template-name first we would stop after the template-name. */
18818 class_type,
18822 /* If that didn't work, ignore the nested-name-specifier. */
18824 {
18830 }
18831 /* If we could not find a corresponding TYPE, treat this
18832 declaration like an unqualified declaration. */
18835 /* Otherwise, count the number of templates used in TYPE and its
18836 containing scopes. */
18837 else
18838 {
18839 tree scope;
18851 }
18852 }
18853 /* Otherwise, the identifier is optional. */
18854 else
18855 {
18856 /* We don't know whether what comes next is a template-id,
18857 an identifier, or nothing at all. */
18859 /* Check for a template-id. */
18864 class_key,
18866 /* If that didn't work, it could still be an identifier. */
18868 {
18870 {
18873 }
18874 else
18876 }
18877 else
18878 {
18881 }
18882 }
18887 {
18889 class_key,
18891 }
18894 /* If it's not a `:' or a `{' then we can't really be looking at a
18895 class-head, since a class-head only appears as part of a
18896 class-specifier. We have to detect this situation before calling
18897 xref_tag, since that has irreversible side-effects. */
18899 {
18903 }
18905 /* At this point, we're going ahead with the class-specifier, even
18906 if some other problem occurs. */
18909 {
18914 }
18915 /* Issue the error about the overly-qualified name now. */
18917 {
18922 }
18924 {
18929 }
18931 {
18932 tree scope;
18934 /* Reject typedef-names in class heads. */
18936 {
18939 type);
18942 }
18944 /* Figure out in what scope the declaration is being placed. */
18946 /* If that scope does not contain the scope in which the
18947 class was originally declared, the program is invalid. */
18949 {
18952 "declaration of %qD in namespace %qD which does not "
18955 else
18961 }
18962 /* [dcl.meaning]
18964 A declarator-id shall not be qualified except for the
18965 definition of a ... nested class outside of its class
18966 ... [or] the definition or explicit instantiation of a
18967 class member of a namespace outside of its namespace. */
18969 {
18974 }
18975 }
18976 /* An explicit-specialization must be preceded by "template <>". If
18977 it is not, try to recover gracefully. */
18981 {
18985 /* Take the same action that would have been taken by
18986 cp_parser_explicit_specialization. */
18989 }
18990 /* There must be no "return" statements between this point and the
18991 end of this function; set "type "to the correct return value and
18992 use "goto done;" to return. */
18993 /* Make sure that the right number of template parameters were
18994 present. */
18998 {
18999 /* If something went wrong, there is no point in even trying to
19000 process the class-definition. */
19003 }
19005 /* Look up the type. */
19007 {
19011 {
19015 }
19016 else
19017 {
19020 }
19023 }
19025 {
19026 tree class_type;
19028 /* Given:
19030 template <typename T> struct S { struct T };
19031 template <typename T> struct S<T>::T { };
19033 we will get a TYPENAME_TYPE when processing the definition of
19034 `S::T'. We need to resolve it to the actual type before we
19035 try to define it. */
19037 {
19042 else
19043 {
19046 }
19047 }
19051 {
19054 }
19057 /* Enter the scope indicated by the nested-name-specifier. */
19059 /* Get the canonical version of this type. */
19063 {
19066 {
19069 }
19070 }
19074 }
19076 {
19077 /* If the class was unnamed, create a dummy name. */
19082 }
19084 /* Indicate whether this class was declared as a `class' or as a
19085 `struct'. */
19090 /* If this type was already complete, and we see another definition,
19091 that's an error. */
19093 {
19095 type);
19097 type);
19100 }
19105 {
19106 /* Apply attributes now, before any use of the class as a template
19107 argument in its base list. */
19110 }
19112 /* We will have entered the scope containing the class; the names of
19113 base classes should be looked up in that context. For example:
19115 struct A { struct B {}; struct C; };
19116 struct A::C : B {};
19118 is valid. */
19120 /* Get the list of base-classes, if there is one. */
19123 else
19126 /* If we're really defining a class, process the base classes.
19127 If they're invalid, fail. */
19132 done:
19133 /* Leave the scope given by the nested-name-specifier. We will
19134 enter the class scope itself while processing the members. */
19139 {
19142 }
19148 out:
19151 }
19153 /* Parse a class-key.
19155 class-key:
19156 class
19157 struct
19158 union
19160 Returns the kind of class-key specified, or none_type to indicate
19161 error. */
19163 static enum tag_types
19165 {
19169 /* Look for the class-key. */
19174 /* Check to see if the TOKEN is a class-key. */
19179 }
19181 /* Parse an (optional) member-specification.
19183 member-specification:
19184 member-declaration member-specification [opt]
19185 access-specifier : member-specification [opt] */
19187 static void
19189 {
19191 {
19195 /* Peek at the next token. */
19197 /* If it's a `}', or EOF then we've seen all the members. */
19203 /* See if this token is a keyword. */
19206 {
19210 /* Consume the access-specifier. */
19212 /* Remember which access-specifier is active. */
19214 /* Look for the `:'. */
19219 /* Accept #pragmas at class scope. */
19221 {
19224 }
19226 /* Otherwise, the next construction must be a
19227 member-declaration. */
19229 }
19230 }
19231 }
19233 /* Parse a member-declaration.
19235 member-declaration:
19236 decl-specifier-seq [opt] member-declarator-list [opt] ;
19237 function-definition ; [opt]
19238 :: [opt] nested-name-specifier template [opt] unqualified-id ;
19239 using-declaration
19240 template-declaration
19241 alias-declaration
19243 member-declarator-list:
19244 member-declarator
19245 member-declarator-list , member-declarator
19247 member-declarator:
19248 declarator pure-specifier [opt]
19249 declarator constant-initializer [opt]
19250 identifier [opt] : constant-expression
19252 GNU Extensions:
19254 member-declaration:
19255 __extension__ member-declaration
19257 member-declarator:
19258 declarator attributes [opt] pure-specifier [opt]
19259 declarator attributes [opt] constant-initializer [opt]
19260 identifier [opt] attributes [opt] : constant-expression
19262 C++0x Extensions:
19264 member-declaration:
19265 static_assert-declaration */
19267 static void
19269 {
19270 cp_decl_specifier_seq decl_specifiers;
19271 tree prefix_attributes;
19272 tree decl;
19281 /* Check for the `__extension__' keyword. */
19283 {
19284 /* Recurse. */
19286 /* Restore the old value of the PEDANTIC flag. */
19290 }
19292 /* Check for a template-declaration. */
19294 {
19295 /* An explicit specialization here is an error condition, and we
19296 expect the specialization handler to detect and report this. */
19300 else
19304 }
19306 /* Check for a using-declaration. */
19308 {
19310 {
19311 /* Parse the using-declaration. */
19315 }
19316 else
19317 {
19318 tree decl;
19322 /* Note that if we actually see the '=' token after the
19323 identifier, cp_parser_alias_declaration commits the
19324 tentative parse. In that case, we really expects an
19325 alias-declaration. Otherwise, we expect a using
19326 declaration. */
19327 alias_decl_expected =
19333 else
19337 }
19338 }
19340 /* Check for @defs. */
19342 {
19347 {
19352 }
19354 }
19356 /* If the next token is `static_assert' we have a static assertion. */
19358 {
19361 }
19368 /* Parse the decl-specifier-seq. */
19371 CP_PARSER_FLAGS_OPTIONAL,
19374 /* Check for an invalid type-name. */
19378 /* If there is no declarator, then the decl-specifier-seq should
19379 specify a type. */
19381 {
19382 /* If there was no decl-specifier-seq, and the next token is a
19383 `;', then we have something like:
19385 struct S { ; };
19387 [class.mem]
19389 Each member-declaration shall declare at least one member
19390 name of the class. */
19392 {
19396 }
19397 else
19398 {
19399 tree type;
19401 /* See if this declaration is a friend. */
19403 /* If there were decl-specifiers, check to see if there was
19404 a class-declaration. */
19407 /* Nested classes have already been added to the class, but
19408 a `friend' needs to be explicitly registered. */
19410 {
19411 /* If the `friend' keyword was present, the friend must
19412 be introduced with a class-key. */
19415 "in C++03 a class-key must be used "
19417 /* In this case:
19419 template <typename T> struct A {
19420 friend struct A<T>::B;
19421 };
19423 A<T>::B will be represented by a TYPENAME_TYPE, and
19424 therefore not recognized by check_tag_decl. */
19426 {
19430 }
19433 "friend declaration does not name a class or "
19435 else
19438 }
19439 /* If there is no TYPE, an error message will already have
19440 been issued. */
19442 ;
19443 /* An anonymous aggregate has to be handled specially; such
19444 a declaration really declares a data member (with a
19445 particular type), as opposed to a nested class. */
19447 {
19448 /* C++11 9.5/6. */
19451 "a storage class on an anonymous aggregate "
19454 /* Remove constructors and such from TYPE, now that we
19455 know it is an anonymous aggregate. */
19457 /* And make the corresponding data member. */
19460 /* Add it to the class. */
19462 }
19463 else
19464 cp_parser_check_access_in_redeclaration
19467 }
19468 }
19469 else
19470 {
19473 /* Clear attributes from the decl_specifiers but keep them
19474 around as prefix attributes that apply them to the entity
19475 being declared. */
19479 /* See if these declarations will be friends. */
19482 /* Keep going until we hit the `;' at the end of the
19483 declaration. */
19485 {
19487 tree first_attribute;
19489 /* Peek at the next token. */
19492 /* Check for a bitfield declaration. */
19497 {
19498 tree identifier;
19499 tree width;
19501 /* Get the name of the bitfield. Note that we cannot just
19502 check TOKEN here because it may have been invalidated by
19503 the call to cp_lexer_peek_nth_token above. */
19506 else
19509 /* Consume the `:' token. */
19511 /* Get the width of the bitfield. */
19512 width
19515 NULL);
19517 /* Look for attributes that apply to the bitfield. */
19519 /* Remember which attributes are prefix attributes and
19520 which are not. */
19522 /* Combine the attributes. */
19525 /* Create the bitfield declaration. */
19528 identifier,
19529 sfk_none)
19532 width,
19533 attributes);
19534 }
19535 else
19536 {
19538 tree initializer;
19539 tree asm_specification;
19542 /* Parse the declarator. */
19543 declarator
19549 /* If something went wrong parsing the declarator, make sure
19550 that we at least consume some tokens. */
19552 {
19553 /* Skip to the end of the statement. */
19555 /* If the next token is not a semicolon, that is
19556 probably because we just skipped over the body of
19557 a function. So, we consume a semicolon if
19558 present, but do not issue an error message if it
19559 is not present. */
19561 CPP_SEMICOLON))
19564 }
19567 cp_parser_check_for_definition_in_return_type
19571 /* Look for an asm-specification. */
19573 /* Look for attributes that apply to the declaration. */
19575 /* Remember which attributes are prefix attributes and
19576 which are not. */
19578 /* Combine the attributes. */
19581 /* If it's an `=', then we have a constant-initializer or a
19582 pure-specifier. It is not correct to parse the
19583 initializer before registering the member declaration
19584 since the member declaration should be in scope while
19585 its initializer is processed. However, the rest of the
19586 front end does not yet provide an interface that allows
19587 us to handle this correctly. */
19589 {
19590 /* In [class.mem]:
19592 A pure-specifier shall be used only in the declaration of
19593 a virtual function.
19595 A member-declarator can contain a constant-initializer
19596 only if it declares a static member of integral or
19597 enumeration type.
19599 Therefore, if the DECLARATOR is for a function, we look
19600 for a pure-specifier; otherwise, we look for a
19601 constant-initializer. When we call `grokfield', it will
19602 perform more stringent semantics checks. */
19614 {
19616 /* Don't require a constant rvalue in C++11, since we
19617 might want a reference constant. We'll enforce
19618 constancy later. */
19620 /* Parse the initializer. */
19623 }
19624 else
19625 /* Parse the initializer. */
19627 }
19630 {
19634 else
19636 }
19637 /* Otherwise, there is no initializer. */
19638 else
19641 /* See if we are probably looking at a function
19642 definition. We are certainly not looking at a
19643 member-declarator. Calling `grokfield' has
19644 side-effects, so we must not do it unless we are sure
19645 that we are looking at a member-declarator. */
19648 {
19649 /* The grammar does not allow a pure-specifier to be
19650 used when a member function is defined. (It is
19651 possible that this fact is an oversight in the
19652 standard, since a pure function may be defined
19653 outside of the class-specifier. */
19659 declarator,
19660 attributes);
19661 /* If the member was not a friend, declare it here. */
19664 /* Peek at the next token. */
19666 /* If the next token is a semicolon, consume it. */
19670 }
19671 else
19674 /* Create the declaration. */
19677 asm_specification,
19678 attributes);
19679 }
19681 /* Reset PREFIX_ATTRIBUTES. */
19687 /* If there is any qualification still in effect, clear it
19688 now; we will be starting fresh with the next declarator. */
19692 /* If it's a `,', then there are more declarators. */
19694 {
19697 {
19701 }
19702 }
19703 /* If the next token isn't a `;', then we have a parse error. */
19705 CPP_SEMICOLON))
19706 {
19707 /* The next token might be a ways away from where the
19708 actual semicolon is missing. Find the previous token
19709 and use that for our error position. */
19714 /* Assume that the user meant to provide a semicolon. If
19715 we were to cp_parser_skip_to_end_of_statement, we might
19716 skip to a semicolon inside a member function definition
19717 and issue nonsensical error messages. */
19719 }
19722 {
19723 /* Add DECL to the list of members. */
19732 /* Add DECL to the queue of NSDMI to be parsed later. */
19734 }
19738 }
19739 }
19742 out:
19744 }
19746 /* Parse a pure-specifier.
19748 pure-specifier:
19749 = 0
19751 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19752 Otherwise, ERROR_MARK_NODE is returned. */
19754 static tree
19756 {
19759 /* Look for the `=' token. */
19762 /* Look for the `0' token. */
19771 /* Accept = default or = delete in c++0x mode. */
19774 {
19777 }
19779 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19781 {
19786 }
19788 {
19791 }
19794 }
19796 /* Parse a constant-initializer.
19798 constant-initializer:
19799 = constant-expression
19801 Returns a representation of the constant-expression. */
19803 static tree
19805 {
19806 /* Look for the `=' token. */
19810 /* It is invalid to write:
19812 struct S { static const int i = { 7 }; };
19814 */
19816 {
19819 /* Consume the opening brace. */
19821 /* Skip the initializer. */
19823 /* Look for the trailing `}'. */
19827 }
19831 NULL);
19832 }
19834 /* Derived classes [gram.class.derived] */
19836 /* Parse a base-clause.
19838 base-clause:
19839 : base-specifier-list
19841 base-specifier-list:
19842 base-specifier ... [opt]
19843 base-specifier-list , base-specifier ... [opt]
19845 Returns a TREE_LIST representing the base-classes, in the order in
19846 which they were declared. The representation of each node is as
19847 described by cp_parser_base_specifier.
19849 In the case that no bases are specified, this function will return
19850 NULL_TREE, not ERROR_MARK_NODE. */
19852 static tree
19854 {
19857 /* Look for the `:' that begins the list. */
19860 /* Scan the base-specifier-list. */
19862 {
19864 tree base;
19867 /* Look for the base-specifier. */
19869 /* Look for the (optional) ellipsis. */
19871 {
19872 /* Consume the `...'. */
19876 }
19878 /* Add BASE to the front of the list. */
19880 {
19882 /* Make this a pack expansion type. */
19886 {
19889 }
19890 }
19891 /* Peek at the next token. */
19893 /* If it's not a comma, then the list is complete. */
19896 /* Consume the `,'. */
19898 }
19900 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19901 base class had a qualified name. However, the next name that
19902 appears is certainly not qualified. */
19908 }
19910 /* Parse a base-specifier.
19912 base-specifier:
19913 :: [opt] nested-name-specifier [opt] class-name
19914 virtual access-specifier [opt] :: [opt] nested-name-specifier
19915 [opt] class-name
19916 access-specifier virtual [opt] :: [opt] nested-name-specifier
19917 [opt] class-name
19919 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19920 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19921 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19922 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19924 static tree
19926 {
19934 tree type;
19936 /* Process the optional `virtual' and `access-specifier'. */
19938 {
19939 /* Peek at the next token. */
19941 /* Process `virtual'. */
19943 {
19945 /* If `virtual' appears more than once, issue an error. */
19947 {
19951 }
19955 /* Consume the `virtual' token. */
19963 /* If more than one access specifier appears, issue an
19964 error. */
19967 {
19971 }
19975 /* Consume the access-specifier. */
19983 }
19984 }
19985 /* It is not uncommon to see programs mechanically, erroneously, use
19986 the 'typename' keyword to denote (dependent) qualified types
19987 as base classes. */
19989 {
19994 else
19996 "keyword %<typename%> not allowed in this context "
19999 }
20001 /* Look for the optional `::' operator. */
20003 /* Look for the nested-name-specifier. The simplest way to
20004 implement:
20006 [temp.res]
20008 The keyword `typename' is not permitted in a base-specifier or
20009 mem-initializer; in these contexts a qualified name that
20010 depends on a template-parameter is implicitly assumed to be a
20011 type name.
20013 is to pretend that we have seen the `typename' keyword at this
20014 point. */
20018 typename_type,
20020 /* If the base class is given by a qualified name, assume that names
20021 we see are type names or templates, as appropriate. */
20027 /* DR 950 allows decltype as a base-specifier. */
20029 else
20030 {
20031 /* Otherwise, look for the class-name. */
20033 class_scope_p,
20034 template_p,
20035 typename_type,
20040 }
20046 }
20048 /* Exception handling [gram.exception] */
20050 /* Parse an (optional) noexcept-specification.
20052 noexcept-specification:
20053 noexcept ( constant-expression ) [opt]
20055 If no noexcept-specification is present, returns NULL_TREE.
20056 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
20057 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
20058 there are no parentheses. CONSUMED_EXPR will be set accordingly.
20059 Otherwise, returns a noexcept specification unless RETURN_COND is true,
20060 in which case a boolean condition is returned instead. */
20062 static tree
20067 {
20071 /* Peek at the next token. */
20074 /* Is it a noexcept-specification? */
20076 {
20077 tree expr;
20081 {
20085 {
20086 /* Types may not be defined in an exception-specification. */
20088 parser->type_definition_forbidden_message
20093 /* Restore the saved message. */
20095 }
20096 else
20097 {
20100 }
20103 }
20104 else
20105 {
20109 }
20111 /* We cannot build a noexcept-spec right away because this will check
20112 that expr is a constexpr. */
20115 else
20117 }
20118 else
20120 }
20122 /* Parse an (optional) exception-specification.
20124 exception-specification:
20125 throw ( type-id-list [opt] )
20127 Returns a TREE_LIST representing the exception-specification. The
20128 TREE_VALUE of each node is a type. */
20130 static tree
20132 {
20134 tree type_id_list;
20137 /* Peek at the next token. */
20140 /* Is it a noexcept-specification? */
20146 /* If it's not `throw', then there's no exception-specification. */
20150 #if 0
20151 /* Enable this once a lot of code has transitioned to noexcept? */
20155 #endif
20157 /* Consume the `throw'. */
20160 /* Look for the `('. */
20163 /* Peek at the next token. */
20165 /* If it's not a `)', then there is a type-id-list. */
20167 {
20168 /* Types may not be defined in an exception-specification. */
20170 parser->type_definition_forbidden_message
20172 /* Parse the type-id-list. */
20174 /* Restore the saved message. */
20176 }
20177 else
20180 /* Look for the `)'. */
20184 }
20186 /* Parse an (optional) type-id-list.
20188 type-id-list:
20189 type-id ... [opt]
20190 type-id-list , type-id ... [opt]
20192 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
20193 in the order that the types were presented. */
20195 static tree
20197 {
20201 {
20203 tree type;
20205 /* Get the next type-id. */
20207 /* Parse the optional ellipsis. */
20209 {
20210 /* Consume the `...'. */
20213 /* Turn the type into a pack expansion expression. */
20215 }
20216 /* Add it to the list. */
20218 /* Peek at the next token. */
20220 /* If it is not a `,', we are done. */
20223 /* Consume the `,'. */
20225 }
20228 }
20230 /* Parse a try-block.
20232 try-block:
20233 try compound-statement handler-seq */
20235 static tree
20237 {
20238 tree try_block;
20248 }
20250 /* Parse a function-try-block.
20252 function-try-block:
20253 try ctor-initializer [opt] function-body handler-seq */
20255 static bool
20257 {
20258 tree compound_stmt;
20259 tree try_block;
20262 /* Look for the `try' keyword. */
20265 /* Let the rest of the front end know where we are. */
20267 /* Parse the function-body. */
20268 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
20270 /* We're done with the `try' part. */
20272 /* Parse the handlers. */
20274 /* We're done with the handlers. */
20278 }
20280 /* Parse a handler-seq.
20282 handler-seq:
20283 handler handler-seq [opt] */
20285 static void
20287 {
20289 {
20292 /* Parse the handler. */
20294 /* Peek at the next token. */
20296 /* If it's not `catch' then there are no more handlers. */
20299 }
20300 }
20302 /* Parse a handler.
20304 handler:
20305 catch ( exception-declaration ) compound-statement */
20307 static void
20309 {
20310 tree handler;
20311 tree declaration;
20321 }
20323 /* Parse an exception-declaration.
20325 exception-declaration:
20326 type-specifier-seq declarator
20327 type-specifier-seq abstract-declarator
20328 type-specifier-seq
20329 ...
20331 Returns a VAR_DECL for the declaration, or NULL_TREE if the
20332 ellipsis variant is used. */
20334 static tree
20336 {
20337 cp_decl_specifier_seq type_specifiers;
20341 /* If it's an ellipsis, it's easy to handle. */
20343 {
20344 /* Consume the `...' token. */
20347 }
20349 /* Types may not be defined in exception-declarations. */
20351 parser->type_definition_forbidden_message
20354 /* Parse the type-specifier-seq. */
20358 /* If it's a `)', then there is no declarator. */
20361 else
20367 /* Restore the saved message. */
20374 }
20376 /* Parse a throw-expression.
20378 throw-expression:
20379 throw assignment-expression [opt]
20381 Returns a THROW_EXPR representing the throw-expression. */
20383 static tree
20385 {
20386 tree expression;
20391 /* Figure out whether or not there is an assignment-expression
20392 following the "throw" keyword. */
20400 else
20405 }
20407 /* GNU Extensions */
20409 /* Parse an (optional) asm-specification.
20411 asm-specification:
20412 asm ( string-literal )
20414 If the asm-specification is present, returns a STRING_CST
20415 corresponding to the string-literal. Otherwise, returns
20416 NULL_TREE. */
20418 static tree
20420 {
20422 tree asm_specification;
20424 /* Peek at the next token. */
20426 /* If the next token isn't the `asm' keyword, then there's no
20427 asm-specification. */
20431 /* Consume the `asm' token. */
20433 /* Look for the `('. */
20436 /* Look for the string-literal. */
20439 /* Look for the `)'. */
20443 }
20445 /* Parse an asm-operand-list.
20447 asm-operand-list:
20448 asm-operand
20449 asm-operand-list , asm-operand
20451 asm-operand:
20452 string-literal ( expression )
20453 [ string-literal ] string-literal ( expression )
20455 Returns a TREE_LIST representing the operands. The TREE_VALUE of
20456 each node is the expression. The TREE_PURPOSE is itself a
20457 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
20458 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
20459 is a STRING_CST for the string literal before the parenthesis. Returns
20460 ERROR_MARK_NODE if any of the operands are invalid. */
20462 static tree
20464 {
20469 {
20470 tree string_literal;
20471 tree expression;
20472 tree name;
20475 {
20476 /* Consume the `[' token. */
20478 /* Read the operand name. */
20483 /* Look for the closing `]'. */
20485 }
20486 else
20488 /* Look for the string-literal. */
20491 /* Look for the `('. */
20493 /* Parse the expression. */
20495 /* Look for the `)'. */
20503 /* Add this operand to the list. */
20505 expression,
20506 asm_operands);
20507 /* If the next token is not a `,', there are no more
20508 operands. */
20511 /* Consume the `,'. */
20513 }
20516 }
20518 /* Parse an asm-clobber-list.
20520 asm-clobber-list:
20521 string-literal
20522 asm-clobber-list , string-literal
20524 Returns a TREE_LIST, indicating the clobbers in the order that they
20525 appeared. The TREE_VALUE of each node is a STRING_CST. */
20527 static tree
20529 {
20533 {
20534 tree string_literal;
20536 /* Look for the string literal. */
20538 /* Add it to the list. */
20540 /* If the next token is not a `,', then the list is
20541 complete. */
20544 /* Consume the `,' token. */
20546 }
20549 }
20551 /* Parse an asm-label-list.
20553 asm-label-list:
20554 identifier
20555 asm-label-list , identifier
20557 Returns a TREE_LIST, indicating the labels in the order that they
20558 appeared. The TREE_VALUE of each node is a label. */
20560 static tree
20562 {
20566 {
20569 /* Look for the identifier. */
20572 {
20575 {
20581 }
20582 }
20583 /* If the next token is not a `,', then the list is
20584 complete. */
20587 /* Consume the `,' token. */
20589 }
20592 }
20594 /* Return TRUE iff the next tokens in the stream are possibly the
20595 beginning of a GNU extension attribute. */
20597 static bool
20599 {
20601 }
20603 /* Return TRUE iff the next tokens in the stream are possibly the
20604 beginning of a standard C++-11 attribute specifier. */
20606 static bool
20608 {
20610 }
20612 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20613 beginning of a standard C++-11 attribute specifier. */
20615 static bool
20617 {
20625 }
20627 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20628 beginning of a GNU extension attribute. */
20630 static bool
20632 {
20636 }
20638 /* Return true iff the next tokens can be the beginning of either a
20639 GNU attribute list, or a standard C++11 attribute sequence. */
20641 static bool
20643 {
20646 }
20648 /* Return true iff the next Nth tokens can be the beginning of either
20649 a GNU attribute list, or a standard C++11 attribute sequence. */
20651 static bool
20653 {
20656 }
20658 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
20659 of GNU attributes, or return NULL. */
20661 static tree
20663 {
20667 }
20669 /* Parse an (optional) series of attributes.
20671 attributes:
20672 attributes attribute
20674 attribute:
20675 __attribute__ (( attribute-list [opt] ))
20677 The return value is as for cp_parser_gnu_attribute_list. */
20679 static tree
20681 {
20685 {
20687 tree attribute_list;
20690 /* Peek at the next token. */
20692 /* If it's not `__attribute__', then we're done. */
20696 /* Consume the `__attribute__' keyword. */
20698 /* Look for the two `(' tokens. */
20702 /* Peek at the next token. */
20705 /* Parse the attribute-list. */
20707 else
20708 /* If the next token is a `)', then there is no attribute
20709 list. */
20712 /* Look for the two `)' tokens. */
20720 /* Add these new attributes to the list. */
20722 }
20725 }
20727 /* Parse a GNU attribute-list.
20729 attribute-list:
20730 attribute
20731 attribute-list , attribute
20733 attribute:
20734 identifier
20735 identifier ( identifier )
20736 identifier ( identifier , expression-list )
20737 identifier ( expression-list )
20739 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20740 to an attribute. The TREE_PURPOSE of each node is the identifier
20741 indicating which attribute is in use. The TREE_VALUE represents
20742 the arguments, if any. */
20744 static tree
20746 {
20752 {
20754 tree identifier;
20755 tree attribute;
20757 /* Look for the identifier. We also allow keywords here; for
20758 example `__attribute__ ((const))' is legal. */
20762 {
20765 /* Consume the token. */
20768 /* Save away the identifier that indicates which attribute
20769 this is. */
20771 /* For keywords, use the canonical spelling, not the
20772 parsed identifier. */
20778 /* Peek at the next token. */
20780 /* If it's an `(', then parse the attribute arguments. */
20782 {
20786 vec = cp_parser_parenthesized_expression_list
20792 else
20793 {
20796 }
20797 /* Save the arguments away. */
20799 }
20802 {
20803 /* Add this attribute to the list. */
20806 }
20809 }
20810 /* Now, look for more attributes. If the next token isn't a
20811 `,', we're done. */
20815 /* Consume the comma and keep going. */
20817 }
20820 /* We built up the list in reverse order. */
20822 }
20824 /* Parse a standard C++11 attribute.
20826 The returned representation is a TREE_LIST which TREE_PURPOSE is
20827 the scoped name of the attribute, and the TREE_VALUE is its
20828 arguments list.
20830 Note that the scoped name of the attribute is itself a TREE_LIST
20831 which TREE_PURPOSE is the namespace of the attribute, and
20832 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
20833 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
20834 and which TREE_PURPOSE is directly the attribute name.
20836 Clients of the attribute code should use get_attribute_namespace
20837 and get_attribute_name to get the actual namespace and name of
20838 attributes, regardless of their being GNU or C++11 attributes.
20840 attribute:
20841 attribute-token attribute-argument-clause [opt]
20843 attribute-token:
20844 identifier
20845 attribute-scoped-token
20847 attribute-scoped-token:
20848 attribute-namespace :: identifier
20850 attribute-namespace:
20851 identifier
20853 attribute-argument-clause:
20854 ( balanced-token-seq )
20856 balanced-token-seq:
20857 balanced-token [opt]
20858 balanced-token-seq balanced-token
20860 balanced-token:
20861 ( balanced-token-seq )
20862 [ balanced-token-seq ]
20863 { balanced-token-seq }. */
20865 static tree
20867 {
20871 /* First, parse name of the the attribute, a.k.a
20872 attribute-token. */
20889 {
20890 /* We are seeing a scoped attribute token. */
20900 else
20901 {
20905 }
20907 NULL_TREE);
20909 }
20910 else
20912 NULL_TREE);
20914 /* Now parse the optional argument clause of the attribute. */
20919 {
20925 /* A GNU attribute that takes an identifier in parameter. */
20928 vec = cp_parser_parenthesized_expression_list
20934 else
20935 {
20938 }
20942 else
20944 }
20947 }
20949 /* Parse a list of standard C++-11 attributes.
20951 attribute-list:
20952 attribute [opt]
20953 attribute-list , attribute[opt]
20954 attribute ...
20955 attribute-list , attribute ...
20956 */
20958 static tree
20960 {
20965 {
20970 {
20973 }
20978 }
20981 }
20983 /* Parse a standard C++-11 attribute specifier.
20985 attribute-specifier:
20986 [ [ attribute-list ] ]
20987 alignment-specifier
20989 alignment-specifier:
20990 alignas ( type-id ... [opt] )
20991 alignas ( alignment-expression ... [opt] ). */
20993 static tree
20995 {
21001 {
21010 else
21011 /* Warn about parsing c++11 attribute in non-c++1 mode, only
21012 when we are sure that we have actually parsed them. */
21014 }
21015 else
21016 {
21017 tree alignas_expr;
21019 /* Look for an alignment-specifier. */
21031 {
21034 }
21040 {
21044 alignas_expr =
21050 }
21053 {
21056 }
21060 /* Build the C++-11 representation of an 'aligned'
21061 attribute. */
21062 attributes =
21066 }
21069 }
21071 /* Parse a standard C++-11 attribute-specifier-seq.
21073 attribute-specifier-seq:
21074 attribute-specifier-seq [opt] attribute-specifier
21075 */
21077 static tree
21079 {
21083 {
21092 }
21096 }
21098 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
21099 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
21100 current value of the PEDANTIC flag, regardless of whether or not
21101 the `__extension__' keyword is present. The caller is responsible
21102 for restoring the value of the PEDANTIC flag. */
21104 static bool
21106 {
21107 /* Save the old value of the PEDANTIC flag. */
21111 {
21112 /* Consume the `__extension__' token. */
21114 /* We're not being pedantic while the `__extension__' keyword is
21115 in effect. */
21119 }
21122 }
21124 /* Parse a label declaration.
21126 label-declaration:
21127 __label__ label-declarator-seq ;
21129 label-declarator-seq:
21130 identifier , label-declarator-seq
21131 identifier */
21133 static void
21135 {
21136 /* Look for the `__label__' keyword. */
21140 {
21141 tree identifier;
21143 /* Look for an identifier. */
21145 /* If we failed, stop. */
21148 /* Declare it as a label. */
21150 /* If the next token is a `;', stop. */
21153 /* Look for the `,' separating the label declarations. */
21155 }
21157 /* Look for the final `;'. */
21159 }
21161 /* Support Functions */
21163 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
21164 NAME should have one of the representations used for an
21165 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
21166 is returned. If PARSER->SCOPE is a dependent type, then a
21167 SCOPE_REF is returned.
21169 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
21170 returned; the name was already resolved when the TEMPLATE_ID_EXPR
21171 was formed. Abstractly, such entities should not be passed to this
21172 function, because they do not need to be looked up, but it is
21173 simpler to check for this special case here, rather than at the
21174 call-sites.
21176 In cases not explicitly covered above, this function returns a
21177 DECL, OVERLOAD, or baselink representing the result of the lookup.
21178 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
21179 is returned.
21181 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
21182 (e.g., "struct") that was used. In that case bindings that do not
21183 refer to types are ignored.
21185 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
21186 ignored.
21188 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
21189 are ignored.
21191 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
21192 types.
21194 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
21195 TREE_LIST of candidates if name-lookup results in an ambiguity, and
21196 NULL_TREE otherwise. */
21198 static tree
21205 location_t name_location)
21206 {
21207 tree decl;
21210 /* Assume that the lookup will be unambiguous. */
21214 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
21215 no longer valid. Note that if we are parsing tentatively, and
21216 the parse fails, OBJECT_TYPE will be automatically restored. */
21222 /* A template-id has already been resolved; there is no lookup to
21223 do. */
21227 {
21231 }
21233 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
21234 it should already have been checked to make sure that the name
21235 used matches the type being destroyed. */
21237 {
21238 tree type;
21240 /* Figure out to which type this destructor applies. */
21245 else
21247 /* If that's not a class type, there is no destructor. */
21254 /* If it was a class type, return the destructor. */
21256 }
21258 /* By this point, the NAME should be an ordinary identifier. If
21259 the id-expression was a qualified name, the qualifying scope is
21260 stored in PARSER->SCOPE at this point. */
21263 /* Perform the lookup. */
21265 {
21271 /* If the SCOPE is dependent, the lookup must be deferred until
21272 the template is instantiated -- unless we are explicitly
21273 looking up names in uninstantiated templates. Even then, we
21274 cannot look up the name if the scope is not a class type; it
21275 might, for example, be a template type parameter. */
21280 /* Defer lookup. */
21282 else
21283 {
21286 /* If PARSER->SCOPE is a dependent type, then it must be a
21287 class type, and we must not be checking dependencies;
21288 otherwise, we would have processed this lookup above. So
21289 that PARSER->SCOPE is not considered a dependent base by
21290 lookup_member, we must enter the scope here. */
21294 /* If the PARSER->SCOPE is a template specialization, it
21295 may be instantiated during name lookup. In that case,
21296 errors may be issued. Even if we rollback the current
21297 tentative parse, those errors are valid. */
21302 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
21303 lookup result and the nested-name-specifier nominates a class C:
21304 * if the name specified after the nested-name-specifier, when
21305 looked up in C, is the injected-class-name of C (Clause 9), or
21306 * if the name specified after the nested-name-specifier is the
21307 same as the identifier or the simple-template-id's template-
21308 name in the last component of the nested-name-specifier,
21309 the name is instead considered to name the constructor of
21310 class C. [ Note: for example, the constructor is not an
21311 acceptable lookup result in an elaborated-type-specifier so
21312 the constructor would not be used in place of the
21313 injected-class-name. --end note ] Such a constructor name
21314 shall be used only in the declarator-id of a declaration that
21315 names a constructor or in a using-declaration. */
21323 /* If we have a single function from a using decl, pull it out. */
21330 }
21332 /* If the scope is a dependent type and either we deferred lookup or
21333 we did lookup but didn't find the name, rememeber the name. */
21336 {
21338 {
21339 tree type;
21341 /* The resolution to Core Issue 180 says that `struct
21342 A::B' should be considered a type-name, even if `A'
21343 is dependent. */
21347 }
21351 CPP_CLOSE_PAREN)))
21355 else
21358 is_template);
21359 }
21362 }
21364 {
21366 /* Look up the name in the scope of the OBJECT_TYPE, unless the
21367 OBJECT_TYPE is not a class. */
21369 /* If the OBJECT_TYPE is a template specialization, it may
21370 be instantiated during name lookup. In that case, errors
21371 may be issued. Even if we rollback the current tentative
21372 parse, those errors are valid. */
21374 name,
21377 tf_warning_or_error);
21378 /* Look it up in the enclosing context, too. */
21386 }
21387 else
21388 {
21394 }
21396 /* If the lookup failed, let our caller know. */
21400 /* Pull out the template from an injected-class-name (or multiple). */
21404 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
21406 {
21409 /* The error message we have to print is too complicated for
21410 cp_parser_error, so we incorporate its actions directly. */
21412 {
21414 name);
21416 }
21418 }
21426 /* If we have resolved the name of a member declaration, check to
21427 see if the declaration is accessible. When the name resolves to
21428 set of overloaded functions, accessibility is checked when
21429 overload resolution is done.
21431 During an explicit instantiation, access is not checked at all,
21432 as per [temp.explicit]. */
21439 }
21441 /* Like cp_parser_lookup_name, but for use in the typical case where
21442 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
21443 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
21445 static tree
21447 {
21449 none_type,
21454 location);
21455 }
21457 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
21458 the current context, return the TYPE_DECL. If TAG_NAME_P is
21459 true, the DECL indicates the class being defined in a class-head,
21460 or declared in an elaborated-type-specifier.
21462 Otherwise, return DECL. */
21464 static tree
21466 {
21467 /* If the TEMPLATE_DECL is being declared as part of a class-head,
21468 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
21470 struct A {
21471 template <typename T> struct B;
21472 };
21474 template <typename T> struct A::B {};
21476 Similarly, in an elaborated-type-specifier:
21478 namespace N { struct X{}; }
21480 struct A {
21481 template <typename T> friend struct N::X;
21482 };
21484 However, if the DECL refers to a class type, and we are in
21485 the scope of the class, then the name lookup automatically
21486 finds the TYPE_DECL created by build_self_reference rather
21487 than a TEMPLATE_DECL. For example, in:
21489 template <class T> struct S {
21490 S s;
21491 };
21493 there is no need to handle such case. */
21499 }
21501 /* If too many, or too few, template-parameter lists apply to the
21502 declarator, issue an error message. Returns TRUE if all went well,
21503 and FALSE otherwise. */
21505 static bool
21508 location_t declarator_location)
21509 {
21511 {
21513 {
21521 /* If the DECLARATOR has the form `X<y>' then it uses one
21522 additional level of template parameters. */
21525 return cp_parser_check_template_parameters
21527 }
21542 }
21544 }
21546 /* NUM_TEMPLATES were used in the current declaration. If that is
21547 invalid, return FALSE and issue an error messages. Otherwise,
21548 return TRUE. If DECLARATOR is non-NULL, then we are checking a
21549 declarator and we can print more accurate diagnostics. */
21551 static bool
21554 location_t location,
21556 {
21557 /* If there are the same number of template classes and parameter
21558 lists, that's OK. */
21561 /* If there are more, but only one more, then we are referring to a
21562 member template. That's OK too. */
21565 /* If there are more template classes than parameter lists, we have
21566 something like:
21568 template <class T> void S<T>::R<T>::f (); */
21570 {
21580 else
21583 }
21584 /* Otherwise, there are too many template parameter lists. We have
21585 something like:
21587 template <class T> template <class U> void S::f(); */
21590 }
21592 /* Parse an optional `::' token indicating that the following name is
21593 from the global namespace. If so, PARSER->SCOPE is set to the
21594 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
21595 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
21596 Returns the new value of PARSER->SCOPE, if the `::' token is
21597 present, and NULL_TREE otherwise. */
21599 static tree
21601 {
21604 /* Peek at the next token. */
21606 /* If we're looking at a `::' token then we're starting from the
21607 global namespace, not our current location. */
21609 {
21610 /* Consume the `::' token. */
21612 /* Set the SCOPE so that we know where to start the lookup. */
21618 }
21620 {
21624 }
21627 }
21629 /* Returns TRUE if the upcoming token sequence is the start of a
21630 constructor declarator. If FRIEND_P is true, the declarator is
21631 preceded by the `friend' specifier. */
21633 static bool
21635 {
21637 tree nested_name_specifier;
21640 /* The common case is that this is not a constructor declarator, so
21641 try to avoid doing lots of work if at all possible. It's not
21642 valid declare a constructor at function scope. */
21645 /* And only certain tokens can begin a constructor declarator. */
21653 /* Parse tentatively; we are going to roll back all of the tokens
21654 consumed here. */
21656 /* Assume that we are looking at a constructor declarator. */
21659 /* Look for the optional `::' operator. */
21662 /* Look for the nested-name-specifier. */
21663 nested_name_specifier
21669 /* Outside of a class-specifier, there must be a
21670 nested-name-specifier. */
21678 /* If we have a class scope, this is easy; DR 147 says that S::S always
21679 names the constructor, and no other qualified name could. */
21682 {
21692 }
21693 /* If we still think that this might be a constructor-declarator,
21694 look for a class-name. */
21696 {
21697 /* If we have:
21699 template <typename T> struct S {
21700 S();
21701 };
21703 we must recognize that the nested `S' names a class. */
21704 tree type_decl;
21708 none_type,
21712 /* If there was no class-name, then this is not a constructor. */
21715 /* If we're still considering a constructor, we have to see a `(',
21716 to begin the parameter-declaration-clause, followed by either a
21717 `)', an `...', or a decl-specifier. We need to check for a
21718 type-specifier to avoid being fooled into thinking that:
21720 S (f) (int);
21722 is a constructor. (It is actually a function named `f' that
21723 takes one parameter (of type `int') and returns a value of type
21724 `S'. */
21732 /* A parameter declaration begins with a decl-specifier,
21733 which is either the "attribute" keyword, a storage class
21734 specifier, or (usually) a type-specifier. */
21736 {
21737 tree type;
21741 /* Names appearing in the type-specifier should be looked up
21742 in the scope of the class. */
21745 else
21746 {
21749 {
21753 {
21756 }
21757 }
21759 }
21761 /* Inside the constructor parameter list, surrounding
21762 template-parameter-lists do not apply. */
21763 saved_num_template_parameter_lists
21767 /* Look for the type-specifier. */
21769 CP_PARSER_FLAGS_NONE,
21775 parser->num_template_parameter_lists
21778 /* Leave the scope of the class. */
21783 }
21784 }
21786 /* We did not really want to consume any tokens. */
21790 }
21792 /* Parse the definition of the function given by the DECL_SPECIFIERS,
21793 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
21794 they must be performed once we are in the scope of the function.
21796 Returns the function defined. */
21798 static tree
21799 cp_parser_function_definition_from_specifiers_and_declarator
21802 tree attributes,
21804 {
21805 tree fn;
21808 /* Begin the function-definition. */
21811 /* The things we're about to see are not directly qualified by any
21812 template headers we've seen thus far. */
21815 /* If there were names looked up in the decl-specifier-seq that we
21816 did not check, check them now. We must wait until we are in the
21817 scope of the function to perform the checks, since the function
21818 might be a friend. */
21822 {
21823 /* Skip the entire function. */
21826 }
21828 {
21829 /* Seen already, skip it. An error message has already been output. */
21833 /* If this is a function from a class, pop the nested class. */
21836 }
21837 else
21838 {
21839 timevar_id_t tv;
21842 else
21848 }
21851 }
21853 /* Parse the part of a function-definition that follows the
21854 declarator. INLINE_P is TRUE iff this function is an inline
21855 function defined within a class-specifier.
21857 Returns the function defined. */
21859 static tree
21862 {
21863 tree fn;
21872 /* If the next token is `return', then the code may be trying to
21873 make use of the "named return value" extension that G++ used to
21874 support. */
21877 {
21878 /* Consume the `return' keyword. */
21880 /* Look for the identifier that indicates what value is to be
21881 returned. */
21883 /* Issue an error message. */
21886 /* Skip tokens until we reach the start of the function body. */
21888 {
21895 }
21896 }
21897 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21898 anything declared inside `f'. */
21899 saved_in_unbraced_linkage_specification_p
21902 /* Inside the function, surrounding template-parameter-lists do not
21903 apply. */
21904 saved_num_template_parameter_lists
21910 /* If the next token is `try', `__transaction_atomic', or
21911 `__transaction_relaxed`, then we are looking at either function-try-block
21912 or function-transaction-block. Note that all of these include the
21913 function-body. */
21916 RID_TRANSACTION_ATOMIC);
21918 RID_TRANSACTION_RELAXED))
21920 RID_TRANSACTION_RELAXED);
21923 else
21924 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21929 /* Finish the function. */
21932 /* Generate code for it, if necessary. */
21934 /* Restore the saved values. */
21935 parser->in_unbraced_linkage_specification_p
21937 parser->num_template_parameter_lists
21942 }
21944 /* Parse a template-declaration, assuming that the `export' (and
21945 `extern') keywords, if present, has already been scanned. MEMBER_P
21946 is as for cp_parser_template_declaration. */
21948 static void
21950 {
21953 tree parameter_list;
21958 /* Look for the `template' keyword. */
21963 /* And the `<'. */
21967 {
21968 /* 14.5.2.2 [temp.mem]
21970 A local class shall not have member templates. */
21975 }
21976 /* [temp]
21978 A template ... shall not have C linkage. */
21980 {
21982 /* Give it C++ linkage to avoid confusing other parts of the
21983 front end. */
21986 }
21987 else
21990 /* We cannot perform access checks on the template parameter
21991 declarations until we know what is being declared, just as we
21992 cannot check the decl-specifier list. */
21995 /* If the next token is `>', then we have an invalid
21996 specialization. Rather than complain about an invalid template
21997 parameter, issue an error message here. */
21999 {
22003 }
22004 else
22005 {
22006 /* Parse the template parameters. */
22008 }
22010 /* Get the deferred access checks from the parameter list. These
22011 will be checked once we know what is being declared, as for a
22012 member template the checks must be performed in the scope of the
22013 class containing the member. */
22016 /* Look for the `>'. */
22018 /* We just processed one more parameter list. */
22020 /* If the next token is `template', there are more template
22021 parameters. */
22023 RID_TEMPLATE))
22028 else
22029 {
22030 /* There are no access checks when parsing a template, as we do not
22031 know if a specialization will be a friend. */
22035 checks,
22036 member_p,
22041 /* If this is a member template declaration, let the front
22042 end know. */
22044 {
22049 }
22054 }
22055 /* We are done with the current parameter list. */
22060 /* Finish up. */
22063 /* Check the template arguments for a literal operator template. */
22067 {
22071 else
22072 {
22076 else
22077 {
22083 }
22084 }
22088 decl);
22089 }
22090 /* Register member declarations. */
22093 /* For the erroneous case of a template with C linkage, we pushed an
22094 implicit C++ linkage scope; exit that scope now. */
22097 /* If DECL is a function template, we must return to parse it later.
22098 (Even though there is no definition, there might be default
22099 arguments that need handling.) */
22103 }
22105 /* Perform the deferred access checks from a template-parameter-list.
22106 CHECKS is a TREE_LIST of access checks, as returned by
22107 get_deferred_access_checks. */
22109 static void
22110 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
22111 {
22115 }
22117 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
22118 `function-definition' sequence that follows a template header.
22119 If MEMBER_P is true, this declaration appears in a class scope.
22121 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
22122 *FRIEND_P is set to TRUE iff the declaration is a friend. */
22124 static tree
22130 {
22133 cp_decl_specifier_seq decl_specifiers;
22137 /* This function is only used when processing a template
22138 declaration. */
22142 /* Defer access checks until we know what is being declared. */
22145 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
22146 alternative. */
22149 CP_PARSER_FLAGS_OPTIONAL,
22155 /* There are no template typedefs. */
22157 {
22161 }
22163 /* Gather up the access checks that occurred the
22164 decl-specifier-seq. */
22167 /* Check for the declaration of a template class. */
22169 {
22171 {
22174 /* In this case:
22176 struct C {
22177 friend template <typename T> struct A<T>::B;
22178 };
22180 A<T>::B will be represented by a TYPENAME_TYPE, and
22181 therefore not recognized by shadow_tag. */
22183 && !decl
22190 else
22193 /* Perform access checks for template parameters. */
22195 }
22196 }
22198 /* Complain about missing 'typename' or other invalid type names. */
22201 {
22202 /* cp_parser_parse_and_diagnose_invalid_type_name calls
22203 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
22204 the rest of this declaration. */
22207 }
22209 /* If it's not a template class, try for a template function. If
22210 the next token is a `;', then this declaration does not declare
22211 anything. But, if there were errors in the decl-specifiers, then
22212 the error might well have come from an attempted class-specifier.
22213 In that case, there's no need to warn about a missing declarator. */
22217 {
22220 checks,
22222 member_p,
22223 declares_class_or_enum,
22225 NULL);
22227 /* 7.1.1-1 [dcl.stc]
22229 A storage-class-specifier shall not be specified in an explicit
22230 specialization... */
22232 && explicit_specialization_p
22234 {
22238 }
22242 }
22244 /* Look for a trailing `;' after the declaration. */
22250 out:
22253 /* Clear any current qualification; whatever comes next is the start
22254 of something new. */
22260 }
22262 /* Parse a cast-expression that is not the operand of a unary "&". */
22264 static tree
22266 {
22269 }
22271 /* Parse a functional cast to TYPE. Returns an expression
22272 representing the cast. */
22274 static tree
22276 {
22278 tree expression_list;
22279 tree cast;
22283 {
22290 tf_warning_or_error);
22291 }
22300 else
22301 {
22304 }
22307 tf_warning_or_error);
22308 /* [expr.const]/1: In an integral constant expression "only type
22309 conversions to integral or enumeration type can be used". */
22315 NIC_CONSTRUCTOR))
22318 }
22320 /* Save the tokens that make up the body of a member function defined
22321 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
22322 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
22323 specifiers applied to the declaration. Returns the FUNCTION_DECL
22324 for the member function. */
22326 static tree
22330 tree attributes)
22331 {
22334 tree fn;
22336 /* Create the FUNCTION_DECL. */
22338 /* If something went badly wrong, bail out now. */
22340 {
22341 /* If there's a function-body, skip it. */
22346 }
22348 /* Remember it, if there default args to post process. */
22351 /* Save away the tokens that make up the body of the
22352 function. */
22354 /* We can have braced-init-list mem-initializers before the fn body. */
22356 {
22360 {
22361 /* cache_group will stop after an un-nested { } pair, too. */
22365 /* variadic mem-inits have ... after the ')'. */
22368 }
22369 }
22371 /* Handle function try blocks. */
22376 /* Save away the inline definition; we will process it when the
22377 class is complete. */
22381 /* We need to know that this was defined in the class, so that
22382 friend templates are handled correctly. */
22385 /* Add FN to the queue of functions to be parsed later. */
22389 }
22391 /* Save the tokens that make up the in-class initializer for a non-static
22392 data member. Returns a DEFAULT_ARG. */
22394 static tree
22396 {
22398 }
22400 /* Parse a template-argument-list, as well as the trailing ">" (but
22401 not the opening "<"). See cp_parser_template_argument_list for the
22402 return value. */
22404 static tree
22406 {
22407 tree arguments;
22408 tree saved_scope;
22409 tree saved_qualifying_scope;
22410 tree saved_object_scope;
22415 /* [temp.names]
22417 When parsing a template-id, the first non-nested `>' is taken as
22418 the end of the template-argument-list rather than a greater-than
22419 operator. */
22420 saved_greater_than_is_operator_p
22423 /* Parsing the argument list may modify SCOPE, so we save it
22424 here. */
22428 /* We need to evaluate the template arguments, even though this
22429 template-id may be nested within a "sizeof". */
22434 /* Parse the template-argument-list itself. */
22438 else
22440 /* Look for the `>' that ends the template-argument-list. If we find
22441 a '>>' instead, it's probably just a typo. */
22443 {
22445 {
22446 /* In C++0x, a `>>' in a template argument list or cast
22447 expression is considered to be two separate `>'
22448 tokens. So, change the current token to a `>', but don't
22449 consume it: it will be consumed later when the outer
22450 template argument list (or cast expression) is parsed.
22451 Note that this replacement of `>' for `>>' is necessary
22452 even if we are parsing tentatively: in the tentative
22453 case, after calling
22454 cp_parser_enclosed_template_argument_list we will always
22455 throw away all of the template arguments and the first
22456 closing `>', either because the template argument list
22457 was erroneous or because we are replacing those tokens
22458 with a CPP_TEMPLATE_ID token. The second `>' (which will
22459 not have been thrown away) is needed either to close an
22460 outer template argument list or to complete a new-style
22461 cast. */
22464 }
22466 {
22467 /* If we're in a nested template argument list, the '>>' has
22468 to be a typo for '> >'. We emit the error message, but we
22469 continue parsing and we push a '>' as next token, so that
22470 the argument list will be parsed correctly. Note that the
22471 global source location is still on the token before the
22472 '>>', so we need to say explicitly where we want it. */
22478 }
22479 else
22480 {
22481 /* If this is not a nested template argument list, the '>>'
22482 is a typo for '>'. Emit an error message and continue.
22483 Same deal about the token location, but here we can get it
22484 right by consuming the '>>' before issuing the diagnostic. */
22487 "spurious %<>>%>, use %<>%> to terminate "
22489 }
22490 }
22491 else
22493 /* The `>' token might be a greater-than operator again now. */
22494 parser->greater_than_is_operator_p
22496 /* Restore the SAVED_SCOPE. */
22504 }
22506 /* MEMBER_FUNCTION is a member function, or a friend. If default
22507 arguments, or the body of the function have not yet been parsed,
22508 parse them now. */
22510 static void
22512 {
22514 /* If this member is a template, get the underlying
22515 FUNCTION_DECL. */
22519 /* There should not be any class definitions in progress at this
22520 point; the bodies of members are only parsed outside of all class
22521 definitions. */
22523 /* While we're parsing the member functions we might encounter more
22524 classes. We want to handle them right away, but we don't want
22525 them getting mixed up with functions that are currently in the
22526 queue. */
22529 /* Make sure that any template parameters are in scope. */
22532 /* If the body of the function has not yet been parsed, parse it
22533 now. */
22535 {
22536 tree function_scope;
22539 /* The function is no longer pending; we are processing it. */
22544 /* If this is a local class, enter the scope of the containing
22545 function. */
22550 /* Push the body of the function onto the lexer stack. */
22553 /* Let the front end know that we going to be defining this
22554 function. */
22558 /* Don't do access checking if it is a templated function. */
22562 /* Now, parse the body of the function. */
22569 /* Leave the scope of the containing function. */
22573 }
22575 /* Remove any template parameters from the symbol table. */
22578 /* Restore the queue. */
22581 }
22583 /* If DECL contains any default args, remember it on the unparsed
22584 functions queue. */
22586 static void
22588 {
22589 tree probe;
22592 probe;
22595 {
22599 }
22600 }
22602 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
22603 which is either a FIELD_DECL or PARM_DECL. Parse it and return
22604 the result. For a PARM_DECL, PARMTYPE is the corresponding type
22605 from the parameter-type-list. */
22607 static tree
22610 {
22612 tree parsed_arg;
22618 /* Push the saved tokens for the default argument onto the parser's
22619 lexer stack. */
22625 /* Parse the default argument. */
22636 {
22637 /* In a non-template class, check conversions now. In a template,
22638 we'll wait and instantiate these as needed. */
22641 else
22642 {
22648 }
22649 }
22651 /* If the token stream has not been completely used up, then
22652 there was extra junk after the end of the default
22653 argument. */
22655 {
22658 else
22660 }
22662 /* Revert to the main lexer. */
22666 }
22668 /* FIELD is a non-static data member with an initializer which we saved for
22669 later; parse it now. */
22671 static void
22673 {
22674 tree def;
22679 NULL_TREE);
22683 }
22685 /* FN is a FUNCTION_DECL which may contains a parameter with an
22686 unparsed DEFAULT_ARG. Parse the default args now. This function
22687 assumes that the current scope is the scope in which the default
22688 argument should be processed. */
22690 static void
22692 {
22696 /* While we're parsing the default args, we might (due to the
22697 statement expression extension) encounter more classes. We want
22698 to handle them right away, but we don't want them getting mixed
22699 up with default args that are currently in the queue. */
22702 /* Local variable names (and the `this' keyword) may not appear
22703 in a default argument. */
22714 {
22716 tree parsed_arg;
22718 tree copy;
22725 /* This can happen for a friend declaration for a function
22726 already declared with default arguments. */
22729 parsed_arg
22731 default_arg,
22734 {
22736 }
22740 /* Update any instantiations we've already created. */
22744 }
22748 /* Make sure no default arg is missing. */
22751 /* Restore the state of local_variables_forbidden_p. */
22754 /* Restore the queue. */
22756 }
22758 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
22760 sizeof ... ( identifier )
22762 where the 'sizeof' token has already been consumed. */
22764 static tree
22766 {
22767 /* Consume the `...'. */
22774 else
22794 }
22796 /* Parse the operand of `sizeof' (or a similar operator). Returns
22797 either a TYPE or an expression, depending on the form of the
22798 input. The KEYWORD indicates which kind of expression we have
22799 encountered. */
22801 static tree
22803 {
22810 /* If it's a `...', then we are computing the length of a parameter
22811 pack. */
22816 /* Types cannot be defined in a `sizeof' expression. Save away the
22817 old message. */
22819 /* And create the new one. */
22825 /* The restrictions on constant-expressions do not apply inside
22826 sizeof expressions. */
22827 saved_integral_constant_expression_p
22829 saved_non_integral_constant_expression_p
22833 /* Do not actually evaluate the expression. */
22836 /* If it's a `(', then we might be looking at the type-id
22837 construction. */
22839 {
22840 tree type;
22843 /* We can't be sure yet whether we're looking at a type-id or an
22844 expression. */
22846 /* Consume the `('. */
22848 /* Parse the type-id. */
22853 /* Now, look for the trailing `)'. */
22855 /* If all went well, then we're done. */
22857 {
22858 cp_decl_specifier_seq decl_specs;
22860 /* Build a trivial decl-specifier-seq. */
22864 /* Call grokdeclarator to figure out what type this is. */
22867 TYPENAME,
22870 }
22871 }
22873 /* If the type-id production did not work out, then we must be
22874 looking at the unary-expression production. */
22879 /* Go back to evaluating expressions. */
22883 /* Free the message we created. */
22885 /* And restore the old one. */
22887 parser->integral_constant_expression_p
22889 parser->non_integral_constant_expression_p
22893 }
22895 /* If the current declaration has no declarator, return true. */
22897 static bool
22899 {
22900 /* If the next token is a `;' or a `,' then there is no
22901 declarator. */
22904 }
22906 /* Update the DECL_SPECS to reflect the storage class indicated by
22907 KEYWORD. */
22909 static void
22914 {
22915 cp_storage_class storage_class;
22918 {
22922 }
22924 {
22927 }
22932 {
22935 }
22938 {
22956 }
22960 /* A storage class specifier cannot be applied alongside a typedef
22961 specifier. If there is a typedef specifier present then set
22962 conflicting_specifiers_p which will trigger an error later
22963 on in grokdeclarator. */
22966 }
22968 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22969 is true, the type is a class or enum definition. */
22971 static void
22973 tree type_spec,
22976 {
22979 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22980 (with, for example, in "typedef int wchar_t;") we remember that
22981 this is what happened. In system headers, we ignore these
22982 declarations so that G++ can work with system headers that are not
22983 C++-safe. */
22985 && !type_definition_p
22995 {
22998 ds_redefined_builtin_type_spec,
22999 token);
23001 {
23005 }
23006 }
23009 else
23010 {
23015 }
23016 }
23018 /* True iff TOKEN is the GNU keyword __thread. */
23020 static bool
23022 {
23025 }
23027 /* Set the location for a declarator specifier and check if it is
23028 duplicated.
23030 DECL_SPECS is the sequence of declarator specifiers onto which to
23031 set the location.
23033 DS is the single declarator specifier to set which location is to
23034 be set onto the existing sequence of declarators.
23036 LOCATION is the location for the declarator specifier to
23037 consider. */
23039 static void
23042 {
23051 {
23055 }
23056 else
23057 {
23059 {
23063 else
23064 {
23067 OPT_Wlong_long,
23069 }
23070 }
23072 {
23077 else
23079 }
23080 else
23081 {
23097 "__complex"
23098 };
23101 }
23102 }
23103 }
23105 /* Return true iff the declarator specifier DS is present in the
23106 sequence of declarator specifiers DECL_SPECS. */
23108 bool
23110 cp_decl_spec ds)
23111 {
23118 }
23120 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
23121 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
23123 static bool
23125 {
23127 }
23129 /* Issue an error message indicating that TOKEN_DESC was expected.
23130 If KEYWORD is true, it indicated this function is called by
23131 cp_parser_require_keword and the required token can only be
23132 a indicated keyword. */
23134 static void
23136 required_token token_desc,
23138 {
23140 {
23209 }
23211 {
23213 {
23292 }
23293 }
23294 else
23296 }
23300 /* If the next token is of the indicated TYPE, consume it. Otherwise,
23301 issue an error message indicating that TOKEN_DESC was expected.
23303 Returns the token consumed, if the token had the appropriate type.
23304 Otherwise, returns NULL. */
23309 required_token token_desc)
23310 {
23313 else
23314 {
23315 /* Output the MESSAGE -- unless we're parsing tentatively. */
23319 }
23320 }
23322 /* An error message is produced if the next token is not '>'.
23323 All further tokens are skipped until the desired token is
23324 found or '{', '}', ';' or an unbalanced ')' or ']'. */
23326 static void
23328 {
23329 /* Current level of '< ... >'. */
23331 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
23334 /* Are we ready, yet? If not, issue error message. */
23338 /* Skip tokens until the desired token is found. */
23340 {
23341 /* Peek at the next token. */
23343 {
23351 /* C++0x views the `>>' operator as two `>' tokens, but
23352 C++98 does not. */
23355 {
23356 /* We've hit a `>>' where the first `>' closes the
23357 template argument list, and the second `>' is
23358 spurious. Just consume the `>>' and stop; we've
23359 already produced at least one error. */
23362 }
23363 /* Fall through for C++0x, so we handle the second `>' in
23364 the `>>'. */
23368 {
23369 /* We've reached the token we want, consume it and stop. */
23372 }
23391 /* The '>' was probably forgotten, don't look further. */
23396 }
23398 /* Consume this token. */
23400 }
23401 }
23403 /* If the next token is the indicated keyword, consume it. Otherwise,
23404 issue an error message indicating that TOKEN_DESC was expected.
23406 Returns the token consumed, if the token had the appropriate type.
23407 Otherwise, returns NULL. */
23412 required_token token_desc)
23413 {
23417 {
23420 }
23423 }
23425 /* Returns TRUE iff TOKEN is a token that can begin the body of a
23426 function-definition. */
23428 static bool
23430 {
23433 /* A ctor-initializer begins with a `:'. */
23435 /* A function-try-block begins with `try'. */
23437 /* A function-transaction-block begins with `__transaction_atomic'
23438 or `__transaction_relaxed'. */
23441 /* The named return value extension begins with `return'. */
23443 }
23445 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
23446 definition. */
23448 static bool
23450 {
23455 }
23457 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
23458 C++0x) ending a template-argument. */
23460 static bool
23462 {
23470 }
23472 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
23473 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
23475 static bool
23478 {
23484 /* Check for the sequence `<::' in the original code. It would be lexed as
23485 `[:', where `[' is a digraph, and there is no whitespace before
23486 `:'. */
23488 {
23493 }
23495 }
23497 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
23498 or none_type otherwise. */
23500 static enum tag_types
23502 {
23504 {
23514 }
23515 }
23517 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
23519 static void
23521 {
23525 {
23529 type))
23532 }
23533 }
23535 /* Issue an error message if DECL is redeclared with different
23536 access than its original declaration [class.access.spec/3].
23537 This applies to nested classes and nested class templates.
23538 [class.mem/1]. */
23540 static void
23542 {
23551 }
23553 /* Look for the `template' keyword, as a syntactic disambiguator.
23554 Return TRUE iff it is present, in which case it will be
23555 consumed. */
23557 static bool
23559 {
23561 {
23562 /* In C++98 the `template' keyword can only be used within templates;
23563 outside templates the parser can always figure out what is a
23564 template and what is not. In C++11, per the resolution of DR 468,
23565 `template' is allowed in cases where it is not strictly necessary. */
23568 {
23571 "in C++98 %<template%> (as a disambiguator) is only "
23573 /* If this part of the token stream is rescanned, the same
23574 error message would be generated. So, we purge the token
23575 from the stream. */
23578 }
23579 else
23580 {
23581 /* Consume the `template' keyword. */
23584 }
23585 }
23587 }
23589 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
23590 set PARSER->SCOPE, and perform other related actions. */
23592 static void
23594 {
23600 /* Get the stored value. */
23602 /* Perform any access checks that were deferred. */
23605 {
23610 }
23611 /* Set the scope from the stored value. */
23615 }
23617 /* Consume tokens up through a non-nested END token. Returns TRUE if we
23618 encounter the end of a block before what we were looking for. */
23620 static bool
23624 {
23626 {
23629 /* Abort a parenthesized expression if we encounter a semicolon. */
23633 /* If we've reached the end of the file, stop. */
23639 /* We've hit the end of an enclosing block, so there's been some
23640 kind of syntax error. */
23643 /* Consume the token. */
23645 /* See if it starts a new group. */
23647 {
23649 /* In theory this should probably check end == '}', but
23650 cp_parser_save_member_function_body needs it to exit
23651 after either '}' or ')' when called with ')'. */
23654 }
23656 {
23660 }
23665 }
23666 }
23668 /* Like above, for caching a default argument or NSDMI. Both of these are
23669 terminated by a non-nested comma, but it can be unclear whether or not a
23670 comma is nested in a template argument list unless we do more parsing.
23671 In order to handle this ambiguity, when we encounter a ',' after a '<'
23672 we try to parse what follows as a parameter-declaration-list (in the
23673 case of a default argument) or a member-declarator (in the case of an
23674 NSDMI). If that succeeds, then we stop caching. */
23676 static tree
23678 {
23683 tree default_argument;
23685 /* Add tokens until we have processed the entire default
23686 argument. We add the range [first_token, token). */
23689 {
23690 /* For list-initialization, this is straightforward. */
23693 }
23695 {
23698 /* Peek at the next token. */
23700 /* What we do depends on what token we have. */
23702 {
23703 /* In valid code, a default argument must be
23704 immediately followed by a `,' `)', or `...'. */
23707 {
23708 /* If we've seen a '<', we might be in a
23709 template-argument-list. Until Core issue 325 is
23710 resolved, we don't know how this situation ought
23711 to be handled, so try to DTRT. We check whether
23712 what comes after the comma is a valid parameter
23713 declaration list. If it is, then the comma ends
23714 the default argument; otherwise the default
23715 argument continues. */
23717 tree t;
23719 /* Set ITALP so cp_parser_parameter_declaration_list
23720 doesn't decide to commit to this parse. */
23728 {
23734 }
23735 else
23736 {
23742 }
23749 }
23752 /* If we run into a non-nested `;', `}', or `]',
23753 then the code is invalid -- but the default
23754 argument is certainly over. */
23760 /* Update DEPTH, if necessary. */
23775 /* This might be the comparison operator, or it might
23776 start a template argument list. */
23783 /* Fall through for C++0x, which treats the `>>'
23784 operator like two `>' tokens in certain
23785 cases. */
23789 {
23790 /* This might be an operator, or it might close a
23791 template argument list. But if a previous '<'
23792 started a template argument list, this will have
23793 closed it, so we can't be in one anymore. */
23797 }
23800 /* If we run out of tokens, issue an error message. */
23809 /* In these cases, we should look for template-ids.
23810 For example, if the default argument is
23811 `X<int, double>()', we need to do name lookup to
23812 figure out whether or not `X' is a template; if
23813 so, the `,' does not end the default argument.
23815 That is not yet done. */
23820 }
23822 /* If we've reached the end, stop. */
23826 /* Add the token to the token block. */
23828 }
23830 /* Create a DEFAULT_ARG to represent the unparsed default
23831 argument. */
23838 }
23840 /* Begin parsing tentatively. We always save tokens while parsing
23841 tentatively so that if the tentative parsing fails we can restore the
23842 tokens. */
23844 static void
23846 {
23847 /* Enter a new parsing context. */
23849 /* Begin saving tokens. */
23851 /* In order to avoid repetitive access control error messages,
23852 access checks are queued up until we are no longer parsing
23853 tentatively. */
23855 }
23857 /* Commit to the currently active tentative parse. */
23859 static void
23861 {
23865 /* Mark all of the levels as committed. */
23868 {
23875 }
23876 }
23878 /* Abort the currently active tentative parse. All consumed tokens
23879 will be rolled back, and no diagnostics will be issued. */
23881 static void
23883 {
23887 /* Now, pretend that we want to see if the construct was
23888 successfully parsed. */
23890 }
23892 /* Stop parsing tentatively. If a parse error has occurred, restore the
23893 token stream. Otherwise, commit to the tokens we have consumed.
23894 Returns true if no error occurred; false otherwise. */
23896 static bool
23898 {
23902 /* Remember whether or not an error occurred, since we are about to
23903 destroy that information. */
23905 /* Remove the topmost context from the stack. */
23908 /* If no parse errors occurred, commit to the tentative parse. */
23910 {
23911 /* Commit to the tokens read tentatively, unless that was
23912 already done. */
23917 }
23918 /* Otherwise, if errors occurred, roll back our state so that things
23919 are just as they were before we began the tentative parse. */
23920 else
23921 {
23924 }
23925 /* Add the context to the front of the free list. */
23930 }
23932 /* Returns true if we are parsing tentatively and are not committed to
23933 this tentative parse. */
23935 static bool
23937 {
23940 }
23942 /* Returns nonzero iff an error has occurred during the most recent
23943 tentative parse. */
23945 static bool
23947 {
23950 }
23952 /* Returns nonzero if GNU extensions are allowed. */
23954 static bool
23956 {
23958 }
23959 \f
23960 /* Objective-C++ Productions */
23963 /* Parse an Objective-C expression, which feeds into a primary-expression
23964 above.
23966 objc-expression:
23967 objc-message-expression
23968 objc-string-literal
23969 objc-encode-expression
23970 objc-protocol-expression
23971 objc-selector-expression
23973 Returns a tree representation of the expression. */
23975 static tree
23977 {
23978 /* Try to figure out what kind of declaration is present. */
23982 {
23992 {
24004 }
24010 }
24013 }
24015 /* Parse an Objective-C message expression.
24017 objc-message-expression:
24018 [ objc-message-receiver objc-message-args ]
24020 Returns a representation of an Objective-C message. */
24022 static tree
24024 {
24033 }
24035 /* Parse an objc-message-receiver.
24037 objc-message-receiver:
24038 expression
24039 simple-type-specifier
24041 Returns a representation of the type or expression. */
24043 static tree
24045 {
24046 tree rcv;
24048 /* An Objective-C message receiver may be either (1) a type
24049 or (2) an expression. */
24058 CP_PARSER_FLAGS_NONE);
24061 }
24063 /* Parse the arguments and selectors comprising an Objective-C message.
24065 objc-message-args:
24066 objc-selector
24067 objc-selector-args
24068 objc-selector-args , objc-comma-args
24070 objc-selector-args:
24071 objc-selector [opt] : assignment-expression
24072 objc-selector-args objc-selector [opt] : assignment-expression
24074 objc-comma-args:
24075 assignment-expression
24076 objc-comma-args , assignment-expression
24078 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
24079 selector arguments and TREE_VALUE containing a list of comma
24080 arguments. */
24082 static tree
24084 {
24090 {
24096 /* Detect if we have a unary selector. */
24105 sel_args
24110 }
24112 /* Handle non-selector arguments, if any. */
24114 {
24115 tree arg;
24120 addl_args
24125 }
24128 {
24131 }
24134 }
24136 /* Parse an Objective-C encode expression.
24138 objc-encode-expression:
24139 @encode objc-typename
24141 Returns an encoded representation of the type argument. */
24143 static tree
24145 {
24146 tree type;
24156 {
24160 }
24162 /* This happens if we find @encode(T) (where T is a template
24163 typename or something dependent on a template typename) when
24164 parsing a template. In that case, we can't compile it
24165 immediately, but we rather create an AT_ENCODE_EXPR which will
24166 need to be instantiated when the template is used.
24167 */
24169 {
24173 }
24176 }
24178 /* Parse an Objective-C @defs expression. */
24180 static tree
24182 {
24183 tree name;
24191 }
24193 /* Parse an Objective-C protocol expression.
24195 objc-protocol-expression:
24196 @protocol ( identifier )
24198 Returns a representation of the protocol expression. */
24200 static tree
24202 {
24203 tree proto;
24211 }
24213 /* Parse an Objective-C selector expression.
24215 objc-selector-expression:
24216 @selector ( objc-method-signature )
24218 objc-method-signature:
24219 objc-selector
24220 objc-selector-seq
24222 objc-selector-seq:
24223 objc-selector :
24224 objc-selector-seq objc-selector :
24226 Returns a representation of the method selector. */
24228 static tree
24230 {
24242 {
24251 {
24252 /* Detect if we have a unary selector. */
24254 {
24257 }
24258 else
24259 {
24261 }
24262 }
24267 {
24268 sel_seq
24271 sel_seq
24274 }
24275 else
24276 sel_seq
24281 }
24283 finish_selector:
24287 }
24289 /* Parse a list of identifiers.
24291 objc-identifier-list:
24292 identifier
24293 objc-identifier-list , identifier
24295 Returns a TREE_LIST of identifier nodes. */
24297 static tree
24299 {
24300 tree identifier;
24301 tree list;
24312 {
24319 identifier));
24321 }
24324 }
24326 /* Parse an Objective-C alias declaration.
24328 objc-alias-declaration:
24329 @compatibility_alias identifier identifier ;
24331 This function registers the alias mapping with the Objective-C front end.
24332 It returns nothing. */
24334 static void
24336 {
24344 }
24346 /* Parse an Objective-C class forward-declaration.
24348 objc-class-declaration:
24349 @class objc-identifier-list ;
24351 The function registers the forward declarations with the Objective-C
24352 front end. It returns nothing. */
24354 static void
24356 {
24359 {
24360 tree id;
24370 else
24372 }
24374 }
24376 /* Parse a list of Objective-C protocol references.
24378 objc-protocol-refs-opt:
24379 objc-protocol-refs [opt]
24381 objc-protocol-refs:
24382 < objc-identifier-list >
24384 Returns a TREE_LIST of identifiers, if any. */
24386 static tree
24388 {
24392 {
24396 }
24399 }
24401 /* Parse a Objective-C visibility specification. */
24403 static void
24405 {
24409 {
24424 }
24426 /* Eat '@private'/'@protected'/'@public'. */
24428 }
24430 /* Parse an Objective-C method type. Return 'true' if it is a class
24431 (+) method, and 'false' if it is an instance (-) method. */
24435 {
24438 else
24440 }
24442 /* Parse an Objective-C protocol qualifier. */
24444 static tree
24446 {
24459 {
24464 }
24467 }
24469 /* Parse an Objective-C typename. */
24471 static tree
24473 {
24477 {
24483 /* An ObjC type name may consist of just protocol qualifiers, in which
24484 case the type shall default to 'id'. */
24486 {
24489 /* If the type could not be parsed, an error has already
24490 been produced. For error recovery, behave as if it had
24491 not been specified, which will use the default type
24492 'id'. */
24494 {
24496 /* We need to skip to the closing parenthesis as
24497 cp_parser_type_id() does not seem to do it for
24498 us. */
24503 }
24504 }
24508 }
24511 }
24513 /* Check to see if TYPE refers to an Objective-C selector name. */
24515 static bool
24517 {
24523 }
24525 /* Parse an Objective-C selector. */
24527 static tree
24529 {
24533 {
24536 }
24538 /* C++ operator names are allowed to appear in ObjC selectors. */
24540 {
24553 }
24554 }
24556 /* Parse an Objective-C params list. */
24558 static tree
24560 {
24566 {
24576 /* Detect if we have a unary selector. */
24579 {
24582 }
24586 {
24587 /* Something went quite wrong. There should be a colon
24588 here, but there is not. Stop parsing parameters. */
24590 }
24592 /* New ObjC allows attributes on parameters too. */
24597 params
24600 type_name,
24601 identifier,
24602 parm_attr));
24605 }
24608 {
24611 }
24613 /* We allow tail attributes for the method. */
24615 {
24623 }
24626 {
24629 }
24631 }
24633 /* Parse the non-keyword Objective-C params. */
24635 static tree
24638 {
24644 {
24646 tree parm;
24652 {
24657 }
24659 /* TODO: parse attributes for tail parameters. */
24668 }
24670 /* We allow tail attributes for the method. */
24672 {
24674 {
24679 }
24680 else
24681 /* We have an error, but parse the attributes, so that we can
24682 carry on. */
24688 }
24691 }
24693 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
24695 static void
24697 {
24700 /* If the next token is `extern' and the following token is a string
24701 literal, then we have a linkage specification. */
24703 && cp_parser_is_pure_string_literal
24706 /* Handle #pragma, if any. */
24709 /* Allow stray semicolons. */
24712 /* Mark methods as optional or required, when building protocols. */
24714 {
24717 }
24719 {
24722 }
24725 /* Other stray characters must generate errors. */
24727 {
24731 }
24732 /* Finally, try to parse a block-declaration, or a function-definition. */
24733 else
24735 }
24737 /* Parse a method signature. */
24739 static tree
24741 {
24757 }
24759 static bool
24761 {
24762 tree tattr;
24767 /* If the attributes are followed by a method introducer, this is not allowed.
24768 Dump the attributes and flag the situation. */
24773 /* Otherwise, the attributes introduce some interstitial code, possibly so
24774 rewind to allow that check. */
24777 }
24779 /* Parse an Objective-C method prototype list. */
24781 static void
24783 {
24787 {
24789 {
24794 else
24798 {
24802 }
24805 }
24811 OPT_Wattributes,
24813 else
24814 /* Allow for interspersed non-ObjC++ code. */
24818 }
24822 else
24826 }
24828 /* Parse an Objective-C method definition list. */
24830 static void
24832 {
24836 {
24837 tree meth;
24840 {
24846 else
24851 {
24855 }
24857 NULL_TREE);
24859 /* For historical reasons, we accept an optional semicolon. */
24866 {
24873 }
24874 }
24875 /* The following case will be removed once @synthesize is
24876 completely implemented. */
24887 else
24888 /* Allow for interspersed non-ObjC++ code. */
24892 }
24896 else
24900 }
24902 /* Parse Objective-C ivars. */
24904 static void
24906 {
24917 {
24918 cp_decl_specifier_seq declspecs;
24920 tree prefix_attributes;
24928 CP_PARSER_FLAGS_OPTIONAL,
24932 /* auto, register, static, extern, mutable. */
24934 {
24937 }
24939 /* thread_local. */
24941 {
24944 }
24946 /* typedef. */
24948 {
24951 }
24956 /* Keep going until we hit the `;' at the end of the
24957 declaration. */
24959 {
24964 /* Check for a (possibly unnamed) bitfield declaration. */
24972 {
24973 /* Get the name of the bitfield. */
24976 sfk_none);
24978 eat_colon:
24980 /* Get the width of the bitfield. */
24981 width
24984 NULL);
24985 }
24986 else
24987 {
24988 /* Parse the declarator. */
24989 declarator
24994 }
24996 /* Look for attributes that apply to the ivar. */
24998 /* Remember which attributes are prefix attributes and
24999 which are not. */
25001 /* Combine the attributes. */
25005 /* Create the bitfield declaration. */
25007 width,
25008 attributes);
25009 else
25014 /* Add the instance variable. */
25018 /* Reset PREFIX_ATTRIBUTES. */
25027 {
25030 }
25032 }
25036 }
25041 /* Do not consume the RID_AT_END, so it will be read again as terminating
25042 the @interface of @implementation. */
25046 /* For historical reasons, we accept an optional semicolon. */
25049 }
25051 /* Parse an Objective-C protocol declaration. */
25053 static void
25055 {
25061 {
25066 }
25068 /* See if we have a forward declaration or a definition. */
25071 /* Try a forward declaration first. */
25073 {
25075 {
25076 tree id;
25086 else
25088 }
25090 }
25092 /* Ok, we got a full-fledged definition (or at least should). */
25093 else
25094 {
25099 }
25100 }
25102 /* Parse an Objective-C superclass or category. */
25104 static void
25109 {
25115 {
25118 }
25120 {
25123 /* If there is no category name, and this is an @interface, we
25124 have a class extension. */
25126 {
25129 }
25130 else
25134 }
25135 }
25137 /* Parse an Objective-C class interface. */
25139 static void
25141 {
25148 {
25149 /* It's hard to recover because even if valid @interface stuff
25150 is to follow, we can't compile it (or validate it) if we
25151 don't even know which class it refers to. Let's assume this
25152 was a stray '@interface' token in the stream and skip it.
25153 */
25155 }
25160 /* We have either a class or a category on our hands. */
25163 else
25164 {
25166 /* Handle instance variable declarations, if any. */
25169 }
25172 }
25174 /* Parse an Objective-C class implementation. */
25176 static void
25178 {
25185 {
25186 /* It's hard to recover because even if valid @implementation
25187 stuff is to follow, we can't compile it (or validate it) if
25188 we don't even know which class it refers to. Let's assume
25189 this was a stray '@implementation' token in the stream and
25190 skip it.
25191 */
25193 }
25197 /* We have either a class or a category on our hands. */
25200 else
25201 {
25203 /* Handle instance variable declarations, if any. */
25206 }
25209 }
25211 /* Consume the @end token and finish off the implementation. */
25213 static void
25215 {
25218 }
25220 /* Parse an Objective-C declaration. */
25222 static void
25224 {
25225 /* Try to figure out what kind of declaration is present. */
25230 {
25246 }
25249 {
25272 }
25273 }
25275 /* Parse an Objective-C try-catch-finally statement.
25277 objc-try-catch-finally-stmt:
25278 @try compound-statement objc-catch-clause-seq [opt]
25279 objc-finally-clause [opt]
25281 objc-catch-clause-seq:
25282 objc-catch-clause objc-catch-clause-seq [opt]
25284 objc-catch-clause:
25285 @catch ( objc-exception-declaration ) compound-statement
25287 objc-finally-clause:
25288 @finally compound-statement
25290 objc-exception-declaration:
25291 parameter-declaration
25292 '...'
25294 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
25296 Returns NULL_TREE.
25298 PS: This function is identical to c_parser_objc_try_catch_finally_statement
25299 for C. Keep them in sync. */
25301 static tree
25303 {
25304 location_t location;
25305 tree stmt;
25310 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
25311 node, lest it get absorbed into the surrounding block. */
25317 {
25326 {
25327 /* We have "@catch (...)" (where the '...' are literally
25328 what is in the code). Skip the '...'.
25329 parameter_declaration is set to NULL_TREE, and
25330 objc_being_catch_clauses() knows that that means
25331 '...'. */
25334 }
25335 else
25336 {
25337 /* We have "@catch (NSException *exception)" or something
25338 like that. Parse the parameter declaration. */
25342 else
25347 }
25350 else
25351 {
25352 /* If there was no open parenthesis, we are recovering from
25353 an error, and we are trying to figure out what mistake
25354 the user has made. */
25356 /* If there is an immediate closing parenthesis, the user
25357 probably forgot the opening one (ie, they typed "@catch
25358 NSException *e)". Parse the closing parenthesis and keep
25359 going. */
25363 /* If these is no immediate closing parenthesis, the user
25364 probably doesn't know that parenthesis are required at
25365 all (ie, they typed "@catch NSException *e"). So, just
25366 forget about the closing parenthesis and keep going. */
25367 }
25371 }
25373 {
25376 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
25377 node, lest it get absorbed into the surrounding block. */
25381 }
25384 }
25386 /* Parse an Objective-C synchronized statement.
25388 objc-synchronized-stmt:
25389 @synchronized ( expression ) compound-statement
25391 Returns NULL_TREE. */
25393 static tree
25395 {
25396 location_t location;
25407 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
25408 node, lest it get absorbed into the surrounding block. */
25413 }
25415 /* Parse an Objective-C throw statement.
25417 objc-throw-stmt:
25418 @throw assignment-expression [opt] ;
25420 Returns a constructed '@throw' statement. */
25422 static tree
25424 {
25436 }
25438 /* Parse an Objective-C statement. */
25440 static tree
25442 {
25443 /* Try to figure out what kind of declaration is present. */
25447 {
25458 }
25461 }
25463 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
25464 look ahead to see if an objc keyword follows the attributes. This
25465 is to detect the use of prefix attributes on ObjC @interface and
25466 @protocol. */
25468 static bool
25470 {
25475 {
25478 }
25481 }
25483 /* This routine is a minimal replacement for
25484 c_parser_struct_declaration () used when parsing the list of
25485 types/names or ObjC++ properties. For example, when parsing the
25486 code
25488 @property (readonly) int a, b, c;
25490 this function is responsible for parsing "int a, int b, int c" and
25491 returning the declarations as CHAIN of DECLs.
25493 TODO: Share this code with cp_parser_objc_class_ivars. It's very
25494 similar parsing. */
25495 static tree
25497 {
25499 cp_decl_specifier_seq declspecs;
25501 tree prefix_attributes;
25504 CP_PARSER_FLAGS_NONE,
25511 /* auto, register, static, extern, mutable. */
25513 {
25516 }
25518 /* thread_local. */
25520 {
25523 }
25525 /* typedef. */
25527 {
25530 }
25535 /* Keep going until we hit the `;' at the end of the declaration. */
25537 {
25542 /* Parse the declarator. */
25546 /* Look for attributes that apply to the ivar. */
25548 /* Remember which attributes are prefix attributes and
25549 which are not. */
25551 /* Combine the attributes. */
25561 /* Reset PREFIX_ATTRIBUTES. */
25572 {
25575 }
25576 else
25578 }
25580 }
25582 /* Parse an Objective-C @property declaration. The syntax is:
25584 objc-property-declaration:
25585 '@property' objc-property-attributes[opt] struct-declaration ;
25587 objc-property-attributes:
25588 '(' objc-property-attribute-list ')'
25590 objc-property-attribute-list:
25591 objc-property-attribute
25592 objc-property-attribute-list, objc-property-attribute
25594 objc-property-attribute
25595 'getter' = identifier
25596 'setter' = identifier
25597 'readonly'
25598 'readwrite'
25599 'assign'
25600 'retain'
25601 'copy'
25602 'nonatomic'
25604 For example:
25605 @property NSString *name;
25606 @property (readonly) id object;
25607 @property (retain, nonatomic, getter=getTheName) id name;
25608 @property int a, b, c;
25610 PS: This function is identical to
25611 c_parser_objc_at_property_declaration for C. Keep them in sync. */
25612 static void
25614 {
25615 /* The following variables hold the attributes of the properties as
25616 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
25617 seen. When we see an attribute, we set them to 'true' (if they
25618 are boolean properties) or to the identifier (if they have an
25619 argument, ie, for getter and setter). Note that here we only
25620 parse the list of attributes, check the syntax and accumulate the
25621 attributes that we find. objc_add_property_declaration() will
25622 then process the information. */
25632 /* 'properties' is the list of properties that we read. Usually a
25633 single one, but maybe more (eg, in "@property int a, b, c;" there
25634 are three). */
25635 tree properties;
25636 location_t loc;
25642 /* Parse the optional attribute list... */
25644 {
25645 /* Eat the '('. */
25649 {
25655 {
25658 }
25662 {
25673 {
25677 else
25682 }
25685 {
25689 }
25691 {
25693 {
25696 }
25697 else
25701 else
25703 }
25704 else
25705 {
25707 {
25710 }
25711 else
25713 }
25719 }
25726 else
25728 }
25730 /* FIXME: "@property (setter, assign);" will generate a spurious
25731 "error: expected ‘)’ before ‘,’ token". This is because
25732 cp_parser_require, unlike the C counterpart, will produce an
25733 error even if we are in error recovery. */
25735 {
25740 }
25741 }
25743 /* ... and the property declaration(s). */
25747 {
25749 /* If the next token is now a `;', consume it. */
25753 }
25757 else
25758 {
25759 /* Comma-separated properties are chained together in
25760 reverse order; add them one by one. */
25769 }
25772 }
25774 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
25776 objc-synthesize-declaration:
25777 @synthesize objc-synthesize-identifier-list ;
25779 objc-synthesize-identifier-list:
25780 objc-synthesize-identifier
25781 objc-synthesize-identifier-list, objc-synthesize-identifier
25783 objc-synthesize-identifier
25784 identifier
25785 identifier = identifier
25787 For example:
25788 @synthesize MyProperty;
25789 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
25791 PS: This function is identical to c_parser_objc_at_synthesize_declaration
25792 for C. Keep them in sync.
25793 */
25794 static void
25796 {
25798 location_t loc;
25803 {
25807 {
25810 }
25812 {
25816 {
25819 }
25820 }
25821 else
25826 else
25828 }
25831 }
25833 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
25835 objc-dynamic-declaration:
25836 @dynamic identifier-list ;
25838 For example:
25839 @dynamic MyProperty;
25840 @dynamic MyProperty, AnotherProperty;
25842 PS: This function is identical to c_parser_objc_at_dynamic_declaration
25843 for C. Keep them in sync.
25844 */
25845 static void
25847 {
25849 location_t loc;
25854 {
25855 tree property;
25858 {
25861 }
25865 else
25867 }
25870 }
25872 \f
25873 /* OpenMP 2.5 parsing routines. */
25875 /* Returns name of the next clause.
25876 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
25877 the token is not consumed. Otherwise appropriate pragma_omp_clause is
25878 returned and the token is consumed. */
25880 static pragma_omp_clause
25882 {
25892 {
25897 {
25944 }
25945 }
25951 }
25953 /* Validate that a clause of the given type does not already exist. */
25955 static void
25958 {
25959 tree c;
25963 {
25966 }
25967 }
25969 /* OpenMP 2.5:
25970 variable-list:
25971 identifier
25972 variable-list , identifier
25974 In addition, we match a closing parenthesis. An opening parenthesis
25975 will have been consumed by the caller.
25977 If KIND is nonzero, create the appropriate node and install the decl
25978 in OMP_CLAUSE_DECL and add the node to the head of the list.
25980 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25981 return the list created. */
25983 static tree
25985 tree list)
25986 {
25989 {
26006 {
26011 }
26012 else
26015 get_comma:
26019 }
26022 {
26025 /* Try to resync to an unnested comma. Copied from
26026 cp_parser_parenthesized_expression_list. */
26027 skip_comma:
26034 }
26037 }
26039 /* Similarly, but expect leading and trailing parenthesis. This is a very
26040 common case for omp clauses. */
26042 static tree
26044 {
26048 }
26050 /* OpenMP 3.0:
26051 collapse ( constant-expression ) */
26053 static tree
26055 {
26057 location_t loc;
26058 HOST_WIDE_INT n;
26078 {
26081 }
26089 }
26091 /* OpenMP 2.5:
26092 default ( shared | none ) */
26094 static tree
26096 {
26098 tree c;
26103 {
26108 {
26123 }
26126 }
26127 else
26128 {
26129 invalid_kind:
26131 }
26147 }
26149 /* OpenMP 3.1:
26150 final ( expression ) */
26152 static tree
26154 {
26175 }
26177 /* OpenMP 2.5:
26178 if ( expression ) */
26180 static tree
26182 {
26203 }
26205 /* OpenMP 3.1:
26206 mergeable */
26208 static tree
26211 {
26212 tree c;
26215 location);
26220 }
26222 /* OpenMP 2.5:
26223 nowait */
26225 static tree
26228 {
26229 tree c;
26236 }
26238 /* OpenMP 2.5:
26239 num_threads ( expression ) */
26241 static tree
26243 location_t location)
26244 {
26266 }
26268 /* OpenMP 2.5:
26269 ordered */
26271 static tree
26274 {
26275 tree c;
26283 }
26285 /* OpenMP 2.5:
26286 reduction ( reduction-operator : variable-list )
26288 reduction-operator:
26289 One of: + * - & ^ | && ||
26291 OpenMP 3.1:
26293 reduction-operator:
26294 One of: + * - & ^ | && || min max */
26296 static tree
26298 {
26306 {
26332 {
26337 {
26340 }
26342 {
26345 }
26346 }
26347 /* FALLTHROUGH */
26351 resync_fail:
26356 }
26367 }
26369 /* OpenMP 2.5:
26370 schedule ( schedule-kind )
26371 schedule ( schedule-kind , expression )
26373 schedule-kind:
26374 static | dynamic | guided | runtime | auto */
26376 static tree
26378 {
26387 {
26392 {
26413 }
26414 }
26419 else
26424 {
26439 else
26444 }
26452 invalid_kind:
26454 resync_fail:
26459 }
26461 /* OpenMP 3.0:
26462 untied */
26464 static tree
26467 {
26468 tree c;
26475 }
26477 /* Parse all OpenMP clauses. The set clauses allowed by the directive
26478 is a bitmask in MASK. Return the list of clauses found; the result
26479 of clause default goes in *pdefault. */
26481 static tree
26484 {
26490 {
26491 pragma_omp_clause c_kind;
26503 {
26515 clauses);
26529 clauses);
26538 clauses);
26562 clauses);
26576 clauses);
26587 }
26590 {
26591 /* Remove the invalid clause(s) from the list to avoid
26592 confusing the rest of the compiler. */
26595 }
26596 }
26597 saw_error:
26600 }
26602 /* OpenMP 2.5:
26603 structured-block:
26604 statement
26606 In practice, we're also interested in adding the statement to an
26607 outer node. So it is convenient if we work around the fact that
26608 cp_parser_statement calls add_stmt. */
26610 static unsigned
26612 {
26615 /* Only move the values to IN_OMP_BLOCK if they weren't false.
26616 This preserves the "not within loop or switch" style error messages
26617 for nonsense cases like
26618 void foo() {
26619 #pragma omp single
26620 break;
26621 }
26622 */
26627 }
26629 static void
26631 {
26633 }
26635 static tree
26637 {
26645 }
26647 /* OpenMP 2.5:
26648 # pragma omp atomic new-line
26649 expression-stmt
26651 expression-stmt:
26652 x binop= expr | x++ | ++x | x-- | --x
26653 binop:
26654 +, *, -, /, &, ^, |, <<, >>
26656 where x is an lvalue expression with scalar type.
26658 OpenMP 3.1:
26659 # pragma omp atomic new-line
26660 update-stmt
26662 # pragma omp atomic read new-line
26663 read-stmt
26665 # pragma omp atomic write new-line
26666 write-stmt
26668 # pragma omp atomic update new-line
26669 update-stmt
26671 # pragma omp atomic capture new-line
26672 capture-stmt
26674 # pragma omp atomic capture new-line
26675 capture-block
26677 read-stmt:
26678 v = x
26679 write-stmt:
26680 x = expr
26681 update-stmt:
26682 expression-stmt | x = x binop expr
26683 capture-stmt:
26684 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
26685 capture-block:
26686 { v = x; update-stmt; } | { update-stmt; v = x; }
26688 where x and v are lvalue expressions with scalar type. */
26690 static void
26692 {
26699 {
26711 else
26715 }
26719 {
26730 else
26736 {
26737 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
26738 opcode. */
26743 }
26747 {
26750 }
26751 else
26752 {
26759 }
26762 }
26764 restart:
26769 {
26776 /* FALLTHROUGH */
26786 /* FALLTHROUGH */
26801 /* Undo effects of boolean_increment for post {in,de}crement. */
26803 /* FALLTHRU */
26807 {
26808 /* Undo effects of boolean_increment. */
26810 {
26811 /* This is pre or post increment. */
26816 && !structured_block
26820 }
26821 }
26822 /* FALLTHRU */
26825 {
26855 {
26865 {
26868 {
26876 }
26911 }
26922 }
26923 /* FALLTHROUGH */
26928 }
26935 }
26936 stmt_done:
26938 {
26951 }
26953 {
26956 }
26957 done:
26963 saw_error:
26966 {
26970 {
26974 }
26975 }
26976 }
26979 /* OpenMP 2.5:
26980 # pragma omp barrier new-line */
26982 static void
26984 {
26987 }
26989 /* OpenMP 2.5:
26990 # pragma omp critical [(name)] new-line
26991 structured-block */
26993 static tree
26995 {
26999 {
27011 }
27016 }
27018 /* OpenMP 2.5:
27019 # pragma omp flush flush-vars[opt] new-line
27021 flush-vars:
27022 ( variable-list ) */
27024 static void
27026 {
27032 }
27034 /* Helper function, to parse omp for increment expression. */
27036 static tree
27038 {
27043 {
27046 }
27049 {
27057 }
27059 /* If decl is an iterator, preserve LHS and RHS of the relational
27060 expr until finish_omp_for. */
27070 }
27072 /* Helper function, to parse omp for increment expression. */
27074 static tree
27076 {
27080 cp_id_kind idk;
27084 {
27092 }
27100 {
27105 }
27112 {
27116 }
27128 do
27129 {
27136 {
27138 {
27141 else
27143 tf_warning_or_error);
27144 }
27145 else
27148 }
27149 }
27153 {
27157 }
27158 else
27162 }
27164 /* Parse the restricted form of the for statement allowed by OpenMP. */
27166 static tree
27168 {
27172 location_t loc_first;
27191 {
27194 location_t loc;
27197 {
27200 }
27209 {
27210 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
27212 init-expr:
27213 var = lb
27214 integer-type var = lb
27215 random-access-iterator-type var = lb
27216 pointer-type var = lb
27217 */
27218 cp_decl_specifier_seq type_specifiers;
27220 /* First, try to parse as an initialized declaration. See
27221 cp_parser_condition, from whence the bulk of this is copied. */
27228 {
27229 /* If parsing a type specifier seq succeeded, then this
27230 MUST be a initialized declaration. */
27235 CP_PARSER_DECLARATOR_NAMED,
27245 else
27246 {
27256 {
27258 CPP_OPEN_PAREN))
27261 else
27262 /* Trigger an error. */
27267 }
27271 {
27279 {
27282 auto_node);
27287 }
27290 asm_specification,
27291 LOOKUP_ONLYCONVERTING);
27293 {
27296 }
27297 else
27300 }
27301 else
27302 {
27303 /* Consume '='. */
27307 non_class:
27310 else
27313 asm_specification,
27314 LOOKUP_ONLYCONVERTING);
27315 }
27319 }
27320 }
27321 else
27322 {
27323 cp_id_kind idk;
27324 /* If parsing a type specifier sequence failed, then
27325 this MUST be a simple expression. */
27330 && decl
27333 {
27334 tree rhs;
27341 rhs,
27342 tf_warning_or_error));
27344 }
27345 else
27346 {
27351 {
27355 }
27356 }
27357 }
27358 }
27361 {
27364 {
27370 }
27371 else
27373 }
27378 {
27383 {
27387 }
27390 {
27391 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
27392 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
27401 }
27402 else
27403 {
27408 }
27409 }
27412 {
27413 tree c;
27415 {
27424 decl);
27428 decl);
27429 }
27431 {
27436 {
27439 }
27440 }
27441 }
27450 {
27451 /* If decl is an iterator, preserve the operator on decl
27452 until finish_omp_for. */
27454 && ((processing_template_decl
27458 else
27462 }
27477 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
27478 in between the collapsed for loops to be still considered perfectly
27479 nested. Hopefully the final version clarifies this.
27480 For now handle (multiple) {'s and empty statements. */
27482 do
27483 {
27487 {
27489 bracecount++;
27490 }
27494 else
27495 {
27502 }
27503 }
27507 {
27510 }
27511 }
27513 /* Note that we saved the original contents of this flag when we entered
27514 the structured block, and so we don't need to re-save it here. */
27517 /* Note that the grammar doesn't call for a structured block here,
27518 though the loop as a whole is a structured block. */
27525 else
27530 {
27532 {
27534 nbraces--;
27535 }
27538 else
27539 {
27541 {
27544 }
27549 }
27550 }
27557 }
27559 /* OpenMP 2.5:
27560 #pragma omp for for-clause[optseq] new-line
27561 for-loop */
27563 #define OMP_FOR_CLAUSE_MASK \
27564 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27565 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27566 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27567 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27568 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
27569 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
27570 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
27571 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
27573 static tree
27575 {
27591 }
27593 /* OpenMP 2.5:
27594 # pragma omp master new-line
27595 structured-block */
27597 static tree
27599 {
27603 }
27605 /* OpenMP 2.5:
27606 # pragma omp ordered new-line
27607 structured-block */
27609 static tree
27611 {
27615 }
27617 /* OpenMP 2.5:
27619 section-scope:
27620 { section-sequence }
27622 section-sequence:
27623 section-directive[opt] structured-block
27624 section-sequence section-directive structured-block */
27626 static tree
27628 {
27639 {
27646 {
27656 }
27662 }
27665 {
27673 {
27677 }
27679 {
27682 }
27687 }
27698 }
27700 /* OpenMP 2.5:
27701 # pragma omp sections sections-clause[optseq] newline
27702 sections-scope */
27704 #define OMP_SECTIONS_CLAUSE_MASK \
27705 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27706 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27707 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27708 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27709 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27711 static tree
27713 {
27724 }
27726 /* OpenMP 2.5:
27727 # pragma parallel parallel-clause new-line
27728 # pragma parallel for parallel-for-clause new-line
27729 # pragma parallel sections parallel-sections-clause new-line */
27731 #define OMP_PARALLEL_CLAUSE_MASK \
27732 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27733 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27734 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27735 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27736 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27737 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
27738 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27739 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
27741 static tree
27743 {
27752 {
27758 }
27760 {
27764 {
27770 }
27771 }
27778 {
27798 }
27805 }
27807 /* OpenMP 2.5:
27808 # pragma omp single single-clause[optseq] new-line
27809 structured-block */
27811 #define OMP_SINGLE_CLAUSE_MASK \
27812 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27813 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27814 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
27815 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27817 static tree
27819 {
27829 }
27831 /* OpenMP 3.0:
27832 # pragma omp task task-clause[optseq] new-line
27833 structured-block */
27835 #define OMP_TASK_CLAUSE_MASK \
27836 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27837 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
27838 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27839 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27840 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27841 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27842 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
27843 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
27845 static tree
27847 {
27858 }
27860 /* OpenMP 3.0:
27861 # pragma omp taskwait new-line */
27863 static void
27865 {
27868 }
27870 /* OpenMP 3.1:
27871 # pragma omp taskyield new-line */
27873 static void
27875 {
27878 }
27880 /* OpenMP 2.5:
27881 # pragma omp threadprivate (variable-list) */
27883 static void
27885 {
27886 tree vars;
27892 }
27894 /* Main entry point to OpenMP statement pragmas. */
27896 static void
27898 {
27899 tree stmt;
27902 {
27932 }
27936 }
27937 \f
27938 /* Transactional Memory parsing routines. */
27940 /* Parse a transaction attribute.
27942 txn-attribute:
27943 attribute
27944 [ [ identifier ] ]
27946 ??? Simplify this when C++0x bracket attributes are
27947 implemented properly. */
27949 static tree
27951 {
27966 {
27970 /* For keywords, use the canonical spelling,
27971 not the parsed identifier. */
27975 }
27976 else
27980 error1:
27983 }
27985 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27987 transaction-statement:
27988 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27989 compound-statement
27990 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27991 */
27993 static tree
27995 {
28010 else
28011 {
28015 }
28017 /* Parse a noexcept specification. */
28020 /* Keep track if we're in the lexical scope of an outer transaction. */
28032 }
28034 /* Parse a __transaction_atomic or __transaction_relaxed expression.
28036 transaction-expression:
28037 __transaction_atomic txn-noexcept-spec[opt] ( expression )
28038 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
28039 */
28041 static tree
28043 {
28068 /* Set this early. This might mean that we allow transaction_cancel in
28069 an expression that we find out later actually has to be a constexpr.
28070 However, we expect that cxx_constant_value will be able to deal with
28071 this; also, if the noexcept has no constexpr, then what we parse next
28072 really is a transaction's body. */
28075 /* Parse a noexcept specification. */
28081 {
28088 }
28089 else
28090 {
28091 /* The only expression that is available got parsed for the noexcept
28092 already. noexcept is true then. */
28095 }
28104 }
28106 /* Parse a function-transaction-block.
28108 function-transaction-block:
28109 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
28110 function-body
28111 __transaction_atomic txn-attribute[opt] function-try-block
28112 __transaction_relaxed ctor-initializer[opt] function-body
28113 __transaction_relaxed function-try-block
28114 */
28116 static bool
28118 {
28134 else
28135 {
28139 }
28147 else
28148 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
28156 }
28158 /* Parse a __transaction_cancel statement.
28160 cancel-statement:
28161 __transaction_cancel txn-attribute[opt] ;
28162 __transaction_cancel txn-attribute[opt] throw-expression ;
28164 ??? Cancel and throw is not yet implemented. */
28166 static tree
28168 {
28174 RT_TRANSACTION_CANCEL);
28181 /* ??? Parse cancel-and-throw here. */
28186 {
28190 }
28192 {
28196 }
28198 {
28201 {
28207 }
28208 }
28210 {
28214 }
28221 }
28222 \f
28223 /* The parser. */
28227 \f
28228 /* Special handling for the first token or line in the file. The first
28229 thing in the file might be #pragma GCC pch_preprocess, which loads a
28230 PCH file, which is a GC collection point. So we need to handle this
28231 first pragma without benefit of an existing lexer structure.
28233 Always returns one token to the caller in *FIRST_TOKEN. This is
28234 either the true first token of the file, or the first token after
28235 the initial pragma. */
28237 static void
28239 {
28248 {
28255 }
28256 else
28259 /* Skip to the end of the pragma. */
28263 /* Now actually load the PCH file. */
28267 /* Read one more token to return to our caller. We have to do this
28268 after reading the PCH file in, since its pointers have to be
28269 live. */
28271 }
28273 /* Normal parsing of a pragma token. Here we can (and must) use the
28274 regular lexer. */
28276 static bool
28278 {
28288 {
28296 {
28306 }
28311 {
28321 }
28326 {
28332 "%<#pragma omp taskwait%> may only be "
28337 }
28342 {
28348 "%<#pragma omp taskyield%> may only be "
28353 }
28376 "%<#pragma omp section%> may only be used in "
28385 bad_stmt:
28388 }
28392 }
28394 /* The interface the pragma parsers have to the lexer. */
28396 enum cpp_ttype
28398 {
28411 else
28412 {
28416 }
28419 }
28421 \f
28422 /* External interface. */
28424 /* Parse one entire translation unit. */
28426 void
28428 {
28432 {
28435 }
28443 }