| blob | d8c3305006774988e8998da3408e873388f9ffaf |
1 /* C++ Parser.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
43 \f
44 /* The lexer. */
46 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
47 and c-lex.c) and the C++ parser. */
50 {
52 };
54 /* The various kinds of non integral constant we encounter. */
56 NIC_NONE,
57 /* floating-point literal */
58 NIC_FLOAT,
59 /* %<this%> */
60 NIC_THIS,
61 /* %<__FUNCTION__%> */
62 NIC_FUNC_NAME,
63 /* %<__PRETTY_FUNCTION__%> */
64 NIC_PRETTY_FUNC,
65 /* %<__func__%> */
66 NIC_C99_FUNC,
67 /* "%<va_arg%> */
68 NIC_VA_ARG,
69 /* a cast */
70 NIC_CAST,
71 /* %<typeid%> operator */
72 NIC_TYPEID,
73 /* non-constant compound literals */
74 NIC_NCC,
75 /* a function call */
76 NIC_FUNC_CALL,
77 /* an increment */
78 NIC_INC,
79 /* an decrement */
80 NIC_DEC,
81 /* an array reference */
82 NIC_ARRAY_REF,
83 /* %<->%> */
84 NIC_ARROW,
85 /* %<.%> */
86 NIC_POINT,
87 /* the address of a label */
88 NIC_ADDR_LABEL,
89 /* %<*%> */
90 NIC_STAR,
91 /* %<&%> */
92 NIC_ADDR,
93 /* %<++%> */
94 NIC_PREINCREMENT,
95 /* %<--%> */
96 NIC_PREDECREMENT,
97 /* %<new%> */
98 NIC_NEW,
99 /* %<delete%> */
100 NIC_DEL,
101 /* calls to overloaded operators */
102 NIC_OVERLOADED,
103 /* an assignment */
104 NIC_ASSIGNMENT,
105 /* a comma operator */
106 NIC_COMMA,
107 /* a call to a constructor */
108 NIC_CONSTRUCTOR,
109 /* a transaction expression */
110 NIC_TRANSACTION
113 /* The various kinds of errors about name-lookup failing. */
115 /* NULL */
116 NLE_NULL,
117 /* is not a type */
118 NLE_TYPE,
119 /* is not a class or namespace */
120 NLE_CXX98,
121 /* is not a class, namespace, or enumeration */
122 NLE_NOT_CXX98
125 /* The various kinds of required token */
127 RT_NONE,
149 /* The type is CPP_KEYWORD */
178 RT_TRANSACTION_CANCEL /* __transaction_cancel */
181 /* Prototypes. */
187 static void cp_lexer_destroy
189 static int cp_lexer_saving_tokens
193 static void cp_lexer_get_preprocessor_token
201 static bool cp_lexer_next_token_is_not
203 static bool cp_lexer_next_token_is_keyword
207 static void cp_lexer_purge_token
209 static void cp_lexer_purge_tokens_after
211 static void cp_lexer_save_tokens
213 static void cp_lexer_commit_tokens
215 static void cp_lexer_rollback_tokens
217 static void cp_lexer_print_token
221 static void cp_lexer_start_debugging
223 static void cp_lexer_stop_debugging
229 static void cp_parser_initial_pragma
232 static tree cp_literal_operator_id
235 /* Manifest constants. */
236 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
237 #define CP_SAVED_TOKEN_STACK 5
239 /* Variables. */
241 /* The stream to which debugging output should be written. */
244 /* Nonzero if we are parsing an unevaluated operand: an operand to
245 sizeof, typeof, or alignof. */
248 /* Dump up to NUM tokens in BUFFER to FILE starting with token
249 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
250 first token in BUFFER. If NUM is 0, dump all the tokens. If
251 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
252 highlighted by surrounding it in [[ ]]. */
254 static void
258 {
275 {
278 }
283 {
290 nprinted++;
300 {
310 }
311 }
314 {
318 }
321 }
324 /* Dump all tokens in BUFFER to stderr. */
326 void
328 {
330 }
333 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
334 description for T. */
336 static void
338 {
340 {
343 }
344 }
347 /* Dump parser context C to FILE. */
349 static void
351 {
356 }
359 /* Print the stack of parsing contexts to FILE starting with FIRST. */
361 static void
363 {
369 {
372 }
373 }
376 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
378 static void
380 {
383 }
386 /* Print an unparsed function entry UF to FILE. */
388 static void
390 {
393 tree fn;
398 default_arg_fn);
399 i++)
400 {
406 }
411 {
414 }
420 {
423 }
425 }
428 /* Print the stack of unparsed member functions S to FILE. */
430 static void
433 {
439 {
442 }
443 }
446 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
447 the given PARSER. If FILE is NULL, the output is printed on stderr. */
449 static void
451 {
463 next_token);
464 }
467 /* Dump debugging information for the given PARSER. If FILE is NULL,
468 the output is printed on stderr. */
470 void
472 {
475 expanded_location eloc;
549 }
552 /* Allocate memory for a new lexer object and return it. */
556 {
561 /* Allocate the memory. */
564 /* Initially we are not debugging. */
568 CP_SAVED_TOKEN_STACK);
570 /* Create the buffer. */
574 }
577 /* Create a new main C++ lexer, the lexer that gets tokens from the
578 preprocessor. */
582 {
584 cp_token token;
586 /* It's possible that parsing the first pragma will load a PCH file,
587 which is a GC collection point. So we have to do that before
588 allocating any memory. */
593 /* Put the first token in the buffer. */
596 /* Get the remaining tokens from the preprocessor. */
598 {
601 }
610 /* Subsequent preprocessor diagnostics should use compiler
611 diagnostic functions to get the compiler source location. */
616 }
618 /* Create a new lexer whose token stream is primed with the tokens in
619 CACHE. When these tokens are exhausted, no new tokens will be read. */
623 {
628 /* We do not own the buffer. */
634 CP_SAVED_TOKEN_STACK);
636 /* Initially we are not debugging. */
641 }
643 /* Frees all resources associated with LEXER. */
645 static void
647 {
651 }
653 /* Returns nonzero if debugging information should be output. */
657 {
659 }
664 {
668 }
672 {
674 }
678 {
680 }
684 {
687 else
689 }
693 {
697 }
699 /* nonzero if we are presently saving tokens. */
703 {
705 }
707 /* Store the next token from the preprocessor in *TOKEN. Return true
708 if we reach EOF. If LEXER is NULL, assume we are handling an
709 initial #pragma pch_preprocess, and thus want the lexer to return
710 processed strings. */
712 static void
714 {
717 /* Get a new token from the preprocessor. */
718 token->type
725 /* On some systems, some header files are surrounded by an
726 implicit extern "C" block. Set a flag in the token if it
727 comes from such a header. */
732 /* Check to see if this token is a keyword. */
734 {
736 {
737 /* Mark this token as a keyword. */
739 /* Record which keyword. */
741 }
742 else
743 {
747 {
748 /* Warn about the C++0x keyword (but still treat it as
749 an identifier). */
754 /* Clear out the C_RID_CODE so we don't warn about this
755 particular identifier-turned-keyword again. */
757 }
761 }
762 }
764 {
765 /* This only happens in Objective-C++; it must be a keyword. */
768 {
769 /* Replace 'class' with '@class', 'private' with '@private',
770 etc. This prevents confusion with the C++ keyword
771 'class', and makes the tokens consistent with other
772 Objective-C 'AT' keywords. For example '@class' is
773 reported as RID_AT_CLASS which is consistent with
774 '@synchronized', which is reported as
775 RID_AT_SYNCHRONIZED.
776 */
785 }
786 }
788 {
789 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
793 }
794 }
796 /* Update the globals input_location and the input file stack from TOKEN. */
799 {
801 {
803 }
804 }
806 /* Return a pointer to the next token in the token stream, but do not
807 consume it. */
811 {
813 {
817 }
819 }
821 /* Return true if the next token has the indicated TYPE. */
825 {
827 }
829 /* Return true if the next token does not have the indicated TYPE. */
833 {
835 }
837 /* Return true if the next token is the indicated KEYWORD. */
841 {
843 }
845 /* Return true if the next token is not the indicated KEYWORD. */
849 {
851 }
853 /* Return true if the next token is a keyword for a decl-specifier. */
855 static bool
857 {
862 {
863 /* auto specifier: storage-class-specifier in C++,
864 simple-type-specifier in C++0x. */
866 /* Storage classes. */
872 /* Elaborated type specifiers. */
878 /* Simple type specifiers. */
893 /* GNU extensions. */
896 /* C++0x extensions. */
903 }
904 }
906 /* Returns TRUE iff the token T begins a decltype type. */
908 static bool
910 {
913 }
915 /* Returns TRUE iff the next token begins a decltype type. */
917 static bool
919 {
922 }
924 /* Return a pointer to the Nth token in the token stream. If N is 1,
925 then this is precisely equivalent to cp_lexer_peek_token (except
926 that it is not inline). One would like to disallow that case, but
927 there is one case (cp_parser_nth_token_starts_template_id) where
928 the caller passes a variable for N and it might be 1. */
932 {
935 /* N is 1-based, not zero-based. */
946 {
949 {
952 }
956 }
959 {
962 }
965 }
967 /* Return the next token, and advance the lexer's next_token pointer
968 to point to the next non-purged token. */
972 {
978 do
979 {
982 {
985 }
987 }
992 /* Provide debugging output. */
994 {
998 }
1001 }
1003 /* Permanently remove the next token from the token stream, and
1004 advance the next_token pointer to refer to the next non-purged
1005 token. */
1007 static void
1009 {
1018 do
1019 {
1020 tok++;
1022 {
1025 }
1026 }
1029 }
1031 /* Permanently remove all tokens after TOK, up to, but not
1032 including, the token that will be returned next by
1033 cp_lexer_peek_token. */
1035 static void
1037 {
1046 {
1051 }
1052 }
1054 /* Begin saving tokens. All tokens consumed after this point will be
1055 preserved. */
1057 static void
1059 {
1060 /* Provide debugging output. */
1066 }
1068 /* Commit to the portion of the token stream most recently saved. */
1070 static void
1072 {
1073 /* Provide debugging output. */
1078 }
1080 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1081 to the token stream. Stop saving tokens. */
1083 static void
1085 {
1086 /* Provide debugging output. */
1091 }
1093 /* Print a representation of the TOKEN on the STREAM. */
1095 static void
1097 {
1098 /* We don't use cpp_type2name here because the parser defines
1099 a few tokens of its own. */
1101 /* cpplib-defined token types */
1102 #define OP(e, s) #e,
1103 #define TK(e, s) #e,
1104 TTYPE_TABLE
1105 #undef OP
1106 #undef TK
1107 /* C++ parser token types - see "Manifest constants", above. */
1111 };
1113 /* For some tokens, print the associated data. */
1115 {
1117 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1118 For example, `struct' is mapped to an INTEGER_CST. */
1121 /* else fall through */
1139 /* If we have a name for the token, print it out. Otherwise, we
1140 simply give the numeric code. */
1143 else
1146 }
1147 }
1149 /* Start emitting debugging information. */
1151 static void
1153 {
1156 }
1158 /* Stop emitting debugging information. */
1160 static void
1162 {
1165 }
1167 /* Create a new cp_token_cache, representing a range of tokens. */
1171 {
1176 }
1178 \f
1179 /* Decl-specifiers. */
1181 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1183 static void
1185 {
1187 }
1189 /* Declarators. */
1191 /* Nothing other than the parser should be creating declarators;
1192 declarators are a semi-syntactic representation of C++ entities.
1193 Other parts of the front end that need to create entities (like
1194 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1209 /* An erroneous declarator. */
1212 /* The obstack on which declarators and related data structures are
1213 allocated. */
1216 /* Alloc BYTES from the declarator memory pool. */
1220 {
1222 }
1224 /* Allocate a declarator of the indicated KIND. Clear fields that are
1225 common to all declarators. */
1229 {
1240 }
1242 /* Make a declarator for a generalized identifier. If
1243 QUALIFYING_SCOPE is non-NULL, the identifier is
1244 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1245 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1246 is, if any. */
1250 special_function_kind sfk)
1251 {
1254 /* It is valid to write:
1256 class C { void f(); };
1257 typedef C D;
1258 void D::f();
1260 The standard is not clear about whether `typedef const C D' is
1261 legal; as of 2002-09-15 the committee is considering that
1262 question. EDG 3.0 allows that syntax. Therefore, we do as
1263 well. */
1277 }
1279 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1280 of modifiers such as const or volatile to apply to the pointer
1281 type, represented as identifiers. */
1283 cp_declarator *
1285 {
1293 {
1297 }
1298 else
1302 }
1304 /* Like make_pointer_declarator -- but for references. */
1306 cp_declarator *
1309 {
1317 {
1321 }
1322 else
1326 }
1328 /* Like make_pointer_declarator -- but for a pointer to a non-static
1329 member of CLASS_TYPE. */
1331 cp_declarator *
1334 {
1343 {
1346 }
1347 else
1351 }
1353 /* Make a declarator for the function given by TARGET, with the
1354 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1355 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1356 indicates what exceptions can be thrown. */
1358 cp_declarator *
1360 tree parms,
1361 cp_cv_quals cv_qualifiers,
1362 cp_virt_specifiers virt_specifiers,
1363 tree exception_specification,
1364 tree late_return_type)
1365 {
1376 {
1380 }
1381 else
1385 }
1387 /* Make a declarator for an array of BOUNDS elements, each of which is
1388 defined by ELEMENT. */
1390 cp_declarator *
1392 {
1399 {
1403 }
1404 else
1408 }
1410 /* Determine whether the declarator we've seen so far can be a
1411 parameter pack, when followed by an ellipsis. */
1412 static bool
1414 {
1415 /* Search for a declarator name, or any other declarator that goes
1416 after the point where the ellipsis could appear in a parameter
1417 pack. If we find any of these, then this declarator can not be
1418 made into a parameter pack. */
1421 {
1423 {
1435 }
1436 }
1439 }
1443 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1444 DECLARATOR and DEFAULT_ARGUMENT. */
1446 cp_parameter_declarator *
1449 tree default_argument)
1450 {
1458 else
1465 }
1467 /* Returns true iff DECLARATOR is a declaration for a function. */
1469 static bool
1471 {
1473 {
1481 }
1483 }
1485 /* The parser. */
1487 /* Overview
1488 --------
1490 A cp_parser parses the token stream as specified by the C++
1491 grammar. Its job is purely parsing, not semantic analysis. For
1492 example, the parser breaks the token stream into declarators,
1493 expressions, statements, and other similar syntactic constructs.
1494 It does not check that the types of the expressions on either side
1495 of an assignment-statement are compatible, or that a function is
1496 not declared with a parameter of type `void'.
1498 The parser invokes routines elsewhere in the compiler to perform
1499 semantic analysis and to build up the abstract syntax tree for the
1500 code processed.
1502 The parser (and the template instantiation code, which is, in a
1503 way, a close relative of parsing) are the only parts of the
1504 compiler that should be calling push_scope and pop_scope, or
1505 related functions. The parser (and template instantiation code)
1506 keeps track of what scope is presently active; everything else
1507 should simply honor that. (The code that generates static
1508 initializers may also need to set the scope, in order to check
1509 access control correctly when emitting the initializers.)
1511 Methodology
1512 -----------
1514 The parser is of the standard recursive-descent variety. Upcoming
1515 tokens in the token stream are examined in order to determine which
1516 production to use when parsing a non-terminal. Some C++ constructs
1517 require arbitrary look ahead to disambiguate. For example, it is
1518 impossible, in the general case, to tell whether a statement is an
1519 expression or declaration without scanning the entire statement.
1520 Therefore, the parser is capable of "parsing tentatively." When the
1521 parser is not sure what construct comes next, it enters this mode.
1522 Then, while we attempt to parse the construct, the parser queues up
1523 error messages, rather than issuing them immediately, and saves the
1524 tokens it consumes. If the construct is parsed successfully, the
1525 parser "commits", i.e., it issues any queued error messages and
1526 the tokens that were being preserved are permanently discarded.
1527 If, however, the construct is not parsed successfully, the parser
1528 rolls back its state completely so that it can resume parsing using
1529 a different alternative.
1531 Future Improvements
1532 -------------------
1534 The performance of the parser could probably be improved substantially.
1535 We could often eliminate the need to parse tentatively by looking ahead
1536 a little bit. In some places, this approach might not entirely eliminate
1537 the need to parse tentatively, but it might still speed up the average
1538 case. */
1540 /* Flags that are passed to some parsing functions. These values can
1541 be bitwise-ored together. */
1543 enum
1544 {
1545 /* No flags. */
1547 /* The construct is optional. If it is not present, then no error
1548 should be issued. */
1550 /* When parsing a type-specifier, treat user-defined type-names
1551 as non-type identifiers. */
1553 /* When parsing a type-specifier, do not try to parse a class-specifier
1554 or enum-specifier. */
1556 /* When parsing a decl-specifier-seq, only allow type-specifier or
1557 constexpr. */
1559 };
1561 /* This type is used for parameters and variables which hold
1562 combinations of the above flags. */
1565 /* The different kinds of declarators we want to parse. */
1568 {
1569 /* We want an abstract declarator. */
1570 CP_PARSER_DECLARATOR_ABSTRACT,
1571 /* We want a named declarator. */
1572 CP_PARSER_DECLARATOR_NAMED,
1573 /* We don't mind, but the name must be an unqualified-id. */
1574 CP_PARSER_DECLARATOR_EITHER
1577 /* The precedence values used to parse binary expressions. The minimum value
1578 of PREC must be 1, because zero is reserved to quickly discriminate
1579 binary operators from other tokens. */
1581 enum cp_parser_prec
1582 {
1583 PREC_NOT_OPERATOR,
1584 PREC_LOGICAL_OR_EXPRESSION,
1585 PREC_LOGICAL_AND_EXPRESSION,
1586 PREC_INCLUSIVE_OR_EXPRESSION,
1587 PREC_EXCLUSIVE_OR_EXPRESSION,
1588 PREC_AND_EXPRESSION,
1589 PREC_EQUALITY_EXPRESSION,
1590 PREC_RELATIONAL_EXPRESSION,
1591 PREC_SHIFT_EXPRESSION,
1592 PREC_ADDITIVE_EXPRESSION,
1593 PREC_MULTIPLICATIVE_EXPRESSION,
1594 PREC_PM_EXPRESSION,
1595 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1596 };
1598 /* A mapping from a token type to a corresponding tree node type, with a
1599 precedence value. */
1602 {
1603 /* The token type. */
1605 /* The corresponding tree code. */
1607 /* The precedence of this operator. */
1612 {
1613 /* Left hand side of the binary operation we are currently
1614 parsing. */
1615 tree lhs;
1616 /* Original tree code for left hand side, if it was a binary
1617 expression itself (used for -Wparentheses). */
1619 /* Tree code for the binary operation we are parsing. */
1621 /* Precedence of the binary operation we are parsing. */
1623 /* Location of the binary operation we are parsing. */
1624 location_t loc;
1627 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1628 entries because precedence levels on the stack are monotonically
1629 increasing. */
1633 /* Prototypes. */
1635 /* Constructors and destructors. */
1640 /* Class variables. */
1644 /* The operator-precedence table used by cp_parser_binary_expression.
1645 Transformed into an associative array (binops_by_token) by
1646 cp_parser_new. */
1679 };
1681 /* The same as binops, but initialized by cp_parser_new so that
1682 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1683 for speed. */
1686 /* Constructors and destructors. */
1688 /* Construct a new context. The context below this one on the stack
1689 is given by NEXT. */
1693 {
1696 /* Allocate the storage. */
1698 {
1699 /* Pull the first entry from the free list. */
1703 }
1704 else
1707 /* No errors have occurred yet in this context. */
1709 /* If this is not the bottommost context, copy information that we
1710 need from the previous context. */
1712 {
1713 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1714 expression, then we are parsing one in this context, too. */
1716 /* Thread the stack. */
1718 }
1721 }
1723 /* Managing the unparsed function queues. */
1725 #define unparsed_funs_with_default_args \
1726 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_default_args
1727 #define unparsed_funs_with_definitions \
1728 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_definitions
1729 #define unparsed_nsdmis \
1730 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->nsdmis
1732 static void
1734 {
1740 }
1742 static void
1744 {
1747 }
1749 /* Prototypes. */
1751 /* Constructors and destructors. */
1756 /* Routines to parse various constructs.
1758 Those that return `tree' will return the error_mark_node (rather
1759 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1760 Sometimes, they will return an ordinary node if error-recovery was
1761 attempted, even though a parse error occurred. So, to check
1762 whether or not a parse error occurred, you should always use
1763 cp_parser_error_occurred. If the construct is optional (indicated
1764 either by an `_opt' in the name of the function that does the
1765 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1766 the construct is not present. */
1768 /* Lexical conventions [gram.lex] */
1770 static tree cp_parser_identifier
1772 static tree cp_parser_string_literal
1774 static tree cp_parser_userdef_char_literal
1776 static tree cp_parser_userdef_string_literal
1778 static tree cp_parser_userdef_numeric_literal
1781 /* Basic concepts [gram.basic] */
1783 static bool cp_parser_translation_unit
1786 /* Expressions [gram.expr] */
1788 static tree cp_parser_primary_expression
1790 static tree cp_parser_id_expression
1792 static tree cp_parser_unqualified_id
1794 static tree cp_parser_nested_name_specifier_opt
1796 static tree cp_parser_nested_name_specifier
1798 static tree cp_parser_qualifying_entity
1800 static tree cp_parser_postfix_expression
1802 static tree cp_parser_postfix_open_square_expression
1804 static tree cp_parser_postfix_dot_deref_expression
1808 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1810 static void cp_parser_pseudo_destructor_name
1812 static tree cp_parser_unary_expression
1814 static enum tree_code cp_parser_unary_operator
1816 static tree cp_parser_new_expression
1820 static tree cp_parser_new_type_id
1828 static tree cp_parser_delete_expression
1830 static tree cp_parser_cast_expression
1832 static tree cp_parser_binary_expression
1834 static tree cp_parser_question_colon_clause
1836 static tree cp_parser_assignment_expression
1838 static enum tree_code cp_parser_assignment_operator_opt
1840 static tree cp_parser_expression
1842 static tree cp_parser_constant_expression
1844 static tree cp_parser_builtin_offsetof
1846 static tree cp_parser_lambda_expression
1848 static void cp_parser_lambda_introducer
1850 static bool cp_parser_lambda_declarator_opt
1852 static void cp_parser_lambda_body
1855 /* Statements [gram.stmt.stmt] */
1857 static void cp_parser_statement
1859 static void cp_parser_label_for_labeled_statement
1861 static tree cp_parser_expression_statement
1863 static tree cp_parser_compound_statement
1865 static void cp_parser_statement_seq_opt
1867 static tree cp_parser_selection_statement
1869 static tree cp_parser_condition
1871 static tree cp_parser_iteration_statement
1873 static bool cp_parser_for_init_statement
1875 static tree cp_parser_for
1877 static tree cp_parser_c_for
1879 static tree cp_parser_range_for
1881 static void do_range_for_auto_deduction
1883 static tree cp_parser_perform_range_for_lookup
1885 static tree cp_parser_range_for_member_function
1887 static tree cp_parser_jump_statement
1889 static void cp_parser_declaration_statement
1892 static tree cp_parser_implicitly_scoped_statement
1894 static void cp_parser_already_scoped_statement
1897 /* Declarations [gram.dcl.dcl] */
1899 static void cp_parser_declaration_seq_opt
1901 static void cp_parser_declaration
1903 static void cp_parser_block_declaration
1905 static void cp_parser_simple_declaration
1907 static void cp_parser_decl_specifier_seq
1909 static tree cp_parser_storage_class_specifier_opt
1911 static tree cp_parser_function_specifier_opt
1913 static tree cp_parser_type_specifier
1916 static tree cp_parser_simple_type_specifier
1918 static tree cp_parser_type_name
1920 static tree cp_parser_nonclass_name
1922 static tree cp_parser_elaborated_type_specifier
1924 static tree cp_parser_enum_specifier
1926 static void cp_parser_enumerator_list
1928 static void cp_parser_enumerator_definition
1930 static tree cp_parser_namespace_name
1932 static void cp_parser_namespace_definition
1934 static void cp_parser_namespace_body
1936 static tree cp_parser_qualified_namespace_specifier
1938 static void cp_parser_namespace_alias_definition
1940 static bool cp_parser_using_declaration
1942 static void cp_parser_using_directive
1944 static tree cp_parser_alias_declaration
1946 static void cp_parser_asm_definition
1948 static void cp_parser_linkage_specification
1950 static void cp_parser_static_assert
1952 static tree cp_parser_decltype
1955 /* Declarators [gram.dcl.decl] */
1957 static tree cp_parser_init_declarator
1958 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *, tree *);
1963 static enum tree_code cp_parser_ptr_operator
1965 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1967 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1969 static tree cp_parser_late_return_type_opt
1971 static tree cp_parser_declarator_id
1973 static tree cp_parser_type_id
1975 static tree cp_parser_template_type_arg
1978 static tree cp_parser_type_id_1
1980 static void cp_parser_type_specifier_seq
1982 static tree cp_parser_parameter_declaration_clause
1984 static tree cp_parser_parameter_declaration_list
1988 static tree cp_parser_default_argument
1990 static void cp_parser_function_body
1992 static tree cp_parser_initializer
1994 static tree cp_parser_initializer_clause
1996 static tree cp_parser_braced_list
2001 static bool cp_parser_ctor_initializer_opt_and_function_body
2004 /* Classes [gram.class] */
2006 static tree cp_parser_class_name
2008 static tree cp_parser_class_specifier
2010 static tree cp_parser_class_head
2012 static enum tag_types cp_parser_class_key
2014 static void cp_parser_member_specification_opt
2016 static void cp_parser_member_declaration
2018 static tree cp_parser_pure_specifier
2020 static tree cp_parser_constant_initializer
2023 /* Derived classes [gram.class.derived] */
2025 static tree cp_parser_base_clause
2027 static tree cp_parser_base_specifier
2030 /* Special member functions [gram.special] */
2032 static tree cp_parser_conversion_function_id
2034 static tree cp_parser_conversion_type_id
2038 static bool cp_parser_ctor_initializer_opt
2040 static void cp_parser_mem_initializer_list
2042 static tree cp_parser_mem_initializer
2044 static tree cp_parser_mem_initializer_id
2047 /* Overloading [gram.over] */
2049 static tree cp_parser_operator_function_id
2051 static tree cp_parser_operator
2054 /* Templates [gram.temp] */
2056 static void cp_parser_template_declaration
2058 static tree cp_parser_template_parameter_list
2060 static tree cp_parser_template_parameter
2062 static tree cp_parser_type_parameter
2064 static tree cp_parser_template_id
2066 static tree cp_parser_template_name
2068 static tree cp_parser_template_argument_list
2070 static tree cp_parser_template_argument
2072 static void cp_parser_explicit_instantiation
2074 static void cp_parser_explicit_specialization
2077 /* Exception handling [gram.exception] */
2079 static tree cp_parser_try_block
2081 static bool cp_parser_function_try_block
2083 static void cp_parser_handler_seq
2085 static void cp_parser_handler
2087 static tree cp_parser_exception_declaration
2089 static tree cp_parser_throw_expression
2091 static tree cp_parser_exception_specification_opt
2093 static tree cp_parser_type_id_list
2096 /* GNU Extensions */
2098 static tree cp_parser_asm_specification_opt
2100 static tree cp_parser_asm_operand_list
2102 static tree cp_parser_asm_clobber_list
2104 static tree cp_parser_asm_label_list
2106 static tree cp_parser_attributes_opt
2108 static tree cp_parser_attribute_list
2110 static bool cp_parser_extension_opt
2112 static void cp_parser_label_declaration
2115 /* Transactional Memory Extensions */
2117 static tree cp_parser_transaction
2119 static tree cp_parser_transaction_expression
2121 static bool cp_parser_function_transaction
2123 static tree cp_parser_transaction_cancel
2127 static bool cp_parser_pragma
2130 /* Objective-C++ Productions */
2132 static tree cp_parser_objc_message_receiver
2134 static tree cp_parser_objc_message_args
2136 static tree cp_parser_objc_message_expression
2138 static tree cp_parser_objc_encode_expression
2140 static tree cp_parser_objc_defs_expression
2142 static tree cp_parser_objc_protocol_expression
2144 static tree cp_parser_objc_selector_expression
2146 static tree cp_parser_objc_expression
2148 static bool cp_parser_objc_selector_p
2150 static tree cp_parser_objc_selector
2152 static tree cp_parser_objc_protocol_refs_opt
2154 static void cp_parser_objc_declaration
2156 static tree cp_parser_objc_statement
2158 static bool cp_parser_objc_valid_prefix_attributes
2160 static void cp_parser_objc_at_property_declaration
2162 static void cp_parser_objc_at_synthesize_declaration
2164 static void cp_parser_objc_at_dynamic_declaration
2166 static tree cp_parser_objc_struct_declaration
2169 /* Utility Routines */
2171 static tree cp_parser_lookup_name
2173 static tree cp_parser_lookup_name_simple
2175 static tree cp_parser_maybe_treat_template_as_class
2177 static bool cp_parser_check_declarator_template_parameters
2179 static bool cp_parser_check_template_parameters
2181 static tree cp_parser_simple_cast_expression
2183 static tree cp_parser_global_scope_opt
2185 static bool cp_parser_constructor_declarator_p
2187 static tree cp_parser_function_definition_from_specifiers_and_declarator
2189 static tree cp_parser_function_definition_after_declarator
2191 static void cp_parser_template_declaration_after_export
2193 static void cp_parser_perform_template_parameter_access_checks
2195 static tree cp_parser_single_declaration
2197 static tree cp_parser_functional_cast
2199 static tree cp_parser_save_member_function_body
2201 static tree cp_parser_save_nsdmi
2203 static tree cp_parser_enclosed_template_argument_list
2205 static void cp_parser_save_default_args
2207 static void cp_parser_late_parsing_for_member
2209 static tree cp_parser_late_parse_one_default_arg
2211 static void cp_parser_late_parsing_nsdmi
2213 static void cp_parser_late_parsing_default_args
2215 static tree cp_parser_sizeof_operand
2217 static tree cp_parser_trait_expr
2219 static bool cp_parser_declares_only_class_p
2221 static void cp_parser_set_storage_class
2223 static void cp_parser_set_decl_spec_type
2225 static void set_and_check_decl_spec_loc
2228 static bool cp_parser_friend_p
2230 static void cp_parser_required_error
2236 static bool cp_parser_token_starts_function_definition_p
2238 static bool cp_parser_next_token_starts_class_definition_p
2240 static bool cp_parser_next_token_ends_template_argument_p
2242 static bool cp_parser_nth_token_starts_template_argument_list_p
2244 static enum tag_types cp_parser_token_is_class_key
2246 static void cp_parser_check_class_key
2248 static void cp_parser_check_access_in_redeclaration
2250 static bool cp_parser_optional_template_keyword
2252 static void cp_parser_pre_parsed_nested_name_specifier
2254 static bool cp_parser_cache_group
2256 static tree cp_parser_cache_defarg
2258 static void cp_parser_parse_tentatively
2260 static void cp_parser_commit_to_tentative_parse
2262 static void cp_parser_abort_tentative_parse
2264 static bool cp_parser_parse_definitely
2268 static bool cp_parser_uncommitted_to_tentative_parse_p
2270 static void cp_parser_error
2272 static void cp_parser_name_lookup_error
2274 static bool cp_parser_simulate_error
2276 static bool cp_parser_check_type_definition
2278 static void cp_parser_check_for_definition_in_return_type
2280 static void cp_parser_check_for_invalid_template_id
2282 static bool cp_parser_non_integral_constant_expression
2284 static void cp_parser_diagnose_invalid_type_name
2286 static bool cp_parser_parse_and_diagnose_invalid_type_name
2288 static int cp_parser_skip_to_closing_parenthesis
2290 static void cp_parser_skip_to_end_of_statement
2292 static void cp_parser_consume_semicolon_at_end_of_statement
2294 static void cp_parser_skip_to_end_of_block_or_statement
2296 static bool cp_parser_skip_to_closing_brace
2298 static void cp_parser_skip_to_end_of_template_parameter_list
2300 static void cp_parser_skip_to_pragma_eol
2302 static bool cp_parser_error_occurred
2304 static bool cp_parser_allow_gnu_extensions_p
2306 static bool cp_parser_is_pure_string_literal
2308 static bool cp_parser_is_string_literal
2310 static bool cp_parser_is_keyword
2312 static tree cp_parser_make_typename_type
2317 /* Returns nonzero if we are parsing tentatively. */
2321 {
2323 }
2325 /* Returns nonzero if TOKEN is a string literal. */
2327 static bool
2329 {
2335 }
2337 /* Returns nonzero if TOKEN is a string literal
2338 of a user-defined string literal. */
2340 static bool
2342 {
2349 }
2351 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2353 static bool
2355 {
2357 }
2359 /* If not parsing tentatively, issue a diagnostic of the form
2360 FILE:LINE: MESSAGE before TOKEN
2361 where TOKEN is the next token in the input stream. MESSAGE
2362 (specified by the caller) is usually of the form "expected
2363 OTHER-TOKEN". */
2365 static void
2367 {
2369 {
2371 /* This diagnostic makes more sense if it is tagged to the line
2372 of the token we just peeked at. */
2376 {
2381 }
2384 /* Because c_parser_error does not understand
2385 CPP_KEYWORD, keywords are treated like
2386 identifiers. */
2389 }
2390 }
2392 /* Issue an error about name-lookup failing. NAME is the
2393 IDENTIFIER_NODE DECL is the result of
2394 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2395 the thing that we hoped to find. */
2397 static void
2399 tree name,
2400 tree decl,
2401 name_lookup_error desired,
2402 location_t location)
2403 {
2404 /* If name lookup completely failed, tell the user that NAME was not
2405 declared. */
2407 {
2420 else
2422 }
2424 {
2426 {
2443 }
2444 }
2446 {
2448 {
2458 name);
2462 }
2463 }
2464 else
2465 {
2467 {
2480 }
2481 }
2482 }
2484 /* If we are parsing tentatively, remember that an error has occurred
2485 during this tentative parse. Returns true if the error was
2486 simulated; false if a message should be issued by the caller. */
2488 static bool
2490 {
2492 {
2495 }
2497 }
2499 /* This function is called when a type is defined. If type
2500 definitions are forbidden at this point, an error message is
2501 issued. */
2503 static bool
2505 {
2506 /* If types are forbidden here, issue a message. */
2508 {
2509 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2510 in the message need to be interpreted. */
2513 }
2515 }
2517 /* This function is called when the DECLARATOR is processed. The TYPE
2518 was a type defined in the decl-specifiers. If it is invalid to
2519 define a type in the decl-specifiers for DECLARATOR, an error is
2520 issued. TYPE_LOCATION is the location of TYPE and is used
2521 for error reporting. */
2523 static void
2526 {
2527 /* [dcl.fct] forbids type definitions in return types.
2528 Unfortunately, it's not easy to know whether or not we are
2529 processing a return type until after the fact. */
2537 {
2542 type);
2543 }
2544 }
2546 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2547 "<" in any valid C++ program. If the next token is indeed "<",
2548 issue a message warning the user about what appears to be an
2549 invalid attempt to form a template-id. LOCATION is the location
2550 of the type-specifier (TYPE) */
2552 static void
2554 tree type,
2556 location_t location)
2557 {
2561 {
2565 {
2568 else
2570 }
2571 else
2573 /* Remember the location of the invalid "<". */
2576 /* Consume the "<". */
2578 /* Parse the template arguments. */
2580 /* Permanently remove the invalid template arguments so that
2581 this error message is not issued again. */
2584 }
2585 }
2587 /* If parsing an integral constant-expression, issue an error message
2588 about the fact that THING appeared and return true. Otherwise,
2589 return false. In either case, set
2590 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2592 static bool
2594 non_integral_constant thing)
2595 {
2598 {
2600 {
2603 {
2610 "enumeration type cannot appear in a "
2701 }
2705 }
2706 }
2708 }
2710 /* Emit a diagnostic for an invalid type name. SCOPE is the
2711 qualifying scope (or NULL, if none) for ID. This function commits
2712 to the current active tentative parse, if any. (Otherwise, the
2713 problematic construct might be encountered again later, resulting
2714 in duplicate error messages.) LOCATION is the location of ID. */
2716 static void
2719 location_t location)
2720 {
2723 /* Try to lookup the identifier. */
2728 /* If the lookup found a template-name, it means that the user forgot
2729 to specify an argument list. Emit a useful error message. */
2733 decl);
2737 /* Something like 'unsigned A a;' */
2740 {
2741 /* Issue an error message. */
2743 /* If we're in a template class, it's possible that the user was
2744 referring to a type from a base class. For example:
2746 template <typename T> struct A { typedef T X; };
2747 template <typename T> struct B : public A<T> { X x; };
2749 The user should have said "typename A<T>::X". */
2755 {
2756 tree b;
2759 b;
2761 {
2765 {
2766 tree field;
2767 /* Go from a particular instantiation of the
2768 template (which will have an empty TYPE_FIELDs),
2769 to the main version. */
2772 field;
2776 {
2781 }
2784 }
2785 }
2786 }
2787 }
2788 /* Here we diagnose qualified-ids where the scope is actually correct,
2789 but the identifier does not resolve to a valid type name. */
2791 {
2797 {
2798 /* A<T>::A<T>() */
2804 }
2813 else
2815 }
2816 }
2818 /* Check for a common situation where a type-name should be present,
2819 but is not, and issue a sensible error message. Returns true if an
2820 invalid type-name was detected.
2822 The situation handled by this function are variable declarations of the
2823 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2824 Usually, `ID' should name a type, but if we got here it means that it
2825 does not. We try to emit the best possible error message depending on
2826 how exactly the id-expression looks like. */
2828 static bool
2830 {
2831 tree id;
2834 /* Avoid duplicate error about ambiguous lookup. */
2836 {
2840 }
2849 /* If the next token is a (, this is a function with no explicit return
2850 type, i.e. constructor, destructor or conversion op. */
2853 {
2856 }
2860 /* Emit a diagnostic for the invalid type. */
2863 out:
2864 /* If we aren't in the middle of a declarator (i.e. in a
2865 parameter-declaration-clause), skip to the end of the declaration;
2866 there's no point in trying to process it. */
2870 }
2872 /* Consume tokens up to, and including, the next non-nested closing `)'.
2873 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2874 are doing error recovery. Returns -1 if OR_COMMA is true and we
2875 found an unnested comma. */
2877 static int
2882 {
2892 {
2896 {
2899 /* If we've run out of tokens, then there is no closing `)'. */
2902 /* This is good for lambda expression capture-lists. */
2912 /* This matches the processing in skip_to_end_of_statement. */
2938 {
2942 }
2947 }
2949 /* Consume the token. */
2951 }
2952 }
2954 /* Consume tokens until we reach the end of the current statement.
2955 Normally, that will be just before consuming a `;'. However, if a
2956 non-nested `}' comes first, then we stop before consuming that. */
2958 static void
2960 {
2964 {
2968 {
2971 /* If we've run out of tokens, stop. */
2975 /* If the next token is a `;', we have reached the end of the
2976 statement. */
2982 /* If this is a non-nested '}', stop before consuming it.
2983 That way, when confronted with something like:
2985 { 3 + }
2987 we stop before consuming the closing '}', even though we
2988 have not yet reached a `;'. */
2992 /* If it is the closing '}' for a block that we have
2993 scanned, stop -- but only after consuming the token.
2994 That way given:
2996 void f g () { ... }
2997 typedef int I;
2999 we will stop after the body of the erroneously declared
3000 function, but before consuming the following `typedef'
3001 declaration. */
3003 {
3006 }
3014 }
3016 /* Consume the token. */
3018 }
3019 }
3021 /* This function is called at the end of a statement or declaration.
3022 If the next token is a semicolon, it is consumed; otherwise, error
3023 recovery is attempted. */
3025 static void
3027 {
3028 /* Look for the trailing `;'. */
3030 {
3031 /* If there is additional (erroneous) input, skip to the end of
3032 the statement. */
3034 /* If the next token is now a `;', consume it. */
3037 }
3038 }
3040 /* Skip tokens until we have consumed an entire block, or until we
3041 have consumed a non-nested `;'. */
3043 static void
3045 {
3049 {
3053 {
3056 /* If we've run out of tokens, stop. */
3060 /* Stop if this is an unnested ';'. */
3066 /* Stop if this is an unnested '}', or closes the outermost
3067 nesting level. */
3068 nesting_depth--;
3076 /* Nest. */
3077 nesting_depth++;
3082 }
3084 /* Consume the token. */
3086 }
3087 }
3089 /* Skip tokens until a non-nested closing curly brace is the next
3090 token, or there are no more tokens. Return true in the first case,
3091 false otherwise. */
3093 static bool
3095 {
3099 {
3103 {
3106 /* If we've run out of tokens, stop. */
3110 /* If the next token is a non-nested `}', then we have reached
3111 the end of the current block. */
3117 /* If it the next token is a `{', then we are entering a new
3118 block. Consume the entire block. */
3124 }
3126 /* Consume the token. */
3128 }
3129 }
3131 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3132 parameter is the PRAGMA token, allowing us to purge the entire pragma
3133 sequence. */
3135 static void
3137 {
3142 do
3146 /* Ensure that the pragma is not parsed again. */
3148 }
3150 /* Require pragma end of line, resyncing with it as necessary. The
3151 arguments are as for cp_parser_skip_to_pragma_eol. */
3153 static void
3155 {
3159 }
3161 /* This is a simple wrapper around make_typename_type. When the id is
3162 an unresolved identifier node, we can provide a superior diagnostic
3163 using cp_parser_diagnose_invalid_type_name. */
3165 static tree
3168 {
3169 tree result;
3171 {
3177 }
3179 }
3181 /* This is a wrapper around the
3182 make_{pointer,ptrmem,reference}_declarator functions that decides
3183 which one to call based on the CODE and CLASS_TYPE arguments. The
3184 CODE argument should be one of the values returned by
3185 cp_parser_ptr_operator. */
3188 cp_cv_quals cv_qualifiers,
3190 {
3197 else
3204 }
3206 /* Create a new C++ parser. */
3210 {
3215 /* cp_lexer_new_main is called before doing GC allocation because
3216 cp_lexer_new_main might load a PCH file. */
3219 /* Initialize the binops_by_token so that we can get the tree
3220 directly from the token. */
3228 /* For now, we always accept GNU extensions. */
3231 /* The `>' token is a greater-than operator, not the end of a
3232 template-id. */
3237 /* We are not parsing a constant-expression. */
3242 /* Local variable names are not forbidden. */
3245 /* We are not processing an `extern "C"' declaration. */
3248 /* We are not processing a declarator. */
3251 /* We are not processing a template-argument-list. */
3254 /* We are not in an iteration statement. */
3257 /* We are not in a switch statement. */
3260 /* We are not parsing a type-id inside an expression. */
3263 /* Declarations aren't implicitly extern "C". */
3266 /* String literals should be translated to the execution character set. */
3269 /* We are not parsing a function body. */
3272 /* We can correct until told otherwise. */
3275 /* The unparsed function queue is empty. */
3278 /* There are no classes being defined. */
3281 /* No template parameters apply. */
3285 }
3287 /* Create a cp_lexer structure which will emit the tokens in CACHE
3288 and push it onto the parser's lexer stack. This is used for delayed
3289 parsing of in-class method bodies and default arguments, and should
3290 not be confused with tentative parsing. */
3291 static void
3293 {
3298 /* Move the current source position to that of the first token in the
3299 new lexer. */
3301 }
3303 /* Pop the top lexer off the parser stack. This is never used for the
3304 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3305 static void
3307 {
3312 /* Put the current source position back where it was before this
3313 lexer was pushed. */
3315 }
3317 /* Lexical conventions [gram.lex] */
3319 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3320 identifier. */
3322 static tree
3324 {
3327 /* Look for the identifier. */
3329 /* Return the value. */
3331 }
3333 /* Parse a sequence of adjacent string constants. Returns a
3334 TREE_STRING representing the combined, nul-terminated string
3335 constant. If TRANSLATE is true, translate the string to the
3336 execution character set. If WIDE_OK is true, a wide string is
3337 invalid here.
3339 C++98 [lex.string] says that if a narrow string literal token is
3340 adjacent to a wide string literal token, the behavior is undefined.
3341 However, C99 6.4.5p4 says that this results in a wide string literal.
3342 We follow C99 here, for consistency with the C front end.
3344 This code is largely lifted from lex_string() in c-lex.c.
3346 FUTURE: ObjC++ will need to handle @-strings here. */
3347 static tree
3349 {
3350 tree value;
3357 tree string_tree;
3363 {
3366 }
3369 {
3373 }
3374 else
3375 {
3378 }
3381 /* Try to avoid the overhead of creating and destroying an obstack
3382 for the common case of just one string. */
3385 {
3393 {
3397 }
3398 else
3402 }
3403 else
3404 {
3408 do
3409 {
3411 count++;
3416 {
3419 {
3422 }
3425 {
3430 }
3432 }
3433 else
3437 {
3442 "unsupported non-standard concatenation "
3444 }
3450 {
3454 }
3455 else
3456 {
3460 }
3461 }
3465 }
3468 {
3471 }
3475 {
3480 {
3495 }
3500 {
3504 }
3505 }
3506 else
3507 /* cpp_interpret_string has issued an error. */
3514 }
3516 /* Look up a literal operator with the name and the exact arguments. */
3518 static tree
3520 {
3527 {
3534 {
3537 {
3547 }
3550 /* May be this should be sufficient_parms_p instead,
3551 depending on how exactly should user-defined literals
3552 work in presence of default arguments on the literal
3553 operator parameters. */
3556 }
3557 }
3560 }
3562 /* Parse a user-defined char constant. Returns a call to a user-defined
3563 literal operator taking the character as an argument. */
3565 static tree
3567 {
3575 /* Build up a call to the user-defined operator */
3576 /* Lookup the name we got back from the id-expression. */
3581 {
3586 }
3595 }
3597 /* A subroutine of cp_parser_userdef_numeric_literal to
3598 create a char... template parameter pack from a string node. */
3600 static tree
3602 {
3603 tree charvec;
3609 /* Fill in CHARVEC with all of the parameters. */
3614 /* Build the argument packs. */
3621 }
3623 /* Parse a user-defined numeric constant. returns a call to a user-defined
3624 literal operator. */
3626 static tree
3628 {
3638 /* Look for a literal operator taking the exact type of numeric argument
3639 as the literal value. */
3644 {
3647 {
3650 }
3651 }
3654 /* If the numeric argument didn't work, look for a raw literal
3655 operator taking a const char* argument consisting of the number
3656 in string format. */
3661 {
3664 {
3667 }
3668 }
3671 /* If the raw literal didn't work, look for a non-type template
3672 function with parameter pack char.... Call the function with
3673 template parameter characters representing the number. */
3677 {
3682 {
3685 }
3686 }
3691 }
3693 /* Parse a user-defined string constant. Returns a call to a user-defined
3694 literal operator taking a character pointer and the length of the string
3695 as arguments. */
3697 static tree
3699 {
3708 /* Build up a call to the user-defined operator */
3709 /* Lookup the name we got back from the id-expression. */
3715 {
3719 }
3728 }
3731 /* Basic concepts [gram.basic] */
3733 /* Parse a translation-unit.
3735 translation-unit:
3736 declaration-seq [opt]
3738 Returns TRUE if all went well. */
3740 static bool
3742 {
3743 /* The address of the first non-permanent object on the declarator
3744 obstack. */
3749 /* Create the declarator obstack, if necessary. */
3751 {
3753 /* Create the error declarator. */
3755 /* Create the empty parameter list. */
3757 /* Remember where the base of the declarator obstack lies. */
3759 }
3763 /* If there are no tokens left then all went well. */
3765 {
3766 /* Get rid of the token array; we don't need it any more. */
3770 /* This file might have been a context that's implicitly extern
3771 "C". If so, pop the lang context. (Only relevant for PCH.) */
3773 {
3776 }
3778 /* Finish up. */
3782 }
3783 else
3784 {
3787 }
3789 /* Make sure the declarator obstack was fully cleaned up. */
3793 /* All went well. */
3795 }
3797 /* Expressions [gram.expr] */
3799 /* Parse a primary-expression.
3801 primary-expression:
3802 literal
3803 this
3804 ( expression )
3805 id-expression
3807 GNU Extensions:
3809 primary-expression:
3810 ( compound-statement )
3811 __builtin_va_arg ( assignment-expression , type-id )
3812 __builtin_offsetof ( type-id , offsetof-expression )
3814 C++ Extensions:
3815 __has_nothrow_assign ( type-id )
3816 __has_nothrow_constructor ( type-id )
3817 __has_nothrow_copy ( type-id )
3818 __has_trivial_assign ( type-id )
3819 __has_trivial_constructor ( type-id )
3820 __has_trivial_copy ( type-id )
3821 __has_trivial_destructor ( type-id )
3822 __has_virtual_destructor ( type-id )
3823 __is_abstract ( type-id )
3824 __is_base_of ( type-id , type-id )
3825 __is_class ( type-id )
3826 __is_convertible_to ( type-id , type-id )
3827 __is_empty ( type-id )
3828 __is_enum ( type-id )
3829 __is_final ( type-id )
3830 __is_literal_type ( type-id )
3831 __is_pod ( type-id )
3832 __is_polymorphic ( type-id )
3833 __is_std_layout ( type-id )
3834 __is_trivial ( type-id )
3835 __is_union ( type-id )
3837 Objective-C++ Extension:
3839 primary-expression:
3840 objc-expression
3842 literal:
3843 __null
3845 ADDRESS_P is true iff this expression was immediately preceded by
3846 "&" and therefore might denote a pointer-to-member. CAST_P is true
3847 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3848 true iff this expression is a template argument.
3850 Returns a representation of the expression. Upon return, *IDK
3851 indicates what kind of id-expression (if any) was present. */
3853 static tree
3859 {
3862 /* Assume the primary expression is not an id-expression. */
3865 /* Peek at the next token. */
3868 {
3869 /* literal:
3870 integer-literal
3871 character-literal
3872 floating-literal
3873 string-literal
3874 boolean-literal
3875 pointer-literal
3876 user-defined-literal */
3886 {
3890 }
3891 /* Floating-point literals are only allowed in an integral
3892 constant expression if they are cast to an integral or
3893 enumeration type. */
3897 {
3898 /* CAST_P will be set even in invalid code like "int(2.7 +
3899 ...)". Therefore, we have to check that the next token
3900 is sure to end the cast. */
3902 {
3907 enumerator-definition. */
3909 /* The curly brace at the end of an enum-specifier. */
3911 /* The end of a statement. */
3913 /* The end of the cast-expression. */
3915 /* The end of an array bound. */
3917 /* The closing ">" in a template-argument-list. */
3920 /* C++0x only: A ">>" treated like two ">" tokens,
3921 in a template-argument-list. */
3926 }
3928 /* If we are within a cast, then the constraint that the
3929 cast is to an integral or enumeration type will be
3930 checked at that point. If we are not within a cast, then
3931 this code is invalid. */
3934 }
3953 /* ??? Should wide strings be allowed when parser->translate_strings_p
3954 is false (i.e. in attributes)? If not, we can kill the third
3955 argument to cp_parser_string_literal. */
3961 {
3962 tree expr;
3965 /* Consume the `('. */
3967 /* Within a parenthesized expression, a `>' token is always
3968 the greater-than operator. */
3969 saved_greater_than_is_operator_p
3972 /* If we see `( { ' then we are looking at the beginning of
3973 a GNU statement-expression. */
3976 {
3977 /* Statement-expressions are not allowed by the standard. */
3981 /* And they're not allowed outside of a function-body; you
3982 cannot, for example, write:
3984 int i = ({ int j = 3; j + 1; });
3986 at class or namespace scope. */
3989 {
3991 "statement-expressions are not allowed outside "
3995 }
3996 else
3997 {
3998 /* Start the statement-expression. */
4000 /* Parse the compound-statement. */
4002 /* Finish up. */
4004 }
4005 }
4006 else
4007 {
4008 /* Parse the parenthesized expression. */
4010 /* Let the front end know that this expression was
4011 enclosed in parentheses. This matters in case, for
4012 example, the expression is of the form `A::B', since
4013 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4014 not. */
4016 /* DR 705: Wrapping an unqualified name in parentheses
4017 suppresses arg-dependent lookup. We want to pass back
4018 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4019 (c++/37862), but none of the others. */
4022 }
4023 /* The `>' token might be the end of a template-id or
4024 template-parameter-list now. */
4025 parser->greater_than_is_operator_p
4027 /* Consume the `)'. */
4032 }
4036 /* We have an Objective-C++ message. */
4038 {
4040 /* Don't warn about a failed tentative parse. */
4045 }
4049 /* We have an Objective-C++ string literal. */
4056 {
4057 /* These two are the boolean literals. */
4065 /* The `__null' literal. */
4070 /* The `nullptr' literal. */
4075 /* Recognize the `this' keyword. */
4079 {
4083 }
4084 /* Pointers cannot appear in constant-expressions. */
4089 /* The `operator' keyword can be the beginning of an
4090 id-expression. */
4097 {
4098 non_integral_constant name;
4100 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4101 __func__ are the names of variables -- but they are
4102 treated specially. Therefore, they are handled here,
4103 rather than relying on the generic id-expression logic
4104 below. Grammatically, these names are id-expressions.
4106 Consume the token. */
4110 {
4122 }
4127 /* Look up the name. */
4129 }
4132 {
4133 tree expression;
4134 tree type;
4135 source_location type_location;
4137 /* The `__builtin_va_arg' construct is used to handle
4138 `va_arg'. Consume the `__builtin_va_arg' token. */
4140 /* Look for the opening `('. */
4142 /* Now, parse the assignment-expression. */
4145 /* Look for the `,'. */
4148 /* Parse the type-id. */
4150 /* Look for the closing `)'. */
4152 /* Using `va_arg' in a constant-expression is not
4153 allowed. */
4155 NIC_VA_ARG))
4158 }
4186 /* Objective-C++ expressions. */
4196 {
4201 }
4205 }
4207 /* An id-expression can start with either an identifier, a
4208 `::' as the beginning of a qualified-id, or the "operator"
4209 keyword. */
4214 {
4215 tree id_expression;
4216 tree decl;
4222 id_expression:
4223 /* Parse the id-expression. */
4224 id_expression
4241 /* If we have a template-id, then no further lookup is
4242 required. If the template-id was for a template-class, we
4243 will sometimes have a TYPE_DECL at this point. */
4247 /* Look up the name. */
4248 else
4249 {
4250 tree ambiguous_decls;
4252 /* If we already know that this lookup is ambiguous, then
4253 we've already issued an error message; there's no reason
4254 to check again. */
4257 {
4260 }
4263 none_type,
4264 template_p,
4269 /* If the lookup was ambiguous, an error will already have
4270 been issued. */
4274 /* In Objective-C++, we may have an Objective-C 2.0
4275 dot-syntax for classes here. */
4280 {
4281 tree component;
4288 }
4290 /* In Objective-C++, an instance variable (ivar) may be preferred
4291 to whatever cp_parser_lookup_name() found. */
4294 /* If name lookup gives us a SCOPE_REF, then the
4295 qualifying scope was dependent. */
4297 {
4298 /* At this point, we do not know if DECL is a valid
4299 integral constant expression. We assume that it is
4300 in fact such an expression, so that code like:
4302 template <int N> struct A {
4303 int a[B<N>::i];
4304 };
4306 is accepted. At template-instantiation time, we
4307 will check that B<N>::i is actually a constant. */
4309 }
4310 /* Check to see if DECL is a local variable in a context
4311 where that is forbidden. */
4314 {
4315 /* It might be that we only found DECL because we are
4316 trying to be generous with pre-ISO scoping rules.
4317 For example, consider:
4319 int i;
4320 void g() {
4321 for (int i = 0; i < 10; ++i) {}
4322 extern void f(int j = i);
4323 }
4325 Here, name look up will originally find the out
4326 of scope `i'. We need to issue a warning message,
4327 but then use the global `i'. */
4330 {
4333 decl);
4335 }
4336 }
4337 }
4339 decl = (finish_id_expression
4341 idk,
4346 template_arg_p,
4352 }
4354 /* Anything else is an error. */
4358 }
4359 }
4361 /* Parse an id-expression.
4363 id-expression:
4364 unqualified-id
4365 qualified-id
4367 qualified-id:
4368 :: [opt] nested-name-specifier template [opt] unqualified-id
4369 :: identifier
4370 :: operator-function-id
4371 :: template-id
4373 Return a representation of the unqualified portion of the
4374 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4375 a `::' or nested-name-specifier.
4377 Often, if the id-expression was a qualified-id, the caller will
4378 want to make a SCOPE_REF to represent the qualified-id. This
4379 function does not do this in order to avoid wastefully creating
4380 SCOPE_REFs when they are not required.
4382 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4383 `template' keyword.
4385 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4386 uninstantiated templates.
4388 If *TEMPLATE_P is non-NULL, it is set to true iff the
4389 `template' keyword is used to explicitly indicate that the entity
4390 named is a template.
4392 If DECLARATOR_P is true, the id-expression is appearing as part of
4393 a declarator, rather than as part of an expression. */
4395 static tree
4402 {
4406 /* Assume the `template' keyword was not used. */
4410 /* Look for the optional `::' operator. */
4411 global_scope_p
4414 /* Look for the optional nested-name-specifier. */
4415 nested_name_specifier_p
4418 check_dependency_p,
4420 declarator_p)
4422 /* If there is a nested-name-specifier, then we are looking at
4423 the first qualified-id production. */
4425 {
4426 tree saved_scope;
4427 tree saved_object_scope;
4428 tree saved_qualifying_scope;
4429 tree unqualified_id;
4432 /* See if the next token is the `template' keyword. */
4436 /* Name lookup we do during the processing of the
4437 unqualified-id might obliterate SCOPE. */
4441 /* Process the final unqualified-id. */
4443 check_dependency_p,
4444 declarator_p,
4446 /* Restore the SAVED_SCOPE for our caller. */
4452 }
4453 /* Otherwise, if we are in global scope, then we are looking at one
4454 of the other qualified-id productions. */
4456 {
4458 tree id;
4460 /* Peek at the next token. */
4463 /* If it's an identifier, and the next token is not a "<", then
4464 we can avoid the template-id case. This is an optimization
4465 for this common case. */
4467 && !cp_parser_nth_token_starts_template_argument_list_p
4472 /* Try a template-id. */
4476 none_type,
4477 declarator_p);
4478 /* If that worked, we're done. */
4482 /* Peek at the next token. (Changes in the token buffer may
4483 have invalidated the pointer obtained above.) */
4487 {
4494 /* Fall through. */
4499 }
4500 }
4501 else
4504 declarator_p,
4505 optional_p);
4506 }
4508 /* Parse an unqualified-id.
4510 unqualified-id:
4511 identifier
4512 operator-function-id
4513 conversion-function-id
4514 ~ class-name
4515 template-id
4517 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4518 keyword, in a construct like `A::template ...'.
4520 Returns a representation of unqualified-id. For the `identifier'
4521 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4522 production a BIT_NOT_EXPR is returned; the operand of the
4523 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4524 other productions, see the documentation accompanying the
4525 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4526 names are looked up in uninstantiated templates. If DECLARATOR_P
4527 is true, the unqualified-id is appearing as part of a declarator,
4528 rather than as part of an expression. */
4530 static tree
4536 {
4539 /* Peek at the next token. */
4543 {
4545 {
4546 tree id;
4548 /* We don't know yet whether or not this will be a
4549 template-id. */
4551 /* Try a template-id. */
4553 check_dependency_p,
4554 none_type,
4555 declarator_p);
4556 /* If it worked, we're done. */
4559 /* Otherwise, it's an ordinary identifier. */
4561 }
4565 check_dependency_p,
4566 none_type,
4567 declarator_p);
4570 {
4571 tree type_decl;
4572 tree qualifying_scope;
4573 tree object_scope;
4574 tree scope;
4577 /* Consume the `~' token. */
4579 /* Parse the class-name. The standard, as written, seems to
4580 say that:
4582 template <typename T> struct S { ~S (); };
4583 template <typename T> S<T>::~S() {}
4585 is invalid, since `~' must be followed by a class-name, but
4586 `S<T>' is dependent, and so not known to be a class.
4587 That's not right; we need to look in uninstantiated
4588 templates. A further complication arises from:
4590 template <typename T> void f(T t) {
4591 t.T::~T();
4592 }
4594 Here, it is not possible to look up `T' in the scope of `T'
4595 itself. We must look in both the current scope, and the
4596 scope of the containing complete expression.
4598 Yet another issue is:
4600 struct S {
4601 int S;
4602 ~S();
4603 };
4605 S::~S() {}
4607 The standard does not seem to say that the `S' in `~S'
4608 should refer to the type `S' and not the data member
4609 `S::S'. */
4611 /* DR 244 says that we look up the name after the "~" in the
4612 same scope as we looked up the qualifying name. That idea
4613 isn't fully worked out; it's more complicated than that. */
4618 /* Check for invalid scopes. */
4620 {
4624 }
4626 {
4630 scope);
4635 }
4638 /* If the name is of the form "X::~X" it's OK even if X is a
4639 typedef. */
4648 {
4651 }
4653 /* If there was an explicit qualification (S::~T), first look
4654 in the scope given by the qualification (i.e., S).
4656 Note: in the calls to cp_parser_class_name below we pass
4657 typename_type so that lookup finds the injected-class-name
4658 rather than the constructor. */
4662 {
4667 typename_type,
4670 declarator_p);
4673 }
4674 /* In "N::S::~S", look in "N" as well. */
4676 {
4681 type_decl
4685 typename_type,
4688 declarator_p);
4691 }
4692 /* In "p->S::~T", look in the scope given by "*p" as well. */
4694 {
4699 type_decl
4703 typename_type,
4706 declarator_p);
4709 }
4710 /* Look in the surrounding context. */
4712 {
4718 type_decl
4722 typename_type,
4725 declarator_p);
4728 {
4729 /* We couldn't find a type with this name, so just accept
4730 it and check for a match at instantiation time. */
4735 }
4736 }
4737 /* If an error occurred, assume that the name of the
4738 destructor is the same as the name of the qualifying
4739 class. That allows us to keep parsing after running
4740 into ill-formed destructor names. */
4746 /* Check that destructor name and scope match. */
4748 {
4755 }
4757 /* [class.dtor]
4759 A typedef-name that names a class shall not be used as the
4760 identifier in the declarator for a destructor declaration. */
4767 type_decl);
4770 }
4774 {
4775 tree id;
4777 /* This could be a template-id, so we try that first. */
4779 /* Try a template-id. */
4782 none_type,
4783 declarator_p);
4784 /* If that worked, we're done. */
4787 /* We still don't know whether we're looking at an
4788 operator-function-id or a conversion-function-id. */
4790 /* Try an operator-function-id. */
4792 /* If that didn't work, try a conversion-function-id. */
4796 {
4797 /* 17.6.3.3.5 */
4802 }
4805 }
4806 /* Fall through. */
4813 }
4814 }
4816 /* Parse an (optional) nested-name-specifier.
4818 nested-name-specifier: [C++98]
4819 class-or-namespace-name :: nested-name-specifier [opt]
4820 class-or-namespace-name :: template nested-name-specifier [opt]
4822 nested-name-specifier: [C++0x]
4823 type-name ::
4824 namespace-name ::
4825 nested-name-specifier identifier ::
4826 nested-name-specifier template [opt] simple-template-id ::
4828 PARSER->SCOPE should be set appropriately before this function is
4829 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4830 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4831 in name lookups.
4833 Sets PARSER->SCOPE to the class (TYPE) or namespace
4834 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4835 it unchanged if there is no nested-name-specifier. Returns the new
4836 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4838 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4839 part of a declaration and/or decl-specifier. */
4841 static tree
4847 {
4852 /* Remember where the nested-name-specifier starts. */
4854 {
4857 }
4860 {
4861 tree new_scope;
4862 tree old_scope;
4863 tree saved_qualifying_scope;
4866 /* Spot cases that cannot be the beginning of a
4867 nested-name-specifier. */
4870 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4871 the already parsed nested-name-specifier. */
4873 {
4874 /* Grab the nested-name-specifier and continue the loop. */
4876 /* If we originally encountered this nested-name-specifier
4877 with IS_DECLARATION set to false, we will not have
4878 resolved TYPENAME_TYPEs, so we must do so here. */
4881 {
4886 }
4889 }
4891 /* Spot cases that cannot be the beginning of a
4892 nested-name-specifier. On the second and subsequent times
4893 through the loop, we look for the `template' keyword. */
4895 ;
4896 /* A template-id can start a nested-name-specifier. */
4898 ;
4899 /* DR 743: decltype can be used in a nested-name-specifier. */
4901 ;
4902 else
4903 {
4904 /* If the next token is not an identifier, then it is
4905 definitely not a type-name or namespace-name. */
4908 /* If the following token is neither a `<' (to begin a
4909 template-id), nor a `::', then we are not looking at a
4910 nested-name-specifier. */
4916 {
4920 }
4923 && !cp_parser_nth_token_starts_template_argument_list_p
4926 }
4928 /* The nested-name-specifier is optional, so we parse
4929 tentatively. */
4932 /* Look for the optional `template' keyword, if this isn't the
4933 first time through the loop. */
4936 else
4939 /* Save the old scope since the name lookup we are about to do
4940 might destroy it. */
4943 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4944 look up names in "X<T>::I" in order to determine that "Y" is
4945 a template. So, if we have a typename at this point, we make
4946 an effort to look through it. */
4948 && !typename_keyword_p
4953 /* Parse the qualifying entity. */
4954 new_scope
4956 typename_keyword_p,
4957 template_keyword_p,
4958 check_dependency_p,
4959 type_p,
4960 is_declaration);
4961 /* Look for the `::' token. */
4964 /* If we found what we wanted, we keep going; otherwise, we're
4965 done. */
4967 {
4970 /* Restore the OLD_SCOPE since it was valid before the
4971 failed attempt at finding the last
4972 class-or-namespace-name. */
4976 /* If the next token is a decltype, and the one after that is a
4977 `::', then the decltype has failed to resolve to a class or
4978 enumeration type. Give this error even when parsing
4979 tentatively since it can't possibly be valid--and we're going
4980 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
4981 won't get another chance.*/
4985 {
4992 /* As below. */
4995 }
4999 /* If the next token is an identifier, and the one after
5000 that is a `::', then any valid interpretation would have
5001 found a class-or-namespace-name. */
5007 {
5010 {
5012 {
5013 tree decl;
5014 tree ambiguous_decls;
5017 none_type,
5026 decl);
5028 {
5034 }
5035 else
5036 {
5038 cp_parser_name_lookup_error
5041 else
5042 cp_parser_name_lookup_error
5045 }
5046 }
5049 /* Treat this as a successful nested-name-specifier
5050 due to:
5052 [basic.lookup.qual]
5054 If the name found is not a class-name (clause
5055 _class_) or namespace-name (_namespace.def_), the
5056 program is ill-formed. */
5058 }
5060 }
5062 }
5063 /* We've found one valid nested-name-specifier. */
5065 /* Name lookup always gives us a DECL. */
5068 /* Uses of "template" must be followed by actual templates. */
5080 new_scope);
5081 /* If it is a class scope, try to complete it; we are about to
5082 be looking up names inside the class. */
5084 /* Since checking types for dependency can be expensive,
5085 avoid doing it if the type is already complete. */
5087 /* Do not try to complete dependent types. */
5089 {
5091 /* If it is a typedef to current class, use the current
5092 class instead, as the typedef won't have any names inside
5093 it yet. */
5097 }
5098 /* Make sure we look in the right scope the next time through
5099 the loop. */
5101 }
5103 /* If parsing tentatively, replace the sequence of tokens that makes
5104 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5105 token. That way, should we re-parse the token stream, we will
5106 not have to repeat the effort required to do the parse, nor will
5107 we issue duplicate error messages. */
5109 {
5113 /* Reset the contents of the START token. */
5115 /* Retrieve any deferred checks. Do not pop this access checks yet
5116 so the memory will not be reclaimed during token replacing below. */
5124 /* Purge all subsequent tokens. */
5126 }
5132 }
5134 /* Parse a nested-name-specifier. See
5135 cp_parser_nested_name_specifier_opt for details. This function
5136 behaves identically, except that it will an issue an error if no
5137 nested-name-specifier is present. */
5139 static tree
5145 {
5146 tree scope;
5148 /* Look for the nested-name-specifier. */
5150 typename_keyword_p,
5151 check_dependency_p,
5152 type_p,
5153 is_declaration);
5154 /* If it was not present, issue an error message. */
5156 {
5159 }
5162 }
5164 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5165 this is either a class-name or a namespace-name (which corresponds
5166 to the class-or-namespace-name production in the grammar). For
5167 C++0x, it can also be a type-name that refers to an enumeration
5168 type or a simple-template-id.
5170 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5171 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5172 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5173 TYPE_P is TRUE iff the next name should be taken as a class-name,
5174 even the same name is declared to be another entity in the same
5175 scope.
5177 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5178 specified by the class-or-namespace-name. If neither is found the
5179 ERROR_MARK_NODE is returned. */
5181 static tree
5188 {
5189 tree saved_scope;
5190 tree saved_qualifying_scope;
5191 tree saved_object_scope;
5192 tree scope;
5196 /* DR 743: decltype can appear in a nested-name-specifier. */
5198 {
5202 {
5205 }
5209 }
5211 /* Before we try to parse the class-name, we must save away the
5212 current PARSER->SCOPE since cp_parser_class_name will destroy
5213 it. */
5217 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5218 there is no need to look for a namespace-name. */
5219 only_class_p = template_keyword_p
5224 typename_keyword_p,
5225 template_keyword_p,
5227 check_dependency_p,
5229 is_declaration);
5231 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5235 {
5236 /* Restore the saved scope. */
5241 /* Parse tentatively. */
5244 /* Parse a type-name */
5247 /* "If the name found does not designate a namespace or a class,
5248 enumeration, or dependent type, the program is ill-formed."
5250 We cover classes and dependent types above and namespaces below,
5251 so this code is only looking for enums. */
5257 }
5258 /* If that didn't work, try for a namespace-name. */
5260 {
5261 /* Restore the saved scope. */
5265 /* If we are not looking at an identifier followed by the scope
5266 resolution operator, then this is not part of a
5267 nested-name-specifier. (Note that this function is only used
5268 to parse the components of a nested-name-specifier.) */
5273 }
5276 }
5278 /* Parse a postfix-expression.
5280 postfix-expression:
5281 primary-expression
5282 postfix-expression [ expression ]
5283 postfix-expression ( expression-list [opt] )
5284 simple-type-specifier ( expression-list [opt] )
5285 typename :: [opt] nested-name-specifier identifier
5286 ( expression-list [opt] )
5287 typename :: [opt] nested-name-specifier template [opt] template-id
5288 ( expression-list [opt] )
5289 postfix-expression . template [opt] id-expression
5290 postfix-expression -> template [opt] id-expression
5291 postfix-expression . pseudo-destructor-name
5292 postfix-expression -> pseudo-destructor-name
5293 postfix-expression ++
5294 postfix-expression --
5295 dynamic_cast < type-id > ( expression )
5296 static_cast < type-id > ( expression )
5297 reinterpret_cast < type-id > ( expression )
5298 const_cast < type-id > ( expression )
5299 typeid ( expression )
5300 typeid ( type-id )
5302 GNU Extension:
5304 postfix-expression:
5305 ( type-id ) { initializer-list , [opt] }
5307 This extension is a GNU version of the C99 compound-literal
5308 construct. (The C99 grammar uses `type-name' instead of `type-id',
5309 but they are essentially the same concept.)
5311 If ADDRESS_P is true, the postfix expression is the operand of the
5312 `&' operator. CAST_P is true if this expression is the target of a
5313 cast.
5315 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5316 class member access expressions [expr.ref].
5318 Returns a representation of the expression. */
5320 static tree
5324 {
5331 /* Peek at the next token. */
5333 /* Some of the productions are determined by keywords. */
5336 {
5341 {
5342 tree type;
5343 tree expression;
5346 /* All of these can be handled in the same way from the point
5347 of view of parsing. Begin by consuming the token
5348 identifying the cast. */
5351 /* New types cannot be defined in the cast. */
5353 parser->type_definition_forbidden_message
5356 /* Look for the opening `<'. */
5358 /* Parse the type to which we are casting. */
5360 /* Look for the closing `>'. */
5362 /* Restore the old message. */
5365 /* And the expression which is being cast. */
5370 /* Only type conversions to integral or enumeration types
5371 can be used in constant-expressions. */
5377 {
5379 postfix_expression
5383 postfix_expression
5387 postfix_expression
5389 tf_warning_or_error);
5392 postfix_expression
5397 }
5398 }
5402 {
5403 tree type;
5407 /* Consume the `typeid' token. */
5409 /* Look for the `(' token. */
5411 /* Types cannot be defined in a `typeid' expression. */
5413 parser->type_definition_forbidden_message
5415 /* We can't be sure yet whether we're looking at a type-id or an
5416 expression. */
5418 /* Try a type-id first. */
5423 /* Look for the `)' token. Otherwise, we can't be sure that
5424 we're not looking at an expression: consider `typeid (int
5425 (3))', for example. */
5427 /* If all went well, simply lookup the type-id. */
5430 /* Otherwise, fall back to the expression variant. */
5431 else
5432 {
5433 tree expression;
5435 /* Look for an expression. */
5437 /* Compute its typeid. */
5439 /* Look for the `)' token. */
5441 }
5442 /* Restore the saved message. */
5444 /* `typeid' may not appear in an integral constant expression. */
5447 }
5451 {
5452 tree type;
5453 /* The syntax permitted here is the same permitted for an
5454 elaborated-type-specifier. */
5459 }
5463 {
5466 tree p;
5480 return
5481 c_build_vec_perm_expr
5486 return
5487 c_build_vec_perm_expr
5491 else
5492 {
5496 }
5498 }
5501 {
5502 tree type;
5504 /* If the next thing is a simple-type-specifier, we may be
5505 looking at a functional cast. We could also be looking at
5506 an id-expression. So, we try the functional cast, and if
5507 that doesn't work we fall back to the primary-expression. */
5509 /* Look for the simple-type-specifier. */
5512 CP_PARSER_FLAGS_NONE);
5513 /* Parse the cast itself. */
5515 postfix_expression
5517 /* If that worked, we're done. */
5521 /* If the functional-cast didn't work out, try a
5522 compound-literal. */
5525 {
5530 /* Consume the `('. */
5532 /* Parse the type. */
5537 /* Look for the `)'. */
5539 /* Look for the `{'. */
5541 /* If things aren't going well, there's no need to
5542 keep going. */
5544 {
5546 /* Parse the initializer-list. */
5547 initializer_list
5549 /* Allow a trailing `,'. */
5552 /* Look for the final `}'. */
5554 }
5555 /* If that worked, we're definitely looking at a
5556 compound-literal expression. */
5558 {
5559 /* Warn the user that a compound literal is not
5560 allowed in standard C++. */
5562 /* For simplicity, we disallow compound literals in
5563 constant-expressions. We could
5564 allow compound literals of integer type, whose
5565 initializer was a constant, in constant
5566 expressions. Permitting that usage, as a further
5567 extension, would not change the meaning of any
5568 currently accepted programs. (Of course, as
5569 compound literals are not part of ISO C++, the
5570 standard has nothing to say.) */
5572 NIC_NCC))
5573 {
5576 }
5577 /* Form the representation of the compound-literal. */
5578 postfix_expression
5579 = (finish_compound_literal
5581 initializer_list),
5582 tf_warning_or_error));
5584 }
5585 }
5587 /* It must be a primary-expression. */
5588 postfix_expression
5592 }
5594 }
5596 /* Keep looping until the postfix-expression is complete. */
5598 {
5602 /* It is not a Koenig lookup function call. */
5603 postfix_expression
5606 /* Peek at the next token. */
5610 {
5612 postfix_expression
5614 postfix_expression,
5621 /* postfix-expression ( expression-list [opt] ) */
5622 {
5631 is_builtin_constant_p
5634 {
5635 /* The whole point of __builtin_constant_p is to allow
5636 non-constant expressions to appear as arguments. */
5637 saved_integral_constant_expression_p
5639 saved_non_integral_constant_expression_p
5642 }
5643 args = (cp_parser_parenthesized_expression_list
5648 {
5649 parser->integral_constant_expression_p
5651 parser->non_integral_constant_expression_p
5653 }
5656 {
5659 }
5661 /* Function calls are not permitted in
5662 constant-expressions. */
5665 NIC_FUNC_CALL))
5666 {
5670 }
5675 {
5677 {
5679 {
5682 postfix_expression
5685 tf_warning_or_error);
5686 }
5687 else
5688 postfix_expression
5690 }
5691 /* We do not perform argument-dependent lookup if
5692 normal lookup finds a non-function, in accordance
5693 with the expected resolution of DR 218. */
5696 {
5700 /* Do not do argument dependent lookup if regular
5701 lookup finds a member function or a block-scope
5702 function declaration. [basic.lookup.argdep]/3 */
5705 {
5708 postfix_expression
5711 tf_warning_or_error);
5712 }
5713 }
5714 }
5717 {
5727 {
5728 postfix_expression
5732 }
5735 {
5736 postfix_expression
5737 = (build_new_method_call
5743 tf_warning_or_error));
5744 }
5745 else
5746 postfix_expression
5750 tf_warning_or_error);
5751 }
5755 postfix_expression = (build_offset_ref_call_from_tree
5758 /* A call to a static class member, or a namespace-scope
5759 function. */
5760 postfix_expression
5763 koenig_p,
5764 tf_warning_or_error);
5765 else
5766 /* All other function calls. */
5767 postfix_expression
5770 koenig_p,
5771 tf_warning_or_error);
5773 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5777 }
5782 /* postfix-expression . template [opt] id-expression
5783 postfix-expression . pseudo-destructor-name
5784 postfix-expression -> template [opt] id-expression
5785 postfix-expression -> pseudo-destructor-name */
5787 /* Consume the `.' or `->' operator. */
5790 postfix_expression
5792 postfix_expression,
5800 /* postfix-expression ++ */
5801 /* Consume the `++' token. */
5803 /* Generate a representation for the complete expression. */
5804 postfix_expression
5806 POSTINCREMENT_EXPR);
5807 /* Increments may not appear in constant-expressions. */
5815 /* postfix-expression -- */
5816 /* Consume the `--' token. */
5818 /* Generate a representation for the complete expression. */
5819 postfix_expression
5821 POSTDECREMENT_EXPR);
5822 /* Decrements may not appear in constant-expressions. */
5834 else
5836 }
5837 }
5839 /* We should never get here. */
5842 }
5844 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5845 by cp_parser_builtin_offsetof. We're looking for
5847 postfix-expression [ expression ]
5848 postfix-expression [ braced-init-list ] (C++11)
5850 FOR_OFFSETOF is set if we're being called in that context, which
5851 changes how we deal with integer constant expressions. */
5853 static tree
5855 tree postfix_expression,
5857 {
5858 tree index;
5861 /* Consume the `[' token. */
5864 /* Parse the index expression. */
5865 /* ??? For offsetof, there is a question of what to allow here. If
5866 offsetof is not being used in an integral constant expression context,
5867 then we *could* get the right answer by computing the value at runtime.
5868 If we are in an integral constant expression context, then we might
5869 could accept any constant expression; hard to say without analysis.
5870 Rather than open the barn door too wide right away, allow only integer
5871 constant expressions here. */
5874 else
5875 {
5877 {
5881 }
5882 else
5884 }
5886 /* Look for the closing `]'. */
5889 /* Build the ARRAY_REF. */
5892 /* When not doing offsetof, array references are not permitted in
5893 constant-expressions. */
5899 }
5901 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5902 by cp_parser_builtin_offsetof. We're looking for
5904 postfix-expression . template [opt] id-expression
5905 postfix-expression . pseudo-destructor-name
5906 postfix-expression -> template [opt] id-expression
5907 postfix-expression -> pseudo-destructor-name
5909 FOR_OFFSETOF is set if we're being called in that context. That sorta
5910 limits what of the above we'll actually accept, but nevermind.
5911 TOKEN_TYPE is the "." or "->" token, which will already have been
5912 removed from the stream. */
5914 static tree
5917 tree postfix_expression,
5919 location_t location)
5920 {
5921 tree name;
5926 /* If this is a `->' operator, dereference the pointer. */
5929 tf_warning_or_error);
5930 /* Check to see whether or not the expression is type-dependent. */
5932 /* The identifier following the `->' or `.' is not qualified. */
5938 /* Enter the scope corresponding to the type of the object
5939 given by the POSTFIX_EXPRESSION. */
5941 {
5943 /* According to the standard, no expression should ever have
5944 reference type. Unfortunately, we do not currently match
5945 the standard in this respect in that our internal representation
5946 of an expression may have reference type even when the standard
5947 says it does not. Therefore, we have to manually obtain the
5948 underlying type here. */
5950 /* The type of the POSTFIX_EXPRESSION must be complete. */
5952 {
5954 postfix_expression);
5956 }
5957 /* Unlike the object expression in other contexts, *this is not
5958 required to be of complete type for purposes of class member
5959 access (5.2.5) outside the member function body. */
5963 /* Let the name lookup machinery know that we are processing a
5964 class member access expression. */
5966 /* If something went wrong, we want to be able to discern that case,
5967 as opposed to the case where there was no SCOPE due to the type
5968 of expression being dependent. */
5971 /* If the SCOPE was erroneous, make the various semantic analysis
5972 functions exit quickly -- and without issuing additional error
5973 messages. */
5976 }
5978 /* Assume this expression is not a pseudo-destructor access. */
5981 /* If the SCOPE is a scalar type, then, if this is a valid program,
5982 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5983 is type dependent, it can be pseudo-destructor-name or something else.
5984 Try to parse it as pseudo-destructor-name first. */
5986 {
5987 tree s;
5988 tree type;
5991 /* Parse the pseudo-destructor-name. */
6000 {
6002 postfix_expression
6005 }
6006 }
6009 {
6010 /* If the SCOPE is not a scalar type, we are looking at an
6011 ordinary class member access expression, rather than a
6012 pseudo-destructor-name. */
6015 /* Parse the id-expression. */
6016 name = (cp_parser_id_expression
6023 /* In general, build a SCOPE_REF if the member name is qualified.
6024 However, if the name was not dependent and has already been
6025 resolved; there is no need to build the SCOPE_REF. For example;
6027 struct X { void f(); };
6028 template <typename T> void f(T* t) { t->X::f(); }
6030 Even though "t" is dependent, "X::f" is not and has been resolved
6031 to a BASELINK; there is no need to include scope information. */
6033 /* But we do need to remember that there was an explicit scope for
6034 virtual function calls. */
6038 /* If the name is a template-id that names a type, we will get a
6039 TYPE_DECL here. That is invalid code. */
6041 {
6044 }
6045 else
6046 {
6048 {
6050 {
6054 }
6055 else
6058 name,
6059 template_p);
6063 }
6065 adjust_result_of_qualified_name_lookup
6067 postfix_expression
6069 template_p,
6070 tf_warning_or_error);
6071 }
6072 }
6074 /* We no longer need to look up names in the scope of the object on
6075 the left-hand side of the `.' or `->' operator. */
6078 /* Outside of offsetof, these operators may not appear in
6079 constant-expressions. */
6081 && (cp_parser_non_integral_constant_expression
6086 }
6088 /* Parse a parenthesized expression-list.
6090 expression-list:
6091 assignment-expression
6092 expression-list, assignment-expression
6094 attribute-list:
6095 expression-list
6096 identifier
6097 identifier, expression-list
6099 CAST_P is true if this expression is the target of a cast.
6101 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6102 argument pack.
6104 Returns a vector of trees. Each element is a representation of an
6105 assignment-expression. NULL is returned if the ( and or ) are
6106 missing. An empty, but allocated, vector is returned on no
6107 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6108 if we are parsing an attribute list for an attribute that wants a
6109 plain identifier argument, normal_attr for an attribute that wants
6110 an expression, or non_attr if we aren't parsing an attribute list. If
6111 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6112 not all of the expressions in the list were constant. */
6120 {
6126 /* Assume all the expressions will be constant. */
6135 /* Within a parenthesized expression, a `>' token is always
6136 the greater-than operator. */
6137 saved_greater_than_is_operator_p
6141 /* Consume expressions until there are no more. */
6144 {
6145 tree expr;
6147 /* At the beginning of attribute lists, check to see if the
6148 next token is an identifier. */
6151 {
6154 /* Consume the identifier. */
6156 /* Save the identifier. */
6158 }
6159 else
6160 {
6163 /* Parse the next assignment-expression. */
6165 {
6166 /* A braced-init-list. */
6171 }
6173 {
6174 expr = (cp_parser_constant_expression
6179 }
6180 else
6186 /* If we have an ellipsis, then this is an expression
6187 expansion. */
6190 {
6191 /* Consume the `...'. */
6194 /* Build the argument pack. */
6196 }
6198 /* Add it to the list. We add error_mark_node
6199 expressions to the list, so that we can still tell if
6200 the correct form for a parenthesized expression-list
6201 is found. That gives better errors. */
6206 }
6208 /* After the first item, attribute lists look the same as
6209 expression lists. */
6212 get_comma:;
6213 /* If the next token isn't a `,', then we are done. */
6217 /* Otherwise, consume the `,' and keep going. */
6219 }
6222 {
6225 skip_comma:;
6226 /* We try and resync to an unnested comma, as that will give the
6227 user better diagnostics. */
6235 {
6236 parser->greater_than_is_operator_p
6239 }
6240 }
6242 parser->greater_than_is_operator_p
6249 }
6251 /* Parse a pseudo-destructor-name.
6253 pseudo-destructor-name:
6254 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6255 :: [opt] nested-name-specifier template template-id :: ~ type-name
6256 :: [opt] nested-name-specifier [opt] ~ type-name
6258 If either of the first two productions is used, sets *SCOPE to the
6259 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6260 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6261 or ERROR_MARK_NODE if the parse fails. */
6263 static void
6267 {
6270 /* Assume that things will not work out. */
6273 /* Look for the optional `::' operator. */
6275 /* Look for the optional nested-name-specifier. */
6276 nested_name_specifier_p
6283 /* Now, if we saw a nested-name-specifier, we might be doing the
6284 second production. */
6287 {
6288 /* Consume the `template' keyword. */
6290 /* Parse the template-id. */
6294 class_type,
6296 /* Look for the `::' token. */
6298 }
6299 /* If the next token is not a `~', then there might be some
6300 additional qualification. */
6302 {
6303 /* At this point, we're looking for "type-name :: ~". The type-name
6304 must not be a class-name, since this is a pseudo-destructor. So,
6305 it must be either an enum-name, or a typedef-name -- both of which
6306 are just identifiers. So, we peek ahead to check that the "::"
6307 and "~" tokens are present; if they are not, then we can avoid
6308 calling type_name. */
6312 {
6315 }
6317 /* Look for the type-name. */
6322 /* Look for the `::' token. */
6324 }
6325 else
6328 /* Look for the `~'. */
6331 /* Once we see the ~, this has to be a pseudo-destructor. */
6335 /* Look for the type-name again. We are not responsible for
6336 checking that it matches the first type-name. */
6338 }
6340 /* Parse a unary-expression.
6342 unary-expression:
6343 postfix-expression
6344 ++ cast-expression
6345 -- cast-expression
6346 unary-operator cast-expression
6347 sizeof unary-expression
6348 sizeof ( type-id )
6349 alignof ( type-id ) [C++0x]
6350 new-expression
6351 delete-expression
6353 GNU Extensions:
6355 unary-expression:
6356 __extension__ cast-expression
6357 __alignof__ unary-expression
6358 __alignof__ ( type-id )
6359 alignof unary-expression [C++0x]
6360 __real__ cast-expression
6361 __imag__ cast-expression
6362 && identifier
6364 ADDRESS_P is true iff the unary-expression is appearing as the
6365 operand of the `&' operator. CAST_P is true if this expression is
6366 the target of a cast.
6368 Returns a representation of the expression. */
6370 static tree
6373 {
6377 /* Peek at the next token. */
6379 /* Some keywords give away the kind of expression. */
6381 {
6385 {
6388 {
6389 tree operand;
6393 /* Consume the token. */
6395 /* Parse the operand. */
6400 else
6401 {
6402 /* ISO C++ defines alignof only with types, not with
6403 expressions. So pedwarn if alignof is used with a non-
6404 type expression. However, __alignof__ is ok. */
6407 "ISO C++ does not allow %<alignof%> "
6411 }
6412 }
6421 {
6422 /* The saved value of the PEDANTIC flag. */
6424 tree expr;
6426 /* Save away the PEDANTIC flag. */
6428 /* Parse the cast-expression. */
6430 /* Restore the PEDANTIC flag. */
6434 }
6438 {
6439 tree expression;
6441 /* Consume the `__real__' or `__imag__' token. */
6443 /* Parse the cast-expression. */
6445 /* Create the complete representation. */
6449 expression,
6450 tf_warning_or_error);
6451 }
6459 {
6460 tree expr;
6470 parser->type_definition_forbidden_message
6473 saved_integral_constant_expression_p
6475 saved_non_integral_constant_expression_p
6479 saved_greater_than_is_operator_p
6489 parser->greater_than_is_operator_p
6492 parser->integral_constant_expression_p
6494 parser->non_integral_constant_expression_p
6501 }
6505 }
6506 }
6508 /* Look for the `:: new' and `:: delete', which also signal the
6509 beginning of a new-expression, or delete-expression,
6510 respectively. If the next token is `::', then it might be one of
6511 these. */
6513 {
6516 /* See if the token after the `::' is one of the keywords in
6517 which we're interested. */
6519 /* If it's `new', we have a new-expression. */
6522 /* Similarly, for `delete'. */
6525 }
6527 /* Look for a unary operator. */
6529 /* The `++' and `--' operators can be handled similarly, even though
6530 they are not technically unary-operators in the grammar. */
6532 {
6537 /* Handle the GNU address-of-label extension. */
6540 {
6541 tree identifier;
6542 tree expression;
6545 /* Consume the '&&' token. */
6547 /* Look for the identifier. */
6549 /* Create an expression representing the address. */
6552 NIC_ADDR_LABEL))
6555 }
6556 }
6558 {
6559 tree cast_expression;
6564 /* Consume the operator token. */
6566 /* Parse the cast-expression. */
6567 cast_expression
6571 /* Now, build an appropriate representation. */
6573 {
6577 RO_UNARY_STAR,
6578 tf_warning_or_error);
6583 /* Fall through. */
6586 cast_expression,
6587 tf_warning_or_error);
6594 /* Fall through. */
6599 cast_expression);
6604 }
6608 non_constant_p))
6612 }
6616 pidk);
6617 }
6619 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6620 unary-operator, the corresponding tree code is returned. */
6622 static enum tree_code
6624 {
6626 {
6647 }
6648 }
6650 /* Parse a new-expression.
6652 new-expression:
6653 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6654 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6656 Returns a representation of the expression. */
6658 static tree
6660 {
6663 tree type;
6666 tree ret;
6668 /* Look for the optional `::' operator. */
6669 global_scope_p
6673 /* Look for the `new' operator. */
6675 /* There's no easy way to tell a new-placement from the
6676 `( type-id )' construct. */
6678 /* Look for a new-placement. */
6680 /* If that didn't work out, there's no new-placement. */
6682 {
6686 }
6688 /* If the next token is a `(', then we have a parenthesized
6689 type-id. */
6691 {
6695 /* Consume the `('. */
6698 /* Parse the type-id. */
6699 parser->type_definition_forbidden_message
6704 /* Look for the closing `)'. */
6707 /* There should not be a direct-new-declarator in this production,
6708 but GCC used to allowed this, so we check and emit a sensible error
6709 message for this case. */
6711 {
6717 }
6718 }
6719 /* Otherwise, there must be a new-type-id. */
6720 else
6723 /* If the next token is a `(' or '{', then we have a new-initializer. */
6727 else
6730 /* A new-expression may not appear in an integral constant
6731 expression. */
6734 else
6735 {
6736 /* Create a representation of the new-expression. */
6738 tf_warning_or_error);
6739 }
6747 }
6749 /* Parse a new-placement.
6751 new-placement:
6752 ( expression-list )
6754 Returns the same representation as for an expression-list. */
6758 {
6761 /* Parse the expression-list. */
6762 expression_list = (cp_parser_parenthesized_expression_list
6768 }
6770 /* Parse a new-type-id.
6772 new-type-id:
6773 type-specifier-seq new-declarator [opt]
6775 Returns the TYPE allocated. If the new-type-id indicates an array
6776 type, *NELTS is set to the number of elements in the last array
6777 bound; the TYPE will not include the last array bound. */
6779 static tree
6781 {
6782 cp_decl_specifier_seq type_specifier_seq;
6788 /* The type-specifier sequence must not contain type definitions.
6789 (It cannot contain declarations of new types either, but if they
6790 are not definitions we will catch that because they are not
6791 complete.) */
6793 parser->type_definition_forbidden_message
6795 /* Parse the type-specifier-seq. */
6799 /* Restore the old message. */
6805 /* Parse the new-declarator. */
6808 /* Determine the number of elements in the last array dimension, if
6809 any. */
6811 /* Skip down to the last array dimension. */
6816 {
6819 }
6824 {
6827 }
6830 {
6837 else
6839 }
6842 }
6844 /* Parse an (optional) new-declarator.
6846 new-declarator:
6847 ptr-operator new-declarator [opt]
6848 direct-new-declarator
6850 Returns the declarator. */
6854 {
6856 tree type;
6857 cp_cv_quals cv_quals;
6859 /* We don't know if there's a ptr-operator next, or not. */
6861 /* Look for a ptr-operator. */
6863 /* If that worked, look for more new-declarators. */
6865 {
6868 /* Parse another optional declarator. */
6871 return cp_parser_make_indirect_declarator
6873 }
6875 /* If the next token is a `[', there is a direct-new-declarator. */
6880 }
6882 /* Parse a direct-new-declarator.
6884 direct-new-declarator:
6885 [ expression ]
6886 direct-new-declarator [constant-expression]
6888 */
6892 {
6896 {
6897 tree expression;
6900 /* Look for the opening `['. */
6905 /* The standard requires that the expression have integral
6906 type. DR 74 adds enumeration types. We believe that the
6907 real intent is that these expressions be handled like the
6908 expression in a `switch' condition, which also allows
6909 classes with a single conversion to integral or
6910 enumeration type. */
6912 {
6913 expression
6915 expression,
6918 {
6920 "expression in new-declarator must have integral "
6923 }
6924 }
6926 /* Look for the closing `]'. */
6929 /* Add this bound to the declarator. */
6932 /* If the next token is not a `[', then there are no more
6933 bounds. */
6936 }
6939 }
6941 /* Parse a new-initializer.
6943 new-initializer:
6944 ( expression-list [opt] )
6945 braced-init-list
6947 Returns a representation of the expression-list. */
6951 {
6955 {
6956 tree t;
6962 }
6963 else
6964 expression_list = (cp_parser_parenthesized_expression_list
6970 }
6972 /* Parse a delete-expression.
6974 delete-expression:
6975 :: [opt] delete cast-expression
6976 :: [opt] delete [ ] cast-expression
6978 Returns a representation of the expression. */
6980 static tree
6982 {
6985 tree expression;
6987 /* Look for the optional `::' operator. */
6988 global_scope_p
6992 /* Look for the `delete' keyword. */
6994 /* See if the array syntax is in use. */
6996 {
6997 /* Consume the `[' token. */
6999 /* Look for the `]' token. */
7001 /* Remember that this is the `[]' construct. */
7003 }
7004 else
7007 /* Parse the cast-expression. */
7010 /* A delete-expression may not appear in an integral constant
7011 expression. */
7016 tf_warning_or_error);
7017 }
7019 /* Returns true if TOKEN may start a cast-expression and false
7020 otherwise. */
7022 static bool
7024 {
7026 {
7065 /* '[' may start a primary-expression in obj-c++. */
7071 }
7072 }
7074 /* Parse a cast-expression.
7076 cast-expression:
7077 unary-expression
7078 ( type-id ) cast-expression
7080 ADDRESS_P is true iff the unary-expression is appearing as the
7081 operand of the `&' operator. CAST_P is true if this expression is
7082 the target of a cast.
7084 Returns a representation of the expression. */
7086 static tree
7089 {
7090 /* If it's a `(', then we might be looking at a cast. */
7092 {
7098 /* There's no way to know yet whether or not this is a cast.
7099 For example, `(int (3))' is a unary-expression, while `(int)
7100 3' is a cast. So, we resort to parsing tentatively. */
7102 /* Types may not be defined in a cast. */
7104 parser->type_definition_forbidden_message
7106 /* Consume the `('. */
7108 /* A very tricky bit is that `(struct S) { 3 }' is a
7109 compound-literal (which we permit in C++ as an extension).
7110 But, that construct is not a cast-expression -- it is a
7111 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7112 is legal; if the compound-literal were a cast-expression,
7113 you'd need an extra set of parentheses.) But, if we parse
7114 the type-id, and it happens to be a class-specifier, then we
7115 will commit to the parse at that point, because we cannot
7116 undo the action that is done when creating a new class. So,
7117 then we cannot back up and do a postfix-expression.
7119 Therefore, we scan ahead to the closing `)', and check to see
7120 if the token after the `)' is a `{'. If so, we are not
7121 looking at a cast-expression.
7123 Save tokens so that we can put them back. */
7125 /* Skip tokens until the next token is a closing parenthesis.
7126 If we find the closing `)', and the next token is a `{', then
7127 we are looking at a compound-literal. */
7128 compound_literal_p
7132 /* Roll back the tokens we skipped. */
7134 /* If we were looking at a compound-literal, simulate an error
7135 so that the call to cp_parser_parse_definitely below will
7136 fail. */
7139 else
7140 {
7143 /* Look for the type-id. */
7145 /* Look for the closing `)'. */
7148 }
7150 /* Restore the saved message. */
7153 /* At this point this can only be either a cast or a
7154 parenthesized ctor such as `(T ())' that looks like a cast to
7155 function returning T. */
7159 {
7165 /* Warn about old-style casts, if so requested. */
7167 && !in_system_header
7172 /* Only type conversions to integral or enumeration types
7173 can be used in constant-expressions. */
7176 NIC_CAST))
7179 /* Perform the cast. */
7182 }
7183 else
7185 }
7187 /* If we get here, then it's not a cast, so it must be a
7188 unary-expression. */
7190 }
7192 /* Parse a binary expression of the general form:
7194 pm-expression:
7195 cast-expression
7196 pm-expression .* cast-expression
7197 pm-expression ->* cast-expression
7199 multiplicative-expression:
7200 pm-expression
7201 multiplicative-expression * pm-expression
7202 multiplicative-expression / pm-expression
7203 multiplicative-expression % pm-expression
7205 additive-expression:
7206 multiplicative-expression
7207 additive-expression + multiplicative-expression
7208 additive-expression - multiplicative-expression
7210 shift-expression:
7211 additive-expression
7212 shift-expression << additive-expression
7213 shift-expression >> additive-expression
7215 relational-expression:
7216 shift-expression
7217 relational-expression < shift-expression
7218 relational-expression > shift-expression
7219 relational-expression <= shift-expression
7220 relational-expression >= shift-expression
7222 GNU Extension:
7224 relational-expression:
7225 relational-expression <? shift-expression
7226 relational-expression >? shift-expression
7228 equality-expression:
7229 relational-expression
7230 equality-expression == relational-expression
7231 equality-expression != relational-expression
7233 and-expression:
7234 equality-expression
7235 and-expression & equality-expression
7237 exclusive-or-expression:
7238 and-expression
7239 exclusive-or-expression ^ and-expression
7241 inclusive-or-expression:
7242 exclusive-or-expression
7243 inclusive-or-expression | exclusive-or-expression
7245 logical-and-expression:
7246 inclusive-or-expression
7247 logical-and-expression && inclusive-or-expression
7249 logical-or-expression:
7250 logical-and-expression
7251 logical-or-expression || logical-and-expression
7253 All these are implemented with a single function like:
7255 binary-expression:
7256 simple-cast-expression
7257 binary-expression <token> binary-expression
7259 CAST_P is true if this expression is the target of a cast.
7261 The binops_by_token map is used to get the tree codes for each <token> type.
7262 binary-expressions are associated according to a precedence table. */
7264 #define TOKEN_PRECEDENCE(token) \
7265 (((token->type == CPP_GREATER \
7266 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7267 && !parser->greater_than_is_operator_p) \
7268 ? PREC_NOT_OPERATOR \
7269 : binops_by_token[token->type].prec)
7271 static tree
7276 {
7277 cp_parser_expression_stack stack;
7279 cp_parser_expression_stack_entry current;
7280 tree rhs;
7284 tree overload;
7286 /* Parse the first expression. */
7296 {
7297 /* Get an operator token. */
7303 {
7305 "%<>>%> operator is treated"
7309 }
7313 /* Popping an entry off the stack means we completed a subexpression:
7314 - either we found a token which is not an operator (`>' where it is not
7315 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7316 will happen repeatedly;
7317 - or, we found an operator which has lower priority. This is the case
7318 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7319 parsing `3 * 4'. */
7321 {
7324 else
7326 }
7328 get_rhs:
7332 /* We used the operator token. */
7335 /* For "false && x" or "true || x", x will never be executed;
7336 disable warnings while evaluating it. */
7342 /* Extract another operand. It may be the RHS of this expression
7343 or the LHS of a new, higher priority expression. */
7347 /* Get another operator token. Look up its precedence to avoid
7348 building a useless (immediately popped) stack entry for common
7349 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7353 {
7354 /* ... and prepare to parse the RHS of the new, higher priority
7355 expression. Since precedence levels on the stack are
7356 monotonically increasing, we do not have to care about
7357 stack overflows. */
7366 pop:
7368 /* If the stack is not empty, we have parsed into LHS the right side
7369 (`4' in the example above) of an expression we had suspended.
7370 We can use the information on the stack to recover the LHS (`3')
7371 from the stack together with the tree code (`MULT_EXPR'), and
7372 the precedence of the higher level subexpression
7373 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7374 which will be used to actually build the additive expression. */
7379 }
7381 /* Undo the disabling of warnings done above. */
7388 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7389 ERROR_MARK for everything that is not a binary expression.
7390 This makes warn_about_parentheses miss some warnings that
7391 involve unary operators. For unary expressions we should
7392 pass the correct tree_code unless the unary expression was
7393 surrounded by parentheses.
7394 */
7401 else
7405 tf_warning_or_error);
7408 /* If the binary operator required the use of an overloaded operator,
7409 then this expression cannot be an integral constant-expression.
7410 An overloaded operator can be used even if both operands are
7411 otherwise permissible in an integral constant-expression if at
7412 least one of the operands is of enumeration type. */
7416 NIC_OVERLOADED))
7418 }
7421 }
7424 /* Parse the `? expression : assignment-expression' part of a
7425 conditional-expression. The LOGICAL_OR_EXPR is the
7426 logical-or-expression that started the conditional-expression.
7427 Returns a representation of the entire conditional-expression.
7429 This routine is used by cp_parser_assignment_expression.
7431 ? expression : assignment-expression
7433 GNU Extensions:
7435 ? : assignment-expression */
7437 static tree
7439 {
7440 tree expr;
7441 tree assignment_expr;
7445 /* Consume the `?' token. */
7450 {
7453 /* Implicit true clause. */
7457 }
7458 else
7459 {
7462 /* Parse the expression. */
7465 c_inhibit_evaluation_warnings +=
7469 }
7471 /* The next token should be a `:'. */
7473 /* Parse the assignment-expression. */
7477 /* Build the conditional-expression. */
7479 expr,
7480 assignment_expr,
7481 tf_warning_or_error);
7482 }
7484 /* Parse an assignment-expression.
7486 assignment-expression:
7487 conditional-expression
7488 logical-or-expression assignment-operator assignment_expression
7489 throw-expression
7491 CAST_P is true if this expression is the target of a cast.
7493 Returns a representation for the expression. */
7495 static tree
7498 {
7499 tree expr;
7501 /* If the next token is the `throw' keyword, then we're looking at
7502 a throw-expression. */
7505 /* Otherwise, it must be that we are looking at a
7506 logical-or-expression. */
7507 else
7508 {
7509 /* Parse the binary expressions (logical-or-expression). */
7512 /* If the next token is a `?' then we're actually looking at a
7513 conditional-expression. */
7516 else
7517 {
7520 /* If it's an assignment-operator, we're using the second
7521 production. */
7522 enum tree_code assignment_operator
7525 {
7527 location_t saved_input_location;
7529 /* Parse the right-hand side of the assignment. */
7535 /* An assignment may not appear in a
7536 constant-expression. */
7538 NIC_ASSIGNMENT))
7540 /* Build the assignment expression. Its default
7541 location is the location of the '=' token. */
7545 assignment_operator,
7546 rhs,
7547 tf_warning_or_error);
7549 }
7550 }
7551 }
7554 }
7556 /* Parse an (optional) assignment-operator.
7558 assignment-operator: one of
7559 = *= /= %= += -= >>= <<= &= ^= |=
7561 GNU Extension:
7563 assignment-operator: one of
7564 <?= >?=
7566 If the next token is an assignment operator, the corresponding tree
7567 code is returned, and the token is consumed. For example, for
7568 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7569 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7570 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7571 operator, ERROR_MARK is returned. */
7573 static enum tree_code
7575 {
7579 /* Peek at the next token. */
7583 {
7629 /* Nothing else is an assignment operator. */
7631 }
7633 /* If it was an assignment operator, consume it. */
7638 }
7640 /* Parse an expression.
7642 expression:
7643 assignment-expression
7644 expression , assignment-expression
7646 CAST_P is true if this expression is the target of a cast.
7648 Returns a representation of the expression. */
7650 static tree
7652 {
7657 {
7658 tree assignment_expression;
7660 /* Parse the next assignment-expression. */
7661 assignment_expression
7663 /* If this is the first assignment-expression, we can just
7664 save it away. */
7667 else
7669 assignment_expression,
7670 tf_warning_or_error);
7671 /* If the next token is not a comma, then we are done with the
7672 expression. */
7675 /* Consume the `,'. */
7678 /* A comma operator cannot appear in a constant-expression. */
7681 }
7684 }
7686 /* Parse a constant-expression.
7688 constant-expression:
7689 conditional-expression
7691 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7692 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7693 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7694 is false, NON_CONSTANT_P should be NULL. */
7696 static tree
7700 {
7704 tree expression;
7706 /* It might seem that we could simply parse the
7707 conditional-expression, and then check to see if it were
7708 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7709 one that the compiler can figure out is constant, possibly after
7710 doing some simplifications or optimizations. The standard has a
7711 precise definition of constant-expression, and we must honor
7712 that, even though it is somewhat more restrictive.
7714 For example:
7716 int i[(2, 3)];
7718 is not a legal declaration, because `(2, 3)' is not a
7719 constant-expression. The `,' operator is forbidden in a
7720 constant-expression. However, GCC's constant-folding machinery
7721 will fold this operation to an INTEGER_CST for `3'. */
7723 /* Save the old settings. */
7725 saved_allow_non_integral_constant_expression_p
7728 /* We are now parsing a constant-expression. */
7730 parser->allow_non_integral_constant_expression_p
7733 /* Although the grammar says "conditional-expression", we parse an
7734 "assignment-expression", which also permits "throw-expression"
7735 and the use of assignment operators. In the case that
7736 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7737 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7738 actually essential that we look for an assignment-expression.
7739 For example, cp_parser_initializer_clauses uses this function to
7740 determine whether a particular assignment-expression is in fact
7741 constant. */
7743 /* Restore the old settings. */
7744 parser->integral_constant_expression_p
7746 parser->allow_non_integral_constant_expression_p
7749 {
7750 /* Require an rvalue constant expression here; that's what our
7751 callers expect. Reference constant expressions are handled
7752 separately in e.g. cp_parser_template_argument. */
7757 }
7760 parser->non_integral_constant_expression_p
7764 }
7766 /* Parse __builtin_offsetof.
7768 offsetof-expression:
7769 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7771 offsetof-member-designator:
7772 id-expression
7773 | offsetof-member-designator "." id-expression
7774 | offsetof-member-designator "[" expression "]"
7775 | offsetof-member-designator "->" id-expression */
7777 static tree
7779 {
7782 cp_id_kind dummy;
7785 /* We're about to accept non-integral-constant things, but will
7786 definitely yield an integral constant expression. Save and
7787 restore these values around our local parsing. */
7791 /* Consume the "__builtin_offsetof" token. */
7793 /* Consume the opening `('. */
7795 /* Parse the type-id. */
7797 /* Look for the `,'. */
7801 /* Build the (type *)null that begins the traditional offsetof macro. */
7803 tf_warning_or_error);
7805 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7809 {
7812 {
7814 /* offsetof-member-designator "[" expression "]" */
7819 /* offsetof-member-designator "->" identifier */
7821 /* FALLTHRU */
7824 /* offsetof-member-designator "." identifier */
7832 /* Consume the ")" token. */
7837 /* Error. We know the following require will fail, but
7838 that gives the proper error message. */
7843 }
7844 }
7846 success:
7847 /* If we're processing a template, we can't finish the semantics yet.
7848 Otherwise we can fold the entire expression now. */
7851 else
7854 failure:
7859 }
7861 /* Parse a trait expression.
7863 Returns a representation of the expression, the underlying type
7864 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7866 static tree
7868 {
7869 cp_trait_kind kind;
7872 cp_decl_specifier_seq decl_specs;
7875 {
7952 }
7954 /* Consume the token. */
7964 /* Build a trivial decl-specifier-seq. */
7968 /* Call grokdeclarator to figure out what type this is. */
7973 {
7981 /* Build a trivial decl-specifier-seq. */
7985 /* Call grokdeclarator to figure out what type this is. */
7988 }
7992 /* Complete the trait expression, which may mean either processing
7993 the trait expr now or saving it for template instantiation. */
7995 {
8004 }
8005 }
8007 /* Lambdas that appear in variable initializer or default argument scope
8008 get that in their mangling, so we need to record it. We might as well
8009 use the count for function and namespace scopes as well. */
8013 {
8014 tree t;
8021 static void
8023 {
8024 tree_int ti;
8026 /* Once we're inside a function, we ignore other scopes and just push
8027 the function again so that popping works properly. */
8034 {
8035 /* Don't reset the count if we're still in the same function. */
8038 }
8039 }
8041 static void
8043 {
8046 }
8048 static void
8050 {
8053 {
8056 }
8058 }
8060 /* Parse a lambda expression.
8062 lambda-expression:
8063 lambda-introducer lambda-declarator [opt] compound-statement
8065 Returns a representation of the expression. */
8067 static tree
8069 {
8071 tree type;
8081 /* We may be in the middle of deferred access check. Disable
8082 it now. */
8093 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8096 /* Now that we've started the type, add the capture fields for any
8097 explicit captures. */
8100 {
8101 /* Inside the class, surrounding template-parameter-lists do not apply. */
8102 unsigned int saved_num_template_parameter_lists
8111 /* By virtue of defining a local class, a lambda expression has access to
8112 the private variables of enclosing classes. */
8121 /* The capture list was built up in reverse order; fix that now. */
8122 {
8128 {
8132 }
8134 }
8144 }
8148 /* This field is only used during parsing of the lambda. */
8151 /* This lambda shouldn't have any proxies left at this point. */
8153 /* And now that we're done, push proxies for an enclosing lambda. */
8158 else
8160 }
8162 /* Parse the beginning of a lambda expression.
8164 lambda-introducer:
8165 [ lambda-capture [opt] ]
8167 LAMBDA_EXPR is the current representation of the lambda expression. */
8169 static void
8171 {
8172 /* Need commas after the first capture. */
8175 /* Eat the leading `['. */
8178 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8186 {
8189 }
8192 {
8194 tree capture_id;
8195 tree capture_init_expr;
8199 enum capture_kind_type
8200 {
8201 BY_COPY,
8202 BY_REFERENCE
8203 };
8207 {
8210 }
8214 else
8217 /* Possibly capture `this'. */
8219 {
8229 explicit_init_p);
8231 }
8233 /* Remember whether we want to capture as a reference or not. */
8235 {
8238 }
8240 /* Get the identifier. */
8245 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8246 delimiters, but I modified this to stop on unnested ']' as well. It
8247 was already changed to stop on unnested '}', so the
8248 "closing_parenthesis" name is no more misleading with my change. */
8249 {
8255 }
8257 /* Find the initializer for this capture. */
8259 {
8260 /* An explicit expression exists. */
8263 "ISO C++ does not allow initializers "
8269 }
8270 else
8271 {
8274 /* Turn the identifier into an id-expression. */
8275 capture_init_expr
8276 = cp_parser_lookup_name
8278 capture_id,
8279 none_type,
8287 {
8290 }
8294 {
8297 capture_init_expr);
8300 }
8303 {
8306 capture_init_expr);
8309 }
8311 capture_init_expr
8312 = finish_id_expression
8314 capture_init_expr,
8326 }
8330 {
8335 capture_id);
8339 "capture of %qD redundant with by-reference capture "
8341 }
8344 capture_id,
8345 capture_init_expr,
8347 explicit_init_p);
8348 }
8351 }
8353 /* Parse the (optional) middle of a lambda expression.
8355 lambda-declarator:
8356 ( parameter-declaration-clause [opt] )
8357 attribute-specifier [opt]
8358 mutable [opt]
8359 exception-specification [opt]
8360 lambda-return-type-clause [opt]
8362 LAMBDA_EXPR is the current representation of the lambda expression. */
8364 static bool
8366 {
8367 /* 5.1.1.4 of the standard says:
8368 If a lambda-expression does not include a lambda-declarator, it is as if
8369 the lambda-declarator were ().
8370 This means an empty parameter list, no attributes, and no exception
8371 specification. */
8375 tree t;
8377 /* The lambda-declarator is optional, but must begin with an opening
8378 parenthesis if present. */
8380 {
8385 /* Parse parameters. */
8388 /* Default arguments shall not be specified in the
8389 parameter-declaration-clause of a lambda-declarator. */
8399 /* Parse optional `mutable' keyword. */
8401 {
8404 }
8406 /* Parse optional exception specification. */
8409 /* Parse optional trailing return type. */
8411 {
8414 }
8416 /* The function parameters must be in scope all the way until after the
8417 trailing-return-type in case of decltype. */
8422 }
8424 /* Create the function call operator.
8426 Messing with declarators like this is no uglier than building up the
8427 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8428 other code. */
8429 {
8430 cp_decl_specifier_seq return_type_specs;
8432 tree fco;
8439 else
8440 /* Maybe we will deduce the return type later. */
8446 sfk_none);
8451 VIRT_SPEC_UNSPECIFIED,
8452 exception_spec,
8457 declarator,
8458 attributes);
8460 {
8463 /* Give the object parameter a different name. */
8465 }
8472 }
8473 }
8475 /* Parse the body of a lambda expression, which is simply
8477 compound-statement
8479 but which requires special handling.
8480 LAMBDA_EXPR is the current representation of the lambda expression. */
8482 static void
8484 {
8489 else
8490 /* Still increment function_depth so that we don't GC in the
8491 middle of an expression. */
8493 /* Clear this in case we're in the middle of a default argument. */
8496 /* Finish the function call operator
8497 - class_specifier
8498 + late_parsing_for_member
8499 + function_definition_after_declarator
8500 + ctor_initializer_opt_and_function_body */
8501 {
8503 tree body;
8505 tree compound_stmt;
8506 tree cap;
8508 /* Let the front end know that we are going to be defining this
8509 function. */
8511 NULL_TREE,
8520 /* Push the proxies for any explicit captures. */
8527 /* 5.1.1.4 of the standard says:
8528 If a lambda-expression does not include a trailing-return-type, it
8529 is as if the trailing-return-type denotes the following type:
8530 * if the compound-statement is of the form
8531 { return attribute-specifier [opt] expression ; }
8532 the type of the returned expression after lvalue-to-rvalue
8533 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8534 (_conv.array_ 4.2), and function-to-pointer conversion
8535 (_conv.func_ 4.3);
8536 * otherwise, void. */
8538 /* In a lambda that has neither a lambda-return-type-clause
8539 nor a deducible form, errors should be reported for return statements
8540 in the body. Since we used void as the placeholder return type, parsing
8541 the body as usual will give such desired behavior. */
8545 {
8549 /* Parse tentatively in case there's more after the initial return
8550 statement. */
8561 {
8565 /* Will get error here if type not deduced yet. */
8569 }
8570 }
8573 {
8578 }
8582 out:
8586 /* Finish the function and generate code for it if necessary. */
8588 }
8593 else
8595 }
8597 /* Statements [gram.stmt.stmt] */
8599 /* Parse a statement.
8601 statement:
8602 labeled-statement
8603 expression-statement
8604 compound-statement
8605 selection-statement
8606 iteration-statement
8607 jump-statement
8608 declaration-statement
8609 try-block
8611 TM Extension:
8613 statement:
8614 atomic-statement
8616 IN_COMPOUND is true when the statement is nested inside a
8617 cp_parser_compound_statement; this matters for certain pragmas.
8619 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8620 is a (possibly labeled) if statement which is not enclosed in braces
8621 and has an else clause. This is used to implement -Wparentheses. */
8623 static void
8626 {
8627 tree statement;
8629 location_t statement_location;
8631 restart:
8634 /* There is no statement yet. */
8636 /* Peek at the next token. */
8638 /* Remember the location of the first token in the statement. */
8640 /* If this is a keyword, then that will often determine what kind of
8641 statement we have. */
8643 {
8647 {
8650 /* Looks like a labeled-statement with a case label.
8651 Parse the label, and then use tail recursion to parse
8652 the statement. */
8674 /* Objective-C++ exception-handling constructs. */
8688 /* This must be a namespace alias definition. */
8701 /* It might be a keyword like `int' that can start a
8702 declaration-statement. */
8704 }
8705 }
8707 {
8708 /* If the next token is a `:', then we are looking at a
8709 labeled-statement. */
8712 {
8713 /* Looks like a labeled-statement with an ordinary label.
8714 Parse the label, and then use tail recursion to parse
8715 the statement. */
8718 }
8719 }
8720 /* Anything that starts with a `{' must be a compound-statement. */
8723 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8724 a statement all its own. */
8726 {
8727 /* Only certain OpenMP pragmas are attached to statements, and thus
8728 are considered statements themselves. All others are not. In
8729 the context of a compound, accept the pragma as a "statement" and
8730 return so that we can check for a close brace. Otherwise we
8731 require a real statement and must go back and read one. */
8737 }
8739 {
8742 }
8744 /* Everything else must be a declaration-statement or an
8745 expression-statement. Try for the declaration-statement
8746 first, unless we are looking at a `;', in which case we know that
8747 we have an expression-statement. */
8749 {
8751 {
8753 /* Try to parse the declaration-statement. */
8755 /* If that worked, we're done. */
8758 }
8759 /* Look for an expression-statement instead. */
8761 }
8763 /* Set the line number for the statement. */
8766 }
8768 /* Parse the label for a labeled-statement, i.e.
8770 identifier :
8771 case constant-expression :
8772 default :
8774 GNU Extension:
8775 case constant-expression ... constant-expression : statement
8777 When a label is parsed without errors, the label is added to the
8778 parse tree by the finish_* functions, so this function doesn't
8779 have to return the label. */
8781 static void
8783 {
8788 /* The next token should be an identifier. */
8792 {
8795 }
8799 {
8801 {
8805 /* Consume the `case' token. */
8807 /* Parse the constant-expression. */
8810 NULL);
8814 {
8815 /* Consume the `...' token. */
8817 expr_hi =
8820 NULL);
8821 /* We don't need to emit warnings here, as the common code
8822 will do this for us. */
8823 }
8824 else
8829 else
8832 expr);
8833 }
8837 /* Consume the `default' token. */
8842 else
8847 /* Anything else must be an ordinary label. */
8850 }
8852 /* Require the `:' token. */
8855 /* An ordinary label may optionally be followed by attributes.
8856 However, this is only permitted if the attributes are then
8857 followed by a semicolon. This is because, for backward
8858 compatibility, when parsing
8859 lab: __attribute__ ((unused)) int i;
8860 we want the attribute to attach to "i", not "lab". */
8863 {
8864 tree attrs;
8872 ;
8873 else
8875 }
8878 }
8880 /* Parse an expression-statement.
8882 expression-statement:
8883 expression [opt] ;
8885 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8886 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8887 indicates whether this expression-statement is part of an
8888 expression statement. */
8890 static tree
8892 {
8896 /* If the next token is a ';', then there is no expression
8897 statement. */
8901 /* Give a helpful message for "A<T>::type t;" and the like. */
8904 {
8911 {
8912 /* A::A a; */
8917 }
8918 }
8920 /* Consume the final `;'. */
8925 /* This is the final expression statement of a statement
8926 expression. */
8930 else
8934 }
8936 /* Parse a compound-statement.
8938 compound-statement:
8939 { statement-seq [opt] }
8941 GNU extension:
8943 compound-statement:
8944 { label-declaration-seq [opt] statement-seq [opt] }
8946 label-declaration-seq:
8947 label-declaration
8948 label-declaration-seq label-declaration
8950 Returns a tree representing the statement. */
8952 static tree
8955 {
8956 tree compound_stmt;
8958 /* Consume the `{'. */
8965 /* Begin the compound-statement. */
8967 /* If the next keyword is `__label__' we have a label declaration. */
8970 /* Parse an (optional) statement-seq. */
8972 /* Finish the compound-statement. */
8974 /* Consume the `}'. */
8978 }
8980 /* Parse an (optional) statement-seq.
8982 statement-seq:
8983 statement
8984 statement-seq [opt] statement */
8986 static void
8988 {
8989 /* Scan statements until there aren't any more. */
8991 {
8994 /* If we are looking at a `}', then we have run out of
8995 statements; the same is true if we have reached the end
8996 of file, or have stumbled upon a stray '@end'. */
9003 /* If we are in a compound statement and find 'else' then
9004 something went wrong. */
9006 {
9009 else
9010 {
9013 }
9014 }
9016 /* Parse the statement. */
9018 }
9019 }
9021 /* Parse a selection-statement.
9023 selection-statement:
9024 if ( condition ) statement
9025 if ( condition ) statement else statement
9026 switch ( condition ) statement
9028 Returns the new IF_STMT or SWITCH_STMT.
9030 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9031 is a (possibly labeled) if statement which is not enclosed in
9032 braces and has an else clause. This is used to implement
9033 -Wparentheses. */
9035 static tree
9037 {
9044 /* Peek at the next token. */
9047 /* See what kind of keyword it is. */
9050 {
9053 {
9054 tree statement;
9055 tree condition;
9057 /* Look for the `('. */
9059 {
9062 }
9064 /* Begin the selection-statement. */
9067 else
9070 /* Parse the condition. */
9072 /* Look for the `)'. */
9078 {
9082 /* Add the condition. */
9085 /* Parse the then-clause. */
9089 {
9097 }
9098 else
9104 /* If the next token is `else', parse the else-clause. */
9106 RID_ELSE))
9107 {
9108 /* Consume the `else' keyword. */
9111 /* Parse the else-clause. */
9113 {
9114 location_t loc;
9121 }
9122 else
9127 /* If we are currently parsing a then-clause, then
9128 IF_P will not be NULL. We set it to true to
9129 indicate that this if statement has an else clause.
9130 This may trigger the Wparentheses warning below
9131 when we get back up to the parent if statement. */
9134 }
9135 else
9136 {
9137 /* This if statement does not have an else clause. If
9138 NESTED_IF is true, then the then-clause is an if
9139 statement which does have an else clause. We warn
9140 about the potential ambiguity. */
9143 "suggest explicit braces to avoid ambiguous"
9145 }
9147 /* Now we're all done with the if-statement. */
9149 }
9150 else
9151 {
9155 /* Add the condition. */
9158 /* Parse the body of the switch-statement. */
9167 /* Now we're all done with the switch-statement. */
9169 }
9172 }
9178 }
9179 }
9181 /* Parse a condition.
9183 condition:
9184 expression
9185 type-specifier-seq declarator = initializer-clause
9186 type-specifier-seq declarator braced-init-list
9188 GNU Extension:
9190 condition:
9191 type-specifier-seq declarator asm-specification [opt]
9192 attributes [opt] = assignment-expression
9194 Returns the expression that should be tested. */
9196 static tree
9198 {
9199 cp_decl_specifier_seq type_specifiers;
9203 /* Try the declaration first. */
9205 /* New types are not allowed in the type-specifier-seq for a
9206 condition. */
9208 parser->type_definition_forbidden_message
9210 /* Parse the type-specifier-seq. */
9212 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9215 /* Restore the saved message. */
9217 /* If all is well, we might be looking at a declaration. */
9219 {
9220 tree decl;
9221 tree asm_specification;
9222 tree attributes;
9226 /* Parse the declarator. */
9231 /* Parse the attributes. */
9233 /* Parse the asm-specification. */
9235 /* If the next token is not an `=' or '{', then we might still be
9236 looking at an expression. For example:
9238 if (A(a).x)
9240 looks like a decl-specifier-seq and a declarator -- but then
9241 there is no `=', so this is an expression. */
9246 /* If we did see an `=' or '{', then we are looking at a declaration
9247 for sure. */
9249 {
9250 tree pushed_scope;
9254 /* Create the declaration. */
9260 /* Parse the initializer. */
9262 {
9266 }
9267 else
9268 {
9269 /* Consume the `='. */
9272 }
9276 /* Process the initializer. */
9279 asm_specification,
9280 flags);
9286 }
9287 }
9288 /* If we didn't even get past the declarator successfully, we are
9289 definitely not looking at a declaration. */
9290 else
9293 /* Otherwise, we are looking at an expression. */
9295 }
9297 /* Parses a for-statement or range-for-statement until the closing ')',
9298 not included. */
9300 static tree
9302 {
9306 /* Begin the for-statement. */
9309 /* Parse the initialization. */
9314 else
9316 }
9318 static tree
9320 {
9321 /* Normal for loop */
9324 tree stmt;
9327 /* The for-init-statement has already been parsed in
9328 cp_parser_for_init_statement, so no work is needed here. */
9331 /* If there's a condition, process it. */
9335 /* Look for the `;'. */
9338 /* If there's an expression, process it. */
9344 }
9346 /* Tries to parse a range-based for-statement:
9348 range-based-for:
9349 decl-specifier-seq declarator : expression
9351 The decl-specifier-seq declarator and the `:' are already parsed by
9352 cp_parser_for_init_statement. If processing_template_decl it returns a
9353 newly created RANGE_FOR_STMT; if not, it is converted to a
9354 regular FOR_STMT. */
9356 static tree
9358 {
9362 {
9365 }
9366 else
9369 /* If in template, STMT is converted to a normal for-statement
9370 at instantiation. If not, it is done just ahead. */
9372 {
9378 /* do_auto_deduction doesn't mess with template init-lists. */
9381 }
9382 else
9383 {
9386 }
9388 }
9390 /* Subroutine of cp_convert_range_for: given the initializer expression,
9391 builds up the range temporary. */
9393 static tree
9395 {
9398 /* Find out the type deduced by the declaration
9399 `auto &&__range = range_expr'. */
9404 /* Create the __range variable. */
9411 }
9413 /* Used by cp_parser_range_for in template context: we aren't going to
9414 do a full conversion yet, but we still need to resolve auto in the
9415 type of the for-range-declaration if present. This is basically
9416 a shortcut version of cp_convert_range_for. */
9418 static void
9420 {
9423 {
9426 iter_type = (cp_parser_perform_range_for_lookup
9430 tf_warning_or_error);
9433 }
9434 }
9436 /* Converts a range-based for-statement into a normal
9437 for-statement, as per the definition.
9439 for (RANGE_DECL : RANGE_EXPR)
9440 BLOCK
9442 should be equivalent to:
9444 {
9445 auto &&__range = RANGE_EXPR;
9446 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9447 __begin != __end;
9448 ++__begin)
9449 {
9450 RANGE_DECL = *__begin;
9451 BLOCK
9452 }
9453 }
9455 If RANGE_EXPR is an array:
9456 BEGIN_EXPR = __range
9457 END_EXPR = __range + ARRAY_SIZE(__range)
9458 Else if RANGE_EXPR has a member 'begin' or 'end':
9459 BEGIN_EXPR = __range.begin()
9460 END_EXPR = __range.end()
9461 Else:
9462 BEGIN_EXPR = begin(__range)
9463 END_EXPR = end(__range);
9465 If __range has a member 'begin' but not 'end', or vice versa, we must
9466 still use the second alternative (it will surely fail, however).
9467 When calling begin()/end() in the third alternative we must use
9468 argument dependent lookup, but always considering 'std' as an associated
9469 namespace. */
9471 tree
9473 {
9479 /* If an error happened previously do nothing or else a lot of
9480 unhelpful errors would be issued. */
9482 else
9483 {
9488 LOOKUP_ONLYCONVERTING);
9493 }
9495 /* The new for initialization statement. */
9503 LOOKUP_ONLYCONVERTING);
9512 LOOKUP_ONLYCONVERTING);
9516 /* The new for condition. */
9523 /* The new increment expression. */
9528 /* The declaration is initialized with *__begin inside the loop body. */
9531 tf_warning_or_error),
9533 LOOKUP_ONLYCONVERTING);
9536 }
9538 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9539 We need to solve both at the same time because the method used
9540 depends on the existence of members begin or end.
9541 Returns the type deduced for the iterator expression. */
9543 static tree
9545 {
9547 {
9550 }
9553 {
9558 }
9560 {
9561 /* If RANGE is an array, we will use pointer arithmetic. */
9564 range,
9568 }
9569 else
9570 {
9571 /* If it is not an array, we must do a bit of magic. */
9581 tf_warning_or_error);
9584 tf_warning_or_error);
9587 {
9588 /* Use the member functions. */
9591 else
9597 else
9600 }
9601 else
9602 {
9603 /* Use global functions with ADL. */
9611 tf_warning_or_error);
9613 tf_warning_or_error);
9616 tf_warning_or_error);
9618 tf_warning_or_error);
9621 }
9623 /* Last common checks. */
9625 {
9626 /* If one of the expressions is an error do no more checks. */
9629 }
9630 else
9631 {
9633 /* The unqualified type of the __begin and __end temporaries should
9634 be the same, as required by the multiple auto declaration. */
9640 }
9641 }
9642 }
9644 /* Helper function for cp_parser_perform_range_for_lookup.
9645 Builds a tree for RANGE.IDENTIFIER(). */
9647 static tree
9649 {
9662 tf_warning_or_error);
9665 }
9667 /* Parse an iteration-statement.
9669 iteration-statement:
9670 while ( condition ) statement
9671 do statement while ( expression ) ;
9672 for ( for-init-statement condition [opt] ; expression [opt] )
9673 statement
9675 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9677 static tree
9679 {
9682 tree statement;
9685 /* Peek at the next token. */
9690 /* Remember whether or not we are already within an iteration
9691 statement. */
9694 /* See what kind of keyword it is. */
9697 {
9699 {
9700 tree condition;
9702 /* Begin the while-statement. */
9704 /* Look for the `('. */
9706 /* Parse the condition. */
9709 /* Look for the `)'. */
9711 /* Parse the dependent statement. */
9715 /* We're done with the while-statement. */
9717 }
9721 {
9722 tree expression;
9724 /* Begin the do-statement. */
9726 /* Parse the body of the do-statement. */
9731 /* Look for the `while' keyword. */
9733 /* Look for the `('. */
9735 /* Parse the expression. */
9737 /* We're done with the do-statement. */
9739 /* Look for the `)'. */
9741 /* Look for the `;'. */
9743 }
9747 {
9748 /* Look for the `('. */
9753 /* Look for the `)'. */
9756 /* Parse the body of the for-statement. */
9761 /* We're done with the for-statement. */
9763 }
9770 }
9773 }
9775 /* Parse a for-init-statement or the declarator of a range-based-for.
9776 Returns true if a range-based-for declaration is seen.
9778 for-init-statement:
9779 expression-statement
9780 simple-declaration */
9782 static bool
9784 {
9785 /* If the next token is a `;', then we have an empty
9786 expression-statement. Grammatically, this is also a
9787 simple-declaration, but an invalid one, because it does not
9788 declare anything. Therefore, if we did not handle this case
9789 specially, we would issue an error message about an invalid
9790 declaration. */
9792 {
9798 /* We're going to speculatively look for a declaration, falling back
9799 to an expression, if necessary. */
9801 /* Parse the declaration. */
9804 decl);
9807 {
9808 /* It is a range-for, consume the ':' */
9812 {
9814 "range-based %<for%> loops are not allowed "
9817 }
9818 }
9819 else
9820 /* The ';' is not consumed yet because we told
9821 cp_parser_simple_declaration not to. */
9826 /* If the tentative parse failed, then we shall need to look for an
9827 expression-statement. */
9828 }
9829 /* If we are here, it is an expression-statement. */
9832 }
9834 /* Parse a jump-statement.
9836 jump-statement:
9837 break ;
9838 continue ;
9839 return expression [opt] ;
9840 return braced-init-list ;
9841 goto identifier ;
9843 GNU extension:
9845 jump-statement:
9846 goto * expression ;
9848 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9850 static tree
9852 {
9858 /* Peek at the next token. */
9863 /* See what kind of keyword it is. */
9866 {
9870 {
9885 }
9891 {
9904 }
9909 {
9910 tree expr;
9914 {
9917 }
9920 else
9921 /* If the next token is a `;', then there is no
9922 expression. */
9924 /* Build the return-statement. */
9926 /* Look for the final `;'. */
9928 }
9932 /* Create the goto-statement. */
9934 {
9935 /* Issue a warning about this use of a GNU extension. */
9937 /* Consume the '*' token. */
9939 /* Parse the dependent expression. */
9941 }
9942 else
9944 /* Look for the final `;'. */
9951 }
9954 }
9956 /* Parse a declaration-statement.
9958 declaration-statement:
9959 block-declaration */
9961 static void
9963 {
9966 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9969 /* Parse the block-declaration. */
9972 /* Free any declarators allocated. */
9975 /* Finish off the statement. */
9977 }
9979 /* Some dependent statements (like `if (cond) statement'), are
9980 implicitly in their own scope. In other words, if the statement is
9981 a single statement (as opposed to a compound-statement), it is
9982 none-the-less treated as if it were enclosed in braces. Any
9983 declarations appearing in the dependent statement are out of scope
9984 after control passes that point. This function parses a statement,
9985 but ensures that is in its own scope, even if it is not a
9986 compound-statement.
9988 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9989 is a (possibly labeled) if statement which is not enclosed in
9990 braces and has an else clause. This is used to implement
9991 -Wparentheses.
9993 Returns the new statement. */
9995 static tree
9997 {
9998 tree statement;
10003 /* Mark if () ; with a special NOP_EXPR. */
10005 {
10009 }
10010 /* if a compound is opened, we simply parse the statement directly. */
10013 /* If the token is not a `{', then we must take special action. */
10014 else
10015 {
10016 /* Create a compound-statement. */
10018 /* Parse the dependent-statement. */
10020 /* Finish the dummy compound-statement. */
10022 }
10024 /* Return the statement. */
10026 }
10028 /* For some dependent statements (like `while (cond) statement'), we
10029 have already created a scope. Therefore, even if the dependent
10030 statement is a compound-statement, we do not want to create another
10031 scope. */
10033 static void
10035 {
10036 /* If the token is a `{', then we must take special action. */
10039 else
10040 {
10041 /* Avoid calling cp_parser_compound_statement, so that we
10042 don't create a new scope. Do everything else by hand. */
10044 /* If the next keyword is `__label__' we have a label declaration. */
10047 /* Parse an (optional) statement-seq. */
10050 }
10051 }
10053 /* Declarations [gram.dcl.dcl] */
10055 /* Parse an optional declaration-sequence.
10057 declaration-seq:
10058 declaration
10059 declaration-seq declaration */
10061 static void
10063 {
10065 {
10076 {
10077 /* A declaration consisting of a single semicolon is
10078 invalid. Allow it unless we're being pedantic. */
10083 }
10085 /* If we're entering or exiting a region that's implicitly
10086 extern "C", modify the lang context appropriately. */
10088 {
10091 }
10093 {
10096 }
10099 {
10100 /* A top-level declaration can consist solely of a #pragma.
10101 A nested declaration cannot, so this is done here and not
10102 in cp_parser_declaration. (A #pragma at block scope is
10103 handled in cp_parser_statement.) */
10106 }
10108 /* Parse the declaration itself. */
10110 }
10111 }
10113 /* Parse a declaration.
10115 declaration:
10116 block-declaration
10117 function-definition
10118 template-declaration
10119 explicit-instantiation
10120 explicit-specialization
10121 linkage-specification
10122 namespace-definition
10124 GNU extension:
10126 declaration:
10127 __extension__ declaration */
10129 static void
10131 {
10132 cp_token token1;
10133 cp_token token2;
10138 /* Check for the `__extension__' keyword. */
10140 {
10141 /* Parse the qualified declaration. */
10143 /* Restore the PEDANTIC flag. */
10147 }
10149 /* Try to figure out what kind of declaration is present. */
10154 else
10155 {
10158 }
10160 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10163 /* If the next token is `extern' and the following token is a string
10164 literal, then we have a linkage specification. */
10168 /* If the next token is `template', then we have either a template
10169 declaration, an explicit instantiation, or an explicit
10170 specialization. */
10172 {
10173 /* `template <>' indicates a template specialization. */
10177 /* `template <' indicates a template declaration. */
10180 /* Anything else must be an explicit instantiation. */
10181 else
10183 }
10184 /* If the next token is `export', then we have a template
10185 declaration. */
10188 /* If the next token is `extern', 'static' or 'inline' and the one
10189 after that is `template', we have a GNU extended explicit
10190 instantiation directive. */
10197 /* If the next token is `namespace', check for a named or unnamed
10198 namespace definition. */
10204 /* An unnamed namespace definition. */
10208 /* An inline (associated) namespace definition. */
10212 /* Objective-C++ declaration/definition. */
10219 /* We must have either a block declaration or a function
10220 definition. */
10221 else
10222 /* Try to parse a block-declaration, or a function-definition. */
10225 /* Free any declarators allocated. */
10227 }
10229 /* Parse a block-declaration.
10231 block-declaration:
10232 simple-declaration
10233 asm-definition
10234 namespace-alias-definition
10235 using-declaration
10236 using-directive
10238 GNU Extension:
10240 block-declaration:
10241 __extension__ block-declaration
10243 C++0x Extension:
10245 block-declaration:
10246 static_assert-declaration
10248 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10249 part of a declaration-statement. */
10251 static void
10254 {
10258 /* Check for the `__extension__' keyword. */
10260 {
10261 /* Parse the qualified declaration. */
10263 /* Restore the PEDANTIC flag. */
10267 }
10269 /* Peek at the next token to figure out which kind of declaration is
10270 present. */
10273 /* If the next keyword is `asm', we have an asm-definition. */
10275 {
10279 }
10280 /* If the next keyword is `namespace', we have a
10281 namespace-alias-definition. */
10284 /* If the next keyword is `using', we have a
10285 using-declaration, a using-directive, or an alias-declaration. */
10287 {
10292 /* If the token after `using' is `namespace', then we have a
10293 using-directive. */
10297 /* If the second token after 'using' is '=', then we have an
10298 alias-declaration. */
10305 /* Otherwise, it's a using-declaration. */
10306 else
10309 }
10310 /* If the next keyword is `__label__' we have a misplaced label
10311 declaration. */
10313 {
10317 /* If the next token is now a `;', consume it. */
10320 }
10321 /* If the next token is `static_assert' we have a static assertion. */
10324 /* Anything else must be a simple-declaration. */
10325 else
10328 }
10330 /* Parse a simple-declaration.
10332 simple-declaration:
10333 decl-specifier-seq [opt] init-declarator-list [opt] ;
10335 init-declarator-list:
10336 init-declarator
10337 init-declarator-list , init-declarator
10339 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10340 function-definition as a simple-declaration.
10342 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10343 parsed declaration if it is an uninitialized single declarator not followed
10344 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10345 if present, will not be consumed. */
10347 static void
10351 {
10352 cp_decl_specifier_seq decl_specifiers;
10359 /* Defer access checks until we know what is being declared; the
10360 checks for names appearing in the decl-specifier-seq should be
10361 done as if we were in the scope of the thing being declared. */
10364 /* Parse the decl-specifier-seq. We have to keep track of whether
10365 or not the decl-specifier-seq declares a named class or
10366 enumeration type, since that is the only case in which the
10367 init-declarator-list is allowed to be empty.
10369 [dcl.dcl]
10371 In a simple-declaration, the optional init-declarator-list can be
10372 omitted only when declaring a class or enumeration, that is when
10373 the decl-specifier-seq contains either a class-specifier, an
10374 elaborated-type-specifier, or an enum-specifier. */
10376 CP_PARSER_FLAGS_OPTIONAL,
10379 /* We no longer need to defer access checks. */
10382 /* In a block scope, a valid declaration must always have a
10383 decl-specifier-seq. By not trying to parse declarators, we can
10384 resolve the declaration/expression ambiguity more quickly. */
10387 {
10390 }
10392 /* If the next two tokens are both identifiers, the code is
10393 erroneous. The usual cause of this situation is code like:
10395 T t;
10397 where "T" should name a type -- but does not. */
10400 {
10401 /* If parsing tentatively, we should commit; we really are
10402 looking at a declaration. */
10404 /* Give up. */
10406 }
10408 /* If we have seen at least one decl-specifier, and the next token
10409 is not a parenthesis, then we must be looking at a declaration.
10410 (After "int (" we might be looking at a functional cast.) */
10417 /* Keep going until we hit the `;' at the end of the simple
10418 declaration. */
10421 CPP_SEMICOLON))
10422 {
10425 tree decl;
10428 {
10429 /* If we are processing next declarator, coma is expected */
10435 }
10436 else
10439 /* Parse the init-declarator. */
10442 function_definition_allowed_p,
10444 declares_class_or_enum,
10446 maybe_range_for_decl);
10447 /* If an error occurred while parsing tentatively, exit quickly.
10448 (That usually happens when in the body of a function; each
10449 statement is treated as a declaration-statement until proven
10450 otherwise.) */
10453 /* Handle function definitions specially. */
10455 {
10456 /* If the next token is a `,', then we are probably
10457 processing something like:
10459 void f() {}, *p;
10461 which is erroneous. */
10463 {
10466 "mixing"
10468 }
10469 /* Otherwise, we're done with the list of declarators. */
10470 else
10471 {
10474 }
10475 }
10478 /* The next token should be either a `,' or a `;'. */
10480 /* If it's a `,', there are more declarators to come. */
10483 /* If it's a `;', we are done. */
10486 /* Anything else is an error. */
10487 else
10488 {
10489 /* If we have already issued an error message we don't need
10490 to issue another one. */
10494 /* Skip tokens until we reach the end of the statement. */
10496 /* If the next token is now a `;', consume it. */
10500 }
10501 /* After the first time around, a function-definition is not
10502 allowed -- even if it was OK at first. For example:
10504 int i, f() {}
10506 is not valid. */
10508 }
10510 /* Issue an error message if no declarators are present, and the
10511 decl-specifier-seq does not itself declare a class or
10512 enumeration. */
10514 {
10517 /* Perform any deferred access checks. */
10519 }
10521 /* Consume the `;'. */
10525 done:
10527 }
10529 /* Parse a decl-specifier-seq.
10531 decl-specifier-seq:
10532 decl-specifier-seq [opt] decl-specifier
10534 decl-specifier:
10535 storage-class-specifier
10536 type-specifier
10537 function-specifier
10538 friend
10539 typedef
10541 GNU Extension:
10543 decl-specifier:
10544 attributes
10546 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10548 The parser flags FLAGS is used to control type-specifier parsing.
10550 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10551 flags:
10553 1: one of the decl-specifiers is an elaborated-type-specifier
10554 (i.e., a type declaration)
10555 2: one of the decl-specifiers is an enum-specifier or a
10556 class-specifier (i.e., a type definition)
10558 */
10560 static void
10562 cp_parser_flags flags,
10565 {
10568 cp_decl_spec ds;
10570 /* Clear DECL_SPECS. */
10573 /* Assume no class or enumeration type is declared. */
10576 /* Keep reading specifiers until there are no more to read. */
10578 {
10584 /* Peek at the next token. */
10587 /* Save the first token of the decl spec list for error
10588 reporting. */
10591 /* Handle attributes. */
10593 {
10594 /* Parse the attributes. */
10595 decl_specs->attributes
10601 }
10602 /* Assume we will find a decl-specifier keyword. */
10604 /* If the next token is an appropriate keyword, we can simply
10605 add it to the list. */
10607 {
10608 /* decl-specifier:
10609 friend
10610 constexpr */
10613 {
10616 }
10617 else
10618 {
10620 /* Consume the token. */
10622 }
10630 /* function-specifier:
10631 inline
10632 virtual
10633 explicit */
10640 /* decl-specifier:
10641 typedef */
10644 /* Consume the token. */
10646 /* A constructor declarator cannot appear in a typedef. */
10648 /* The "typedef" keyword can only occur in a declaration; we
10649 may as well commit at this point. */
10656 /* storage-class-specifier:
10657 auto
10658 register
10659 static
10660 extern
10661 mutable
10663 GNU Extension:
10664 thread */
10667 {
10668 /* Consume the token. */
10671 /* Complain about `auto' as a storage specifier, if
10672 we're complaining about C++0x compatibility. */
10676 /* Set the storage class anyway. */
10679 }
10680 else
10681 /* C++0x auto type-specifier. */
10689 /* Consume the token. */
10695 /* Consume the token. */
10701 /* We did not yet find a decl-specifier yet. */
10704 }
10714 /* Constructors are a special case. The `S' in `S()' is not a
10715 decl-specifier; it is the beginning of the declarator. */
10716 constructor_p
10717 = (!found_decl_spec
10718 && constructor_possible_p
10719 && (cp_parser_constructor_declarator_p
10722 /* If we don't have a DECL_SPEC yet, then we must be looking at
10723 a type-specifier. */
10725 {
10728 tree type_spec;
10730 type_spec
10732 decl_specs,
10738 /* If this type-specifier referenced a user-defined type
10739 (a typedef, class-name, etc.), then we can't allow any
10740 more such type-specifiers henceforth.
10742 [dcl.spec]
10744 The longest sequence of decl-specifiers that could
10745 possibly be a type name is taken as the
10746 decl-specifier-seq of a declaration. The sequence shall
10747 be self-consistent as described below.
10749 [dcl.type]
10751 As a general rule, at most one type-specifier is allowed
10752 in the complete decl-specifier-seq of a declaration. The
10753 only exceptions are the following:
10755 -- const or volatile can be combined with any other
10756 type-specifier.
10758 -- signed or unsigned can be combined with char, long,
10759 short, or int.
10761 -- ..
10763 Example:
10765 typedef char* Pc;
10766 void g (const int Pc);
10768 Here, Pc is *not* part of the decl-specifier seq; it's
10769 the declarator. Therefore, once we see a type-specifier
10770 (other than a cv-qualifier), we forbid any additional
10771 user-defined types. We *do* still allow things like `int
10772 int' to be considered a decl-specifier-seq, and issue the
10773 error message later. */
10776 /* A constructor declarator cannot follow a type-specifier. */
10778 {
10783 }
10784 }
10786 /* If we still do not have a DECL_SPEC, then there are no more
10787 decl-specifiers. */
10792 /* After we see one decl-specifier, further decl-specifiers are
10793 always optional. */
10795 }
10797 /* Don't allow a friend specifier with a class definition. */
10802 }
10804 /* Parse an (optional) storage-class-specifier.
10806 storage-class-specifier:
10807 auto
10808 register
10809 static
10810 extern
10811 mutable
10813 GNU Extension:
10815 storage-class-specifier:
10816 thread
10818 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10820 static tree
10822 {
10824 {
10828 /* Fall through for C++98. */
10835 /* Consume the token. */
10840 }
10841 }
10843 /* Parse an (optional) function-specifier.
10845 function-specifier:
10846 inline
10847 virtual
10848 explicit
10850 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10851 Updates DECL_SPECS, if it is non-NULL. */
10853 static tree
10856 {
10859 {
10865 /* 14.5.2.3 [temp.mem]
10867 A member function template shall not be virtual. */
10879 }
10881 /* Consume the token. */
10883 }
10885 /* Parse a linkage-specification.
10887 linkage-specification:
10888 extern string-literal { declaration-seq [opt] }
10889 extern string-literal declaration */
10891 static void
10893 {
10894 tree linkage;
10896 /* Look for the `extern' keyword. */
10899 /* Look for the string-literal. */
10902 /* Transform the literal into an identifier. If the literal is a
10903 wide-character string, or contains embedded NULs, then we can't
10904 handle it as the user wants. */
10907 {
10909 /* Assume C++ linkage. */
10911 }
10912 else
10915 /* We're now using the new linkage. */
10918 /* If the next token is a `{', then we're using the first
10919 production. */
10921 {
10922 /* Consume the `{' token. */
10924 /* Parse the declarations. */
10926 /* Look for the closing `}'. */
10928 }
10929 /* Otherwise, there's just one declaration. */
10930 else
10931 {
10934 saved_in_unbraced_linkage_specification_p
10938 parser->in_unbraced_linkage_specification_p
10940 }
10942 /* We're done with the linkage-specification. */
10944 }
10946 /* Parse a static_assert-declaration.
10948 static_assert-declaration:
10949 static_assert ( constant-expression , string-literal ) ;
10951 If MEMBER_P, this static_assert is a class member. */
10953 static void
10955 {
10956 tree condition;
10957 tree message;
10959 location_t saved_loc;
10962 /* Peek at the `static_assert' token so we can keep track of exactly
10963 where the static assertion started. */
10967 /* Look for the `static_assert' keyword. */
10969 RT_STATIC_ASSERT))
10972 /* We know we are in a static assertion; commit to any tentative
10973 parse. */
10977 /* Parse the `(' starting the static assertion condition. */
10980 /* Parse the constant-expression. Allow a non-constant expression
10981 here in order to give better diagnostics in finish_static_assert. */
10982 condition =
10987 /* Parse the separating `,'. */
10990 /* Parse the string-literal message. */
10995 /* A `)' completes the static assertion. */
11002 /* A semicolon terminates the declaration. */
11005 /* Complete the static assertion, which may mean either processing
11006 the static assert now or saving it for template instantiation. */
11008 }
11010 /* Parse a `decltype' type. Returns the type.
11012 simple-type-specifier:
11013 decltype ( expression ) */
11015 static tree
11017 {
11018 tree expr;
11027 {
11028 /* Already parsed. */
11031 }
11033 /* Look for the `decltype' token. */
11037 /* Types cannot be defined in a `decltype' expression. Save away the
11038 old message. */
11041 /* And create the new one. */
11042 parser->type_definition_forbidden_message
11045 /* The restrictions on constant-expressions do not apply inside
11046 decltype expressions. */
11047 saved_integral_constant_expression_p
11049 saved_non_integral_constant_expression_p
11053 /* Do not actually evaluate the expression. */
11056 /* Do not warn about problems with the expression. */
11059 /* Parse the opening `('. */
11063 /* First, try parsing an id-expression. */
11074 {
11077 cp_id_kind idk;
11081 /* Lookup the name we got back from the id-expression. */
11083 none_type,
11097 {
11098 /* Complete lookup of the id-expression. */
11099 expr = (finish_id_expression
11112 /* We found an id-expression, but it was something that we
11113 should not have found. This is an error, not something
11114 we can recover from, so note that we found an
11115 id-expression and we'll recover as gracefully as
11116 possible. */
11118 }
11123 /* We have an id-expression. */
11125 }
11128 {
11129 /* Abort the id-expression parse. */
11132 /* Parsing tentatively, again. */
11135 /* Parse a class member access. */
11143 /* We have an id-expression. */
11145 }
11148 /* We have parsed the complete id-expression or member access. */
11150 else
11151 {
11154 /* Abort our attempt to parse an id-expression or member access
11155 expression. */
11158 /* Within a parenthesized expression, a `>' token is always
11159 the greater-than operator. */
11160 saved_greater_than_is_operator_p
11164 /* Parse a full expression. */
11167 /* The `>' token might be the end of a template-id or
11168 template-parameter-list now. */
11169 parser->greater_than_is_operator_p
11171 }
11173 /* Go back to evaluating expressions. */
11177 /* Restore the old message and the integral constant expression
11178 flags. */
11180 parser->integral_constant_expression_p
11182 parser->non_integral_constant_expression_p
11185 /* Parse to the closing `)'. */
11187 {
11191 }
11194 tf_warning_or_error);
11196 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11197 it again. */
11204 }
11206 /* Special member functions [gram.special] */
11208 /* Parse a conversion-function-id.
11210 conversion-function-id:
11211 operator conversion-type-id
11213 Returns an IDENTIFIER_NODE representing the operator. */
11215 static tree
11217 {
11218 tree type;
11219 tree saved_scope;
11220 tree saved_qualifying_scope;
11221 tree saved_object_scope;
11224 /* Look for the `operator' token. */
11227 /* When we parse the conversion-type-id, the current scope will be
11228 reset. However, we need that information in able to look up the
11229 conversion function later, so we save it here. */
11233 /* We must enter the scope of the class so that the names of
11234 entities declared within the class are available in the
11235 conversion-type-id. For example, consider:
11237 struct S {
11238 typedef int I;
11239 operator I();
11240 };
11242 S::operator I() { ... }
11244 In order to see that `I' is a type-name in the definition, we
11245 must be in the scope of `S'. */
11248 /* Parse the conversion-type-id. */
11250 /* Leave the scope of the class, if any. */
11253 /* Restore the saved scope. */
11257 /* If the TYPE is invalid, indicate failure. */
11261 }
11263 /* Parse a conversion-type-id:
11265 conversion-type-id:
11266 type-specifier-seq conversion-declarator [opt]
11268 Returns the TYPE specified. */
11270 static tree
11272 {
11273 tree attributes;
11274 cp_decl_specifier_seq type_specifiers;
11276 tree type_specified;
11278 /* Parse the attributes. */
11280 /* Parse the type-specifiers. */
11284 /* If that didn't work, stop. */
11287 /* Parse the conversion-declarator. */
11295 /* Don't give this error when parsing tentatively. This happens to
11296 work because we always parse this definitively once. */
11299 {
11301 {
11304 }
11308 }
11311 }
11313 /* Parse an (optional) conversion-declarator.
11315 conversion-declarator:
11316 ptr-operator conversion-declarator [opt]
11318 */
11322 {
11324 tree class_type;
11325 cp_cv_quals cv_quals;
11327 /* We don't know if there's a ptr-operator next, or not. */
11329 /* Try the ptr-operator. */
11331 /* If it worked, look for more conversion-declarators. */
11333 {
11336 /* Parse another optional declarator. */
11339 return cp_parser_make_indirect_declarator
11341 }
11344 }
11346 /* Parse an (optional) ctor-initializer.
11348 ctor-initializer:
11349 : mem-initializer-list
11351 Returns TRUE iff the ctor-initializer was actually present. */
11353 static bool
11355 {
11356 /* If the next token is not a `:', then there is no
11357 ctor-initializer. */
11359 {
11360 /* Do default initialization of any bases and members. */
11365 }
11367 /* Consume the `:' token. */
11369 /* And the mem-initializer-list. */
11373 }
11375 /* Parse a mem-initializer-list.
11377 mem-initializer-list:
11378 mem-initializer ... [opt]
11379 mem-initializer ... [opt] , mem-initializer-list */
11381 static void
11383 {
11388 /* Let the semantic analysis code know that we are starting the
11389 mem-initializer-list. */
11394 /* Loop through the list. */
11396 {
11397 tree mem_initializer;
11400 /* Parse the mem-initializer. */
11402 /* If the next token is a `...', we're expanding member initializers. */
11404 {
11405 /* Consume the `...'. */
11408 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11409 can be expanded but members cannot. */
11412 {
11417 }
11419 /* Construct the pack expansion type. */
11422 }
11425 {
11429 }
11430 /* Look for a target constructor. */
11434 {
11437 {
11441 }
11443 }
11444 /* Add it to the list, unless it was erroneous. */
11446 {
11449 }
11450 /* If the next token is not a `,', we're done. */
11453 /* Consume the `,' token. */
11455 }
11457 /* Perform semantic analysis. */
11460 }
11462 /* Parse a mem-initializer.
11464 mem-initializer:
11465 mem-initializer-id ( expression-list [opt] )
11466 mem-initializer-id braced-init-list
11468 GNU extension:
11470 mem-initializer:
11471 ( expression-list [opt] )
11473 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11474 class) or FIELD_DECL (for a non-static data member) to initialize;
11475 the TREE_VALUE is the expression-list. An empty initialization
11476 list is represented by void_list_node. */
11478 static tree
11480 {
11481 tree mem_initializer_id;
11482 tree expression_list;
11483 tree member;
11486 /* Find out what is being initialized. */
11488 {
11492 }
11493 else
11494 {
11498 }
11504 {
11510 }
11511 else
11512 {
11522 }
11532 }
11534 /* Parse a mem-initializer-id.
11536 mem-initializer-id:
11537 :: [opt] nested-name-specifier [opt] class-name
11538 identifier
11540 Returns a TYPE indicating the class to be initializer for the first
11541 production. Returns an IDENTIFIER_NODE indicating the data member
11542 to be initialized for the second production. */
11544 static tree
11546 {
11550 tree id;
11554 /* `typename' is not allowed in this context ([temp.res]). */
11556 {
11558 "keyword %<typename%> not allowed in this context (a qualified "
11561 }
11562 /* Look for the optional `::' operator. */
11563 global_scope_p
11567 /* Look for the optional nested-name-specifier. The simplest way to
11568 implement:
11570 [temp.res]
11572 The keyword `typename' is not permitted in a base-specifier or
11573 mem-initializer; in these contexts a qualified name that
11574 depends on a template-parameter is implicitly assumed to be a
11575 type name.
11577 is to assume that we have seen the `typename' keyword at this
11578 point. */
11579 nested_name_specifier_p
11588 /* If there is a `::' operator or a nested-name-specifier, then we
11589 are definitely looking for a class-name. */
11594 typename_type,
11598 /* Otherwise, we could also be looking for an ordinary identifier. */
11600 /* Try a class-name. */
11604 none_type,
11608 /* If we found one, we're done. */
11611 /* Otherwise, look for an ordinary identifier. */
11613 }
11615 /* Overloading [gram.over] */
11617 /* Parse an operator-function-id.
11619 operator-function-id:
11620 operator operator
11622 Returns an IDENTIFIER_NODE for the operator which is a
11623 human-readable spelling of the identifier, e.g., `operator +'. */
11625 static tree
11627 {
11628 /* Look for the `operator' keyword. */
11631 /* And then the name of the operator itself. */
11633 }
11635 /* Return an identifier node for a user-defined literal operator.
11636 The suffix identifier is chained to the operator name identifier. */
11638 static tree
11640 {
11641 tree identifier;
11646 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11649 }
11651 /* Parse an operator.
11653 operator:
11654 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11655 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11656 || ++ -- , ->* -> () []
11658 GNU Extensions:
11660 operator:
11661 <? >? <?= >?=
11663 Returns an IDENTIFIER_NODE for the operator which is a
11664 human-readable spelling of the identifier, e.g., `operator +'. */
11666 static tree
11668 {
11672 /* Peek at the next token. */
11674 /* Figure out which operator we have. */
11676 {
11678 {
11681 /* The keyword should be either `new' or `delete'. */
11686 else
11689 /* Consume the `new' or `delete' token. */
11692 /* Peek at the next token. */
11694 /* If it's a `[' token then this is the array variant of the
11695 operator. */
11697 {
11698 /* Consume the `[' token. */
11700 /* Look for the `]' token. */
11704 }
11705 /* Otherwise, we have the non-array variant. */
11706 else
11710 }
11857 /* Consume the `('. */
11859 /* Look for the matching `)'. */
11864 /* Consume the `['. */
11866 /* Look for the matching `]'. */
11874 {
11877 }
11878 /* Consume the string. */
11880 /* Look for the suffix identifier. */
11883 {
11886 {
11889 }
11890 }
11891 else
11892 {
11895 }
11902 /* Anything else is an error. */
11904 }
11906 /* If we have selected an identifier, we need to consume the
11907 operator token. */
11910 /* Otherwise, no valid operator name was present. */
11911 else
11912 {
11915 }
11918 }
11920 /* Parse a template-declaration.
11922 template-declaration:
11923 export [opt] template < template-parameter-list > declaration
11925 If MEMBER_P is TRUE, this template-declaration occurs within a
11926 class-specifier.
11928 The grammar rule given by the standard isn't correct. What
11929 is really meant is:
11931 template-declaration:
11932 export [opt] template-parameter-list-seq
11933 decl-specifier-seq [opt] init-declarator [opt] ;
11934 export [opt] template-parameter-list-seq
11935 function-definition
11937 template-parameter-list-seq:
11938 template-parameter-list-seq [opt]
11939 template < template-parameter-list > */
11941 static void
11943 {
11944 /* Check for `export'. */
11946 {
11947 /* Consume the `export' token. */
11949 /* Warn that we do not support `export'. */
11951 }
11954 }
11956 /* Parse a template-parameter-list.
11958 template-parameter-list:
11959 template-parameter
11960 template-parameter-list , template-parameter
11962 Returns a TREE_LIST. Each node represents a template parameter.
11963 The nodes are connected via their TREE_CHAINs. */
11965 static tree
11967 {
11972 /* The loop below parses the template parms. We first need to know
11973 the total number of template parms to be able to compute proper
11974 canonical types of each dependent type. So after the loop, when
11975 we know the total number of template parms,
11976 end_template_parm_list computes the proper canonical types and
11977 fixes up the dependent types accordingly. */
11979 {
11980 tree parameter;
11983 location_t parm_loc;
11985 /* Parse the template-parameter. */
11990 /* Add it to the list. */
11993 parm_loc,
11994 parameter,
11995 is_non_type,
11996 is_parameter_pack);
11997 else
11998 {
12001 }
12003 /* If the next token is not a `,', we're done. */
12006 /* Otherwise, consume the `,' token. */
12008 }
12011 }
12013 /* Parse a template-parameter.
12015 template-parameter:
12016 type-parameter
12017 parameter-declaration
12019 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12020 the parameter. The TREE_PURPOSE is the default value, if any.
12021 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12022 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12023 set to true iff this parameter is a parameter pack. */
12025 static tree
12028 {
12032 tree parm;
12034 /* Assume it is a type parameter or a template parameter. */
12036 /* Assume it not a parameter pack. */
12038 /* Peek at the next token. */
12040 /* If it is `class' or `template', we have a type-parameter. */
12043 /* If it is `class' or `typename' we do not know yet whether it is a
12044 type parameter or a non-type parameter. Consider:
12046 template <typename T, typename T::X X> ...
12048 or:
12050 template <class C, class D*> ...
12052 Here, the first parameter is a type parameter, and the second is
12053 a non-type parameter. We can tell by looking at the token after
12054 the identifier -- if it is a `,', `=', or `>' then we have a type
12055 parameter. */
12057 {
12058 /* Peek at the token after `class' or `typename'. */
12060 /* If it's an ellipsis, we have a template type parameter
12061 pack. */
12064 /* If it's an identifier, skip it. */
12067 /* Now, see if the token looks like the end of a template
12068 parameter. */
12073 }
12075 /* Otherwise, it is a non-type parameter.
12077 [temp.param]
12079 When parsing a default template-argument for a non-type
12080 template-parameter, the first non-nested `>' is taken as the end
12081 of the template parameter-list rather than a greater-than
12082 operator. */
12084 parameter_declarator
12088 /* If the parameter declaration is marked as a parameter pack, set
12089 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12090 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12091 grokdeclarator. */
12095 {
12098 }
12100 /* If the next token is an ellipsis, and we don't already have it
12101 marked as a parameter pack, then we have a parameter pack (that
12102 has no declarator). */
12106 {
12107 /* Consume the `...'. */
12112 }
12113 /* We might end up with a pack expansion as the type of the non-type
12114 template parameter, in which case this is a non-type template
12115 parameter pack. */
12119 {
12123 }
12126 {
12127 /* Parameter packs cannot have default arguments. However, a
12128 user may try to do so, so we'll parse them and give an
12129 appropriate diagnostic here. */
12133 /* Find the name of the parameter pack. */
12142 else
12146 /* Parse the default argument, but throw away the result. */
12148 }
12158 }
12160 /* Parse a type-parameter.
12162 type-parameter:
12163 class identifier [opt]
12164 class identifier [opt] = type-id
12165 typename identifier [opt]
12166 typename identifier [opt] = type-id
12167 template < template-parameter-list > class identifier [opt]
12168 template < template-parameter-list > class identifier [opt]
12169 = id-expression
12171 GNU Extension (variadic templates):
12173 type-parameter:
12174 class ... identifier [opt]
12175 typename ... identifier [opt]
12177 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12178 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12179 the declaration of the parameter.
12181 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12183 static tree
12185 {
12187 tree parameter;
12189 /* Look for a keyword to tell us what kind of parameter this is. */
12195 {
12198 {
12199 tree identifier;
12200 tree default_argument;
12202 /* If the next token is an ellipsis, we have a template
12203 argument pack. */
12205 {
12206 /* Consume the `...' token. */
12211 }
12213 /* If the next token is an identifier, then it names the
12214 parameter. */
12217 else
12220 /* Create the parameter. */
12223 /* If the next token is an `=', we have a default argument. */
12225 {
12226 /* Consume the `=' token. */
12228 /* Parse the default-argument. */
12232 /* Template parameter packs cannot have default
12233 arguments. */
12235 {
12238 "template parameter pack %qD cannot have a "
12240 else
12242 "template parameter packs cannot have "
12245 }
12247 }
12248 else
12251 /* Create the combined representation of the parameter and the
12252 default argument. */
12254 }
12258 {
12259 tree identifier;
12260 tree default_argument;
12262 /* Look for the `<'. */
12264 /* Parse the template-parameter-list. */
12266 /* Look for the `>'. */
12268 /* Look for the `class' keyword. */
12270 /* If the next token is an ellipsis, we have a template
12271 argument pack. */
12273 {
12274 /* Consume the `...' token. */
12279 }
12280 /* If the next token is an `=', then there is a
12281 default-argument. If the next token is a `>', we are at
12282 the end of the parameter-list. If the next token is a `,',
12283 then we are at the end of this parameter. */
12287 {
12289 /* Treat invalid names as if the parameter were nameless. */
12292 }
12293 else
12296 /* Create the template parameter. */
12298 identifier);
12300 /* If the next token is an `=', then there is a
12301 default-argument. */
12303 {
12306 /* Consume the `='. */
12308 /* Parse the id-expression. */
12310 /* save token before parsing the id-expression, for error
12311 reporting */
12313 default_argument
12321 /* If the id-expression was a template-id that refers to
12322 a template-class, we already have the declaration here,
12323 so no further lookup is needed. */
12324 ;
12325 else
12326 /* Look up the name. */
12327 default_argument
12329 none_type,
12335 /* See if the default argument is valid. */
12336 default_argument
12339 /* Template parameter packs cannot have default
12340 arguments. */
12342 {
12345 "template parameter pack %qD cannot "
12347 identifier);
12348 else
12352 }
12354 }
12355 else
12358 /* Create the combined representation of the parameter and the
12359 default argument. */
12361 }
12367 }
12370 }
12372 /* Parse a template-id.
12374 template-id:
12375 template-name < template-argument-list [opt] >
12377 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12378 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12379 returned. Otherwise, if the template-name names a function, or set
12380 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12381 names a class, returns a TYPE_DECL for the specialization.
12383 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12384 uninstantiated templates. */
12386 static tree
12392 {
12394 tree templ;
12395 tree arguments;
12396 tree template_id;
12403 /* If the next token corresponds to a template-id, there is no need
12404 to reparse it. */
12407 {
12410 /* Get the stored value. */
12412 /* Perform any access checks that were deferred. */
12415 {
12420 tf_warning_or_error);
12421 }
12422 /* Return the stored value. */
12424 }
12426 /* Avoid performing name lookup if there is no possibility of
12427 finding a template-id. */
12430 && !cp_parser_nth_token_starts_template_argument_list_p
12432 {
12435 }
12437 /* Remember where the template-id starts. */
12443 /* Parse the template-name. */
12446 check_dependency_p,
12447 is_declaration,
12448 tag_type,
12451 {
12454 }
12456 /* If we find the sequence `[:' after a template-name, it's probably
12457 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12458 parse correctly the argument list. */
12465 {
12467 /* Change `:' into `::'. */
12469 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12470 CPP_LESS. */
12473 /* Parse the arguments. */
12476 {
12477 /* If we couldn't parse an argument list, then we revert our changes
12478 and return simply an error. Maybe this is not a template-id
12479 after all. */
12484 }
12485 /* Otherwise, emit an error about the invalid digraph, but continue
12486 parsing because we got our argument list. */
12489 {
12492 "%<<:%> is an alternate spelling for %<[%>."
12495 {
12499 }
12500 }
12501 }
12502 else
12503 {
12504 /* Look for the `<' that starts the template-argument-list. */
12506 {
12509 }
12510 /* Parse the arguments. */
12512 }
12514 /* Build a representation of the specialization. */
12517 TEMPLATE_ID_EXPR,
12521 {
12523 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12524 template (rather than some instantiation thereof) only if
12525 is not nested within some other construct. For example, in
12526 "template <typename T> void f(T) { A<T>::", A<T> is just an
12527 instantiation of A. */
12530 CPP_SCOPE));
12531 template_id
12533 }
12534 else
12535 {
12536 /* If it's not a class-template or a template-template, it should be
12537 a function-template. */
12543 }
12545 /* If parsing tentatively, replace the sequence of tokens that makes
12546 up the template-id with a CPP_TEMPLATE_ID token. That way,
12547 should we re-parse the token stream, we will not have to repeat
12548 the effort required to do the parse, nor will we issue duplicate
12549 error messages about problems during instantiation of the
12550 template. */
12552 {
12555 /* Reset the contents of the START_OF_ID token. */
12557 /* Retrieve any deferred checks. Do not pop this access checks yet
12558 so the memory will not be reclaimed during token replacing below. */
12564 /* Purge all subsequent tokens. */
12567 /* ??? Can we actually assume that, if template_id ==
12568 error_mark_node, we will have issued a diagnostic to the
12569 user, as opposed to simply marking the tentative parse as
12570 failed? */
12573 }
12577 }
12579 /* Parse a template-name.
12581 template-name:
12582 identifier
12584 The standard should actually say:
12586 template-name:
12587 identifier
12588 operator-function-id
12590 A defect report has been filed about this issue.
12592 A conversion-function-id cannot be a template name because they cannot
12593 be part of a template-id. In fact, looking at this code:
12595 a.operator K<int>()
12597 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12598 It is impossible to call a templated conversion-function-id with an
12599 explicit argument list, since the only allowed template parameter is
12600 the type to which it is converting.
12602 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12603 `template' keyword, in a construction like:
12605 T::template f<3>()
12607 In that case `f' is taken to be a template-name, even though there
12608 is no way of knowing for sure.
12610 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12611 name refers to a set of overloaded functions, at least one of which
12612 is a template, or an IDENTIFIER_NODE with the name of the template,
12613 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12614 names are looked up inside uninstantiated templates. */
12616 static tree
12623 {
12624 tree identifier;
12625 tree decl;
12626 tree fns;
12629 /* If the next token is `operator', then we have either an
12630 operator-function-id or a conversion-function-id. */
12632 {
12633 /* We don't know whether we're looking at an
12634 operator-function-id or a conversion-function-id. */
12636 /* Try an operator-function-id. */
12638 /* If that didn't work, try a conversion-function-id. */
12640 {
12643 }
12644 }
12645 /* Look for the identifier. */
12646 else
12649 /* If we didn't find an identifier, we don't have a template-id. */
12653 /* If the name immediately followed the `template' keyword, then it
12654 is a template-name. However, if the next token is not `<', then
12655 we do not treat it as a template-name, since it is not being used
12656 as part of a template-id. This enables us to handle constructs
12657 like:
12659 template <typename T> struct S { S(); };
12660 template <typename T> S<T>::S();
12662 correctly. We would treat `S' as a template -- if it were `S<T>'
12663 -- but we do not if there is no `<'. */
12667 {
12668 /* In a declaration, in a dependent context, we pretend that the
12669 "template" keyword was present in order to improve error
12670 recovery. For example, given:
12672 template <typename T> void f(T::X<int>);
12674 we want to treat "X<int>" as a template-id. */
12676 && !template_keyword_p
12678 && check_dependency_p
12680 /* Do not do this for dtors (or ctors), since they never
12681 need the template keyword before their name. */
12683 {
12686 /* Explain what went wrong. */
12688 identifier);
12691 /* If parsing tentatively, find the location of the "<" token. */
12694 /* Parse the template arguments so that we can issue error
12695 messages about them. */
12698 /* Skip tokens until we find a good place from which to
12699 continue parsing. */
12704 /* If parsing tentatively, permanently remove the
12705 template argument list. That will prevent duplicate
12706 error messages from being issued about the missing
12707 "template" keyword. */
12713 }
12715 /* If the "template" keyword is present, then there is generally
12716 no point in doing name-lookup, so we just return IDENTIFIER.
12717 But, if the qualifying scope is non-dependent then we can
12718 (and must) do name-lookup normally. */
12724 }
12726 /* Look up the name. */
12728 tag_type,
12731 check_dependency_p,
12735 /* If DECL is a template, then the name was a template-name. */
12737 ;
12738 else
12739 {
12742 /* The standard does not explicitly indicate whether a name that
12743 names a set of overloaded declarations, some of which are
12744 templates, is a template-name. However, such a name should
12745 be a template-name; otherwise, there is no way to form a
12746 template-id for the overloaded templates. */
12754 {
12755 /* The name does not name a template. */
12758 }
12759 }
12761 /* If DECL is dependent, and refers to a function, then just return
12762 its name; we will look it up again during template instantiation. */
12764 {
12768 }
12771 }
12773 /* Parse a template-argument-list.
12775 template-argument-list:
12776 template-argument ... [opt]
12777 template-argument-list , template-argument ... [opt]
12779 Returns a TREE_VEC containing the arguments. */
12781 static tree
12783 {
12788 tree vec;
12795 /* Even if the template-id appears in an integral
12796 constant-expression, the contents of the argument list do
12797 not. */
12803 /* Parse the arguments. */
12804 do
12805 {
12806 tree argument;
12809 /* Consume the comma. */
12812 /* Parse the template-argument. */
12815 /* If the next token is an ellipsis, we're expanding a template
12816 argument pack. */
12818 {
12820 {
12824 }
12825 /* Consume the `...' token. */
12828 /* Make the argument into a TYPE_PACK_EXPANSION or
12829 EXPR_PACK_EXPANSION. */
12831 }
12834 {
12838 {
12841 }
12842 else
12844 }
12846 }
12859 #ifdef ENABLE_CHECKING
12861 #endif
12863 }
12865 /* Parse a template-argument.
12867 template-argument:
12868 assignment-expression
12869 type-id
12870 id-expression
12872 The representation is that of an assignment-expression, type-id, or
12873 id-expression -- except that the qualified id-expression is
12874 evaluated, so that the value returned is either a DECL or an
12875 OVERLOAD.
12877 Although the standard says "assignment-expression", it forbids
12878 throw-expressions or assignments in the template argument.
12879 Therefore, we use "conditional-expression" instead. */
12881 static tree
12883 {
12884 tree argument;
12890 cp_id_kind idk;
12892 /* There's really no way to know what we're looking at, so we just
12893 try each alternative in order.
12895 [temp.arg]
12897 In a template-argument, an ambiguity between a type-id and an
12898 expression is resolved to a type-id, regardless of the form of
12899 the corresponding template-parameter.
12901 Therefore, we try a type-id first. */
12904 /* If there was no error parsing the type-id but the next token is a
12905 '>>', our behavior depends on which dialect of C++ we're
12906 parsing. In C++98, we probably found a typo for '> >'. But there
12907 are type-id which are also valid expressions. For instance:
12909 struct X { int operator >> (int); };
12910 template <int V> struct Foo {};
12911 Foo<X () >> 5> r;
12913 Here 'X()' is a valid type-id of a function type, but the user just
12914 wanted to write the expression "X() >> 5". Thus, we remember that we
12915 found a valid type-id, but we still try to parse the argument as an
12916 expression to see what happens.
12918 In C++0x, the '>>' will be considered two separate '>'
12919 tokens. */
12923 {
12926 }
12927 else
12928 {
12929 /* If the next token isn't a `,' or a `>', then this argument wasn't
12930 really finished. This means that the argument is not a valid
12931 type-id. */
12934 /* If that worked, we're done. */
12937 }
12938 /* We're still not sure what the argument will be. */
12940 /* Try a template. */
12948 /* If the next token isn't a `,' or a `>', then this argument wasn't
12949 really finished. */
12953 {
12954 /* Figure out what is being referred to. If the id-expression
12955 was for a class template specialization, then we will have a
12956 TYPE_DECL at this point. There is no need to do name lookup
12957 at this point in that case. */
12960 none_type,
12969 }
12972 /* It must be a non-type argument. There permitted cases are given
12973 in [temp.arg.nontype]:
12975 -- an integral constant-expression of integral or enumeration
12976 type; or
12978 -- the name of a non-type template-parameter; or
12980 -- the name of an object or function with external linkage...
12982 -- the address of an object or function with external linkage...
12984 -- a pointer to member... */
12985 /* Look for a non-type template parameter. */
12987 {
12999 }
13001 /* If the next token is "&", the argument must be the address of an
13002 object or function with external linkage. */
13005 {
13008 }
13009 /* See if we might have an id-expression. */
13016 {
13019 address_p,
13026 else
13027 {
13028 tree probe;
13031 {
13034 }
13036 /* If we're in a template, we represent a qualified-id referring
13037 to a static data member as a SCOPE_REF even if the scope isn't
13038 dependent so that we can check access control later. */
13043 {
13044 /* A variable without external linkage might still be a
13045 valid constant-expression, so no error is issued here
13046 if the external-linkage check fails. */
13049 }
13051 /* All overloaded functions are allowed; if the external
13052 linkage test does not pass, an error will be issued
13053 later. */
13054 ;
13058 /* A pointer-to-member. */
13059 ;
13061 ;
13062 else
13066 {
13069 tf_warning_or_error);
13071 }
13072 }
13073 }
13074 /* If the argument started with "&", there are no other valid
13075 alternatives at this point. */
13077 {
13080 }
13082 /* If the argument wasn't successfully parsed as a type-id followed
13083 by '>>', the argument can only be a constant expression now.
13084 Otherwise, we try parsing the constant-expression tentatively,
13085 because the argument could really be a type-id. */
13098 /* We did our best to parse the argument as a non type-id, but that
13099 was the only alternative that matched (albeit with a '>' after
13100 it). We can assume it's just a typo from the user, and a
13101 diagnostic will then be issued. */
13103 }
13105 /* Parse an explicit-instantiation.
13107 explicit-instantiation:
13108 template declaration
13110 Although the standard says `declaration', what it really means is:
13112 explicit-instantiation:
13113 template decl-specifier-seq [opt] declarator [opt] ;
13115 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13116 supposed to be allowed. A defect report has been filed about this
13117 issue.
13119 GNU Extension:
13121 explicit-instantiation:
13122 storage-class-specifier template
13123 decl-specifier-seq [opt] declarator [opt] ;
13124 function-specifier template
13125 decl-specifier-seq [opt] declarator [opt] ; */
13127 static void
13129 {
13131 cp_decl_specifier_seq decl_specifiers;
13136 /* Look for an (optional) storage-class-specifier or
13137 function-specifier. */
13139 {
13140 extension_specifier
13143 extension_specifier
13146 }
13148 /* Look for the `template' keyword. */
13150 /* Let the front end know that we are processing an explicit
13151 instantiation. */
13153 /* [temp.explicit] says that we are supposed to ignore access
13154 control while processing explicit instantiation directives. */
13156 /* Parse a decl-specifier-seq. */
13158 CP_PARSER_FLAGS_OPTIONAL,
13161 /* If there was exactly one decl-specifier, and it declared a class,
13162 and there's no declarator, then we have an explicit type
13163 instantiation. */
13165 {
13166 tree type;
13169 /* Turn access control back on for names used during
13170 template instantiation. */
13175 }
13176 else
13177 {
13179 tree decl;
13181 /* Parse the declarator. */
13182 declarator
13192 {
13195 "explicit instantiation shall not use"
13199 "explicit instantiation shall not use"
13204 /* Turn access control back on for names used during
13205 template instantiation. */
13207 /* Do the explicit instantiation. */
13209 }
13210 else
13211 {
13213 /* Skip the body of the explicit instantiation. */
13215 }
13216 }
13217 /* We're done with the instantiation. */
13223 }
13225 /* Parse an explicit-specialization.
13227 explicit-specialization:
13228 template < > declaration
13230 Although the standard says `declaration', what it really means is:
13232 explicit-specialization:
13233 template <> decl-specifier [opt] init-declarator [opt] ;
13234 template <> function-definition
13235 template <> explicit-specialization
13236 template <> template-declaration */
13238 static void
13240 {
13244 /* Look for the `template' keyword. */
13246 /* Look for the `<'. */
13248 /* Look for the `>'. */
13250 /* We have processed another parameter list. */
13252 /* [temp]
13254 A template ... explicit specialization ... shall not have C
13255 linkage. */
13257 {
13259 /* Give it C++ linkage to avoid confusing other parts of the
13260 front end. */
13263 }
13264 else
13266 /* Let the front end know that we are beginning a specialization. */
13268 {
13271 }
13273 /* If the next keyword is `template', we need to figure out whether
13274 or not we're looking a template-declaration. */
13276 {
13281 else
13283 }
13284 else
13285 /* Parse the dependent declaration. */
13291 /* We're done with the specialization. */
13293 /* For the erroneous case of a template with C linkage, we pushed an
13294 implicit C++ linkage scope; exit that scope now. */
13297 /* We're done with this parameter list. */
13299 }
13301 /* Parse a type-specifier.
13303 type-specifier:
13304 simple-type-specifier
13305 class-specifier
13306 enum-specifier
13307 elaborated-type-specifier
13308 cv-qualifier
13310 GNU Extension:
13312 type-specifier:
13313 __complex__
13315 Returns a representation of the type-specifier. For a
13316 class-specifier, enum-specifier, or elaborated-type-specifier, a
13317 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13319 The parser flags FLAGS is used to control type-specifier parsing.
13321 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13322 in a decl-specifier-seq.
13324 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13325 class-specifier, enum-specifier, or elaborated-type-specifier, then
13326 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13327 if a type is declared; 2 if it is defined. Otherwise, it is set to
13328 zero.
13330 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13331 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13332 is set to FALSE. */
13334 static tree
13336 cp_parser_flags flags,
13341 {
13347 /* Assume this type-specifier does not declare a new type. */
13350 /* And that it does not specify a cv-qualifier. */
13353 /* Peek at the next token. */
13356 /* If we're looking at a keyword, we can use that to guide the
13357 production we choose. */
13360 {
13365 /* Look for the enum-specifier. */
13367 /* If that worked, we're done. */
13369 {
13374 type_spec,
13378 }
13379 else
13382 /* Any of these indicate either a class-specifier, or an
13383 elaborated-type-specifier. */
13390 /* Parse tentatively so that we can back up if we don't find a
13391 class-specifier. */
13393 /* Look for the class-specifier. */
13396 /* If that worked, we're done. */
13398 {
13403 type_spec,
13407 }
13409 /* Fall through. */
13410 elaborated_type_specifier:
13411 /* We're declaring (not defining) a class or enum. */
13415 /* Fall through. */
13417 /* Look for an elaborated-type-specifier. */
13418 type_spec
13419 = (cp_parser_elaborated_type_specifier
13422 is_declaration));
13425 type_spec,
13449 /* The `__complex__' keyword is a GNU extension. */
13455 }
13457 /* Handle simple keywords. */
13459 {
13461 {
13464 }
13466 }
13468 /* If we do not already have a type-specifier, assume we are looking
13469 at a simple-type-specifier. */
13471 decl_specs,
13472 flags);
13474 /* If we didn't find a type-specifier, and a type-specifier was not
13475 optional in this context, issue an error message. */
13477 {
13480 }
13483 }
13485 /* Parse a simple-type-specifier.
13487 simple-type-specifier:
13488 :: [opt] nested-name-specifier [opt] type-name
13489 :: [opt] nested-name-specifier template template-id
13490 char
13491 wchar_t
13492 bool
13493 short
13494 int
13495 long
13496 signed
13497 unsigned
13498 float
13499 double
13500 void
13502 C++0x Extension:
13504 simple-type-specifier:
13505 auto
13506 decltype ( expression )
13507 char16_t
13508 char32_t
13509 __underlying_type ( type-id )
13511 GNU Extension:
13513 simple-type-specifier:
13514 __int128
13515 __typeof__ unary-expression
13516 __typeof__ ( type-id )
13518 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13519 appropriately updated. */
13521 static tree
13524 cp_parser_flags flags)
13525 {
13529 /* Peek at the next token. */
13532 /* If we're looking at a keyword, things are easy. */
13534 {
13597 /* Since DR 743, decltype can either be a simple-type-specifier by
13598 itself or begin a nested-name-specifier. Parsing it will replace
13599 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13600 handling below decide what to do. */
13606 /* Consume the `typeof' token. */
13608 /* Parse the operand to `typeof'. */
13610 /* If it is not already a TYPE, take its type. */
13640 }
13642 /* If token is an already-parsed decltype not followed by ::,
13643 it's a simple-type-specifier. */
13646 {
13654 }
13656 /* If the type-specifier was for a built-in type, we're done. */
13658 {
13659 /* Record the type. */
13666 type,
13672 /* Consume the token. */
13675 /* There is no valid C++ program where a non-template type is
13676 followed by a "<". That usually indicates that the user thought
13677 that the type was a template. */
13682 }
13684 /* The type-specifier must be a user-defined type. */
13686 {
13690 /* Don't gobble tokens or issue error messages if this is an
13691 optional type-specifier. */
13695 /* Look for the optional `::' operator. */
13696 global_p
13700 /* Look for the nested-name specifier. */
13701 qualified_p
13709 /* If we have seen a nested-name-specifier, and the next token
13710 is `template', then we are using the template-id production. */
13713 {
13714 /* Look for the template-id. */
13718 none_type,
13720 /* If the template-id did not name a type, we are out of
13721 luck. */
13723 {
13726 }
13727 }
13728 /* Otherwise, look for a type-name. */
13729 else
13731 /* Keep track of all name-lookups performed in class scopes. */
13733 && !global_p
13734 && !qualified_p
13738 /* If it didn't work out, we don't have a TYPE. */
13746 }
13748 /* If we didn't get a type-name, issue an error message. */
13750 {
13753 }
13756 {
13757 /* See if TYPE is an Objective-C type, and if so, parse and
13758 accept any protocol references following it. Do this before
13759 the cp_parser_check_for_invalid_template_id() call, because
13760 Objective-C types can be followed by '<...>' which would
13761 enclose protocol names rather than template arguments, and so
13762 everything is fine. */
13765 {
13769 /* Clobber the "unqualified" type previously entered into
13770 DECL_SPECS with the new, improved protocol-qualified version. */
13775 }
13777 /* There is no valid C++ program where a non-template type is
13778 followed by a "<". That usually indicates that the user
13779 thought that the type was a template. */
13781 none_type,
13783 }
13786 }
13788 /* Parse a type-name.
13790 type-name:
13791 class-name
13792 enum-name
13793 typedef-name
13794 simple-template-id [in c++0x]
13796 enum-name:
13797 identifier
13799 typedef-name:
13800 identifier
13802 Returns a TYPE_DECL for the type. */
13804 static tree
13806 {
13807 tree type_decl;
13809 /* We can't know yet whether it is a class-name or not. */
13811 /* Try a class-name. */
13815 none_type,
13819 /* If it's not a class-name, keep looking. */
13821 {
13823 /* It must be a typedef-name or an enum-name. */
13827 /* It is either a simple-template-id representing an
13828 instantiation of an alias template... */
13832 none_type,
13834 /* Note that this must be an instantiation of an alias template
13835 because [temp.names]/6 says:
13837 A template-id that names an alias template specialization
13838 is a type-name.
13840 Whereas [temp.names]/7 says:
13842 A simple-template-id that names a class template
13843 specialization is a class-name. */
13848 else
13852 /* ... Or a typedef-name or an enum-name. */
13854 }
13857 }
13859 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
13861 enum-name:
13862 identifier
13864 typedef-name:
13865 identifier
13867 Returns a TYPE_DECL for the type. */
13869 static tree
13871 {
13872 tree type_decl;
13873 tree identifier;
13880 /* Look up the type-name. */
13884 {
13888 {
13889 /* We have found a type introduced by a using
13890 declaration at class scope that refers to a dependent
13891 type.
13893 using typename :: [opt] nested-name-specifier unqualified-id ;
13894 */
13900 }
13901 }
13905 {
13906 /* See if this is an Objective-C type. */
13911 }
13913 /* Issue an error if we did not find a type-name. */
13915 /* In Objective-C, we have the complication that class names are
13916 normally type names and start declarations (eg, the
13917 "NSObject" in "NSObject *object;"), but can be used in an
13918 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
13919 is an expression. So, a classname followed by a dot is not a
13920 valid type-name. */
13923 {
13928 }
13929 /* Remember that the name was used in the definition of the
13930 current class so that we can check later to see if the
13931 meaning would have been different after the class was
13932 entirely defined. */
13938 }
13940 /* Parse an elaborated-type-specifier. Note that the grammar given
13941 here incorporates the resolution to DR68.
13943 elaborated-type-specifier:
13944 class-key :: [opt] nested-name-specifier [opt] identifier
13945 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13946 enum-key :: [opt] nested-name-specifier [opt] identifier
13947 typename :: [opt] nested-name-specifier identifier
13948 typename :: [opt] nested-name-specifier template [opt]
13949 template-id
13951 GNU extension:
13953 elaborated-type-specifier:
13954 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13955 class-key attributes :: [opt] nested-name-specifier [opt]
13956 template [opt] template-id
13957 enum attributes :: [opt] nested-name-specifier [opt] identifier
13959 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13960 declared `friend'. If IS_DECLARATION is TRUE, then this
13961 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13962 something is being declared.
13964 Returns the TYPE specified. */
13966 static tree
13970 {
13972 tree identifier;
13975 tree globalscope;
13978 /* See if we're looking at the `enum' keyword. */
13980 {
13981 /* Consume the `enum' token. */
13983 /* Remember that it's an enumeration type. */
13985 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13986 enums) is used here. */
13989 {
13993 /* Consume the `struct' or `class' and parse it anyway. */
13995 }
13996 /* Parse the attributes. */
13998 }
13999 /* Or, it might be `typename'. */
14001 RID_TYPENAME))
14002 {
14003 /* Consume the `typename' token. */
14005 /* Remember that it's a `typename' type. */
14007 }
14008 /* Otherwise it must be a class-key. */
14009 else
14010 {
14014 /* Parse the attributes. */
14016 }
14018 /* Look for the `::' operator. */
14021 /* Look for the nested-name-specifier. */
14023 {
14028 is_declaration))
14030 }
14031 else
14032 /* Even though `typename' is not present, the proposed resolution
14033 to Core Issue 180 says that in `class A<T>::B', `B' should be
14034 considered a type-name, even if `A<T>' is dependent. */
14039 is_declaration);
14040 /* For everything but enumeration types, consider a template-id.
14041 For an enumeration type, consider only a plain identifier. */
14043 {
14045 tree decl;
14047 /* Allow the `template' keyword. */
14049 /* If we didn't see `template', we don't know if there's a
14050 template-id or not. */
14053 /* Parse the template-id. */
14057 tag_type,
14058 is_declaration);
14059 /* If we didn't find a template-id, look for an ordinary
14060 identifier. */
14062 ;
14063 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14064 in effect, then we must assume that, upon instantiation, the
14065 template will correspond to a class. */
14069 typename_type,
14071 /* If the `typename' keyword is in effect and DECL is not a type
14072 decl. Then type is non existant. */
14075 else
14078 }
14081 {
14086 {
14089 }
14091 /* For a `typename', we needn't call xref_tag. */
14095 identifier,
14097 /* Look up a qualified name in the usual way. */
14099 {
14100 tree decl;
14101 tree ambiguous_decls;
14104 tag_type,
14111 /* If the lookup was ambiguous, an error will already have been
14112 issued. */
14116 /* If we are parsing friend declaration, DECL may be a
14117 TEMPLATE_DECL tree node here. However, we need to check
14118 whether this TEMPLATE_DECL results in valid code. Consider
14119 the following example:
14121 namespace N {
14122 template <class T> class C {};
14123 }
14124 class X {
14125 template <class T> friend class N::C; // #1, valid code
14126 };
14127 template <class T> class Y {
14128 friend class N::C; // #2, invalid code
14129 };
14131 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14132 name lookup of `N::C'. We see that friend declaration must
14133 be template for the code to be valid. Note that
14134 processing_template_decl does not work here since it is
14135 always 1 for the above two cases. */
14137 decl = (cp_parser_maybe_treat_template_as_class
14142 {
14145 identifier,
14148 }
14151 {
14155 allow_template);
14159 }
14161 /* Forward declarations of nested types, such as
14163 class C1::C2;
14164 class C1::C2::C3;
14166 are invalid unless all components preceding the final '::'
14167 are complete. If all enclosing types are complete, these
14168 declarations become merely pointless.
14170 Invalid forward declarations of nested types are errors
14171 caught elsewhere in parsing. Those that are pointless arrive
14172 here. */
14179 }
14180 else
14181 {
14182 /* An elaborated-type-specifier sometimes introduces a new type and
14183 sometimes names an existing type. Normally, the rule is that it
14184 introduces a new type only if there is not an existing type of
14185 the same name already in scope. For example, given:
14187 struct S {};
14188 void f() { struct S s; }
14190 the `struct S' in the body of `f' is the same `struct S' as in
14191 the global scope; the existing definition is used. However, if
14192 there were no global declaration, this would introduce a new
14193 local class named `S'.
14195 An exception to this rule applies to the following code:
14197 namespace N { struct S; }
14199 Here, the elaborated-type-specifier names a new type
14200 unconditionally; even if there is already an `S' in the
14201 containing scope this declaration names a new type.
14202 This exception only applies if the elaborated-type-specifier
14203 forms the complete declaration:
14205 [class.name]
14207 A declaration consisting solely of `class-key identifier ;' is
14208 either a redeclaration of the name in the current scope or a
14209 forward declaration of the identifier as a class name. It
14210 introduces the name into the current scope.
14212 We are in this situation precisely when the next token is a `;'.
14214 An exception to the exception is that a `friend' declaration does
14215 *not* name a new type; i.e., given:
14217 struct S { friend struct T; };
14219 `T' is not a new type in the scope of `S'.
14221 Also, `new struct S' or `sizeof (struct S)' never results in the
14222 definition of a new type; a new type can only be declared in a
14223 declaration context. */
14225 tag_scope ts;
14229 /* Friends have special name lookup rules. */
14233 CPP_SEMICOLON))
14234 /* This is a `class-key identifier ;' */
14236 else
14239 template_p =
14243 /* An unqualified name was used to reference this type, so
14244 there were no qualifying templates. */
14251 }
14252 }
14257 /* Allow attributes on forward declarations of classes. */
14259 {
14269 else
14272 }
14275 {
14276 /* Indicate whether this class was declared as a `class' or as a
14277 `struct'. */
14281 }
14283 /* A "<" cannot follow an elaborated type specifier. If that
14284 happens, the user was probably trying to form a template-id. */
14289 }
14291 /* Parse an enum-specifier.
14293 enum-specifier:
14294 enum-head { enumerator-list [opt] }
14295 enum-head { enumerator-list , } [C++0x]
14297 enum-head:
14298 enum-key identifier [opt] enum-base [opt]
14299 enum-key nested-name-specifier identifier enum-base [opt]
14301 enum-key:
14302 enum
14303 enum class [C++0x]
14304 enum struct [C++0x]
14306 enum-base: [C++0x]
14307 : type-specifier-seq
14309 opaque-enum-specifier:
14310 enum-key identifier enum-base [opt] ;
14312 GNU Extensions:
14313 enum-key attributes[opt] identifier [opt] enum-base [opt]
14314 { enumerator-list [opt] }attributes[opt]
14315 enum-key attributes[opt] identifier [opt] enum-base [opt]
14316 { enumerator-list, }attributes[opt] [C++0x]
14318 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14319 if the token stream isn't an enum-specifier after all. */
14321 static tree
14323 {
14324 tree identifier;
14326 tree prev_scope;
14328 tree attributes;
14341 /* Parse tentatively so that we can back up if we don't find a
14342 enum-specifier. */
14345 /* Caller guarantees that the current token is 'enum', an identifier
14346 possibly follows, and the token after that is an opening brace.
14347 If we don't have an identifier, fabricate an anonymous name for
14348 the enumeration being defined. */
14351 /* Parse the "class" or "struct", which indicates a scoped
14352 enumeration type in C++0x. */
14355 {
14359 /* Consume the `struct' or `class' token. */
14363 }
14367 /* Clear the qualification. */
14372 /* Figure out in what scope the declaration is being placed. */
14378 nested_name_specifier
14386 {
14387 tree name;
14391 enum_type,
14396 input_location);
14398 {
14401 {
14402 /* Are template enums allowed in ISO? */
14406 /* ignore a typename reference, for it will be solved by name
14407 in start_enum. */
14409 }
14410 }
14411 else
14414 }
14415 else
14416 {
14419 else
14420 {
14423 }
14424 }
14427 /* Check for the `:' that denotes a specified underlying type in C++0x.
14428 Note that a ':' could also indicate a bitfield width, however. */
14430 {
14431 cp_decl_specifier_seq type_specifiers;
14433 /* Consume the `:'. */
14436 /* Parse the type-specifier-seq. */
14441 /* At this point this is surely not elaborated type specifier. */
14450 /* If that didn't work, stop. */
14452 {
14457 }
14458 }
14460 /* Look for the `{' but don't consume it yet. */
14462 {
14464 {
14467 {
14470 }
14471 }
14472 /* An opaque-enum-specifier must have a ';' here. */
14475 {
14478 {
14481 }
14482 }
14483 }
14489 {
14491 {
14495 }
14497 {
14499 }
14500 }
14502 /* Issue an error message if type-definitions are forbidden here. */
14505 else
14506 /* Create the new type. We do this before consuming the opening
14507 brace so the enum will be recorded as being on the line of its
14508 tag (or the 'enum' keyword, if there is no tag). */
14512 /* If the next token is not '{' it is an opaque-enum-specifier or an
14513 elaborated-type-specifier. */
14515 {
14518 {
14519 /* The following catches invalid code such as:
14520 enum class S<int>::E { A, B, C }; */
14527 /* If that scope does not contain the scope in which the
14528 class was originally declared, the program is invalid. */
14530 {
14533 "declaration of %qD in namespace %qD which does not "
14536 else
14541 }
14542 }
14547 /* Consume the opening brace. */
14554 {
14558 }
14559 else
14560 {
14565 }
14569 /* If the next token is not '}', then there are some enumerators. */
14573 /* Consume the final '}'. */
14579 }
14580 else
14581 {
14582 /* If a ';' follows, then it is an opaque-enum-specifier
14583 and additional restrictions apply. */
14585 {
14592 }
14593 }
14595 /* Look for trailing attributes to apply to this enumeration, and
14596 apply them if appropriate. */
14598 {
14602 trailing_attr,
14604 }
14606 /* Finish up the enumeration. */
14608 {
14613 }
14616 {
14618 {
14621 }
14623 {
14625 }
14626 }
14627 out:
14630 }
14632 /* Parse an enumerator-list. The enumerators all have the indicated
14633 TYPE.
14635 enumerator-list:
14636 enumerator-definition
14637 enumerator-list , enumerator-definition */
14639 static void
14641 {
14643 {
14644 /* Parse an enumerator-definition. */
14647 /* If the next token is not a ',', we've reached the end of
14648 the list. */
14651 /* Otherwise, consume the `,' and keep going. */
14653 /* If the next token is a `}', there is a trailing comma. */
14655 {
14660 }
14661 }
14662 }
14664 /* Parse an enumerator-definition. The enumerator has the indicated
14665 TYPE.
14667 enumerator-definition:
14668 enumerator
14669 enumerator = constant-expression
14671 enumerator:
14672 identifier */
14674 static void
14676 {
14677 tree identifier;
14678 tree value;
14679 location_t loc;
14681 /* Save the input location because we are interested in the location
14682 of the identifier and not the location of the explicit value. */
14685 /* Look for the identifier. */
14690 /* If the next token is an '=', then there is an explicit value. */
14692 {
14693 /* Consume the `=' token. */
14695 /* Parse the value. */
14698 NULL);
14699 }
14700 else
14703 /* If we are processing a template, make sure the initializer of the
14704 enumerator doesn't contain any bare template parameter pack. */
14708 /* integral_constant_value will pull out this expression, so make sure
14709 it's folded as appropriate. */
14712 /* Create the enumerator. */
14714 }
14716 /* Parse a namespace-name.
14718 namespace-name:
14719 original-namespace-name
14720 namespace-alias
14722 Returns the NAMESPACE_DECL for the namespace. */
14724 static tree
14726 {
14727 tree identifier;
14728 tree namespace_decl;
14732 /* Get the name of the namespace. */
14737 /* Look up the identifier in the currently active scope. Look only
14738 for namespaces, due to:
14740 [basic.lookup.udir]
14742 When looking up a namespace-name in a using-directive or alias
14743 definition, only namespace names are considered.
14745 And:
14747 [basic.lookup.qual]
14749 During the lookup of a name preceding the :: scope resolution
14750 operator, object, function, and enumerator names are ignored.
14752 (Note that cp_parser_qualifying_entity only calls this
14753 function if the token after the name is the scope resolution
14754 operator.) */
14756 none_type,
14762 /* If it's not a namespace, issue an error. */
14765 {
14770 }
14773 }
14775 /* Parse a namespace-definition.
14777 namespace-definition:
14778 named-namespace-definition
14779 unnamed-namespace-definition
14781 named-namespace-definition:
14782 original-namespace-definition
14783 extension-namespace-definition
14785 original-namespace-definition:
14786 namespace identifier { namespace-body }
14788 extension-namespace-definition:
14789 namespace original-namespace-name { namespace-body }
14791 unnamed-namespace-definition:
14792 namespace { namespace-body } */
14794 static void
14796 {
14802 {
14806 }
14807 else
14810 /* Look for the `namespace' keyword. */
14813 /* Get the name of the namespace. We do not attempt to distinguish
14814 between an original-namespace-definition and an
14815 extension-namespace-definition at this point. The semantic
14816 analysis routines are responsible for that. */
14819 else
14822 /* Parse any specified attributes. */
14825 /* Look for the `{' to start the namespace. */
14827 /* Start the namespace. */
14830 /* "inline namespace" is equivalent to a stub namespace definition
14831 followed by a strong using directive. */
14833 {
14835 /* Set up namespace association. */
14839 /* Import the contents of the inline namespace. */
14843 }
14847 /* Parse the body of the namespace. */
14853 /* Finish the namespace. */
14855 /* Look for the final `}'. */
14857 }
14859 /* Parse a namespace-body.
14861 namespace-body:
14862 declaration-seq [opt] */
14864 static void
14866 {
14868 }
14870 /* Parse a namespace-alias-definition.
14872 namespace-alias-definition:
14873 namespace identifier = qualified-namespace-specifier ; */
14875 static void
14877 {
14878 tree identifier;
14879 tree namespace_specifier;
14883 /* Look for the `namespace' keyword. */
14885 /* Look for the identifier. */
14889 /* Look for the `=' token. */
14892 {
14894 /* Skip the definition. */
14899 }
14901 /* Look for the qualified-namespace-specifier. */
14902 namespace_specifier
14904 /* Look for the `;' token. */
14907 /* Register the alias in the symbol table. */
14909 }
14911 /* Parse a qualified-namespace-specifier.
14913 qualified-namespace-specifier:
14914 :: [opt] nested-name-specifier [opt] namespace-name
14916 Returns a NAMESPACE_DECL corresponding to the specified
14917 namespace. */
14919 static tree
14921 {
14922 /* Look for the optional `::'. */
14926 /* Look for the optional nested-name-specifier. */
14934 }
14936 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
14937 access declaration.
14939 using-declaration:
14940 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
14941 using :: unqualified-id ;
14943 access-declaration:
14944 qualified-id ;
14946 */
14948 static bool
14951 {
14955 tree decl;
14956 tree identifier;
14957 tree qscope;
14962 {
14965 }
14966 else
14967 {
14968 /* Look for the `using' keyword. */
14971 /* Peek at the next token. */
14973 /* See if it's `typename'. */
14975 {
14976 /* Remember that we've seen it. */
14978 /* Consume the `typename' token. */
14980 }
14981 }
14983 /* Look for the optional global scope qualification. */
14984 global_scope_p
14989 /* If we saw `typename', or didn't see `::', then there must be a
14990 nested-name-specifier present. */
14996 /* Otherwise, we could be in either of the two productions. In that
14997 case, treat the nested-name-specifier as optional. */
14998 else
15008 /* Something has already gone wrong; there's no need to parse
15009 further. Since an error has occurred, the return value of
15010 cp_parser_parse_definitely will be false, as required. */
15014 /* Parse the unqualified-id. */
15022 {
15027 }
15029 /* The function we call to handle a using-declaration is different
15030 depending on what scope we are in. */
15032 ;
15035 /* [namespace.udecl]
15037 A using declaration shall not name a template-id. */
15040 else
15041 {
15043 {
15044 /* Create the USING_DECL. */
15052 else
15053 /* Add it to the list of members in this class. */
15055 }
15056 else
15057 {
15059 identifier,
15069 else
15071 }
15072 }
15074 /* Look for the final `;'. */
15079 "access declarations are deprecated "
15080 "in favour of using-declarations; "
15084 }
15086 /* Parse an alias-declaration.
15088 alias-declaration:
15089 using identifier attribute-specifier-seq [opt] = type-id */
15091 static tree
15093 {
15097 cp_decl_specifier_seq decl_specs;
15101 /* Look for the `using' keyword. */
15119 /* Now we are going to parse the type-id of the declaration. */
15121 /*
15122 [dcl.type]/3 says:
15124 "A type-specifier-seq shall not define a class or enumeration
15125 unless it appears in the type-id of an alias-declaration (7.1.3) that
15126 is not the declaration of a template-declaration."
15128 In other words, if we currently are in an alias template, the
15129 type-id should not define a type.
15131 So let's set parser->type_definition_forbidden_message in that
15132 case; cp_parser_check_type_definition (called by
15133 cp_parser_class_specifier) will then emit an error if a type is
15134 defined in the type-id. */
15136 {
15140 }
15144 /* Restore the error message if need be. */
15153 /* A typedef-name can also be introduced by an alias-declaration. The
15154 identifier following the using keyword becomes a typedef-name. It has
15155 the same semantics as if it were introduced by the typedef
15156 specifier. In particular, it does not define a new type and it shall
15157 not appear in the type-id. */
15162 {
15165 ds_attribute,
15166 attrs_location);
15167 }
15169 ds_typedef,
15170 using_location);
15172 ds_alias,
15173 using_location);
15182 else
15193 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15194 added into the symbol table; otherwise, return the TYPE_DECL. */
15198 {
15202 }
15205 }
15207 /* Parse a using-directive.
15209 using-directive:
15210 using namespace :: [opt] nested-name-specifier [opt]
15211 namespace-name ; */
15213 static void
15215 {
15216 tree namespace_decl;
15217 tree attribs;
15219 /* Look for the `using' keyword. */
15221 /* And the `namespace' keyword. */
15223 /* Look for the optional `::' operator. */
15225 /* And the optional nested-name-specifier. */
15231 /* Get the namespace being used. */
15233 /* And any specified attributes. */
15235 /* Update the symbol table. */
15237 /* Look for the final `;'. */
15239 }
15241 /* Parse an asm-definition.
15243 asm-definition:
15244 asm ( string-literal ) ;
15246 GNU Extension:
15248 asm-definition:
15249 asm volatile [opt] ( string-literal ) ;
15250 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15251 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15252 : asm-operand-list [opt] ) ;
15253 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15254 : asm-operand-list [opt]
15255 : asm-clobber-list [opt] ) ;
15256 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15257 : asm-clobber-list [opt]
15258 : asm-goto-list ) ; */
15260 static void
15262 {
15263 tree string;
15268 tree asm_stmt;
15276 /* Look for the `asm' keyword. */
15278 /* See if the next token is `volatile'. */
15281 {
15282 /* Remember that we saw the `volatile' keyword. */
15284 /* Consume the token. */
15286 }
15290 {
15291 /* Remember that we saw the `goto' keyword. */
15293 /* Consume the token. */
15295 }
15296 /* Look for the opening `('. */
15299 /* Look for the string. */
15302 {
15306 }
15308 /* If we're allowing GNU extensions, check for the extended assembly
15309 syntax. Unfortunately, the `:' tokens need not be separated by
15310 a space in C, and so, for compatibility, we tolerate that here
15311 too. Doing that means that we have to treat the `::' operator as
15312 two `:' tokens. */
15317 {
15322 /* The extended syntax was used. */
15325 /* Look for outputs. */
15327 {
15328 /* Consume the `:'. */
15330 /* Parse the output-operands. */
15332 CPP_COLON)
15334 CPP_SCOPE)
15336 CPP_CLOSE_PAREN)
15342 }
15343 /* If the next token is `::', there are no outputs, and the
15344 next token is the beginning of the inputs. */
15346 /* The inputs are coming next. */
15349 /* Look for inputs. */
15352 {
15353 /* Consume the `:' or `::'. */
15355 /* Parse the output-operands. */
15357 CPP_COLON)
15359 CPP_SCOPE)
15361 CPP_CLOSE_PAREN))
15366 }
15368 /* The clobbers are coming next. */
15371 /* Look for clobbers. */
15374 {
15376 /* Consume the `:' or `::'. */
15378 /* Parse the clobbers. */
15380 CPP_COLON)
15382 CPP_CLOSE_PAREN))
15384 }
15387 /* The labels are coming next. */
15390 /* Look for labels. */
15393 {
15395 /* Consume the `:' or `::'. */
15397 /* Parse the labels. */
15399 }
15403 }
15407 /* Look for the closing `)'. */
15415 {
15416 /* Create the ASM_EXPR. */
15418 {
15421 /* If the extended syntax was not used, mark the ASM_EXPR. */
15423 {
15429 }
15430 }
15431 else
15433 }
15434 }
15436 /* Declarators [gram.dcl.decl] */
15438 /* Parse an init-declarator.
15440 init-declarator:
15441 declarator initializer [opt]
15443 GNU Extension:
15445 init-declarator:
15446 declarator asm-specification [opt] attributes [opt] initializer [opt]
15448 function-definition:
15449 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15450 function-body
15451 decl-specifier-seq [opt] declarator function-try-block
15453 GNU Extension:
15455 function-definition:
15456 __extension__ function-definition
15458 TM Extension:
15460 function-definition:
15461 decl-specifier-seq [opt] declarator function-transaction-block
15463 The DECL_SPECIFIERS apply to this declarator. Returns a
15464 representation of the entity declared. If MEMBER_P is TRUE, then
15465 this declarator appears in a class scope. The new DECL created by
15466 this declarator is returned.
15468 The CHECKS are access checks that should be performed once we know
15469 what entity is being declared (and, therefore, what classes have
15470 befriended it).
15472 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15473 for a function-definition here as well. If the declarator is a
15474 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15475 be TRUE upon return. By that point, the function-definition will
15476 have been completely parsed.
15478 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15479 is FALSE.
15481 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15482 parsed declaration if it is an uninitialized single declarator not followed
15483 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15484 if present, will not be consumed. If returned, this declarator will be
15485 created with SD_INITIALIZED but will not call cp_finish_decl. */
15487 static tree
15496 {
15500 tree prefix_attributes;
15501 tree attributes;
15502 tree asm_specification;
15503 tree initializer;
15505 tree scope;
15507 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15508 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15509 "(...)". */
15518 /* Gather the attributes that were provided with the
15519 decl-specifiers. */
15522 /* Assume that this is not the declarator for a function
15523 definition. */
15527 /* Defer access checks while parsing the declarator; we cannot know
15528 what names are accessible until we know what is being
15529 declared. */
15532 /* Parse the declarator. */
15534 declarator
15538 member_p);
15539 /* Gather up the deferred checks. */
15542 /* If the DECLARATOR was erroneous, there's no need to go
15543 further. */
15547 /* Check that the number of template-parameter-lists is OK. */
15557 /* Figure out what scope the entity declared by the DECLARATOR is
15558 located in. `grokdeclarator' sometimes changes the scope, so
15559 we compute it now. */
15562 /* Perform any lookups in the declared type which were thought to be
15563 dependent, but are not in the scope of the declarator. */
15564 decl_specifiers->type
15567 /* If we're allowing GNU extensions, look for an asm-specification
15568 and attributes. */
15570 {
15571 /* Look for an asm-specification. */
15574 /* And attributes. */
15577 }
15578 else
15579 {
15582 }
15584 /* Peek at the next token. */
15586 /* Check to see if the token indicates the start of a
15587 function-definition. */
15590 {
15592 {
15593 /* If a function-definition should not appear here, issue an
15594 error message. */
15598 }
15599 else
15600 {
15601 location_t func_brace_location
15604 /* Neither attributes nor an asm-specification are allowed
15605 on a function-definition. */
15608 "an asm-specification is not allowed "
15613 /* This is a function-definition. */
15616 /* Parse the function definition. */
15619 decl_specifiers,
15620 declarator,
15621 prefix_attributes);
15622 else
15623 decl
15624 = (cp_parser_function_definition_from_specifiers_and_declarator
15628 {
15629 /* This is where the prologue starts... */
15632 }
15635 }
15636 }
15638 /* [dcl.dcl]
15640 Only in function declarations for constructors, destructors, and
15641 type conversions can the decl-specifier-seq be omitted.
15643 We explicitly postpone this check past the point where we handle
15644 function-definitions because we tolerate function-definitions
15645 that are missing their return types in some modes. */
15647 {
15651 }
15653 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15657 {
15665 {
15671 }
15672 }
15673 else
15674 {
15675 /* If the init-declarator isn't initialized and isn't followed by a
15676 `,' or `;', it's not a valid init-declarator. */
15679 {
15682 else
15683 {
15686 }
15687 }
15690 }
15692 /* Because start_decl has side-effects, we should only call it if we
15693 know we're going ahead. By this point, we know that we cannot
15694 possibly be looking at any other construct. */
15697 /* If the decl specifiers were bad, issue an error now that we're
15698 sure this was intended to be a declarator. Then continue
15699 declaring the variable(s), as int, to try to cut down on further
15700 errors. */
15703 {
15706 }
15708 /* Check to see whether or not this declaration is a friend. */
15711 /* Enter the newly declared entry in the symbol table. If we're
15712 processing a declaration in a class-specifier, we wait until
15713 after processing the initializer. */
15715 {
15722 /* Adjust location of decl if declarator->id_loc is more appropriate:
15723 set, and decl wasn't merged with another decl, in which case its
15724 location would be different from input_location, and more accurate. */
15729 }
15731 /* Enter the SCOPE. That way unqualified names appearing in the
15732 initializer will be looked up in SCOPE. */
15735 /* Perform deferred access control checks, now that we know in which
15736 SCOPE the declared entity resides. */
15738 {
15741 /* If the entity being declared is a function, pretend that we
15742 are in its scope. If it is a `friend', it may have access to
15743 things that would not otherwise be accessible. */
15745 {
15748 }
15750 /* Perform access checks for template parameters. */
15753 /* Perform the access control checks for the declarator and the
15754 decl-specifiers. */
15757 /* Restore the saved value. */
15760 }
15762 /* Parse the initializer. */
15767 {
15769 {
15773 else
15774 {
15775 /* If the declaration was erroneous, we don't really
15776 know what the user intended, so just silently
15777 consume the initializer. */
15785 }
15786 }
15787 else
15788 {
15789 /* We want to record the extra mangling scope for in-class
15790 initializers of class members and initializers of static data
15791 member templates. The former involves deferring
15792 parsing of the initializer until end of class as with default
15793 arguments. So right here we only handle the latter. */
15803 }
15804 }
15806 /* The old parser allows attributes to appear after a parenthesized
15807 initializer. Mark Mitchell proposed removing this functionality
15808 on the GCC mailing lists on 2002-08-13. This parser accepts the
15809 attributes -- but ignores them. */
15816 /* For an in-class declaration, use `grokfield' to create the
15817 declaration. */
15819 {
15821 {
15824 }
15828 prefix_attributes);
15831 }
15833 /* Finish processing the declaration. But, skip member
15834 declarations. */
15836 {
15839 asm_specification,
15840 /* If the initializer is in parentheses, then this is
15841 a direct-initialization, which means that an
15842 `explicit' constructor is OK. Otherwise, an
15843 `explicit' constructor cannot be used. */
15846 }
15849 /* Core issue #226 (C++0x only): A default template-argument
15850 shall not be specified in a friend class template
15851 declaration. */
15859 }
15861 /* Parse a declarator.
15863 declarator:
15864 direct-declarator
15865 ptr-operator declarator
15867 abstract-declarator:
15868 ptr-operator abstract-declarator [opt]
15869 direct-abstract-declarator
15871 GNU Extensions:
15873 declarator:
15874 attributes [opt] direct-declarator
15875 attributes [opt] ptr-operator declarator
15877 abstract-declarator:
15878 attributes [opt] ptr-operator abstract-declarator [opt]
15879 attributes [opt] direct-abstract-declarator
15881 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
15882 detect constructor, destructor or conversion operators. It is set
15883 to -1 if the declarator is a name, and +1 if it is a
15884 function. Otherwise it is set to zero. Usually you just want to
15885 test for >0, but internally the negative value is used.
15887 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
15888 a decl-specifier-seq unless it declares a constructor, destructor,
15889 or conversion. It might seem that we could check this condition in
15890 semantic analysis, rather than parsing, but that makes it difficult
15891 to handle something like `f()'. We want to notice that there are
15892 no decl-specifiers, and therefore realize that this is an
15893 expression, not a declaration.)
15895 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
15896 the declarator is a direct-declarator of the form "(...)".
15898 MEMBER_P is true iff this declarator is a member-declarator. */
15902 cp_parser_declarator_kind dcl_kind,
15906 {
15909 cp_cv_quals cv_quals;
15910 tree class_type;
15913 /* Assume this is not a constructor, destructor, or type-conversion
15914 operator. */
15921 /* Check for the ptr-operator production. */
15923 /* Parse the ptr-operator. */
15927 /* If that worked, then we have a ptr-operator. */
15929 {
15930 /* If a ptr-operator was found, then this declarator was not
15931 parenthesized. */
15934 /* The dependent declarator is optional if we are parsing an
15935 abstract-declarator. */
15939 /* Parse the dependent declarator. */
15945 /* If we are parsing an abstract-declarator, we must handle the
15946 case where the dependent declarator is absent. */
15951 declarator = cp_parser_make_indirect_declarator
15953 }
15954 /* Everything else is a direct-declarator. */
15955 else
15956 {
15959 CPP_OPEN_PAREN);
15961 ctor_dtor_or_conv_p,
15962 member_p);
15963 }
15969 }
15971 /* Parse a direct-declarator or direct-abstract-declarator.
15973 direct-declarator:
15974 declarator-id
15975 direct-declarator ( parameter-declaration-clause )
15976 cv-qualifier-seq [opt]
15977 exception-specification [opt]
15978 direct-declarator [ constant-expression [opt] ]
15979 ( declarator )
15981 direct-abstract-declarator:
15982 direct-abstract-declarator [opt]
15983 ( parameter-declaration-clause )
15984 cv-qualifier-seq [opt]
15985 exception-specification [opt]
15986 direct-abstract-declarator [opt] [ constant-expression [opt] ]
15987 ( abstract-declarator )
15989 Returns a representation of the declarator. DCL_KIND is
15990 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
15991 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
15992 we are parsing a direct-declarator. It is
15993 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
15994 of ambiguity we prefer an abstract declarator, as per
15995 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
15996 cp_parser_declarator. */
16000 cp_parser_declarator_kind dcl_kind,
16003 {
16013 {
16014 /* Peek at the next token. */
16017 {
16018 /* This is either a parameter-declaration-clause, or a
16019 parenthesized declarator. When we know we are parsing a
16020 named declarator, it must be a parenthesized declarator
16021 if FIRST is true. For instance, `(int)' is a
16022 parameter-declaration-clause, with an omitted
16023 direct-abstract-declarator. But `((*))', is a
16024 parenthesized abstract declarator. Finally, when T is a
16025 template parameter `(T)' is a
16026 parameter-declaration-clause, and not a parenthesized
16027 named declarator.
16029 We first try and parse a parameter-declaration-clause,
16030 and then try a nested declarator (if FIRST is true).
16032 It is not an error for it not to be a
16033 parameter-declaration-clause, even when FIRST is
16034 false. Consider,
16036 int i (int);
16037 int i (3);
16039 The first is the declaration of a function while the
16040 second is the definition of a variable, including its
16041 initializer.
16043 Having seen only the parenthesis, we cannot know which of
16044 these two alternatives should be selected. Even more
16045 complex are examples like:
16047 int i (int (a));
16048 int i (int (3));
16050 The former is a function-declaration; the latter is a
16051 variable initialization.
16053 Thus again, we try a parameter-declaration-clause, and if
16054 that fails, we back out and return. */
16057 {
16058 tree params;
16061 tree t;
16063 /* In a member-declarator, the only valid interpretation
16064 of a parenthesis is the start of a
16065 parameter-declaration-clause. (It is invalid to
16066 initialize a static data member with a parenthesized
16067 initializer; only the "=" form of initialization is
16068 permitted.) */
16072 /* Consume the `('. */
16075 {
16076 /* If this is going to be an abstract declarator, we're
16077 in a declarator and we can't have default args. */
16080 }
16082 /* Inside the function parameter list, surrounding
16083 template-parameter-lists do not apply. */
16084 saved_num_template_parameter_lists
16090 /* Parse the parameter-declaration-clause. */
16093 parser->num_template_parameter_lists
16096 /* Consume the `)'. */
16099 /* If all went well, parse the cv-qualifier-seq and the
16100 exception-specification. */
16102 {
16103 cp_cv_quals cv_quals;
16104 cp_virt_specifiers virt_specifiers;
16105 tree exception_specification;
16106 tree late_return;
16114 /* Parse the cv-qualifier-seq. */
16116 /* And the exception-specification. */
16117 exception_specification
16120 late_return = (cp_parser_late_return_type_opt
16123 /* Parse the virt-specifier-seq. */
16126 /* Create the function-declarator. */
16128 params,
16129 cv_quals,
16130 virt_specifiers,
16131 exception_specification,
16132 late_return);
16133 /* Any subsequent parameter lists are to do with
16134 return type, so are not those of the declared
16135 function. */
16137 }
16139 /* Remove the function parms from scope. */
16145 /* Repeat the main loop. */
16147 }
16149 /* If this is the first, we can try a parenthesized
16150 declarator. */
16152 {
16158 /* Consume the `('. */
16160 /* Parse the nested declarator. */
16163 declarator
16166 member_p);
16169 /* Expect a `)'. */
16176 }
16177 /* Otherwise, we must be done. */
16178 else
16180 }
16183 {
16184 /* Parse an array-declarator. */
16185 tree bounds;
16193 /* Consume the `['. */
16195 /* Peek at the next token. */
16197 /* If the next token is `]', then there is no
16198 constant-expression. */
16200 {
16203 bounds
16213 {
16214 /* Normally, the array bound must be an integral constant
16215 expression. However, as an extension, we allow VLAs
16216 in function scopes as long as they aren't part of a
16217 parameter declaration. */
16221 }
16223 {
16224 /* Remember this wasn't a constant-expression. */
16227 }
16228 }
16229 else
16231 /* Look for the closing `]'. */
16233 {
16236 }
16239 }
16241 {
16242 {
16243 tree qualifying_scope;
16244 tree unqualified_name;
16245 special_function_kind sfk;
16250 /* Parse a declarator-id */
16253 {
16256 /* If we see an ellipsis, we should be looking at a
16257 parameter pack. */
16259 {
16260 /* Consume the `...' */
16264 }
16265 }
16268 unqualified_name
16272 {
16276 {
16277 /* Check whether an error occurred. */
16280 /* We already consumed the ellipsis to mark a
16281 parameter pack, but we have no way to report it,
16282 so abort the tentative parse. We will be exiting
16283 immediately anyway. */
16285 }
16286 else
16292 && (qualifying_scope
16295 {
16298 }
16299 }
16304 {
16309 }
16313 {
16314 /* In the declaration of a member of a template class
16315 outside of the class itself, the SCOPE will sometimes
16316 be a TYPENAME_TYPE. For example, given:
16318 template <typename T>
16319 int S<T>::R::i = 3;
16321 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16322 this context, we must resolve S<T>::R to an ordinary
16323 type, rather than a typename type.
16325 The reason we normally avoid resolving TYPENAME_TYPEs
16326 is that a specialization of `S' might render
16327 `S<T>::R' not a type. However, if `S' is
16328 specialized, then this `i' will not be used, so there
16329 is no harm in resolving the types here. */
16330 tree type;
16332 /* Resolve the TYPENAME_TYPE. */
16335 /* If that failed, the declarator is invalid. */
16337 {
16340 "cannot define member of dependent typedef "
16342 else
16347 }
16349 }
16354 {
16355 tree class_type;
16360 else
16364 {
16367 {
16370 {
16374 "use %<%T::%D%> instead of %<%T::%D%> to "
16376 class_type,
16381 }
16382 else
16384 }
16385 else
16386 {
16387 /* We do not attempt to print the declarator
16388 here because we do not have enough
16389 information about its original syntactic
16390 form. */
16394 }
16395 }
16398 {
16404 for an anonymous type, even if the type
16405 got a name for linkage purposes. */
16408 class_type))
16409 {
16412 }
16420 }
16421 }
16423 unqualified_name,
16424 sfk);
16430 }
16432 handle_declarator:;
16435 /* Any names that appear after the declarator-id for a
16436 member are looked up in the containing scope. */
16441 /* Default args are only allowed on function
16442 declarations. */
16444 else
16448 }
16449 /* We're done. */
16450 else
16452 }
16454 /* For an abstract declarator, we might wind up with nothing at this
16455 point. That's an error; the declarator is not optional. */
16459 /* If we entered a scope, we must exit it now. */
16467 }
16469 /* Parse a ptr-operator.
16471 ptr-operator:
16472 * cv-qualifier-seq [opt]
16473 &
16474 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16476 GNU Extension:
16478 ptr-operator:
16479 & cv-qualifier-seq [opt]
16481 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16482 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16483 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16484 filled in with the TYPE containing the member. *CV_QUALS is
16485 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16486 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16487 Note that the tree codes returned by this function have nothing
16488 to do with the types of trees that will be eventually be created
16489 to represent the pointer or reference type being parsed. They are
16490 just constants with suggestive names. */
16491 static enum tree_code
16495 {
16499 /* Assume that it's not a pointer-to-member. */
16501 /* And that there are no cv-qualifiers. */
16504 /* Peek at the next token. */
16507 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16517 {
16518 /* Consume the `*', `&' or `&&'. */
16521 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16522 `&', if we are allowing GNU extensions. (The only qualifier
16523 that can legally appear after `&' is `restrict', but that is
16524 enforced during semantic analysis. */
16528 }
16529 else
16530 {
16531 /* Try the pointer-to-member case. */
16533 /* Look for the optional `::' operator. */
16536 /* Look for the nested-name specifier. */
16543 /* If we found it, and the next token is a `*', then we are
16544 indeed looking at a pointer-to-member operator. */
16547 {
16548 /* Indicate that the `*' operator was used. */
16556 else
16557 {
16558 /* The type of which the member is a member is given by the
16559 current SCOPE. */
16561 /* The next name will not be qualified. */
16565 /* Look for the optional cv-qualifier-seq. */
16567 }
16568 }
16569 /* If that didn't work we don't have a ptr-operator. */
16572 }
16575 }
16577 /* Parse an (optional) cv-qualifier-seq.
16579 cv-qualifier-seq:
16580 cv-qualifier cv-qualifier-seq [opt]
16582 cv-qualifier:
16583 const
16584 volatile
16586 GNU Extension:
16588 cv-qualifier:
16589 __restrict__
16591 Returns a bitmask representing the cv-qualifiers. */
16593 static cp_cv_quals
16595 {
16599 {
16601 cp_cv_quals cv_qualifier;
16603 /* Peek at the next token. */
16605 /* See if it's a cv-qualifier. */
16607 {
16623 }
16629 {
16632 }
16633 else
16634 {
16637 }
16638 }
16641 }
16643 /* Parse an (optional) virt-specifier-seq.
16645 virt-specifier-seq:
16646 virt-specifier virt-specifier-seq [opt]
16648 virt-specifier:
16649 override
16650 final
16652 Returns a bitmask representing the virt-specifiers. */
16654 static cp_virt_specifiers
16656 {
16660 {
16662 cp_virt_specifiers virt_specifier;
16664 /* Peek at the next token. */
16666 /* See if it's a virt-specifier-qualifier. */
16670 {
16673 }
16675 {
16678 }
16680 {
16682 }
16683 else
16687 {
16690 }
16691 else
16692 {
16695 }
16696 }
16698 }
16700 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16701 is in scope even though it isn't real. */
16703 static void
16705 {
16706 tree this_parm;
16709 {
16710 /* We don't clear this between NSDMIs. Is it already what we want? */
16715 }
16718 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16720 current_class_ref
16723 }
16725 /* Parse a late-specified return type, if any. This is not a separate
16726 non-terminal, but part of a function declarator, which looks like
16728 -> trailing-type-specifier-seq abstract-declarator(opt)
16730 Returns the type indicated by the type-id.
16732 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16733 function. */
16735 static tree
16737 {
16739 tree type;
16741 /* Peek at the next token. */
16743 /* A late-specified return type is indicated by an initial '->'. */
16747 /* Consume the ->. */
16751 {
16752 /* DR 1207: 'this' is in scope in the trailing return type. */
16755 }
16763 }
16765 /* Parse a declarator-id.
16767 declarator-id:
16768 id-expression
16769 :: [opt] nested-name-specifier [opt] type-name
16771 In the `id-expression' case, the value returned is as for
16772 cp_parser_id_expression if the id-expression was an unqualified-id.
16773 If the id-expression was a qualified-id, then a SCOPE_REF is
16774 returned. The first operand is the scope (either a NAMESPACE_DECL
16775 or TREE_TYPE), but the second is still just a representation of an
16776 unqualified-id. */
16778 static tree
16780 {
16781 tree id;
16782 /* The expression must be an id-expression. Assume that qualified
16783 names are the names of types so that:
16785 template <class T>
16786 int S<T>::R::i = 3;
16788 will work; we must treat `S<T>::R' as the name of a type.
16789 Similarly, assume that qualified names are templates, where
16790 required, so that:
16792 template <class T>
16793 int S<T>::R<T>::i = 3;
16795 will work, too. */
16801 optional_p);
16805 }
16807 /* Parse a type-id.
16809 type-id:
16810 type-specifier-seq abstract-declarator [opt]
16812 Returns the TYPE specified. */
16814 static tree
16817 {
16818 cp_decl_specifier_seq type_specifier_seq;
16821 /* Parse the type-specifier-seq. */
16823 is_trailing_return,
16828 /* There might or might not be an abstract declarator. */
16830 /* Look for the declarator. */
16831 abstract_declarator
16835 /* Check to see if there really was a declarator. */
16841 {
16842 /* A type-id with type 'auto' is only ok if the abstract declarator
16843 is a function declarator with a late-specified return type. */
16848 else
16849 {
16852 }
16853 }
16856 is_template_arg);
16857 }
16860 {
16862 }
16865 {
16866 tree r;
16868 parser->type_definition_forbidden_message
16873 }
16876 {
16878 }
16880 /* Parse a type-specifier-seq.
16882 type-specifier-seq:
16883 type-specifier type-specifier-seq [opt]
16885 GNU extension:
16887 type-specifier-seq:
16888 attributes type-specifier-seq [opt]
16890 If IS_DECLARATION is true, we are at the start of a "condition" or
16891 exception-declaration, so we might be followed by a declarator-id.
16893 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
16894 i.e. we've just seen "->".
16896 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
16898 static void
16903 {
16908 /* Clear the TYPE_SPECIFIER_SEQ. */
16911 /* In the context of a trailing return type, enum E { } is an
16912 elaborated-type-specifier followed by a function-body, not an
16913 enum-specifier. */
16917 /* Parse the type-specifiers and attributes. */
16919 {
16920 tree type_specifier;
16923 /* Check for attributes first. */
16925 {
16930 }
16932 /* record the token of the beginning of the type specifier seq,
16933 for error reporting purposes*/
16937 /* Look for the type-specifier. */
16939 flags,
16940 type_specifier_seq,
16942 NULL,
16945 {
16946 /* If the first type-specifier could not be found, this is not a
16947 type-specifier-seq at all. */
16949 {
16953 }
16954 /* If subsequent type-specifiers could not be found, the
16955 type-specifier-seq is complete. */
16957 }
16960 /* The standard says that a condition can be:
16962 type-specifier-seq declarator = assignment-expression
16964 However, given:
16966 struct S {};
16967 if (int S = ...)
16969 we should treat the "S" as a declarator, not as a
16970 type-specifier. The standard doesn't say that explicitly for
16971 type-specifier-seq, but it does say that for
16972 decl-specifier-seq in an ordinary declaration. Perhaps it
16973 would be clearer just to allow a decl-specifier-seq here, and
16974 then add a semantic restriction that if any decl-specifiers
16975 that are not type-specifiers appear, the program is invalid. */
16978 }
16979 }
16981 /* Parse a parameter-declaration-clause.
16983 parameter-declaration-clause:
16984 parameter-declaration-list [opt] ... [opt]
16985 parameter-declaration-list , ...
16987 Returns a representation for the parameter declarations. A return
16988 value of NULL indicates a parameter-declaration-clause consisting
16989 only of an ellipsis. */
16991 static tree
16993 {
16994 tree parameters;
16999 /* Peek at the next token. */
17001 /* Check for trivial parameter-declaration-clauses. */
17003 {
17004 /* Consume the `...' token. */
17007 }
17009 /* There are no parameters. */
17010 {
17011 #ifndef NO_IMPLICIT_EXTERN_C
17015 else
17016 #endif
17018 }
17019 /* Check for `(void)', too, which is a special case. */
17023 {
17024 /* Consume the `void' token. */
17026 /* There are no parameters. */
17028 }
17030 /* Parse the parameter-declaration-list. */
17032 /* If a parse error occurred while parsing the
17033 parameter-declaration-list, then the entire
17034 parameter-declaration-clause is erroneous. */
17038 /* Peek at the next token. */
17040 /* If it's a `,', the clause should terminate with an ellipsis. */
17042 {
17043 /* Consume the `,'. */
17045 /* Expect an ellipsis. */
17046 ellipsis_p
17048 }
17049 /* It might also be `...' if the optional trailing `,' was
17050 omitted. */
17052 {
17053 /* Consume the `...' token. */
17055 /* And remember that we saw it. */
17057 }
17058 else
17061 /* Finish the parameter list. */
17066 }
17068 /* Parse a parameter-declaration-list.
17070 parameter-declaration-list:
17071 parameter-declaration
17072 parameter-declaration-list , parameter-declaration
17074 Returns a representation of the parameter-declaration-list, as for
17075 cp_parser_parameter_declaration_clause. However, the
17076 `void_list_node' is never appended to the list. Upon return,
17077 *IS_ERROR will be true iff an error occurred. */
17079 static tree
17081 {
17087 /* Assume all will go well. */
17089 /* The special considerations that apply to a function within an
17090 unbraced linkage specifications do not apply to the parameters
17091 to the function. */
17092 saved_in_unbraced_linkage_specification_p
17096 /* Look for more parameters. */
17098 {
17102 /* Parse the parameter. */
17103 parameter
17108 /* We don't know yet if the enclosing context is deprecated, so wait
17109 and warn in grokparms if appropriate. */
17115 PARM,
17121 /* If a parse error occurred parsing the parameter declaration,
17122 then the entire parameter-declaration-list is erroneous. */
17124 {
17128 }
17138 {
17142 }
17144 /* Add the new parameter to the list. */
17148 /* Peek at the next token. */
17151 /* These are for Objective-C++ */
17154 /* The parameter-declaration-list is complete. */
17157 {
17160 /* Peek at the next token. */
17162 /* If it's an ellipsis, then the list is complete. */
17165 /* Otherwise, there must be more parameters. Consume the
17166 `,'. */
17168 /* When parsing something like:
17170 int i(float f, double d)
17172 we can tell after seeing the declaration for "f" that we
17173 are not looking at an initialization of a variable "i",
17174 but rather at the declaration of a function "i".
17176 Due to the fact that the parsing of template arguments
17177 (as specified to a template-id) requires backtracking we
17178 cannot use this technique when inside a template argument
17179 list. */
17183 /* However, a parameter-declaration of the form
17184 "foat(f)" (which is a valid declaration of a
17185 parameter "f") can also be interpreted as an
17186 expression (the conversion of "f" to "float"). */
17189 }
17190 else
17191 {
17199 }
17200 }
17202 parser->in_unbraced_linkage_specification_p
17206 }
17208 /* Parse a parameter declaration.
17210 parameter-declaration:
17211 decl-specifier-seq ... [opt] declarator
17212 decl-specifier-seq declarator = assignment-expression
17213 decl-specifier-seq ... [opt] abstract-declarator [opt]
17214 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17216 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17217 declares a template parameter. (In that case, a non-nested `>'
17218 token encountered during the parsing of the assignment-expression
17219 is not interpreted as a greater-than operator.)
17221 Returns a representation of the parameter, or NULL if an error
17222 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17223 true iff the declarator is of the form "(p)". */
17229 {
17231 cp_decl_specifier_seq decl_specifiers;
17233 tree default_argument;
17237 /* In a template parameter, `>' is not an operator.
17239 [temp.param]
17241 When parsing a default template-argument for a non-type
17242 template-parameter, the first non-nested `>' is taken as the end
17243 of the template parameter-list rather than a greater-than
17244 operator. */
17246 /* Type definitions may not appear in parameter types. */
17248 parser->type_definition_forbidden_message
17251 /* Parse the declaration-specifiers. */
17253 CP_PARSER_FLAGS_NONE,
17257 /* Complain about missing 'typename' or other invalid type names. */
17261 /* If an error occurred, there's no reason to attempt to parse the
17262 rest of the declaration. */
17264 {
17267 }
17269 /* Peek at the next token. */
17272 /* If the next token is a `)', `,', `=', `>', or `...', then there
17273 is no declarator. However, when variadic templates are enabled,
17274 there may be a declarator following `...'. */
17279 {
17283 }
17284 /* Otherwise, there should be a declarator. */
17285 else
17286 {
17290 /* After seeing a decl-specifier-seq, if the next token is not a
17291 "(", there is no possibility that the code is a valid
17292 expression. Therefore, if parsing tentatively, we commit at
17293 this point. */
17295 /* In an expression context, having seen:
17297 (int((char ...
17299 we cannot be sure whether we are looking at a
17300 function-type (taking a "char" as a parameter) or a cast
17301 of some object of type "char" to "int". */
17307 /* Parse the declarator. */
17310 CP_PARSER_DECLARATOR_EITHER,
17312 parenthesized_p,
17315 /* After the declarator, allow more attributes. */
17316 decl_specifiers.attributes
17319 }
17321 /* If the next token is an ellipsis, and we have not seen a
17322 declarator name, and the type of the declarator contains parameter
17323 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17324 a parameter pack expansion expression. Otherwise, leave the
17325 ellipsis for a C-style variadic function. */
17328 {
17339 {
17340 /* Consume the `...'. */
17344 /* Build a pack expansion type */
17347 else
17349 }
17350 }
17352 /* The restriction on defining new types applies only to the type
17353 of the parameter, not to the default argument. */
17356 /* If the next token is `=', then process a default argument. */
17358 {
17360 /* If we are defining a class, then the tokens that make up the
17361 default argument must be saved and processed later. */
17366 /* Outside of a class definition, we can just parse the
17367 assignment-expression. */
17368 else
17369 default_argument
17373 {
17376 else
17377 {
17379 "default arguments are only "
17382 }
17383 }
17387 {
17388 /* Find the name of the parameter pack. */
17395 template_parm_p
17401 else
17403 template_parm_p
17410 }
17411 }
17412 else
17416 declarator,
17417 default_argument);
17418 }
17420 /* Parse a default argument and return it.
17422 TEMPLATE_PARM_P is true if this is a default argument for a
17423 non-type template parameter. */
17424 static tree
17426 {
17432 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17433 set correctly. */
17436 /* Local variable names (and the `this' keyword) may not
17437 appear in a default argument. */
17440 /* Parse the assignment-expression. */
17443 default_argument
17453 }
17455 /* Parse a function-body.
17457 function-body:
17458 compound_statement */
17460 static void
17462 {
17464 }
17466 /* Parse a ctor-initializer-opt followed by a function-body. Return
17467 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17468 is true we are parsing a function-try-block. */
17470 static bool
17473 {
17481 /* Begin the function body. */
17483 /* Parse the optional ctor-initializer. */
17486 /* If we're parsing a constexpr constructor definition, we need
17487 to check that the constructor body is indeed empty. However,
17488 before we get to cp_parser_function_body lot of junk has been
17489 generated, so we can't just check that we have an empty block.
17490 Rather we take a snapshot of the outermost block, and check whether
17491 cp_parser_function_body changed its state. */
17493 {
17497 }
17498 /* Parse the function-body. */
17502 /* Finish the function body. */
17506 }
17508 /* Parse an initializer.
17510 initializer:
17511 = initializer-clause
17512 ( expression-list )
17514 Returns an expression representing the initializer. If no
17515 initializer is present, NULL_TREE is returned.
17517 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17518 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17519 set to TRUE if there is no initializer present. If there is an
17520 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17521 is set to true; otherwise it is set to false. */
17523 static tree
17526 {
17528 tree init;
17530 /* Peek at the next token. */
17533 /* Let our caller know whether or not this initializer was
17534 parenthesized. */
17536 /* Assume that the initializer is constant. */
17540 {
17541 /* Consume the `='. */
17543 /* Parse the initializer-clause. */
17545 }
17547 {
17552 non_constant_p);
17557 }
17559 {
17563 }
17564 else
17565 {
17566 /* Anything else is an error. */
17569 }
17572 }
17574 /* Parse an initializer-clause.
17576 initializer-clause:
17577 assignment-expression
17578 braced-init-list
17580 Returns an expression representing the initializer.
17582 If the `assignment-expression' production is used the value
17583 returned is simply a representation for the expression.
17585 Otherwise, calls cp_parser_braced_list. */
17587 static tree
17589 {
17590 tree initializer;
17592 /* Assume the expression is constant. */
17595 /* If it is not a `{', then we are looking at an
17596 assignment-expression. */
17598 {
17599 initializer
17602 non_constant_p);
17603 }
17604 else
17608 }
17610 /* Parse a brace-enclosed initializer list.
17612 braced-init-list:
17613 { initializer-list , [opt] }
17614 { }
17616 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17617 the elements of the initializer-list (or NULL, if the last
17618 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17619 NULL_TREE. There is no way to detect whether or not the optional
17620 trailing `,' was provided. NON_CONSTANT_P is as for
17621 cp_parser_initializer. */
17623 static tree
17625 {
17626 tree initializer;
17628 /* Consume the `{' token. */
17630 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17632 /* If it's not a `}', then there is a non-trivial initializer. */
17634 {
17635 /* Parse the initializer list. */
17638 /* A trailing `,' token is allowed. */
17641 }
17642 /* Now, there should be a trailing `}'. */
17646 }
17648 /* Parse an initializer-list.
17650 initializer-list:
17651 initializer-clause ... [opt]
17652 initializer-list , initializer-clause ... [opt]
17654 GNU Extension:
17656 initializer-list:
17657 designation initializer-clause ...[opt]
17658 initializer-list , designation initializer-clause ...[opt]
17660 designation:
17661 . identifier =
17662 identifier :
17663 [ constant-expression ] =
17665 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17666 for the initializer. If the INDEX of the elt is non-NULL, it is the
17667 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17668 as for cp_parser_initializer. */
17672 {
17675 /* Assume all of the expressions are constant. */
17678 /* Parse the rest of the list. */
17680 {
17682 tree designator;
17683 tree initializer;
17686 /* If the next token is an identifier and the following one is a
17687 colon, we are looking at the GNU designated-initializer
17688 syntax. */
17692 {
17693 /* Warn the user that they are using an extension. */
17696 /* Consume the identifier. */
17698 /* Consume the `:'. */
17700 }
17701 /* Also handle the C99 syntax, '. id ='. */
17706 {
17707 /* Warn the user that they are using an extension. */
17710 /* Consume the `.'. */
17712 /* Consume the identifier. */
17714 /* Consume the `='. */
17716 }
17717 /* Also handle C99 array designators, '[ const ] ='. */
17721 {
17722 /* In C++11, [ could start a lambda-introducer. */
17730 }
17731 else
17734 /* Parse the initializer. */
17737 /* If any clause is non-constant, so is the entire initializer. */
17741 /* If we have an ellipsis, this is an initializer pack
17742 expansion. */
17744 {
17745 /* Consume the `...'. */
17748 /* Turn the initializer into an initializer expansion. */
17750 }
17752 /* Add it to the vector. */
17755 /* If the next token is not a comma, we have reached the end of
17756 the list. */
17760 /* Peek at the next token. */
17762 /* If the next token is a `}', then we're still done. An
17763 initializer-clause can have a trailing `,' after the
17764 initializer-list and before the closing `}'. */
17768 /* Consume the `,' token. */
17770 }
17773 }
17775 /* Classes [gram.class] */
17777 /* Parse a class-name.
17779 class-name:
17780 identifier
17781 template-id
17783 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17784 to indicate that names looked up in dependent types should be
17785 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17786 keyword has been used to indicate that the name that appears next
17787 is a template. TAG_TYPE indicates the explicit tag given before
17788 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17789 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17790 is the class being defined in a class-head.
17792 Returns the TYPE_DECL representing the class. */
17794 static tree
17802 {
17803 tree decl;
17804 tree scope;
17809 /* All class-names start with an identifier. */
17812 {
17815 }
17817 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17818 to a template-id, so we save it here. */
17823 /* Any name names a type if we're following the `typename' keyword
17824 in a qualified name where the enclosing scope is type-dependent. */
17827 /* Handle the common case (an identifier, but not a template-id)
17828 efficiently. */
17831 {
17835 /* Look for the identifier. */
17839 /* If the next token isn't an identifier, we are certainly not
17840 looking at a class-name. */
17843 /* If we know this is a type-name, there's no need to look it
17844 up. */
17847 else
17848 {
17849 tree ambiguous_decls;
17850 /* If we already know that this lookup is ambiguous, then
17851 we've already issued an error message; there's no reason
17852 to check again. */
17854 {
17857 }
17858 /* If the next token is a `::', then the name must be a type
17859 name.
17861 [basic.lookup.qual]
17863 During the lookup for a name preceding the :: scope
17864 resolution operator, object, function, and enumerator
17865 names are ignored. */
17868 /* Look up the name. */
17870 tag_type,
17873 check_dependency_p,
17877 {
17881 }
17882 }
17883 }
17884 else
17885 {
17886 /* Try a template-id. */
17888 check_dependency_p,
17889 tag_type,
17890 is_declaration);
17893 }
17897 /* If this is a typename, create a TYPENAME_TYPE. */
17899 {
17904 }
17908 /* Check to see that it is really the name of a class. */
17912 /* Situations like this:
17914 template <typename T> struct A {
17915 typename T::template X<int>::I i;
17916 };
17918 are problematic. Is `T::template X<int>' a class-name? The
17919 standard does not seem to be definitive, but there is no other
17920 valid interpretation of the following `::'. Therefore, those
17921 names are considered class-names. */
17922 {
17926 }
17930 /* In Objective-C 2.0, a classname followed by '.' starts a
17931 dot-syntax expression, and it's not a type-name. */
17943 }
17945 /* Parse a class-specifier.
17947 class-specifier:
17948 class-head { member-specification [opt] }
17950 Returns the TREE_TYPE representing the class. */
17952 static tree
17954 {
17955 tree type;
17969 /* Parse the class-head. */
17972 /* If the class-head was a semantic disaster, skip the entire body
17973 of the class. */
17975 {
17979 }
17981 /* Look for the `{'. */
17983 {
17986 }
17988 /* Issue an error message if type-definitions are forbidden here. */
17990 /* Remember that we are defining one more class. */
17992 /* Inside the class, surrounding template-parameter-lists do not
17993 apply. */
17994 saved_num_template_parameter_lists
17997 /* We are not in a function body. */
18000 /* Or in a loop. */
18003 /* Or in a switch. */
18006 /* We are not immediately inside an extern "lang" block. */
18007 saved_in_unbraced_linkage_specification_p
18011 /* Start the class. */
18013 {
18016 }
18020 /* If the type is erroneous, skip the entire body of the class. */
18022 else
18023 /* Parse the member-specification. */
18026 /* Look for the trailing `}'. */
18028 /* Look for trailing attributes to apply to this class. */
18036 /* We've finished a type definition. Check for the common syntax
18037 error of forgetting a semicolon after the definition. We need to
18038 be careful, as we can't just check for not-a-semicolon and be done
18039 with it; the user might have typed:
18041 class X { } c = ...;
18042 class X { } *p = ...;
18044 and so forth. Instead, enumerate all the possible tokens that
18045 might follow this production; if we don't see one of them, then
18046 complain and silently insert the semicolon. */
18047 {
18052 {
18063 /* While it's legal for type qualifiers and storage class
18064 specifiers to follow type definitions in the grammar, only
18065 compiler testsuites contain code like that. Assume that if
18066 we see such code, then what we're really seeing is a case
18067 like:
18069 class X { }
18070 const <type> var = ...;
18072 or
18074 class Y { }
18075 static <type> func (...) ...
18077 i.e. the qualifier or specifier applies to the next
18078 declaration. To do so, however, we need to look ahead one
18079 more token to see if *that* token is a type specifier.
18081 This code could be improved to handle:
18083 class Z { }
18084 static const <type> var = ...; */
18087 {
18090 /* Handling user-defined types here would be nice, but very
18091 tricky. */
18092 want_semicolon
18095 }
18099 }
18101 /* If we don't have a type, then something is very wrong and we
18102 shouldn't try to do anything clever. Likewise for not seeing the
18103 closing brace. */
18105 {
18106 cp_token_position prev
18117 else
18120 /* Unget one token and smash it to look as though we encountered
18121 a semicolon in the input stream. */
18126 }
18127 }
18129 /* If this class is not itself within the scope of another class,
18130 then we need to parse the bodies of all of the queued function
18131 definitions. Note that the queued functions defined in a class
18132 are not always processed immediately following the
18133 class-specifier for that class. Consider:
18135 struct A {
18136 struct B { void f() { sizeof (A); } };
18137 };
18139 If `f' were processed before the processing of `A' were
18140 completed, there would be no way to compute the size of `A'.
18141 Note that the nesting we are interested in here is lexical --
18142 not the semantic nesting given by TYPE_CONTEXT. In particular,
18143 for:
18145 struct A { struct B; };
18146 struct A::B { void f() { } };
18148 there is no need to delay the parsing of `A::B::f'. */
18150 {
18151 tree decl;
18158 /* In a first pass, parse default arguments to the functions.
18159 Then, in a second pass, parse the bodies of the functions.
18160 This two-phased approach handles cases like:
18162 struct S {
18163 void f() { g(); }
18164 void g(int i = 3);
18165 };
18167 */
18170 {
18172 /* If there are default arguments that have not yet been processed,
18173 take care of them now. */
18175 {
18180 }
18181 /* Make sure that any template parameters are in scope. */
18183 /* Parse the default argument expressions. */
18185 /* Remove any template parameters from the symbol table. */
18187 }
18189 /* Now parse any NSDMIs. */
18193 {
18195 {
18200 }
18203 }
18209 /* Now parse the body of the functions. */
18213 }
18215 /* Put back any saved access checks. */
18218 /* Restore saved state. */
18222 parser->num_template_parameter_lists
18224 parser->in_unbraced_linkage_specification_p
18228 }
18230 static tree
18232 {
18233 tree ret;
18238 }
18240 /* Parse a class-head.
18242 class-head:
18243 class-key identifier [opt] base-clause [opt]
18244 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18245 class-key nested-name-specifier [opt] template-id
18246 base-clause [opt]
18248 class-virt-specifier:
18249 final
18251 GNU Extensions:
18252 class-key attributes identifier [opt] base-clause [opt]
18253 class-key attributes nested-name-specifier identifier base-clause [opt]
18254 class-key attributes nested-name-specifier [opt] template-id
18255 base-clause [opt]
18257 Upon return BASES is initialized to the list of base classes (or
18258 NULL, if there are none) in the same form returned by
18259 cp_parser_base_clause.
18261 Returns the TYPE of the indicated class. Sets
18262 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18263 involving a nested-name-specifier was used, and FALSE otherwise.
18265 Returns error_mark_node if this is not a class-head.
18267 Returns NULL_TREE if the class-head is syntactically valid, but
18268 semantically invalid in a way that means we should skip the entire
18269 body of the class. */
18271 static tree
18274 {
18275 tree nested_name_specifier;
18279 tree attributes;
18280 tree bases;
18290 /* Assume no nested-name-specifier will be present. */
18292 /* Assume no template parameter lists will be used in defining the
18293 type. */
18297 /* Look for the class-key. */
18302 /* Parse the attributes. */
18305 /* If the next token is `::', that is invalid -- but sometimes
18306 people do try to write:
18308 struct ::S {};
18310 Handle this gracefully by accepting the extra qualifier, and then
18311 issuing an error about it later if this really is a
18312 class-head. If it turns out just to be an elaborated type
18313 specifier, remain silent. */
18319 /* Determine the name of the class. Begin by looking for an
18320 optional nested-name-specifier. */
18322 nested_name_specifier
18328 /* If there was a nested-name-specifier, then there *must* be an
18329 identifier. */
18331 {
18333 /* Although the grammar says `identifier', it really means
18334 `class-name' or `template-name'. You are only allowed to
18335 define a class that has already been declared with this
18336 syntax.
18338 The proposed resolution for Core Issue 180 says that wherever
18339 you see `class T::X' you should treat `X' as a type-name.
18341 It is OK to define an inaccessible class; for example:
18343 class A { class B; };
18344 class A::B {};
18346 We do not know if we will see a class-name, or a
18347 template-name. We look for a class-name first, in case the
18348 class-name is a template-id; if we looked for the
18349 template-name first we would stop after the template-name. */
18354 class_type,
18358 /* If that didn't work, ignore the nested-name-specifier. */
18360 {
18366 }
18367 /* If we could not find a corresponding TYPE, treat this
18368 declaration like an unqualified declaration. */
18371 /* Otherwise, count the number of templates used in TYPE and its
18372 containing scopes. */
18373 else
18374 {
18375 tree scope;
18388 }
18389 }
18390 /* Otherwise, the identifier is optional. */
18391 else
18392 {
18393 /* We don't know whether what comes next is a template-id,
18394 an identifier, or nothing at all. */
18396 /* Check for a template-id. */
18401 class_key,
18403 /* If that didn't work, it could still be an identifier. */
18405 {
18407 {
18410 }
18411 else
18413 }
18414 else
18415 {
18418 }
18419 }
18424 {
18426 class_key,
18428 }
18431 /* If it's not a `:' or a `{' then we can't really be looking at a
18432 class-head, since a class-head only appears as part of a
18433 class-specifier. We have to detect this situation before calling
18434 xref_tag, since that has irreversible side-effects. */
18436 {
18440 }
18442 /* At this point, we're going ahead with the class-specifier, even
18443 if some other problem occurs. */
18446 {
18451 }
18452 /* Issue the error about the overly-qualified name now. */
18454 {
18459 }
18461 {
18466 }
18468 {
18469 tree scope;
18471 /* Reject typedef-names in class heads. */
18473 {
18476 type);
18479 }
18481 /* Figure out in what scope the declaration is being placed. */
18483 /* If that scope does not contain the scope in which the
18484 class was originally declared, the program is invalid. */
18486 {
18489 "declaration of %qD in namespace %qD which does not "
18492 else
18498 }
18499 /* [dcl.meaning]
18501 A declarator-id shall not be qualified except for the
18502 definition of a ... nested class outside of its class
18503 ... [or] the definition or explicit instantiation of a
18504 class member of a namespace outside of its namespace. */
18506 {
18511 }
18512 }
18513 /* An explicit-specialization must be preceded by "template <>". If
18514 it is not, try to recover gracefully. */
18518 {
18522 /* Take the same action that would have been taken by
18523 cp_parser_explicit_specialization. */
18526 }
18527 /* There must be no "return" statements between this point and the
18528 end of this function; set "type "to the correct return value and
18529 use "goto done;" to return. */
18530 /* Make sure that the right number of template parameters were
18531 present. */
18535 {
18536 /* If something went wrong, there is no point in even trying to
18537 process the class-definition. */
18540 }
18542 /* Look up the type. */
18544 {
18548 {
18552 }
18553 else
18554 {
18557 }
18560 }
18562 {
18563 tree class_type;
18565 /* Given:
18567 template <typename T> struct S { struct T };
18568 template <typename T> struct S<T>::T { };
18570 we will get a TYPENAME_TYPE when processing the definition of
18571 `S::T'. We need to resolve it to the actual type before we
18572 try to define it. */
18574 {
18579 else
18580 {
18583 }
18584 }
18588 {
18591 }
18594 /* Enter the scope indicated by the nested-name-specifier. */
18596 /* Get the canonical version of this type. */
18600 {
18603 {
18606 }
18607 }
18611 }
18613 {
18614 /* If the class was unnamed, create a dummy name. */
18619 }
18621 /* Indicate whether this class was declared as a `class' or as a
18622 `struct'. */
18627 /* If this type was already complete, and we see another definition,
18628 that's an error. */
18630 {
18632 type);
18634 type);
18637 }
18642 {
18643 /* Apply attributes now, before any use of the class as a template
18644 argument in its base list. */
18647 }
18649 /* We will have entered the scope containing the class; the names of
18650 base classes should be looked up in that context. For example:
18652 struct A { struct B {}; struct C; };
18653 struct A::C : B {};
18655 is valid. */
18657 /* Get the list of base-classes, if there is one. */
18660 else
18663 /* If we're really defining a class, process the base classes.
18664 If they're invalid, fail. */
18669 done:
18670 /* Leave the scope given by the nested-name-specifier. We will
18671 enter the class scope itself while processing the members. */
18676 {
18679 }
18685 out:
18688 }
18690 /* Parse a class-key.
18692 class-key:
18693 class
18694 struct
18695 union
18697 Returns the kind of class-key specified, or none_type to indicate
18698 error. */
18700 static enum tag_types
18702 {
18706 /* Look for the class-key. */
18711 /* Check to see if the TOKEN is a class-key. */
18716 }
18718 /* Parse an (optional) member-specification.
18720 member-specification:
18721 member-declaration member-specification [opt]
18722 access-specifier : member-specification [opt] */
18724 static void
18726 {
18728 {
18732 /* Peek at the next token. */
18734 /* If it's a `}', or EOF then we've seen all the members. */
18740 /* See if this token is a keyword. */
18743 {
18747 /* Consume the access-specifier. */
18749 /* Remember which access-specifier is active. */
18751 /* Look for the `:'. */
18756 /* Accept #pragmas at class scope. */
18758 {
18761 }
18763 /* Otherwise, the next construction must be a
18764 member-declaration. */
18766 }
18767 }
18768 }
18770 /* Parse a member-declaration.
18772 member-declaration:
18773 decl-specifier-seq [opt] member-declarator-list [opt] ;
18774 function-definition ; [opt]
18775 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18776 using-declaration
18777 template-declaration
18778 alias-declaration
18780 member-declarator-list:
18781 member-declarator
18782 member-declarator-list , member-declarator
18784 member-declarator:
18785 declarator pure-specifier [opt]
18786 declarator constant-initializer [opt]
18787 identifier [opt] : constant-expression
18789 GNU Extensions:
18791 member-declaration:
18792 __extension__ member-declaration
18794 member-declarator:
18795 declarator attributes [opt] pure-specifier [opt]
18796 declarator attributes [opt] constant-initializer [opt]
18797 identifier [opt] attributes [opt] : constant-expression
18799 C++0x Extensions:
18801 member-declaration:
18802 static_assert-declaration */
18804 static void
18806 {
18807 cp_decl_specifier_seq decl_specifiers;
18808 tree prefix_attributes;
18809 tree decl;
18818 /* Check for the `__extension__' keyword. */
18820 {
18821 /* Recurse. */
18823 /* Restore the old value of the PEDANTIC flag. */
18827 }
18829 /* Check for a template-declaration. */
18831 {
18832 /* An explicit specialization here is an error condition, and we
18833 expect the specialization handler to detect and report this. */
18837 else
18841 }
18843 /* Check for a using-declaration. */
18845 {
18847 {
18848 /* Parse the using-declaration. */
18852 }
18853 else
18854 {
18855 tree decl;
18860 else
18864 }
18865 }
18867 /* Check for @defs. */
18869 {
18874 {
18879 }
18881 }
18883 /* If the next token is `static_assert' we have a static assertion. */
18885 {
18888 }
18895 /* Parse the decl-specifier-seq. */
18898 CP_PARSER_FLAGS_OPTIONAL,
18903 /* Check for an invalid type-name. */
18907 /* If there is no declarator, then the decl-specifier-seq should
18908 specify a type. */
18910 {
18911 /* If there was no decl-specifier-seq, and the next token is a
18912 `;', then we have something like:
18914 struct S { ; };
18916 [class.mem]
18918 Each member-declaration shall declare at least one member
18919 name of the class. */
18921 {
18925 }
18926 else
18927 {
18928 tree type;
18930 /* See if this declaration is a friend. */
18932 /* If there were decl-specifiers, check to see if there was
18933 a class-declaration. */
18935 /* Nested classes have already been added to the class, but
18936 a `friend' needs to be explicitly registered. */
18938 {
18939 /* If the `friend' keyword was present, the friend must
18940 be introduced with a class-key. */
18943 "in C++03 a class-key must be used "
18945 /* In this case:
18947 template <typename T> struct A {
18948 friend struct A<T>::B;
18949 };
18951 A<T>::B will be represented by a TYPENAME_TYPE, and
18952 therefore not recognized by check_tag_decl. */
18954 {
18958 }
18961 "friend declaration does not name a class or "
18963 else
18966 }
18967 /* If there is no TYPE, an error message will already have
18968 been issued. */
18970 ;
18971 /* An anonymous aggregate has to be handled specially; such
18972 a declaration really declares a data member (with a
18973 particular type), as opposed to a nested class. */
18975 {
18976 /* C++11 9.5/6. */
18979 "a storage class on an anonymous aggregate "
18982 /* Remove constructors and such from TYPE, now that we
18983 know it is an anonymous aggregate. */
18985 /* And make the corresponding data member. */
18988 /* Add it to the class. */
18990 }
18991 else
18992 cp_parser_check_access_in_redeclaration
18995 }
18996 }
18997 else
18998 {
19001 /* See if these declarations will be friends. */
19004 /* Keep going until we hit the `;' at the end of the
19005 declaration. */
19007 {
19009 tree first_attribute;
19011 /* Peek at the next token. */
19014 /* Check for a bitfield declaration. */
19019 {
19020 tree identifier;
19021 tree width;
19023 /* Get the name of the bitfield. Note that we cannot just
19024 check TOKEN here because it may have been invalidated by
19025 the call to cp_lexer_peek_nth_token above. */
19028 else
19031 /* Consume the `:' token. */
19033 /* Get the width of the bitfield. */
19034 width
19037 NULL);
19039 /* Look for attributes that apply to the bitfield. */
19041 /* Remember which attributes are prefix attributes and
19042 which are not. */
19044 /* Combine the attributes. */
19047 /* Create the bitfield declaration. */
19050 identifier,
19051 sfk_none)
19054 width,
19055 attributes);
19056 }
19057 else
19058 {
19060 tree initializer;
19061 tree asm_specification;
19064 /* Parse the declarator. */
19065 declarator
19071 /* If something went wrong parsing the declarator, make sure
19072 that we at least consume some tokens. */
19074 {
19075 /* Skip to the end of the statement. */
19077 /* If the next token is not a semicolon, that is
19078 probably because we just skipped over the body of
19079 a function. So, we consume a semicolon if
19080 present, but do not issue an error message if it
19081 is not present. */
19083 CPP_SEMICOLON))
19086 }
19089 cp_parser_check_for_definition_in_return_type
19093 /* Look for an asm-specification. */
19095 /* Look for attributes that apply to the declaration. */
19097 /* Remember which attributes are prefix attributes and
19098 which are not. */
19100 /* Combine the attributes. */
19103 /* If it's an `=', then we have a constant-initializer or a
19104 pure-specifier. It is not correct to parse the
19105 initializer before registering the member declaration
19106 since the member declaration should be in scope while
19107 its initializer is processed. However, the rest of the
19108 front end does not yet provide an interface that allows
19109 us to handle this correctly. */
19111 {
19112 /* In [class.mem]:
19114 A pure-specifier shall be used only in the declaration of
19115 a virtual function.
19117 A member-declarator can contain a constant-initializer
19118 only if it declares a static member of integral or
19119 enumeration type.
19121 Therefore, if the DECLARATOR is for a function, we look
19122 for a pure-specifier; otherwise, we look for a
19123 constant-initializer. When we call `grokfield', it will
19124 perform more stringent semantics checks. */
19135 {
19137 /* Don't require a constant rvalue in C++11, since we
19138 might want a reference constant. We'll enforce
19139 constancy later. */
19141 /* Parse the initializer. */
19144 }
19145 else
19146 /* Parse the initializer. */
19148 }
19151 {
19155 else
19157 }
19158 /* Otherwise, there is no initializer. */
19159 else
19162 /* See if we are probably looking at a function
19163 definition. We are certainly not looking at a
19164 member-declarator. Calling `grokfield' has
19165 side-effects, so we must not do it unless we are sure
19166 that we are looking at a member-declarator. */
19169 {
19170 /* The grammar does not allow a pure-specifier to be
19171 used when a member function is defined. (It is
19172 possible that this fact is an oversight in the
19173 standard, since a pure function may be defined
19174 outside of the class-specifier. */
19180 declarator,
19181 attributes);
19182 /* If the member was not a friend, declare it here. */
19185 /* Peek at the next token. */
19187 /* If the next token is a semicolon, consume it. */
19191 }
19192 else
19195 /* Create the declaration. */
19198 asm_specification,
19199 attributes);
19200 }
19202 /* Reset PREFIX_ATTRIBUTES. */
19208 /* If there is any qualification still in effect, clear it
19209 now; we will be starting fresh with the next declarator. */
19213 /* If it's a `,', then there are more declarators. */
19216 /* If the next token isn't a `;', then we have a parse error. */
19218 CPP_SEMICOLON))
19219 {
19220 /* The next token might be a ways away from where the
19221 actual semicolon is missing. Find the previous token
19222 and use that for our error position. */
19227 /* Assume that the user meant to provide a semicolon. If
19228 we were to cp_parser_skip_to_end_of_statement, we might
19229 skip to a semicolon inside a member function definition
19230 and issue nonsensical error messages. */
19232 }
19235 {
19236 /* Add DECL to the list of members. */
19245 /* Add DECL to the queue of NSDMI to be parsed later. */
19247 }
19251 }
19252 }
19255 out:
19257 }
19259 /* Parse a pure-specifier.
19261 pure-specifier:
19262 = 0
19264 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19265 Otherwise, ERROR_MARK_NODE is returned. */
19267 static tree
19269 {
19272 /* Look for the `=' token. */
19275 /* Look for the `0' token. */
19284 /* Accept = default or = delete in c++0x mode. */
19287 {
19290 }
19292 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19294 {
19299 }
19301 {
19304 }
19307 }
19309 /* Parse a constant-initializer.
19311 constant-initializer:
19312 = constant-expression
19314 Returns a representation of the constant-expression. */
19316 static tree
19318 {
19319 /* Look for the `=' token. */
19323 /* It is invalid to write:
19325 struct S { static const int i = { 7 }; };
19327 */
19329 {
19332 /* Consume the opening brace. */
19334 /* Skip the initializer. */
19336 /* Look for the trailing `}'. */
19340 }
19344 NULL);
19345 }
19347 /* Derived classes [gram.class.derived] */
19349 /* Parse a base-clause.
19351 base-clause:
19352 : base-specifier-list
19354 base-specifier-list:
19355 base-specifier ... [opt]
19356 base-specifier-list , base-specifier ... [opt]
19358 Returns a TREE_LIST representing the base-classes, in the order in
19359 which they were declared. The representation of each node is as
19360 described by cp_parser_base_specifier.
19362 In the case that no bases are specified, this function will return
19363 NULL_TREE, not ERROR_MARK_NODE. */
19365 static tree
19367 {
19370 /* Look for the `:' that begins the list. */
19373 /* Scan the base-specifier-list. */
19375 {
19377 tree base;
19380 /* Look for the base-specifier. */
19382 /* Look for the (optional) ellipsis. */
19384 {
19385 /* Consume the `...'. */
19389 }
19391 /* Add BASE to the front of the list. */
19393 {
19395 /* Make this a pack expansion type. */
19399 {
19402 }
19403 }
19404 /* Peek at the next token. */
19406 /* If it's not a comma, then the list is complete. */
19409 /* Consume the `,'. */
19411 }
19413 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19414 base class had a qualified name. However, the next name that
19415 appears is certainly not qualified. */
19421 }
19423 /* Parse a base-specifier.
19425 base-specifier:
19426 :: [opt] nested-name-specifier [opt] class-name
19427 virtual access-specifier [opt] :: [opt] nested-name-specifier
19428 [opt] class-name
19429 access-specifier virtual [opt] :: [opt] nested-name-specifier
19430 [opt] class-name
19432 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19433 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19434 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19435 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19437 static tree
19439 {
19447 tree type;
19449 /* Process the optional `virtual' and `access-specifier'. */
19451 {
19452 /* Peek at the next token. */
19454 /* Process `virtual'. */
19456 {
19458 /* If `virtual' appears more than once, issue an error. */
19460 {
19464 }
19468 /* Consume the `virtual' token. */
19476 /* If more than one access specifier appears, issue an
19477 error. */
19480 {
19484 }
19488 /* Consume the access-specifier. */
19496 }
19497 }
19498 /* It is not uncommon to see programs mechanically, erroneously, use
19499 the 'typename' keyword to denote (dependent) qualified types
19500 as base classes. */
19502 {
19507 else
19509 "keyword %<typename%> not allowed in this context "
19512 }
19514 /* Look for the optional `::' operator. */
19516 /* Look for the nested-name-specifier. The simplest way to
19517 implement:
19519 [temp.res]
19521 The keyword `typename' is not permitted in a base-specifier or
19522 mem-initializer; in these contexts a qualified name that
19523 depends on a template-parameter is implicitly assumed to be a
19524 type name.
19526 is to pretend that we have seen the `typename' keyword at this
19527 point. */
19531 typename_type,
19533 /* If the base class is given by a qualified name, assume that names
19534 we see are type names or templates, as appropriate. */
19540 /* DR 950 allows decltype as a base-specifier. */
19542 else
19543 {
19544 /* Otherwise, look for the class-name. */
19546 class_scope_p,
19547 template_p,
19548 typename_type,
19553 }
19559 }
19561 /* Exception handling [gram.exception] */
19563 /* Parse an (optional) noexcept-specification.
19565 noexcept-specification:
19566 noexcept ( constant-expression ) [opt]
19568 If no noexcept-specification is present, returns NULL_TREE.
19569 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19570 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19571 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19572 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19573 in which case a boolean condition is returned instead. */
19575 static tree
19580 {
19584 /* Peek at the next token. */
19587 /* Is it a noexcept-specification? */
19589 {
19590 tree expr;
19594 {
19598 {
19599 /* Types may not be defined in an exception-specification. */
19601 parser->type_definition_forbidden_message
19606 /* Restore the saved message. */
19608 }
19609 else
19610 {
19613 }
19616 }
19617 else
19618 {
19622 }
19624 /* We cannot build a noexcept-spec right away because this will check
19625 that expr is a constexpr. */
19628 else
19630 }
19631 else
19633 }
19635 /* Parse an (optional) exception-specification.
19637 exception-specification:
19638 throw ( type-id-list [opt] )
19640 Returns a TREE_LIST representing the exception-specification. The
19641 TREE_VALUE of each node is a type. */
19643 static tree
19645 {
19647 tree type_id_list;
19650 /* Peek at the next token. */
19653 /* Is it a noexcept-specification? */
19659 /* If it's not `throw', then there's no exception-specification. */
19663 #if 0
19664 /* Enable this once a lot of code has transitioned to noexcept? */
19668 #endif
19670 /* Consume the `throw'. */
19673 /* Look for the `('. */
19676 /* Peek at the next token. */
19678 /* If it's not a `)', then there is a type-id-list. */
19680 {
19681 /* Types may not be defined in an exception-specification. */
19683 parser->type_definition_forbidden_message
19685 /* Parse the type-id-list. */
19687 /* Restore the saved message. */
19689 }
19690 else
19693 /* Look for the `)'. */
19697 }
19699 /* Parse an (optional) type-id-list.
19701 type-id-list:
19702 type-id ... [opt]
19703 type-id-list , type-id ... [opt]
19705 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19706 in the order that the types were presented. */
19708 static tree
19710 {
19714 {
19716 tree type;
19718 /* Get the next type-id. */
19720 /* Parse the optional ellipsis. */
19722 {
19723 /* Consume the `...'. */
19726 /* Turn the type into a pack expansion expression. */
19728 }
19729 /* Add it to the list. */
19731 /* Peek at the next token. */
19733 /* If it is not a `,', we are done. */
19736 /* Consume the `,'. */
19738 }
19741 }
19743 /* Parse a try-block.
19745 try-block:
19746 try compound-statement handler-seq */
19748 static tree
19750 {
19751 tree try_block;
19761 }
19763 /* Parse a function-try-block.
19765 function-try-block:
19766 try ctor-initializer [opt] function-body handler-seq */
19768 static bool
19770 {
19771 tree compound_stmt;
19772 tree try_block;
19775 /* Look for the `try' keyword. */
19778 /* Let the rest of the front end know where we are. */
19780 /* Parse the function-body. */
19781 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
19783 /* We're done with the `try' part. */
19785 /* Parse the handlers. */
19787 /* We're done with the handlers. */
19791 }
19793 /* Parse a handler-seq.
19795 handler-seq:
19796 handler handler-seq [opt] */
19798 static void
19800 {
19802 {
19805 /* Parse the handler. */
19807 /* Peek at the next token. */
19809 /* If it's not `catch' then there are no more handlers. */
19812 }
19813 }
19815 /* Parse a handler.
19817 handler:
19818 catch ( exception-declaration ) compound-statement */
19820 static void
19822 {
19823 tree handler;
19824 tree declaration;
19834 }
19836 /* Parse an exception-declaration.
19838 exception-declaration:
19839 type-specifier-seq declarator
19840 type-specifier-seq abstract-declarator
19841 type-specifier-seq
19842 ...
19844 Returns a VAR_DECL for the declaration, or NULL_TREE if the
19845 ellipsis variant is used. */
19847 static tree
19849 {
19850 cp_decl_specifier_seq type_specifiers;
19854 /* If it's an ellipsis, it's easy to handle. */
19856 {
19857 /* Consume the `...' token. */
19860 }
19862 /* Types may not be defined in exception-declarations. */
19864 parser->type_definition_forbidden_message
19867 /* Parse the type-specifier-seq. */
19871 /* If it's a `)', then there is no declarator. */
19874 else
19880 /* Restore the saved message. */
19887 }
19889 /* Parse a throw-expression.
19891 throw-expression:
19892 throw assignment-expression [opt]
19894 Returns a THROW_EXPR representing the throw-expression. */
19896 static tree
19898 {
19899 tree expression;
19904 /* Figure out whether or not there is an assignment-expression
19905 following the "throw" keyword. */
19913 else
19918 }
19920 /* GNU Extensions */
19922 /* Parse an (optional) asm-specification.
19924 asm-specification:
19925 asm ( string-literal )
19927 If the asm-specification is present, returns a STRING_CST
19928 corresponding to the string-literal. Otherwise, returns
19929 NULL_TREE. */
19931 static tree
19933 {
19935 tree asm_specification;
19937 /* Peek at the next token. */
19939 /* If the next token isn't the `asm' keyword, then there's no
19940 asm-specification. */
19944 /* Consume the `asm' token. */
19946 /* Look for the `('. */
19949 /* Look for the string-literal. */
19952 /* Look for the `)'. */
19956 }
19958 /* Parse an asm-operand-list.
19960 asm-operand-list:
19961 asm-operand
19962 asm-operand-list , asm-operand
19964 asm-operand:
19965 string-literal ( expression )
19966 [ string-literal ] string-literal ( expression )
19968 Returns a TREE_LIST representing the operands. The TREE_VALUE of
19969 each node is the expression. The TREE_PURPOSE is itself a
19970 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
19971 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
19972 is a STRING_CST for the string literal before the parenthesis. Returns
19973 ERROR_MARK_NODE if any of the operands are invalid. */
19975 static tree
19977 {
19982 {
19983 tree string_literal;
19984 tree expression;
19985 tree name;
19988 {
19989 /* Consume the `[' token. */
19991 /* Read the operand name. */
19996 /* Look for the closing `]'. */
19998 }
19999 else
20001 /* Look for the string-literal. */
20004 /* Look for the `('. */
20006 /* Parse the expression. */
20008 /* Look for the `)'. */
20016 /* Add this operand to the list. */
20018 expression,
20019 asm_operands);
20020 /* If the next token is not a `,', there are no more
20021 operands. */
20024 /* Consume the `,'. */
20026 }
20029 }
20031 /* Parse an asm-clobber-list.
20033 asm-clobber-list:
20034 string-literal
20035 asm-clobber-list , string-literal
20037 Returns a TREE_LIST, indicating the clobbers in the order that they
20038 appeared. The TREE_VALUE of each node is a STRING_CST. */
20040 static tree
20042 {
20046 {
20047 tree string_literal;
20049 /* Look for the string literal. */
20051 /* Add it to the list. */
20053 /* If the next token is not a `,', then the list is
20054 complete. */
20057 /* Consume the `,' token. */
20059 }
20062 }
20064 /* Parse an asm-label-list.
20066 asm-label-list:
20067 identifier
20068 asm-label-list , identifier
20070 Returns a TREE_LIST, indicating the labels in the order that they
20071 appeared. The TREE_VALUE of each node is a label. */
20073 static tree
20075 {
20079 {
20082 /* Look for the identifier. */
20085 {
20088 {
20094 }
20095 }
20096 /* If the next token is not a `,', then the list is
20097 complete. */
20100 /* Consume the `,' token. */
20102 }
20105 }
20107 /* Parse an (optional) series of attributes.
20109 attributes:
20110 attributes attribute
20112 attribute:
20113 __attribute__ (( attribute-list [opt] ))
20115 The return value is as for cp_parser_attribute_list. */
20117 static tree
20119 {
20123 {
20125 tree attribute_list;
20128 /* Peek at the next token. */
20130 /* If it's not `__attribute__', then we're done. */
20134 /* Consume the `__attribute__' keyword. */
20136 /* Look for the two `(' tokens. */
20140 /* Peek at the next token. */
20143 /* Parse the attribute-list. */
20145 else
20146 /* If the next token is a `)', then there is no attribute
20147 list. */
20150 /* Look for the two `)' tokens. */
20158 /* Add these new attributes to the list. */
20160 }
20163 }
20165 /* Parse an attribute-list.
20167 attribute-list:
20168 attribute
20169 attribute-list , attribute
20171 attribute:
20172 identifier
20173 identifier ( identifier )
20174 identifier ( identifier , expression-list )
20175 identifier ( expression-list )
20177 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20178 to an attribute. The TREE_PURPOSE of each node is the identifier
20179 indicating which attribute is in use. The TREE_VALUE represents
20180 the arguments, if any. */
20182 static tree
20184 {
20190 {
20192 tree identifier;
20193 tree attribute;
20195 /* Look for the identifier. We also allow keywords here; for
20196 example `__attribute__ ((const))' is legal. */
20200 {
20203 /* Consume the token. */
20206 /* Save away the identifier that indicates which attribute
20207 this is. */
20209 /* For keywords, use the canonical spelling, not the
20210 parsed identifier. */
20216 /* Peek at the next token. */
20218 /* If it's an `(', then parse the attribute arguments. */
20220 {
20224 vec = cp_parser_parenthesized_expression_list
20230 else
20231 {
20234 }
20235 /* Save the arguments away. */
20237 }
20240 {
20241 /* Add this attribute to the list. */
20244 }
20247 }
20248 /* Now, look for more attributes. If the next token isn't a
20249 `,', we're done. */
20253 /* Consume the comma and keep going. */
20255 }
20258 /* We built up the list in reverse order. */
20260 }
20262 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20263 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20264 current value of the PEDANTIC flag, regardless of whether or not
20265 the `__extension__' keyword is present. The caller is responsible
20266 for restoring the value of the PEDANTIC flag. */
20268 static bool
20270 {
20271 /* Save the old value of the PEDANTIC flag. */
20275 {
20276 /* Consume the `__extension__' token. */
20278 /* We're not being pedantic while the `__extension__' keyword is
20279 in effect. */
20283 }
20286 }
20288 /* Parse a label declaration.
20290 label-declaration:
20291 __label__ label-declarator-seq ;
20293 label-declarator-seq:
20294 identifier , label-declarator-seq
20295 identifier */
20297 static void
20299 {
20300 /* Look for the `__label__' keyword. */
20304 {
20305 tree identifier;
20307 /* Look for an identifier. */
20309 /* If we failed, stop. */
20312 /* Declare it as a label. */
20314 /* If the next token is a `;', stop. */
20317 /* Look for the `,' separating the label declarations. */
20319 }
20321 /* Look for the final `;'. */
20323 }
20325 /* Support Functions */
20327 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20328 NAME should have one of the representations used for an
20329 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20330 is returned. If PARSER->SCOPE is a dependent type, then a
20331 SCOPE_REF is returned.
20333 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20334 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20335 was formed. Abstractly, such entities should not be passed to this
20336 function, because they do not need to be looked up, but it is
20337 simpler to check for this special case here, rather than at the
20338 call-sites.
20340 In cases not explicitly covered above, this function returns a
20341 DECL, OVERLOAD, or baselink representing the result of the lookup.
20342 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20343 is returned.
20345 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20346 (e.g., "struct") that was used. In that case bindings that do not
20347 refer to types are ignored.
20349 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20350 ignored.
20352 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20353 are ignored.
20355 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20356 types.
20358 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20359 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20360 NULL_TREE otherwise. */
20362 static tree
20369 location_t name_location)
20370 {
20371 tree decl;
20374 /* Assume that the lookup will be unambiguous. */
20378 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20379 no longer valid. Note that if we are parsing tentatively, and
20380 the parse fails, OBJECT_TYPE will be automatically restored. */
20386 /* A template-id has already been resolved; there is no lookup to
20387 do. */
20391 {
20395 }
20397 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20398 it should already have been checked to make sure that the name
20399 used matches the type being destroyed. */
20401 {
20402 tree type;
20404 /* Figure out to which type this destructor applies. */
20409 else
20411 /* If that's not a class type, there is no destructor. */
20418 /* If it was a class type, return the destructor. */
20420 }
20422 /* By this point, the NAME should be an ordinary identifier. If
20423 the id-expression was a qualified name, the qualifying scope is
20424 stored in PARSER->SCOPE at this point. */
20427 /* Perform the lookup. */
20429 {
20435 /* If the SCOPE is dependent, the lookup must be deferred until
20436 the template is instantiated -- unless we are explicitly
20437 looking up names in uninstantiated templates. Even then, we
20438 cannot look up the name if the scope is not a class type; it
20439 might, for example, be a template type parameter. */
20444 /* Defer lookup. */
20446 else
20447 {
20450 /* If PARSER->SCOPE is a dependent type, then it must be a
20451 class type, and we must not be checking dependencies;
20452 otherwise, we would have processed this lookup above. So
20453 that PARSER->SCOPE is not considered a dependent base by
20454 lookup_member, we must enter the scope here. */
20458 /* If the PARSER->SCOPE is a template specialization, it
20459 may be instantiated during name lookup. In that case,
20460 errors may be issued. Even if we rollback the current
20461 tentative parse, those errors are valid. */
20466 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
20467 lookup result and the nested-name-specifier nominates a class C:
20468 * if the name specified after the nested-name-specifier, when
20469 looked up in C, is the injected-class-name of C (Clause 9), or
20470 * if the name specified after the nested-name-specifier is the
20471 same as the identifier or the simple-template-id's template-
20472 name in the last component of the nested-name-specifier,
20473 the name is instead considered to name the constructor of
20474 class C. [ Note: for example, the constructor is not an
20475 acceptable lookup result in an elaborated-type-specifier so
20476 the constructor would not be used in place of the
20477 injected-class-name. --end note ] Such a constructor name
20478 shall be used only in the declarator-id of a declaration that
20479 names a constructor or in a using-declaration. */
20487 /* If we have a single function from a using decl, pull it out. */
20494 }
20496 /* If the scope is a dependent type and either we deferred lookup or
20497 we did lookup but didn't find the name, rememeber the name. */
20500 {
20502 {
20503 tree type;
20505 /* The resolution to Core Issue 180 says that `struct
20506 A::B' should be considered a type-name, even if `A'
20507 is dependent. */
20511 }
20515 CPP_CLOSE_PAREN)))
20519 else
20522 is_template);
20523 }
20526 }
20528 {
20530 /* Look up the name in the scope of the OBJECT_TYPE, unless the
20531 OBJECT_TYPE is not a class. */
20533 /* If the OBJECT_TYPE is a template specialization, it may
20534 be instantiated during name lookup. In that case, errors
20535 may be issued. Even if we rollback the current tentative
20536 parse, those errors are valid. */
20538 name,
20541 tf_warning_or_error);
20542 /* Look it up in the enclosing context, too. */
20550 }
20551 else
20552 {
20558 }
20560 /* If the lookup failed, let our caller know. */
20564 /* Pull out the template from an injected-class-name (or multiple). */
20568 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
20570 {
20573 /* The error message we have to print is too complicated for
20574 cp_parser_error, so we incorporate its actions directly. */
20576 {
20578 name);
20580 }
20582 }
20590 /* If we have resolved the name of a member declaration, check to
20591 see if the declaration is accessible. When the name resolves to
20592 set of overloaded functions, accessibility is checked when
20593 overload resolution is done.
20595 During an explicit instantiation, access is not checked at all,
20596 as per [temp.explicit]. */
20603 }
20605 /* Like cp_parser_lookup_name, but for use in the typical case where
20606 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
20607 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
20609 static tree
20611 {
20613 none_type,
20618 location);
20619 }
20621 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
20622 the current context, return the TYPE_DECL. If TAG_NAME_P is
20623 true, the DECL indicates the class being defined in a class-head,
20624 or declared in an elaborated-type-specifier.
20626 Otherwise, return DECL. */
20628 static tree
20630 {
20631 /* If the TEMPLATE_DECL is being declared as part of a class-head,
20632 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
20634 struct A {
20635 template <typename T> struct B;
20636 };
20638 template <typename T> struct A::B {};
20640 Similarly, in an elaborated-type-specifier:
20642 namespace N { struct X{}; }
20644 struct A {
20645 template <typename T> friend struct N::X;
20646 };
20648 However, if the DECL refers to a class type, and we are in
20649 the scope of the class, then the name lookup automatically
20650 finds the TYPE_DECL created by build_self_reference rather
20651 than a TEMPLATE_DECL. For example, in:
20653 template <class T> struct S {
20654 S s;
20655 };
20657 there is no need to handle such case. */
20663 }
20665 /* If too many, or too few, template-parameter lists apply to the
20666 declarator, issue an error message. Returns TRUE if all went well,
20667 and FALSE otherwise. */
20669 static bool
20672 location_t declarator_location)
20673 {
20676 /* We haven't seen any classes that involve template parameters yet. */
20680 {
20683 {
20684 tree scope;
20689 {
20690 /* You're supposed to have one `template <...>'
20691 for every template class, but you don't need one
20692 for a full specialization. For example:
20694 template <class T> struct S{};
20695 template <> struct S<int> { void f(); };
20696 void S<int>::f () {}
20698 is correct; there shouldn't be a `template <>' for
20699 the definition of `S<int>::f'. */
20701 /* If SCOPE does not have template information of any
20702 kind, then it is not a template, nor is it nested
20703 within a template. */
20711 }
20712 }
20715 /* If the DECLARATOR has the form `X<y>' then it uses one
20716 additional level of template parameters. */
20719 return cp_parser_check_template_parameters
20736 }
20738 }
20740 /* NUM_TEMPLATES were used in the current declaration. If that is
20741 invalid, return FALSE and issue an error messages. Otherwise,
20742 return TRUE. If DECLARATOR is non-NULL, then we are checking a
20743 declarator and we can print more accurate diagnostics. */
20745 static bool
20748 location_t location,
20750 {
20751 /* If there are the same number of template classes and parameter
20752 lists, that's OK. */
20755 /* If there are more, but only one more, then we are referring to a
20756 member template. That's OK too. */
20759 /* If there are more template classes than parameter lists, we have
20760 something like:
20762 template <class T> void S<T>::R<T>::f (); */
20764 {
20774 else
20777 }
20778 /* Otherwise, there are too many template parameter lists. We have
20779 something like:
20781 template <class T> template <class U> void S::f(); */
20784 }
20786 /* Parse an optional `::' token indicating that the following name is
20787 from the global namespace. If so, PARSER->SCOPE is set to the
20788 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
20789 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
20790 Returns the new value of PARSER->SCOPE, if the `::' token is
20791 present, and NULL_TREE otherwise. */
20793 static tree
20795 {
20798 /* Peek at the next token. */
20800 /* If we're looking at a `::' token then we're starting from the
20801 global namespace, not our current location. */
20803 {
20804 /* Consume the `::' token. */
20806 /* Set the SCOPE so that we know where to start the lookup. */
20812 }
20814 {
20818 }
20821 }
20823 /* Returns TRUE if the upcoming token sequence is the start of a
20824 constructor declarator. If FRIEND_P is true, the declarator is
20825 preceded by the `friend' specifier. */
20827 static bool
20829 {
20831 tree nested_name_specifier;
20834 /* The common case is that this is not a constructor declarator, so
20835 try to avoid doing lots of work if at all possible. It's not
20836 valid declare a constructor at function scope. */
20839 /* And only certain tokens can begin a constructor declarator. */
20847 /* Parse tentatively; we are going to roll back all of the tokens
20848 consumed here. */
20850 /* Assume that we are looking at a constructor declarator. */
20853 /* Look for the optional `::' operator. */
20856 /* Look for the nested-name-specifier. */
20857 nested_name_specifier
20863 /* Outside of a class-specifier, there must be a
20864 nested-name-specifier. */
20872 /* If we have a class scope, this is easy; DR 147 says that S::S always
20873 names the constructor, and no other qualified name could. */
20876 {
20886 }
20887 /* If we still think that this might be a constructor-declarator,
20888 look for a class-name. */
20890 {
20891 /* If we have:
20893 template <typename T> struct S {
20894 S();
20895 };
20897 we must recognize that the nested `S' names a class. */
20898 tree type_decl;
20902 none_type,
20906 /* If there was no class-name, then this is not a constructor. */
20909 /* If we're still considering a constructor, we have to see a `(',
20910 to begin the parameter-declaration-clause, followed by either a
20911 `)', an `...', or a decl-specifier. We need to check for a
20912 type-specifier to avoid being fooled into thinking that:
20914 S (f) (int);
20916 is a constructor. (It is actually a function named `f' that
20917 takes one parameter (of type `int') and returns a value of type
20918 `S'. */
20926 /* A parameter declaration begins with a decl-specifier,
20927 which is either the "attribute" keyword, a storage class
20928 specifier, or (usually) a type-specifier. */
20930 {
20931 tree type;
20935 /* Names appearing in the type-specifier should be looked up
20936 in the scope of the class. */
20939 else
20940 {
20943 {
20947 {
20950 }
20951 }
20953 }
20955 /* Inside the constructor parameter list, surrounding
20956 template-parameter-lists do not apply. */
20957 saved_num_template_parameter_lists
20961 /* Look for the type-specifier. */
20963 CP_PARSER_FLAGS_NONE,
20969 parser->num_template_parameter_lists
20972 /* Leave the scope of the class. */
20977 }
20978 }
20980 /* We did not really want to consume any tokens. */
20984 }
20986 /* Parse the definition of the function given by the DECL_SPECIFIERS,
20987 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
20988 they must be performed once we are in the scope of the function.
20990 Returns the function defined. */
20992 static tree
20993 cp_parser_function_definition_from_specifiers_and_declarator
20996 tree attributes,
20998 {
20999 tree fn;
21002 /* Begin the function-definition. */
21005 /* The things we're about to see are not directly qualified by any
21006 template headers we've seen thus far. */
21009 /* If there were names looked up in the decl-specifier-seq that we
21010 did not check, check them now. We must wait until we are in the
21011 scope of the function to perform the checks, since the function
21012 might be a friend. */
21016 {
21017 /* Skip the entire function. */
21020 }
21022 {
21023 /* Seen already, skip it. An error message has already been output. */
21027 /* If this is a function from a class, pop the nested class. */
21030 }
21031 else
21032 {
21033 timevar_id_t tv;
21036 else
21042 }
21045 }
21047 /* Parse the part of a function-definition that follows the
21048 declarator. INLINE_P is TRUE iff this function is an inline
21049 function defined within a class-specifier.
21051 Returns the function defined. */
21053 static tree
21056 {
21057 tree fn;
21066 /* If the next token is `return', then the code may be trying to
21067 make use of the "named return value" extension that G++ used to
21068 support. */
21071 {
21072 /* Consume the `return' keyword. */
21074 /* Look for the identifier that indicates what value is to be
21075 returned. */
21077 /* Issue an error message. */
21080 /* Skip tokens until we reach the start of the function body. */
21082 {
21089 }
21090 }
21091 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21092 anything declared inside `f'. */
21093 saved_in_unbraced_linkage_specification_p
21096 /* Inside the function, surrounding template-parameter-lists do not
21097 apply. */
21098 saved_num_template_parameter_lists
21104 /* If the next token is `try', `__transaction_atomic', or
21105 `__transaction_relaxed`, then we are looking at either function-try-block
21106 or function-transaction-block. Note that all of these include the
21107 function-body. */
21110 RID_TRANSACTION_ATOMIC);
21112 RID_TRANSACTION_RELAXED))
21114 RID_TRANSACTION_RELAXED);
21117 else
21118 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21123 /* Finish the function. */
21126 /* Generate code for it, if necessary. */
21128 /* Restore the saved values. */
21129 parser->in_unbraced_linkage_specification_p
21131 parser->num_template_parameter_lists
21136 }
21138 /* Parse a template-declaration, assuming that the `export' (and
21139 `extern') keywords, if present, has already been scanned. MEMBER_P
21140 is as for cp_parser_template_declaration. */
21142 static void
21144 {
21147 tree parameter_list;
21152 /* Look for the `template' keyword. */
21157 /* And the `<'. */
21161 {
21162 /* 14.5.2.2 [temp.mem]
21164 A local class shall not have member templates. */
21169 }
21170 /* [temp]
21172 A template ... shall not have C linkage. */
21174 {
21176 /* Give it C++ linkage to avoid confusing other parts of the
21177 front end. */
21180 }
21181 else
21184 /* We cannot perform access checks on the template parameter
21185 declarations until we know what is being declared, just as we
21186 cannot check the decl-specifier list. */
21189 /* If the next token is `>', then we have an invalid
21190 specialization. Rather than complain about an invalid template
21191 parameter, issue an error message here. */
21193 {
21197 }
21198 else
21199 {
21200 /* Parse the template parameters. */
21202 }
21204 /* Get the deferred access checks from the parameter list. These
21205 will be checked once we know what is being declared, as for a
21206 member template the checks must be performed in the scope of the
21207 class containing the member. */
21210 /* Look for the `>'. */
21212 /* We just processed one more parameter list. */
21214 /* If the next token is `template', there are more template
21215 parameters. */
21217 RID_TEMPLATE))
21222 else
21223 {
21224 /* There are no access checks when parsing a template, as we do not
21225 know if a specialization will be a friend. */
21229 checks,
21230 member_p,
21235 /* If this is a member template declaration, let the front
21236 end know. */
21238 {
21243 }
21247 }
21248 /* We are done with the current parameter list. */
21253 /* Finish up. */
21256 /* Check the template arguments for a literal operator template. */
21260 {
21264 else
21265 {
21269 else
21270 {
21276 }
21277 }
21281 decl);
21282 }
21283 /* Register member declarations. */
21286 /* For the erroneous case of a template with C linkage, we pushed an
21287 implicit C++ linkage scope; exit that scope now. */
21290 /* If DECL is a function template, we must return to parse it later.
21291 (Even though there is no definition, there might be default
21292 arguments that need handling.) */
21297 }
21299 /* Perform the deferred access checks from a template-parameter-list.
21300 CHECKS is a TREE_LIST of access checks, as returned by
21301 get_deferred_access_checks. */
21303 static void
21305 {
21309 }
21311 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21312 `function-definition' sequence. MEMBER_P is true, this declaration
21313 appears in a class scope.
21315 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21316 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21318 static tree
21324 {
21327 cp_decl_specifier_seq decl_specifiers;
21331 /* This function is only used when processing a template
21332 declaration. */
21336 /* Defer access checks until we know what is being declared. */
21339 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21340 alternative. */
21343 CP_PARSER_FLAGS_OPTIONAL,
21349 /* There are no template typedefs. */
21351 {
21355 }
21357 /* Gather up the access checks that occurred the
21358 decl-specifier-seq. */
21361 /* Check for the declaration of a template class. */
21363 {
21365 {
21368 /* In this case:
21370 struct C {
21371 friend template <typename T> struct A<T>::B;
21372 };
21374 A<T>::B will be represented by a TYPENAME_TYPE, and
21375 therefore not recognized by shadow_tag. */
21377 && !decl
21384 else
21387 /* Perform access checks for template parameters. */
21389 }
21390 }
21392 /* Complain about missing 'typename' or other invalid type names. */
21395 {
21396 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21397 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21398 the rest of this declaration. */
21401 }
21403 /* If it's not a template class, try for a template function. If
21404 the next token is a `;', then this declaration does not declare
21405 anything. But, if there were errors in the decl-specifiers, then
21406 the error might well have come from an attempted class-specifier.
21407 In that case, there's no need to warn about a missing declarator. */
21411 {
21414 checks,
21416 member_p,
21417 declares_class_or_enum,
21419 NULL);
21421 /* 7.1.1-1 [dcl.stc]
21423 A storage-class-specifier shall not be specified in an explicit
21424 specialization... */
21426 && explicit_specialization_p
21428 {
21432 }
21433 }
21435 /* Look for a trailing `;' after the declaration. */
21441 out:
21444 /* Clear any current qualification; whatever comes next is the start
21445 of something new. */
21451 }
21453 /* Parse a cast-expression that is not the operand of a unary "&". */
21455 static tree
21457 {
21460 }
21462 /* Parse a functional cast to TYPE. Returns an expression
21463 representing the cast. */
21465 static tree
21467 {
21469 tree expression_list;
21470 tree cast;
21474 {
21481 tf_warning_or_error);
21482 }
21491 else
21492 {
21495 }
21498 tf_warning_or_error);
21499 /* [expr.const]/1: In an integral constant expression "only type
21500 conversions to integral or enumeration type can be used". */
21506 NIC_CONSTRUCTOR))
21509 }
21511 /* Save the tokens that make up the body of a member function defined
21512 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
21513 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
21514 specifiers applied to the declaration. Returns the FUNCTION_DECL
21515 for the member function. */
21517 static tree
21521 tree attributes)
21522 {
21525 tree fn;
21527 /* Create the FUNCTION_DECL. */
21529 /* If something went badly wrong, bail out now. */
21531 {
21532 /* If there's a function-body, skip it. */
21537 }
21539 /* Remember it, if there default args to post process. */
21542 /* Save away the tokens that make up the body of the
21543 function. */
21545 /* We can have braced-init-list mem-initializers before the fn body. */
21547 {
21551 {
21552 /* cache_group will stop after an un-nested { } pair, too. */
21556 /* variadic mem-inits have ... after the ')'. */
21559 }
21560 }
21562 /* Handle function try blocks. */
21567 /* Save away the inline definition; we will process it when the
21568 class is complete. */
21572 /* We need to know that this was defined in the class, so that
21573 friend templates are handled correctly. */
21576 /* Add FN to the queue of functions to be parsed later. */
21580 }
21582 /* Save the tokens that make up the in-class initializer for a non-static
21583 data member. Returns a DEFAULT_ARG. */
21585 static tree
21587 {
21589 }
21591 /* Parse a template-argument-list, as well as the trailing ">" (but
21592 not the opening "<"). See cp_parser_template_argument_list for the
21593 return value. */
21595 static tree
21597 {
21598 tree arguments;
21599 tree saved_scope;
21600 tree saved_qualifying_scope;
21601 tree saved_object_scope;
21606 /* [temp.names]
21608 When parsing a template-id, the first non-nested `>' is taken as
21609 the end of the template-argument-list rather than a greater-than
21610 operator. */
21611 saved_greater_than_is_operator_p
21614 /* Parsing the argument list may modify SCOPE, so we save it
21615 here. */
21619 /* We need to evaluate the template arguments, even though this
21620 template-id may be nested within a "sizeof". */
21625 /* Parse the template-argument-list itself. */
21629 else
21631 /* Look for the `>' that ends the template-argument-list. If we find
21632 a '>>' instead, it's probably just a typo. */
21634 {
21636 {
21637 /* In C++0x, a `>>' in a template argument list or cast
21638 expression is considered to be two separate `>'
21639 tokens. So, change the current token to a `>', but don't
21640 consume it: it will be consumed later when the outer
21641 template argument list (or cast expression) is parsed.
21642 Note that this replacement of `>' for `>>' is necessary
21643 even if we are parsing tentatively: in the tentative
21644 case, after calling
21645 cp_parser_enclosed_template_argument_list we will always
21646 throw away all of the template arguments and the first
21647 closing `>', either because the template argument list
21648 was erroneous or because we are replacing those tokens
21649 with a CPP_TEMPLATE_ID token. The second `>' (which will
21650 not have been thrown away) is needed either to close an
21651 outer template argument list or to complete a new-style
21652 cast. */
21655 }
21657 {
21658 /* If we're in a nested template argument list, the '>>' has
21659 to be a typo for '> >'. We emit the error message, but we
21660 continue parsing and we push a '>' as next token, so that
21661 the argument list will be parsed correctly. Note that the
21662 global source location is still on the token before the
21663 '>>', so we need to say explicitly where we want it. */
21669 }
21670 else
21671 {
21672 /* If this is not a nested template argument list, the '>>'
21673 is a typo for '>'. Emit an error message and continue.
21674 Same deal about the token location, but here we can get it
21675 right by consuming the '>>' before issuing the diagnostic. */
21678 "spurious %<>>%>, use %<>%> to terminate "
21680 }
21681 }
21682 else
21684 /* The `>' token might be a greater-than operator again now. */
21685 parser->greater_than_is_operator_p
21687 /* Restore the SAVED_SCOPE. */
21695 }
21697 /* MEMBER_FUNCTION is a member function, or a friend. If default
21698 arguments, or the body of the function have not yet been parsed,
21699 parse them now. */
21701 static void
21703 {
21705 /* If this member is a template, get the underlying
21706 FUNCTION_DECL. */
21710 /* There should not be any class definitions in progress at this
21711 point; the bodies of members are only parsed outside of all class
21712 definitions. */
21714 /* While we're parsing the member functions we might encounter more
21715 classes. We want to handle them right away, but we don't want
21716 them getting mixed up with functions that are currently in the
21717 queue. */
21720 /* Make sure that any template parameters are in scope. */
21723 /* If the body of the function has not yet been parsed, parse it
21724 now. */
21726 {
21727 tree function_scope;
21730 /* The function is no longer pending; we are processing it. */
21735 /* If this is a local class, enter the scope of the containing
21736 function. */
21741 /* Push the body of the function onto the lexer stack. */
21744 /* Let the front end know that we going to be defining this
21745 function. */
21749 /* Don't do access checking if it is a templated function. */
21753 /* Now, parse the body of the function. */
21760 /* Leave the scope of the containing function. */
21764 }
21766 /* Remove any template parameters from the symbol table. */
21769 /* Restore the queue. */
21772 }
21774 /* If DECL contains any default args, remember it on the unparsed
21775 functions queue. */
21777 static void
21779 {
21780 tree probe;
21783 probe;
21786 {
21787 cp_default_arg_entry *entry
21793 }
21794 }
21796 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
21797 which is either a FIELD_DECL or PARM_DECL. Parse it and return
21798 the result. For a PARM_DECL, PARMTYPE is the corresponding type
21799 from the parameter-type-list. */
21801 static tree
21804 {
21806 tree parsed_arg;
21812 /* Push the saved tokens for the default argument onto the parser's
21813 lexer stack. */
21819 /* Parse the default argument. */
21830 {
21831 /* In a non-template class, check conversions now. In a template,
21832 we'll wait and instantiate these as needed. */
21835 else
21836 {
21842 }
21843 }
21845 /* If the token stream has not been completely used up, then
21846 there was extra junk after the end of the default
21847 argument. */
21849 {
21852 else
21854 }
21856 /* Revert to the main lexer. */
21860 }
21862 /* FIELD is a non-static data member with an initializer which we saved for
21863 later; parse it now. */
21865 static void
21867 {
21868 tree def;
21873 NULL_TREE);
21877 }
21879 /* FN is a FUNCTION_DECL which may contains a parameter with an
21880 unparsed DEFAULT_ARG. Parse the default args now. This function
21881 assumes that the current scope is the scope in which the default
21882 argument should be processed. */
21884 static void
21886 {
21890 /* While we're parsing the default args, we might (due to the
21891 statement expression extension) encounter more classes. We want
21892 to handle them right away, but we don't want them getting mixed
21893 up with default args that are currently in the queue. */
21896 /* Local variable names (and the `this' keyword) may not appear
21897 in a default argument. */
21908 {
21910 tree parsed_arg;
21912 tree copy;
21919 /* This can happen for a friend declaration for a function
21920 already declared with default arguments. */
21923 parsed_arg
21925 default_arg,
21928 {
21930 }
21934 /* Update any instantiations we've already created. */
21938 }
21942 /* Make sure no default arg is missing. */
21945 /* Restore the state of local_variables_forbidden_p. */
21948 /* Restore the queue. */
21950 }
21952 /* Parse the operand of `sizeof' (or a similar operator). Returns
21953 either a TYPE or an expression, depending on the form of the
21954 input. The KEYWORD indicates which kind of expression we have
21955 encountered. */
21957 static tree
21959 {
21967 /* Types cannot be defined in a `sizeof' expression. Save away the
21968 old message. */
21970 /* And create the new one. */
21976 /* The restrictions on constant-expressions do not apply inside
21977 sizeof expressions. */
21978 saved_integral_constant_expression_p
21980 saved_non_integral_constant_expression_p
21984 /* If it's a `...', then we are computing the length of a parameter
21985 pack. */
21988 {
21989 /* Consume the `...'. */
21993 /* Note that this is an expansion. */
21995 }
21997 /* Do not actually evaluate the expression. */
22000 /* If it's a `(', then we might be looking at the type-id
22001 construction. */
22003 {
22004 tree type;
22007 /* We can't be sure yet whether we're looking at a type-id or an
22008 expression. */
22010 /* Consume the `('. */
22012 /* Parse the type-id. */
22017 /* Now, look for the trailing `)'. */
22019 /* If all went well, then we're done. */
22021 {
22022 cp_decl_specifier_seq decl_specs;
22024 /* Build a trivial decl-specifier-seq. */
22028 /* Call grokdeclarator to figure out what type this is. */
22031 TYPENAME,
22034 }
22035 }
22040 /* If the type-id production did not work out, then we must be
22041 looking at the unary-expression production. */
22047 /* Build a pack expansion. */
22050 /* Go back to evaluating expressions. */
22054 /* Free the message we created. */
22056 /* And restore the old one. */
22058 parser->integral_constant_expression_p
22060 parser->non_integral_constant_expression_p
22064 }
22066 /* If the current declaration has no declarator, return true. */
22068 static bool
22070 {
22071 /* If the next token is a `;' or a `,' then there is no
22072 declarator. */
22075 }
22077 /* Update the DECL_SPECS to reflect the storage class indicated by
22078 KEYWORD. */
22080 static void
22084 location_t location)
22085 {
22086 cp_storage_class storage_class;
22089 {
22093 }
22095 {
22098 }
22102 {
22106 }
22109 {
22127 }
22131 /* A storage class specifier cannot be applied alongside a typedef
22132 specifier. If there is a typedef specifier present then set
22133 conflicting_specifiers_p which will trigger an error later
22134 on in grokdeclarator. */
22137 }
22139 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22140 is true, the type is a class or enum definition. */
22142 static void
22144 tree type_spec,
22145 location_t location,
22147 {
22150 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22151 (with, for example, in "typedef int wchar_t;") we remember that
22152 this is what happened. In system headers, we ignore these
22153 declarations so that G++ can work with system headers that are not
22154 C++-safe. */
22156 && !type_definition_p
22166 {
22169 ds_redefined_builtin_type_spec,
22170 location);
22172 {
22176 }
22177 }
22180 else
22181 {
22186 }
22187 }
22189 /* Set the location for a declarator specifier and check if it is
22190 duplicated.
22192 DECL_SPECS is the sequence of declarator specifiers onto which to
22193 set the location.
22195 DS is the single declarator specifier to set which location is to
22196 be set onto the existing sequence of declarators.
22198 LOCATION is the location for the declarator specifier to
22199 consider. */
22201 static void
22204 {
22212 else
22213 {
22215 {
22219 else
22220 {
22223 OPT_Wlong_long,
22225 }
22226 }
22227 else
22228 {
22245 "__thread"
22246 };
22249 }
22250 }
22251 }
22253 /* Return true iff the declarator specifier DS is present in the
22254 sequence of declarator specifiers DECL_SPECS. */
22256 bool
22258 cp_decl_spec ds)
22259 {
22266 }
22268 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22269 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22271 static bool
22273 {
22275 }
22277 /* Issue an error message indicating that TOKEN_DESC was expected.
22278 If KEYWORD is true, it indicated this function is called by
22279 cp_parser_require_keword and the required token can only be
22280 a indicated keyword. */
22282 static void
22284 required_token token_desc,
22286 {
22288 {
22357 }
22359 {
22361 {
22440 }
22441 }
22442 else
22444 }
22448 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22449 issue an error message indicating that TOKEN_DESC was expected.
22451 Returns the token consumed, if the token had the appropriate type.
22452 Otherwise, returns NULL. */
22457 required_token token_desc)
22458 {
22461 else
22462 {
22463 /* Output the MESSAGE -- unless we're parsing tentatively. */
22467 }
22468 }
22470 /* An error message is produced if the next token is not '>'.
22471 All further tokens are skipped until the desired token is
22472 found or '{', '}', ';' or an unbalanced ')' or ']'. */
22474 static void
22476 {
22477 /* Current level of '< ... >'. */
22479 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
22482 /* Are we ready, yet? If not, issue error message. */
22486 /* Skip tokens until the desired token is found. */
22488 {
22489 /* Peek at the next token. */
22491 {
22499 /* C++0x views the `>>' operator as two `>' tokens, but
22500 C++98 does not. */
22503 {
22504 /* We've hit a `>>' where the first `>' closes the
22505 template argument list, and the second `>' is
22506 spurious. Just consume the `>>' and stop; we've
22507 already produced at least one error. */
22510 }
22511 /* Fall through for C++0x, so we handle the second `>' in
22512 the `>>'. */
22516 {
22517 /* We've reached the token we want, consume it and stop. */
22520 }
22539 /* The '>' was probably forgotten, don't look further. */
22544 }
22546 /* Consume this token. */
22548 }
22549 }
22551 /* If the next token is the indicated keyword, consume it. Otherwise,
22552 issue an error message indicating that TOKEN_DESC was expected.
22554 Returns the token consumed, if the token had the appropriate type.
22555 Otherwise, returns NULL. */
22560 required_token token_desc)
22561 {
22565 {
22568 }
22571 }
22573 /* Returns TRUE iff TOKEN is a token that can begin the body of a
22574 function-definition. */
22576 static bool
22578 {
22581 /* A ctor-initializer begins with a `:'. */
22583 /* A function-try-block begins with `try'. */
22585 /* A function-transaction-block begins with `__transaction_atomic'
22586 or `__transaction_relaxed'. */
22589 /* The named return value extension begins with `return'. */
22591 }
22593 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
22594 definition. */
22596 static bool
22598 {
22603 }
22605 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
22606 C++0x) ending a template-argument. */
22608 static bool
22610 {
22618 }
22620 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
22621 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
22623 static bool
22626 {
22632 /* Check for the sequence `<::' in the original code. It would be lexed as
22633 `[:', where `[' is a digraph, and there is no whitespace before
22634 `:'. */
22636 {
22641 }
22643 }
22645 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
22646 or none_type otherwise. */
22648 static enum tag_types
22650 {
22652 {
22662 }
22663 }
22665 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
22667 static void
22669 {
22673 {
22677 type);
22680 }
22681 }
22683 /* Issue an error message if DECL is redeclared with different
22684 access than its original declaration [class.access.spec/3].
22685 This applies to nested classes and nested class templates.
22686 [class.mem/1]. */
22688 static void
22690 {
22699 }
22701 /* Look for the `template' keyword, as a syntactic disambiguator.
22702 Return TRUE iff it is present, in which case it will be
22703 consumed. */
22705 static bool
22707 {
22709 {
22710 /* The `template' keyword can only be used within templates;
22711 outside templates the parser can always figure out what is a
22712 template and what is not. */
22714 {
22717 "%<template%> (as a disambiguator) is only allowed "
22719 /* If this part of the token stream is rescanned, the same
22720 error message would be generated. So, we purge the token
22721 from the stream. */
22724 }
22725 else
22726 {
22727 /* Consume the `template' keyword. */
22730 }
22731 }
22734 }
22736 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
22737 set PARSER->SCOPE, and perform other related actions. */
22739 static void
22741 {
22747 /* Get the stored value. */
22749 /* Perform any access checks that were deferred. */
22752 {
22757 }
22758 /* Set the scope from the stored value. */
22762 }
22764 /* Consume tokens up through a non-nested END token. Returns TRUE if we
22765 encounter the end of a block before what we were looking for. */
22767 static bool
22771 {
22773 {
22776 /* Abort a parenthesized expression if we encounter a semicolon. */
22780 /* If we've reached the end of the file, stop. */
22786 /* We've hit the end of an enclosing block, so there's been some
22787 kind of syntax error. */
22790 /* Consume the token. */
22792 /* See if it starts a new group. */
22794 {
22796 /* In theory this should probably check end == '}', but
22797 cp_parser_save_member_function_body needs it to exit
22798 after either '}' or ')' when called with ')'. */
22801 }
22803 {
22807 }
22812 }
22813 }
22815 /* Like above, for caching a default argument or NSDMI. Both of these are
22816 terminated by a non-nested comma, but it can be unclear whether or not a
22817 comma is nested in a template argument list unless we do more parsing.
22818 In order to handle this ambiguity, when we encounter a ',' after a '<'
22819 we try to parse what follows as a parameter-declaration-list (in the
22820 case of a default argument) or a member-declarator (in the case of an
22821 NSDMI). If that succeeds, then we stop caching. */
22823 static tree
22825 {
22830 tree default_argument;
22832 /* Add tokens until we have processed the entire default
22833 argument. We add the range [first_token, token). */
22836 {
22837 /* For list-initialization, this is straightforward. */
22840 }
22842 {
22845 /* Peek at the next token. */
22847 /* What we do depends on what token we have. */
22849 {
22850 /* In valid code, a default argument must be
22851 immediately followed by a `,' `)', or `...'. */
22854 {
22855 /* If we've seen a '<', we might be in a
22856 template-argument-list. Until Core issue 325 is
22857 resolved, we don't know how this situation ought
22858 to be handled, so try to DTRT. We check whether
22859 what comes after the comma is a valid parameter
22860 declaration list. If it is, then the comma ends
22861 the default argument; otherwise the default
22862 argument continues. */
22864 tree t;
22866 /* Set ITALP so cp_parser_parameter_declaration_list
22867 doesn't decide to commit to this parse. */
22875 {
22881 }
22882 else
22883 {
22889 }
22896 }
22899 /* If we run into a non-nested `;', `}', or `]',
22900 then the code is invalid -- but the default
22901 argument is certainly over. */
22907 /* Update DEPTH, if necessary. */
22922 /* This might be the comparison operator, or it might
22923 start a template argument list. */
22930 /* Fall through for C++0x, which treats the `>>'
22931 operator like two `>' tokens in certain
22932 cases. */
22936 {
22937 /* This might be an operator, or it might close a
22938 template argument list. But if a previous '<'
22939 started a template argument list, this will have
22940 closed it, so we can't be in one anymore. */
22944 }
22947 /* If we run out of tokens, issue an error message. */
22956 /* In these cases, we should look for template-ids.
22957 For example, if the default argument is
22958 `X<int, double>()', we need to do name lookup to
22959 figure out whether or not `X' is a template; if
22960 so, the `,' does not end the default argument.
22962 That is not yet done. */
22967 }
22969 /* If we've reached the end, stop. */
22973 /* Add the token to the token block. */
22975 }
22977 /* Create a DEFAULT_ARG to represent the unparsed default
22978 argument. */
22985 }
22987 /* Begin parsing tentatively. We always save tokens while parsing
22988 tentatively so that if the tentative parsing fails we can restore the
22989 tokens. */
22991 static void
22993 {
22994 /* Enter a new parsing context. */
22996 /* Begin saving tokens. */
22998 /* In order to avoid repetitive access control error messages,
22999 access checks are queued up until we are no longer parsing
23000 tentatively. */
23002 }
23004 /* Commit to the currently active tentative parse. */
23006 static void
23008 {
23012 /* Mark all of the levels as committed. */
23015 {
23022 }
23023 }
23025 /* Abort the currently active tentative parse. All consumed tokens
23026 will be rolled back, and no diagnostics will be issued. */
23028 static void
23030 {
23034 /* Now, pretend that we want to see if the construct was
23035 successfully parsed. */
23037 }
23039 /* Stop parsing tentatively. If a parse error has occurred, restore the
23040 token stream. Otherwise, commit to the tokens we have consumed.
23041 Returns true if no error occurred; false otherwise. */
23043 static bool
23045 {
23049 /* Remember whether or not an error occurred, since we are about to
23050 destroy that information. */
23052 /* Remove the topmost context from the stack. */
23055 /* If no parse errors occurred, commit to the tentative parse. */
23057 {
23058 /* Commit to the tokens read tentatively, unless that was
23059 already done. */
23064 }
23065 /* Otherwise, if errors occurred, roll back our state so that things
23066 are just as they were before we began the tentative parse. */
23067 else
23068 {
23071 }
23072 /* Add the context to the front of the free list. */
23077 }
23079 /* Returns true if we are parsing tentatively and are not committed to
23080 this tentative parse. */
23082 static bool
23084 {
23087 }
23089 /* Returns nonzero iff an error has occurred during the most recent
23090 tentative parse. */
23092 static bool
23094 {
23097 }
23099 /* Returns nonzero if GNU extensions are allowed. */
23101 static bool
23103 {
23105 }
23106 \f
23107 /* Objective-C++ Productions */
23110 /* Parse an Objective-C expression, which feeds into a primary-expression
23111 above.
23113 objc-expression:
23114 objc-message-expression
23115 objc-string-literal
23116 objc-encode-expression
23117 objc-protocol-expression
23118 objc-selector-expression
23120 Returns a tree representation of the expression. */
23122 static tree
23124 {
23125 /* Try to figure out what kind of declaration is present. */
23129 {
23139 {
23151 }
23157 }
23160 }
23162 /* Parse an Objective-C message expression.
23164 objc-message-expression:
23165 [ objc-message-receiver objc-message-args ]
23167 Returns a representation of an Objective-C message. */
23169 static tree
23171 {
23180 }
23182 /* Parse an objc-message-receiver.
23184 objc-message-receiver:
23185 expression
23186 simple-type-specifier
23188 Returns a representation of the type or expression. */
23190 static tree
23192 {
23193 tree rcv;
23195 /* An Objective-C message receiver may be either (1) a type
23196 or (2) an expression. */
23205 CP_PARSER_FLAGS_NONE);
23208 }
23210 /* Parse the arguments and selectors comprising an Objective-C message.
23212 objc-message-args:
23213 objc-selector
23214 objc-selector-args
23215 objc-selector-args , objc-comma-args
23217 objc-selector-args:
23218 objc-selector [opt] : assignment-expression
23219 objc-selector-args objc-selector [opt] : assignment-expression
23221 objc-comma-args:
23222 assignment-expression
23223 objc-comma-args , assignment-expression
23225 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23226 selector arguments and TREE_VALUE containing a list of comma
23227 arguments. */
23229 static tree
23231 {
23237 {
23243 /* Detect if we have a unary selector. */
23252 sel_args
23257 }
23259 /* Handle non-selector arguments, if any. */
23261 {
23262 tree arg;
23267 addl_args
23272 }
23275 {
23278 }
23281 }
23283 /* Parse an Objective-C encode expression.
23285 objc-encode-expression:
23286 @encode objc-typename
23288 Returns an encoded representation of the type argument. */
23290 static tree
23292 {
23293 tree type;
23303 {
23307 }
23309 /* This happens if we find @encode(T) (where T is a template
23310 typename or something dependent on a template typename) when
23311 parsing a template. In that case, we can't compile it
23312 immediately, but we rather create an AT_ENCODE_EXPR which will
23313 need to be instantiated when the template is used.
23314 */
23316 {
23320 }
23323 }
23325 /* Parse an Objective-C @defs expression. */
23327 static tree
23329 {
23330 tree name;
23338 }
23340 /* Parse an Objective-C protocol expression.
23342 objc-protocol-expression:
23343 @protocol ( identifier )
23345 Returns a representation of the protocol expression. */
23347 static tree
23349 {
23350 tree proto;
23358 }
23360 /* Parse an Objective-C selector expression.
23362 objc-selector-expression:
23363 @selector ( objc-method-signature )
23365 objc-method-signature:
23366 objc-selector
23367 objc-selector-seq
23369 objc-selector-seq:
23370 objc-selector :
23371 objc-selector-seq objc-selector :
23373 Returns a representation of the method selector. */
23375 static tree
23377 {
23389 {
23398 {
23399 /* Detect if we have a unary selector. */
23401 {
23404 }
23405 else
23406 {
23408 }
23409 }
23414 {
23415 sel_seq
23418 sel_seq
23421 }
23422 else
23423 sel_seq
23428 }
23430 finish_selector:
23434 }
23436 /* Parse a list of identifiers.
23438 objc-identifier-list:
23439 identifier
23440 objc-identifier-list , identifier
23442 Returns a TREE_LIST of identifier nodes. */
23444 static tree
23446 {
23447 tree identifier;
23448 tree list;
23459 {
23466 identifier));
23468 }
23471 }
23473 /* Parse an Objective-C alias declaration.
23475 objc-alias-declaration:
23476 @compatibility_alias identifier identifier ;
23478 This function registers the alias mapping with the Objective-C front end.
23479 It returns nothing. */
23481 static void
23483 {
23491 }
23493 /* Parse an Objective-C class forward-declaration.
23495 objc-class-declaration:
23496 @class objc-identifier-list ;
23498 The function registers the forward declarations with the Objective-C
23499 front end. It returns nothing. */
23501 static void
23503 {
23506 {
23507 tree id;
23517 else
23519 }
23521 }
23523 /* Parse a list of Objective-C protocol references.
23525 objc-protocol-refs-opt:
23526 objc-protocol-refs [opt]
23528 objc-protocol-refs:
23529 < objc-identifier-list >
23531 Returns a TREE_LIST of identifiers, if any. */
23533 static tree
23535 {
23539 {
23543 }
23546 }
23548 /* Parse a Objective-C visibility specification. */
23550 static void
23552 {
23556 {
23571 }
23573 /* Eat '@private'/'@protected'/'@public'. */
23575 }
23577 /* Parse an Objective-C method type. Return 'true' if it is a class
23578 (+) method, and 'false' if it is an instance (-) method. */
23582 {
23585 else
23587 }
23589 /* Parse an Objective-C protocol qualifier. */
23591 static tree
23593 {
23606 {
23611 }
23614 }
23616 /* Parse an Objective-C typename. */
23618 static tree
23620 {
23624 {
23630 /* An ObjC type name may consist of just protocol qualifiers, in which
23631 case the type shall default to 'id'. */
23633 {
23636 /* If the type could not be parsed, an error has already
23637 been produced. For error recovery, behave as if it had
23638 not been specified, which will use the default type
23639 'id'. */
23641 {
23643 /* We need to skip to the closing parenthesis as
23644 cp_parser_type_id() does not seem to do it for
23645 us. */
23650 }
23651 }
23655 }
23658 }
23660 /* Check to see if TYPE refers to an Objective-C selector name. */
23662 static bool
23664 {
23670 }
23672 /* Parse an Objective-C selector. */
23674 static tree
23676 {
23680 {
23683 }
23685 /* C++ operator names are allowed to appear in ObjC selectors. */
23687 {
23700 }
23701 }
23703 /* Parse an Objective-C params list. */
23705 static tree
23707 {
23713 {
23723 /* Detect if we have a unary selector. */
23726 {
23729 }
23733 {
23734 /* Something went quite wrong. There should be a colon
23735 here, but there is not. Stop parsing parameters. */
23737 }
23739 /* New ObjC allows attributes on parameters too. */
23744 params
23747 type_name,
23748 identifier,
23749 parm_attr));
23752 }
23755 {
23758 }
23760 /* We allow tail attributes for the method. */
23762 {
23770 }
23773 {
23776 }
23778 }
23780 /* Parse the non-keyword Objective-C params. */
23782 static tree
23785 {
23791 {
23793 tree parm;
23799 {
23804 }
23806 /* TODO: parse attributes for tail parameters. */
23815 }
23817 /* We allow tail attributes for the method. */
23819 {
23821 {
23826 }
23827 else
23828 /* We have an error, but parse the attributes, so that we can
23829 carry on. */
23835 }
23838 }
23840 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
23842 static void
23844 {
23847 /* If the next token is `extern' and the following token is a string
23848 literal, then we have a linkage specification. */
23850 && cp_parser_is_pure_string_literal
23853 /* Handle #pragma, if any. */
23856 /* Allow stray semicolons. */
23859 /* Mark methods as optional or required, when building protocols. */
23861 {
23864 }
23866 {
23869 }
23872 /* Other stray characters must generate errors. */
23874 {
23878 }
23879 /* Finally, try to parse a block-declaration, or a function-definition. */
23880 else
23882 }
23884 /* Parse a method signature. */
23886 static tree
23888 {
23904 }
23906 static bool
23908 {
23909 tree tattr;
23914 /* If the attributes are followed by a method introducer, this is not allowed.
23915 Dump the attributes and flag the situation. */
23920 /* Otherwise, the attributes introduce some interstitial code, possibly so
23921 rewind to allow that check. */
23924 }
23926 /* Parse an Objective-C method prototype list. */
23928 static void
23930 {
23934 {
23936 {
23941 else
23945 {
23949 }
23952 }
23958 OPT_Wattributes,
23960 else
23961 /* Allow for interspersed non-ObjC++ code. */
23965 }
23969 else
23973 }
23975 /* Parse an Objective-C method definition list. */
23977 static void
23979 {
23983 {
23984 tree meth;
23987 {
23993 else
23998 {
24002 }
24004 NULL_TREE);
24006 /* For historical reasons, we accept an optional semicolon. */
24013 {
24020 }
24021 }
24022 /* The following case will be removed once @synthesize is
24023 completely implemented. */
24034 else
24035 /* Allow for interspersed non-ObjC++ code. */
24039 }
24043 else
24047 }
24049 /* Parse Objective-C ivars. */
24051 static void
24053 {
24064 {
24065 cp_decl_specifier_seq declspecs;
24067 tree prefix_attributes;
24075 CP_PARSER_FLAGS_OPTIONAL,
24079 /* auto, register, static, extern, mutable. */
24081 {
24084 }
24086 /* __thread. */
24088 {
24091 }
24093 /* typedef. */
24095 {
24098 }
24103 /* Keep going until we hit the `;' at the end of the
24104 declaration. */
24106 {
24111 /* Check for a (possibly unnamed) bitfield declaration. */
24119 {
24120 /* Get the name of the bitfield. */
24123 sfk_none);
24125 eat_colon:
24127 /* Get the width of the bitfield. */
24128 width
24131 NULL);
24132 }
24133 else
24134 {
24135 /* Parse the declarator. */
24136 declarator
24141 }
24143 /* Look for attributes that apply to the ivar. */
24145 /* Remember which attributes are prefix attributes and
24146 which are not. */
24148 /* Combine the attributes. */
24152 /* Create the bitfield declaration. */
24154 width,
24155 attributes);
24156 else
24161 /* Add the instance variable. */
24165 /* Reset PREFIX_ATTRIBUTES. */
24174 {
24177 }
24179 }
24183 }
24188 /* Do not consume the RID_AT_END, so it will be read again as terminating
24189 the @interface of @implementation. */
24193 /* For historical reasons, we accept an optional semicolon. */
24196 }
24198 /* Parse an Objective-C protocol declaration. */
24200 static void
24202 {
24208 {
24213 }
24215 /* See if we have a forward declaration or a definition. */
24218 /* Try a forward declaration first. */
24220 {
24222 {
24223 tree id;
24233 else
24235 }
24237 }
24239 /* Ok, we got a full-fledged definition (or at least should). */
24240 else
24241 {
24246 }
24247 }
24249 /* Parse an Objective-C superclass or category. */
24251 static void
24256 {
24262 {
24265 }
24267 {
24270 /* If there is no category name, and this is an @interface, we
24271 have a class extension. */
24273 {
24276 }
24277 else
24281 }
24282 }
24284 /* Parse an Objective-C class interface. */
24286 static void
24288 {
24295 {
24296 /* It's hard to recover because even if valid @interface stuff
24297 is to follow, we can't compile it (or validate it) if we
24298 don't even know which class it refers to. Let's assume this
24299 was a stray '@interface' token in the stream and skip it.
24300 */
24302 }
24307 /* We have either a class or a category on our hands. */
24310 else
24311 {
24313 /* Handle instance variable declarations, if any. */
24316 }
24319 }
24321 /* Parse an Objective-C class implementation. */
24323 static void
24325 {
24332 {
24333 /* It's hard to recover because even if valid @implementation
24334 stuff is to follow, we can't compile it (or validate it) if
24335 we don't even know which class it refers to. Let's assume
24336 this was a stray '@implementation' token in the stream and
24337 skip it.
24338 */
24340 }
24344 /* We have either a class or a category on our hands. */
24347 else
24348 {
24350 /* Handle instance variable declarations, if any. */
24353 }
24356 }
24358 /* Consume the @end token and finish off the implementation. */
24360 static void
24362 {
24365 }
24367 /* Parse an Objective-C declaration. */
24369 static void
24371 {
24372 /* Try to figure out what kind of declaration is present. */
24377 {
24393 }
24396 {
24419 }
24420 }
24422 /* Parse an Objective-C try-catch-finally statement.
24424 objc-try-catch-finally-stmt:
24425 @try compound-statement objc-catch-clause-seq [opt]
24426 objc-finally-clause [opt]
24428 objc-catch-clause-seq:
24429 objc-catch-clause objc-catch-clause-seq [opt]
24431 objc-catch-clause:
24432 @catch ( objc-exception-declaration ) compound-statement
24434 objc-finally-clause:
24435 @finally compound-statement
24437 objc-exception-declaration:
24438 parameter-declaration
24439 '...'
24441 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24443 Returns NULL_TREE.
24445 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24446 for C. Keep them in sync. */
24448 static tree
24450 {
24451 location_t location;
24452 tree stmt;
24457 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24458 node, lest it get absorbed into the surrounding block. */
24464 {
24473 {
24474 /* We have "@catch (...)" (where the '...' are literally
24475 what is in the code). Skip the '...'.
24476 parameter_declaration is set to NULL_TREE, and
24477 objc_being_catch_clauses() knows that that means
24478 '...'. */
24481 }
24482 else
24483 {
24484 /* We have "@catch (NSException *exception)" or something
24485 like that. Parse the parameter declaration. */
24489 else
24494 }
24497 else
24498 {
24499 /* If there was no open parenthesis, we are recovering from
24500 an error, and we are trying to figure out what mistake
24501 the user has made. */
24503 /* If there is an immediate closing parenthesis, the user
24504 probably forgot the opening one (ie, they typed "@catch
24505 NSException *e)". Parse the closing parenthesis and keep
24506 going. */
24510 /* If these is no immediate closing parenthesis, the user
24511 probably doesn't know that parenthesis are required at
24512 all (ie, they typed "@catch NSException *e"). So, just
24513 forget about the closing parenthesis and keep going. */
24514 }
24518 }
24520 {
24523 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
24524 node, lest it get absorbed into the surrounding block. */
24528 }
24531 }
24533 /* Parse an Objective-C synchronized statement.
24535 objc-synchronized-stmt:
24536 @synchronized ( expression ) compound-statement
24538 Returns NULL_TREE. */
24540 static tree
24542 {
24543 location_t location;
24554 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
24555 node, lest it get absorbed into the surrounding block. */
24560 }
24562 /* Parse an Objective-C throw statement.
24564 objc-throw-stmt:
24565 @throw assignment-expression [opt] ;
24567 Returns a constructed '@throw' statement. */
24569 static tree
24571 {
24583 }
24585 /* Parse an Objective-C statement. */
24587 static tree
24589 {
24590 /* Try to figure out what kind of declaration is present. */
24594 {
24605 }
24608 }
24610 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
24611 look ahead to see if an objc keyword follows the attributes. This
24612 is to detect the use of prefix attributes on ObjC @interface and
24613 @protocol. */
24615 static bool
24617 {
24622 {
24625 }
24628 }
24630 /* This routine is a minimal replacement for
24631 c_parser_struct_declaration () used when parsing the list of
24632 types/names or ObjC++ properties. For example, when parsing the
24633 code
24635 @property (readonly) int a, b, c;
24637 this function is responsible for parsing "int a, int b, int c" and
24638 returning the declarations as CHAIN of DECLs.
24640 TODO: Share this code with cp_parser_objc_class_ivars. It's very
24641 similar parsing. */
24642 static tree
24644 {
24646 cp_decl_specifier_seq declspecs;
24648 tree prefix_attributes;
24651 CP_PARSER_FLAGS_NONE,
24658 /* auto, register, static, extern, mutable. */
24660 {
24663 }
24665 /* __thread. */
24667 {
24670 }
24672 /* typedef. */
24674 {
24677 }
24682 /* Keep going until we hit the `;' at the end of the declaration. */
24684 {
24689 /* Parse the declarator. */
24693 /* Look for attributes that apply to the ivar. */
24695 /* Remember which attributes are prefix attributes and
24696 which are not. */
24698 /* Combine the attributes. */
24708 /* Reset PREFIX_ATTRIBUTES. */
24719 {
24722 }
24723 else
24725 }
24727 }
24729 /* Parse an Objective-C @property declaration. The syntax is:
24731 objc-property-declaration:
24732 '@property' objc-property-attributes[opt] struct-declaration ;
24734 objc-property-attributes:
24735 '(' objc-property-attribute-list ')'
24737 objc-property-attribute-list:
24738 objc-property-attribute
24739 objc-property-attribute-list, objc-property-attribute
24741 objc-property-attribute
24742 'getter' = identifier
24743 'setter' = identifier
24744 'readonly'
24745 'readwrite'
24746 'assign'
24747 'retain'
24748 'copy'
24749 'nonatomic'
24751 For example:
24752 @property NSString *name;
24753 @property (readonly) id object;
24754 @property (retain, nonatomic, getter=getTheName) id name;
24755 @property int a, b, c;
24757 PS: This function is identical to
24758 c_parser_objc_at_property_declaration for C. Keep them in sync. */
24759 static void
24761 {
24762 /* The following variables hold the attributes of the properties as
24763 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
24764 seen. When we see an attribute, we set them to 'true' (if they
24765 are boolean properties) or to the identifier (if they have an
24766 argument, ie, for getter and setter). Note that here we only
24767 parse the list of attributes, check the syntax and accumulate the
24768 attributes that we find. objc_add_property_declaration() will
24769 then process the information. */
24779 /* 'properties' is the list of properties that we read. Usually a
24780 single one, but maybe more (eg, in "@property int a, b, c;" there
24781 are three). */
24782 tree properties;
24783 location_t loc;
24789 /* Parse the optional attribute list... */
24791 {
24792 /* Eat the '('. */
24796 {
24802 {
24805 }
24809 {
24820 {
24824 else
24829 }
24832 {
24836 }
24838 {
24840 {
24843 }
24844 else
24848 else
24850 }
24851 else
24852 {
24854 {
24857 }
24858 else
24860 }
24866 }
24873 else
24875 }
24877 /* FIXME: "@property (setter, assign);" will generate a spurious
24878 "error: expected ‘)’ before ‘,’ token". This is because
24879 cp_parser_require, unlike the C counterpart, will produce an
24880 error even if we are in error recovery. */
24882 {
24887 }
24888 }
24890 /* ... and the property declaration(s). */
24894 {
24896 /* If the next token is now a `;', consume it. */
24900 }
24904 else
24905 {
24906 /* Comma-separated properties are chained together in
24907 reverse order; add them one by one. */
24916 }
24919 }
24921 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
24923 objc-synthesize-declaration:
24924 @synthesize objc-synthesize-identifier-list ;
24926 objc-synthesize-identifier-list:
24927 objc-synthesize-identifier
24928 objc-synthesize-identifier-list, objc-synthesize-identifier
24930 objc-synthesize-identifier
24931 identifier
24932 identifier = identifier
24934 For example:
24935 @synthesize MyProperty;
24936 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
24938 PS: This function is identical to c_parser_objc_at_synthesize_declaration
24939 for C. Keep them in sync.
24940 */
24941 static void
24943 {
24945 location_t loc;
24950 {
24954 {
24957 }
24959 {
24963 {
24966 }
24967 }
24968 else
24973 else
24975 }
24978 }
24980 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
24982 objc-dynamic-declaration:
24983 @dynamic identifier-list ;
24985 For example:
24986 @dynamic MyProperty;
24987 @dynamic MyProperty, AnotherProperty;
24989 PS: This function is identical to c_parser_objc_at_dynamic_declaration
24990 for C. Keep them in sync.
24991 */
24992 static void
24994 {
24996 location_t loc;
25001 {
25002 tree property;
25005 {
25008 }
25012 else
25014 }
25017 }
25019 \f
25020 /* OpenMP 2.5 parsing routines. */
25022 /* Returns name of the next clause.
25023 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
25024 the token is not consumed. Otherwise appropriate pragma_omp_clause is
25025 returned and the token is consumed. */
25027 static pragma_omp_clause
25029 {
25039 {
25044 {
25091 }
25092 }
25098 }
25100 /* Validate that a clause of the given type does not already exist. */
25102 static void
25105 {
25106 tree c;
25110 {
25113 }
25114 }
25116 /* OpenMP 2.5:
25117 variable-list:
25118 identifier
25119 variable-list , identifier
25121 In addition, we match a closing parenthesis. An opening parenthesis
25122 will have been consumed by the caller.
25124 If KIND is nonzero, create the appropriate node and install the decl
25125 in OMP_CLAUSE_DECL and add the node to the head of the list.
25127 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25128 return the list created. */
25130 static tree
25132 tree list)
25133 {
25136 {
25153 {
25158 }
25159 else
25162 get_comma:
25166 }
25169 {
25172 /* Try to resync to an unnested comma. Copied from
25173 cp_parser_parenthesized_expression_list. */
25174 skip_comma:
25181 }
25184 }
25186 /* Similarly, but expect leading and trailing parenthesis. This is a very
25187 common case for omp clauses. */
25189 static tree
25191 {
25195 }
25197 /* OpenMP 3.0:
25198 collapse ( constant-expression ) */
25200 static tree
25202 {
25204 location_t loc;
25205 HOST_WIDE_INT n;
25225 {
25228 }
25236 }
25238 /* OpenMP 2.5:
25239 default ( shared | none ) */
25241 static tree
25243 {
25245 tree c;
25250 {
25255 {
25270 }
25273 }
25274 else
25275 {
25276 invalid_kind:
25278 }
25294 }
25296 /* OpenMP 3.1:
25297 final ( expression ) */
25299 static tree
25301 {
25322 }
25324 /* OpenMP 2.5:
25325 if ( expression ) */
25327 static tree
25329 {
25350 }
25352 /* OpenMP 3.1:
25353 mergeable */
25355 static tree
25358 {
25359 tree c;
25362 location);
25367 }
25369 /* OpenMP 2.5:
25370 nowait */
25372 static tree
25375 {
25376 tree c;
25383 }
25385 /* OpenMP 2.5:
25386 num_threads ( expression ) */
25388 static tree
25390 location_t location)
25391 {
25413 }
25415 /* OpenMP 2.5:
25416 ordered */
25418 static tree
25421 {
25422 tree c;
25430 }
25432 /* OpenMP 2.5:
25433 reduction ( reduction-operator : variable-list )
25435 reduction-operator:
25436 One of: + * - & ^ | && ||
25438 OpenMP 3.1:
25440 reduction-operator:
25441 One of: + * - & ^ | && || min max */
25443 static tree
25445 {
25453 {
25479 {
25484 {
25487 }
25489 {
25492 }
25493 }
25494 /* FALLTHROUGH */
25498 resync_fail:
25503 }
25514 }
25516 /* OpenMP 2.5:
25517 schedule ( schedule-kind )
25518 schedule ( schedule-kind , expression )
25520 schedule-kind:
25521 static | dynamic | guided | runtime | auto */
25523 static tree
25525 {
25534 {
25539 {
25560 }
25561 }
25566 else
25571 {
25586 else
25591 }
25599 invalid_kind:
25601 resync_fail:
25606 }
25608 /* OpenMP 3.0:
25609 untied */
25611 static tree
25614 {
25615 tree c;
25622 }
25624 /* Parse all OpenMP clauses. The set clauses allowed by the directive
25625 is a bitmask in MASK. Return the list of clauses found; the result
25626 of clause default goes in *pdefault. */
25628 static tree
25631 {
25637 {
25638 pragma_omp_clause c_kind;
25650 {
25662 clauses);
25676 clauses);
25685 clauses);
25709 clauses);
25723 clauses);
25734 }
25737 {
25738 /* Remove the invalid clause(s) from the list to avoid
25739 confusing the rest of the compiler. */
25742 }
25743 }
25744 saw_error:
25747 }
25749 /* OpenMP 2.5:
25750 structured-block:
25751 statement
25753 In practice, we're also interested in adding the statement to an
25754 outer node. So it is convenient if we work around the fact that
25755 cp_parser_statement calls add_stmt. */
25757 static unsigned
25759 {
25762 /* Only move the values to IN_OMP_BLOCK if they weren't false.
25763 This preserves the "not within loop or switch" style error messages
25764 for nonsense cases like
25765 void foo() {
25766 #pragma omp single
25767 break;
25768 }
25769 */
25774 }
25776 static void
25778 {
25780 }
25782 static tree
25784 {
25792 }
25794 /* OpenMP 2.5:
25795 # pragma omp atomic new-line
25796 expression-stmt
25798 expression-stmt:
25799 x binop= expr | x++ | ++x | x-- | --x
25800 binop:
25801 +, *, -, /, &, ^, |, <<, >>
25803 where x is an lvalue expression with scalar type.
25805 OpenMP 3.1:
25806 # pragma omp atomic new-line
25807 update-stmt
25809 # pragma omp atomic read new-line
25810 read-stmt
25812 # pragma omp atomic write new-line
25813 write-stmt
25815 # pragma omp atomic update new-line
25816 update-stmt
25818 # pragma omp atomic capture new-line
25819 capture-stmt
25821 # pragma omp atomic capture new-line
25822 capture-block
25824 read-stmt:
25825 v = x
25826 write-stmt:
25827 x = expr
25828 update-stmt:
25829 expression-stmt | x = x binop expr
25830 capture-stmt:
25831 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
25832 capture-block:
25833 { v = x; update-stmt; } | { update-stmt; v = x; }
25835 where x and v are lvalue expressions with scalar type. */
25837 static void
25839 {
25846 {
25858 else
25862 }
25866 {
25877 else
25883 {
25884 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
25885 opcode. */
25890 }
25894 {
25897 }
25898 else
25899 {
25906 }
25909 }
25911 restart:
25916 {
25923 /* FALLTHROUGH */
25933 /* FALLTHROUGH */
25948 /* Undo effects of boolean_increment for post {in,de}crement. */
25950 /* FALLTHRU */
25954 {
25955 /* Undo effects of boolean_increment. */
25957 {
25958 /* This is pre or post increment. */
25963 && !structured_block
25967 }
25968 }
25969 /* FALLTHRU */
25972 {
26002 {
26012 {
26015 {
26023 }
26058 }
26069 }
26070 /* FALLTHROUGH */
26075 }
26082 }
26083 stmt_done:
26085 {
26098 }
26100 {
26103 }
26104 done:
26110 saw_error:
26113 {
26117 {
26121 }
26122 }
26123 }
26126 /* OpenMP 2.5:
26127 # pragma omp barrier new-line */
26129 static void
26131 {
26134 }
26136 /* OpenMP 2.5:
26137 # pragma omp critical [(name)] new-line
26138 structured-block */
26140 static tree
26142 {
26146 {
26158 }
26163 }
26165 /* OpenMP 2.5:
26166 # pragma omp flush flush-vars[opt] new-line
26168 flush-vars:
26169 ( variable-list ) */
26171 static void
26173 {
26179 }
26181 /* Helper function, to parse omp for increment expression. */
26183 static tree
26185 {
26190 {
26193 }
26196 {
26204 }
26206 /* If decl is an iterator, preserve LHS and RHS of the relational
26207 expr until finish_omp_for. */
26217 }
26219 /* Helper function, to parse omp for increment expression. */
26221 static tree
26223 {
26227 cp_id_kind idk;
26231 {
26239 }
26247 {
26252 }
26259 {
26263 }
26275 do
26276 {
26283 {
26285 {
26288 else
26290 tf_warning_or_error);
26291 }
26292 else
26295 }
26296 }
26300 {
26304 }
26305 else
26309 }
26311 /* Parse the restricted form of the for statement allowed by OpenMP. */
26313 static tree
26315 {
26319 location_t loc_first;
26338 {
26341 location_t loc;
26344 {
26347 }
26356 {
26357 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26359 init-expr:
26360 var = lb
26361 integer-type var = lb
26362 random-access-iterator-type var = lb
26363 pointer-type var = lb
26364 */
26365 cp_decl_specifier_seq type_specifiers;
26367 /* First, try to parse as an initialized declaration. See
26368 cp_parser_condition, from whence the bulk of this is copied. */
26375 {
26376 /* If parsing a type specifier seq succeeded, then this
26377 MUST be a initialized declaration. */
26382 CP_PARSER_DECLARATOR_NAMED,
26392 else
26393 {
26403 {
26405 CPP_OPEN_PAREN))
26408 else
26409 /* Trigger an error. */
26414 }
26418 {
26426 {
26429 auto_node);
26434 }
26437 asm_specification,
26438 LOOKUP_ONLYCONVERTING);
26440 {
26443 }
26444 else
26447 }
26448 else
26449 {
26450 /* Consume '='. */
26454 non_class:
26457 else
26460 asm_specification,
26461 LOOKUP_ONLYCONVERTING);
26462 }
26466 }
26467 }
26468 else
26469 {
26470 cp_id_kind idk;
26471 /* If parsing a type specifier sequence failed, then
26472 this MUST be a simple expression. */
26477 && decl
26480 {
26481 tree rhs;
26488 rhs,
26489 tf_warning_or_error));
26491 }
26492 else
26493 {
26498 {
26502 }
26503 }
26504 }
26505 }
26508 {
26511 {
26517 }
26518 else
26520 }
26525 {
26530 {
26534 }
26537 {
26538 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
26539 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
26548 }
26549 else
26550 {
26555 }
26556 }
26559 {
26560 tree c;
26562 {
26571 decl);
26575 decl);
26576 }
26578 {
26583 {
26586 }
26587 }
26588 }
26597 {
26598 /* If decl is an iterator, preserve the operator on decl
26599 until finish_omp_for. */
26601 && ((processing_template_decl
26605 else
26607 }
26622 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
26623 in between the collapsed for loops to be still considered perfectly
26624 nested. Hopefully the final version clarifies this.
26625 For now handle (multiple) {'s and empty statements. */
26627 do
26628 {
26632 {
26634 bracecount++;
26635 }
26639 else
26640 {
26647 }
26648 }
26652 {
26655 }
26656 }
26658 /* Note that we saved the original contents of this flag when we entered
26659 the structured block, and so we don't need to re-save it here. */
26662 /* Note that the grammar doesn't call for a structured block here,
26663 though the loop as a whole is a structured block. */
26670 else
26675 {
26677 {
26679 nbraces--;
26680 }
26683 else
26684 {
26686 {
26689 }
26694 }
26695 }
26702 }
26704 /* OpenMP 2.5:
26705 #pragma omp for for-clause[optseq] new-line
26706 for-loop */
26708 #define OMP_FOR_CLAUSE_MASK \
26709 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26710 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26711 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26712 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26713 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
26714 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
26715 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
26716 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
26718 static tree
26720 {
26736 }
26738 /* OpenMP 2.5:
26739 # pragma omp master new-line
26740 structured-block */
26742 static tree
26744 {
26748 }
26750 /* OpenMP 2.5:
26751 # pragma omp ordered new-line
26752 structured-block */
26754 static tree
26756 {
26760 }
26762 /* OpenMP 2.5:
26764 section-scope:
26765 { section-sequence }
26767 section-sequence:
26768 section-directive[opt] structured-block
26769 section-sequence section-directive structured-block */
26771 static tree
26773 {
26784 {
26791 {
26801 }
26807 }
26810 {
26818 {
26822 }
26824 {
26827 }
26832 }
26843 }
26845 /* OpenMP 2.5:
26846 # pragma omp sections sections-clause[optseq] newline
26847 sections-scope */
26849 #define OMP_SECTIONS_CLAUSE_MASK \
26850 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26851 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26852 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26853 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26854 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26856 static tree
26858 {
26869 }
26871 /* OpenMP 2.5:
26872 # pragma parallel parallel-clause new-line
26873 # pragma parallel for parallel-for-clause new-line
26874 # pragma parallel sections parallel-sections-clause new-line */
26876 #define OMP_PARALLEL_CLAUSE_MASK \
26877 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26878 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26879 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26880 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26881 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26882 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
26883 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26884 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
26886 static tree
26888 {
26897 {
26903 }
26905 {
26909 {
26915 }
26916 }
26923 {
26943 }
26950 }
26952 /* OpenMP 2.5:
26953 # pragma omp single single-clause[optseq] new-line
26954 structured-block */
26956 #define OMP_SINGLE_CLAUSE_MASK \
26957 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26958 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26959 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
26960 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26962 static tree
26964 {
26974 }
26976 /* OpenMP 3.0:
26977 # pragma omp task task-clause[optseq] new-line
26978 structured-block */
26980 #define OMP_TASK_CLAUSE_MASK \
26981 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26982 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
26983 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26984 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26985 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26986 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26987 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
26988 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
26990 static tree
26992 {
27003 }
27005 /* OpenMP 3.0:
27006 # pragma omp taskwait new-line */
27008 static void
27010 {
27013 }
27015 /* OpenMP 3.1:
27016 # pragma omp taskyield new-line */
27018 static void
27020 {
27023 }
27025 /* OpenMP 2.5:
27026 # pragma omp threadprivate (variable-list) */
27028 static void
27030 {
27031 tree vars;
27037 }
27039 /* Main entry point to OpenMP statement pragmas. */
27041 static void
27043 {
27044 tree stmt;
27047 {
27077 }
27081 }
27082 \f
27083 /* Transactional Memory parsing routines. */
27085 /* Parse a transaction attribute.
27087 txn-attribute:
27088 attribute
27089 [ [ identifier ] ]
27091 ??? Simplify this when C++0x bracket attributes are
27092 implemented properly. */
27094 static tree
27096 {
27111 {
27115 /* For keywords, use the canonical spelling,
27116 not the parsed identifier. */
27120 }
27121 else
27125 error1:
27128 }
27130 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27132 transaction-statement:
27133 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27134 compound-statement
27135 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27136 */
27138 static tree
27140 {
27155 else
27156 {
27160 }
27162 /* Parse a noexcept specification. */
27165 /* Keep track if we're in the lexical scope of an outer transaction. */
27177 }
27179 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27181 transaction-expression:
27182 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27183 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27184 */
27186 static tree
27188 {
27213 /* Set this early. This might mean that we allow transaction_cancel in
27214 an expression that we find out later actually has to be a constexpr.
27215 However, we expect that cxx_constant_value will be able to deal with
27216 this; also, if the noexcept has no constexpr, then what we parse next
27217 really is a transaction's body. */
27220 /* Parse a noexcept specification. */
27226 {
27233 }
27234 else
27235 {
27236 /* The only expression that is available got parsed for the noexcept
27237 already. noexcept is true then. */
27240 }
27249 }
27251 /* Parse a function-transaction-block.
27253 function-transaction-block:
27254 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27255 function-body
27256 __transaction_atomic txn-attribute[opt] function-try-block
27257 __transaction_relaxed ctor-initializer[opt] function-body
27258 __transaction_relaxed function-try-block
27259 */
27261 static bool
27263 {
27279 else
27280 {
27284 }
27292 else
27293 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
27301 }
27303 /* Parse a __transaction_cancel statement.
27305 cancel-statement:
27306 __transaction_cancel txn-attribute[opt] ;
27307 __transaction_cancel txn-attribute[opt] throw-expression ;
27309 ??? Cancel and throw is not yet implemented. */
27311 static tree
27313 {
27319 RT_TRANSACTION_CANCEL);
27326 /* ??? Parse cancel-and-throw here. */
27331 {
27335 }
27337 {
27341 }
27343 {
27346 {
27352 }
27353 }
27355 {
27359 }
27366 }
27367 \f
27368 /* The parser. */
27372 \f
27373 /* Special handling for the first token or line in the file. The first
27374 thing in the file might be #pragma GCC pch_preprocess, which loads a
27375 PCH file, which is a GC collection point. So we need to handle this
27376 first pragma without benefit of an existing lexer structure.
27378 Always returns one token to the caller in *FIRST_TOKEN. This is
27379 either the true first token of the file, or the first token after
27380 the initial pragma. */
27382 static void
27384 {
27393 {
27400 }
27401 else
27404 /* Skip to the end of the pragma. */
27408 /* Now actually load the PCH file. */
27412 /* Read one more token to return to our caller. We have to do this
27413 after reading the PCH file in, since its pointers have to be
27414 live. */
27416 }
27418 /* Normal parsing of a pragma token. Here we can (and must) use the
27419 regular lexer. */
27421 static bool
27423 {
27433 {
27441 {
27451 }
27456 {
27466 }
27471 {
27477 "%<#pragma omp taskwait%> may only be "
27482 }
27487 {
27493 "%<#pragma omp taskyield%> may only be "
27498 }
27521 "%<#pragma omp section%> may only be used in "
27530 bad_stmt:
27533 }
27537 }
27539 /* The interface the pragma parsers have to the lexer. */
27541 enum cpp_ttype
27543 {
27556 else
27557 {
27561 }
27564 }
27566 \f
27567 /* External interface. */
27569 /* Parse one entire translation unit. */
27571 void
27573 {
27577 {
27580 }
27588 }