| blob | a2d8062d7eb0dfc3a8f7364225e1599b04213422 |
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 {
317 }
320 }
323 /* Dump all tokens in BUFFER to stderr. */
325 void
327 {
329 }
332 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
333 description for T. */
335 static void
337 {
339 {
342 }
343 }
346 /* Dump parser context C to FILE. */
348 static void
350 {
355 }
358 /* Print the stack of parsing contexts to FILE starting with FIRST. */
360 static void
362 {
368 {
371 }
372 }
375 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
377 static void
379 {
382 }
385 /* Print an unparsed function entry UF to FILE. */
387 static void
389 {
392 tree fn;
397 i++)
398 {
404 }
409 {
412 }
418 {
421 }
423 }
426 /* Print the stack of unparsed member functions S to FILE. */
428 static void
431 {
437 {
440 }
441 }
444 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
445 the given PARSER. If FILE is NULL, the output is printed on stderr. */
447 static void
449 {
461 next_token);
462 }
465 /* Dump debugging information for the given PARSER. If FILE is NULL,
466 the output is printed on stderr. */
468 void
470 {
473 expanded_location eloc;
547 }
550 /* Allocate memory for a new lexer object and return it. */
554 {
559 /* Allocate the memory. */
562 /* Initially we are not debugging. */
567 /* Create the buffer. */
571 }
574 /* Create a new main C++ lexer, the lexer that gets tokens from the
575 preprocessor. */
579 {
581 cp_token token;
583 /* It's possible that parsing the first pragma will load a PCH file,
584 which is a GC collection point. So we have to do that before
585 allocating any memory. */
590 /* Put the first token in the buffer. */
593 /* Get the remaining tokens from the preprocessor. */
595 {
598 }
607 /* Subsequent preprocessor diagnostics should use compiler
608 diagnostic functions to get the compiler source location. */
613 }
615 /* Create a new lexer whose token stream is primed with the tokens in
616 CACHE. When these tokens are exhausted, no new tokens will be read. */
620 {
625 /* We do not own the buffer. */
632 /* Initially we are not debugging. */
637 }
639 /* Frees all resources associated with LEXER. */
641 static void
643 {
647 }
649 /* Returns nonzero if debugging information should be output. */
653 {
655 }
660 {
664 }
668 {
670 }
674 {
676 }
680 {
683 else
685 }
689 {
693 }
695 /* nonzero if we are presently saving tokens. */
699 {
701 }
703 /* Store the next token from the preprocessor in *TOKEN. Return true
704 if we reach EOF. If LEXER is NULL, assume we are handling an
705 initial #pragma pch_preprocess, and thus want the lexer to return
706 processed strings. */
708 static void
710 {
713 /* Get a new token from the preprocessor. */
714 token->type
721 /* On some systems, some header files are surrounded by an
722 implicit extern "C" block. Set a flag in the token if it
723 comes from such a header. */
728 /* Check to see if this token is a keyword. */
730 {
732 {
733 /* Mark this token as a keyword. */
735 /* Record which keyword. */
737 }
738 else
739 {
743 {
744 /* Warn about the C++0x keyword (but still treat it as
745 an identifier). */
750 /* Clear out the C_RID_CODE so we don't warn about this
751 particular identifier-turned-keyword again. */
753 }
757 }
758 }
760 {
761 /* This only happens in Objective-C++; it must be a keyword. */
764 {
765 /* Replace 'class' with '@class', 'private' with '@private',
766 etc. This prevents confusion with the C++ keyword
767 'class', and makes the tokens consistent with other
768 Objective-C 'AT' keywords. For example '@class' is
769 reported as RID_AT_CLASS which is consistent with
770 '@synchronized', which is reported as
771 RID_AT_SYNCHRONIZED.
772 */
781 }
782 }
784 {
785 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
789 }
790 }
792 /* Update the globals input_location and the input file stack from TOKEN. */
795 {
797 {
799 }
800 }
802 /* Return a pointer to the next token in the token stream, but do not
803 consume it. */
807 {
809 {
813 }
815 }
817 /* Return true if the next token has the indicated TYPE. */
821 {
823 }
825 /* Return true if the next token does not have the indicated TYPE. */
829 {
831 }
833 /* Return true if the next token is the indicated KEYWORD. */
837 {
839 }
841 /* Return true if the next token is not the indicated KEYWORD. */
845 {
847 }
849 /* Return true if the next token is a keyword for a decl-specifier. */
851 static bool
853 {
858 {
859 /* auto specifier: storage-class-specifier in C++,
860 simple-type-specifier in C++0x. */
862 /* Storage classes. */
868 /* Elaborated type specifiers. */
874 /* Simple type specifiers. */
889 /* GNU extensions. */
892 /* C++0x extensions. */
899 }
900 }
902 /* Returns TRUE iff the token T begins a decltype type. */
904 static bool
906 {
909 }
911 /* Returns TRUE iff the next token begins a decltype type. */
913 static bool
915 {
918 }
920 /* Return a pointer to the Nth token in the token stream. If N is 1,
921 then this is precisely equivalent to cp_lexer_peek_token (except
922 that it is not inline). One would like to disallow that case, but
923 there is one case (cp_parser_nth_token_starts_template_id) where
924 the caller passes a variable for N and it might be 1. */
928 {
931 /* N is 1-based, not zero-based. */
942 {
945 {
948 }
952 }
955 {
958 }
961 }
963 /* Return the next token, and advance the lexer's next_token pointer
964 to point to the next non-purged token. */
968 {
974 do
975 {
978 {
981 }
983 }
988 /* Provide debugging output. */
990 {
994 }
997 }
999 /* Permanently remove the next token from the token stream, and
1000 advance the next_token pointer to refer to the next non-purged
1001 token. */
1003 static void
1005 {
1014 do
1015 {
1016 tok++;
1018 {
1021 }
1022 }
1025 }
1027 /* Permanently remove all tokens after TOK, up to, but not
1028 including, the token that will be returned next by
1029 cp_lexer_peek_token. */
1031 static void
1033 {
1042 {
1047 }
1048 }
1050 /* Begin saving tokens. All tokens consumed after this point will be
1051 preserved. */
1053 static void
1055 {
1056 /* Provide debugging output. */
1061 }
1063 /* Commit to the portion of the token stream most recently saved. */
1065 static void
1067 {
1068 /* Provide debugging output. */
1073 }
1075 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1076 to the token stream. Stop saving tokens. */
1078 static void
1080 {
1081 /* Provide debugging output. */
1086 }
1088 /* Print a representation of the TOKEN on the STREAM. */
1090 static void
1092 {
1093 /* We don't use cpp_type2name here because the parser defines
1094 a few tokens of its own. */
1096 /* cpplib-defined token types */
1097 #define OP(e, s) #e,
1098 #define TK(e, s) #e,
1099 TTYPE_TABLE
1100 #undef OP
1101 #undef TK
1102 /* C++ parser token types - see "Manifest constants", above. */
1106 };
1108 /* For some tokens, print the associated data. */
1110 {
1112 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1113 For example, `struct' is mapped to an INTEGER_CST. */
1116 /* else fall through */
1134 /* If we have a name for the token, print it out. Otherwise, we
1135 simply give the numeric code. */
1138 else
1141 }
1142 }
1144 /* Start emitting debugging information. */
1146 static void
1148 {
1151 }
1153 /* Stop emitting debugging information. */
1155 static void
1157 {
1160 }
1162 /* Create a new cp_token_cache, representing a range of tokens. */
1166 {
1171 }
1173 \f
1174 /* Decl-specifiers. */
1176 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1178 static void
1180 {
1182 }
1184 /* Declarators. */
1186 /* Nothing other than the parser should be creating declarators;
1187 declarators are a semi-syntactic representation of C++ entities.
1188 Other parts of the front end that need to create entities (like
1189 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1204 /* An erroneous declarator. */
1207 /* The obstack on which declarators and related data structures are
1208 allocated. */
1211 /* Alloc BYTES from the declarator memory pool. */
1215 {
1217 }
1219 /* Allocate a declarator of the indicated KIND. Clear fields that are
1220 common to all declarators. */
1224 {
1236 }
1238 /* Make a declarator for a generalized identifier. If
1239 QUALIFYING_SCOPE is non-NULL, the identifier is
1240 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1241 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1242 is, if any. */
1246 special_function_kind sfk)
1247 {
1250 /* It is valid to write:
1252 class C { void f(); };
1253 typedef C D;
1254 void D::f();
1256 The standard is not clear about whether `typedef const C D' is
1257 legal; as of 2002-09-15 the committee is considering that
1258 question. EDG 3.0 allows that syntax. Therefore, we do as
1259 well. */
1273 }
1275 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1276 of modifiers such as const or volatile to apply to the pointer
1277 type, represented as identifiers. ATTRIBUTES represent the attributes that
1278 appertain to the pointer or reference. */
1280 cp_declarator *
1282 tree attributes)
1283 {
1291 {
1295 }
1296 else
1302 }
1304 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1305 represent the attributes that appertain to the pointer or
1306 reference. */
1308 cp_declarator *
1311 {
1319 {
1323 }
1324 else
1330 }
1332 /* Like make_pointer_declarator -- but for a pointer to a non-static
1333 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1334 appertain to the pointer or reference. */
1336 cp_declarator *
1339 tree attributes)
1340 {
1349 {
1352 }
1353 else
1359 }
1361 /* Make a declarator for the function given by TARGET, with the
1362 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1363 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1364 indicates what exceptions can be thrown. */
1366 cp_declarator *
1368 tree parms,
1369 cp_cv_quals cv_qualifiers,
1370 cp_virt_specifiers virt_specifiers,
1371 tree exception_specification,
1372 tree late_return_type)
1373 {
1384 {
1388 }
1389 else
1393 }
1395 /* Make a declarator for an array of BOUNDS elements, each of which is
1396 defined by ELEMENT. */
1398 cp_declarator *
1400 {
1407 {
1411 }
1412 else
1416 }
1418 /* Determine whether the declarator we've seen so far can be a
1419 parameter pack, when followed by an ellipsis. */
1420 static bool
1422 {
1423 /* Search for a declarator name, or any other declarator that goes
1424 after the point where the ellipsis could appear in a parameter
1425 pack. If we find any of these, then this declarator can not be
1426 made into a parameter pack. */
1429 {
1431 {
1443 }
1444 }
1447 }
1451 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1452 DECLARATOR and DEFAULT_ARGUMENT. */
1454 cp_parameter_declarator *
1457 tree default_argument)
1458 {
1466 else
1473 }
1475 /* Returns true iff DECLARATOR is a declaration for a function. */
1477 static bool
1479 {
1481 {
1489 }
1491 }
1493 /* The parser. */
1495 /* Overview
1496 --------
1498 A cp_parser parses the token stream as specified by the C++
1499 grammar. Its job is purely parsing, not semantic analysis. For
1500 example, the parser breaks the token stream into declarators,
1501 expressions, statements, and other similar syntactic constructs.
1502 It does not check that the types of the expressions on either side
1503 of an assignment-statement are compatible, or that a function is
1504 not declared with a parameter of type `void'.
1506 The parser invokes routines elsewhere in the compiler to perform
1507 semantic analysis and to build up the abstract syntax tree for the
1508 code processed.
1510 The parser (and the template instantiation code, which is, in a
1511 way, a close relative of parsing) are the only parts of the
1512 compiler that should be calling push_scope and pop_scope, or
1513 related functions. The parser (and template instantiation code)
1514 keeps track of what scope is presently active; everything else
1515 should simply honor that. (The code that generates static
1516 initializers may also need to set the scope, in order to check
1517 access control correctly when emitting the initializers.)
1519 Methodology
1520 -----------
1522 The parser is of the standard recursive-descent variety. Upcoming
1523 tokens in the token stream are examined in order to determine which
1524 production to use when parsing a non-terminal. Some C++ constructs
1525 require arbitrary look ahead to disambiguate. For example, it is
1526 impossible, in the general case, to tell whether a statement is an
1527 expression or declaration without scanning the entire statement.
1528 Therefore, the parser is capable of "parsing tentatively." When the
1529 parser is not sure what construct comes next, it enters this mode.
1530 Then, while we attempt to parse the construct, the parser queues up
1531 error messages, rather than issuing them immediately, and saves the
1532 tokens it consumes. If the construct is parsed successfully, the
1533 parser "commits", i.e., it issues any queued error messages and
1534 the tokens that were being preserved are permanently discarded.
1535 If, however, the construct is not parsed successfully, the parser
1536 rolls back its state completely so that it can resume parsing using
1537 a different alternative.
1539 Future Improvements
1540 -------------------
1542 The performance of the parser could probably be improved substantially.
1543 We could often eliminate the need to parse tentatively by looking ahead
1544 a little bit. In some places, this approach might not entirely eliminate
1545 the need to parse tentatively, but it might still speed up the average
1546 case. */
1548 /* Flags that are passed to some parsing functions. These values can
1549 be bitwise-ored together. */
1551 enum
1552 {
1553 /* No flags. */
1555 /* The construct is optional. If it is not present, then no error
1556 should be issued. */
1558 /* When parsing a type-specifier, treat user-defined type-names
1559 as non-type identifiers. */
1561 /* When parsing a type-specifier, do not try to parse a class-specifier
1562 or enum-specifier. */
1564 /* When parsing a decl-specifier-seq, only allow type-specifier or
1565 constexpr. */
1567 };
1569 /* This type is used for parameters and variables which hold
1570 combinations of the above flags. */
1573 /* The different kinds of declarators we want to parse. */
1576 {
1577 /* We want an abstract declarator. */
1578 CP_PARSER_DECLARATOR_ABSTRACT,
1579 /* We want a named declarator. */
1580 CP_PARSER_DECLARATOR_NAMED,
1581 /* We don't mind, but the name must be an unqualified-id. */
1582 CP_PARSER_DECLARATOR_EITHER
1585 /* The precedence values used to parse binary expressions. The minimum value
1586 of PREC must be 1, because zero is reserved to quickly discriminate
1587 binary operators from other tokens. */
1589 enum cp_parser_prec
1590 {
1591 PREC_NOT_OPERATOR,
1592 PREC_LOGICAL_OR_EXPRESSION,
1593 PREC_LOGICAL_AND_EXPRESSION,
1594 PREC_INCLUSIVE_OR_EXPRESSION,
1595 PREC_EXCLUSIVE_OR_EXPRESSION,
1596 PREC_AND_EXPRESSION,
1597 PREC_EQUALITY_EXPRESSION,
1598 PREC_RELATIONAL_EXPRESSION,
1599 PREC_SHIFT_EXPRESSION,
1600 PREC_ADDITIVE_EXPRESSION,
1601 PREC_MULTIPLICATIVE_EXPRESSION,
1602 PREC_PM_EXPRESSION,
1603 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1604 };
1606 /* A mapping from a token type to a corresponding tree node type, with a
1607 precedence value. */
1610 {
1611 /* The token type. */
1613 /* The corresponding tree code. */
1615 /* The precedence of this operator. */
1620 {
1621 /* Left hand side of the binary operation we are currently
1622 parsing. */
1623 tree lhs;
1624 /* Original tree code for left hand side, if it was a binary
1625 expression itself (used for -Wparentheses). */
1627 /* Tree code for the binary operation we are parsing. */
1629 /* Precedence of the binary operation we are parsing. */
1631 /* Location of the binary operation we are parsing. */
1632 location_t loc;
1635 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1636 entries because precedence levels on the stack are monotonically
1637 increasing. */
1641 /* Prototypes. */
1643 /* Constructors and destructors. */
1648 /* Class variables. */
1652 /* The operator-precedence table used by cp_parser_binary_expression.
1653 Transformed into an associative array (binops_by_token) by
1654 cp_parser_new. */
1687 };
1689 /* The same as binops, but initialized by cp_parser_new so that
1690 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1691 for speed. */
1694 /* Constructors and destructors. */
1696 /* Construct a new context. The context below this one on the stack
1697 is given by NEXT. */
1701 {
1704 /* Allocate the storage. */
1706 {
1707 /* Pull the first entry from the free list. */
1711 }
1712 else
1715 /* No errors have occurred yet in this context. */
1717 /* If this is not the bottommost context, copy information that we
1718 need from the previous context. */
1720 {
1721 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1722 expression, then we are parsing one in this context, too. */
1724 /* Thread the stack. */
1726 }
1729 }
1731 /* Managing the unparsed function queues. */
1733 #define unparsed_funs_with_default_args \
1734 parser->unparsed_queues->last ().funs_with_default_args
1735 #define unparsed_funs_with_definitions \
1736 parser->unparsed_queues->last ().funs_with_definitions
1737 #define unparsed_nsdmis \
1738 parser->unparsed_queues->last ().nsdmis
1740 static void
1742 {
1745 }
1747 static void
1749 {
1752 }
1754 /* Prototypes. */
1756 /* Constructors and destructors. */
1761 /* Routines to parse various constructs.
1763 Those that return `tree' will return the error_mark_node (rather
1764 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1765 Sometimes, they will return an ordinary node if error-recovery was
1766 attempted, even though a parse error occurred. So, to check
1767 whether or not a parse error occurred, you should always use
1768 cp_parser_error_occurred. If the construct is optional (indicated
1769 either by an `_opt' in the name of the function that does the
1770 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1771 the construct is not present. */
1773 /* Lexical conventions [gram.lex] */
1775 static tree cp_parser_identifier
1777 static tree cp_parser_string_literal
1779 static tree cp_parser_userdef_char_literal
1781 static tree cp_parser_userdef_string_literal
1783 static tree cp_parser_userdef_numeric_literal
1786 /* Basic concepts [gram.basic] */
1788 static bool cp_parser_translation_unit
1791 /* Expressions [gram.expr] */
1793 static tree cp_parser_primary_expression
1795 static tree cp_parser_id_expression
1797 static tree cp_parser_unqualified_id
1799 static tree cp_parser_nested_name_specifier_opt
1801 static tree cp_parser_nested_name_specifier
1803 static tree cp_parser_qualifying_entity
1805 static tree cp_parser_postfix_expression
1807 static tree cp_parser_postfix_open_square_expression
1809 static tree cp_parser_postfix_dot_deref_expression
1813 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1815 static void cp_parser_pseudo_destructor_name
1817 static tree cp_parser_unary_expression
1819 static enum tree_code cp_parser_unary_operator
1821 static tree cp_parser_new_expression
1825 static tree cp_parser_new_type_id
1833 static tree cp_parser_delete_expression
1835 static tree cp_parser_cast_expression
1837 static tree cp_parser_binary_expression
1839 static tree cp_parser_question_colon_clause
1841 static tree cp_parser_assignment_expression
1843 static enum tree_code cp_parser_assignment_operator_opt
1845 static tree cp_parser_expression
1847 static tree cp_parser_constant_expression
1849 static tree cp_parser_builtin_offsetof
1851 static tree cp_parser_lambda_expression
1853 static void cp_parser_lambda_introducer
1855 static bool cp_parser_lambda_declarator_opt
1857 static void cp_parser_lambda_body
1860 /* Statements [gram.stmt.stmt] */
1862 static void cp_parser_statement
1864 static void cp_parser_label_for_labeled_statement
1866 static tree cp_parser_expression_statement
1868 static tree cp_parser_compound_statement
1870 static void cp_parser_statement_seq_opt
1872 static tree cp_parser_selection_statement
1874 static tree cp_parser_condition
1876 static tree cp_parser_iteration_statement
1878 static bool cp_parser_for_init_statement
1880 static tree cp_parser_for
1882 static tree cp_parser_c_for
1884 static tree cp_parser_range_for
1886 static void do_range_for_auto_deduction
1888 static tree cp_parser_perform_range_for_lookup
1890 static tree cp_parser_range_for_member_function
1892 static tree cp_parser_jump_statement
1894 static void cp_parser_declaration_statement
1897 static tree cp_parser_implicitly_scoped_statement
1899 static void cp_parser_already_scoped_statement
1902 /* Declarations [gram.dcl.dcl] */
1904 static void cp_parser_declaration_seq_opt
1906 static void cp_parser_declaration
1908 static void cp_parser_block_declaration
1910 static void cp_parser_simple_declaration
1912 static void cp_parser_decl_specifier_seq
1914 static tree cp_parser_storage_class_specifier_opt
1916 static tree cp_parser_function_specifier_opt
1918 static tree cp_parser_type_specifier
1921 static tree cp_parser_simple_type_specifier
1923 static tree cp_parser_type_name
1925 static tree cp_parser_nonclass_name
1927 static tree cp_parser_elaborated_type_specifier
1929 static tree cp_parser_enum_specifier
1931 static void cp_parser_enumerator_list
1933 static void cp_parser_enumerator_definition
1935 static tree cp_parser_namespace_name
1937 static void cp_parser_namespace_definition
1939 static void cp_parser_namespace_body
1941 static tree cp_parser_qualified_namespace_specifier
1943 static void cp_parser_namespace_alias_definition
1945 static bool cp_parser_using_declaration
1947 static void cp_parser_using_directive
1949 static tree cp_parser_alias_declaration
1951 static void cp_parser_asm_definition
1953 static void cp_parser_linkage_specification
1955 static void cp_parser_static_assert
1957 static tree cp_parser_decltype
1960 /* Declarators [gram.dcl.decl] */
1962 static tree cp_parser_init_declarator
1963 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
1968 static enum tree_code cp_parser_ptr_operator
1970 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1972 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1974 static tree cp_parser_late_return_type_opt
1976 static tree cp_parser_declarator_id
1978 static tree cp_parser_type_id
1980 static tree cp_parser_template_type_arg
1983 static tree cp_parser_type_id_1
1985 static void cp_parser_type_specifier_seq
1987 static tree cp_parser_parameter_declaration_clause
1989 static tree cp_parser_parameter_declaration_list
1993 static tree cp_parser_default_argument
1995 static void cp_parser_function_body
1997 static tree cp_parser_initializer
1999 static tree cp_parser_initializer_clause
2001 static tree cp_parser_braced_list
2006 static bool cp_parser_ctor_initializer_opt_and_function_body
2009 /* Classes [gram.class] */
2011 static tree cp_parser_class_name
2013 static tree cp_parser_class_specifier
2015 static tree cp_parser_class_head
2017 static enum tag_types cp_parser_class_key
2019 static void cp_parser_member_specification_opt
2021 static void cp_parser_member_declaration
2023 static tree cp_parser_pure_specifier
2025 static tree cp_parser_constant_initializer
2028 /* Derived classes [gram.class.derived] */
2030 static tree cp_parser_base_clause
2032 static tree cp_parser_base_specifier
2035 /* Special member functions [gram.special] */
2037 static tree cp_parser_conversion_function_id
2039 static tree cp_parser_conversion_type_id
2043 static bool cp_parser_ctor_initializer_opt
2045 static void cp_parser_mem_initializer_list
2047 static tree cp_parser_mem_initializer
2049 static tree cp_parser_mem_initializer_id
2052 /* Overloading [gram.over] */
2054 static tree cp_parser_operator_function_id
2056 static tree cp_parser_operator
2059 /* Templates [gram.temp] */
2061 static void cp_parser_template_declaration
2063 static tree cp_parser_template_parameter_list
2065 static tree cp_parser_template_parameter
2067 static tree cp_parser_type_parameter
2069 static tree cp_parser_template_id
2071 static tree cp_parser_template_name
2073 static tree cp_parser_template_argument_list
2075 static tree cp_parser_template_argument
2077 static void cp_parser_explicit_instantiation
2079 static void cp_parser_explicit_specialization
2082 /* Exception handling [gram.exception] */
2084 static tree cp_parser_try_block
2086 static bool cp_parser_function_try_block
2088 static void cp_parser_handler_seq
2090 static void cp_parser_handler
2092 static tree cp_parser_exception_declaration
2094 static tree cp_parser_throw_expression
2096 static tree cp_parser_exception_specification_opt
2098 static tree cp_parser_type_id_list
2101 /* GNU Extensions */
2103 static tree cp_parser_asm_specification_opt
2105 static tree cp_parser_asm_operand_list
2107 static tree cp_parser_asm_clobber_list
2109 static tree cp_parser_asm_label_list
2111 static bool cp_next_tokens_can_be_attribute_p
2113 static bool cp_next_tokens_can_be_gnu_attribute_p
2115 static bool cp_next_tokens_can_be_std_attribute_p
2117 static bool cp_nth_tokens_can_be_std_attribute_p
2119 static bool cp_nth_tokens_can_be_gnu_attribute_p
2121 static bool cp_nth_tokens_can_be_attribute_p
2123 static tree cp_parser_attributes_opt
2125 static tree cp_parser_gnu_attributes_opt
2127 static tree cp_parser_gnu_attribute_list
2129 static tree cp_parser_std_attribute
2131 static tree cp_parser_std_attribute_spec
2133 static tree cp_parser_std_attribute_spec_seq
2135 static bool cp_parser_extension_opt
2137 static void cp_parser_label_declaration
2140 /* Transactional Memory Extensions */
2142 static tree cp_parser_transaction
2144 static tree cp_parser_transaction_expression
2146 static bool cp_parser_function_transaction
2148 static tree cp_parser_transaction_cancel
2152 static bool cp_parser_pragma
2155 /* Objective-C++ Productions */
2157 static tree cp_parser_objc_message_receiver
2159 static tree cp_parser_objc_message_args
2161 static tree cp_parser_objc_message_expression
2163 static tree cp_parser_objc_encode_expression
2165 static tree cp_parser_objc_defs_expression
2167 static tree cp_parser_objc_protocol_expression
2169 static tree cp_parser_objc_selector_expression
2171 static tree cp_parser_objc_expression
2173 static bool cp_parser_objc_selector_p
2175 static tree cp_parser_objc_selector
2177 static tree cp_parser_objc_protocol_refs_opt
2179 static void cp_parser_objc_declaration
2181 static tree cp_parser_objc_statement
2183 static bool cp_parser_objc_valid_prefix_attributes
2185 static void cp_parser_objc_at_property_declaration
2187 static void cp_parser_objc_at_synthesize_declaration
2189 static void cp_parser_objc_at_dynamic_declaration
2191 static tree cp_parser_objc_struct_declaration
2194 /* Utility Routines */
2196 static tree cp_parser_lookup_name
2198 static tree cp_parser_lookup_name_simple
2200 static tree cp_parser_maybe_treat_template_as_class
2202 static bool cp_parser_check_declarator_template_parameters
2204 static bool cp_parser_check_template_parameters
2206 static tree cp_parser_simple_cast_expression
2208 static tree cp_parser_global_scope_opt
2210 static bool cp_parser_constructor_declarator_p
2212 static tree cp_parser_function_definition_from_specifiers_and_declarator
2214 static tree cp_parser_function_definition_after_declarator
2216 static void cp_parser_template_declaration_after_export
2218 static void cp_parser_perform_template_parameter_access_checks
2220 static tree cp_parser_single_declaration
2222 static tree cp_parser_functional_cast
2224 static tree cp_parser_save_member_function_body
2226 static tree cp_parser_save_nsdmi
2228 static tree cp_parser_enclosed_template_argument_list
2230 static void cp_parser_save_default_args
2232 static void cp_parser_late_parsing_for_member
2234 static tree cp_parser_late_parse_one_default_arg
2236 static void cp_parser_late_parsing_nsdmi
2238 static void cp_parser_late_parsing_default_args
2240 static tree cp_parser_sizeof_operand
2242 static tree cp_parser_trait_expr
2244 static bool cp_parser_declares_only_class_p
2246 static void cp_parser_set_storage_class
2248 static void cp_parser_set_decl_spec_type
2250 static void set_and_check_decl_spec_loc
2253 static bool cp_parser_friend_p
2255 static void cp_parser_required_error
2261 static bool cp_parser_token_starts_function_definition_p
2263 static bool cp_parser_next_token_starts_class_definition_p
2265 static bool cp_parser_next_token_ends_template_argument_p
2267 static bool cp_parser_nth_token_starts_template_argument_list_p
2269 static enum tag_types cp_parser_token_is_class_key
2271 static void cp_parser_check_class_key
2273 static void cp_parser_check_access_in_redeclaration
2275 static bool cp_parser_optional_template_keyword
2277 static void cp_parser_pre_parsed_nested_name_specifier
2279 static bool cp_parser_cache_group
2281 static tree cp_parser_cache_defarg
2283 static void cp_parser_parse_tentatively
2285 static void cp_parser_commit_to_tentative_parse
2287 static void cp_parser_abort_tentative_parse
2289 static bool cp_parser_parse_definitely
2293 static bool cp_parser_uncommitted_to_tentative_parse_p
2295 static void cp_parser_error
2297 static void cp_parser_name_lookup_error
2299 static bool cp_parser_simulate_error
2301 static bool cp_parser_check_type_definition
2303 static void cp_parser_check_for_definition_in_return_type
2305 static void cp_parser_check_for_invalid_template_id
2307 static bool cp_parser_non_integral_constant_expression
2309 static void cp_parser_diagnose_invalid_type_name
2311 static bool cp_parser_parse_and_diagnose_invalid_type_name
2313 static int cp_parser_skip_to_closing_parenthesis
2315 static void cp_parser_skip_to_end_of_statement
2317 static void cp_parser_consume_semicolon_at_end_of_statement
2319 static void cp_parser_skip_to_end_of_block_or_statement
2321 static bool cp_parser_skip_to_closing_brace
2323 static void cp_parser_skip_to_end_of_template_parameter_list
2325 static void cp_parser_skip_to_pragma_eol
2327 static bool cp_parser_error_occurred
2329 static bool cp_parser_allow_gnu_extensions_p
2331 static bool cp_parser_is_pure_string_literal
2333 static bool cp_parser_is_string_literal
2335 static bool cp_parser_is_keyword
2337 static tree cp_parser_make_typename_type
2342 /* Returns nonzero if we are parsing tentatively. */
2346 {
2348 }
2350 /* Returns nonzero if TOKEN is a string literal. */
2352 static bool
2354 {
2360 }
2362 /* Returns nonzero if TOKEN is a string literal
2363 of a user-defined string literal. */
2365 static bool
2367 {
2374 }
2376 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2378 static bool
2380 {
2382 }
2384 /* If not parsing tentatively, issue a diagnostic of the form
2385 FILE:LINE: MESSAGE before TOKEN
2386 where TOKEN is the next token in the input stream. MESSAGE
2387 (specified by the caller) is usually of the form "expected
2388 OTHER-TOKEN". */
2390 static void
2392 {
2394 {
2396 /* This diagnostic makes more sense if it is tagged to the line
2397 of the token we just peeked at. */
2401 {
2406 }
2409 /* Because c_parser_error does not understand
2410 CPP_KEYWORD, keywords are treated like
2411 identifiers. */
2414 }
2415 }
2417 /* Issue an error about name-lookup failing. NAME is the
2418 IDENTIFIER_NODE DECL is the result of
2419 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2420 the thing that we hoped to find. */
2422 static void
2424 tree name,
2425 tree decl,
2426 name_lookup_error desired,
2427 location_t location)
2428 {
2429 /* If name lookup completely failed, tell the user that NAME was not
2430 declared. */
2432 {
2445 else
2447 }
2449 {
2451 {
2468 }
2469 }
2471 {
2473 {
2483 name);
2487 }
2488 }
2489 else
2490 {
2492 {
2505 }
2506 }
2507 }
2509 /* If we are parsing tentatively, remember that an error has occurred
2510 during this tentative parse. Returns true if the error was
2511 simulated; false if a message should be issued by the caller. */
2513 static bool
2515 {
2517 {
2520 }
2522 }
2524 /* This function is called when a type is defined. If type
2525 definitions are forbidden at this point, an error message is
2526 issued. */
2528 static bool
2530 {
2531 /* If types are forbidden here, issue a message. */
2533 {
2534 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2535 in the message need to be interpreted. */
2538 }
2540 }
2542 /* This function is called when the DECLARATOR is processed. The TYPE
2543 was a type defined in the decl-specifiers. If it is invalid to
2544 define a type in the decl-specifiers for DECLARATOR, an error is
2545 issued. TYPE_LOCATION is the location of TYPE and is used
2546 for error reporting. */
2548 static void
2551 {
2552 /* [dcl.fct] forbids type definitions in return types.
2553 Unfortunately, it's not easy to know whether or not we are
2554 processing a return type until after the fact. */
2562 {
2567 type);
2568 }
2569 }
2571 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2572 "<" in any valid C++ program. If the next token is indeed "<",
2573 issue a message warning the user about what appears to be an
2574 invalid attempt to form a template-id. LOCATION is the location
2575 of the type-specifier (TYPE) */
2577 static void
2579 tree type,
2581 location_t location)
2582 {
2586 {
2590 {
2593 else
2595 }
2596 else
2598 /* Remember the location of the invalid "<". */
2601 /* Consume the "<". */
2603 /* Parse the template arguments. */
2605 /* Permanently remove the invalid template arguments so that
2606 this error message is not issued again. */
2609 }
2610 }
2612 /* If parsing an integral constant-expression, issue an error message
2613 about the fact that THING appeared and return true. Otherwise,
2614 return false. In either case, set
2615 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2617 static bool
2619 non_integral_constant thing)
2620 {
2623 {
2625 {
2628 {
2635 "enumeration type cannot appear in a "
2726 }
2730 }
2731 }
2733 }
2735 /* Emit a diagnostic for an invalid type name. SCOPE is the
2736 qualifying scope (or NULL, if none) for ID. This function commits
2737 to the current active tentative parse, if any. (Otherwise, the
2738 problematic construct might be encountered again later, resulting
2739 in duplicate error messages.) LOCATION is the location of ID. */
2741 static void
2744 location_t location)
2745 {
2748 /* Try to lookup the identifier. */
2753 /* If the lookup found a template-name, it means that the user forgot
2754 to specify an argument list. Emit a useful error message. */
2758 decl);
2762 /* Something like 'unsigned A a;' */
2765 {
2766 /* Issue an error message. */
2768 /* If we're in a template class, it's possible that the user was
2769 referring to a type from a base class. For example:
2771 template <typename T> struct A { typedef T X; };
2772 template <typename T> struct B : public A<T> { X x; };
2774 The user should have said "typename A<T>::X". */
2780 {
2781 tree b;
2784 b;
2786 {
2790 {
2791 tree field;
2792 /* Go from a particular instantiation of the
2793 template (which will have an empty TYPE_FIELDs),
2794 to the main version. */
2797 field;
2801 {
2806 }
2809 }
2810 }
2811 }
2812 }
2813 /* Here we diagnose qualified-ids where the scope is actually correct,
2814 but the identifier does not resolve to a valid type name. */
2816 {
2822 {
2823 /* A<T>::A<T>() */
2829 }
2838 else
2840 }
2841 }
2843 /* Check for a common situation where a type-name should be present,
2844 but is not, and issue a sensible error message. Returns true if an
2845 invalid type-name was detected.
2847 The situation handled by this function are variable declarations of the
2848 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2849 Usually, `ID' should name a type, but if we got here it means that it
2850 does not. We try to emit the best possible error message depending on
2851 how exactly the id-expression looks like. */
2853 static bool
2855 {
2856 tree id;
2859 /* Avoid duplicate error about ambiguous lookup. */
2861 {
2865 }
2874 /* If the next token is a (, this is a function with no explicit return
2875 type, i.e. constructor, destructor or conversion op. */
2878 {
2881 }
2885 /* Emit a diagnostic for the invalid type. */
2888 out:
2889 /* If we aren't in the middle of a declarator (i.e. in a
2890 parameter-declaration-clause), skip to the end of the declaration;
2891 there's no point in trying to process it. */
2895 }
2897 /* Consume tokens up to, and including, the next non-nested closing `)'.
2898 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2899 are doing error recovery. Returns -1 if OR_COMMA is true and we
2900 found an unnested comma. */
2902 static int
2907 {
2917 {
2921 {
2924 /* If we've run out of tokens, then there is no closing `)'. */
2927 /* This is good for lambda expression capture-lists. */
2937 /* This matches the processing in skip_to_end_of_statement. */
2963 {
2967 }
2972 }
2974 /* Consume the token. */
2976 }
2977 }
2979 /* Consume tokens until we reach the end of the current statement.
2980 Normally, that will be just before consuming a `;'. However, if a
2981 non-nested `}' comes first, then we stop before consuming that. */
2983 static void
2985 {
2989 {
2993 {
2996 /* If we've run out of tokens, stop. */
3000 /* If the next token is a `;', we have reached the end of the
3001 statement. */
3007 /* If this is a non-nested '}', stop before consuming it.
3008 That way, when confronted with something like:
3010 { 3 + }
3012 we stop before consuming the closing '}', even though we
3013 have not yet reached a `;'. */
3017 /* If it is the closing '}' for a block that we have
3018 scanned, stop -- but only after consuming the token.
3019 That way given:
3021 void f g () { ... }
3022 typedef int I;
3024 we will stop after the body of the erroneously declared
3025 function, but before consuming the following `typedef'
3026 declaration. */
3028 {
3031 }
3039 }
3041 /* Consume the token. */
3043 }
3044 }
3046 /* This function is called at the end of a statement or declaration.
3047 If the next token is a semicolon, it is consumed; otherwise, error
3048 recovery is attempted. */
3050 static void
3052 {
3053 /* Look for the trailing `;'. */
3055 {
3056 /* If there is additional (erroneous) input, skip to the end of
3057 the statement. */
3059 /* If the next token is now a `;', consume it. */
3062 }
3063 }
3065 /* Skip tokens until we have consumed an entire block, or until we
3066 have consumed a non-nested `;'. */
3068 static void
3070 {
3074 {
3078 {
3081 /* If we've run out of tokens, stop. */
3085 /* Stop if this is an unnested ';'. */
3091 /* Stop if this is an unnested '}', or closes the outermost
3092 nesting level. */
3093 nesting_depth--;
3101 /* Nest. */
3102 nesting_depth++;
3107 }
3109 /* Consume the token. */
3111 }
3112 }
3114 /* Skip tokens until a non-nested closing curly brace is the next
3115 token, or there are no more tokens. Return true in the first case,
3116 false otherwise. */
3118 static bool
3120 {
3124 {
3128 {
3131 /* If we've run out of tokens, stop. */
3135 /* If the next token is a non-nested `}', then we have reached
3136 the end of the current block. */
3142 /* If it the next token is a `{', then we are entering a new
3143 block. Consume the entire block. */
3149 }
3151 /* Consume the token. */
3153 }
3154 }
3156 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3157 parameter is the PRAGMA token, allowing us to purge the entire pragma
3158 sequence. */
3160 static void
3162 {
3167 do
3171 /* Ensure that the pragma is not parsed again. */
3173 }
3175 /* Require pragma end of line, resyncing with it as necessary. The
3176 arguments are as for cp_parser_skip_to_pragma_eol. */
3178 static void
3180 {
3184 }
3186 /* This is a simple wrapper around make_typename_type. When the id is
3187 an unresolved identifier node, we can provide a superior diagnostic
3188 using cp_parser_diagnose_invalid_type_name. */
3190 static tree
3193 {
3194 tree result;
3196 {
3202 }
3204 }
3206 /* This is a wrapper around the
3207 make_{pointer,ptrmem,reference}_declarator functions that decides
3208 which one to call based on the CODE and CLASS_TYPE arguments. The
3209 CODE argument should be one of the values returned by
3210 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3211 appertain to the pointer or reference. */
3215 cp_cv_quals cv_qualifiers,
3217 tree attributes)
3218 {
3225 else
3235 }
3237 /* Create a new C++ parser. */
3241 {
3246 /* cp_lexer_new_main is called before doing GC allocation because
3247 cp_lexer_new_main might load a PCH file. */
3250 /* Initialize the binops_by_token so that we can get the tree
3251 directly from the token. */
3259 /* For now, we always accept GNU extensions. */
3262 /* The `>' token is a greater-than operator, not the end of a
3263 template-id. */
3268 /* We are not parsing a constant-expression. */
3273 /* Local variable names are not forbidden. */
3276 /* We are not processing an `extern "C"' declaration. */
3279 /* We are not processing a declarator. */
3282 /* We are not processing a template-argument-list. */
3285 /* We are not in an iteration statement. */
3288 /* We are not in a switch statement. */
3291 /* We are not parsing a type-id inside an expression. */
3294 /* Declarations aren't implicitly extern "C". */
3297 /* String literals should be translated to the execution character set. */
3300 /* We are not parsing a function body. */
3303 /* We can correct until told otherwise. */
3306 /* The unparsed function queue is empty. */
3309 /* There are no classes being defined. */
3312 /* No template parameters apply. */
3316 }
3318 /* Create a cp_lexer structure which will emit the tokens in CACHE
3319 and push it onto the parser's lexer stack. This is used for delayed
3320 parsing of in-class method bodies and default arguments, and should
3321 not be confused with tentative parsing. */
3322 static void
3324 {
3329 /* Move the current source position to that of the first token in the
3330 new lexer. */
3332 }
3334 /* Pop the top lexer off the parser stack. This is never used for the
3335 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3336 static void
3338 {
3343 /* Put the current source position back where it was before this
3344 lexer was pushed. */
3346 }
3348 /* Lexical conventions [gram.lex] */
3350 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3351 identifier. */
3353 static tree
3355 {
3358 /* Look for the identifier. */
3360 /* Return the value. */
3362 }
3364 /* Parse a sequence of adjacent string constants. Returns a
3365 TREE_STRING representing the combined, nul-terminated string
3366 constant. If TRANSLATE is true, translate the string to the
3367 execution character set. If WIDE_OK is true, a wide string is
3368 invalid here.
3370 C++98 [lex.string] says that if a narrow string literal token is
3371 adjacent to a wide string literal token, the behavior is undefined.
3372 However, C99 6.4.5p4 says that this results in a wide string literal.
3373 We follow C99 here, for consistency with the C front end.
3375 This code is largely lifted from lex_string() in c-lex.c.
3377 FUTURE: ObjC++ will need to handle @-strings here. */
3378 static tree
3380 {
3381 tree value;
3388 tree string_tree;
3394 {
3397 }
3400 {
3404 }
3405 else
3406 {
3409 }
3412 /* Try to avoid the overhead of creating and destroying an obstack
3413 for the common case of just one string. */
3416 {
3424 {
3428 }
3429 else
3433 }
3434 else
3435 {
3439 do
3440 {
3442 count++;
3447 {
3450 {
3453 }
3456 {
3461 }
3463 }
3464 else
3468 {
3473 "unsupported non-standard concatenation "
3475 }
3481 {
3485 }
3486 else
3487 {
3491 }
3492 }
3496 }
3499 {
3502 }
3506 {
3511 {
3526 }
3531 {
3535 }
3536 }
3537 else
3538 /* cpp_interpret_string has issued an error. */
3545 }
3547 /* Look up a literal operator with the name and the exact arguments. */
3549 static tree
3551 {
3558 {
3565 {
3568 {
3578 }
3581 /* May be this should be sufficient_parms_p instead,
3582 depending on how exactly should user-defined literals
3583 work in presence of default arguments on the literal
3584 operator parameters. */
3587 }
3588 }
3591 }
3593 /* Parse a user-defined char constant. Returns a call to a user-defined
3594 literal operator taking the character as an argument. */
3596 static tree
3598 {
3606 /* Build up a call to the user-defined operator */
3607 /* Lookup the name we got back from the id-expression. */
3612 {
3617 }
3626 }
3628 /* A subroutine of cp_parser_userdef_numeric_literal to
3629 create a char... template parameter pack from a string node. */
3631 static tree
3633 {
3634 tree charvec;
3640 /* Fill in CHARVEC with all of the parameters. */
3645 /* Build the argument packs. */
3652 }
3654 /* Parse a user-defined numeric constant. returns a call to a user-defined
3655 literal operator. */
3657 static tree
3659 {
3669 /* Look for a literal operator taking the exact type of numeric argument
3670 as the literal value. */
3675 {
3678 {
3681 }
3682 }
3685 /* If the numeric argument didn't work, look for a raw literal
3686 operator taking a const char* argument consisting of the number
3687 in string format. */
3692 {
3695 {
3698 }
3699 }
3702 /* If the raw literal didn't work, look for a non-type template
3703 function with parameter pack char.... Call the function with
3704 template parameter characters representing the number. */
3708 {
3713 {
3716 }
3717 }
3722 }
3724 /* Parse a user-defined string constant. Returns a call to a user-defined
3725 literal operator taking a character pointer and the length of the string
3726 as arguments. */
3728 static tree
3730 {
3739 /* Build up a call to the user-defined operator */
3740 /* Lookup the name we got back from the id-expression. */
3746 {
3750 }
3759 }
3762 /* Basic concepts [gram.basic] */
3764 /* Parse a translation-unit.
3766 translation-unit:
3767 declaration-seq [opt]
3769 Returns TRUE if all went well. */
3771 static bool
3773 {
3774 /* The address of the first non-permanent object on the declarator
3775 obstack. */
3780 /* Create the declarator obstack, if necessary. */
3782 {
3784 /* Create the error declarator. */
3786 /* Create the empty parameter list. */
3788 /* Remember where the base of the declarator obstack lies. */
3790 }
3794 /* If there are no tokens left then all went well. */
3796 {
3797 /* Get rid of the token array; we don't need it any more. */
3801 /* This file might have been a context that's implicitly extern
3802 "C". If so, pop the lang context. (Only relevant for PCH.) */
3804 {
3807 }
3809 /* Finish up. */
3813 }
3814 else
3815 {
3818 }
3820 /* Make sure the declarator obstack was fully cleaned up. */
3824 /* All went well. */
3826 }
3828 /* Expressions [gram.expr] */
3830 /* Parse a primary-expression.
3832 primary-expression:
3833 literal
3834 this
3835 ( expression )
3836 id-expression
3838 GNU Extensions:
3840 primary-expression:
3841 ( compound-statement )
3842 __builtin_va_arg ( assignment-expression , type-id )
3843 __builtin_offsetof ( type-id , offsetof-expression )
3845 C++ Extensions:
3846 __has_nothrow_assign ( type-id )
3847 __has_nothrow_constructor ( type-id )
3848 __has_nothrow_copy ( type-id )
3849 __has_trivial_assign ( type-id )
3850 __has_trivial_constructor ( type-id )
3851 __has_trivial_copy ( type-id )
3852 __has_trivial_destructor ( type-id )
3853 __has_virtual_destructor ( type-id )
3854 __is_abstract ( type-id )
3855 __is_base_of ( type-id , type-id )
3856 __is_class ( type-id )
3857 __is_convertible_to ( type-id , type-id )
3858 __is_empty ( type-id )
3859 __is_enum ( type-id )
3860 __is_final ( type-id )
3861 __is_literal_type ( type-id )
3862 __is_pod ( type-id )
3863 __is_polymorphic ( type-id )
3864 __is_std_layout ( type-id )
3865 __is_trivial ( type-id )
3866 __is_union ( type-id )
3868 Objective-C++ Extension:
3870 primary-expression:
3871 objc-expression
3873 literal:
3874 __null
3876 ADDRESS_P is true iff this expression was immediately preceded by
3877 "&" and therefore might denote a pointer-to-member. CAST_P is true
3878 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3879 true iff this expression is a template argument.
3881 Returns a representation of the expression. Upon return, *IDK
3882 indicates what kind of id-expression (if any) was present. */
3884 static tree
3890 {
3893 /* Assume the primary expression is not an id-expression. */
3896 /* Peek at the next token. */
3899 {
3900 /* literal:
3901 integer-literal
3902 character-literal
3903 floating-literal
3904 string-literal
3905 boolean-literal
3906 pointer-literal
3907 user-defined-literal */
3917 {
3921 }
3922 /* Floating-point literals are only allowed in an integral
3923 constant expression if they are cast to an integral or
3924 enumeration type. */
3928 {
3929 /* CAST_P will be set even in invalid code like "int(2.7 +
3930 ...)". Therefore, we have to check that the next token
3931 is sure to end the cast. */
3933 {
3938 enumerator-definition. */
3940 /* The curly brace at the end of an enum-specifier. */
3942 /* The end of a statement. */
3944 /* The end of the cast-expression. */
3946 /* The end of an array bound. */
3948 /* The closing ">" in a template-argument-list. */
3951 /* C++0x only: A ">>" treated like two ">" tokens,
3952 in a template-argument-list. */
3957 }
3959 /* If we are within a cast, then the constraint that the
3960 cast is to an integral or enumeration type will be
3961 checked at that point. If we are not within a cast, then
3962 this code is invalid. */
3965 }
3984 /* ??? Should wide strings be allowed when parser->translate_strings_p
3985 is false (i.e. in attributes)? If not, we can kill the third
3986 argument to cp_parser_string_literal. */
3992 {
3993 tree expr;
3996 /* Consume the `('. */
3998 /* Within a parenthesized expression, a `>' token is always
3999 the greater-than operator. */
4000 saved_greater_than_is_operator_p
4003 /* If we see `( { ' then we are looking at the beginning of
4004 a GNU statement-expression. */
4007 {
4008 /* Statement-expressions are not allowed by the standard. */
4012 /* And they're not allowed outside of a function-body; you
4013 cannot, for example, write:
4015 int i = ({ int j = 3; j + 1; });
4017 at class or namespace scope. */
4020 {
4022 "statement-expressions are not allowed outside "
4026 }
4027 else
4028 {
4029 /* Start the statement-expression. */
4031 /* Parse the compound-statement. */
4033 /* Finish up. */
4035 }
4036 }
4037 else
4038 {
4039 /* Parse the parenthesized expression. */
4041 /* Let the front end know that this expression was
4042 enclosed in parentheses. This matters in case, for
4043 example, the expression is of the form `A::B', since
4044 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4045 not. */
4047 /* DR 705: Wrapping an unqualified name in parentheses
4048 suppresses arg-dependent lookup. We want to pass back
4049 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4050 (c++/37862), but none of the others. */
4053 }
4054 /* The `>' token might be the end of a template-id or
4055 template-parameter-list now. */
4056 parser->greater_than_is_operator_p
4058 /* Consume the `)'. */
4063 }
4067 /* We have an Objective-C++ message. */
4069 {
4071 /* Don't warn about a failed tentative parse. */
4076 }
4080 /* We have an Objective-C++ string literal. */
4087 {
4088 /* These two are the boolean literals. */
4096 /* The `__null' literal. */
4101 /* The `nullptr' literal. */
4106 /* Recognize the `this' keyword. */
4110 {
4114 }
4115 /* Pointers cannot appear in constant-expressions. */
4120 /* The `operator' keyword can be the beginning of an
4121 id-expression. */
4128 {
4129 non_integral_constant name;
4131 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4132 __func__ are the names of variables -- but they are
4133 treated specially. Therefore, they are handled here,
4134 rather than relying on the generic id-expression logic
4135 below. Grammatically, these names are id-expressions.
4137 Consume the token. */
4141 {
4153 }
4158 /* Look up the name. */
4160 }
4163 {
4164 tree expression;
4165 tree type;
4166 source_location type_location;
4168 /* The `__builtin_va_arg' construct is used to handle
4169 `va_arg'. Consume the `__builtin_va_arg' token. */
4171 /* Look for the opening `('. */
4173 /* Now, parse the assignment-expression. */
4176 /* Look for the `,'. */
4179 /* Parse the type-id. */
4181 /* Look for the closing `)'. */
4183 /* Using `va_arg' in a constant-expression is not
4184 allowed. */
4186 NIC_VA_ARG))
4189 }
4217 /* Objective-C++ expressions. */
4227 {
4232 }
4236 }
4238 /* An id-expression can start with either an identifier, a
4239 `::' as the beginning of a qualified-id, or the "operator"
4240 keyword. */
4245 {
4246 tree id_expression;
4247 tree decl;
4253 id_expression:
4254 /* Parse the id-expression. */
4255 id_expression
4272 /* If we have a template-id, then no further lookup is
4273 required. If the template-id was for a template-class, we
4274 will sometimes have a TYPE_DECL at this point. */
4278 /* Look up the name. */
4279 else
4280 {
4281 tree ambiguous_decls;
4283 /* If we already know that this lookup is ambiguous, then
4284 we've already issued an error message; there's no reason
4285 to check again. */
4288 {
4291 }
4294 none_type,
4295 template_p,
4300 /* If the lookup was ambiguous, an error will already have
4301 been issued. */
4305 /* In Objective-C++, we may have an Objective-C 2.0
4306 dot-syntax for classes here. */
4311 {
4312 tree component;
4319 }
4321 /* In Objective-C++, an instance variable (ivar) may be preferred
4322 to whatever cp_parser_lookup_name() found. */
4325 /* If name lookup gives us a SCOPE_REF, then the
4326 qualifying scope was dependent. */
4328 {
4329 /* At this point, we do not know if DECL is a valid
4330 integral constant expression. We assume that it is
4331 in fact such an expression, so that code like:
4333 template <int N> struct A {
4334 int a[B<N>::i];
4335 };
4337 is accepted. At template-instantiation time, we
4338 will check that B<N>::i is actually a constant. */
4340 }
4341 /* Check to see if DECL is a local variable in a context
4342 where that is forbidden. */
4345 {
4346 /* It might be that we only found DECL because we are
4347 trying to be generous with pre-ISO scoping rules.
4348 For example, consider:
4350 int i;
4351 void g() {
4352 for (int i = 0; i < 10; ++i) {}
4353 extern void f(int j = i);
4354 }
4356 Here, name look up will originally find the out
4357 of scope `i'. We need to issue a warning message,
4358 but then use the global `i'. */
4361 {
4364 decl);
4366 }
4367 }
4368 }
4370 decl = (finish_id_expression
4372 idk,
4377 template_arg_p,
4383 }
4385 /* Anything else is an error. */
4389 }
4390 }
4392 /* Parse an id-expression.
4394 id-expression:
4395 unqualified-id
4396 qualified-id
4398 qualified-id:
4399 :: [opt] nested-name-specifier template [opt] unqualified-id
4400 :: identifier
4401 :: operator-function-id
4402 :: template-id
4404 Return a representation of the unqualified portion of the
4405 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4406 a `::' or nested-name-specifier.
4408 Often, if the id-expression was a qualified-id, the caller will
4409 want to make a SCOPE_REF to represent the qualified-id. This
4410 function does not do this in order to avoid wastefully creating
4411 SCOPE_REFs when they are not required.
4413 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4414 `template' keyword.
4416 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4417 uninstantiated templates.
4419 If *TEMPLATE_P is non-NULL, it is set to true iff the
4420 `template' keyword is used to explicitly indicate that the entity
4421 named is a template.
4423 If DECLARATOR_P is true, the id-expression is appearing as part of
4424 a declarator, rather than as part of an expression. */
4426 static tree
4433 {
4437 /* Assume the `template' keyword was not used. */
4441 /* Look for the optional `::' operator. */
4442 global_scope_p
4445 /* Look for the optional nested-name-specifier. */
4446 nested_name_specifier_p
4449 check_dependency_p,
4451 declarator_p)
4453 /* If there is a nested-name-specifier, then we are looking at
4454 the first qualified-id production. */
4456 {
4457 tree saved_scope;
4458 tree saved_object_scope;
4459 tree saved_qualifying_scope;
4460 tree unqualified_id;
4463 /* See if the next token is the `template' keyword. */
4467 /* Name lookup we do during the processing of the
4468 unqualified-id might obliterate SCOPE. */
4472 /* Process the final unqualified-id. */
4474 check_dependency_p,
4475 declarator_p,
4477 /* Restore the SAVED_SCOPE for our caller. */
4483 }
4484 /* Otherwise, if we are in global scope, then we are looking at one
4485 of the other qualified-id productions. */
4487 {
4489 tree id;
4491 /* Peek at the next token. */
4494 /* If it's an identifier, and the next token is not a "<", then
4495 we can avoid the template-id case. This is an optimization
4496 for this common case. */
4498 && !cp_parser_nth_token_starts_template_argument_list_p
4503 /* Try a template-id. */
4507 none_type,
4508 declarator_p);
4509 /* If that worked, we're done. */
4513 /* Peek at the next token. (Changes in the token buffer may
4514 have invalidated the pointer obtained above.) */
4518 {
4525 /* Fall through. */
4530 }
4531 }
4532 else
4535 declarator_p,
4536 optional_p);
4537 }
4539 /* Parse an unqualified-id.
4541 unqualified-id:
4542 identifier
4543 operator-function-id
4544 conversion-function-id
4545 ~ class-name
4546 template-id
4548 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4549 keyword, in a construct like `A::template ...'.
4551 Returns a representation of unqualified-id. For the `identifier'
4552 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4553 production a BIT_NOT_EXPR is returned; the operand of the
4554 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4555 other productions, see the documentation accompanying the
4556 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4557 names are looked up in uninstantiated templates. If DECLARATOR_P
4558 is true, the unqualified-id is appearing as part of a declarator,
4559 rather than as part of an expression. */
4561 static tree
4567 {
4570 /* Peek at the next token. */
4574 {
4576 {
4577 tree id;
4579 /* We don't know yet whether or not this will be a
4580 template-id. */
4582 /* Try a template-id. */
4584 check_dependency_p,
4585 none_type,
4586 declarator_p);
4587 /* If it worked, we're done. */
4590 /* Otherwise, it's an ordinary identifier. */
4592 }
4596 check_dependency_p,
4597 none_type,
4598 declarator_p);
4601 {
4602 tree type_decl;
4603 tree qualifying_scope;
4604 tree object_scope;
4605 tree scope;
4608 /* Consume the `~' token. */
4610 /* Parse the class-name. The standard, as written, seems to
4611 say that:
4613 template <typename T> struct S { ~S (); };
4614 template <typename T> S<T>::~S() {}
4616 is invalid, since `~' must be followed by a class-name, but
4617 `S<T>' is dependent, and so not known to be a class.
4618 That's not right; we need to look in uninstantiated
4619 templates. A further complication arises from:
4621 template <typename T> void f(T t) {
4622 t.T::~T();
4623 }
4625 Here, it is not possible to look up `T' in the scope of `T'
4626 itself. We must look in both the current scope, and the
4627 scope of the containing complete expression.
4629 Yet another issue is:
4631 struct S {
4632 int S;
4633 ~S();
4634 };
4636 S::~S() {}
4638 The standard does not seem to say that the `S' in `~S'
4639 should refer to the type `S' and not the data member
4640 `S::S'. */
4642 /* DR 244 says that we look up the name after the "~" in the
4643 same scope as we looked up the qualifying name. That idea
4644 isn't fully worked out; it's more complicated than that. */
4649 /* Check for invalid scopes. */
4651 {
4655 }
4657 {
4661 scope);
4666 }
4669 /* If the name is of the form "X::~X" it's OK even if X is a
4670 typedef. */
4679 {
4682 }
4684 /* If there was an explicit qualification (S::~T), first look
4685 in the scope given by the qualification (i.e., S).
4687 Note: in the calls to cp_parser_class_name below we pass
4688 typename_type so that lookup finds the injected-class-name
4689 rather than the constructor. */
4693 {
4698 typename_type,
4701 declarator_p);
4704 }
4705 /* In "N::S::~S", look in "N" as well. */
4707 {
4712 type_decl
4716 typename_type,
4719 declarator_p);
4722 }
4723 /* In "p->S::~T", look in the scope given by "*p" as well. */
4725 {
4730 type_decl
4734 typename_type,
4737 declarator_p);
4740 }
4741 /* Look in the surrounding context. */
4743 {
4749 type_decl
4753 typename_type,
4756 declarator_p);
4759 {
4760 /* We couldn't find a type with this name, so just accept
4761 it and check for a match at instantiation time. */
4766 }
4767 }
4768 /* If an error occurred, assume that the name of the
4769 destructor is the same as the name of the qualifying
4770 class. That allows us to keep parsing after running
4771 into ill-formed destructor names. */
4777 /* Check that destructor name and scope match. */
4779 {
4786 }
4788 /* [class.dtor]
4790 A typedef-name that names a class shall not be used as the
4791 identifier in the declarator for a destructor declaration. */
4798 type_decl);
4801 }
4805 {
4806 tree id;
4808 /* This could be a template-id, so we try that first. */
4810 /* Try a template-id. */
4813 none_type,
4814 declarator_p);
4815 /* If that worked, we're done. */
4818 /* We still don't know whether we're looking at an
4819 operator-function-id or a conversion-function-id. */
4821 /* Try an operator-function-id. */
4823 /* If that didn't work, try a conversion-function-id. */
4827 {
4828 /* 17.6.3.3.5 */
4833 }
4836 }
4837 /* Fall through. */
4844 }
4845 }
4847 /* Parse an (optional) nested-name-specifier.
4849 nested-name-specifier: [C++98]
4850 class-or-namespace-name :: nested-name-specifier [opt]
4851 class-or-namespace-name :: template nested-name-specifier [opt]
4853 nested-name-specifier: [C++0x]
4854 type-name ::
4855 namespace-name ::
4856 nested-name-specifier identifier ::
4857 nested-name-specifier template [opt] simple-template-id ::
4859 PARSER->SCOPE should be set appropriately before this function is
4860 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4861 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4862 in name lookups.
4864 Sets PARSER->SCOPE to the class (TYPE) or namespace
4865 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4866 it unchanged if there is no nested-name-specifier. Returns the new
4867 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4869 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4870 part of a declaration and/or decl-specifier. */
4872 static tree
4878 {
4883 /* Remember where the nested-name-specifier starts. */
4885 {
4888 }
4891 {
4892 tree new_scope;
4893 tree old_scope;
4894 tree saved_qualifying_scope;
4897 /* Spot cases that cannot be the beginning of a
4898 nested-name-specifier. */
4901 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4902 the already parsed nested-name-specifier. */
4904 {
4905 /* Grab the nested-name-specifier and continue the loop. */
4907 /* If we originally encountered this nested-name-specifier
4908 with IS_DECLARATION set to false, we will not have
4909 resolved TYPENAME_TYPEs, so we must do so here. */
4912 {
4917 }
4920 }
4922 /* Spot cases that cannot be the beginning of a
4923 nested-name-specifier. On the second and subsequent times
4924 through the loop, we look for the `template' keyword. */
4926 ;
4927 /* A template-id can start a nested-name-specifier. */
4929 ;
4930 /* DR 743: decltype can be used in a nested-name-specifier. */
4932 ;
4933 else
4934 {
4935 /* If the next token is not an identifier, then it is
4936 definitely not a type-name or namespace-name. */
4939 /* If the following token is neither a `<' (to begin a
4940 template-id), nor a `::', then we are not looking at a
4941 nested-name-specifier. */
4947 {
4951 }
4954 && !cp_parser_nth_token_starts_template_argument_list_p
4957 }
4959 /* The nested-name-specifier is optional, so we parse
4960 tentatively. */
4963 /* Look for the optional `template' keyword, if this isn't the
4964 first time through the loop. */
4967 else
4970 /* Save the old scope since the name lookup we are about to do
4971 might destroy it. */
4974 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4975 look up names in "X<T>::I" in order to determine that "Y" is
4976 a template. So, if we have a typename at this point, we make
4977 an effort to look through it. */
4979 && !typename_keyword_p
4984 /* Parse the qualifying entity. */
4985 new_scope
4987 typename_keyword_p,
4988 template_keyword_p,
4989 check_dependency_p,
4990 type_p,
4991 is_declaration);
4992 /* Look for the `::' token. */
4995 /* If we found what we wanted, we keep going; otherwise, we're
4996 done. */
4998 {
5001 /* Restore the OLD_SCOPE since it was valid before the
5002 failed attempt at finding the last
5003 class-or-namespace-name. */
5007 /* If the next token is a decltype, and the one after that is a
5008 `::', then the decltype has failed to resolve to a class or
5009 enumeration type. Give this error even when parsing
5010 tentatively since it can't possibly be valid--and we're going
5011 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5012 won't get another chance.*/
5016 {
5023 /* As below. */
5026 }
5030 /* If the next token is an identifier, and the one after
5031 that is a `::', then any valid interpretation would have
5032 found a class-or-namespace-name. */
5038 {
5041 {
5043 {
5044 tree decl;
5045 tree ambiguous_decls;
5048 none_type,
5057 decl);
5059 {
5065 }
5066 else
5067 {
5069 cp_parser_name_lookup_error
5072 else
5073 cp_parser_name_lookup_error
5076 }
5077 }
5080 /* Treat this as a successful nested-name-specifier
5081 due to:
5083 [basic.lookup.qual]
5085 If the name found is not a class-name (clause
5086 _class_) or namespace-name (_namespace.def_), the
5087 program is ill-formed. */
5089 }
5091 }
5093 }
5094 /* We've found one valid nested-name-specifier. */
5096 /* Name lookup always gives us a DECL. */
5099 /* Uses of "template" must be followed by actual templates. */
5111 new_scope);
5112 /* If it is a class scope, try to complete it; we are about to
5113 be looking up names inside the class. */
5115 /* Since checking types for dependency can be expensive,
5116 avoid doing it if the type is already complete. */
5118 /* Do not try to complete dependent types. */
5120 {
5122 /* If it is a typedef to current class, use the current
5123 class instead, as the typedef won't have any names inside
5124 it yet. */
5128 }
5129 /* Make sure we look in the right scope the next time through
5130 the loop. */
5132 }
5134 /* If parsing tentatively, replace the sequence of tokens that makes
5135 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5136 token. That way, should we re-parse the token stream, we will
5137 not have to repeat the effort required to do the parse, nor will
5138 we issue duplicate error messages. */
5140 {
5144 /* Reset the contents of the START token. */
5146 /* Retrieve any deferred checks. Do not pop this access checks yet
5147 so the memory will not be reclaimed during token replacing below. */
5155 /* Purge all subsequent tokens. */
5157 }
5163 }
5165 /* Parse a nested-name-specifier. See
5166 cp_parser_nested_name_specifier_opt for details. This function
5167 behaves identically, except that it will an issue an error if no
5168 nested-name-specifier is present. */
5170 static tree
5176 {
5177 tree scope;
5179 /* Look for the nested-name-specifier. */
5181 typename_keyword_p,
5182 check_dependency_p,
5183 type_p,
5184 is_declaration);
5185 /* If it was not present, issue an error message. */
5187 {
5190 }
5193 }
5195 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5196 this is either a class-name or a namespace-name (which corresponds
5197 to the class-or-namespace-name production in the grammar). For
5198 C++0x, it can also be a type-name that refers to an enumeration
5199 type or a simple-template-id.
5201 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5202 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5203 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5204 TYPE_P is TRUE iff the next name should be taken as a class-name,
5205 even the same name is declared to be another entity in the same
5206 scope.
5208 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5209 specified by the class-or-namespace-name. If neither is found the
5210 ERROR_MARK_NODE is returned. */
5212 static tree
5219 {
5220 tree saved_scope;
5221 tree saved_qualifying_scope;
5222 tree saved_object_scope;
5223 tree scope;
5227 /* DR 743: decltype can appear in a nested-name-specifier. */
5229 {
5233 {
5236 }
5240 }
5242 /* Before we try to parse the class-name, we must save away the
5243 current PARSER->SCOPE since cp_parser_class_name will destroy
5244 it. */
5248 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5249 there is no need to look for a namespace-name. */
5250 only_class_p = template_keyword_p
5255 typename_keyword_p,
5256 template_keyword_p,
5258 check_dependency_p,
5260 is_declaration);
5262 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5266 {
5267 /* Restore the saved scope. */
5272 /* Parse tentatively. */
5275 /* Parse a type-name */
5278 /* "If the name found does not designate a namespace or a class,
5279 enumeration, or dependent type, the program is ill-formed."
5281 We cover classes and dependent types above and namespaces below,
5282 so this code is only looking for enums. */
5288 }
5289 /* If that didn't work, try for a namespace-name. */
5291 {
5292 /* Restore the saved scope. */
5296 /* If we are not looking at an identifier followed by the scope
5297 resolution operator, then this is not part of a
5298 nested-name-specifier. (Note that this function is only used
5299 to parse the components of a nested-name-specifier.) */
5304 }
5307 }
5309 /* Parse a postfix-expression.
5311 postfix-expression:
5312 primary-expression
5313 postfix-expression [ expression ]
5314 postfix-expression ( expression-list [opt] )
5315 simple-type-specifier ( expression-list [opt] )
5316 typename :: [opt] nested-name-specifier identifier
5317 ( expression-list [opt] )
5318 typename :: [opt] nested-name-specifier template [opt] template-id
5319 ( expression-list [opt] )
5320 postfix-expression . template [opt] id-expression
5321 postfix-expression -> template [opt] id-expression
5322 postfix-expression . pseudo-destructor-name
5323 postfix-expression -> pseudo-destructor-name
5324 postfix-expression ++
5325 postfix-expression --
5326 dynamic_cast < type-id > ( expression )
5327 static_cast < type-id > ( expression )
5328 reinterpret_cast < type-id > ( expression )
5329 const_cast < type-id > ( expression )
5330 typeid ( expression )
5331 typeid ( type-id )
5333 GNU Extension:
5335 postfix-expression:
5336 ( type-id ) { initializer-list , [opt] }
5338 This extension is a GNU version of the C99 compound-literal
5339 construct. (The C99 grammar uses `type-name' instead of `type-id',
5340 but they are essentially the same concept.)
5342 If ADDRESS_P is true, the postfix expression is the operand of the
5343 `&' operator. CAST_P is true if this expression is the target of a
5344 cast.
5346 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5347 class member access expressions [expr.ref].
5349 Returns a representation of the expression. */
5351 static tree
5355 {
5362 /* Peek at the next token. */
5364 /* Some of the productions are determined by keywords. */
5367 {
5372 {
5373 tree type;
5374 tree expression;
5377 /* All of these can be handled in the same way from the point
5378 of view of parsing. Begin by consuming the token
5379 identifying the cast. */
5382 /* New types cannot be defined in the cast. */
5384 parser->type_definition_forbidden_message
5387 /* Look for the opening `<'. */
5389 /* Parse the type to which we are casting. */
5391 /* Look for the closing `>'. */
5393 /* Restore the old message. */
5396 /* And the expression which is being cast. */
5401 /* Only type conversions to integral or enumeration types
5402 can be used in constant-expressions. */
5408 {
5410 postfix_expression
5414 postfix_expression
5418 postfix_expression
5420 tf_warning_or_error);
5423 postfix_expression
5428 }
5429 }
5433 {
5434 tree type;
5438 /* Consume the `typeid' token. */
5440 /* Look for the `(' token. */
5442 /* Types cannot be defined in a `typeid' expression. */
5444 parser->type_definition_forbidden_message
5446 /* We can't be sure yet whether we're looking at a type-id or an
5447 expression. */
5449 /* Try a type-id first. */
5454 /* Look for the `)' token. Otherwise, we can't be sure that
5455 we're not looking at an expression: consider `typeid (int
5456 (3))', for example. */
5458 /* If all went well, simply lookup the type-id. */
5461 /* Otherwise, fall back to the expression variant. */
5462 else
5463 {
5464 tree expression;
5466 /* Look for an expression. */
5468 /* Compute its typeid. */
5470 /* Look for the `)' token. */
5472 }
5473 /* Restore the saved message. */
5475 /* `typeid' may not appear in an integral constant expression. */
5478 }
5482 {
5483 tree type;
5484 /* The syntax permitted here is the same permitted for an
5485 elaborated-type-specifier. */
5490 }
5494 {
5497 tree p;
5514 else
5515 {
5519 }
5521 }
5524 {
5525 tree type;
5527 /* If the next thing is a simple-type-specifier, we may be
5528 looking at a functional cast. We could also be looking at
5529 an id-expression. So, we try the functional cast, and if
5530 that doesn't work we fall back to the primary-expression. */
5532 /* Look for the simple-type-specifier. */
5535 CP_PARSER_FLAGS_NONE);
5536 /* Parse the cast itself. */
5538 postfix_expression
5540 /* If that worked, we're done. */
5544 /* If the functional-cast didn't work out, try a
5545 compound-literal. */
5548 {
5553 /* Consume the `('. */
5555 /* Parse the type. */
5560 /* Look for the `)'. */
5562 /* Look for the `{'. */
5564 /* If things aren't going well, there's no need to
5565 keep going. */
5567 {
5569 /* Parse the initializer-list. */
5570 initializer_list
5572 /* Allow a trailing `,'. */
5575 /* Look for the final `}'. */
5577 }
5578 /* If that worked, we're definitely looking at a
5579 compound-literal expression. */
5581 {
5582 /* Warn the user that a compound literal is not
5583 allowed in standard C++. */
5585 /* For simplicity, we disallow compound literals in
5586 constant-expressions. We could
5587 allow compound literals of integer type, whose
5588 initializer was a constant, in constant
5589 expressions. Permitting that usage, as a further
5590 extension, would not change the meaning of any
5591 currently accepted programs. (Of course, as
5592 compound literals are not part of ISO C++, the
5593 standard has nothing to say.) */
5595 NIC_NCC))
5596 {
5599 }
5600 /* Form the representation of the compound-literal. */
5601 postfix_expression
5602 = (finish_compound_literal
5604 initializer_list),
5605 tf_warning_or_error));
5607 }
5608 }
5610 /* It must be a primary-expression. */
5611 postfix_expression
5615 }
5617 }
5619 /* Keep looping until the postfix-expression is complete. */
5621 {
5625 /* It is not a Koenig lookup function call. */
5626 postfix_expression
5629 /* Peek at the next token. */
5633 {
5636 {
5638 "two consecutive %<[%> shall "
5641 }
5642 postfix_expression
5644 postfix_expression,
5651 /* postfix-expression ( expression-list [opt] ) */
5652 {
5661 is_builtin_constant_p
5664 {
5665 /* The whole point of __builtin_constant_p is to allow
5666 non-constant expressions to appear as arguments. */
5667 saved_integral_constant_expression_p
5669 saved_non_integral_constant_expression_p
5672 }
5673 args = (cp_parser_parenthesized_expression_list
5678 {
5679 parser->integral_constant_expression_p
5681 parser->non_integral_constant_expression_p
5683 }
5686 {
5689 }
5691 /* Function calls are not permitted in
5692 constant-expressions. */
5695 NIC_FUNC_CALL))
5696 {
5700 }
5705 {
5707 {
5709 {
5712 postfix_expression
5715 tf_warning_or_error);
5716 }
5717 else
5718 postfix_expression
5720 }
5721 /* We do not perform argument-dependent lookup if
5722 normal lookup finds a non-function, in accordance
5723 with the expected resolution of DR 218. */
5726 {
5730 /* Do not do argument dependent lookup if regular
5731 lookup finds a member function or a block-scope
5732 function declaration. [basic.lookup.argdep]/3 */
5735 {
5738 postfix_expression
5741 tf_warning_or_error);
5742 }
5743 }
5744 }
5747 {
5757 {
5758 postfix_expression
5762 }
5765 {
5766 postfix_expression
5767 = (build_new_method_call
5773 tf_warning_or_error));
5774 }
5775 else
5776 postfix_expression
5780 tf_warning_or_error);
5781 }
5785 postfix_expression = (build_offset_ref_call_from_tree
5787 tf_warning_or_error));
5789 /* A call to a static class member, or a namespace-scope
5790 function. */
5791 postfix_expression
5794 koenig_p,
5795 tf_warning_or_error);
5796 else
5797 /* All other function calls. */
5798 postfix_expression
5801 koenig_p,
5802 tf_warning_or_error);
5804 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5808 }
5813 /* postfix-expression . template [opt] id-expression
5814 postfix-expression . pseudo-destructor-name
5815 postfix-expression -> template [opt] id-expression
5816 postfix-expression -> pseudo-destructor-name */
5818 /* Consume the `.' or `->' operator. */
5821 postfix_expression
5823 postfix_expression,
5831 /* postfix-expression ++ */
5832 /* Consume the `++' token. */
5834 /* Generate a representation for the complete expression. */
5835 postfix_expression
5837 POSTINCREMENT_EXPR);
5838 /* Increments may not appear in constant-expressions. */
5846 /* postfix-expression -- */
5847 /* Consume the `--' token. */
5849 /* Generate a representation for the complete expression. */
5850 postfix_expression
5852 POSTDECREMENT_EXPR);
5853 /* Decrements may not appear in constant-expressions. */
5865 else
5867 }
5868 }
5870 /* We should never get here. */
5873 }
5875 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5876 by cp_parser_builtin_offsetof. We're looking for
5878 postfix-expression [ expression ]
5879 postfix-expression [ braced-init-list ] (C++11)
5881 FOR_OFFSETOF is set if we're being called in that context, which
5882 changes how we deal with integer constant expressions. */
5884 static tree
5886 tree postfix_expression,
5888 {
5889 tree index;
5892 /* Consume the `[' token. */
5895 /* Parse the index expression. */
5896 /* ??? For offsetof, there is a question of what to allow here. If
5897 offsetof is not being used in an integral constant expression context,
5898 then we *could* get the right answer by computing the value at runtime.
5899 If we are in an integral constant expression context, then we might
5900 could accept any constant expression; hard to say without analysis.
5901 Rather than open the barn door too wide right away, allow only integer
5902 constant expressions here. */
5905 else
5906 {
5908 {
5912 }
5913 else
5915 }
5917 /* Look for the closing `]'. */
5920 /* Build the ARRAY_REF. */
5923 /* When not doing offsetof, array references are not permitted in
5924 constant-expressions. */
5930 }
5932 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5933 by cp_parser_builtin_offsetof. We're looking for
5935 postfix-expression . template [opt] id-expression
5936 postfix-expression . pseudo-destructor-name
5937 postfix-expression -> template [opt] id-expression
5938 postfix-expression -> pseudo-destructor-name
5940 FOR_OFFSETOF is set if we're being called in that context. That sorta
5941 limits what of the above we'll actually accept, but nevermind.
5942 TOKEN_TYPE is the "." or "->" token, which will already have been
5943 removed from the stream. */
5945 static tree
5948 tree postfix_expression,
5950 location_t location)
5951 {
5952 tree name;
5957 /* If this is a `->' operator, dereference the pointer. */
5960 tf_warning_or_error);
5961 /* Check to see whether or not the expression is type-dependent. */
5963 /* The identifier following the `->' or `.' is not qualified. */
5969 /* Enter the scope corresponding to the type of the object
5970 given by the POSTFIX_EXPRESSION. */
5972 {
5974 /* According to the standard, no expression should ever have
5975 reference type. Unfortunately, we do not currently match
5976 the standard in this respect in that our internal representation
5977 of an expression may have reference type even when the standard
5978 says it does not. Therefore, we have to manually obtain the
5979 underlying type here. */
5981 /* The type of the POSTFIX_EXPRESSION must be complete. */
5983 {
5985 postfix_expression);
5987 }
5988 /* Unlike the object expression in other contexts, *this is not
5989 required to be of complete type for purposes of class member
5990 access (5.2.5) outside the member function body. */
5994 /* Let the name lookup machinery know that we are processing a
5995 class member access expression. */
5997 /* If something went wrong, we want to be able to discern that case,
5998 as opposed to the case where there was no SCOPE due to the type
5999 of expression being dependent. */
6002 /* If the SCOPE was erroneous, make the various semantic analysis
6003 functions exit quickly -- and without issuing additional error
6004 messages. */
6007 }
6009 /* Assume this expression is not a pseudo-destructor access. */
6012 /* If the SCOPE is a scalar type, then, if this is a valid program,
6013 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6014 is type dependent, it can be pseudo-destructor-name or something else.
6015 Try to parse it as pseudo-destructor-name first. */
6017 {
6018 tree s;
6019 tree type;
6022 /* Parse the pseudo-destructor-name. */
6031 {
6033 postfix_expression
6036 }
6037 }
6040 {
6041 /* If the SCOPE is not a scalar type, we are looking at an
6042 ordinary class member access expression, rather than a
6043 pseudo-destructor-name. */
6046 /* Parse the id-expression. */
6047 name = (cp_parser_id_expression
6054 /* In general, build a SCOPE_REF if the member name is qualified.
6055 However, if the name was not dependent and has already been
6056 resolved; there is no need to build the SCOPE_REF. For example;
6058 struct X { void f(); };
6059 template <typename T> void f(T* t) { t->X::f(); }
6061 Even though "t" is dependent, "X::f" is not and has been resolved
6062 to a BASELINK; there is no need to include scope information. */
6064 /* But we do need to remember that there was an explicit scope for
6065 virtual function calls. */
6069 /* If the name is a template-id that names a type, we will get a
6070 TYPE_DECL here. That is invalid code. */
6072 {
6075 }
6076 else
6077 {
6079 {
6081 {
6085 }
6086 else
6089 name,
6090 template_p);
6094 }
6096 adjust_result_of_qualified_name_lookup
6098 postfix_expression
6100 template_p,
6101 tf_warning_or_error);
6102 }
6103 }
6105 /* We no longer need to look up names in the scope of the object on
6106 the left-hand side of the `.' or `->' operator. */
6109 /* Outside of offsetof, these operators may not appear in
6110 constant-expressions. */
6112 && (cp_parser_non_integral_constant_expression
6117 }
6119 /* Parse a parenthesized expression-list.
6121 expression-list:
6122 assignment-expression
6123 expression-list, assignment-expression
6125 attribute-list:
6126 expression-list
6127 identifier
6128 identifier, expression-list
6130 CAST_P is true if this expression is the target of a cast.
6132 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6133 argument pack.
6135 Returns a vector of trees. Each element is a representation of an
6136 assignment-expression. NULL is returned if the ( and or ) are
6137 missing. An empty, but allocated, vector is returned on no
6138 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6139 if we are parsing an attribute list for an attribute that wants a
6140 plain identifier argument, normal_attr for an attribute that wants
6141 an expression, or non_attr if we aren't parsing an attribute list. If
6142 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6143 not all of the expressions in the list were constant. */
6151 {
6157 /* Assume all the expressions will be constant. */
6166 /* Within a parenthesized expression, a `>' token is always
6167 the greater-than operator. */
6168 saved_greater_than_is_operator_p
6172 /* Consume expressions until there are no more. */
6175 {
6176 tree expr;
6178 /* At the beginning of attribute lists, check to see if the
6179 next token is an identifier. */
6182 {
6185 /* Consume the identifier. */
6187 /* Save the identifier. */
6189 }
6190 else
6191 {
6194 /* Parse the next assignment-expression. */
6196 {
6197 /* A braced-init-list. */
6202 }
6204 {
6205 expr = (cp_parser_constant_expression
6210 }
6211 else
6217 /* If we have an ellipsis, then this is an expression
6218 expansion. */
6221 {
6222 /* Consume the `...'. */
6225 /* Build the argument pack. */
6227 }
6229 /* Add it to the list. We add error_mark_node
6230 expressions to the list, so that we can still tell if
6231 the correct form for a parenthesized expression-list
6232 is found. That gives better errors. */
6237 }
6239 /* After the first item, attribute lists look the same as
6240 expression lists. */
6243 get_comma:;
6244 /* If the next token isn't a `,', then we are done. */
6248 /* Otherwise, consume the `,' and keep going. */
6250 }
6253 {
6256 skip_comma:;
6257 /* We try and resync to an unnested comma, as that will give the
6258 user better diagnostics. */
6266 {
6267 parser->greater_than_is_operator_p
6270 }
6271 }
6273 parser->greater_than_is_operator_p
6280 }
6282 /* Parse a pseudo-destructor-name.
6284 pseudo-destructor-name:
6285 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6286 :: [opt] nested-name-specifier template template-id :: ~ type-name
6287 :: [opt] nested-name-specifier [opt] ~ type-name
6289 If either of the first two productions is used, sets *SCOPE to the
6290 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6291 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6292 or ERROR_MARK_NODE if the parse fails. */
6294 static void
6298 {
6301 /* Assume that things will not work out. */
6304 /* Look for the optional `::' operator. */
6306 /* Look for the optional nested-name-specifier. */
6307 nested_name_specifier_p
6314 /* Now, if we saw a nested-name-specifier, we might be doing the
6315 second production. */
6318 {
6319 /* Consume the `template' keyword. */
6321 /* Parse the template-id. */
6325 class_type,
6327 /* Look for the `::' token. */
6329 }
6330 /* If the next token is not a `~', then there might be some
6331 additional qualification. */
6333 {
6334 /* At this point, we're looking for "type-name :: ~". The type-name
6335 must not be a class-name, since this is a pseudo-destructor. So,
6336 it must be either an enum-name, or a typedef-name -- both of which
6337 are just identifiers. So, we peek ahead to check that the "::"
6338 and "~" tokens are present; if they are not, then we can avoid
6339 calling type_name. */
6343 {
6346 }
6348 /* Look for the type-name. */
6353 /* Look for the `::' token. */
6355 }
6356 else
6359 /* Look for the `~'. */
6362 /* Once we see the ~, this has to be a pseudo-destructor. */
6366 /* Look for the type-name again. We are not responsible for
6367 checking that it matches the first type-name. */
6369 }
6371 /* Parse a unary-expression.
6373 unary-expression:
6374 postfix-expression
6375 ++ cast-expression
6376 -- cast-expression
6377 unary-operator cast-expression
6378 sizeof unary-expression
6379 sizeof ( type-id )
6380 alignof ( type-id ) [C++0x]
6381 new-expression
6382 delete-expression
6384 GNU Extensions:
6386 unary-expression:
6387 __extension__ cast-expression
6388 __alignof__ unary-expression
6389 __alignof__ ( type-id )
6390 alignof unary-expression [C++0x]
6391 __real__ cast-expression
6392 __imag__ cast-expression
6393 && identifier
6395 ADDRESS_P is true iff the unary-expression is appearing as the
6396 operand of the `&' operator. CAST_P is true if this expression is
6397 the target of a cast.
6399 Returns a representation of the expression. */
6401 static tree
6404 {
6408 /* Peek at the next token. */
6410 /* Some keywords give away the kind of expression. */
6412 {
6416 {
6419 {
6422 location_t first_loc;
6425 /* Consume the token. */
6428 /* Parse the operand. */
6433 else
6434 {
6435 /* ISO C++ defines alignof only with types, not with
6436 expressions. So pedwarn if alignof is used with a non-
6437 type expression. However, __alignof__ is ok. */
6440 "ISO C++ does not allow %<alignof%> "
6444 }
6445 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6446 SIZEOF_EXPR with the original operand. */
6448 {
6450 {
6452 {
6455 error_mark_node));
6457 }
6458 else
6462 }
6464 }
6466 }
6475 {
6476 /* The saved value of the PEDANTIC flag. */
6478 tree expr;
6480 /* Save away the PEDANTIC flag. */
6482 /* Parse the cast-expression. */
6484 /* Restore the PEDANTIC flag. */
6488 }
6492 {
6493 tree expression;
6495 /* Consume the `__real__' or `__imag__' token. */
6497 /* Parse the cast-expression. */
6499 /* Create the complete representation. */
6503 expression,
6504 tf_warning_or_error);
6505 }
6513 {
6514 tree expr;
6524 parser->type_definition_forbidden_message
6527 saved_integral_constant_expression_p
6529 saved_non_integral_constant_expression_p
6533 saved_greater_than_is_operator_p
6543 parser->greater_than_is_operator_p
6546 parser->integral_constant_expression_p
6548 parser->non_integral_constant_expression_p
6555 }
6559 }
6560 }
6562 /* Look for the `:: new' and `:: delete', which also signal the
6563 beginning of a new-expression, or delete-expression,
6564 respectively. If the next token is `::', then it might be one of
6565 these. */
6567 {
6570 /* See if the token after the `::' is one of the keywords in
6571 which we're interested. */
6573 /* If it's `new', we have a new-expression. */
6576 /* Similarly, for `delete'. */
6579 }
6581 /* Look for a unary operator. */
6583 /* The `++' and `--' operators can be handled similarly, even though
6584 they are not technically unary-operators in the grammar. */
6586 {
6591 /* Handle the GNU address-of-label extension. */
6594 {
6595 tree identifier;
6596 tree expression;
6599 /* Consume the '&&' token. */
6601 /* Look for the identifier. */
6603 /* Create an expression representing the address. */
6606 NIC_ADDR_LABEL))
6609 }
6610 }
6612 {
6613 tree cast_expression;
6618 /* Consume the operator token. */
6620 /* Parse the cast-expression. */
6621 cast_expression
6625 /* Now, build an appropriate representation. */
6627 {
6631 RO_UNARY_STAR,
6632 tf_warning_or_error);
6637 /* Fall through. */
6640 cast_expression,
6641 tf_warning_or_error);
6648 /* Fall through. */
6653 cast_expression);
6658 }
6662 non_constant_p))
6666 }
6670 pidk);
6671 }
6673 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6674 unary-operator, the corresponding tree code is returned. */
6676 static enum tree_code
6678 {
6680 {
6701 }
6702 }
6704 /* Parse a new-expression.
6706 new-expression:
6707 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6708 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6710 Returns a representation of the expression. */
6712 static tree
6714 {
6717 tree type;
6720 tree ret;
6722 /* Look for the optional `::' operator. */
6723 global_scope_p
6727 /* Look for the `new' operator. */
6729 /* There's no easy way to tell a new-placement from the
6730 `( type-id )' construct. */
6732 /* Look for a new-placement. */
6734 /* If that didn't work out, there's no new-placement. */
6736 {
6740 }
6742 /* If the next token is a `(', then we have a parenthesized
6743 type-id. */
6745 {
6749 /* Consume the `('. */
6752 /* Parse the type-id. */
6753 parser->type_definition_forbidden_message
6758 /* Look for the closing `)'. */
6761 /* There should not be a direct-new-declarator in this production,
6762 but GCC used to allowed this, so we check and emit a sensible error
6763 message for this case. */
6765 {
6771 }
6772 }
6773 /* Otherwise, there must be a new-type-id. */
6774 else
6777 /* If the next token is a `(' or '{', then we have a new-initializer. */
6781 else
6784 /* A new-expression may not appear in an integral constant
6785 expression. */
6788 else
6789 {
6790 /* Create a representation of the new-expression. */
6792 tf_warning_or_error);
6793 }
6801 }
6803 /* Parse a new-placement.
6805 new-placement:
6806 ( expression-list )
6808 Returns the same representation as for an expression-list. */
6812 {
6815 /* Parse the expression-list. */
6816 expression_list = (cp_parser_parenthesized_expression_list
6822 }
6824 /* Parse a new-type-id.
6826 new-type-id:
6827 type-specifier-seq new-declarator [opt]
6829 Returns the TYPE allocated. If the new-type-id indicates an array
6830 type, *NELTS is set to the number of elements in the last array
6831 bound; the TYPE will not include the last array bound. */
6833 static tree
6835 {
6836 cp_decl_specifier_seq type_specifier_seq;
6842 /* The type-specifier sequence must not contain type definitions.
6843 (It cannot contain declarations of new types either, but if they
6844 are not definitions we will catch that because they are not
6845 complete.) */
6847 parser->type_definition_forbidden_message
6849 /* Parse the type-specifier-seq. */
6853 /* Restore the old message. */
6859 /* Parse the new-declarator. */
6862 /* Determine the number of elements in the last array dimension, if
6863 any. */
6865 /* Skip down to the last array dimension. */
6870 {
6873 }
6878 {
6881 }
6884 {
6891 else
6893 }
6896 }
6898 /* Parse an (optional) new-declarator.
6900 new-declarator:
6901 ptr-operator new-declarator [opt]
6902 direct-new-declarator
6904 Returns the declarator. */
6908 {
6911 cp_cv_quals cv_quals;
6913 /* We don't know if there's a ptr-operator next, or not. */
6915 /* Look for a ptr-operator. */
6917 /* If that worked, look for more new-declarators. */
6919 {
6922 /* Parse another optional declarator. */
6925 declarator = cp_parser_make_indirect_declarator
6929 }
6931 /* If the next token is a `[', there is a direct-new-declarator. */
6936 }
6938 /* Parse a direct-new-declarator.
6940 direct-new-declarator:
6941 [ expression ]
6942 direct-new-declarator [constant-expression]
6944 */
6948 {
6952 {
6953 tree expression;
6956 /* Look for the opening `['. */
6961 /* The standard requires that the expression have integral
6962 type. DR 74 adds enumeration types. We believe that the
6963 real intent is that these expressions be handled like the
6964 expression in a `switch' condition, which also allows
6965 classes with a single conversion to integral or
6966 enumeration type. */
6968 {
6969 expression
6971 expression,
6974 {
6976 "expression in new-declarator must have integral "
6979 }
6980 }
6982 /* Look for the closing `]'. */
6985 /* Add this bound to the declarator. */
6988 /* If the next token is not a `[', then there are no more
6989 bounds. */
6992 }
6995 }
6997 /* Parse a new-initializer.
6999 new-initializer:
7000 ( expression-list [opt] )
7001 braced-init-list
7003 Returns a representation of the expression-list. */
7007 {
7011 {
7012 tree t;
7018 }
7019 else
7020 expression_list = (cp_parser_parenthesized_expression_list
7026 }
7028 /* Parse a delete-expression.
7030 delete-expression:
7031 :: [opt] delete cast-expression
7032 :: [opt] delete [ ] cast-expression
7034 Returns a representation of the expression. */
7036 static tree
7038 {
7041 tree expression;
7043 /* Look for the optional `::' operator. */
7044 global_scope_p
7048 /* Look for the `delete' keyword. */
7050 /* See if the array syntax is in use. */
7052 {
7053 /* Consume the `[' token. */
7055 /* Look for the `]' token. */
7057 /* Remember that this is the `[]' construct. */
7059 }
7060 else
7063 /* Parse the cast-expression. */
7066 /* A delete-expression may not appear in an integral constant
7067 expression. */
7072 tf_warning_or_error);
7073 }
7075 /* Returns true if TOKEN may start a cast-expression and false
7076 otherwise. */
7078 static bool
7080 {
7082 {
7121 /* '[' may start a primary-expression in obj-c++. */
7127 }
7128 }
7130 /* Parse a cast-expression.
7132 cast-expression:
7133 unary-expression
7134 ( type-id ) cast-expression
7136 ADDRESS_P is true iff the unary-expression is appearing as the
7137 operand of the `&' operator. CAST_P is true if this expression is
7138 the target of a cast.
7140 Returns a representation of the expression. */
7142 static tree
7145 {
7146 /* If it's a `(', then we might be looking at a cast. */
7148 {
7154 /* There's no way to know yet whether or not this is a cast.
7155 For example, `(int (3))' is a unary-expression, while `(int)
7156 3' is a cast. So, we resort to parsing tentatively. */
7158 /* Types may not be defined in a cast. */
7160 parser->type_definition_forbidden_message
7162 /* Consume the `('. */
7164 /* A very tricky bit is that `(struct S) { 3 }' is a
7165 compound-literal (which we permit in C++ as an extension).
7166 But, that construct is not a cast-expression -- it is a
7167 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7168 is legal; if the compound-literal were a cast-expression,
7169 you'd need an extra set of parentheses.) But, if we parse
7170 the type-id, and it happens to be a class-specifier, then we
7171 will commit to the parse at that point, because we cannot
7172 undo the action that is done when creating a new class. So,
7173 then we cannot back up and do a postfix-expression.
7175 Therefore, we scan ahead to the closing `)', and check to see
7176 if the token after the `)' is a `{'. If so, we are not
7177 looking at a cast-expression.
7179 Save tokens so that we can put them back. */
7181 /* Skip tokens until the next token is a closing parenthesis.
7182 If we find the closing `)', and the next token is a `{', then
7183 we are looking at a compound-literal. */
7184 compound_literal_p
7188 /* Roll back the tokens we skipped. */
7190 /* If we were looking at a compound-literal, simulate an error
7191 so that the call to cp_parser_parse_definitely below will
7192 fail. */
7195 else
7196 {
7199 /* Look for the type-id. */
7201 /* Look for the closing `)'. */
7204 }
7206 /* Restore the saved message. */
7209 /* At this point this can only be either a cast or a
7210 parenthesized ctor such as `(T ())' that looks like a cast to
7211 function returning T. */
7215 {
7221 /* Warn about old-style casts, if so requested. */
7223 && !in_system_header
7228 /* Only type conversions to integral or enumeration types
7229 can be used in constant-expressions. */
7232 NIC_CAST))
7235 /* Perform the cast. */
7238 }
7239 else
7241 }
7243 /* If we get here, then it's not a cast, so it must be a
7244 unary-expression. */
7246 }
7248 /* Parse a binary expression of the general form:
7250 pm-expression:
7251 cast-expression
7252 pm-expression .* cast-expression
7253 pm-expression ->* cast-expression
7255 multiplicative-expression:
7256 pm-expression
7257 multiplicative-expression * pm-expression
7258 multiplicative-expression / pm-expression
7259 multiplicative-expression % pm-expression
7261 additive-expression:
7262 multiplicative-expression
7263 additive-expression + multiplicative-expression
7264 additive-expression - multiplicative-expression
7266 shift-expression:
7267 additive-expression
7268 shift-expression << additive-expression
7269 shift-expression >> additive-expression
7271 relational-expression:
7272 shift-expression
7273 relational-expression < shift-expression
7274 relational-expression > shift-expression
7275 relational-expression <= shift-expression
7276 relational-expression >= shift-expression
7278 GNU Extension:
7280 relational-expression:
7281 relational-expression <? shift-expression
7282 relational-expression >? shift-expression
7284 equality-expression:
7285 relational-expression
7286 equality-expression == relational-expression
7287 equality-expression != relational-expression
7289 and-expression:
7290 equality-expression
7291 and-expression & equality-expression
7293 exclusive-or-expression:
7294 and-expression
7295 exclusive-or-expression ^ and-expression
7297 inclusive-or-expression:
7298 exclusive-or-expression
7299 inclusive-or-expression | exclusive-or-expression
7301 logical-and-expression:
7302 inclusive-or-expression
7303 logical-and-expression && inclusive-or-expression
7305 logical-or-expression:
7306 logical-and-expression
7307 logical-or-expression || logical-and-expression
7309 All these are implemented with a single function like:
7311 binary-expression:
7312 simple-cast-expression
7313 binary-expression <token> binary-expression
7315 CAST_P is true if this expression is the target of a cast.
7317 The binops_by_token map is used to get the tree codes for each <token> type.
7318 binary-expressions are associated according to a precedence table. */
7320 #define TOKEN_PRECEDENCE(token) \
7321 (((token->type == CPP_GREATER \
7322 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7323 && !parser->greater_than_is_operator_p) \
7324 ? PREC_NOT_OPERATOR \
7325 : binops_by_token[token->type].prec)
7327 static tree
7332 {
7333 cp_parser_expression_stack stack;
7335 cp_parser_expression_stack_entry current;
7336 tree rhs;
7340 tree overload;
7342 /* Parse the first expression. */
7352 {
7353 /* Get an operator token. */
7359 {
7361 "%<>>%> operator is treated"
7365 }
7369 /* Popping an entry off the stack means we completed a subexpression:
7370 - either we found a token which is not an operator (`>' where it is not
7371 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7372 will happen repeatedly;
7373 - or, we found an operator which has lower priority. This is the case
7374 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7375 parsing `3 * 4'. */
7377 {
7380 else
7382 }
7384 get_rhs:
7388 /* We used the operator token. */
7391 /* For "false && x" or "true || x", x will never be executed;
7392 disable warnings while evaluating it. */
7398 /* Extract another operand. It may be the RHS of this expression
7399 or the LHS of a new, higher priority expression. */
7403 /* Get another operator token. Look up its precedence to avoid
7404 building a useless (immediately popped) stack entry for common
7405 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7409 {
7410 /* ... and prepare to parse the RHS of the new, higher priority
7411 expression. Since precedence levels on the stack are
7412 monotonically increasing, we do not have to care about
7413 stack overflows. */
7422 pop:
7424 /* If the stack is not empty, we have parsed into LHS the right side
7425 (`4' in the example above) of an expression we had suspended.
7426 We can use the information on the stack to recover the LHS (`3')
7427 from the stack together with the tree code (`MULT_EXPR'), and
7428 the precedence of the higher level subexpression
7429 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7430 which will be used to actually build the additive expression. */
7435 }
7437 /* Undo the disabling of warnings done above. */
7444 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7445 ERROR_MARK for everything that is not a binary expression.
7446 This makes warn_about_parentheses miss some warnings that
7447 involve unary operators. For unary expressions we should
7448 pass the correct tree_code unless the unary expression was
7449 surrounded by parentheses.
7450 */
7457 else
7461 tf_warning_or_error);
7466 /* If the binary operator required the use of an overloaded operator,
7467 then this expression cannot be an integral constant-expression.
7468 An overloaded operator can be used even if both operands are
7469 otherwise permissible in an integral constant-expression if at
7470 least one of the operands is of enumeration type. */
7474 NIC_OVERLOADED))
7476 }
7479 }
7482 /* Parse the `? expression : assignment-expression' part of a
7483 conditional-expression. The LOGICAL_OR_EXPR is the
7484 logical-or-expression that started the conditional-expression.
7485 Returns a representation of the entire conditional-expression.
7487 This routine is used by cp_parser_assignment_expression.
7489 ? expression : assignment-expression
7491 GNU Extensions:
7493 ? : assignment-expression */
7495 static tree
7497 {
7498 tree expr;
7499 tree assignment_expr;
7503 /* Consume the `?' token. */
7508 {
7511 /* Implicit true clause. */
7515 }
7516 else
7517 {
7520 /* Parse the expression. */
7523 c_inhibit_evaluation_warnings +=
7527 }
7529 /* The next token should be a `:'. */
7531 /* Parse the assignment-expression. */
7535 /* Build the conditional-expression. */
7537 expr,
7538 assignment_expr,
7539 tf_warning_or_error);
7540 }
7542 /* Parse an assignment-expression.
7544 assignment-expression:
7545 conditional-expression
7546 logical-or-expression assignment-operator assignment_expression
7547 throw-expression
7549 CAST_P is true if this expression is the target of a cast.
7551 Returns a representation for the expression. */
7553 static tree
7556 {
7557 tree expr;
7559 /* If the next token is the `throw' keyword, then we're looking at
7560 a throw-expression. */
7563 /* Otherwise, it must be that we are looking at a
7564 logical-or-expression. */
7565 else
7566 {
7567 /* Parse the binary expressions (logical-or-expression). */
7570 /* If the next token is a `?' then we're actually looking at a
7571 conditional-expression. */
7574 else
7575 {
7578 /* If it's an assignment-operator, we're using the second
7579 production. */
7580 enum tree_code assignment_operator
7583 {
7585 location_t saved_input_location;
7587 /* Parse the right-hand side of the assignment. */
7593 /* An assignment may not appear in a
7594 constant-expression. */
7596 NIC_ASSIGNMENT))
7598 /* Build the assignment expression. Its default
7599 location is the location of the '=' token. */
7603 assignment_operator,
7604 rhs,
7605 tf_warning_or_error);
7607 }
7608 }
7609 }
7612 }
7614 /* Parse an (optional) assignment-operator.
7616 assignment-operator: one of
7617 = *= /= %= += -= >>= <<= &= ^= |=
7619 GNU Extension:
7621 assignment-operator: one of
7622 <?= >?=
7624 If the next token is an assignment operator, the corresponding tree
7625 code is returned, and the token is consumed. For example, for
7626 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7627 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7628 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7629 operator, ERROR_MARK is returned. */
7631 static enum tree_code
7633 {
7637 /* Peek at the next token. */
7641 {
7687 /* Nothing else is an assignment operator. */
7689 }
7691 /* If it was an assignment operator, consume it. */
7696 }
7698 /* Parse an expression.
7700 expression:
7701 assignment-expression
7702 expression , assignment-expression
7704 CAST_P is true if this expression is the target of a cast.
7706 Returns a representation of the expression. */
7708 static tree
7710 {
7715 {
7716 tree assignment_expression;
7718 /* Parse the next assignment-expression. */
7719 assignment_expression
7721 /* If this is the first assignment-expression, we can just
7722 save it away. */
7725 else
7727 assignment_expression,
7728 tf_warning_or_error);
7729 /* If the next token is not a comma, then we are done with the
7730 expression. */
7733 /* Consume the `,'. */
7736 /* A comma operator cannot appear in a constant-expression. */
7739 }
7742 }
7744 /* Parse a constant-expression.
7746 constant-expression:
7747 conditional-expression
7749 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7750 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7751 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7752 is false, NON_CONSTANT_P should be NULL. */
7754 static tree
7758 {
7762 tree expression;
7764 /* It might seem that we could simply parse the
7765 conditional-expression, and then check to see if it were
7766 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7767 one that the compiler can figure out is constant, possibly after
7768 doing some simplifications or optimizations. The standard has a
7769 precise definition of constant-expression, and we must honor
7770 that, even though it is somewhat more restrictive.
7772 For example:
7774 int i[(2, 3)];
7776 is not a legal declaration, because `(2, 3)' is not a
7777 constant-expression. The `,' operator is forbidden in a
7778 constant-expression. However, GCC's constant-folding machinery
7779 will fold this operation to an INTEGER_CST for `3'. */
7781 /* Save the old settings. */
7783 saved_allow_non_integral_constant_expression_p
7786 /* We are now parsing a constant-expression. */
7788 parser->allow_non_integral_constant_expression_p
7791 /* Although the grammar says "conditional-expression", we parse an
7792 "assignment-expression", which also permits "throw-expression"
7793 and the use of assignment operators. In the case that
7794 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7795 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7796 actually essential that we look for an assignment-expression.
7797 For example, cp_parser_initializer_clauses uses this function to
7798 determine whether a particular assignment-expression is in fact
7799 constant. */
7801 /* Restore the old settings. */
7802 parser->integral_constant_expression_p
7804 parser->allow_non_integral_constant_expression_p
7807 {
7808 /* Require an rvalue constant expression here; that's what our
7809 callers expect. Reference constant expressions are handled
7810 separately in e.g. cp_parser_template_argument. */
7815 }
7818 parser->non_integral_constant_expression_p
7822 }
7824 /* Parse __builtin_offsetof.
7826 offsetof-expression:
7827 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7829 offsetof-member-designator:
7830 id-expression
7831 | offsetof-member-designator "." id-expression
7832 | offsetof-member-designator "[" expression "]"
7833 | offsetof-member-designator "->" id-expression */
7835 static tree
7837 {
7840 cp_id_kind dummy;
7843 /* We're about to accept non-integral-constant things, but will
7844 definitely yield an integral constant expression. Save and
7845 restore these values around our local parsing. */
7849 /* Consume the "__builtin_offsetof" token. */
7851 /* Consume the opening `('. */
7853 /* Parse the type-id. */
7855 /* Look for the `,'. */
7859 /* Build the (type *)null that begins the traditional offsetof macro. */
7861 tf_warning_or_error);
7863 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7867 {
7870 {
7872 /* offsetof-member-designator "[" expression "]" */
7877 /* offsetof-member-designator "->" identifier */
7879 /* FALLTHRU */
7882 /* offsetof-member-designator "." identifier */
7890 /* Consume the ")" token. */
7895 /* Error. We know the following require will fail, but
7896 that gives the proper error message. */
7901 }
7902 }
7904 success:
7905 /* If we're processing a template, we can't finish the semantics yet.
7906 Otherwise we can fold the entire expression now. */
7909 else
7912 failure:
7917 }
7919 /* Parse a trait expression.
7921 Returns a representation of the expression, the underlying type
7922 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7924 static tree
7926 {
7927 cp_trait_kind kind;
7930 cp_decl_specifier_seq decl_specs;
7933 {
8010 }
8012 /* Consume the token. */
8022 /* Build a trivial decl-specifier-seq. */
8026 /* Call grokdeclarator to figure out what type this is. */
8031 {
8039 /* Build a trivial decl-specifier-seq. */
8043 /* Call grokdeclarator to figure out what type this is. */
8046 }
8050 /* Complete the trait expression, which may mean either processing
8051 the trait expr now or saving it for template instantiation. */
8053 {
8062 }
8063 }
8065 /* Lambdas that appear in variable initializer or default argument scope
8066 get that in their mangling, so we need to record it. We might as well
8067 use the count for function and namespace scopes as well. */
8071 {
8072 tree t;
8077 static void
8079 {
8080 tree_int ti;
8082 /* Once we're inside a function, we ignore other scopes and just push
8083 the function again so that popping works properly. */
8090 {
8091 /* Don't reset the count if we're still in the same function. */
8094 }
8095 }
8097 static void
8099 {
8102 }
8104 static void
8106 {
8109 {
8112 }
8114 }
8116 /* Parse a lambda expression.
8118 lambda-expression:
8119 lambda-introducer lambda-declarator [opt] compound-statement
8121 Returns a representation of the expression. */
8123 static tree
8125 {
8127 tree type;
8137 /* We may be in the middle of deferred access check. Disable
8138 it now. */
8149 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8152 /* Now that we've started the type, add the capture fields for any
8153 explicit captures. */
8156 {
8157 /* Inside the class, surrounding template-parameter-lists do not apply. */
8158 unsigned int saved_num_template_parameter_lists
8167 /* By virtue of defining a local class, a lambda expression has access to
8168 the private variables of enclosing classes. */
8177 /* The capture list was built up in reverse order; fix that now. */
8178 {
8184 {
8188 }
8190 }
8200 }
8204 /* This field is only used during parsing of the lambda. */
8207 /* This lambda shouldn't have any proxies left at this point. */
8209 /* And now that we're done, push proxies for an enclosing lambda. */
8214 else
8216 }
8218 /* Parse the beginning of a lambda expression.
8220 lambda-introducer:
8221 [ lambda-capture [opt] ]
8223 LAMBDA_EXPR is the current representation of the lambda expression. */
8225 static void
8227 {
8228 /* Need commas after the first capture. */
8231 /* Eat the leading `['. */
8234 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8242 {
8245 }
8248 {
8250 tree capture_id;
8251 tree capture_init_expr;
8255 enum capture_kind_type
8256 {
8257 BY_COPY,
8258 BY_REFERENCE
8259 };
8263 {
8266 }
8270 else
8273 /* Possibly capture `this'. */
8275 {
8285 explicit_init_p);
8287 }
8289 /* Remember whether we want to capture as a reference or not. */
8291 {
8294 }
8296 /* Get the identifier. */
8301 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8302 delimiters, but I modified this to stop on unnested ']' as well. It
8303 was already changed to stop on unnested '}', so the
8304 "closing_parenthesis" name is no more misleading with my change. */
8305 {
8311 }
8313 /* Find the initializer for this capture. */
8315 {
8316 /* An explicit expression exists. */
8319 "ISO C++ does not allow initializers "
8325 }
8326 else
8327 {
8330 /* Turn the identifier into an id-expression. */
8331 capture_init_expr
8332 = cp_parser_lookup_name
8334 capture_id,
8335 none_type,
8343 {
8346 }
8350 {
8353 capture_init_expr);
8356 }
8359 {
8362 capture_init_expr);
8365 }
8367 capture_init_expr
8368 = finish_id_expression
8370 capture_init_expr,
8382 }
8386 {
8391 capture_id);
8395 "capture of %qD redundant with by-reference capture "
8397 }
8400 capture_id,
8401 capture_init_expr,
8403 explicit_init_p);
8404 }
8407 }
8409 /* Parse the (optional) middle of a lambda expression.
8411 lambda-declarator:
8412 ( parameter-declaration-clause [opt] )
8413 attribute-specifier [opt]
8414 mutable [opt]
8415 exception-specification [opt]
8416 lambda-return-type-clause [opt]
8418 LAMBDA_EXPR is the current representation of the lambda expression. */
8420 static bool
8422 {
8423 /* 5.1.1.4 of the standard says:
8424 If a lambda-expression does not include a lambda-declarator, it is as if
8425 the lambda-declarator were ().
8426 This means an empty parameter list, no attributes, and no exception
8427 specification. */
8431 tree t;
8433 /* The lambda-declarator is optional, but must begin with an opening
8434 parenthesis if present. */
8436 {
8441 /* Parse parameters. */
8444 /* Default arguments shall not be specified in the
8445 parameter-declaration-clause of a lambda-declarator. */
8455 /* Parse optional `mutable' keyword. */
8457 {
8460 }
8462 /* Parse optional exception specification. */
8465 /* Parse optional trailing return type. */
8467 {
8470 }
8472 /* The function parameters must be in scope all the way until after the
8473 trailing-return-type in case of decltype. */
8478 }
8480 /* Create the function call operator.
8482 Messing with declarators like this is no uglier than building up the
8483 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8484 other code. */
8485 {
8486 cp_decl_specifier_seq return_type_specs;
8488 tree fco;
8495 else
8496 /* Maybe we will deduce the return type later. */
8502 sfk_none);
8507 VIRT_SPEC_UNSPECIFIED,
8508 exception_spec,
8513 declarator,
8514 attributes);
8516 {
8519 /* Give the object parameter a different name. */
8521 }
8528 }
8529 }
8531 /* Parse the body of a lambda expression, which is simply
8533 compound-statement
8535 but which requires special handling.
8536 LAMBDA_EXPR is the current representation of the lambda expression. */
8538 static void
8540 {
8545 else
8546 /* Still increment function_depth so that we don't GC in the
8547 middle of an expression. */
8549 /* Clear this in case we're in the middle of a default argument. */
8552 /* Finish the function call operator
8553 - class_specifier
8554 + late_parsing_for_member
8555 + function_definition_after_declarator
8556 + ctor_initializer_opt_and_function_body */
8557 {
8559 tree body;
8561 tree compound_stmt;
8562 tree cap;
8564 /* Let the front end know that we are going to be defining this
8565 function. */
8567 NULL_TREE,
8576 /* Push the proxies for any explicit captures. */
8583 /* 5.1.1.4 of the standard says:
8584 If a lambda-expression does not include a trailing-return-type, it
8585 is as if the trailing-return-type denotes the following type:
8586 * if the compound-statement is of the form
8587 { return attribute-specifier [opt] expression ; }
8588 the type of the returned expression after lvalue-to-rvalue
8589 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8590 (_conv.array_ 4.2), and function-to-pointer conversion
8591 (_conv.func_ 4.3);
8592 * otherwise, void. */
8594 /* In a lambda that has neither a lambda-return-type-clause
8595 nor a deducible form, errors should be reported for return statements
8596 in the body. Since we used void as the placeholder return type, parsing
8597 the body as usual will give such desired behavior. */
8601 {
8605 /* Parse tentatively in case there's more after the initial return
8606 statement. */
8617 {
8621 /* Will get error here if type not deduced yet. */
8625 }
8626 }
8629 {
8634 }
8638 out:
8642 /* Finish the function and generate code for it if necessary. */
8644 }
8649 else
8651 }
8653 /* Statements [gram.stmt.stmt] */
8655 /* Parse a statement.
8657 statement:
8658 labeled-statement
8659 expression-statement
8660 compound-statement
8661 selection-statement
8662 iteration-statement
8663 jump-statement
8664 declaration-statement
8665 try-block
8667 C++11:
8669 statement:
8670 labeled-statement
8671 attribute-specifier-seq (opt) expression-statement
8672 attribute-specifier-seq (opt) compound-statement
8673 attribute-specifier-seq (opt) selection-statement
8674 attribute-specifier-seq (opt) iteration-statement
8675 attribute-specifier-seq (opt) jump-statement
8676 declaration-statement
8677 attribute-specifier-seq (opt) try-block
8679 TM Extension:
8681 statement:
8682 atomic-statement
8684 IN_COMPOUND is true when the statement is nested inside a
8685 cp_parser_compound_statement; this matters for certain pragmas.
8687 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8688 is a (possibly labeled) if statement which is not enclosed in braces
8689 and has an else clause. This is used to implement -Wparentheses. */
8691 static void
8694 {
8699 restart:
8702 /* There is no statement yet. */
8708 /* In obj-c++, seing '[[' might be the either the beginning of
8709 c++11 attributes, or a nested objc-message-expression. So
8710 let's parse the c++11 attributes tentatively. */
8714 {
8717 }
8719 /* Peek at the next token. */
8721 /* Remember the location of the first token in the statement. */
8723 /* If this is a keyword, then that will often determine what kind of
8724 statement we have. */
8726 {
8730 {
8733 /* Looks like a labeled-statement with a case label.
8734 Parse the label, and then use tail recursion to parse
8735 the statement. */
8757 /* Objective-C++ exception-handling constructs. */
8771 /* This must be a namespace alias definition. */
8784 /* It might be a keyword like `int' that can start a
8785 declaration-statement. */
8787 }
8788 }
8790 {
8791 /* If the next token is a `:', then we are looking at a
8792 labeled-statement. */
8795 {
8796 /* Looks like a labeled-statement with an ordinary label.
8797 Parse the label, and then use tail recursion to parse
8798 the statement. */
8802 }
8803 }
8804 /* Anything that starts with a `{' must be a compound-statement. */
8807 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8808 a statement all its own. */
8810 {
8811 /* Only certain OpenMP pragmas are attached to statements, and thus
8812 are considered statements themselves. All others are not. In
8813 the context of a compound, accept the pragma as a "statement" and
8814 return so that we can check for a close brace. Otherwise we
8815 require a real statement and must go back and read one. */
8821 }
8823 {
8826 }
8828 /* Everything else must be a declaration-statement or an
8829 expression-statement. Try for the declaration-statement
8830 first, unless we are looking at a `;', in which case we know that
8831 we have an expression-statement. */
8833 {
8835 {
8837 {
8838 /* Attributes should be parsed as part of the the
8839 declaration, so let's un-parse them. */
8842 }
8845 /* Try to parse the declaration-statement. */
8847 /* If that worked, we're done. */
8850 }
8851 /* Look for an expression-statement instead. */
8853 }
8855 /* Set the line number for the statement. */
8859 /* Note that for now, we don't do anything with c++11 statements
8860 parsed at this level. */
8863 OPT_Wattributes,
8865 }
8867 /* Parse the label for a labeled-statement, i.e.
8869 identifier :
8870 case constant-expression :
8871 default :
8873 GNU Extension:
8874 case constant-expression ... constant-expression : statement
8876 When a label is parsed without errors, the label is added to the
8877 parse tree by the finish_* functions, so this function doesn't
8878 have to return the label. */
8880 static void
8882 {
8887 /* The next token should be an identifier. */
8891 {
8894 }
8898 {
8900 {
8904 /* Consume the `case' token. */
8906 /* Parse the constant-expression. */
8909 NULL);
8913 {
8914 /* Consume the `...' token. */
8916 expr_hi =
8919 NULL);
8920 /* We don't need to emit warnings here, as the common code
8921 will do this for us. */
8922 }
8923 else
8928 else
8931 expr);
8932 }
8936 /* Consume the `default' token. */
8941 else
8946 /* Anything else must be an ordinary label. */
8949 }
8951 /* Require the `:' token. */
8954 /* An ordinary label may optionally be followed by attributes.
8955 However, this is only permitted if the attributes are then
8956 followed by a semicolon. This is because, for backward
8957 compatibility, when parsing
8958 lab: __attribute__ ((unused)) int i;
8959 we want the attribute to attach to "i", not "lab". */
8962 {
8963 tree attrs;
8970 ;
8971 else
8973 }
8979 }
8981 /* Parse an expression-statement.
8983 expression-statement:
8984 expression [opt] ;
8986 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8987 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8988 indicates whether this expression-statement is part of an
8989 expression statement. */
8991 static tree
8993 {
8997 /* If the next token is a ';', then there is no expression
8998 statement. */
9002 /* Give a helpful message for "A<T>::type t;" and the like. */
9005 {
9012 {
9013 /* A::A a; */
9018 }
9019 }
9021 /* Consume the final `;'. */
9026 /* This is the final expression statement of a statement
9027 expression. */
9031 else
9035 }
9037 /* Parse a compound-statement.
9039 compound-statement:
9040 { statement-seq [opt] }
9042 GNU extension:
9044 compound-statement:
9045 { label-declaration-seq [opt] statement-seq [opt] }
9047 label-declaration-seq:
9048 label-declaration
9049 label-declaration-seq label-declaration
9051 Returns a tree representing the statement. */
9053 static tree
9056 {
9057 tree compound_stmt;
9059 /* Consume the `{'. */
9066 /* Begin the compound-statement. */
9068 /* If the next keyword is `__label__' we have a label declaration. */
9071 /* Parse an (optional) statement-seq. */
9073 /* Finish the compound-statement. */
9075 /* Consume the `}'. */
9079 }
9081 /* Parse an (optional) statement-seq.
9083 statement-seq:
9084 statement
9085 statement-seq [opt] statement */
9087 static void
9089 {
9090 /* Scan statements until there aren't any more. */
9092 {
9095 /* If we are looking at a `}', then we have run out of
9096 statements; the same is true if we have reached the end
9097 of file, or have stumbled upon a stray '@end'. */
9104 /* If we are in a compound statement and find 'else' then
9105 something went wrong. */
9107 {
9110 else
9111 {
9114 }
9115 }
9117 /* Parse the statement. */
9119 }
9120 }
9122 /* Parse a selection-statement.
9124 selection-statement:
9125 if ( condition ) statement
9126 if ( condition ) statement else statement
9127 switch ( condition ) statement
9129 Returns the new IF_STMT or SWITCH_STMT.
9131 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9132 is a (possibly labeled) if statement which is not enclosed in
9133 braces and has an else clause. This is used to implement
9134 -Wparentheses. */
9136 static tree
9138 {
9145 /* Peek at the next token. */
9148 /* See what kind of keyword it is. */
9151 {
9154 {
9155 tree statement;
9156 tree condition;
9158 /* Look for the `('. */
9160 {
9163 }
9165 /* Begin the selection-statement. */
9168 else
9171 /* Parse the condition. */
9173 /* Look for the `)'. */
9179 {
9183 /* Add the condition. */
9186 /* Parse the then-clause. */
9190 {
9198 }
9199 else
9205 /* If the next token is `else', parse the else-clause. */
9207 RID_ELSE))
9208 {
9209 /* Consume the `else' keyword. */
9212 /* Parse the else-clause. */
9214 {
9215 location_t loc;
9222 }
9223 else
9228 /* If we are currently parsing a then-clause, then
9229 IF_P will not be NULL. We set it to true to
9230 indicate that this if statement has an else clause.
9231 This may trigger the Wparentheses warning below
9232 when we get back up to the parent if statement. */
9235 }
9236 else
9237 {
9238 /* This if statement does not have an else clause. If
9239 NESTED_IF is true, then the then-clause is an if
9240 statement which does have an else clause. We warn
9241 about the potential ambiguity. */
9244 "suggest explicit braces to avoid ambiguous"
9246 }
9248 /* Now we're all done with the if-statement. */
9250 }
9251 else
9252 {
9256 /* Add the condition. */
9259 /* Parse the body of the switch-statement. */
9268 /* Now we're all done with the switch-statement. */
9270 }
9273 }
9279 }
9280 }
9282 /* Parse a condition.
9284 condition:
9285 expression
9286 type-specifier-seq declarator = initializer-clause
9287 type-specifier-seq declarator braced-init-list
9289 GNU Extension:
9291 condition:
9292 type-specifier-seq declarator asm-specification [opt]
9293 attributes [opt] = assignment-expression
9295 Returns the expression that should be tested. */
9297 static tree
9299 {
9300 cp_decl_specifier_seq type_specifiers;
9304 /* Try the declaration first. */
9306 /* New types are not allowed in the type-specifier-seq for a
9307 condition. */
9309 parser->type_definition_forbidden_message
9311 /* Parse the type-specifier-seq. */
9313 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9316 /* Restore the saved message. */
9318 /* If all is well, we might be looking at a declaration. */
9320 {
9321 tree decl;
9322 tree asm_specification;
9323 tree attributes;
9327 /* Parse the declarator. */
9332 /* Parse the attributes. */
9334 /* Parse the asm-specification. */
9336 /* If the next token is not an `=' or '{', then we might still be
9337 looking at an expression. For example:
9339 if (A(a).x)
9341 looks like a decl-specifier-seq and a declarator -- but then
9342 there is no `=', so this is an expression. */
9347 /* If we did see an `=' or '{', then we are looking at a declaration
9348 for sure. */
9350 {
9351 tree pushed_scope;
9355 /* Create the declaration. */
9361 /* Parse the initializer. */
9363 {
9367 }
9368 else
9369 {
9370 /* Consume the `='. */
9373 }
9377 /* Process the initializer. */
9380 asm_specification,
9381 flags);
9387 }
9388 }
9389 /* If we didn't even get past the declarator successfully, we are
9390 definitely not looking at a declaration. */
9391 else
9394 /* Otherwise, we are looking at an expression. */
9396 }
9398 /* Parses a for-statement or range-for-statement until the closing ')',
9399 not included. */
9401 static tree
9403 {
9407 /* Begin the for-statement. */
9410 /* Parse the initialization. */
9415 else
9417 }
9419 static tree
9421 {
9422 /* Normal for loop */
9425 tree stmt;
9428 /* The for-init-statement has already been parsed in
9429 cp_parser_for_init_statement, so no work is needed here. */
9432 /* If there's a condition, process it. */
9436 /* Look for the `;'. */
9439 /* If there's an expression, process it. */
9445 }
9447 /* Tries to parse a range-based for-statement:
9449 range-based-for:
9450 decl-specifier-seq declarator : expression
9452 The decl-specifier-seq declarator and the `:' are already parsed by
9453 cp_parser_for_init_statement. If processing_template_decl it returns a
9454 newly created RANGE_FOR_STMT; if not, it is converted to a
9455 regular FOR_STMT. */
9457 static tree
9459 {
9463 {
9466 }
9467 else
9470 /* If in template, STMT is converted to a normal for-statement
9471 at instantiation. If not, it is done just ahead. */
9473 {
9479 /* do_auto_deduction doesn't mess with template init-lists. */
9482 }
9483 else
9484 {
9487 }
9489 }
9491 /* Subroutine of cp_convert_range_for: given the initializer expression,
9492 builds up the range temporary. */
9494 static tree
9496 {
9499 /* Find out the type deduced by the declaration
9500 `auto &&__range = range_expr'. */
9505 /* Create the __range variable. */
9512 }
9514 /* Used by cp_parser_range_for in template context: we aren't going to
9515 do a full conversion yet, but we still need to resolve auto in the
9516 type of the for-range-declaration if present. This is basically
9517 a shortcut version of cp_convert_range_for. */
9519 static void
9521 {
9524 {
9527 iter_type = (cp_parser_perform_range_for_lookup
9531 tf_warning_or_error);
9534 }
9535 }
9537 /* Converts a range-based for-statement into a normal
9538 for-statement, as per the definition.
9540 for (RANGE_DECL : RANGE_EXPR)
9541 BLOCK
9543 should be equivalent to:
9545 {
9546 auto &&__range = RANGE_EXPR;
9547 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9548 __begin != __end;
9549 ++__begin)
9550 {
9551 RANGE_DECL = *__begin;
9552 BLOCK
9553 }
9554 }
9556 If RANGE_EXPR is an array:
9557 BEGIN_EXPR = __range
9558 END_EXPR = __range + ARRAY_SIZE(__range)
9559 Else if RANGE_EXPR has a member 'begin' or 'end':
9560 BEGIN_EXPR = __range.begin()
9561 END_EXPR = __range.end()
9562 Else:
9563 BEGIN_EXPR = begin(__range)
9564 END_EXPR = end(__range);
9566 If __range has a member 'begin' but not 'end', or vice versa, we must
9567 still use the second alternative (it will surely fail, however).
9568 When calling begin()/end() in the third alternative we must use
9569 argument dependent lookup, but always considering 'std' as an associated
9570 namespace. */
9572 tree
9574 {
9580 /* If an error happened previously do nothing or else a lot of
9581 unhelpful errors would be issued. */
9583 else
9584 {
9589 LOOKUP_ONLYCONVERTING);
9594 }
9596 /* The new for initialization statement. */
9604 LOOKUP_ONLYCONVERTING);
9613 LOOKUP_ONLYCONVERTING);
9617 /* The new for condition. */
9624 /* The new increment expression. */
9629 /* The declaration is initialized with *__begin inside the loop body. */
9632 tf_warning_or_error),
9634 LOOKUP_ONLYCONVERTING);
9637 }
9639 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9640 We need to solve both at the same time because the method used
9641 depends on the existence of members begin or end.
9642 Returns the type deduced for the iterator expression. */
9644 static tree
9646 {
9648 {
9651 }
9654 {
9659 }
9661 {
9662 /* If RANGE is an array, we will use pointer arithmetic. */
9665 range,
9669 }
9670 else
9671 {
9672 /* If it is not an array, we must do a bit of magic. */
9682 tf_warning_or_error);
9685 tf_warning_or_error);
9688 {
9689 /* Use the member functions. */
9692 else
9698 else
9701 }
9702 else
9703 {
9704 /* Use global functions with ADL. */
9712 tf_warning_or_error);
9714 tf_warning_or_error);
9717 tf_warning_or_error);
9719 tf_warning_or_error);
9722 }
9724 /* Last common checks. */
9726 {
9727 /* If one of the expressions is an error do no more checks. */
9730 }
9731 else
9732 {
9734 /* The unqualified type of the __begin and __end temporaries should
9735 be the same, as required by the multiple auto declaration. */
9741 }
9742 }
9743 }
9745 /* Helper function for cp_parser_perform_range_for_lookup.
9746 Builds a tree for RANGE.IDENTIFIER(). */
9748 static tree
9750 {
9763 tf_warning_or_error);
9766 }
9768 /* Parse an iteration-statement.
9770 iteration-statement:
9771 while ( condition ) statement
9772 do statement while ( expression ) ;
9773 for ( for-init-statement condition [opt] ; expression [opt] )
9774 statement
9776 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9778 static tree
9780 {
9783 tree statement;
9786 /* Peek at the next token. */
9791 /* Remember whether or not we are already within an iteration
9792 statement. */
9795 /* See what kind of keyword it is. */
9798 {
9800 {
9801 tree condition;
9803 /* Begin the while-statement. */
9805 /* Look for the `('. */
9807 /* Parse the condition. */
9810 /* Look for the `)'. */
9812 /* Parse the dependent statement. */
9816 /* We're done with the while-statement. */
9818 }
9822 {
9823 tree expression;
9825 /* Begin the do-statement. */
9827 /* Parse the body of the do-statement. */
9832 /* Look for the `while' keyword. */
9834 /* Look for the `('. */
9836 /* Parse the expression. */
9838 /* We're done with the do-statement. */
9840 /* Look for the `)'. */
9842 /* Look for the `;'. */
9844 }
9848 {
9849 /* Look for the `('. */
9854 /* Look for the `)'. */
9857 /* Parse the body of the for-statement. */
9862 /* We're done with the for-statement. */
9864 }
9871 }
9874 }
9876 /* Parse a for-init-statement or the declarator of a range-based-for.
9877 Returns true if a range-based-for declaration is seen.
9879 for-init-statement:
9880 expression-statement
9881 simple-declaration */
9883 static bool
9885 {
9886 /* If the next token is a `;', then we have an empty
9887 expression-statement. Grammatically, this is also a
9888 simple-declaration, but an invalid one, because it does not
9889 declare anything. Therefore, if we did not handle this case
9890 specially, we would issue an error message about an invalid
9891 declaration. */
9893 {
9899 /* We're going to speculatively look for a declaration, falling back
9900 to an expression, if necessary. */
9902 /* Parse the declaration. */
9905 decl);
9908 {
9909 /* It is a range-for, consume the ':' */
9913 {
9915 "range-based %<for%> loops are not allowed "
9918 }
9919 }
9920 else
9921 /* The ';' is not consumed yet because we told
9922 cp_parser_simple_declaration not to. */
9927 /* If the tentative parse failed, then we shall need to look for an
9928 expression-statement. */
9929 }
9930 /* If we are here, it is an expression-statement. */
9933 }
9935 /* Parse a jump-statement.
9937 jump-statement:
9938 break ;
9939 continue ;
9940 return expression [opt] ;
9941 return braced-init-list ;
9942 goto identifier ;
9944 GNU extension:
9946 jump-statement:
9947 goto * expression ;
9949 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9951 static tree
9953 {
9959 /* Peek at the next token. */
9964 /* See what kind of keyword it is. */
9967 {
9971 {
9986 }
9992 {
10005 }
10010 {
10011 tree expr;
10015 {
10018 }
10021 else
10022 /* If the next token is a `;', then there is no
10023 expression. */
10025 /* Build the return-statement. */
10027 /* Look for the final `;'. */
10029 }
10033 /* Create the goto-statement. */
10035 {
10036 /* Issue a warning about this use of a GNU extension. */
10038 /* Consume the '*' token. */
10040 /* Parse the dependent expression. */
10042 }
10043 else
10045 /* Look for the final `;'. */
10052 }
10055 }
10057 /* Parse a declaration-statement.
10059 declaration-statement:
10060 block-declaration */
10062 static void
10064 {
10067 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10070 /* Parse the block-declaration. */
10073 /* Free any declarators allocated. */
10076 /* Finish off the statement. */
10078 }
10080 /* Some dependent statements (like `if (cond) statement'), are
10081 implicitly in their own scope. In other words, if the statement is
10082 a single statement (as opposed to a compound-statement), it is
10083 none-the-less treated as if it were enclosed in braces. Any
10084 declarations appearing in the dependent statement are out of scope
10085 after control passes that point. This function parses a statement,
10086 but ensures that is in its own scope, even if it is not a
10087 compound-statement.
10089 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10090 is a (possibly labeled) if statement which is not enclosed in
10091 braces and has an else clause. This is used to implement
10092 -Wparentheses.
10094 Returns the new statement. */
10096 static tree
10098 {
10099 tree statement;
10104 /* Mark if () ; with a special NOP_EXPR. */
10106 {
10110 }
10111 /* if a compound is opened, we simply parse the statement directly. */
10114 /* If the token is not a `{', then we must take special action. */
10115 else
10116 {
10117 /* Create a compound-statement. */
10119 /* Parse the dependent-statement. */
10121 /* Finish the dummy compound-statement. */
10123 }
10125 /* Return the statement. */
10127 }
10129 /* For some dependent statements (like `while (cond) statement'), we
10130 have already created a scope. Therefore, even if the dependent
10131 statement is a compound-statement, we do not want to create another
10132 scope. */
10134 static void
10136 {
10137 /* If the token is a `{', then we must take special action. */
10140 else
10141 {
10142 /* Avoid calling cp_parser_compound_statement, so that we
10143 don't create a new scope. Do everything else by hand. */
10145 /* If the next keyword is `__label__' we have a label declaration. */
10148 /* Parse an (optional) statement-seq. */
10151 }
10152 }
10154 /* Declarations [gram.dcl.dcl] */
10156 /* Parse an optional declaration-sequence.
10158 declaration-seq:
10159 declaration
10160 declaration-seq declaration */
10162 static void
10164 {
10166 {
10177 {
10178 /* A declaration consisting of a single semicolon is
10179 invalid. Allow it unless we're being pedantic. */
10184 }
10186 /* If we're entering or exiting a region that's implicitly
10187 extern "C", modify the lang context appropriately. */
10189 {
10192 }
10194 {
10197 }
10200 {
10201 /* A top-level declaration can consist solely of a #pragma.
10202 A nested declaration cannot, so this is done here and not
10203 in cp_parser_declaration. (A #pragma at block scope is
10204 handled in cp_parser_statement.) */
10207 }
10209 /* Parse the declaration itself. */
10211 }
10212 }
10214 /* Parse a declaration.
10216 declaration:
10217 block-declaration
10218 function-definition
10219 template-declaration
10220 explicit-instantiation
10221 explicit-specialization
10222 linkage-specification
10223 namespace-definition
10225 GNU extension:
10227 declaration:
10228 __extension__ declaration */
10230 static void
10232 {
10233 cp_token token1;
10234 cp_token token2;
10239 /* Check for the `__extension__' keyword. */
10241 {
10242 /* Parse the qualified declaration. */
10244 /* Restore the PEDANTIC flag. */
10248 }
10250 /* Try to figure out what kind of declaration is present. */
10255 else
10256 {
10259 }
10261 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10264 /* If the next token is `extern' and the following token is a string
10265 literal, then we have a linkage specification. */
10269 /* If the next token is `template', then we have either a template
10270 declaration, an explicit instantiation, or an explicit
10271 specialization. */
10273 {
10274 /* `template <>' indicates a template specialization. */
10278 /* `template <' indicates a template declaration. */
10281 /* Anything else must be an explicit instantiation. */
10282 else
10284 }
10285 /* If the next token is `export', then we have a template
10286 declaration. */
10289 /* If the next token is `extern', 'static' or 'inline' and the one
10290 after that is `template', we have a GNU extended explicit
10291 instantiation directive. */
10298 /* If the next token is `namespace', check for a named or unnamed
10299 namespace definition. */
10305 /* An unnamed namespace definition. */
10309 /* An inline (associated) namespace definition. */
10313 /* Objective-C++ declaration/definition. */
10320 /* We must have either a block declaration or a function
10321 definition. */
10322 else
10323 /* Try to parse a block-declaration, or a function-definition. */
10326 /* Free any declarators allocated. */
10328 }
10330 /* Parse a block-declaration.
10332 block-declaration:
10333 simple-declaration
10334 asm-definition
10335 namespace-alias-definition
10336 using-declaration
10337 using-directive
10339 GNU Extension:
10341 block-declaration:
10342 __extension__ block-declaration
10344 C++0x Extension:
10346 block-declaration:
10347 static_assert-declaration
10349 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10350 part of a declaration-statement. */
10352 static void
10355 {
10359 /* Check for the `__extension__' keyword. */
10361 {
10362 /* Parse the qualified declaration. */
10364 /* Restore the PEDANTIC flag. */
10368 }
10370 /* Peek at the next token to figure out which kind of declaration is
10371 present. */
10374 /* If the next keyword is `asm', we have an asm-definition. */
10376 {
10380 }
10381 /* If the next keyword is `namespace', we have a
10382 namespace-alias-definition. */
10385 /* If the next keyword is `using', we have a
10386 using-declaration, a using-directive, or an alias-declaration. */
10388 {
10393 /* If the token after `using' is `namespace', then we have a
10394 using-directive. */
10398 /* If the second token after 'using' is '=', then we have an
10399 alias-declaration. */
10405 /* Otherwise, it's a using-declaration. */
10406 else
10409 }
10410 /* If the next keyword is `__label__' we have a misplaced label
10411 declaration. */
10413 {
10417 /* If the next token is now a `;', consume it. */
10420 }
10421 /* If the next token is `static_assert' we have a static assertion. */
10424 /* Anything else must be a simple-declaration. */
10425 else
10428 }
10430 /* Parse a simple-declaration.
10432 simple-declaration:
10433 decl-specifier-seq [opt] init-declarator-list [opt] ;
10435 init-declarator-list:
10436 init-declarator
10437 init-declarator-list , init-declarator
10439 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10440 function-definition as a simple-declaration.
10442 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10443 parsed declaration if it is an uninitialized single declarator not followed
10444 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10445 if present, will not be consumed. */
10447 static void
10451 {
10452 cp_decl_specifier_seq decl_specifiers;
10459 /* Defer access checks until we know what is being declared; the
10460 checks for names appearing in the decl-specifier-seq should be
10461 done as if we were in the scope of the thing being declared. */
10464 /* Parse the decl-specifier-seq. We have to keep track of whether
10465 or not the decl-specifier-seq declares a named class or
10466 enumeration type, since that is the only case in which the
10467 init-declarator-list is allowed to be empty.
10469 [dcl.dcl]
10471 In a simple-declaration, the optional init-declarator-list can be
10472 omitted only when declaring a class or enumeration, that is when
10473 the decl-specifier-seq contains either a class-specifier, an
10474 elaborated-type-specifier, or an enum-specifier. */
10476 CP_PARSER_FLAGS_OPTIONAL,
10479 /* We no longer need to defer access checks. */
10482 /* In a block scope, a valid declaration must always have a
10483 decl-specifier-seq. By not trying to parse declarators, we can
10484 resolve the declaration/expression ambiguity more quickly. */
10487 {
10490 }
10492 /* If the next two tokens are both identifiers, the code is
10493 erroneous. The usual cause of this situation is code like:
10495 T t;
10497 where "T" should name a type -- but does not. */
10500 {
10501 /* If parsing tentatively, we should commit; we really are
10502 looking at a declaration. */
10504 /* Give up. */
10506 }
10508 /* If we have seen at least one decl-specifier, and the next token
10509 is not a parenthesis, then we must be looking at a declaration.
10510 (After "int (" we might be looking at a functional cast.) */
10517 /* Keep going until we hit the `;' at the end of the simple
10518 declaration. */
10521 CPP_SEMICOLON))
10522 {
10525 tree decl;
10528 {
10529 /* If we are processing next declarator, coma is expected */
10535 }
10536 else
10539 /* Parse the init-declarator. */
10542 function_definition_allowed_p,
10544 declares_class_or_enum,
10546 maybe_range_for_decl);
10547 /* If an error occurred while parsing tentatively, exit quickly.
10548 (That usually happens when in the body of a function; each
10549 statement is treated as a declaration-statement until proven
10550 otherwise.) */
10553 /* Handle function definitions specially. */
10555 {
10556 /* If the next token is a `,', then we are probably
10557 processing something like:
10559 void f() {}, *p;
10561 which is erroneous. */
10563 {
10566 "mixing"
10568 }
10569 /* Otherwise, we're done with the list of declarators. */
10570 else
10571 {
10574 }
10575 }
10578 /* The next token should be either a `,' or a `;'. */
10580 /* If it's a `,', there are more declarators to come. */
10583 /* If it's a `;', we are done. */
10586 /* Anything else is an error. */
10587 else
10588 {
10589 /* If we have already issued an error message we don't need
10590 to issue another one. */
10594 /* Skip tokens until we reach the end of the statement. */
10596 /* If the next token is now a `;', consume it. */
10600 }
10601 /* After the first time around, a function-definition is not
10602 allowed -- even if it was OK at first. For example:
10604 int i, f() {}
10606 is not valid. */
10608 }
10610 /* Issue an error message if no declarators are present, and the
10611 decl-specifier-seq does not itself declare a class or
10612 enumeration. */
10614 {
10617 /* Perform any deferred access checks. */
10619 }
10621 /* Consume the `;'. */
10625 done:
10627 }
10629 /* Parse a decl-specifier-seq.
10631 decl-specifier-seq:
10632 decl-specifier-seq [opt] decl-specifier
10633 decl-specifier attribute-specifier-seq [opt] (C++11)
10635 decl-specifier:
10636 storage-class-specifier
10637 type-specifier
10638 function-specifier
10639 friend
10640 typedef
10642 GNU Extension:
10644 decl-specifier:
10645 attributes
10647 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10649 The parser flags FLAGS is used to control type-specifier parsing.
10651 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10652 flags:
10654 1: one of the decl-specifiers is an elaborated-type-specifier
10655 (i.e., a type declaration)
10656 2: one of the decl-specifiers is an enum-specifier or a
10657 class-specifier (i.e., a type definition)
10659 */
10661 static void
10663 cp_parser_flags flags,
10666 {
10670 cp_decl_spec ds;
10672 /* Clear DECL_SPECS. */
10675 /* Assume no class or enumeration type is declared. */
10678 /* Keep reading specifiers until there are no more to read. */
10680 {
10685 /* Peek at the next token. */
10688 /* Save the first token of the decl spec list for error
10689 reporting. */
10692 /* Handle attributes. */
10694 {
10695 /* Parse the attributes. */
10698 /* In a sequence of declaration specifiers, c++11 attributes
10699 appertain to the type that precede them. In that case
10700 [dcl.spec]/1 says:
10702 The attribute-specifier-seq affects the type only for
10703 the declaration it appears in, not other declarations
10704 involving the same type.
10706 But for now let's force the user to position the
10707 attribute either at the beginning of the declaration or
10708 after the declarator-id, which would clearly mean that it
10709 applies to the declarator. */
10711 {
10713 /* The c++11 attribute is at the beginning of the
10714 declaration. It appertains to the entity being
10716 else
10717 {
10719 {
10720 /* This is an attribute following a
10721 class-specifier. */
10726 }
10727 else
10728 {
10729 decl_specs->std_attributes
10731 attrs);
10734 }
10736 }
10737 }
10739 decl_specs->attributes
10741 attrs);
10745 }
10746 /* Assume we will find a decl-specifier keyword. */
10748 /* If the next token is an appropriate keyword, we can simply
10749 add it to the list. */
10751 {
10752 /* decl-specifier:
10753 friend
10754 constexpr */
10757 {
10760 }
10761 else
10762 {
10764 /* Consume the token. */
10766 }
10774 /* function-specifier:
10775 inline
10776 virtual
10777 explicit */
10784 /* decl-specifier:
10785 typedef */
10788 /* Consume the token. */
10790 /* A constructor declarator cannot appear in a typedef. */
10792 /* The "typedef" keyword can only occur in a declaration; we
10793 may as well commit at this point. */
10800 /* storage-class-specifier:
10801 auto
10802 register
10803 static
10804 extern
10805 mutable
10807 GNU Extension:
10808 thread */
10811 {
10812 /* Consume the token. */
10815 /* Complain about `auto' as a storage specifier, if
10816 we're complaining about C++0x compatibility. */
10820 /* Set the storage class anyway. */
10822 token);
10823 }
10824 else
10825 /* C++0x auto type-specifier. */
10833 /* Consume the token. */
10836 token);
10839 /* Consume the token. */
10845 /* We did not yet find a decl-specifier yet. */
10848 }
10858 /* Constructors are a special case. The `S' in `S()' is not a
10859 decl-specifier; it is the beginning of the declarator. */
10860 constructor_p
10861 = (!found_decl_spec
10862 && constructor_possible_p
10863 && (cp_parser_constructor_declarator_p
10866 /* If we don't have a DECL_SPEC yet, then we must be looking at
10867 a type-specifier. */
10869 {
10872 tree type_spec;
10874 type_spec
10876 decl_specs,
10882 /* If this type-specifier referenced a user-defined type
10883 (a typedef, class-name, etc.), then we can't allow any
10884 more such type-specifiers henceforth.
10886 [dcl.spec]
10888 The longest sequence of decl-specifiers that could
10889 possibly be a type name is taken as the
10890 decl-specifier-seq of a declaration. The sequence shall
10891 be self-consistent as described below.
10893 [dcl.type]
10895 As a general rule, at most one type-specifier is allowed
10896 in the complete decl-specifier-seq of a declaration. The
10897 only exceptions are the following:
10899 -- const or volatile can be combined with any other
10900 type-specifier.
10902 -- signed or unsigned can be combined with char, long,
10903 short, or int.
10905 -- ..
10907 Example:
10909 typedef char* Pc;
10910 void g (const int Pc);
10912 Here, Pc is *not* part of the decl-specifier seq; it's
10913 the declarator. Therefore, once we see a type-specifier
10914 (other than a cv-qualifier), we forbid any additional
10915 user-defined types. We *do* still allow things like `int
10916 int' to be considered a decl-specifier-seq, and issue the
10917 error message later. */
10920 /* A constructor declarator cannot follow a type-specifier. */
10922 {
10927 }
10928 }
10930 /* If we still do not have a DECL_SPEC, then there are no more
10931 decl-specifiers. */
10936 /* After we see one decl-specifier, further decl-specifiers are
10937 always optional. */
10939 }
10941 /* Don't allow a friend specifier with a class definition. */
10946 }
10948 /* Parse an (optional) storage-class-specifier.
10950 storage-class-specifier:
10951 auto
10952 register
10953 static
10954 extern
10955 mutable
10957 GNU Extension:
10959 storage-class-specifier:
10960 thread
10962 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10964 static tree
10966 {
10968 {
10972 /* Fall through for C++98. */
10979 /* Consume the token. */
10984 }
10985 }
10987 /* Parse an (optional) function-specifier.
10989 function-specifier:
10990 inline
10991 virtual
10992 explicit
10994 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10995 Updates DECL_SPECS, if it is non-NULL. */
10997 static tree
11000 {
11003 {
11009 /* 14.5.2.3 [temp.mem]
11011 A member function template shall not be virtual. */
11023 }
11025 /* Consume the token. */
11027 }
11029 /* Parse a linkage-specification.
11031 linkage-specification:
11032 extern string-literal { declaration-seq [opt] }
11033 extern string-literal declaration */
11035 static void
11037 {
11038 tree linkage;
11040 /* Look for the `extern' keyword. */
11043 /* Look for the string-literal. */
11046 /* Transform the literal into an identifier. If the literal is a
11047 wide-character string, or contains embedded NULs, then we can't
11048 handle it as the user wants. */
11051 {
11053 /* Assume C++ linkage. */
11055 }
11056 else
11059 /* We're now using the new linkage. */
11062 /* If the next token is a `{', then we're using the first
11063 production. */
11065 {
11066 /* Consume the `{' token. */
11068 /* Parse the declarations. */
11070 /* Look for the closing `}'. */
11072 }
11073 /* Otherwise, there's just one declaration. */
11074 else
11075 {
11078 saved_in_unbraced_linkage_specification_p
11082 parser->in_unbraced_linkage_specification_p
11084 }
11086 /* We're done with the linkage-specification. */
11088 }
11090 /* Parse a static_assert-declaration.
11092 static_assert-declaration:
11093 static_assert ( constant-expression , string-literal ) ;
11095 If MEMBER_P, this static_assert is a class member. */
11097 static void
11099 {
11100 tree condition;
11101 tree message;
11103 location_t saved_loc;
11106 /* Peek at the `static_assert' token so we can keep track of exactly
11107 where the static assertion started. */
11111 /* Look for the `static_assert' keyword. */
11113 RT_STATIC_ASSERT))
11116 /* We know we are in a static assertion; commit to any tentative
11117 parse. */
11121 /* Parse the `(' starting the static assertion condition. */
11124 /* Parse the constant-expression. Allow a non-constant expression
11125 here in order to give better diagnostics in finish_static_assert. */
11126 condition =
11131 /* Parse the separating `,'. */
11134 /* Parse the string-literal message. */
11139 /* A `)' completes the static assertion. */
11146 /* A semicolon terminates the declaration. */
11149 /* Complete the static assertion, which may mean either processing
11150 the static assert now or saving it for template instantiation. */
11152 }
11154 /* Parse a `decltype' type. Returns the type.
11156 simple-type-specifier:
11157 decltype ( expression ) */
11159 static tree
11161 {
11162 tree expr;
11171 {
11172 /* Already parsed. */
11175 }
11177 /* Look for the `decltype' token. */
11181 /* Types cannot be defined in a `decltype' expression. Save away the
11182 old message. */
11185 /* And create the new one. */
11186 parser->type_definition_forbidden_message
11189 /* The restrictions on constant-expressions do not apply inside
11190 decltype expressions. */
11191 saved_integral_constant_expression_p
11193 saved_non_integral_constant_expression_p
11197 /* Do not actually evaluate the expression. */
11200 /* Do not warn about problems with the expression. */
11203 /* Parse the opening `('. */
11207 /* First, try parsing an id-expression. */
11218 {
11221 cp_id_kind idk;
11225 /* Lookup the name we got back from the id-expression. */
11227 none_type,
11241 {
11242 /* Complete lookup of the id-expression. */
11243 expr = (finish_id_expression
11256 /* We found an id-expression, but it was something that we
11257 should not have found. This is an error, not something
11258 we can recover from, so note that we found an
11259 id-expression and we'll recover as gracefully as
11260 possible. */
11262 }
11267 /* We have an id-expression. */
11269 }
11272 {
11273 /* Abort the id-expression parse. */
11276 /* Parsing tentatively, again. */
11279 /* Parse a class member access. */
11287 /* We have an id-expression. */
11289 }
11292 /* We have parsed the complete id-expression or member access. */
11294 else
11295 {
11298 /* Abort our attempt to parse an id-expression or member access
11299 expression. */
11302 /* Within a parenthesized expression, a `>' token is always
11303 the greater-than operator. */
11304 saved_greater_than_is_operator_p
11308 /* Parse a full expression. */
11311 /* The `>' token might be the end of a template-id or
11312 template-parameter-list now. */
11313 parser->greater_than_is_operator_p
11315 }
11317 /* Go back to evaluating expressions. */
11321 /* Restore the old message and the integral constant expression
11322 flags. */
11324 parser->integral_constant_expression_p
11326 parser->non_integral_constant_expression_p
11329 /* Parse to the closing `)'. */
11331 {
11335 }
11338 tf_warning_or_error);
11340 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11341 it again. */
11348 }
11350 /* Special member functions [gram.special] */
11352 /* Parse a conversion-function-id.
11354 conversion-function-id:
11355 operator conversion-type-id
11357 Returns an IDENTIFIER_NODE representing the operator. */
11359 static tree
11361 {
11362 tree type;
11363 tree saved_scope;
11364 tree saved_qualifying_scope;
11365 tree saved_object_scope;
11368 /* Look for the `operator' token. */
11371 /* When we parse the conversion-type-id, the current scope will be
11372 reset. However, we need that information in able to look up the
11373 conversion function later, so we save it here. */
11377 /* We must enter the scope of the class so that the names of
11378 entities declared within the class are available in the
11379 conversion-type-id. For example, consider:
11381 struct S {
11382 typedef int I;
11383 operator I();
11384 };
11386 S::operator I() { ... }
11388 In order to see that `I' is a type-name in the definition, we
11389 must be in the scope of `S'. */
11392 /* Parse the conversion-type-id. */
11394 /* Leave the scope of the class, if any. */
11397 /* Restore the saved scope. */
11401 /* If the TYPE is invalid, indicate failure. */
11405 }
11407 /* Parse a conversion-type-id:
11409 conversion-type-id:
11410 type-specifier-seq conversion-declarator [opt]
11412 Returns the TYPE specified. */
11414 static tree
11416 {
11417 tree attributes;
11418 cp_decl_specifier_seq type_specifiers;
11420 tree type_specified;
11422 /* Parse the attributes. */
11424 /* Parse the type-specifiers. */
11428 /* If that didn't work, stop. */
11431 /* Parse the conversion-declarator. */
11439 /* Don't give this error when parsing tentatively. This happens to
11440 work because we always parse this definitively once. */
11443 {
11445 {
11448 }
11452 }
11455 }
11457 /* Parse an (optional) conversion-declarator.
11459 conversion-declarator:
11460 ptr-operator conversion-declarator [opt]
11462 */
11466 {
11469 cp_cv_quals cv_quals;
11471 /* We don't know if there's a ptr-operator next, or not. */
11473 /* Try the ptr-operator. */
11476 /* If it worked, look for more conversion-declarators. */
11478 {
11481 /* Parse another optional declarator. */
11484 declarator = cp_parser_make_indirect_declarator
11488 }
11491 }
11493 /* Parse an (optional) ctor-initializer.
11495 ctor-initializer:
11496 : mem-initializer-list
11498 Returns TRUE iff the ctor-initializer was actually present. */
11500 static bool
11502 {
11503 /* If the next token is not a `:', then there is no
11504 ctor-initializer. */
11506 {
11507 /* Do default initialization of any bases and members. */
11512 }
11514 /* Consume the `:' token. */
11516 /* And the mem-initializer-list. */
11520 }
11522 /* Parse a mem-initializer-list.
11524 mem-initializer-list:
11525 mem-initializer ... [opt]
11526 mem-initializer ... [opt] , mem-initializer-list */
11528 static void
11530 {
11535 /* Let the semantic analysis code know that we are starting the
11536 mem-initializer-list. */
11541 /* Loop through the list. */
11543 {
11544 tree mem_initializer;
11547 /* Parse the mem-initializer. */
11549 /* If the next token is a `...', we're expanding member initializers. */
11551 {
11552 /* Consume the `...'. */
11555 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11556 can be expanded but members cannot. */
11559 {
11564 }
11566 /* Construct the pack expansion type. */
11569 }
11572 {
11576 }
11577 /* Look for a target constructor. */
11581 {
11584 {
11588 }
11590 }
11591 /* Add it to the list, unless it was erroneous. */
11593 {
11596 }
11597 /* If the next token is not a `,', we're done. */
11600 /* Consume the `,' token. */
11602 }
11604 /* Perform semantic analysis. */
11607 }
11609 /* Parse a mem-initializer.
11611 mem-initializer:
11612 mem-initializer-id ( expression-list [opt] )
11613 mem-initializer-id braced-init-list
11615 GNU extension:
11617 mem-initializer:
11618 ( expression-list [opt] )
11620 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11621 class) or FIELD_DECL (for a non-static data member) to initialize;
11622 the TREE_VALUE is the expression-list. An empty initialization
11623 list is represented by void_list_node. */
11625 static tree
11627 {
11628 tree mem_initializer_id;
11629 tree expression_list;
11630 tree member;
11633 /* Find out what is being initialized. */
11635 {
11639 }
11640 else
11641 {
11645 }
11651 {
11657 }
11658 else
11659 {
11669 }
11679 }
11681 /* Parse a mem-initializer-id.
11683 mem-initializer-id:
11684 :: [opt] nested-name-specifier [opt] class-name
11685 identifier
11687 Returns a TYPE indicating the class to be initializer for the first
11688 production. Returns an IDENTIFIER_NODE indicating the data member
11689 to be initialized for the second production. */
11691 static tree
11693 {
11697 tree id;
11701 /* `typename' is not allowed in this context ([temp.res]). */
11703 {
11705 "keyword %<typename%> not allowed in this context (a qualified "
11708 }
11709 /* Look for the optional `::' operator. */
11710 global_scope_p
11714 /* Look for the optional nested-name-specifier. The simplest way to
11715 implement:
11717 [temp.res]
11719 The keyword `typename' is not permitted in a base-specifier or
11720 mem-initializer; in these contexts a qualified name that
11721 depends on a template-parameter is implicitly assumed to be a
11722 type name.
11724 is to assume that we have seen the `typename' keyword at this
11725 point. */
11726 nested_name_specifier_p
11735 /* If there is a `::' operator or a nested-name-specifier, then we
11736 are definitely looking for a class-name. */
11741 typename_type,
11745 /* Otherwise, we could also be looking for an ordinary identifier. */
11747 /* Try a class-name. */
11751 none_type,
11755 /* If we found one, we're done. */
11758 /* Otherwise, look for an ordinary identifier. */
11760 }
11762 /* Overloading [gram.over] */
11764 /* Parse an operator-function-id.
11766 operator-function-id:
11767 operator operator
11769 Returns an IDENTIFIER_NODE for the operator which is a
11770 human-readable spelling of the identifier, e.g., `operator +'. */
11772 static tree
11774 {
11775 /* Look for the `operator' keyword. */
11778 /* And then the name of the operator itself. */
11780 }
11782 /* Return an identifier node for a user-defined literal operator.
11783 The suffix identifier is chained to the operator name identifier. */
11785 static tree
11787 {
11788 tree identifier;
11793 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11796 }
11798 /* Parse an operator.
11800 operator:
11801 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11802 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11803 || ++ -- , ->* -> () []
11805 GNU Extensions:
11807 operator:
11808 <? >? <?= >?=
11810 Returns an IDENTIFIER_NODE for the operator which is a
11811 human-readable spelling of the identifier, e.g., `operator +'. */
11813 static tree
11815 {
11819 /* Peek at the next token. */
11821 /* Figure out which operator we have. */
11823 {
11825 {
11828 /* The keyword should be either `new' or `delete'. */
11833 else
11836 /* Consume the `new' or `delete' token. */
11839 /* Peek at the next token. */
11841 /* If it's a `[' token then this is the array variant of the
11842 operator. */
11844 {
11845 /* Consume the `[' token. */
11847 /* Look for the `]' token. */
11851 }
11852 /* Otherwise, we have the non-array variant. */
11853 else
11857 }
12004 /* Consume the `('. */
12006 /* Look for the matching `)'. */
12011 /* Consume the `['. */
12013 /* Look for the matching `]'. */
12021 {
12024 }
12025 /* Consume the string. */
12027 /* Look for the suffix identifier. */
12030 {
12033 {
12036 }
12037 }
12038 else
12039 {
12042 }
12049 /* Anything else is an error. */
12051 }
12053 /* If we have selected an identifier, we need to consume the
12054 operator token. */
12057 /* Otherwise, no valid operator name was present. */
12058 else
12059 {
12062 }
12065 }
12067 /* Parse a template-declaration.
12069 template-declaration:
12070 export [opt] template < template-parameter-list > declaration
12072 If MEMBER_P is TRUE, this template-declaration occurs within a
12073 class-specifier.
12075 The grammar rule given by the standard isn't correct. What
12076 is really meant is:
12078 template-declaration:
12079 export [opt] template-parameter-list-seq
12080 decl-specifier-seq [opt] init-declarator [opt] ;
12081 export [opt] template-parameter-list-seq
12082 function-definition
12084 template-parameter-list-seq:
12085 template-parameter-list-seq [opt]
12086 template < template-parameter-list > */
12088 static void
12090 {
12091 /* Check for `export'. */
12093 {
12094 /* Consume the `export' token. */
12096 /* Warn that we do not support `export'. */
12098 }
12101 }
12103 /* Parse a template-parameter-list.
12105 template-parameter-list:
12106 template-parameter
12107 template-parameter-list , template-parameter
12109 Returns a TREE_LIST. Each node represents a template parameter.
12110 The nodes are connected via their TREE_CHAINs. */
12112 static tree
12114 {
12119 /* The loop below parses the template parms. We first need to know
12120 the total number of template parms to be able to compute proper
12121 canonical types of each dependent type. So after the loop, when
12122 we know the total number of template parms,
12123 end_template_parm_list computes the proper canonical types and
12124 fixes up the dependent types accordingly. */
12126 {
12127 tree parameter;
12130 location_t parm_loc;
12132 /* Parse the template-parameter. */
12137 /* Add it to the list. */
12140 parm_loc,
12141 parameter,
12142 is_non_type,
12143 is_parameter_pack);
12144 else
12145 {
12148 }
12150 /* If the next token is not a `,', we're done. */
12153 /* Otherwise, consume the `,' token. */
12155 }
12158 }
12160 /* Parse a template-parameter.
12162 template-parameter:
12163 type-parameter
12164 parameter-declaration
12166 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12167 the parameter. The TREE_PURPOSE is the default value, if any.
12168 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12169 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12170 set to true iff this parameter is a parameter pack. */
12172 static tree
12175 {
12179 tree parm;
12181 /* Assume it is a type parameter or a template parameter. */
12183 /* Assume it not a parameter pack. */
12185 /* Peek at the next token. */
12187 /* If it is `class' or `template', we have a type-parameter. */
12190 /* If it is `class' or `typename' we do not know yet whether it is a
12191 type parameter or a non-type parameter. Consider:
12193 template <typename T, typename T::X X> ...
12195 or:
12197 template <class C, class D*> ...
12199 Here, the first parameter is a type parameter, and the second is
12200 a non-type parameter. We can tell by looking at the token after
12201 the identifier -- if it is a `,', `=', or `>' then we have a type
12202 parameter. */
12204 {
12205 /* Peek at the token after `class' or `typename'. */
12207 /* If it's an ellipsis, we have a template type parameter
12208 pack. */
12211 /* If it's an identifier, skip it. */
12214 /* Now, see if the token looks like the end of a template
12215 parameter. */
12220 }
12222 /* Otherwise, it is a non-type parameter.
12224 [temp.param]
12226 When parsing a default template-argument for a non-type
12227 template-parameter, the first non-nested `>' is taken as the end
12228 of the template parameter-list rather than a greater-than
12229 operator. */
12231 parameter_declarator
12235 /* If the parameter declaration is marked as a parameter pack, set
12236 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12237 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12238 grokdeclarator. */
12242 {
12245 }
12249 {
12250 /* Can happen in some cases of erroneous input (c++/34892). */
12252 /* Consume the `...' for better error recovery. */
12254 }
12255 /* If the next token is an ellipsis, and we don't already have it
12256 marked as a parameter pack, then we have a parameter pack (that
12257 has no declarator). */
12260 && (declarator_can_be_parameter_pack
12262 {
12263 /* Consume the `...'. */
12268 }
12269 /* We might end up with a pack expansion as the type of the non-type
12270 template parameter, in which case this is a non-type template
12271 parameter pack. */
12275 {
12279 }
12282 {
12283 /* Parameter packs cannot have default arguments. However, a
12284 user may try to do so, so we'll parse them and give an
12285 appropriate diagnostic here. */
12289 /* Find the name of the parameter pack. */
12298 else
12302 /* Parse the default argument, but throw away the result. */
12304 }
12314 }
12316 /* Parse a type-parameter.
12318 type-parameter:
12319 class identifier [opt]
12320 class identifier [opt] = type-id
12321 typename identifier [opt]
12322 typename identifier [opt] = type-id
12323 template < template-parameter-list > class identifier [opt]
12324 template < template-parameter-list > class identifier [opt]
12325 = id-expression
12327 GNU Extension (variadic templates):
12329 type-parameter:
12330 class ... identifier [opt]
12331 typename ... identifier [opt]
12333 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12334 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12335 the declaration of the parameter.
12337 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12339 static tree
12341 {
12343 tree parameter;
12345 /* Look for a keyword to tell us what kind of parameter this is. */
12351 {
12354 {
12355 tree identifier;
12356 tree default_argument;
12358 /* If the next token is an ellipsis, we have a template
12359 argument pack. */
12361 {
12362 /* Consume the `...' token. */
12367 }
12369 /* If the next token is an identifier, then it names the
12370 parameter. */
12373 else
12376 /* Create the parameter. */
12379 /* If the next token is an `=', we have a default argument. */
12381 {
12382 /* Consume the `=' token. */
12384 /* Parse the default-argument. */
12388 /* Template parameter packs cannot have default
12389 arguments. */
12391 {
12394 "template parameter pack %qD cannot have a "
12396 else
12398 "template parameter packs cannot have "
12401 }
12403 }
12404 else
12407 /* Create the combined representation of the parameter and the
12408 default argument. */
12410 }
12414 {
12415 tree identifier;
12416 tree default_argument;
12418 /* Look for the `<'. */
12420 /* Parse the template-parameter-list. */
12422 /* Look for the `>'. */
12424 /* Look for the `class' keyword. */
12426 /* If the next token is an ellipsis, we have a template
12427 argument pack. */
12429 {
12430 /* Consume the `...' token. */
12435 }
12436 /* If the next token is an `=', then there is a
12437 default-argument. If the next token is a `>', we are at
12438 the end of the parameter-list. If the next token is a `,',
12439 then we are at the end of this parameter. */
12443 {
12445 /* Treat invalid names as if the parameter were nameless. */
12448 }
12449 else
12452 /* Create the template parameter. */
12454 identifier);
12456 /* If the next token is an `=', then there is a
12457 default-argument. */
12459 {
12462 /* Consume the `='. */
12464 /* Parse the id-expression. */
12466 /* save token before parsing the id-expression, for error
12467 reporting */
12469 default_argument
12477 /* If the id-expression was a template-id that refers to
12478 a template-class, we already have the declaration here,
12479 so no further lookup is needed. */
12480 ;
12481 else
12482 /* Look up the name. */
12483 default_argument
12485 none_type,
12491 /* See if the default argument is valid. */
12492 default_argument
12495 /* Template parameter packs cannot have default
12496 arguments. */
12498 {
12501 "template parameter pack %qD cannot "
12503 identifier);
12504 else
12508 }
12510 }
12511 else
12514 /* Create the combined representation of the parameter and the
12515 default argument. */
12517 }
12523 }
12526 }
12528 /* Parse a template-id.
12530 template-id:
12531 template-name < template-argument-list [opt] >
12533 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12534 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12535 returned. Otherwise, if the template-name names a function, or set
12536 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12537 names a class, returns a TYPE_DECL for the specialization.
12539 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12540 uninstantiated templates. */
12542 static tree
12548 {
12550 tree templ;
12551 tree arguments;
12552 tree template_id;
12559 /* If the next token corresponds to a template-id, there is no need
12560 to reparse it. */
12563 {
12566 /* Get the stored value. */
12568 /* Perform any access checks that were deferred. */
12571 {
12576 tf_warning_or_error);
12577 }
12578 /* Return the stored value. */
12580 }
12582 /* Avoid performing name lookup if there is no possibility of
12583 finding a template-id. */
12586 && !cp_parser_nth_token_starts_template_argument_list_p
12588 {
12591 }
12593 /* Remember where the template-id starts. */
12599 /* Parse the template-name. */
12602 check_dependency_p,
12603 is_declaration,
12604 tag_type,
12607 {
12610 }
12612 /* If we find the sequence `[:' after a template-name, it's probably
12613 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12614 parse correctly the argument list. */
12621 {
12623 /* Change `:' into `::'. */
12625 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12626 CPP_LESS. */
12629 /* Parse the arguments. */
12632 {
12633 /* If we couldn't parse an argument list, then we revert our changes
12634 and return simply an error. Maybe this is not a template-id
12635 after all. */
12640 }
12641 /* Otherwise, emit an error about the invalid digraph, but continue
12642 parsing because we got our argument list. In C++11 do not emit
12643 any error, per 2.5/3. */
12647 {
12650 "%<<:%> is an alternate spelling for %<[%>."
12653 {
12655 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
12658 }
12659 }
12660 }
12661 else
12662 {
12663 /* Look for the `<' that starts the template-argument-list. */
12665 {
12668 }
12669 /* Parse the arguments. */
12671 }
12673 /* Build a representation of the specialization. */
12676 TEMPLATE_ID_EXPR,
12680 {
12682 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12683 template (rather than some instantiation thereof) only if
12684 is not nested within some other construct. For example, in
12685 "template <typename T> void f(T) { A<T>::", A<T> is just an
12686 instantiation of A. */
12689 CPP_SCOPE));
12690 template_id
12692 }
12693 else
12694 {
12695 /* If it's not a class-template or a template-template, it should be
12696 a function-template. */
12702 }
12704 /* If parsing tentatively, replace the sequence of tokens that makes
12705 up the template-id with a CPP_TEMPLATE_ID token. That way,
12706 should we re-parse the token stream, we will not have to repeat
12707 the effort required to do the parse, nor will we issue duplicate
12708 error messages about problems during instantiation of the
12709 template. */
12711 {
12714 /* Reset the contents of the START_OF_ID token. */
12716 /* Retrieve any deferred checks. Do not pop this access checks yet
12717 so the memory will not be reclaimed during token replacing below. */
12723 /* Purge all subsequent tokens. */
12726 /* ??? Can we actually assume that, if template_id ==
12727 error_mark_node, we will have issued a diagnostic to the
12728 user, as opposed to simply marking the tentative parse as
12729 failed? */
12732 }
12736 }
12738 /* Parse a template-name.
12740 template-name:
12741 identifier
12743 The standard should actually say:
12745 template-name:
12746 identifier
12747 operator-function-id
12749 A defect report has been filed about this issue.
12751 A conversion-function-id cannot be a template name because they cannot
12752 be part of a template-id. In fact, looking at this code:
12754 a.operator K<int>()
12756 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12757 It is impossible to call a templated conversion-function-id with an
12758 explicit argument list, since the only allowed template parameter is
12759 the type to which it is converting.
12761 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12762 `template' keyword, in a construction like:
12764 T::template f<3>()
12766 In that case `f' is taken to be a template-name, even though there
12767 is no way of knowing for sure.
12769 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12770 name refers to a set of overloaded functions, at least one of which
12771 is a template, or an IDENTIFIER_NODE with the name of the template,
12772 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12773 names are looked up inside uninstantiated templates. */
12775 static tree
12782 {
12783 tree identifier;
12784 tree decl;
12785 tree fns;
12788 /* If the next token is `operator', then we have either an
12789 operator-function-id or a conversion-function-id. */
12791 {
12792 /* We don't know whether we're looking at an
12793 operator-function-id or a conversion-function-id. */
12795 /* Try an operator-function-id. */
12797 /* If that didn't work, try a conversion-function-id. */
12799 {
12802 }
12803 }
12804 /* Look for the identifier. */
12805 else
12808 /* If we didn't find an identifier, we don't have a template-id. */
12812 /* If the name immediately followed the `template' keyword, then it
12813 is a template-name. However, if the next token is not `<', then
12814 we do not treat it as a template-name, since it is not being used
12815 as part of a template-id. This enables us to handle constructs
12816 like:
12818 template <typename T> struct S { S(); };
12819 template <typename T> S<T>::S();
12821 correctly. We would treat `S' as a template -- if it were `S<T>'
12822 -- but we do not if there is no `<'. */
12826 {
12827 /* In a declaration, in a dependent context, we pretend that the
12828 "template" keyword was present in order to improve error
12829 recovery. For example, given:
12831 template <typename T> void f(T::X<int>);
12833 we want to treat "X<int>" as a template-id. */
12835 && !template_keyword_p
12837 && check_dependency_p
12839 /* Do not do this for dtors (or ctors), since they never
12840 need the template keyword before their name. */
12842 {
12845 /* Explain what went wrong. */
12847 identifier);
12850 /* If parsing tentatively, find the location of the "<" token. */
12853 /* Parse the template arguments so that we can issue error
12854 messages about them. */
12857 /* Skip tokens until we find a good place from which to
12858 continue parsing. */
12863 /* If parsing tentatively, permanently remove the
12864 template argument list. That will prevent duplicate
12865 error messages from being issued about the missing
12866 "template" keyword. */
12872 }
12874 /* If the "template" keyword is present, then there is generally
12875 no point in doing name-lookup, so we just return IDENTIFIER.
12876 But, if the qualifying scope is non-dependent then we can
12877 (and must) do name-lookup normally. */
12883 }
12885 /* Look up the name. */
12887 tag_type,
12890 check_dependency_p,
12894 /* If DECL is a template, then the name was a template-name. */
12896 ;
12897 else
12898 {
12901 /* The standard does not explicitly indicate whether a name that
12902 names a set of overloaded declarations, some of which are
12903 templates, is a template-name. However, such a name should
12904 be a template-name; otherwise, there is no way to form a
12905 template-id for the overloaded templates. */
12913 {
12914 /* The name does not name a template. */
12917 }
12918 }
12920 /* If DECL is dependent, and refers to a function, then just return
12921 its name; we will look it up again during template instantiation. */
12923 {
12927 }
12930 }
12932 /* Parse a template-argument-list.
12934 template-argument-list:
12935 template-argument ... [opt]
12936 template-argument-list , template-argument ... [opt]
12938 Returns a TREE_VEC containing the arguments. */
12940 static tree
12942 {
12947 tree vec;
12954 /* Even if the template-id appears in an integral
12955 constant-expression, the contents of the argument list do
12956 not. */
12962 /* Parse the arguments. */
12963 do
12964 {
12965 tree argument;
12968 /* Consume the comma. */
12971 /* Parse the template-argument. */
12974 /* If the next token is an ellipsis, we're expanding a template
12975 argument pack. */
12977 {
12979 {
12983 }
12984 /* Consume the `...' token. */
12987 /* Make the argument into a TYPE_PACK_EXPANSION or
12988 EXPR_PACK_EXPANSION. */
12990 }
12993 {
12997 {
13000 }
13001 else
13003 }
13005 }
13018 #ifdef ENABLE_CHECKING
13020 #endif
13022 }
13024 /* Parse a template-argument.
13026 template-argument:
13027 assignment-expression
13028 type-id
13029 id-expression
13031 The representation is that of an assignment-expression, type-id, or
13032 id-expression -- except that the qualified id-expression is
13033 evaluated, so that the value returned is either a DECL or an
13034 OVERLOAD.
13036 Although the standard says "assignment-expression", it forbids
13037 throw-expressions or assignments in the template argument.
13038 Therefore, we use "conditional-expression" instead. */
13040 static tree
13042 {
13043 tree argument;
13049 cp_id_kind idk;
13051 /* There's really no way to know what we're looking at, so we just
13052 try each alternative in order.
13054 [temp.arg]
13056 In a template-argument, an ambiguity between a type-id and an
13057 expression is resolved to a type-id, regardless of the form of
13058 the corresponding template-parameter.
13060 Therefore, we try a type-id first. */
13063 /* If there was no error parsing the type-id but the next token is a
13064 '>>', our behavior depends on which dialect of C++ we're
13065 parsing. In C++98, we probably found a typo for '> >'. But there
13066 are type-id which are also valid expressions. For instance:
13068 struct X { int operator >> (int); };
13069 template <int V> struct Foo {};
13070 Foo<X () >> 5> r;
13072 Here 'X()' is a valid type-id of a function type, but the user just
13073 wanted to write the expression "X() >> 5". Thus, we remember that we
13074 found a valid type-id, but we still try to parse the argument as an
13075 expression to see what happens.
13077 In C++0x, the '>>' will be considered two separate '>'
13078 tokens. */
13082 {
13085 }
13086 else
13087 {
13088 /* If the next token isn't a `,' or a `>', then this argument wasn't
13089 really finished. This means that the argument is not a valid
13090 type-id. */
13093 /* If that worked, we're done. */
13096 }
13097 /* We're still not sure what the argument will be. */
13099 /* Try a template. */
13107 /* If the next token isn't a `,' or a `>', then this argument wasn't
13108 really finished. */
13112 {
13113 /* Figure out what is being referred to. If the id-expression
13114 was for a class template specialization, then we will have a
13115 TYPE_DECL at this point. There is no need to do name lookup
13116 at this point in that case. */
13119 none_type,
13128 }
13131 /* It must be a non-type argument. There permitted cases are given
13132 in [temp.arg.nontype]:
13134 -- an integral constant-expression of integral or enumeration
13135 type; or
13137 -- the name of a non-type template-parameter; or
13139 -- the name of an object or function with external linkage...
13141 -- the address of an object or function with external linkage...
13143 -- a pointer to member... */
13144 /* Look for a non-type template parameter. */
13146 {
13158 }
13160 /* If the next token is "&", the argument must be the address of an
13161 object or function with external linkage. */
13164 {
13167 }
13168 /* See if we might have an id-expression. */
13175 {
13178 address_p,
13185 else
13186 {
13187 tree probe;
13190 {
13193 }
13195 /* If we're in a template, we represent a qualified-id referring
13196 to a static data member as a SCOPE_REF even if the scope isn't
13197 dependent so that we can check access control later. */
13202 {
13203 /* A variable without external linkage might still be a
13204 valid constant-expression, so no error is issued here
13205 if the external-linkage check fails. */
13208 }
13210 /* All overloaded functions are allowed; if the external
13211 linkage test does not pass, an error will be issued
13212 later. */
13213 ;
13217 /* A pointer-to-member. */
13218 ;
13220 ;
13221 else
13225 {
13228 tf_warning_or_error);
13230 }
13231 }
13232 }
13233 /* If the argument started with "&", there are no other valid
13234 alternatives at this point. */
13236 {
13239 }
13241 /* If the argument wasn't successfully parsed as a type-id followed
13242 by '>>', the argument can only be a constant expression now.
13243 Otherwise, we try parsing the constant-expression tentatively,
13244 because the argument could really be a type-id. */
13257 /* We did our best to parse the argument as a non type-id, but that
13258 was the only alternative that matched (albeit with a '>' after
13259 it). We can assume it's just a typo from the user, and a
13260 diagnostic will then be issued. */
13262 }
13264 /* Parse an explicit-instantiation.
13266 explicit-instantiation:
13267 template declaration
13269 Although the standard says `declaration', what it really means is:
13271 explicit-instantiation:
13272 template decl-specifier-seq [opt] declarator [opt] ;
13274 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13275 supposed to be allowed. A defect report has been filed about this
13276 issue.
13278 GNU Extension:
13280 explicit-instantiation:
13281 storage-class-specifier template
13282 decl-specifier-seq [opt] declarator [opt] ;
13283 function-specifier template
13284 decl-specifier-seq [opt] declarator [opt] ; */
13286 static void
13288 {
13290 cp_decl_specifier_seq decl_specifiers;
13295 /* Look for an (optional) storage-class-specifier or
13296 function-specifier. */
13298 {
13299 extension_specifier
13302 extension_specifier
13305 }
13307 /* Look for the `template' keyword. */
13309 /* Let the front end know that we are processing an explicit
13310 instantiation. */
13312 /* [temp.explicit] says that we are supposed to ignore access
13313 control while processing explicit instantiation directives. */
13315 /* Parse a decl-specifier-seq. */
13317 CP_PARSER_FLAGS_OPTIONAL,
13320 /* If there was exactly one decl-specifier, and it declared a class,
13321 and there's no declarator, then we have an explicit type
13322 instantiation. */
13324 {
13325 tree type;
13329 /* Turn access control back on for names used during
13330 template instantiation. */
13335 }
13336 else
13337 {
13339 tree decl;
13341 /* Parse the declarator. */
13342 declarator
13352 {
13355 "explicit instantiation shall not use"
13359 "explicit instantiation shall not use"
13364 /* Turn access control back on for names used during
13365 template instantiation. */
13367 /* Do the explicit instantiation. */
13369 }
13370 else
13371 {
13373 /* Skip the body of the explicit instantiation. */
13375 }
13376 }
13377 /* We're done with the instantiation. */
13383 }
13385 /* Parse an explicit-specialization.
13387 explicit-specialization:
13388 template < > declaration
13390 Although the standard says `declaration', what it really means is:
13392 explicit-specialization:
13393 template <> decl-specifier [opt] init-declarator [opt] ;
13394 template <> function-definition
13395 template <> explicit-specialization
13396 template <> template-declaration */
13398 static void
13400 {
13404 /* Look for the `template' keyword. */
13406 /* Look for the `<'. */
13408 /* Look for the `>'. */
13410 /* We have processed another parameter list. */
13412 /* [temp]
13414 A template ... explicit specialization ... shall not have C
13415 linkage. */
13417 {
13419 /* Give it C++ linkage to avoid confusing other parts of the
13420 front end. */
13423 }
13424 else
13426 /* Let the front end know that we are beginning a specialization. */
13428 {
13431 }
13433 /* If the next keyword is `template', we need to figure out whether
13434 or not we're looking a template-declaration. */
13436 {
13441 else
13443 }
13444 else
13445 /* Parse the dependent declaration. */
13451 /* We're done with the specialization. */
13453 /* For the erroneous case of a template with C linkage, we pushed an
13454 implicit C++ linkage scope; exit that scope now. */
13457 /* We're done with this parameter list. */
13459 }
13461 /* Parse a type-specifier.
13463 type-specifier:
13464 simple-type-specifier
13465 class-specifier
13466 enum-specifier
13467 elaborated-type-specifier
13468 cv-qualifier
13470 GNU Extension:
13472 type-specifier:
13473 __complex__
13475 Returns a representation of the type-specifier. For a
13476 class-specifier, enum-specifier, or elaborated-type-specifier, a
13477 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13479 The parser flags FLAGS is used to control type-specifier parsing.
13481 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13482 in a decl-specifier-seq.
13484 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13485 class-specifier, enum-specifier, or elaborated-type-specifier, then
13486 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13487 if a type is declared; 2 if it is defined. Otherwise, it is set to
13488 zero.
13490 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13491 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13492 is set to FALSE. */
13494 static tree
13496 cp_parser_flags flags,
13501 {
13507 /* Assume this type-specifier does not declare a new type. */
13510 /* And that it does not specify a cv-qualifier. */
13513 /* Peek at the next token. */
13516 /* If we're looking at a keyword, we can use that to guide the
13517 production we choose. */
13520 {
13525 /* Look for the enum-specifier. */
13527 /* If that worked, we're done. */
13529 {
13534 type_spec,
13535 token,
13538 }
13539 else
13542 /* Any of these indicate either a class-specifier, or an
13543 elaborated-type-specifier. */
13550 /* Parse tentatively so that we can back up if we don't find a
13551 class-specifier. */
13553 /* Look for the class-specifier. */
13556 /* If that worked, we're done. */
13558 {
13563 type_spec,
13564 token,
13567 }
13569 /* Fall through. */
13570 elaborated_type_specifier:
13571 /* We're declaring (not defining) a class or enum. */
13575 /* Fall through. */
13577 /* Look for an elaborated-type-specifier. */
13578 type_spec
13579 = (cp_parser_elaborated_type_specifier
13582 is_declaration));
13585 type_spec,
13586 token,
13609 /* The `__complex__' keyword is a GNU extension. */
13615 }
13617 /* Handle simple keywords. */
13619 {
13621 {
13624 }
13626 }
13628 /* If we do not already have a type-specifier, assume we are looking
13629 at a simple-type-specifier. */
13631 decl_specs,
13632 flags);
13634 /* If we didn't find a type-specifier, and a type-specifier was not
13635 optional in this context, issue an error message. */
13637 {
13640 }
13643 }
13645 /* Parse a simple-type-specifier.
13647 simple-type-specifier:
13648 :: [opt] nested-name-specifier [opt] type-name
13649 :: [opt] nested-name-specifier template template-id
13650 char
13651 wchar_t
13652 bool
13653 short
13654 int
13655 long
13656 signed
13657 unsigned
13658 float
13659 double
13660 void
13662 C++0x Extension:
13664 simple-type-specifier:
13665 auto
13666 decltype ( expression )
13667 char16_t
13668 char32_t
13669 __underlying_type ( type-id )
13671 GNU Extension:
13673 simple-type-specifier:
13674 __int128
13675 __typeof__ unary-expression
13676 __typeof__ ( type-id )
13678 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13679 appropriately updated. */
13681 static tree
13684 cp_parser_flags flags)
13685 {
13689 /* Peek at the next token. */
13692 /* If we're looking at a keyword, things are easy. */
13694 {
13757 /* Since DR 743, decltype can either be a simple-type-specifier by
13758 itself or begin a nested-name-specifier. Parsing it will replace
13759 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13760 handling below decide what to do. */
13766 /* Consume the `typeof' token. */
13768 /* Parse the operand to `typeof'. */
13770 /* If it is not already a TYPE, take its type. */
13776 token,
13785 token,
13795 token,
13800 }
13802 /* If token is an already-parsed decltype not followed by ::,
13803 it's a simple-type-specifier. */
13806 {
13810 token,
13814 }
13816 /* If the type-specifier was for a built-in type, we're done. */
13818 {
13819 /* Record the type. */
13826 type,
13827 token,
13832 /* Consume the token. */
13835 /* There is no valid C++ program where a non-template type is
13836 followed by a "<". That usually indicates that the user thought
13837 that the type was a template. */
13842 }
13844 /* The type-specifier must be a user-defined type. */
13846 {
13850 /* Don't gobble tokens or issue error messages if this is an
13851 optional type-specifier. */
13855 /* Look for the optional `::' operator. */
13856 global_p
13860 /* Look for the nested-name specifier. */
13861 qualified_p
13869 /* If we have seen a nested-name-specifier, and the next token
13870 is `template', then we are using the template-id production. */
13873 {
13874 /* Look for the template-id. */
13878 none_type,
13880 /* If the template-id did not name a type, we are out of
13881 luck. */
13883 {
13886 }
13887 }
13888 /* Otherwise, look for a type-name. */
13889 else
13891 /* Keep track of all name-lookups performed in class scopes. */
13893 && !global_p
13894 && !qualified_p
13898 /* If it didn't work out, we don't have a TYPE. */
13904 token,
13906 }
13908 /* If we didn't get a type-name, issue an error message. */
13910 {
13913 }
13916 {
13917 /* See if TYPE is an Objective-C type, and if so, parse and
13918 accept any protocol references following it. Do this before
13919 the cp_parser_check_for_invalid_template_id() call, because
13920 Objective-C types can be followed by '<...>' which would
13921 enclose protocol names rather than template arguments, and so
13922 everything is fine. */
13925 {
13929 /* Clobber the "unqualified" type previously entered into
13930 DECL_SPECS with the new, improved protocol-qualified version. */
13935 }
13937 /* There is no valid C++ program where a non-template type is
13938 followed by a "<". That usually indicates that the user
13939 thought that the type was a template. */
13941 none_type,
13943 }
13946 }
13948 /* Parse a type-name.
13950 type-name:
13951 class-name
13952 enum-name
13953 typedef-name
13954 simple-template-id [in c++0x]
13956 enum-name:
13957 identifier
13959 typedef-name:
13960 identifier
13962 Returns a TYPE_DECL for the type. */
13964 static tree
13966 {
13967 tree type_decl;
13969 /* We can't know yet whether it is a class-name or not. */
13971 /* Try a class-name. */
13975 none_type,
13979 /* If it's not a class-name, keep looking. */
13981 {
13983 /* It must be a typedef-name or an enum-name. */
13987 /* It is either a simple-template-id representing an
13988 instantiation of an alias template... */
13992 none_type,
13994 /* Note that this must be an instantiation of an alias template
13995 because [temp.names]/6 says:
13997 A template-id that names an alias template specialization
13998 is a type-name.
14000 Whereas [temp.names]/7 says:
14002 A simple-template-id that names a class template
14003 specialization is a class-name. */
14008 else
14012 /* ... Or a typedef-name or an enum-name. */
14014 }
14017 }
14019 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14021 enum-name:
14022 identifier
14024 typedef-name:
14025 identifier
14027 Returns a TYPE_DECL for the type. */
14029 static tree
14031 {
14032 tree type_decl;
14033 tree identifier;
14040 /* Look up the type-name. */
14044 {
14048 {
14049 /* We have found a type introduced by a using
14050 declaration at class scope that refers to a dependent
14051 type.
14053 using typename :: [opt] nested-name-specifier unqualified-id ;
14054 */
14060 }
14061 }
14065 {
14066 /* See if this is an Objective-C type. */
14071 }
14073 /* Issue an error if we did not find a type-name. */
14075 /* In Objective-C, we have the complication that class names are
14076 normally type names and start declarations (eg, the
14077 "NSObject" in "NSObject *object;"), but can be used in an
14078 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14079 is an expression. So, a classname followed by a dot is not a
14080 valid type-name. */
14083 {
14088 }
14089 /* Remember that the name was used in the definition of the
14090 current class so that we can check later to see if the
14091 meaning would have been different after the class was
14092 entirely defined. */
14098 }
14100 /* Parse an elaborated-type-specifier. Note that the grammar given
14101 here incorporates the resolution to DR68.
14103 elaborated-type-specifier:
14104 class-key :: [opt] nested-name-specifier [opt] identifier
14105 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14106 enum-key :: [opt] nested-name-specifier [opt] identifier
14107 typename :: [opt] nested-name-specifier identifier
14108 typename :: [opt] nested-name-specifier template [opt]
14109 template-id
14111 GNU extension:
14113 elaborated-type-specifier:
14114 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14115 class-key attributes :: [opt] nested-name-specifier [opt]
14116 template [opt] template-id
14117 enum attributes :: [opt] nested-name-specifier [opt] identifier
14119 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14120 declared `friend'. If IS_DECLARATION is TRUE, then this
14121 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14122 something is being declared.
14124 Returns the TYPE specified. */
14126 static tree
14130 {
14132 tree identifier;
14135 tree globalscope;
14138 /* See if we're looking at the `enum' keyword. */
14140 {
14141 /* Consume the `enum' token. */
14143 /* Remember that it's an enumeration type. */
14145 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14146 enums) is used here. */
14149 {
14153 /* Consume the `struct' or `class' and parse it anyway. */
14155 }
14156 /* Parse the attributes. */
14158 }
14159 /* Or, it might be `typename'. */
14161 RID_TYPENAME))
14162 {
14163 /* Consume the `typename' token. */
14165 /* Remember that it's a `typename' type. */
14167 }
14168 /* Otherwise it must be a class-key. */
14169 else
14170 {
14174 /* Parse the attributes. */
14176 }
14178 /* Look for the `::' operator. */
14181 /* Look for the nested-name-specifier. */
14183 {
14188 is_declaration))
14190 }
14191 else
14192 /* Even though `typename' is not present, the proposed resolution
14193 to Core Issue 180 says that in `class A<T>::B', `B' should be
14194 considered a type-name, even if `A<T>' is dependent. */
14199 is_declaration);
14200 /* For everything but enumeration types, consider a template-id.
14201 For an enumeration type, consider only a plain identifier. */
14203 {
14205 tree decl;
14207 /* Allow the `template' keyword. */
14209 /* If we didn't see `template', we don't know if there's a
14210 template-id or not. */
14213 /* Parse the template-id. */
14217 tag_type,
14218 is_declaration);
14219 /* If we didn't find a template-id, look for an ordinary
14220 identifier. */
14222 ;
14223 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14224 in effect, then we must assume that, upon instantiation, the
14225 template will correspond to a class. */
14229 typename_type,
14231 /* If the `typename' keyword is in effect and DECL is not a type
14232 decl. Then type is non existant. */
14235 else
14238 }
14241 {
14246 {
14249 }
14251 /* For a `typename', we needn't call xref_tag. */
14255 identifier,
14257 /* Look up a qualified name in the usual way. */
14259 {
14260 tree decl;
14261 tree ambiguous_decls;
14264 tag_type,
14271 /* If the lookup was ambiguous, an error will already have been
14272 issued. */
14276 /* If we are parsing friend declaration, DECL may be a
14277 TEMPLATE_DECL tree node here. However, we need to check
14278 whether this TEMPLATE_DECL results in valid code. Consider
14279 the following example:
14281 namespace N {
14282 template <class T> class C {};
14283 }
14284 class X {
14285 template <class T> friend class N::C; // #1, valid code
14286 };
14287 template <class T> class Y {
14288 friend class N::C; // #2, invalid code
14289 };
14291 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14292 name lookup of `N::C'. We see that friend declaration must
14293 be template for the code to be valid. Note that
14294 processing_template_decl does not work here since it is
14295 always 1 for the above two cases. */
14297 decl = (cp_parser_maybe_treat_template_as_class
14302 {
14305 identifier,
14308 }
14311 {
14315 allow_template);
14319 }
14321 /* Forward declarations of nested types, such as
14323 class C1::C2;
14324 class C1::C2::C3;
14326 are invalid unless all components preceding the final '::'
14327 are complete. If all enclosing types are complete, these
14328 declarations become merely pointless.
14330 Invalid forward declarations of nested types are errors
14331 caught elsewhere in parsing. Those that are pointless arrive
14332 here. */
14339 }
14340 else
14341 {
14342 /* An elaborated-type-specifier sometimes introduces a new type and
14343 sometimes names an existing type. Normally, the rule is that it
14344 introduces a new type only if there is not an existing type of
14345 the same name already in scope. For example, given:
14347 struct S {};
14348 void f() { struct S s; }
14350 the `struct S' in the body of `f' is the same `struct S' as in
14351 the global scope; the existing definition is used. However, if
14352 there were no global declaration, this would introduce a new
14353 local class named `S'.
14355 An exception to this rule applies to the following code:
14357 namespace N { struct S; }
14359 Here, the elaborated-type-specifier names a new type
14360 unconditionally; even if there is already an `S' in the
14361 containing scope this declaration names a new type.
14362 This exception only applies if the elaborated-type-specifier
14363 forms the complete declaration:
14365 [class.name]
14367 A declaration consisting solely of `class-key identifier ;' is
14368 either a redeclaration of the name in the current scope or a
14369 forward declaration of the identifier as a class name. It
14370 introduces the name into the current scope.
14372 We are in this situation precisely when the next token is a `;'.
14374 An exception to the exception is that a `friend' declaration does
14375 *not* name a new type; i.e., given:
14377 struct S { friend struct T; };
14379 `T' is not a new type in the scope of `S'.
14381 Also, `new struct S' or `sizeof (struct S)' never results in the
14382 definition of a new type; a new type can only be declared in a
14383 declaration context. */
14385 tag_scope ts;
14389 /* Friends have special name lookup rules. */
14393 CPP_SEMICOLON))
14394 /* This is a `class-key identifier ;' */
14396 else
14399 template_p =
14403 /* An unqualified name was used to reference this type, so
14404 there were no qualifying templates. */
14411 }
14412 }
14417 /* Allow attributes on forward declarations of classes. */
14419 {
14429 else
14432 }
14435 {
14436 /* Indicate whether this class was declared as a `class' or as a
14437 `struct'. */
14441 }
14443 /* A "<" cannot follow an elaborated type specifier. If that
14444 happens, the user was probably trying to form a template-id. */
14449 }
14451 /* Parse an enum-specifier.
14453 enum-specifier:
14454 enum-head { enumerator-list [opt] }
14455 enum-head { enumerator-list , } [C++0x]
14457 enum-head:
14458 enum-key identifier [opt] enum-base [opt]
14459 enum-key nested-name-specifier identifier enum-base [opt]
14461 enum-key:
14462 enum
14463 enum class [C++0x]
14464 enum struct [C++0x]
14466 enum-base: [C++0x]
14467 : type-specifier-seq
14469 opaque-enum-specifier:
14470 enum-key identifier enum-base [opt] ;
14472 GNU Extensions:
14473 enum-key attributes[opt] identifier [opt] enum-base [opt]
14474 { enumerator-list [opt] }attributes[opt]
14475 enum-key attributes[opt] identifier [opt] enum-base [opt]
14476 { enumerator-list, }attributes[opt] [C++0x]
14478 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14479 if the token stream isn't an enum-specifier after all. */
14481 static tree
14483 {
14484 tree identifier;
14486 tree prev_scope;
14488 tree attributes;
14501 /* Parse tentatively so that we can back up if we don't find a
14502 enum-specifier. */
14505 /* Caller guarantees that the current token is 'enum', an identifier
14506 possibly follows, and the token after that is an opening brace.
14507 If we don't have an identifier, fabricate an anonymous name for
14508 the enumeration being defined. */
14511 /* Parse the "class" or "struct", which indicates a scoped
14512 enumeration type in C++0x. */
14515 {
14519 /* Consume the `struct' or `class' token. */
14523 }
14527 /* Clear the qualification. */
14532 /* Figure out in what scope the declaration is being placed. */
14538 nested_name_specifier
14546 {
14547 tree name;
14551 enum_type,
14556 input_location);
14558 {
14561 {
14562 /* Are template enums allowed in ISO? */
14566 /* ignore a typename reference, for it will be solved by name
14567 in start_enum. */
14569 }
14570 }
14571 else
14574 }
14575 else
14576 {
14579 else
14580 {
14583 }
14584 }
14587 /* Check for the `:' that denotes a specified underlying type in C++0x.
14588 Note that a ':' could also indicate a bitfield width, however. */
14590 {
14591 cp_decl_specifier_seq type_specifiers;
14593 /* Consume the `:'. */
14596 /* Parse the type-specifier-seq. */
14601 /* At this point this is surely not elaborated type specifier. */
14610 /* If that didn't work, stop. */
14612 {
14617 }
14618 }
14620 /* Look for the `{' but don't consume it yet. */
14622 {
14624 {
14627 {
14630 }
14631 }
14632 /* An opaque-enum-specifier must have a ';' here. */
14635 {
14638 {
14641 }
14642 }
14643 }
14649 {
14651 {
14655 }
14657 {
14659 }
14660 }
14662 /* Issue an error message if type-definitions are forbidden here. */
14665 else
14666 /* Create the new type. We do this before consuming the opening
14667 brace so the enum will be recorded as being on the line of its
14668 tag (or the 'enum' keyword, if there is no tag). */
14672 /* If the next token is not '{' it is an opaque-enum-specifier or an
14673 elaborated-type-specifier. */
14675 {
14678 {
14679 /* The following catches invalid code such as:
14680 enum class S<int>::E { A, B, C }; */
14687 /* If that scope does not contain the scope in which the
14688 class was originally declared, the program is invalid. */
14690 {
14693 "declaration of %qD in namespace %qD which does not "
14696 else
14701 }
14702 }
14707 /* Consume the opening brace. */
14714 {
14718 }
14719 else
14720 {
14725 }
14729 /* If the next token is not '}', then there are some enumerators. */
14733 /* Consume the final '}'. */
14739 }
14740 else
14741 {
14742 /* If a ';' follows, then it is an opaque-enum-specifier
14743 and additional restrictions apply. */
14745 {
14752 }
14753 }
14755 /* Look for trailing attributes to apply to this enumeration, and
14756 apply them if appropriate. */
14758 {
14762 trailing_attr,
14764 }
14766 /* Finish up the enumeration. */
14768 {
14773 }
14776 {
14778 {
14781 }
14783 {
14785 }
14786 }
14787 out:
14790 }
14792 /* Parse an enumerator-list. The enumerators all have the indicated
14793 TYPE.
14795 enumerator-list:
14796 enumerator-definition
14797 enumerator-list , enumerator-definition */
14799 static void
14801 {
14803 {
14804 /* Parse an enumerator-definition. */
14807 /* If the next token is not a ',', we've reached the end of
14808 the list. */
14811 /* Otherwise, consume the `,' and keep going. */
14813 /* If the next token is a `}', there is a trailing comma. */
14815 {
14820 }
14821 }
14822 }
14824 /* Parse an enumerator-definition. The enumerator has the indicated
14825 TYPE.
14827 enumerator-definition:
14828 enumerator
14829 enumerator = constant-expression
14831 enumerator:
14832 identifier */
14834 static void
14836 {
14837 tree identifier;
14838 tree value;
14839 location_t loc;
14841 /* Save the input location because we are interested in the location
14842 of the identifier and not the location of the explicit value. */
14845 /* Look for the identifier. */
14850 /* If the next token is an '=', then there is an explicit value. */
14852 {
14853 /* Consume the `=' token. */
14855 /* Parse the value. */
14858 NULL);
14859 }
14860 else
14863 /* If we are processing a template, make sure the initializer of the
14864 enumerator doesn't contain any bare template parameter pack. */
14868 /* integral_constant_value will pull out this expression, so make sure
14869 it's folded as appropriate. */
14872 /* Create the enumerator. */
14874 }
14876 /* Parse a namespace-name.
14878 namespace-name:
14879 original-namespace-name
14880 namespace-alias
14882 Returns the NAMESPACE_DECL for the namespace. */
14884 static tree
14886 {
14887 tree identifier;
14888 tree namespace_decl;
14892 /* Get the name of the namespace. */
14897 /* Look up the identifier in the currently active scope. Look only
14898 for namespaces, due to:
14900 [basic.lookup.udir]
14902 When looking up a namespace-name in a using-directive or alias
14903 definition, only namespace names are considered.
14905 And:
14907 [basic.lookup.qual]
14909 During the lookup of a name preceding the :: scope resolution
14910 operator, object, function, and enumerator names are ignored.
14912 (Note that cp_parser_qualifying_entity only calls this
14913 function if the token after the name is the scope resolution
14914 operator.) */
14916 none_type,
14922 /* If it's not a namespace, issue an error. */
14925 {
14930 }
14933 }
14935 /* Parse a namespace-definition.
14937 namespace-definition:
14938 named-namespace-definition
14939 unnamed-namespace-definition
14941 named-namespace-definition:
14942 original-namespace-definition
14943 extension-namespace-definition
14945 original-namespace-definition:
14946 namespace identifier { namespace-body }
14948 extension-namespace-definition:
14949 namespace original-namespace-name { namespace-body }
14951 unnamed-namespace-definition:
14952 namespace { namespace-body } */
14954 static void
14956 {
14962 {
14966 }
14967 else
14970 /* Look for the `namespace' keyword. */
14973 /* Get the name of the namespace. We do not attempt to distinguish
14974 between an original-namespace-definition and an
14975 extension-namespace-definition at this point. The semantic
14976 analysis routines are responsible for that. */
14979 else
14982 /* Parse any specified attributes. */
14985 /* Look for the `{' to start the namespace. */
14987 /* Start the namespace. */
14990 /* "inline namespace" is equivalent to a stub namespace definition
14991 followed by a strong using directive. */
14993 {
14995 /* Set up namespace association. */
14999 /* Import the contents of the inline namespace. */
15003 }
15007 /* Parse the body of the namespace. */
15013 /* Finish the namespace. */
15015 /* Look for the final `}'. */
15017 }
15019 /* Parse a namespace-body.
15021 namespace-body:
15022 declaration-seq [opt] */
15024 static void
15026 {
15028 }
15030 /* Parse a namespace-alias-definition.
15032 namespace-alias-definition:
15033 namespace identifier = qualified-namespace-specifier ; */
15035 static void
15037 {
15038 tree identifier;
15039 tree namespace_specifier;
15043 /* Look for the `namespace' keyword. */
15045 /* Look for the identifier. */
15049 /* Look for the `=' token. */
15052 {
15054 /* Skip the definition. */
15059 }
15061 /* Look for the qualified-namespace-specifier. */
15062 namespace_specifier
15064 /* Look for the `;' token. */
15067 /* Register the alias in the symbol table. */
15069 }
15071 /* Parse a qualified-namespace-specifier.
15073 qualified-namespace-specifier:
15074 :: [opt] nested-name-specifier [opt] namespace-name
15076 Returns a NAMESPACE_DECL corresponding to the specified
15077 namespace. */
15079 static tree
15081 {
15082 /* Look for the optional `::'. */
15086 /* Look for the optional nested-name-specifier. */
15094 }
15096 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15097 access declaration.
15099 using-declaration:
15100 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15101 using :: unqualified-id ;
15103 access-declaration:
15104 qualified-id ;
15106 */
15108 static bool
15111 {
15115 tree decl;
15116 tree identifier;
15117 tree qscope;
15122 {
15125 }
15126 else
15127 {
15128 /* Look for the `using' keyword. */
15131 /* Peek at the next token. */
15133 /* See if it's `typename'. */
15135 {
15136 /* Remember that we've seen it. */
15138 /* Consume the `typename' token. */
15140 }
15141 }
15143 /* Look for the optional global scope qualification. */
15144 global_scope_p
15149 /* If we saw `typename', or didn't see `::', then there must be a
15150 nested-name-specifier present. */
15156 /* Otherwise, we could be in either of the two productions. In that
15157 case, treat the nested-name-specifier as optional. */
15158 else
15168 /* Something has already gone wrong; there's no need to parse
15169 further. Since an error has occurred, the return value of
15170 cp_parser_parse_definitely will be false, as required. */
15174 /* Parse the unqualified-id. */
15182 {
15187 }
15189 /* The function we call to handle a using-declaration is different
15190 depending on what scope we are in. */
15192 ;
15195 /* [namespace.udecl]
15197 A using declaration shall not name a template-id. */
15200 else
15201 {
15203 {
15204 /* Create the USING_DECL. */
15212 else
15213 /* Add it to the list of members in this class. */
15215 }
15216 else
15217 {
15219 identifier,
15229 else
15231 }
15232 }
15234 /* Look for the final `;'. */
15239 "access declarations are deprecated "
15240 "in favour of using-declarations; "
15244 }
15246 /* Parse an alias-declaration.
15248 alias-declaration:
15249 using identifier attribute-specifier-seq [opt] = type-id */
15251 static tree
15253 {
15255 location_t id_location;
15257 cp_decl_specifier_seq decl_specs;
15261 /* Look for the `using' keyword. */
15262 cp_token *using_token
15282 /* Now we are going to parse the type-id of the declaration. */
15284 /*
15285 [dcl.type]/3 says:
15287 "A type-specifier-seq shall not define a class or enumeration
15288 unless it appears in the type-id of an alias-declaration (7.1.3) that
15289 is not the declaration of a template-declaration."
15291 In other words, if we currently are in an alias template, the
15292 type-id should not define a type.
15294 So let's set parser->type_definition_forbidden_message in that
15295 case; cp_parser_check_type_definition (called by
15296 cp_parser_class_specifier) will then emit an error if a type is
15297 defined in the type-id. */
15299 {
15303 }
15307 /* Restore the error message if need be. */
15316 /* A typedef-name can also be introduced by an alias-declaration. The
15317 identifier following the using keyword becomes a typedef-name. It has
15318 the same semantics as if it were introduced by the typedef
15319 specifier. In particular, it does not define a new type and it shall
15320 not appear in the type-id. */
15325 {
15328 ds_attribute,
15329 attrs_token);
15330 }
15332 ds_typedef,
15333 using_token);
15335 ds_alias,
15336 using_token);
15345 else
15356 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15357 added into the symbol table; otherwise, return the TYPE_DECL. */
15361 {
15365 }
15368 }
15370 /* Parse a using-directive.
15372 using-directive:
15373 using namespace :: [opt] nested-name-specifier [opt]
15374 namespace-name ; */
15376 static void
15378 {
15379 tree namespace_decl;
15380 tree attribs;
15382 /* Look for the `using' keyword. */
15384 /* And the `namespace' keyword. */
15386 /* Look for the optional `::' operator. */
15388 /* And the optional nested-name-specifier. */
15394 /* Get the namespace being used. */
15396 /* And any specified attributes. */
15398 /* Update the symbol table. */
15400 /* Look for the final `;'. */
15402 }
15404 /* Parse an asm-definition.
15406 asm-definition:
15407 asm ( string-literal ) ;
15409 GNU Extension:
15411 asm-definition:
15412 asm volatile [opt] ( string-literal ) ;
15413 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15414 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15415 : asm-operand-list [opt] ) ;
15416 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15417 : asm-operand-list [opt]
15418 : asm-clobber-list [opt] ) ;
15419 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15420 : asm-clobber-list [opt]
15421 : asm-goto-list ) ; */
15423 static void
15425 {
15426 tree string;
15431 tree asm_stmt;
15439 /* Look for the `asm' keyword. */
15441 /* See if the next token is `volatile'. */
15444 {
15445 /* Remember that we saw the `volatile' keyword. */
15447 /* Consume the token. */
15449 }
15453 {
15454 /* Remember that we saw the `goto' keyword. */
15456 /* Consume the token. */
15458 }
15459 /* Look for the opening `('. */
15462 /* Look for the string. */
15465 {
15469 }
15471 /* If we're allowing GNU extensions, check for the extended assembly
15472 syntax. Unfortunately, the `:' tokens need not be separated by
15473 a space in C, and so, for compatibility, we tolerate that here
15474 too. Doing that means that we have to treat the `::' operator as
15475 two `:' tokens. */
15480 {
15485 /* The extended syntax was used. */
15488 /* Look for outputs. */
15490 {
15491 /* Consume the `:'. */
15493 /* Parse the output-operands. */
15495 CPP_COLON)
15497 CPP_SCOPE)
15499 CPP_CLOSE_PAREN)
15505 }
15506 /* If the next token is `::', there are no outputs, and the
15507 next token is the beginning of the inputs. */
15509 /* The inputs are coming next. */
15512 /* Look for inputs. */
15515 {
15516 /* Consume the `:' or `::'. */
15518 /* Parse the output-operands. */
15520 CPP_COLON)
15522 CPP_SCOPE)
15524 CPP_CLOSE_PAREN))
15529 }
15531 /* The clobbers are coming next. */
15534 /* Look for clobbers. */
15537 {
15539 /* Consume the `:' or `::'. */
15541 /* Parse the clobbers. */
15543 CPP_COLON)
15545 CPP_CLOSE_PAREN))
15547 }
15550 /* The labels are coming next. */
15553 /* Look for labels. */
15556 {
15558 /* Consume the `:' or `::'. */
15560 /* Parse the labels. */
15562 }
15566 }
15570 /* Look for the closing `)'. */
15578 {
15579 /* Create the ASM_EXPR. */
15581 {
15584 /* If the extended syntax was not used, mark the ASM_EXPR. */
15586 {
15592 }
15593 }
15594 else
15596 }
15597 }
15599 /* Declarators [gram.dcl.decl] */
15601 /* Parse an init-declarator.
15603 init-declarator:
15604 declarator initializer [opt]
15606 GNU Extension:
15608 init-declarator:
15609 declarator asm-specification [opt] attributes [opt] initializer [opt]
15611 function-definition:
15612 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15613 function-body
15614 decl-specifier-seq [opt] declarator function-try-block
15616 GNU Extension:
15618 function-definition:
15619 __extension__ function-definition
15621 TM Extension:
15623 function-definition:
15624 decl-specifier-seq [opt] declarator function-transaction-block
15626 The DECL_SPECIFIERS apply to this declarator. Returns a
15627 representation of the entity declared. If MEMBER_P is TRUE, then
15628 this declarator appears in a class scope. The new DECL created by
15629 this declarator is returned.
15631 The CHECKS are access checks that should be performed once we know
15632 what entity is being declared (and, therefore, what classes have
15633 befriended it).
15635 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15636 for a function-definition here as well. If the declarator is a
15637 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15638 be TRUE upon return. By that point, the function-definition will
15639 have been completely parsed.
15641 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15642 is FALSE.
15644 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15645 parsed declaration if it is an uninitialized single declarator not followed
15646 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15647 if present, will not be consumed. If returned, this declarator will be
15648 created with SD_INITIALIZED but will not call cp_finish_decl. */
15650 static tree
15659 {
15663 tree prefix_attributes;
15665 tree asm_specification;
15666 tree initializer;
15668 tree scope;
15670 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15671 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15672 "(...)". */
15681 /* Gather the attributes that were provided with the
15682 decl-specifiers. */
15685 /* Assume that this is not the declarator for a function
15686 definition. */
15690 /* Defer access checks while parsing the declarator; we cannot know
15691 what names are accessible until we know what is being
15692 declared. */
15695 /* Parse the declarator. */
15697 declarator
15701 member_p);
15702 /* Gather up the deferred checks. */
15705 /* If the DECLARATOR was erroneous, there's no need to go
15706 further. */
15710 /* Check that the number of template-parameter-lists is OK. */
15720 /* Figure out what scope the entity declared by the DECLARATOR is
15721 located in. `grokdeclarator' sometimes changes the scope, so
15722 we compute it now. */
15725 /* Perform any lookups in the declared type which were thought to be
15726 dependent, but are not in the scope of the declarator. */
15727 decl_specifiers->type
15730 /* If we're allowing GNU extensions, look for an
15731 asm-specification. */
15733 {
15734 /* Look for an asm-specification. */
15737 }
15738 else
15741 /* Look for attributes. */
15745 /* Peek at the next token. */
15747 /* Check to see if the token indicates the start of a
15748 function-definition. */
15751 {
15753 {
15754 /* If a function-definition should not appear here, issue an
15755 error message. */
15759 }
15760 else
15761 {
15762 location_t func_brace_location
15765 /* Neither attributes nor an asm-specification are allowed
15766 on a function-definition. */
15769 "an asm-specification is not allowed "
15774 /* This is a function-definition. */
15777 /* Parse the function definition. */
15780 decl_specifiers,
15781 declarator,
15782 prefix_attributes);
15783 else
15784 decl
15785 = (cp_parser_function_definition_from_specifiers_and_declarator
15789 {
15790 /* This is where the prologue starts... */
15793 }
15796 }
15797 }
15799 /* [dcl.dcl]
15801 Only in function declarations for constructors, destructors, and
15802 type conversions can the decl-specifier-seq be omitted.
15804 We explicitly postpone this check past the point where we handle
15805 function-definitions because we tolerate function-definitions
15806 that are missing their return types in some modes. */
15808 {
15812 }
15814 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15818 {
15826 {
15832 }
15833 }
15834 else
15835 {
15836 /* If the init-declarator isn't initialized and isn't followed by a
15837 `,' or `;', it's not a valid init-declarator. */
15840 {
15843 else
15844 {
15847 }
15848 }
15851 }
15853 /* Because start_decl has side-effects, we should only call it if we
15854 know we're going ahead. By this point, we know that we cannot
15855 possibly be looking at any other construct. */
15858 /* If the decl specifiers were bad, issue an error now that we're
15859 sure this was intended to be a declarator. Then continue
15860 declaring the variable(s), as int, to try to cut down on further
15861 errors. */
15864 {
15867 }
15869 /* Check to see whether or not this declaration is a friend. */
15872 /* Enter the newly declared entry in the symbol table. If we're
15873 processing a declaration in a class-specifier, we wait until
15874 after processing the initializer. */
15876 {
15883 /* Adjust location of decl if declarator->id_loc is more appropriate:
15884 set, and decl wasn't merged with another decl, in which case its
15885 location would be different from input_location, and more accurate. */
15890 }
15892 /* Enter the SCOPE. That way unqualified names appearing in the
15893 initializer will be looked up in SCOPE. */
15896 /* Perform deferred access control checks, now that we know in which
15897 SCOPE the declared entity resides. */
15899 {
15902 /* If the entity being declared is a function, pretend that we
15903 are in its scope. If it is a `friend', it may have access to
15904 things that would not otherwise be accessible. */
15906 {
15909 }
15911 /* Perform access checks for template parameters. */
15914 /* Perform the access control checks for the declarator and the
15915 decl-specifiers. */
15918 /* Restore the saved value. */
15921 }
15923 /* Parse the initializer. */
15928 {
15930 {
15934 else
15935 {
15936 /* If the declaration was erroneous, we don't really
15937 know what the user intended, so just silently
15938 consume the initializer. */
15946 }
15947 }
15948 else
15949 {
15950 /* We want to record the extra mangling scope for in-class
15951 initializers of class members and initializers of static data
15952 member templates. The former involves deferring
15953 parsing of the initializer until end of class as with default
15954 arguments. So right here we only handle the latter. */
15964 }
15965 }
15967 /* The old parser allows attributes to appear after a parenthesized
15968 initializer. Mark Mitchell proposed removing this functionality
15969 on the GCC mailing lists on 2002-08-13. This parser accepts the
15970 attributes -- but ignores them. */
15977 /* For an in-class declaration, use `grokfield' to create the
15978 declaration. */
15980 {
15982 {
15985 }
15989 prefix_attributes);
15992 }
15994 /* Finish processing the declaration. But, skip member
15995 declarations. */
15997 {
16000 asm_specification,
16001 /* If the initializer is in parentheses, then this is
16002 a direct-initialization, which means that an
16003 `explicit' constructor is OK. Otherwise, an
16004 `explicit' constructor cannot be used. */
16007 }
16010 /* Core issue #226 (C++0x only): A default template-argument
16011 shall not be specified in a friend class template
16012 declaration. */
16020 }
16022 /* Parse a declarator.
16024 declarator:
16025 direct-declarator
16026 ptr-operator declarator
16028 abstract-declarator:
16029 ptr-operator abstract-declarator [opt]
16030 direct-abstract-declarator
16032 GNU Extensions:
16034 declarator:
16035 attributes [opt] direct-declarator
16036 attributes [opt] ptr-operator declarator
16038 abstract-declarator:
16039 attributes [opt] ptr-operator abstract-declarator [opt]
16040 attributes [opt] direct-abstract-declarator
16042 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16043 detect constructor, destructor or conversion operators. It is set
16044 to -1 if the declarator is a name, and +1 if it is a
16045 function. Otherwise it is set to zero. Usually you just want to
16046 test for >0, but internally the negative value is used.
16048 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16049 a decl-specifier-seq unless it declares a constructor, destructor,
16050 or conversion. It might seem that we could check this condition in
16051 semantic analysis, rather than parsing, but that makes it difficult
16052 to handle something like `f()'. We want to notice that there are
16053 no decl-specifiers, and therefore realize that this is an
16054 expression, not a declaration.)
16056 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16057 the declarator is a direct-declarator of the form "(...)".
16059 MEMBER_P is true iff this declarator is a member-declarator. */
16063 cp_parser_declarator_kind dcl_kind,
16067 {
16070 cp_cv_quals cv_quals;
16071 tree class_type;
16074 /* Assume this is not a constructor, destructor, or type-conversion
16075 operator. */
16082 /* Check for the ptr-operator production. */
16084 /* Parse the ptr-operator. */
16090 /* If that worked, then we have a ptr-operator. */
16092 {
16093 /* If a ptr-operator was found, then this declarator was not
16094 parenthesized. */
16097 /* The dependent declarator is optional if we are parsing an
16098 abstract-declarator. */
16102 /* Parse the dependent declarator. */
16108 /* If we are parsing an abstract-declarator, we must handle the
16109 case where the dependent declarator is absent. */
16114 declarator = cp_parser_make_indirect_declarator
16116 }
16117 /* Everything else is a direct-declarator. */
16118 else
16119 {
16122 CPP_OPEN_PAREN);
16124 ctor_dtor_or_conv_p,
16125 member_p);
16126 }
16131 }
16133 /* Parse a direct-declarator or direct-abstract-declarator.
16135 direct-declarator:
16136 declarator-id
16137 direct-declarator ( parameter-declaration-clause )
16138 cv-qualifier-seq [opt]
16139 exception-specification [opt]
16140 direct-declarator [ constant-expression [opt] ]
16141 ( declarator )
16143 direct-abstract-declarator:
16144 direct-abstract-declarator [opt]
16145 ( parameter-declaration-clause )
16146 cv-qualifier-seq [opt]
16147 exception-specification [opt]
16148 direct-abstract-declarator [opt] [ constant-expression [opt] ]
16149 ( abstract-declarator )
16151 Returns a representation of the declarator. DCL_KIND is
16152 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
16153 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
16154 we are parsing a direct-declarator. It is
16155 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
16156 of ambiguity we prefer an abstract declarator, as per
16157 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
16158 cp_parser_declarator. */
16162 cp_parser_declarator_kind dcl_kind,
16165 {
16175 {
16176 /* Peek at the next token. */
16179 {
16180 /* This is either a parameter-declaration-clause, or a
16181 parenthesized declarator. When we know we are parsing a
16182 named declarator, it must be a parenthesized declarator
16183 if FIRST is true. For instance, `(int)' is a
16184 parameter-declaration-clause, with an omitted
16185 direct-abstract-declarator. But `((*))', is a
16186 parenthesized abstract declarator. Finally, when T is a
16187 template parameter `(T)' is a
16188 parameter-declaration-clause, and not a parenthesized
16189 named declarator.
16191 We first try and parse a parameter-declaration-clause,
16192 and then try a nested declarator (if FIRST is true).
16194 It is not an error for it not to be a
16195 parameter-declaration-clause, even when FIRST is
16196 false. Consider,
16198 int i (int);
16199 int i (3);
16201 The first is the declaration of a function while the
16202 second is the definition of a variable, including its
16203 initializer.
16205 Having seen only the parenthesis, we cannot know which of
16206 these two alternatives should be selected. Even more
16207 complex are examples like:
16209 int i (int (a));
16210 int i (int (3));
16212 The former is a function-declaration; the latter is a
16213 variable initialization.
16215 Thus again, we try a parameter-declaration-clause, and if
16216 that fails, we back out and return. */
16219 {
16220 tree params;
16223 tree t;
16225 /* In a member-declarator, the only valid interpretation
16226 of a parenthesis is the start of a
16227 parameter-declaration-clause. (It is invalid to
16228 initialize a static data member with a parenthesized
16229 initializer; only the "=" form of initialization is
16230 permitted.) */
16234 /* Consume the `('. */
16237 {
16238 /* If this is going to be an abstract declarator, we're
16239 in a declarator and we can't have default args. */
16242 }
16244 /* Inside the function parameter list, surrounding
16245 template-parameter-lists do not apply. */
16246 saved_num_template_parameter_lists
16252 /* Parse the parameter-declaration-clause. */
16255 parser->num_template_parameter_lists
16258 /* Consume the `)'. */
16261 /* If all went well, parse the cv-qualifier-seq and the
16262 exception-specification. */
16264 {
16265 cp_cv_quals cv_quals;
16266 cp_virt_specifiers virt_specifiers;
16267 tree exception_specification;
16268 tree late_return;
16269 tree attrs;
16277 /* Parse the cv-qualifier-seq. */
16279 /* And the exception-specification. */
16280 exception_specification
16285 late_return = (cp_parser_late_return_type_opt
16288 /* Parse the virt-specifier-seq. */
16291 /* Create the function-declarator. */
16293 params,
16294 cv_quals,
16295 virt_specifiers,
16296 exception_specification,
16297 late_return);
16299 /* Any subsequent parameter lists are to do with
16300 return type, so are not those of the declared
16301 function. */
16303 }
16305 /* Remove the function parms from scope. */
16311 /* Repeat the main loop. */
16313 }
16315 /* If this is the first, we can try a parenthesized
16316 declarator. */
16318 {
16324 /* Consume the `('. */
16326 /* Parse the nested declarator. */
16329 declarator
16332 member_p);
16335 /* Expect a `)'. */
16342 }
16343 /* Otherwise, we must be done. */
16344 else
16346 }
16350 {
16351 /* Parse an array-declarator. */
16360 /* Consume the `['. */
16362 /* Peek at the next token. */
16364 /* If the next token is `]', then there is no
16365 constant-expression. */
16367 {
16370 bounds
16380 {
16381 /* Normally, the array bound must be an integral constant
16382 expression. However, as an extension, we allow VLAs
16383 in function scopes as long as they aren't part of a
16384 parameter declaration. */
16388 }
16390 {
16391 /* Remember this wasn't a constant-expression. */
16394 }
16395 }
16396 else
16398 /* Look for the closing `]'. */
16400 {
16403 }
16408 }
16410 {
16411 {
16412 tree qualifying_scope;
16413 tree unqualified_name;
16414 tree attrs;
16415 special_function_kind sfk;
16420 /* Parse a declarator-id */
16423 {
16426 /* If we see an ellipsis, we should be looking at a
16427 parameter pack. */
16429 {
16430 /* Consume the `...' */
16434 }
16435 }
16438 unqualified_name
16442 {
16446 {
16447 /* Check whether an error occurred. */
16450 /* We already consumed the ellipsis to mark a
16451 parameter pack, but we have no way to report it,
16452 so abort the tentative parse. We will be exiting
16453 immediately anyway. */
16455 }
16456 else
16462 && (qualifying_scope
16465 {
16468 }
16469 }
16474 {
16479 }
16485 {
16486 /* In the declaration of a member of a template class
16487 outside of the class itself, the SCOPE will sometimes
16488 be a TYPENAME_TYPE. For example, given:
16490 template <typename T>
16491 int S<T>::R::i = 3;
16493 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16494 this context, we must resolve S<T>::R to an ordinary
16495 type, rather than a typename type.
16497 The reason we normally avoid resolving TYPENAME_TYPEs
16498 is that a specialization of `S' might render
16499 `S<T>::R' not a type. However, if `S' is
16500 specialized, then this `i' will not be used, so there
16501 is no harm in resolving the types here. */
16502 tree type;
16504 /* Resolve the TYPENAME_TYPE. */
16507 /* If that failed, the declarator is invalid. */
16509 {
16512 "cannot define member of dependent typedef "
16514 else
16519 }
16521 }
16526 {
16527 tree class_type;
16532 else
16536 {
16539 {
16542 {
16546 "use %<%T::%D%> instead of %<%T::%D%> to "
16548 class_type,
16553 }
16554 else
16556 }
16557 else
16558 {
16559 /* We do not attempt to print the declarator
16560 here because we do not have enough
16561 information about its original syntactic
16562 form. */
16566 }
16567 }
16570 {
16576 for an anonymous type, even if the type
16577 got a name for linkage purposes. */
16580 class_type))
16581 {
16584 }
16592 }
16593 }
16595 unqualified_name,
16596 sfk);
16603 }
16605 handle_declarator:;
16608 /* Any names that appear after the declarator-id for a
16609 member are looked up in the containing scope. */
16614 /* Default args are only allowed on function
16615 declarations. */
16617 else
16621 }
16622 /* We're done. */
16623 else
16625 }
16627 /* For an abstract declarator, we might wind up with nothing at this
16628 point. That's an error; the declarator is not optional. */
16632 /* If we entered a scope, we must exit it now. */
16640 }
16642 /* Parse a ptr-operator.
16644 ptr-operator:
16645 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16646 * cv-qualifier-seq [opt]
16647 &
16648 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16649 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16651 GNU Extension:
16653 ptr-operator:
16654 & cv-qualifier-seq [opt]
16656 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16657 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16658 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16659 filled in with the TYPE containing the member. *CV_QUALS is
16660 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16661 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16662 Note that the tree codes returned by this function have nothing
16663 to do with the types of trees that will be eventually be created
16664 to represent the pointer or reference type being parsed. They are
16665 just constants with suggestive names. */
16666 static enum tree_code
16671 {
16676 /* Assume that it's not a pointer-to-member. */
16678 /* And that there are no cv-qualifiers. */
16681 /* Peek at the next token. */
16684 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16694 {
16695 /* Consume the `*', `&' or `&&'. */
16698 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16699 `&', if we are allowing GNU extensions. (The only qualifier
16700 that can legally appear after `&' is `restrict', but that is
16701 enforced during semantic analysis. */
16709 }
16710 else
16711 {
16712 /* Try the pointer-to-member case. */
16714 /* Look for the optional `::' operator. */
16717 /* Look for the nested-name specifier. */
16724 /* If we found it, and the next token is a `*', then we are
16725 indeed looking at a pointer-to-member operator. */
16728 {
16729 /* Indicate that the `*' operator was used. */
16737 else
16738 {
16739 /* The type of which the member is a member is given by the
16740 current SCOPE. */
16742 /* The next name will not be qualified. */
16746 /* Look for optional c++11 attributes. */
16750 /* Look for the optional cv-qualifier-seq. */
16752 }
16753 }
16754 /* If that didn't work we don't have a ptr-operator. */
16757 }
16760 }
16762 /* Parse an (optional) cv-qualifier-seq.
16764 cv-qualifier-seq:
16765 cv-qualifier cv-qualifier-seq [opt]
16767 cv-qualifier:
16768 const
16769 volatile
16771 GNU Extension:
16773 cv-qualifier:
16774 __restrict__
16776 Returns a bitmask representing the cv-qualifiers. */
16778 static cp_cv_quals
16780 {
16784 {
16786 cp_cv_quals cv_qualifier;
16788 /* Peek at the next token. */
16790 /* See if it's a cv-qualifier. */
16792 {
16808 }
16814 {
16817 }
16818 else
16819 {
16822 }
16823 }
16826 }
16828 /* Parse an (optional) virt-specifier-seq.
16830 virt-specifier-seq:
16831 virt-specifier virt-specifier-seq [opt]
16833 virt-specifier:
16834 override
16835 final
16837 Returns a bitmask representing the virt-specifiers. */
16839 static cp_virt_specifiers
16841 {
16845 {
16847 cp_virt_specifiers virt_specifier;
16849 /* Peek at the next token. */
16851 /* See if it's a virt-specifier-qualifier. */
16855 {
16858 }
16860 {
16863 }
16865 {
16867 }
16868 else
16872 {
16875 }
16876 else
16877 {
16880 }
16881 }
16883 }
16885 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16886 is in scope even though it isn't real. */
16888 static void
16890 {
16891 tree this_parm;
16894 {
16895 /* We don't clear this between NSDMIs. Is it already what we want? */
16900 }
16903 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16905 current_class_ref
16908 }
16910 /* Parse a late-specified return type, if any. This is not a separate
16911 non-terminal, but part of a function declarator, which looks like
16913 -> trailing-type-specifier-seq abstract-declarator(opt)
16915 Returns the type indicated by the type-id.
16917 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16918 function. */
16920 static tree
16922 {
16924 tree type;
16926 /* Peek at the next token. */
16928 /* A late-specified return type is indicated by an initial '->'. */
16932 /* Consume the ->. */
16936 {
16937 /* DR 1207: 'this' is in scope in the trailing return type. */
16940 }
16948 }
16950 /* Parse a declarator-id.
16952 declarator-id:
16953 id-expression
16954 :: [opt] nested-name-specifier [opt] type-name
16956 In the `id-expression' case, the value returned is as for
16957 cp_parser_id_expression if the id-expression was an unqualified-id.
16958 If the id-expression was a qualified-id, then a SCOPE_REF is
16959 returned. The first operand is the scope (either a NAMESPACE_DECL
16960 or TREE_TYPE), but the second is still just a representation of an
16961 unqualified-id. */
16963 static tree
16965 {
16966 tree id;
16967 /* The expression must be an id-expression. Assume that qualified
16968 names are the names of types so that:
16970 template <class T>
16971 int S<T>::R::i = 3;
16973 will work; we must treat `S<T>::R' as the name of a type.
16974 Similarly, assume that qualified names are templates, where
16975 required, so that:
16977 template <class T>
16978 int S<T>::R<T>::i = 3;
16980 will work, too. */
16986 optional_p);
16990 }
16992 /* Parse a type-id.
16994 type-id:
16995 type-specifier-seq abstract-declarator [opt]
16997 Returns the TYPE specified. */
16999 static tree
17002 {
17003 cp_decl_specifier_seq type_specifier_seq;
17006 /* Parse the type-specifier-seq. */
17008 is_trailing_return,
17013 /* There might or might not be an abstract declarator. */
17015 /* Look for the declarator. */
17016 abstract_declarator
17020 /* Check to see if there really was a declarator. */
17026 {
17027 /* A type-id with type 'auto' is only ok if the abstract declarator
17028 is a function declarator with a late-specified return type. */
17033 else
17034 {
17037 }
17038 }
17041 is_template_arg);
17042 }
17045 {
17047 }
17050 {
17051 tree r;
17053 parser->type_definition_forbidden_message
17058 }
17061 {
17063 }
17065 /* Parse a type-specifier-seq.
17067 type-specifier-seq:
17068 type-specifier type-specifier-seq [opt]
17070 GNU extension:
17072 type-specifier-seq:
17073 attributes type-specifier-seq [opt]
17075 If IS_DECLARATION is true, we are at the start of a "condition" or
17076 exception-declaration, so we might be followed by a declarator-id.
17078 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
17079 i.e. we've just seen "->".
17081 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
17083 static void
17088 {
17093 /* Clear the TYPE_SPECIFIER_SEQ. */
17096 /* In the context of a trailing return type, enum E { } is an
17097 elaborated-type-specifier followed by a function-body, not an
17098 enum-specifier. */
17102 /* Parse the type-specifiers and attributes. */
17104 {
17105 tree type_specifier;
17108 /* Check for attributes first. */
17110 {
17115 }
17117 /* record the token of the beginning of the type specifier seq,
17118 for error reporting purposes*/
17122 /* Look for the type-specifier. */
17124 flags,
17125 type_specifier_seq,
17127 NULL,
17130 {
17131 /* If the first type-specifier could not be found, this is not a
17132 type-specifier-seq at all. */
17134 {
17138 }
17139 /* If subsequent type-specifiers could not be found, the
17140 type-specifier-seq is complete. */
17142 }
17145 /* The standard says that a condition can be:
17147 type-specifier-seq declarator = assignment-expression
17149 However, given:
17151 struct S {};
17152 if (int S = ...)
17154 we should treat the "S" as a declarator, not as a
17155 type-specifier. The standard doesn't say that explicitly for
17156 type-specifier-seq, but it does say that for
17157 decl-specifier-seq in an ordinary declaration. Perhaps it
17158 would be clearer just to allow a decl-specifier-seq here, and
17159 then add a semantic restriction that if any decl-specifiers
17160 that are not type-specifiers appear, the program is invalid. */
17163 }
17164 }
17166 /* Parse a parameter-declaration-clause.
17168 parameter-declaration-clause:
17169 parameter-declaration-list [opt] ... [opt]
17170 parameter-declaration-list , ...
17172 Returns a representation for the parameter declarations. A return
17173 value of NULL indicates a parameter-declaration-clause consisting
17174 only of an ellipsis. */
17176 static tree
17178 {
17179 tree parameters;
17184 /* Peek at the next token. */
17186 /* Check for trivial parameter-declaration-clauses. */
17188 {
17189 /* Consume the `...' token. */
17192 }
17194 /* There are no parameters. */
17195 {
17196 #ifndef NO_IMPLICIT_EXTERN_C
17200 else
17201 #endif
17203 }
17204 /* Check for `(void)', too, which is a special case. */
17208 {
17209 /* Consume the `void' token. */
17211 /* There are no parameters. */
17213 }
17215 /* Parse the parameter-declaration-list. */
17217 /* If a parse error occurred while parsing the
17218 parameter-declaration-list, then the entire
17219 parameter-declaration-clause is erroneous. */
17223 /* Peek at the next token. */
17225 /* If it's a `,', the clause should terminate with an ellipsis. */
17227 {
17228 /* Consume the `,'. */
17230 /* Expect an ellipsis. */
17231 ellipsis_p
17233 }
17234 /* It might also be `...' if the optional trailing `,' was
17235 omitted. */
17237 {
17238 /* Consume the `...' token. */
17240 /* And remember that we saw it. */
17242 }
17243 else
17246 /* Finish the parameter list. */
17251 }
17253 /* Parse a parameter-declaration-list.
17255 parameter-declaration-list:
17256 parameter-declaration
17257 parameter-declaration-list , parameter-declaration
17259 Returns a representation of the parameter-declaration-list, as for
17260 cp_parser_parameter_declaration_clause. However, the
17261 `void_list_node' is never appended to the list. Upon return,
17262 *IS_ERROR will be true iff an error occurred. */
17264 static tree
17266 {
17272 /* Assume all will go well. */
17274 /* The special considerations that apply to a function within an
17275 unbraced linkage specifications do not apply to the parameters
17276 to the function. */
17277 saved_in_unbraced_linkage_specification_p
17281 /* Look for more parameters. */
17283 {
17287 /* Parse the parameter. */
17288 parameter
17293 /* We don't know yet if the enclosing context is deprecated, so wait
17294 and warn in grokparms if appropriate. */
17300 PARM,
17306 /* If a parse error occurred parsing the parameter declaration,
17307 then the entire parameter-declaration-list is erroneous. */
17309 {
17313 }
17323 {
17327 }
17329 /* Add the new parameter to the list. */
17333 /* Peek at the next token. */
17336 /* These are for Objective-C++ */
17339 /* The parameter-declaration-list is complete. */
17342 {
17345 /* Peek at the next token. */
17347 /* If it's an ellipsis, then the list is complete. */
17350 /* Otherwise, there must be more parameters. Consume the
17351 `,'. */
17353 /* When parsing something like:
17355 int i(float f, double d)
17357 we can tell after seeing the declaration for "f" that we
17358 are not looking at an initialization of a variable "i",
17359 but rather at the declaration of a function "i".
17361 Due to the fact that the parsing of template arguments
17362 (as specified to a template-id) requires backtracking we
17363 cannot use this technique when inside a template argument
17364 list. */
17368 /* However, a parameter-declaration of the form
17369 "foat(f)" (which is a valid declaration of a
17370 parameter "f") can also be interpreted as an
17371 expression (the conversion of "f" to "float"). */
17374 }
17375 else
17376 {
17384 }
17385 }
17387 parser->in_unbraced_linkage_specification_p
17391 }
17393 /* Parse a parameter declaration.
17395 parameter-declaration:
17396 decl-specifier-seq ... [opt] declarator
17397 decl-specifier-seq declarator = assignment-expression
17398 decl-specifier-seq ... [opt] abstract-declarator [opt]
17399 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17401 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17402 declares a template parameter. (In that case, a non-nested `>'
17403 token encountered during the parsing of the assignment-expression
17404 is not interpreted as a greater-than operator.)
17406 Returns a representation of the parameter, or NULL if an error
17407 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17408 true iff the declarator is of the form "(p)". */
17414 {
17416 cp_decl_specifier_seq decl_specifiers;
17418 tree default_argument;
17422 /* In a template parameter, `>' is not an operator.
17424 [temp.param]
17426 When parsing a default template-argument for a non-type
17427 template-parameter, the first non-nested `>' is taken as the end
17428 of the template parameter-list rather than a greater-than
17429 operator. */
17431 /* Type definitions may not appear in parameter types. */
17433 parser->type_definition_forbidden_message
17436 /* Parse the declaration-specifiers. */
17438 CP_PARSER_FLAGS_NONE,
17442 /* Complain about missing 'typename' or other invalid type names. */
17446 /* If an error occurred, there's no reason to attempt to parse the
17447 rest of the declaration. */
17449 {
17452 }
17454 /* Peek at the next token. */
17457 /* If the next token is a `)', `,', `=', `>', or `...', then there
17458 is no declarator. However, when variadic templates are enabled,
17459 there may be a declarator following `...'. */
17464 {
17468 }
17469 /* Otherwise, there should be a declarator. */
17470 else
17471 {
17475 /* After seeing a decl-specifier-seq, if the next token is not a
17476 "(", there is no possibility that the code is a valid
17477 expression. Therefore, if parsing tentatively, we commit at
17478 this point. */
17480 /* In an expression context, having seen:
17482 (int((char ...
17484 we cannot be sure whether we are looking at a
17485 function-type (taking a "char" as a parameter) or a cast
17486 of some object of type "char" to "int". */
17492 /* Parse the declarator. */
17495 CP_PARSER_DECLARATOR_EITHER,
17497 parenthesized_p,
17500 /* After the declarator, allow more attributes. */
17501 decl_specifiers.attributes
17504 }
17506 /* If the next token is an ellipsis, and we have not seen a
17507 declarator name, and the type of the declarator contains parameter
17508 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17509 a parameter pack expansion expression. Otherwise, leave the
17510 ellipsis for a C-style variadic function. */
17513 {
17524 {
17525 /* Consume the `...'. */
17529 /* Build a pack expansion type */
17532 else
17534 }
17535 }
17537 /* The restriction on defining new types applies only to the type
17538 of the parameter, not to the default argument. */
17541 /* If the next token is `=', then process a default argument. */
17543 {
17545 /* If we are defining a class, then the tokens that make up the
17546 default argument must be saved and processed later. */
17551 /* Outside of a class definition, we can just parse the
17552 assignment-expression. */
17553 else
17554 default_argument
17558 {
17561 else
17562 {
17564 "default arguments are only "
17567 }
17568 }
17572 {
17573 /* Find the name of the parameter pack. */
17580 template_parm_p
17586 else
17588 template_parm_p
17595 }
17596 }
17597 else
17601 declarator,
17602 default_argument);
17603 }
17605 /* Parse a default argument and return it.
17607 TEMPLATE_PARM_P is true if this is a default argument for a
17608 non-type template parameter. */
17609 static tree
17611 {
17617 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17618 set correctly. */
17621 /* Local variable names (and the `this' keyword) may not
17622 appear in a default argument. */
17625 /* Parse the assignment-expression. */
17628 default_argument
17638 }
17640 /* Parse a function-body.
17642 function-body:
17643 compound_statement */
17645 static void
17647 {
17649 }
17651 /* Parse a ctor-initializer-opt followed by a function-body. Return
17652 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17653 is true we are parsing a function-try-block. */
17655 static bool
17658 {
17666 /* Begin the function body. */
17668 /* Parse the optional ctor-initializer. */
17671 /* If we're parsing a constexpr constructor definition, we need
17672 to check that the constructor body is indeed empty. However,
17673 before we get to cp_parser_function_body lot of junk has been
17674 generated, so we can't just check that we have an empty block.
17675 Rather we take a snapshot of the outermost block, and check whether
17676 cp_parser_function_body changed its state. */
17678 {
17682 }
17683 /* Parse the function-body. */
17687 /* Finish the function body. */
17691 }
17693 /* Parse an initializer.
17695 initializer:
17696 = initializer-clause
17697 ( expression-list )
17699 Returns an expression representing the initializer. If no
17700 initializer is present, NULL_TREE is returned.
17702 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17703 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17704 set to TRUE if there is no initializer present. If there is an
17705 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17706 is set to true; otherwise it is set to false. */
17708 static tree
17711 {
17713 tree init;
17715 /* Peek at the next token. */
17718 /* Let our caller know whether or not this initializer was
17719 parenthesized. */
17721 /* Assume that the initializer is constant. */
17725 {
17726 /* Consume the `='. */
17728 /* Parse the initializer-clause. */
17730 }
17732 {
17737 non_constant_p);
17742 }
17744 {
17748 }
17749 else
17750 {
17751 /* Anything else is an error. */
17754 }
17757 }
17759 /* Parse an initializer-clause.
17761 initializer-clause:
17762 assignment-expression
17763 braced-init-list
17765 Returns an expression representing the initializer.
17767 If the `assignment-expression' production is used the value
17768 returned is simply a representation for the expression.
17770 Otherwise, calls cp_parser_braced_list. */
17772 static tree
17774 {
17775 tree initializer;
17777 /* Assume the expression is constant. */
17780 /* If it is not a `{', then we are looking at an
17781 assignment-expression. */
17783 {
17784 initializer
17787 non_constant_p);
17788 }
17789 else
17793 }
17795 /* Parse a brace-enclosed initializer list.
17797 braced-init-list:
17798 { initializer-list , [opt] }
17799 { }
17801 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17802 the elements of the initializer-list (or NULL, if the last
17803 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17804 NULL_TREE. There is no way to detect whether or not the optional
17805 trailing `,' was provided. NON_CONSTANT_P is as for
17806 cp_parser_initializer. */
17808 static tree
17810 {
17811 tree initializer;
17813 /* Consume the `{' token. */
17815 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17817 /* If it's not a `}', then there is a non-trivial initializer. */
17819 {
17820 /* Parse the initializer list. */
17823 /* A trailing `,' token is allowed. */
17826 }
17827 /* Now, there should be a trailing `}'. */
17831 }
17833 /* Parse an initializer-list.
17835 initializer-list:
17836 initializer-clause ... [opt]
17837 initializer-list , initializer-clause ... [opt]
17839 GNU Extension:
17841 initializer-list:
17842 designation initializer-clause ...[opt]
17843 initializer-list , designation initializer-clause ...[opt]
17845 designation:
17846 . identifier =
17847 identifier :
17848 [ constant-expression ] =
17850 Returns a vec of constructor_elt. The VALUE of each elt is an expression
17851 for the initializer. If the INDEX of the elt is non-NULL, it is the
17852 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17853 as for cp_parser_initializer. */
17857 {
17860 /* Assume all of the expressions are constant. */
17863 /* Parse the rest of the list. */
17865 {
17867 tree designator;
17868 tree initializer;
17871 /* If the next token is an identifier and the following one is a
17872 colon, we are looking at the GNU designated-initializer
17873 syntax. */
17877 {
17878 /* Warn the user that they are using an extension. */
17881 /* Consume the identifier. */
17883 /* Consume the `:'. */
17885 }
17886 /* Also handle the C99 syntax, '. id ='. */
17891 {
17892 /* Warn the user that they are using an extension. */
17895 /* Consume the `.'. */
17897 /* Consume the identifier. */
17899 /* Consume the `='. */
17901 }
17902 /* Also handle C99 array designators, '[ const ] ='. */
17906 {
17907 /* In C++11, [ could start a lambda-introducer. */
17915 }
17916 else
17919 /* Parse the initializer. */
17922 /* If any clause is non-constant, so is the entire initializer. */
17926 /* If we have an ellipsis, this is an initializer pack
17927 expansion. */
17929 {
17930 /* Consume the `...'. */
17933 /* Turn the initializer into an initializer expansion. */
17935 }
17937 /* Add it to the vector. */
17940 /* If the next token is not a comma, we have reached the end of
17941 the list. */
17945 /* Peek at the next token. */
17947 /* If the next token is a `}', then we're still done. An
17948 initializer-clause can have a trailing `,' after the
17949 initializer-list and before the closing `}'. */
17953 /* Consume the `,' token. */
17955 }
17958 }
17960 /* Classes [gram.class] */
17962 /* Parse a class-name.
17964 class-name:
17965 identifier
17966 template-id
17968 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17969 to indicate that names looked up in dependent types should be
17970 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17971 keyword has been used to indicate that the name that appears next
17972 is a template. TAG_TYPE indicates the explicit tag given before
17973 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17974 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17975 is the class being defined in a class-head.
17977 Returns the TYPE_DECL representing the class. */
17979 static tree
17987 {
17988 tree decl;
17989 tree scope;
17994 /* All class-names start with an identifier. */
17997 {
18000 }
18002 /* PARSER->SCOPE can be cleared when parsing the template-arguments
18003 to a template-id, so we save it here. */
18008 /* Any name names a type if we're following the `typename' keyword
18009 in a qualified name where the enclosing scope is type-dependent. */
18012 /* Handle the common case (an identifier, but not a template-id)
18013 efficiently. */
18016 {
18020 /* Look for the identifier. */
18024 /* If the next token isn't an identifier, we are certainly not
18025 looking at a class-name. */
18028 /* If we know this is a type-name, there's no need to look it
18029 up. */
18032 else
18033 {
18034 tree ambiguous_decls;
18035 /* If we already know that this lookup is ambiguous, then
18036 we've already issued an error message; there's no reason
18037 to check again. */
18039 {
18042 }
18043 /* If the next token is a `::', then the name must be a type
18044 name.
18046 [basic.lookup.qual]
18048 During the lookup for a name preceding the :: scope
18049 resolution operator, object, function, and enumerator
18050 names are ignored. */
18053 /* Look up the name. */
18055 tag_type,
18058 check_dependency_p,
18062 {
18066 }
18067 }
18068 }
18069 else
18070 {
18071 /* Try a template-id. */
18073 check_dependency_p,
18074 tag_type,
18075 is_declaration);
18078 }
18082 /* If this is a typename, create a TYPENAME_TYPE. */
18084 {
18089 }
18093 /* Check to see that it is really the name of a class. */
18097 /* Situations like this:
18099 template <typename T> struct A {
18100 typename T::template X<int>::I i;
18101 };
18103 are problematic. Is `T::template X<int>' a class-name? The
18104 standard does not seem to be definitive, but there is no other
18105 valid interpretation of the following `::'. Therefore, those
18106 names are considered class-names. */
18107 {
18111 }
18115 /* In Objective-C 2.0, a classname followed by '.' starts a
18116 dot-syntax expression, and it's not a type-name. */
18128 }
18130 /* Parse a class-specifier.
18132 class-specifier:
18133 class-head { member-specification [opt] }
18135 Returns the TREE_TYPE representing the class. */
18137 static tree
18139 {
18140 tree type;
18154 /* Parse the class-head. */
18157 /* If the class-head was a semantic disaster, skip the entire body
18158 of the class. */
18160 {
18164 }
18166 /* Look for the `{'. */
18168 {
18171 }
18173 /* Issue an error message if type-definitions are forbidden here. */
18175 /* Remember that we are defining one more class. */
18177 /* Inside the class, surrounding template-parameter-lists do not
18178 apply. */
18179 saved_num_template_parameter_lists
18182 /* We are not in a function body. */
18185 /* Or in a loop. */
18188 /* Or in a switch. */
18191 /* We are not immediately inside an extern "lang" block. */
18192 saved_in_unbraced_linkage_specification_p
18196 /* Start the class. */
18198 {
18201 }
18205 /* If the type is erroneous, skip the entire body of the class. */
18207 else
18208 /* Parse the member-specification. */
18211 /* Look for the trailing `}'. */
18213 /* Look for trailing attributes to apply to this class. */
18221 /* We've finished a type definition. Check for the common syntax
18222 error of forgetting a semicolon after the definition. We need to
18223 be careful, as we can't just check for not-a-semicolon and be done
18224 with it; the user might have typed:
18226 class X { } c = ...;
18227 class X { } *p = ...;
18229 and so forth. Instead, enumerate all the possible tokens that
18230 might follow this production; if we don't see one of them, then
18231 complain and silently insert the semicolon. */
18232 {
18237 /* Don't try to parse c++11 attributes here. As per the
18238 grammar, that should be a task for
18239 cp_parser_decl_specifier_seq. */
18243 {
18254 /* While it's legal for type qualifiers and storage class
18255 specifiers to follow type definitions in the grammar, only
18256 compiler testsuites contain code like that. Assume that if
18257 we see such code, then what we're really seeing is a case
18258 like:
18260 class X { }
18261 const <type> var = ...;
18263 or
18265 class Y { }
18266 static <type> func (...) ...
18268 i.e. the qualifier or specifier applies to the next
18269 declaration. To do so, however, we need to look ahead one
18270 more token to see if *that* token is a type specifier.
18272 This code could be improved to handle:
18274 class Z { }
18275 static const <type> var = ...; */
18278 {
18281 /* Handling user-defined types here would be nice, but very
18282 tricky. */
18283 want_semicolon
18286 }
18290 }
18292 /* If we don't have a type, then something is very wrong and we
18293 shouldn't try to do anything clever. Likewise for not seeing the
18294 closing brace. */
18296 {
18297 cp_token_position prev
18308 else
18311 /* Unget one token and smash it to look as though we encountered
18312 a semicolon in the input stream. */
18317 }
18318 }
18320 /* If this class is not itself within the scope of another class,
18321 then we need to parse the bodies of all of the queued function
18322 definitions. Note that the queued functions defined in a class
18323 are not always processed immediately following the
18324 class-specifier for that class. Consider:
18326 struct A {
18327 struct B { void f() { sizeof (A); } };
18328 };
18330 If `f' were processed before the processing of `A' were
18331 completed, there would be no way to compute the size of `A'.
18332 Note that the nesting we are interested in here is lexical --
18333 not the semantic nesting given by TYPE_CONTEXT. In particular,
18334 for:
18336 struct A { struct B; };
18337 struct A::B { void f() { } };
18339 there is no need to delay the parsing of `A::B::f'. */
18341 {
18342 tree decl;
18349 /* In a first pass, parse default arguments to the functions.
18350 Then, in a second pass, parse the bodies of the functions.
18351 This two-phased approach handles cases like:
18353 struct S {
18354 void f() { g(); }
18355 void g(int i = 3);
18356 };
18358 */
18360 {
18362 /* If there are default arguments that have not yet been processed,
18363 take care of them now. */
18365 {
18370 }
18371 /* Make sure that any template parameters are in scope. */
18373 /* Parse the default argument expressions. */
18375 /* Remove any template parameters from the symbol table. */
18377 }
18379 /* Now parse any NSDMIs. */
18383 {
18385 {
18390 }
18393 }
18399 /* Now parse the body of the functions. */
18403 }
18405 /* Put back any saved access checks. */
18408 /* Restore saved state. */
18412 parser->num_template_parameter_lists
18414 parser->in_unbraced_linkage_specification_p
18418 }
18420 static tree
18422 {
18423 tree ret;
18428 }
18430 /* Parse a class-head.
18432 class-head:
18433 class-key identifier [opt] base-clause [opt]
18434 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18435 class-key nested-name-specifier [opt] template-id
18436 base-clause [opt]
18438 class-virt-specifier:
18439 final
18441 GNU Extensions:
18442 class-key attributes identifier [opt] base-clause [opt]
18443 class-key attributes nested-name-specifier identifier base-clause [opt]
18444 class-key attributes nested-name-specifier [opt] template-id
18445 base-clause [opt]
18447 Upon return BASES is initialized to the list of base classes (or
18448 NULL, if there are none) in the same form returned by
18449 cp_parser_base_clause.
18451 Returns the TYPE of the indicated class. Sets
18452 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18453 involving a nested-name-specifier was used, and FALSE otherwise.
18455 Returns error_mark_node if this is not a class-head.
18457 Returns NULL_TREE if the class-head is syntactically valid, but
18458 semantically invalid in a way that means we should skip the entire
18459 body of the class. */
18461 static tree
18464 {
18465 tree nested_name_specifier;
18469 tree attributes;
18470 tree bases;
18480 /* Assume no nested-name-specifier will be present. */
18482 /* Assume no template parameter lists will be used in defining the
18483 type. */
18487 /* Look for the class-key. */
18492 /* Parse the attributes. */
18495 /* If the next token is `::', that is invalid -- but sometimes
18496 people do try to write:
18498 struct ::S {};
18500 Handle this gracefully by accepting the extra qualifier, and then
18501 issuing an error about it later if this really is a
18502 class-head. If it turns out just to be an elaborated type
18503 specifier, remain silent. */
18509 /* Determine the name of the class. Begin by looking for an
18510 optional nested-name-specifier. */
18512 nested_name_specifier
18518 /* If there was a nested-name-specifier, then there *must* be an
18519 identifier. */
18521 {
18523 /* Although the grammar says `identifier', it really means
18524 `class-name' or `template-name'. You are only allowed to
18525 define a class that has already been declared with this
18526 syntax.
18528 The proposed resolution for Core Issue 180 says that wherever
18529 you see `class T::X' you should treat `X' as a type-name.
18531 It is OK to define an inaccessible class; for example:
18533 class A { class B; };
18534 class A::B {};
18536 We do not know if we will see a class-name, or a
18537 template-name. We look for a class-name first, in case the
18538 class-name is a template-id; if we looked for the
18539 template-name first we would stop after the template-name. */
18544 class_type,
18548 /* If that didn't work, ignore the nested-name-specifier. */
18550 {
18556 }
18557 /* If we could not find a corresponding TYPE, treat this
18558 declaration like an unqualified declaration. */
18561 /* Otherwise, count the number of templates used in TYPE and its
18562 containing scopes. */
18563 else
18564 {
18565 tree scope;
18578 }
18579 }
18580 /* Otherwise, the identifier is optional. */
18581 else
18582 {
18583 /* We don't know whether what comes next is a template-id,
18584 an identifier, or nothing at all. */
18586 /* Check for a template-id. */
18591 class_key,
18593 /* If that didn't work, it could still be an identifier. */
18595 {
18597 {
18600 }
18601 else
18603 }
18604 else
18605 {
18608 }
18609 }
18614 {
18616 class_key,
18618 }
18621 /* If it's not a `:' or a `{' then we can't really be looking at a
18622 class-head, since a class-head only appears as part of a
18623 class-specifier. We have to detect this situation before calling
18624 xref_tag, since that has irreversible side-effects. */
18626 {
18630 }
18632 /* At this point, we're going ahead with the class-specifier, even
18633 if some other problem occurs. */
18636 {
18641 }
18642 /* Issue the error about the overly-qualified name now. */
18644 {
18649 }
18651 {
18656 }
18658 {
18659 tree scope;
18661 /* Reject typedef-names in class heads. */
18663 {
18666 type);
18669 }
18671 /* Figure out in what scope the declaration is being placed. */
18673 /* If that scope does not contain the scope in which the
18674 class was originally declared, the program is invalid. */
18676 {
18679 "declaration of %qD in namespace %qD which does not "
18682 else
18688 }
18689 /* [dcl.meaning]
18691 A declarator-id shall not be qualified except for the
18692 definition of a ... nested class outside of its class
18693 ... [or] the definition or explicit instantiation of a
18694 class member of a namespace outside of its namespace. */
18696 {
18701 }
18702 }
18703 /* An explicit-specialization must be preceded by "template <>". If
18704 it is not, try to recover gracefully. */
18708 {
18712 /* Take the same action that would have been taken by
18713 cp_parser_explicit_specialization. */
18716 }
18717 /* There must be no "return" statements between this point and the
18718 end of this function; set "type "to the correct return value and
18719 use "goto done;" to return. */
18720 /* Make sure that the right number of template parameters were
18721 present. */
18725 {
18726 /* If something went wrong, there is no point in even trying to
18727 process the class-definition. */
18730 }
18732 /* Look up the type. */
18734 {
18738 {
18742 }
18743 else
18744 {
18747 }
18750 }
18752 {
18753 tree class_type;
18755 /* Given:
18757 template <typename T> struct S { struct T };
18758 template <typename T> struct S<T>::T { };
18760 we will get a TYPENAME_TYPE when processing the definition of
18761 `S::T'. We need to resolve it to the actual type before we
18762 try to define it. */
18764 {
18769 else
18770 {
18773 }
18774 }
18778 {
18781 }
18784 /* Enter the scope indicated by the nested-name-specifier. */
18786 /* Get the canonical version of this type. */
18790 {
18793 {
18796 }
18797 }
18801 }
18803 {
18804 /* If the class was unnamed, create a dummy name. */
18809 }
18811 /* Indicate whether this class was declared as a `class' or as a
18812 `struct'. */
18817 /* If this type was already complete, and we see another definition,
18818 that's an error. */
18820 {
18822 type);
18824 type);
18827 }
18832 {
18833 /* Apply attributes now, before any use of the class as a template
18834 argument in its base list. */
18837 }
18839 /* We will have entered the scope containing the class; the names of
18840 base classes should be looked up in that context. For example:
18842 struct A { struct B {}; struct C; };
18843 struct A::C : B {};
18845 is valid. */
18847 /* Get the list of base-classes, if there is one. */
18850 else
18853 /* If we're really defining a class, process the base classes.
18854 If they're invalid, fail. */
18859 done:
18860 /* Leave the scope given by the nested-name-specifier. We will
18861 enter the class scope itself while processing the members. */
18866 {
18869 }
18875 out:
18878 }
18880 /* Parse a class-key.
18882 class-key:
18883 class
18884 struct
18885 union
18887 Returns the kind of class-key specified, or none_type to indicate
18888 error. */
18890 static enum tag_types
18892 {
18896 /* Look for the class-key. */
18901 /* Check to see if the TOKEN is a class-key. */
18906 }
18908 /* Parse an (optional) member-specification.
18910 member-specification:
18911 member-declaration member-specification [opt]
18912 access-specifier : member-specification [opt] */
18914 static void
18916 {
18918 {
18922 /* Peek at the next token. */
18924 /* If it's a `}', or EOF then we've seen all the members. */
18930 /* See if this token is a keyword. */
18933 {
18937 /* Consume the access-specifier. */
18939 /* Remember which access-specifier is active. */
18941 /* Look for the `:'. */
18946 /* Accept #pragmas at class scope. */
18948 {
18951 }
18953 /* Otherwise, the next construction must be a
18954 member-declaration. */
18956 }
18957 }
18958 }
18960 /* Parse a member-declaration.
18962 member-declaration:
18963 decl-specifier-seq [opt] member-declarator-list [opt] ;
18964 function-definition ; [opt]
18965 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18966 using-declaration
18967 template-declaration
18968 alias-declaration
18970 member-declarator-list:
18971 member-declarator
18972 member-declarator-list , member-declarator
18974 member-declarator:
18975 declarator pure-specifier [opt]
18976 declarator constant-initializer [opt]
18977 identifier [opt] : constant-expression
18979 GNU Extensions:
18981 member-declaration:
18982 __extension__ member-declaration
18984 member-declarator:
18985 declarator attributes [opt] pure-specifier [opt]
18986 declarator attributes [opt] constant-initializer [opt]
18987 identifier [opt] attributes [opt] : constant-expression
18989 C++0x Extensions:
18991 member-declaration:
18992 static_assert-declaration */
18994 static void
18996 {
18997 cp_decl_specifier_seq decl_specifiers;
18998 tree prefix_attributes;
18999 tree decl;
19008 /* Check for the `__extension__' keyword. */
19010 {
19011 /* Recurse. */
19013 /* Restore the old value of the PEDANTIC flag. */
19017 }
19019 /* Check for a template-declaration. */
19021 {
19022 /* An explicit specialization here is an error condition, and we
19023 expect the specialization handler to detect and report this. */
19027 else
19031 }
19033 /* Check for a using-declaration. */
19035 {
19037 {
19038 /* Parse the using-declaration. */
19042 }
19043 else
19044 {
19045 tree decl;
19050 else
19054 }
19055 }
19057 /* Check for @defs. */
19059 {
19064 {
19069 }
19071 }
19073 /* If the next token is `static_assert' we have a static assertion. */
19075 {
19078 }
19085 /* Parse the decl-specifier-seq. */
19088 CP_PARSER_FLAGS_OPTIONAL,
19091 /* Check for an invalid type-name. */
19095 /* If there is no declarator, then the decl-specifier-seq should
19096 specify a type. */
19098 {
19099 /* If there was no decl-specifier-seq, and the next token is a
19100 `;', then we have something like:
19102 struct S { ; };
19104 [class.mem]
19106 Each member-declaration shall declare at least one member
19107 name of the class. */
19109 {
19113 }
19114 else
19115 {
19116 tree type;
19118 /* See if this declaration is a friend. */
19120 /* If there were decl-specifiers, check to see if there was
19121 a class-declaration. */
19124 /* Nested classes have already been added to the class, but
19125 a `friend' needs to be explicitly registered. */
19127 {
19128 /* If the `friend' keyword was present, the friend must
19129 be introduced with a class-key. */
19132 "in C++03 a class-key must be used "
19134 /* In this case:
19136 template <typename T> struct A {
19137 friend struct A<T>::B;
19138 };
19140 A<T>::B will be represented by a TYPENAME_TYPE, and
19141 therefore not recognized by check_tag_decl. */
19143 {
19147 }
19150 "friend declaration does not name a class or "
19152 else
19155 }
19156 /* If there is no TYPE, an error message will already have
19157 been issued. */
19159 ;
19160 /* An anonymous aggregate has to be handled specially; such
19161 a declaration really declares a data member (with a
19162 particular type), as opposed to a nested class. */
19164 {
19165 /* C++11 9.5/6. */
19168 "a storage class on an anonymous aggregate "
19171 /* Remove constructors and such from TYPE, now that we
19172 know it is an anonymous aggregate. */
19174 /* And make the corresponding data member. */
19177 /* Add it to the class. */
19179 }
19180 else
19181 cp_parser_check_access_in_redeclaration
19184 }
19185 }
19186 else
19187 {
19190 /* Clear attributes from the decl_specifiers but keep them
19191 around as prefix attributes that apply them to the entity
19192 being declared. */
19196 /* See if these declarations will be friends. */
19199 /* Keep going until we hit the `;' at the end of the
19200 declaration. */
19202 {
19204 tree first_attribute;
19206 /* Peek at the next token. */
19209 /* Check for a bitfield declaration. */
19214 {
19215 tree identifier;
19216 tree width;
19218 /* Get the name of the bitfield. Note that we cannot just
19219 check TOKEN here because it may have been invalidated by
19220 the call to cp_lexer_peek_nth_token above. */
19223 else
19226 /* Consume the `:' token. */
19228 /* Get the width of the bitfield. */
19229 width
19232 NULL);
19234 /* Look for attributes that apply to the bitfield. */
19236 /* Remember which attributes are prefix attributes and
19237 which are not. */
19239 /* Combine the attributes. */
19242 /* Create the bitfield declaration. */
19245 identifier,
19246 sfk_none)
19249 width,
19250 attributes);
19251 }
19252 else
19253 {
19255 tree initializer;
19256 tree asm_specification;
19259 /* Parse the declarator. */
19260 declarator
19266 /* If something went wrong parsing the declarator, make sure
19267 that we at least consume some tokens. */
19269 {
19270 /* Skip to the end of the statement. */
19272 /* If the next token is not a semicolon, that is
19273 probably because we just skipped over the body of
19274 a function. So, we consume a semicolon if
19275 present, but do not issue an error message if it
19276 is not present. */
19278 CPP_SEMICOLON))
19281 }
19284 cp_parser_check_for_definition_in_return_type
19288 /* Look for an asm-specification. */
19290 /* Look for attributes that apply to the declaration. */
19292 /* Remember which attributes are prefix attributes and
19293 which are not. */
19295 /* Combine the attributes. */
19298 /* If it's an `=', then we have a constant-initializer or a
19299 pure-specifier. It is not correct to parse the
19300 initializer before registering the member declaration
19301 since the member declaration should be in scope while
19302 its initializer is processed. However, the rest of the
19303 front end does not yet provide an interface that allows
19304 us to handle this correctly. */
19306 {
19307 /* In [class.mem]:
19309 A pure-specifier shall be used only in the declaration of
19310 a virtual function.
19312 A member-declarator can contain a constant-initializer
19313 only if it declares a static member of integral or
19314 enumeration type.
19316 Therefore, if the DECLARATOR is for a function, we look
19317 for a pure-specifier; otherwise, we look for a
19318 constant-initializer. When we call `grokfield', it will
19319 perform more stringent semantics checks. */
19330 {
19332 /* Don't require a constant rvalue in C++11, since we
19333 might want a reference constant. We'll enforce
19334 constancy later. */
19336 /* Parse the initializer. */
19339 }
19340 else
19341 /* Parse the initializer. */
19343 }
19346 {
19350 else
19352 }
19353 /* Otherwise, there is no initializer. */
19354 else
19357 /* See if we are probably looking at a function
19358 definition. We are certainly not looking at a
19359 member-declarator. Calling `grokfield' has
19360 side-effects, so we must not do it unless we are sure
19361 that we are looking at a member-declarator. */
19364 {
19365 /* The grammar does not allow a pure-specifier to be
19366 used when a member function is defined. (It is
19367 possible that this fact is an oversight in the
19368 standard, since a pure function may be defined
19369 outside of the class-specifier. */
19375 declarator,
19376 attributes);
19377 /* If the member was not a friend, declare it here. */
19380 /* Peek at the next token. */
19382 /* If the next token is a semicolon, consume it. */
19386 }
19387 else
19390 /* Create the declaration. */
19393 asm_specification,
19394 attributes);
19395 }
19397 /* Reset PREFIX_ATTRIBUTES. */
19403 /* If there is any qualification still in effect, clear it
19404 now; we will be starting fresh with the next declarator. */
19408 /* If it's a `,', then there are more declarators. */
19410 {
19413 {
19417 }
19418 }
19419 /* If the next token isn't a `;', then we have a parse error. */
19421 CPP_SEMICOLON))
19422 {
19423 /* The next token might be a ways away from where the
19424 actual semicolon is missing. Find the previous token
19425 and use that for our error position. */
19430 /* Assume that the user meant to provide a semicolon. If
19431 we were to cp_parser_skip_to_end_of_statement, we might
19432 skip to a semicolon inside a member function definition
19433 and issue nonsensical error messages. */
19435 }
19438 {
19439 /* Add DECL to the list of members. */
19448 /* Add DECL to the queue of NSDMI to be parsed later. */
19450 }
19454 }
19455 }
19458 out:
19460 }
19462 /* Parse a pure-specifier.
19464 pure-specifier:
19465 = 0
19467 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19468 Otherwise, ERROR_MARK_NODE is returned. */
19470 static tree
19472 {
19475 /* Look for the `=' token. */
19478 /* Look for the `0' token. */
19487 /* Accept = default or = delete in c++0x mode. */
19490 {
19493 }
19495 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19497 {
19502 }
19504 {
19507 }
19510 }
19512 /* Parse a constant-initializer.
19514 constant-initializer:
19515 = constant-expression
19517 Returns a representation of the constant-expression. */
19519 static tree
19521 {
19522 /* Look for the `=' token. */
19526 /* It is invalid to write:
19528 struct S { static const int i = { 7 }; };
19530 */
19532 {
19535 /* Consume the opening brace. */
19537 /* Skip the initializer. */
19539 /* Look for the trailing `}'. */
19543 }
19547 NULL);
19548 }
19550 /* Derived classes [gram.class.derived] */
19552 /* Parse a base-clause.
19554 base-clause:
19555 : base-specifier-list
19557 base-specifier-list:
19558 base-specifier ... [opt]
19559 base-specifier-list , base-specifier ... [opt]
19561 Returns a TREE_LIST representing the base-classes, in the order in
19562 which they were declared. The representation of each node is as
19563 described by cp_parser_base_specifier.
19565 In the case that no bases are specified, this function will return
19566 NULL_TREE, not ERROR_MARK_NODE. */
19568 static tree
19570 {
19573 /* Look for the `:' that begins the list. */
19576 /* Scan the base-specifier-list. */
19578 {
19580 tree base;
19583 /* Look for the base-specifier. */
19585 /* Look for the (optional) ellipsis. */
19587 {
19588 /* Consume the `...'. */
19592 }
19594 /* Add BASE to the front of the list. */
19596 {
19598 /* Make this a pack expansion type. */
19602 {
19605 }
19606 }
19607 /* Peek at the next token. */
19609 /* If it's not a comma, then the list is complete. */
19612 /* Consume the `,'. */
19614 }
19616 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19617 base class had a qualified name. However, the next name that
19618 appears is certainly not qualified. */
19624 }
19626 /* Parse a base-specifier.
19628 base-specifier:
19629 :: [opt] nested-name-specifier [opt] class-name
19630 virtual access-specifier [opt] :: [opt] nested-name-specifier
19631 [opt] class-name
19632 access-specifier virtual [opt] :: [opt] nested-name-specifier
19633 [opt] class-name
19635 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19636 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19637 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19638 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19640 static tree
19642 {
19650 tree type;
19652 /* Process the optional `virtual' and `access-specifier'. */
19654 {
19655 /* Peek at the next token. */
19657 /* Process `virtual'. */
19659 {
19661 /* If `virtual' appears more than once, issue an error. */
19663 {
19667 }
19671 /* Consume the `virtual' token. */
19679 /* If more than one access specifier appears, issue an
19680 error. */
19683 {
19687 }
19691 /* Consume the access-specifier. */
19699 }
19700 }
19701 /* It is not uncommon to see programs mechanically, erroneously, use
19702 the 'typename' keyword to denote (dependent) qualified types
19703 as base classes. */
19705 {
19710 else
19712 "keyword %<typename%> not allowed in this context "
19715 }
19717 /* Look for the optional `::' operator. */
19719 /* Look for the nested-name-specifier. The simplest way to
19720 implement:
19722 [temp.res]
19724 The keyword `typename' is not permitted in a base-specifier or
19725 mem-initializer; in these contexts a qualified name that
19726 depends on a template-parameter is implicitly assumed to be a
19727 type name.
19729 is to pretend that we have seen the `typename' keyword at this
19730 point. */
19734 typename_type,
19736 /* If the base class is given by a qualified name, assume that names
19737 we see are type names or templates, as appropriate. */
19743 /* DR 950 allows decltype as a base-specifier. */
19745 else
19746 {
19747 /* Otherwise, look for the class-name. */
19749 class_scope_p,
19750 template_p,
19751 typename_type,
19756 }
19762 }
19764 /* Exception handling [gram.exception] */
19766 /* Parse an (optional) noexcept-specification.
19768 noexcept-specification:
19769 noexcept ( constant-expression ) [opt]
19771 If no noexcept-specification is present, returns NULL_TREE.
19772 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19773 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19774 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19775 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19776 in which case a boolean condition is returned instead. */
19778 static tree
19783 {
19787 /* Peek at the next token. */
19790 /* Is it a noexcept-specification? */
19792 {
19793 tree expr;
19797 {
19801 {
19802 /* Types may not be defined in an exception-specification. */
19804 parser->type_definition_forbidden_message
19809 /* Restore the saved message. */
19811 }
19812 else
19813 {
19816 }
19819 }
19820 else
19821 {
19825 }
19827 /* We cannot build a noexcept-spec right away because this will check
19828 that expr is a constexpr. */
19831 else
19833 }
19834 else
19836 }
19838 /* Parse an (optional) exception-specification.
19840 exception-specification:
19841 throw ( type-id-list [opt] )
19843 Returns a TREE_LIST representing the exception-specification. The
19844 TREE_VALUE of each node is a type. */
19846 static tree
19848 {
19850 tree type_id_list;
19853 /* Peek at the next token. */
19856 /* Is it a noexcept-specification? */
19862 /* If it's not `throw', then there's no exception-specification. */
19866 #if 0
19867 /* Enable this once a lot of code has transitioned to noexcept? */
19871 #endif
19873 /* Consume the `throw'. */
19876 /* Look for the `('. */
19879 /* Peek at the next token. */
19881 /* If it's not a `)', then there is a type-id-list. */
19883 {
19884 /* Types may not be defined in an exception-specification. */
19886 parser->type_definition_forbidden_message
19888 /* Parse the type-id-list. */
19890 /* Restore the saved message. */
19892 }
19893 else
19896 /* Look for the `)'. */
19900 }
19902 /* Parse an (optional) type-id-list.
19904 type-id-list:
19905 type-id ... [opt]
19906 type-id-list , type-id ... [opt]
19908 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19909 in the order that the types were presented. */
19911 static tree
19913 {
19917 {
19919 tree type;
19921 /* Get the next type-id. */
19923 /* Parse the optional ellipsis. */
19925 {
19926 /* Consume the `...'. */
19929 /* Turn the type into a pack expansion expression. */
19931 }
19932 /* Add it to the list. */
19934 /* Peek at the next token. */
19936 /* If it is not a `,', we are done. */
19939 /* Consume the `,'. */
19941 }
19944 }
19946 /* Parse a try-block.
19948 try-block:
19949 try compound-statement handler-seq */
19951 static tree
19953 {
19954 tree try_block;
19964 }
19966 /* Parse a function-try-block.
19968 function-try-block:
19969 try ctor-initializer [opt] function-body handler-seq */
19971 static bool
19973 {
19974 tree compound_stmt;
19975 tree try_block;
19978 /* Look for the `try' keyword. */
19981 /* Let the rest of the front end know where we are. */
19983 /* Parse the function-body. */
19984 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
19986 /* We're done with the `try' part. */
19988 /* Parse the handlers. */
19990 /* We're done with the handlers. */
19994 }
19996 /* Parse a handler-seq.
19998 handler-seq:
19999 handler handler-seq [opt] */
20001 static void
20003 {
20005 {
20008 /* Parse the handler. */
20010 /* Peek at the next token. */
20012 /* If it's not `catch' then there are no more handlers. */
20015 }
20016 }
20018 /* Parse a handler.
20020 handler:
20021 catch ( exception-declaration ) compound-statement */
20023 static void
20025 {
20026 tree handler;
20027 tree declaration;
20037 }
20039 /* Parse an exception-declaration.
20041 exception-declaration:
20042 type-specifier-seq declarator
20043 type-specifier-seq abstract-declarator
20044 type-specifier-seq
20045 ...
20047 Returns a VAR_DECL for the declaration, or NULL_TREE if the
20048 ellipsis variant is used. */
20050 static tree
20052 {
20053 cp_decl_specifier_seq type_specifiers;
20057 /* If it's an ellipsis, it's easy to handle. */
20059 {
20060 /* Consume the `...' token. */
20063 }
20065 /* Types may not be defined in exception-declarations. */
20067 parser->type_definition_forbidden_message
20070 /* Parse the type-specifier-seq. */
20074 /* If it's a `)', then there is no declarator. */
20077 else
20083 /* Restore the saved message. */
20090 }
20092 /* Parse a throw-expression.
20094 throw-expression:
20095 throw assignment-expression [opt]
20097 Returns a THROW_EXPR representing the throw-expression. */
20099 static tree
20101 {
20102 tree expression;
20107 /* Figure out whether or not there is an assignment-expression
20108 following the "throw" keyword. */
20116 else
20121 }
20123 /* GNU Extensions */
20125 /* Parse an (optional) asm-specification.
20127 asm-specification:
20128 asm ( string-literal )
20130 If the asm-specification is present, returns a STRING_CST
20131 corresponding to the string-literal. Otherwise, returns
20132 NULL_TREE. */
20134 static tree
20136 {
20138 tree asm_specification;
20140 /* Peek at the next token. */
20142 /* If the next token isn't the `asm' keyword, then there's no
20143 asm-specification. */
20147 /* Consume the `asm' token. */
20149 /* Look for the `('. */
20152 /* Look for the string-literal. */
20155 /* Look for the `)'. */
20159 }
20161 /* Parse an asm-operand-list.
20163 asm-operand-list:
20164 asm-operand
20165 asm-operand-list , asm-operand
20167 asm-operand:
20168 string-literal ( expression )
20169 [ string-literal ] string-literal ( expression )
20171 Returns a TREE_LIST representing the operands. The TREE_VALUE of
20172 each node is the expression. The TREE_PURPOSE is itself a
20173 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
20174 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
20175 is a STRING_CST for the string literal before the parenthesis. Returns
20176 ERROR_MARK_NODE if any of the operands are invalid. */
20178 static tree
20180 {
20185 {
20186 tree string_literal;
20187 tree expression;
20188 tree name;
20191 {
20192 /* Consume the `[' token. */
20194 /* Read the operand name. */
20199 /* Look for the closing `]'. */
20201 }
20202 else
20204 /* Look for the string-literal. */
20207 /* Look for the `('. */
20209 /* Parse the expression. */
20211 /* Look for the `)'. */
20219 /* Add this operand to the list. */
20221 expression,
20222 asm_operands);
20223 /* If the next token is not a `,', there are no more
20224 operands. */
20227 /* Consume the `,'. */
20229 }
20232 }
20234 /* Parse an asm-clobber-list.
20236 asm-clobber-list:
20237 string-literal
20238 asm-clobber-list , string-literal
20240 Returns a TREE_LIST, indicating the clobbers in the order that they
20241 appeared. The TREE_VALUE of each node is a STRING_CST. */
20243 static tree
20245 {
20249 {
20250 tree string_literal;
20252 /* Look for the string literal. */
20254 /* Add it to the list. */
20256 /* If the next token is not a `,', then the list is
20257 complete. */
20260 /* Consume the `,' token. */
20262 }
20265 }
20267 /* Parse an asm-label-list.
20269 asm-label-list:
20270 identifier
20271 asm-label-list , identifier
20273 Returns a TREE_LIST, indicating the labels in the order that they
20274 appeared. The TREE_VALUE of each node is a label. */
20276 static tree
20278 {
20282 {
20285 /* Look for the identifier. */
20288 {
20291 {
20297 }
20298 }
20299 /* If the next token is not a `,', then the list is
20300 complete. */
20303 /* Consume the `,' token. */
20305 }
20308 }
20310 /* Return TRUE iff the next tokens in the stream are possibly the
20311 beginning of a GNU extension attribute. */
20313 static bool
20315 {
20317 }
20319 /* Return TRUE iff the next tokens in the stream are possibly the
20320 beginning of a standard C++-11 attribute specifier. */
20322 static bool
20324 {
20326 }
20328 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20329 beginning of a standard C++-11 attribute specifier. */
20331 static bool
20333 {
20341 }
20343 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20344 beginning of a GNU extension attribute. */
20346 static bool
20348 {
20352 }
20354 /* Return true iff the next tokens can be the beginning of either a
20355 GNU attribute list, or a standard C++11 attribute sequence. */
20357 static bool
20359 {
20362 }
20364 /* Return true iff the next Nth tokens can be the beginning of either
20365 a GNU attribute list, or a standard C++11 attribute sequence. */
20367 static bool
20369 {
20372 }
20374 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
20375 of GNU attributes, or return NULL. */
20377 static tree
20379 {
20383 }
20385 /* Parse an (optional) series of attributes.
20387 attributes:
20388 attributes attribute
20390 attribute:
20391 __attribute__ (( attribute-list [opt] ))
20393 The return value is as for cp_parser_gnu_attribute_list. */
20395 static tree
20397 {
20401 {
20403 tree attribute_list;
20406 /* Peek at the next token. */
20408 /* If it's not `__attribute__', then we're done. */
20412 /* Consume the `__attribute__' keyword. */
20414 /* Look for the two `(' tokens. */
20418 /* Peek at the next token. */
20421 /* Parse the attribute-list. */
20423 else
20424 /* If the next token is a `)', then there is no attribute
20425 list. */
20428 /* Look for the two `)' tokens. */
20436 /* Add these new attributes to the list. */
20438 }
20441 }
20443 /* Parse a GNU attribute-list.
20445 attribute-list:
20446 attribute
20447 attribute-list , attribute
20449 attribute:
20450 identifier
20451 identifier ( identifier )
20452 identifier ( identifier , expression-list )
20453 identifier ( expression-list )
20455 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20456 to an attribute. The TREE_PURPOSE of each node is the identifier
20457 indicating which attribute is in use. The TREE_VALUE represents
20458 the arguments, if any. */
20460 static tree
20462 {
20468 {
20470 tree identifier;
20471 tree attribute;
20473 /* Look for the identifier. We also allow keywords here; for
20474 example `__attribute__ ((const))' is legal. */
20478 {
20481 /* Consume the token. */
20484 /* Save away the identifier that indicates which attribute
20485 this is. */
20487 /* For keywords, use the canonical spelling, not the
20488 parsed identifier. */
20494 /* Peek at the next token. */
20496 /* If it's an `(', then parse the attribute arguments. */
20498 {
20502 vec = cp_parser_parenthesized_expression_list
20508 else
20509 {
20512 }
20513 /* Save the arguments away. */
20515 }
20518 {
20519 /* Add this attribute to the list. */
20522 }
20525 }
20526 /* Now, look for more attributes. If the next token isn't a
20527 `,', we're done. */
20531 /* Consume the comma and keep going. */
20533 }
20536 /* We built up the list in reverse order. */
20538 }
20540 /* Parse a standard C++11 attribute.
20542 The returned representation is a TREE_LIST which TREE_PURPOSE is
20543 the scoped name of the attribute, and the TREE_VALUE is its
20544 arguments list.
20546 Note that the scoped name of the attribute is itself a TREE_LIST
20547 which TREE_PURPOSE is the namespace of the attribute, and
20548 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
20549 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
20550 and which TREE_PURPOSE is directly the attribute name.
20552 Clients of the attribute code should use get_attribute_namespace
20553 and get_attribute_name to get the actual namespace and name of
20554 attributes, regardless of their being GNU or C++11 attributes.
20556 attribute:
20557 attribute-token attribute-argument-clause [opt]
20559 attribute-token:
20560 identifier
20561 attribute-scoped-token
20563 attribute-scoped-token:
20564 attribute-namespace :: identifier
20566 attribute-namespace:
20567 identifier
20569 attribute-argument-clause:
20570 ( balanced-token-seq )
20572 balanced-token-seq:
20573 balanced-token [opt]
20574 balanced-token-seq balanced-token
20576 balanced-token:
20577 ( balanced-token-seq )
20578 [ balanced-token-seq ]
20579 { balanced-token-seq }. */
20581 static tree
20583 {
20587 /* First, parse name of the the attribute, a.k.a
20588 attribute-token. */
20605 {
20606 /* We are seeing a scoped attribute token. */
20616 else
20617 {
20621 }
20623 NULL_TREE);
20625 }
20626 else
20628 NULL_TREE);
20630 /* Now parse the optional argument clause of the attribute. */
20635 {
20641 /* A GNU attribute that takes an identifier in parameter. */
20644 vec = cp_parser_parenthesized_expression_list
20650 else
20651 {
20654 }
20658 else
20660 }
20663 }
20665 /* Parse a list of standard C++-11 attributes.
20667 attribute-list:
20668 attribute [opt]
20669 attribute-list , attribute[opt]
20670 attribute ...
20671 attribute-list , attribute ...
20672 */
20674 static tree
20676 {
20681 {
20686 {
20689 }
20694 }
20697 }
20699 /* Parse a standard C++-11 attribute specifier.
20701 attribute-specifier:
20702 [ [ attribute-list ] ]
20703 alignment-specifier
20705 alignment-specifier:
20706 alignas ( type-id ... [opt] )
20707 alignas ( alignment-expression ... [opt] ). */
20709 static tree
20711 {
20717 {
20726 else
20727 /* Warn about parsing c++11 attribute in non-c++1 mode, only
20728 when we are sure that we have actually parsed them. */
20730 }
20731 else
20732 {
20733 tree alignas_expr;
20735 /* Look for an alignment-specifier. */
20747 {
20750 }
20756 {
20760 alignas_expr =
20766 }
20769 {
20772 }
20776 /* Build the C++-11 representation of an 'aligned'
20777 attribute. */
20778 attributes =
20782 }
20785 }
20787 /* Parse a standard C++-11 attribute-specifier-seq.
20789 attribute-specifier-seq:
20790 attribute-specifier-seq [opt] attribute-specifier
20791 */
20793 static tree
20795 {
20799 {
20808 }
20812 }
20814 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20815 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20816 current value of the PEDANTIC flag, regardless of whether or not
20817 the `__extension__' keyword is present. The caller is responsible
20818 for restoring the value of the PEDANTIC flag. */
20820 static bool
20822 {
20823 /* Save the old value of the PEDANTIC flag. */
20827 {
20828 /* Consume the `__extension__' token. */
20830 /* We're not being pedantic while the `__extension__' keyword is
20831 in effect. */
20835 }
20838 }
20840 /* Parse a label declaration.
20842 label-declaration:
20843 __label__ label-declarator-seq ;
20845 label-declarator-seq:
20846 identifier , label-declarator-seq
20847 identifier */
20849 static void
20851 {
20852 /* Look for the `__label__' keyword. */
20856 {
20857 tree identifier;
20859 /* Look for an identifier. */
20861 /* If we failed, stop. */
20864 /* Declare it as a label. */
20866 /* If the next token is a `;', stop. */
20869 /* Look for the `,' separating the label declarations. */
20871 }
20873 /* Look for the final `;'. */
20875 }
20877 /* Support Functions */
20879 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20880 NAME should have one of the representations used for an
20881 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20882 is returned. If PARSER->SCOPE is a dependent type, then a
20883 SCOPE_REF is returned.
20885 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20886 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20887 was formed. Abstractly, such entities should not be passed to this
20888 function, because they do not need to be looked up, but it is
20889 simpler to check for this special case here, rather than at the
20890 call-sites.
20892 In cases not explicitly covered above, this function returns a
20893 DECL, OVERLOAD, or baselink representing the result of the lookup.
20894 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20895 is returned.
20897 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20898 (e.g., "struct") that was used. In that case bindings that do not
20899 refer to types are ignored.
20901 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20902 ignored.
20904 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20905 are ignored.
20907 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20908 types.
20910 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20911 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20912 NULL_TREE otherwise. */
20914 static tree
20921 location_t name_location)
20922 {
20923 tree decl;
20926 /* Assume that the lookup will be unambiguous. */
20930 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20931 no longer valid. Note that if we are parsing tentatively, and
20932 the parse fails, OBJECT_TYPE will be automatically restored. */
20938 /* A template-id has already been resolved; there is no lookup to
20939 do. */
20943 {
20947 }
20949 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20950 it should already have been checked to make sure that the name
20951 used matches the type being destroyed. */
20953 {
20954 tree type;
20956 /* Figure out to which type this destructor applies. */
20961 else
20963 /* If that's not a class type, there is no destructor. */
20970 /* If it was a class type, return the destructor. */
20972 }
20974 /* By this point, the NAME should be an ordinary identifier. If
20975 the id-expression was a qualified name, the qualifying scope is
20976 stored in PARSER->SCOPE at this point. */
20979 /* Perform the lookup. */
20981 {
20987 /* If the SCOPE is dependent, the lookup must be deferred until
20988 the template is instantiated -- unless we are explicitly
20989 looking up names in uninstantiated templates. Even then, we
20990 cannot look up the name if the scope is not a class type; it
20991 might, for example, be a template type parameter. */
20996 /* Defer lookup. */
20998 else
20999 {
21002 /* If PARSER->SCOPE is a dependent type, then it must be a
21003 class type, and we must not be checking dependencies;
21004 otherwise, we would have processed this lookup above. So
21005 that PARSER->SCOPE is not considered a dependent base by
21006 lookup_member, we must enter the scope here. */
21010 /* If the PARSER->SCOPE is a template specialization, it
21011 may be instantiated during name lookup. In that case,
21012 errors may be issued. Even if we rollback the current
21013 tentative parse, those errors are valid. */
21018 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
21019 lookup result and the nested-name-specifier nominates a class C:
21020 * if the name specified after the nested-name-specifier, when
21021 looked up in C, is the injected-class-name of C (Clause 9), or
21022 * if the name specified after the nested-name-specifier is the
21023 same as the identifier or the simple-template-id's template-
21024 name in the last component of the nested-name-specifier,
21025 the name is instead considered to name the constructor of
21026 class C. [ Note: for example, the constructor is not an
21027 acceptable lookup result in an elaborated-type-specifier so
21028 the constructor would not be used in place of the
21029 injected-class-name. --end note ] Such a constructor name
21030 shall be used only in the declarator-id of a declaration that
21031 names a constructor or in a using-declaration. */
21039 /* If we have a single function from a using decl, pull it out. */
21046 }
21048 /* If the scope is a dependent type and either we deferred lookup or
21049 we did lookup but didn't find the name, rememeber the name. */
21052 {
21054 {
21055 tree type;
21057 /* The resolution to Core Issue 180 says that `struct
21058 A::B' should be considered a type-name, even if `A'
21059 is dependent. */
21063 }
21067 CPP_CLOSE_PAREN)))
21071 else
21074 is_template);
21075 }
21078 }
21080 {
21082 /* Look up the name in the scope of the OBJECT_TYPE, unless the
21083 OBJECT_TYPE is not a class. */
21085 /* If the OBJECT_TYPE is a template specialization, it may
21086 be instantiated during name lookup. In that case, errors
21087 may be issued. Even if we rollback the current tentative
21088 parse, those errors are valid. */
21090 name,
21093 tf_warning_or_error);
21094 /* Look it up in the enclosing context, too. */
21102 }
21103 else
21104 {
21110 }
21112 /* If the lookup failed, let our caller know. */
21116 /* Pull out the template from an injected-class-name (or multiple). */
21120 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
21122 {
21125 /* The error message we have to print is too complicated for
21126 cp_parser_error, so we incorporate its actions directly. */
21128 {
21130 name);
21132 }
21134 }
21142 /* If we have resolved the name of a member declaration, check to
21143 see if the declaration is accessible. When the name resolves to
21144 set of overloaded functions, accessibility is checked when
21145 overload resolution is done.
21147 During an explicit instantiation, access is not checked at all,
21148 as per [temp.explicit]. */
21155 }
21157 /* Like cp_parser_lookup_name, but for use in the typical case where
21158 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
21159 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
21161 static tree
21163 {
21165 none_type,
21170 location);
21171 }
21173 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
21174 the current context, return the TYPE_DECL. If TAG_NAME_P is
21175 true, the DECL indicates the class being defined in a class-head,
21176 or declared in an elaborated-type-specifier.
21178 Otherwise, return DECL. */
21180 static tree
21182 {
21183 /* If the TEMPLATE_DECL is being declared as part of a class-head,
21184 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
21186 struct A {
21187 template <typename T> struct B;
21188 };
21190 template <typename T> struct A::B {};
21192 Similarly, in an elaborated-type-specifier:
21194 namespace N { struct X{}; }
21196 struct A {
21197 template <typename T> friend struct N::X;
21198 };
21200 However, if the DECL refers to a class type, and we are in
21201 the scope of the class, then the name lookup automatically
21202 finds the TYPE_DECL created by build_self_reference rather
21203 than a TEMPLATE_DECL. For example, in:
21205 template <class T> struct S {
21206 S s;
21207 };
21209 there is no need to handle such case. */
21215 }
21217 /* If too many, or too few, template-parameter lists apply to the
21218 declarator, issue an error message. Returns TRUE if all went well,
21219 and FALSE otherwise. */
21221 static bool
21224 location_t declarator_location)
21225 {
21227 {
21229 {
21237 /* If the DECLARATOR has the form `X<y>' then it uses one
21238 additional level of template parameters. */
21241 return cp_parser_check_template_parameters
21243 }
21258 }
21260 }
21262 /* NUM_TEMPLATES were used in the current declaration. If that is
21263 invalid, return FALSE and issue an error messages. Otherwise,
21264 return TRUE. If DECLARATOR is non-NULL, then we are checking a
21265 declarator and we can print more accurate diagnostics. */
21267 static bool
21270 location_t location,
21272 {
21273 /* If there are the same number of template classes and parameter
21274 lists, that's OK. */
21277 /* If there are more, but only one more, then we are referring to a
21278 member template. That's OK too. */
21281 /* If there are more template classes than parameter lists, we have
21282 something like:
21284 template <class T> void S<T>::R<T>::f (); */
21286 {
21296 else
21299 }
21300 /* Otherwise, there are too many template parameter lists. We have
21301 something like:
21303 template <class T> template <class U> void S::f(); */
21306 }
21308 /* Parse an optional `::' token indicating that the following name is
21309 from the global namespace. If so, PARSER->SCOPE is set to the
21310 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
21311 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
21312 Returns the new value of PARSER->SCOPE, if the `::' token is
21313 present, and NULL_TREE otherwise. */
21315 static tree
21317 {
21320 /* Peek at the next token. */
21322 /* If we're looking at a `::' token then we're starting from the
21323 global namespace, not our current location. */
21325 {
21326 /* Consume the `::' token. */
21328 /* Set the SCOPE so that we know where to start the lookup. */
21334 }
21336 {
21340 }
21343 }
21345 /* Returns TRUE if the upcoming token sequence is the start of a
21346 constructor declarator. If FRIEND_P is true, the declarator is
21347 preceded by the `friend' specifier. */
21349 static bool
21351 {
21353 tree nested_name_specifier;
21356 /* The common case is that this is not a constructor declarator, so
21357 try to avoid doing lots of work if at all possible. It's not
21358 valid declare a constructor at function scope. */
21361 /* And only certain tokens can begin a constructor declarator. */
21369 /* Parse tentatively; we are going to roll back all of the tokens
21370 consumed here. */
21372 /* Assume that we are looking at a constructor declarator. */
21375 /* Look for the optional `::' operator. */
21378 /* Look for the nested-name-specifier. */
21379 nested_name_specifier
21385 /* Outside of a class-specifier, there must be a
21386 nested-name-specifier. */
21394 /* If we have a class scope, this is easy; DR 147 says that S::S always
21395 names the constructor, and no other qualified name could. */
21398 {
21408 }
21409 /* If we still think that this might be a constructor-declarator,
21410 look for a class-name. */
21412 {
21413 /* If we have:
21415 template <typename T> struct S {
21416 S();
21417 };
21419 we must recognize that the nested `S' names a class. */
21420 tree type_decl;
21424 none_type,
21428 /* If there was no class-name, then this is not a constructor. */
21431 /* If we're still considering a constructor, we have to see a `(',
21432 to begin the parameter-declaration-clause, followed by either a
21433 `)', an `...', or a decl-specifier. We need to check for a
21434 type-specifier to avoid being fooled into thinking that:
21436 S (f) (int);
21438 is a constructor. (It is actually a function named `f' that
21439 takes one parameter (of type `int') and returns a value of type
21440 `S'. */
21448 /* A parameter declaration begins with a decl-specifier,
21449 which is either the "attribute" keyword, a storage class
21450 specifier, or (usually) a type-specifier. */
21452 {
21453 tree type;
21457 /* Names appearing in the type-specifier should be looked up
21458 in the scope of the class. */
21461 else
21462 {
21465 {
21469 {
21472 }
21473 }
21475 }
21477 /* Inside the constructor parameter list, surrounding
21478 template-parameter-lists do not apply. */
21479 saved_num_template_parameter_lists
21483 /* Look for the type-specifier. */
21485 CP_PARSER_FLAGS_NONE,
21491 parser->num_template_parameter_lists
21494 /* Leave the scope of the class. */
21499 }
21500 }
21502 /* We did not really want to consume any tokens. */
21506 }
21508 /* Parse the definition of the function given by the DECL_SPECIFIERS,
21509 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
21510 they must be performed once we are in the scope of the function.
21512 Returns the function defined. */
21514 static tree
21515 cp_parser_function_definition_from_specifiers_and_declarator
21518 tree attributes,
21520 {
21521 tree fn;
21524 /* Begin the function-definition. */
21527 /* The things we're about to see are not directly qualified by any
21528 template headers we've seen thus far. */
21531 /* If there were names looked up in the decl-specifier-seq that we
21532 did not check, check them now. We must wait until we are in the
21533 scope of the function to perform the checks, since the function
21534 might be a friend. */
21538 {
21539 /* Skip the entire function. */
21542 }
21544 {
21545 /* Seen already, skip it. An error message has already been output. */
21549 /* If this is a function from a class, pop the nested class. */
21552 }
21553 else
21554 {
21555 timevar_id_t tv;
21558 else
21564 }
21567 }
21569 /* Parse the part of a function-definition that follows the
21570 declarator. INLINE_P is TRUE iff this function is an inline
21571 function defined within a class-specifier.
21573 Returns the function defined. */
21575 static tree
21578 {
21579 tree fn;
21588 /* If the next token is `return', then the code may be trying to
21589 make use of the "named return value" extension that G++ used to
21590 support. */
21593 {
21594 /* Consume the `return' keyword. */
21596 /* Look for the identifier that indicates what value is to be
21597 returned. */
21599 /* Issue an error message. */
21602 /* Skip tokens until we reach the start of the function body. */
21604 {
21611 }
21612 }
21613 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21614 anything declared inside `f'. */
21615 saved_in_unbraced_linkage_specification_p
21618 /* Inside the function, surrounding template-parameter-lists do not
21619 apply. */
21620 saved_num_template_parameter_lists
21626 /* If the next token is `try', `__transaction_atomic', or
21627 `__transaction_relaxed`, then we are looking at either function-try-block
21628 or function-transaction-block. Note that all of these include the
21629 function-body. */
21632 RID_TRANSACTION_ATOMIC);
21634 RID_TRANSACTION_RELAXED))
21636 RID_TRANSACTION_RELAXED);
21639 else
21640 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21645 /* Finish the function. */
21648 /* Generate code for it, if necessary. */
21650 /* Restore the saved values. */
21651 parser->in_unbraced_linkage_specification_p
21653 parser->num_template_parameter_lists
21658 }
21660 /* Parse a template-declaration, assuming that the `export' (and
21661 `extern') keywords, if present, has already been scanned. MEMBER_P
21662 is as for cp_parser_template_declaration. */
21664 static void
21666 {
21669 tree parameter_list;
21674 /* Look for the `template' keyword. */
21679 /* And the `<'. */
21683 {
21684 /* 14.5.2.2 [temp.mem]
21686 A local class shall not have member templates. */
21691 }
21692 /* [temp]
21694 A template ... shall not have C linkage. */
21696 {
21698 /* Give it C++ linkage to avoid confusing other parts of the
21699 front end. */
21702 }
21703 else
21706 /* We cannot perform access checks on the template parameter
21707 declarations until we know what is being declared, just as we
21708 cannot check the decl-specifier list. */
21711 /* If the next token is `>', then we have an invalid
21712 specialization. Rather than complain about an invalid template
21713 parameter, issue an error message here. */
21715 {
21719 }
21720 else
21721 {
21722 /* Parse the template parameters. */
21724 }
21726 /* Get the deferred access checks from the parameter list. These
21727 will be checked once we know what is being declared, as for a
21728 member template the checks must be performed in the scope of the
21729 class containing the member. */
21732 /* Look for the `>'. */
21734 /* We just processed one more parameter list. */
21736 /* If the next token is `template', there are more template
21737 parameters. */
21739 RID_TEMPLATE))
21744 else
21745 {
21746 /* There are no access checks when parsing a template, as we do not
21747 know if a specialization will be a friend. */
21751 checks,
21752 member_p,
21757 /* If this is a member template declaration, let the front
21758 end know. */
21760 {
21765 }
21771 }
21772 /* We are done with the current parameter list. */
21777 /* Finish up. */
21780 /* Check the template arguments for a literal operator template. */
21784 {
21788 else
21789 {
21793 else
21794 {
21800 }
21801 }
21805 decl);
21806 }
21807 /* Register member declarations. */
21810 /* For the erroneous case of a template with C linkage, we pushed an
21811 implicit C++ linkage scope; exit that scope now. */
21814 /* If DECL is a function template, we must return to parse it later.
21815 (Even though there is no definition, there might be default
21816 arguments that need handling.) */
21821 }
21823 /* Perform the deferred access checks from a template-parameter-list.
21824 CHECKS is a TREE_LIST of access checks, as returned by
21825 get_deferred_access_checks. */
21827 static void
21828 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
21829 {
21833 }
21835 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21836 `function-definition' sequence that follows a template header.
21837 If MEMBER_P is true, this declaration appears in a class scope.
21839 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21840 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21842 static tree
21848 {
21851 cp_decl_specifier_seq decl_specifiers;
21855 /* This function is only used when processing a template
21856 declaration. */
21860 /* Defer access checks until we know what is being declared. */
21863 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21864 alternative. */
21867 CP_PARSER_FLAGS_OPTIONAL,
21873 /* There are no template typedefs. */
21875 {
21879 }
21881 /* Gather up the access checks that occurred the
21882 decl-specifier-seq. */
21885 /* Check for the declaration of a template class. */
21887 {
21889 {
21892 /* In this case:
21894 struct C {
21895 friend template <typename T> struct A<T>::B;
21896 };
21898 A<T>::B will be represented by a TYPENAME_TYPE, and
21899 therefore not recognized by shadow_tag. */
21901 && !decl
21908 else
21911 /* Perform access checks for template parameters. */
21913 }
21914 }
21916 /* Complain about missing 'typename' or other invalid type names. */
21919 {
21920 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21921 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21922 the rest of this declaration. */
21925 }
21927 /* If it's not a template class, try for a template function. If
21928 the next token is a `;', then this declaration does not declare
21929 anything. But, if there were errors in the decl-specifiers, then
21930 the error might well have come from an attempted class-specifier.
21931 In that case, there's no need to warn about a missing declarator. */
21935 {
21938 checks,
21940 member_p,
21941 declares_class_or_enum,
21943 NULL);
21945 /* 7.1.1-1 [dcl.stc]
21947 A storage-class-specifier shall not be specified in an explicit
21948 specialization... */
21950 && explicit_specialization_p
21952 {
21956 }
21960 }
21962 /* Look for a trailing `;' after the declaration. */
21968 out:
21971 /* Clear any current qualification; whatever comes next is the start
21972 of something new. */
21978 }
21980 /* Parse a cast-expression that is not the operand of a unary "&". */
21982 static tree
21984 {
21987 }
21989 /* Parse a functional cast to TYPE. Returns an expression
21990 representing the cast. */
21992 static tree
21994 {
21996 tree expression_list;
21997 tree cast;
22001 {
22008 tf_warning_or_error);
22009 }
22018 else
22019 {
22022 }
22025 tf_warning_or_error);
22026 /* [expr.const]/1: In an integral constant expression "only type
22027 conversions to integral or enumeration type can be used". */
22033 NIC_CONSTRUCTOR))
22036 }
22038 /* Save the tokens that make up the body of a member function defined
22039 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
22040 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
22041 specifiers applied to the declaration. Returns the FUNCTION_DECL
22042 for the member function. */
22044 static tree
22048 tree attributes)
22049 {
22052 tree fn;
22054 /* Create the FUNCTION_DECL. */
22056 /* If something went badly wrong, bail out now. */
22058 {
22059 /* If there's a function-body, skip it. */
22064 }
22066 /* Remember it, if there default args to post process. */
22069 /* Save away the tokens that make up the body of the
22070 function. */
22072 /* We can have braced-init-list mem-initializers before the fn body. */
22074 {
22078 {
22079 /* cache_group will stop after an un-nested { } pair, too. */
22083 /* variadic mem-inits have ... after the ')'. */
22086 }
22087 }
22089 /* Handle function try blocks. */
22094 /* Save away the inline definition; we will process it when the
22095 class is complete. */
22099 /* We need to know that this was defined in the class, so that
22100 friend templates are handled correctly. */
22103 /* Add FN to the queue of functions to be parsed later. */
22107 }
22109 /* Save the tokens that make up the in-class initializer for a non-static
22110 data member. Returns a DEFAULT_ARG. */
22112 static tree
22114 {
22116 }
22118 /* Parse a template-argument-list, as well as the trailing ">" (but
22119 not the opening "<"). See cp_parser_template_argument_list for the
22120 return value. */
22122 static tree
22124 {
22125 tree arguments;
22126 tree saved_scope;
22127 tree saved_qualifying_scope;
22128 tree saved_object_scope;
22133 /* [temp.names]
22135 When parsing a template-id, the first non-nested `>' is taken as
22136 the end of the template-argument-list rather than a greater-than
22137 operator. */
22138 saved_greater_than_is_operator_p
22141 /* Parsing the argument list may modify SCOPE, so we save it
22142 here. */
22146 /* We need to evaluate the template arguments, even though this
22147 template-id may be nested within a "sizeof". */
22152 /* Parse the template-argument-list itself. */
22156 else
22158 /* Look for the `>' that ends the template-argument-list. If we find
22159 a '>>' instead, it's probably just a typo. */
22161 {
22163 {
22164 /* In C++0x, a `>>' in a template argument list or cast
22165 expression is considered to be two separate `>'
22166 tokens. So, change the current token to a `>', but don't
22167 consume it: it will be consumed later when the outer
22168 template argument list (or cast expression) is parsed.
22169 Note that this replacement of `>' for `>>' is necessary
22170 even if we are parsing tentatively: in the tentative
22171 case, after calling
22172 cp_parser_enclosed_template_argument_list we will always
22173 throw away all of the template arguments and the first
22174 closing `>', either because the template argument list
22175 was erroneous or because we are replacing those tokens
22176 with a CPP_TEMPLATE_ID token. The second `>' (which will
22177 not have been thrown away) is needed either to close an
22178 outer template argument list or to complete a new-style
22179 cast. */
22182 }
22184 {
22185 /* If we're in a nested template argument list, the '>>' has
22186 to be a typo for '> >'. We emit the error message, but we
22187 continue parsing and we push a '>' as next token, so that
22188 the argument list will be parsed correctly. Note that the
22189 global source location is still on the token before the
22190 '>>', so we need to say explicitly where we want it. */
22196 }
22197 else
22198 {
22199 /* If this is not a nested template argument list, the '>>'
22200 is a typo for '>'. Emit an error message and continue.
22201 Same deal about the token location, but here we can get it
22202 right by consuming the '>>' before issuing the diagnostic. */
22205 "spurious %<>>%>, use %<>%> to terminate "
22207 }
22208 }
22209 else
22211 /* The `>' token might be a greater-than operator again now. */
22212 parser->greater_than_is_operator_p
22214 /* Restore the SAVED_SCOPE. */
22222 }
22224 /* MEMBER_FUNCTION is a member function, or a friend. If default
22225 arguments, or the body of the function have not yet been parsed,
22226 parse them now. */
22228 static void
22230 {
22232 /* If this member is a template, get the underlying
22233 FUNCTION_DECL. */
22237 /* There should not be any class definitions in progress at this
22238 point; the bodies of members are only parsed outside of all class
22239 definitions. */
22241 /* While we're parsing the member functions we might encounter more
22242 classes. We want to handle them right away, but we don't want
22243 them getting mixed up with functions that are currently in the
22244 queue. */
22247 /* Make sure that any template parameters are in scope. */
22250 /* If the body of the function has not yet been parsed, parse it
22251 now. */
22253 {
22254 tree function_scope;
22257 /* The function is no longer pending; we are processing it. */
22262 /* If this is a local class, enter the scope of the containing
22263 function. */
22268 /* Push the body of the function onto the lexer stack. */
22271 /* Let the front end know that we going to be defining this
22272 function. */
22276 /* Don't do access checking if it is a templated function. */
22280 /* Now, parse the body of the function. */
22287 /* Leave the scope of the containing function. */
22291 }
22293 /* Remove any template parameters from the symbol table. */
22296 /* Restore the queue. */
22299 }
22301 /* If DECL contains any default args, remember it on the unparsed
22302 functions queue. */
22304 static void
22306 {
22307 tree probe;
22310 probe;
22313 {
22317 }
22318 }
22320 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
22321 which is either a FIELD_DECL or PARM_DECL. Parse it and return
22322 the result. For a PARM_DECL, PARMTYPE is the corresponding type
22323 from the parameter-type-list. */
22325 static tree
22328 {
22330 tree parsed_arg;
22336 /* Push the saved tokens for the default argument onto the parser's
22337 lexer stack. */
22343 /* Parse the default argument. */
22354 {
22355 /* In a non-template class, check conversions now. In a template,
22356 we'll wait and instantiate these as needed. */
22359 else
22360 {
22366 }
22367 }
22369 /* If the token stream has not been completely used up, then
22370 there was extra junk after the end of the default
22371 argument. */
22373 {
22376 else
22378 }
22380 /* Revert to the main lexer. */
22384 }
22386 /* FIELD is a non-static data member with an initializer which we saved for
22387 later; parse it now. */
22389 static void
22391 {
22392 tree def;
22397 NULL_TREE);
22401 }
22403 /* FN is a FUNCTION_DECL which may contains a parameter with an
22404 unparsed DEFAULT_ARG. Parse the default args now. This function
22405 assumes that the current scope is the scope in which the default
22406 argument should be processed. */
22408 static void
22410 {
22414 /* While we're parsing the default args, we might (due to the
22415 statement expression extension) encounter more classes. We want
22416 to handle them right away, but we don't want them getting mixed
22417 up with default args that are currently in the queue. */
22420 /* Local variable names (and the `this' keyword) may not appear
22421 in a default argument. */
22432 {
22434 tree parsed_arg;
22436 tree copy;
22443 /* This can happen for a friend declaration for a function
22444 already declared with default arguments. */
22447 parsed_arg
22449 default_arg,
22452 {
22454 }
22458 /* Update any instantiations we've already created. */
22462 }
22466 /* Make sure no default arg is missing. */
22469 /* Restore the state of local_variables_forbidden_p. */
22472 /* Restore the queue. */
22474 }
22476 /* Parse the operand of `sizeof' (or a similar operator). Returns
22477 either a TYPE or an expression, depending on the form of the
22478 input. The KEYWORD indicates which kind of expression we have
22479 encountered. */
22481 static tree
22483 {
22491 /* Types cannot be defined in a `sizeof' expression. Save away the
22492 old message. */
22494 /* And create the new one. */
22500 /* The restrictions on constant-expressions do not apply inside
22501 sizeof expressions. */
22502 saved_integral_constant_expression_p
22504 saved_non_integral_constant_expression_p
22508 /* If it's a `...', then we are computing the length of a parameter
22509 pack. */
22512 {
22513 /* Consume the `...'. */
22517 /* Note that this is an expansion. */
22519 }
22521 /* Do not actually evaluate the expression. */
22524 /* If it's a `(', then we might be looking at the type-id
22525 construction. */
22527 {
22528 tree type;
22531 /* We can't be sure yet whether we're looking at a type-id or an
22532 expression. */
22534 /* Consume the `('. */
22536 /* Parse the type-id. */
22541 /* Now, look for the trailing `)'. */
22543 /* If all went well, then we're done. */
22545 {
22546 cp_decl_specifier_seq decl_specs;
22548 /* Build a trivial decl-specifier-seq. */
22552 /* Call grokdeclarator to figure out what type this is. */
22555 TYPENAME,
22558 }
22559 }
22564 /* If the type-id production did not work out, then we must be
22565 looking at the unary-expression production. */
22571 /* Build a pack expansion. */
22574 /* Go back to evaluating expressions. */
22578 /* Free the message we created. */
22580 /* And restore the old one. */
22582 parser->integral_constant_expression_p
22584 parser->non_integral_constant_expression_p
22588 }
22590 /* If the current declaration has no declarator, return true. */
22592 static bool
22594 {
22595 /* If the next token is a `;' or a `,' then there is no
22596 declarator. */
22599 }
22601 /* Update the DECL_SPECS to reflect the storage class indicated by
22602 KEYWORD. */
22604 static void
22609 {
22610 cp_storage_class storage_class;
22613 {
22617 }
22619 {
22622 }
22627 {
22630 }
22633 {
22651 }
22655 /* A storage class specifier cannot be applied alongside a typedef
22656 specifier. If there is a typedef specifier present then set
22657 conflicting_specifiers_p which will trigger an error later
22658 on in grokdeclarator. */
22661 }
22663 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22664 is true, the type is a class or enum definition. */
22666 static void
22668 tree type_spec,
22671 {
22674 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22675 (with, for example, in "typedef int wchar_t;") we remember that
22676 this is what happened. In system headers, we ignore these
22677 declarations so that G++ can work with system headers that are not
22678 C++-safe. */
22680 && !type_definition_p
22690 {
22693 ds_redefined_builtin_type_spec,
22694 token);
22696 {
22700 }
22701 }
22704 else
22705 {
22710 }
22711 }
22713 /* True iff TOKEN is the GNU keyword __thread. */
22715 static bool
22717 {
22720 }
22722 /* Set the location for a declarator specifier and check if it is
22723 duplicated.
22725 DECL_SPECS is the sequence of declarator specifiers onto which to
22726 set the location.
22728 DS is the single declarator specifier to set which location is to
22729 be set onto the existing sequence of declarators.
22731 LOCATION is the location for the declarator specifier to
22732 consider. */
22734 static void
22737 {
22746 {
22750 }
22751 else
22752 {
22754 {
22758 else
22759 {
22762 OPT_Wlong_long,
22764 }
22765 }
22767 {
22772 else
22774 }
22775 else
22776 {
22792 "__complex"
22793 };
22796 }
22797 }
22798 }
22800 /* Return true iff the declarator specifier DS is present in the
22801 sequence of declarator specifiers DECL_SPECS. */
22803 bool
22805 cp_decl_spec ds)
22806 {
22813 }
22815 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22816 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22818 static bool
22820 {
22822 }
22824 /* Issue an error message indicating that TOKEN_DESC was expected.
22825 If KEYWORD is true, it indicated this function is called by
22826 cp_parser_require_keword and the required token can only be
22827 a indicated keyword. */
22829 static void
22831 required_token token_desc,
22833 {
22835 {
22904 }
22906 {
22908 {
22987 }
22988 }
22989 else
22991 }
22995 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22996 issue an error message indicating that TOKEN_DESC was expected.
22998 Returns the token consumed, if the token had the appropriate type.
22999 Otherwise, returns NULL. */
23004 required_token token_desc)
23005 {
23008 else
23009 {
23010 /* Output the MESSAGE -- unless we're parsing tentatively. */
23014 }
23015 }
23017 /* An error message is produced if the next token is not '>'.
23018 All further tokens are skipped until the desired token is
23019 found or '{', '}', ';' or an unbalanced ')' or ']'. */
23021 static void
23023 {
23024 /* Current level of '< ... >'. */
23026 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
23029 /* Are we ready, yet? If not, issue error message. */
23033 /* Skip tokens until the desired token is found. */
23035 {
23036 /* Peek at the next token. */
23038 {
23046 /* C++0x views the `>>' operator as two `>' tokens, but
23047 C++98 does not. */
23050 {
23051 /* We've hit a `>>' where the first `>' closes the
23052 template argument list, and the second `>' is
23053 spurious. Just consume the `>>' and stop; we've
23054 already produced at least one error. */
23057 }
23058 /* Fall through for C++0x, so we handle the second `>' in
23059 the `>>'. */
23063 {
23064 /* We've reached the token we want, consume it and stop. */
23067 }
23086 /* The '>' was probably forgotten, don't look further. */
23091 }
23093 /* Consume this token. */
23095 }
23096 }
23098 /* If the next token is the indicated keyword, consume it. Otherwise,
23099 issue an error message indicating that TOKEN_DESC was expected.
23101 Returns the token consumed, if the token had the appropriate type.
23102 Otherwise, returns NULL. */
23107 required_token token_desc)
23108 {
23112 {
23115 }
23118 }
23120 /* Returns TRUE iff TOKEN is a token that can begin the body of a
23121 function-definition. */
23123 static bool
23125 {
23128 /* A ctor-initializer begins with a `:'. */
23130 /* A function-try-block begins with `try'. */
23132 /* A function-transaction-block begins with `__transaction_atomic'
23133 or `__transaction_relaxed'. */
23136 /* The named return value extension begins with `return'. */
23138 }
23140 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
23141 definition. */
23143 static bool
23145 {
23150 }
23152 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
23153 C++0x) ending a template-argument. */
23155 static bool
23157 {
23165 }
23167 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
23168 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
23170 static bool
23173 {
23179 /* Check for the sequence `<::' in the original code. It would be lexed as
23180 `[:', where `[' is a digraph, and there is no whitespace before
23181 `:'. */
23183 {
23188 }
23190 }
23192 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
23193 or none_type otherwise. */
23195 static enum tag_types
23197 {
23199 {
23209 }
23210 }
23212 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
23214 static void
23216 {
23220 {
23224 type);
23227 }
23228 }
23230 /* Issue an error message if DECL is redeclared with different
23231 access than its original declaration [class.access.spec/3].
23232 This applies to nested classes and nested class templates.
23233 [class.mem/1]. */
23235 static void
23237 {
23246 }
23248 /* Look for the `template' keyword, as a syntactic disambiguator.
23249 Return TRUE iff it is present, in which case it will be
23250 consumed. */
23252 static bool
23254 {
23256 {
23257 /* In C++98 the `template' keyword can only be used within templates;
23258 outside templates the parser can always figure out what is a
23259 template and what is not. In C++11, per the resolution of DR 468,
23260 `template' is allowed in cases where it is not strictly necessary. */
23263 {
23266 "in C++98 %<template%> (as a disambiguator) is only "
23268 /* If this part of the token stream is rescanned, the same
23269 error message would be generated. So, we purge the token
23270 from the stream. */
23273 }
23274 else
23275 {
23276 /* Consume the `template' keyword. */
23279 }
23280 }
23282 }
23284 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
23285 set PARSER->SCOPE, and perform other related actions. */
23287 static void
23289 {
23295 /* Get the stored value. */
23297 /* Perform any access checks that were deferred. */
23300 {
23305 }
23306 /* Set the scope from the stored value. */
23310 }
23312 /* Consume tokens up through a non-nested END token. Returns TRUE if we
23313 encounter the end of a block before what we were looking for. */
23315 static bool
23319 {
23321 {
23324 /* Abort a parenthesized expression if we encounter a semicolon. */
23328 /* If we've reached the end of the file, stop. */
23334 /* We've hit the end of an enclosing block, so there's been some
23335 kind of syntax error. */
23338 /* Consume the token. */
23340 /* See if it starts a new group. */
23342 {
23344 /* In theory this should probably check end == '}', but
23345 cp_parser_save_member_function_body needs it to exit
23346 after either '}' or ')' when called with ')'. */
23349 }
23351 {
23355 }
23360 }
23361 }
23363 /* Like above, for caching a default argument or NSDMI. Both of these are
23364 terminated by a non-nested comma, but it can be unclear whether or not a
23365 comma is nested in a template argument list unless we do more parsing.
23366 In order to handle this ambiguity, when we encounter a ',' after a '<'
23367 we try to parse what follows as a parameter-declaration-list (in the
23368 case of a default argument) or a member-declarator (in the case of an
23369 NSDMI). If that succeeds, then we stop caching. */
23371 static tree
23373 {
23378 tree default_argument;
23380 /* Add tokens until we have processed the entire default
23381 argument. We add the range [first_token, token). */
23384 {
23385 /* For list-initialization, this is straightforward. */
23388 }
23390 {
23393 /* Peek at the next token. */
23395 /* What we do depends on what token we have. */
23397 {
23398 /* In valid code, a default argument must be
23399 immediately followed by a `,' `)', or `...'. */
23402 {
23403 /* If we've seen a '<', we might be in a
23404 template-argument-list. Until Core issue 325 is
23405 resolved, we don't know how this situation ought
23406 to be handled, so try to DTRT. We check whether
23407 what comes after the comma is a valid parameter
23408 declaration list. If it is, then the comma ends
23409 the default argument; otherwise the default
23410 argument continues. */
23412 tree t;
23414 /* Set ITALP so cp_parser_parameter_declaration_list
23415 doesn't decide to commit to this parse. */
23423 {
23429 }
23430 else
23431 {
23437 }
23444 }
23447 /* If we run into a non-nested `;', `}', or `]',
23448 then the code is invalid -- but the default
23449 argument is certainly over. */
23455 /* Update DEPTH, if necessary. */
23470 /* This might be the comparison operator, or it might
23471 start a template argument list. */
23478 /* Fall through for C++0x, which treats the `>>'
23479 operator like two `>' tokens in certain
23480 cases. */
23484 {
23485 /* This might be an operator, or it might close a
23486 template argument list. But if a previous '<'
23487 started a template argument list, this will have
23488 closed it, so we can't be in one anymore. */
23492 }
23495 /* If we run out of tokens, issue an error message. */
23504 /* In these cases, we should look for template-ids.
23505 For example, if the default argument is
23506 `X<int, double>()', we need to do name lookup to
23507 figure out whether or not `X' is a template; if
23508 so, the `,' does not end the default argument.
23510 That is not yet done. */
23515 }
23517 /* If we've reached the end, stop. */
23521 /* Add the token to the token block. */
23523 }
23525 /* Create a DEFAULT_ARG to represent the unparsed default
23526 argument. */
23533 }
23535 /* Begin parsing tentatively. We always save tokens while parsing
23536 tentatively so that if the tentative parsing fails we can restore the
23537 tokens. */
23539 static void
23541 {
23542 /* Enter a new parsing context. */
23544 /* Begin saving tokens. */
23546 /* In order to avoid repetitive access control error messages,
23547 access checks are queued up until we are no longer parsing
23548 tentatively. */
23550 }
23552 /* Commit to the currently active tentative parse. */
23554 static void
23556 {
23560 /* Mark all of the levels as committed. */
23563 {
23570 }
23571 }
23573 /* Abort the currently active tentative parse. All consumed tokens
23574 will be rolled back, and no diagnostics will be issued. */
23576 static void
23578 {
23582 /* Now, pretend that we want to see if the construct was
23583 successfully parsed. */
23585 }
23587 /* Stop parsing tentatively. If a parse error has occurred, restore the
23588 token stream. Otherwise, commit to the tokens we have consumed.
23589 Returns true if no error occurred; false otherwise. */
23591 static bool
23593 {
23597 /* Remember whether or not an error occurred, since we are about to
23598 destroy that information. */
23600 /* Remove the topmost context from the stack. */
23603 /* If no parse errors occurred, commit to the tentative parse. */
23605 {
23606 /* Commit to the tokens read tentatively, unless that was
23607 already done. */
23612 }
23613 /* Otherwise, if errors occurred, roll back our state so that things
23614 are just as they were before we began the tentative parse. */
23615 else
23616 {
23619 }
23620 /* Add the context to the front of the free list. */
23625 }
23627 /* Returns true if we are parsing tentatively and are not committed to
23628 this tentative parse. */
23630 static bool
23632 {
23635 }
23637 /* Returns nonzero iff an error has occurred during the most recent
23638 tentative parse. */
23640 static bool
23642 {
23645 }
23647 /* Returns nonzero if GNU extensions are allowed. */
23649 static bool
23651 {
23653 }
23654 \f
23655 /* Objective-C++ Productions */
23658 /* Parse an Objective-C expression, which feeds into a primary-expression
23659 above.
23661 objc-expression:
23662 objc-message-expression
23663 objc-string-literal
23664 objc-encode-expression
23665 objc-protocol-expression
23666 objc-selector-expression
23668 Returns a tree representation of the expression. */
23670 static tree
23672 {
23673 /* Try to figure out what kind of declaration is present. */
23677 {
23687 {
23699 }
23705 }
23708 }
23710 /* Parse an Objective-C message expression.
23712 objc-message-expression:
23713 [ objc-message-receiver objc-message-args ]
23715 Returns a representation of an Objective-C message. */
23717 static tree
23719 {
23728 }
23730 /* Parse an objc-message-receiver.
23732 objc-message-receiver:
23733 expression
23734 simple-type-specifier
23736 Returns a representation of the type or expression. */
23738 static tree
23740 {
23741 tree rcv;
23743 /* An Objective-C message receiver may be either (1) a type
23744 or (2) an expression. */
23753 CP_PARSER_FLAGS_NONE);
23756 }
23758 /* Parse the arguments and selectors comprising an Objective-C message.
23760 objc-message-args:
23761 objc-selector
23762 objc-selector-args
23763 objc-selector-args , objc-comma-args
23765 objc-selector-args:
23766 objc-selector [opt] : assignment-expression
23767 objc-selector-args objc-selector [opt] : assignment-expression
23769 objc-comma-args:
23770 assignment-expression
23771 objc-comma-args , assignment-expression
23773 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23774 selector arguments and TREE_VALUE containing a list of comma
23775 arguments. */
23777 static tree
23779 {
23785 {
23791 /* Detect if we have a unary selector. */
23800 sel_args
23805 }
23807 /* Handle non-selector arguments, if any. */
23809 {
23810 tree arg;
23815 addl_args
23820 }
23823 {
23826 }
23829 }
23831 /* Parse an Objective-C encode expression.
23833 objc-encode-expression:
23834 @encode objc-typename
23836 Returns an encoded representation of the type argument. */
23838 static tree
23840 {
23841 tree type;
23851 {
23855 }
23857 /* This happens if we find @encode(T) (where T is a template
23858 typename or something dependent on a template typename) when
23859 parsing a template. In that case, we can't compile it
23860 immediately, but we rather create an AT_ENCODE_EXPR which will
23861 need to be instantiated when the template is used.
23862 */
23864 {
23868 }
23871 }
23873 /* Parse an Objective-C @defs expression. */
23875 static tree
23877 {
23878 tree name;
23886 }
23888 /* Parse an Objective-C protocol expression.
23890 objc-protocol-expression:
23891 @protocol ( identifier )
23893 Returns a representation of the protocol expression. */
23895 static tree
23897 {
23898 tree proto;
23906 }
23908 /* Parse an Objective-C selector expression.
23910 objc-selector-expression:
23911 @selector ( objc-method-signature )
23913 objc-method-signature:
23914 objc-selector
23915 objc-selector-seq
23917 objc-selector-seq:
23918 objc-selector :
23919 objc-selector-seq objc-selector :
23921 Returns a representation of the method selector. */
23923 static tree
23925 {
23937 {
23946 {
23947 /* Detect if we have a unary selector. */
23949 {
23952 }
23953 else
23954 {
23956 }
23957 }
23962 {
23963 sel_seq
23966 sel_seq
23969 }
23970 else
23971 sel_seq
23976 }
23978 finish_selector:
23982 }
23984 /* Parse a list of identifiers.
23986 objc-identifier-list:
23987 identifier
23988 objc-identifier-list , identifier
23990 Returns a TREE_LIST of identifier nodes. */
23992 static tree
23994 {
23995 tree identifier;
23996 tree list;
24007 {
24014 identifier));
24016 }
24019 }
24021 /* Parse an Objective-C alias declaration.
24023 objc-alias-declaration:
24024 @compatibility_alias identifier identifier ;
24026 This function registers the alias mapping with the Objective-C front end.
24027 It returns nothing. */
24029 static void
24031 {
24039 }
24041 /* Parse an Objective-C class forward-declaration.
24043 objc-class-declaration:
24044 @class objc-identifier-list ;
24046 The function registers the forward declarations with the Objective-C
24047 front end. It returns nothing. */
24049 static void
24051 {
24054 {
24055 tree id;
24065 else
24067 }
24069 }
24071 /* Parse a list of Objective-C protocol references.
24073 objc-protocol-refs-opt:
24074 objc-protocol-refs [opt]
24076 objc-protocol-refs:
24077 < objc-identifier-list >
24079 Returns a TREE_LIST of identifiers, if any. */
24081 static tree
24083 {
24087 {
24091 }
24094 }
24096 /* Parse a Objective-C visibility specification. */
24098 static void
24100 {
24104 {
24119 }
24121 /* Eat '@private'/'@protected'/'@public'. */
24123 }
24125 /* Parse an Objective-C method type. Return 'true' if it is a class
24126 (+) method, and 'false' if it is an instance (-) method. */
24130 {
24133 else
24135 }
24137 /* Parse an Objective-C protocol qualifier. */
24139 static tree
24141 {
24154 {
24159 }
24162 }
24164 /* Parse an Objective-C typename. */
24166 static tree
24168 {
24172 {
24178 /* An ObjC type name may consist of just protocol qualifiers, in which
24179 case the type shall default to 'id'. */
24181 {
24184 /* If the type could not be parsed, an error has already
24185 been produced. For error recovery, behave as if it had
24186 not been specified, which will use the default type
24187 'id'. */
24189 {
24191 /* We need to skip to the closing parenthesis as
24192 cp_parser_type_id() does not seem to do it for
24193 us. */
24198 }
24199 }
24203 }
24206 }
24208 /* Check to see if TYPE refers to an Objective-C selector name. */
24210 static bool
24212 {
24218 }
24220 /* Parse an Objective-C selector. */
24222 static tree
24224 {
24228 {
24231 }
24233 /* C++ operator names are allowed to appear in ObjC selectors. */
24235 {
24248 }
24249 }
24251 /* Parse an Objective-C params list. */
24253 static tree
24255 {
24261 {
24271 /* Detect if we have a unary selector. */
24274 {
24277 }
24281 {
24282 /* Something went quite wrong. There should be a colon
24283 here, but there is not. Stop parsing parameters. */
24285 }
24287 /* New ObjC allows attributes on parameters too. */
24292 params
24295 type_name,
24296 identifier,
24297 parm_attr));
24300 }
24303 {
24306 }
24308 /* We allow tail attributes for the method. */
24310 {
24318 }
24321 {
24324 }
24326 }
24328 /* Parse the non-keyword Objective-C params. */
24330 static tree
24333 {
24339 {
24341 tree parm;
24347 {
24352 }
24354 /* TODO: parse attributes for tail parameters. */
24363 }
24365 /* We allow tail attributes for the method. */
24367 {
24369 {
24374 }
24375 else
24376 /* We have an error, but parse the attributes, so that we can
24377 carry on. */
24383 }
24386 }
24388 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
24390 static void
24392 {
24395 /* If the next token is `extern' and the following token is a string
24396 literal, then we have a linkage specification. */
24398 && cp_parser_is_pure_string_literal
24401 /* Handle #pragma, if any. */
24404 /* Allow stray semicolons. */
24407 /* Mark methods as optional or required, when building protocols. */
24409 {
24412 }
24414 {
24417 }
24420 /* Other stray characters must generate errors. */
24422 {
24426 }
24427 /* Finally, try to parse a block-declaration, or a function-definition. */
24428 else
24430 }
24432 /* Parse a method signature. */
24434 static tree
24436 {
24452 }
24454 static bool
24456 {
24457 tree tattr;
24462 /* If the attributes are followed by a method introducer, this is not allowed.
24463 Dump the attributes and flag the situation. */
24468 /* Otherwise, the attributes introduce some interstitial code, possibly so
24469 rewind to allow that check. */
24472 }
24474 /* Parse an Objective-C method prototype list. */
24476 static void
24478 {
24482 {
24484 {
24489 else
24493 {
24497 }
24500 }
24506 OPT_Wattributes,
24508 else
24509 /* Allow for interspersed non-ObjC++ code. */
24513 }
24517 else
24521 }
24523 /* Parse an Objective-C method definition list. */
24525 static void
24527 {
24531 {
24532 tree meth;
24535 {
24541 else
24546 {
24550 }
24552 NULL_TREE);
24554 /* For historical reasons, we accept an optional semicolon. */
24561 {
24568 }
24569 }
24570 /* The following case will be removed once @synthesize is
24571 completely implemented. */
24582 else
24583 /* Allow for interspersed non-ObjC++ code. */
24587 }
24591 else
24595 }
24597 /* Parse Objective-C ivars. */
24599 static void
24601 {
24612 {
24613 cp_decl_specifier_seq declspecs;
24615 tree prefix_attributes;
24623 CP_PARSER_FLAGS_OPTIONAL,
24627 /* auto, register, static, extern, mutable. */
24629 {
24632 }
24634 /* thread_local. */
24636 {
24639 }
24641 /* typedef. */
24643 {
24646 }
24651 /* Keep going until we hit the `;' at the end of the
24652 declaration. */
24654 {
24659 /* Check for a (possibly unnamed) bitfield declaration. */
24667 {
24668 /* Get the name of the bitfield. */
24671 sfk_none);
24673 eat_colon:
24675 /* Get the width of the bitfield. */
24676 width
24679 NULL);
24680 }
24681 else
24682 {
24683 /* Parse the declarator. */
24684 declarator
24689 }
24691 /* Look for attributes that apply to the ivar. */
24693 /* Remember which attributes are prefix attributes and
24694 which are not. */
24696 /* Combine the attributes. */
24700 /* Create the bitfield declaration. */
24702 width,
24703 attributes);
24704 else
24709 /* Add the instance variable. */
24713 /* Reset PREFIX_ATTRIBUTES. */
24722 {
24725 }
24727 }
24731 }
24736 /* Do not consume the RID_AT_END, so it will be read again as terminating
24737 the @interface of @implementation. */
24741 /* For historical reasons, we accept an optional semicolon. */
24744 }
24746 /* Parse an Objective-C protocol declaration. */
24748 static void
24750 {
24756 {
24761 }
24763 /* See if we have a forward declaration or a definition. */
24766 /* Try a forward declaration first. */
24768 {
24770 {
24771 tree id;
24781 else
24783 }
24785 }
24787 /* Ok, we got a full-fledged definition (or at least should). */
24788 else
24789 {
24794 }
24795 }
24797 /* Parse an Objective-C superclass or category. */
24799 static void
24804 {
24810 {
24813 }
24815 {
24818 /* If there is no category name, and this is an @interface, we
24819 have a class extension. */
24821 {
24824 }
24825 else
24829 }
24830 }
24832 /* Parse an Objective-C class interface. */
24834 static void
24836 {
24843 {
24844 /* It's hard to recover because even if valid @interface stuff
24845 is to follow, we can't compile it (or validate it) if we
24846 don't even know which class it refers to. Let's assume this
24847 was a stray '@interface' token in the stream and skip it.
24848 */
24850 }
24855 /* We have either a class or a category on our hands. */
24858 else
24859 {
24861 /* Handle instance variable declarations, if any. */
24864 }
24867 }
24869 /* Parse an Objective-C class implementation. */
24871 static void
24873 {
24880 {
24881 /* It's hard to recover because even if valid @implementation
24882 stuff is to follow, we can't compile it (or validate it) if
24883 we don't even know which class it refers to. Let's assume
24884 this was a stray '@implementation' token in the stream and
24885 skip it.
24886 */
24888 }
24892 /* We have either a class or a category on our hands. */
24895 else
24896 {
24898 /* Handle instance variable declarations, if any. */
24901 }
24904 }
24906 /* Consume the @end token and finish off the implementation. */
24908 static void
24910 {
24913 }
24915 /* Parse an Objective-C declaration. */
24917 static void
24919 {
24920 /* Try to figure out what kind of declaration is present. */
24925 {
24941 }
24944 {
24967 }
24968 }
24970 /* Parse an Objective-C try-catch-finally statement.
24972 objc-try-catch-finally-stmt:
24973 @try compound-statement objc-catch-clause-seq [opt]
24974 objc-finally-clause [opt]
24976 objc-catch-clause-seq:
24977 objc-catch-clause objc-catch-clause-seq [opt]
24979 objc-catch-clause:
24980 @catch ( objc-exception-declaration ) compound-statement
24982 objc-finally-clause:
24983 @finally compound-statement
24985 objc-exception-declaration:
24986 parameter-declaration
24987 '...'
24989 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24991 Returns NULL_TREE.
24993 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24994 for C. Keep them in sync. */
24996 static tree
24998 {
24999 location_t location;
25000 tree stmt;
25005 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
25006 node, lest it get absorbed into the surrounding block. */
25012 {
25021 {
25022 /* We have "@catch (...)" (where the '...' are literally
25023 what is in the code). Skip the '...'.
25024 parameter_declaration is set to NULL_TREE, and
25025 objc_being_catch_clauses() knows that that means
25026 '...'. */
25029 }
25030 else
25031 {
25032 /* We have "@catch (NSException *exception)" or something
25033 like that. Parse the parameter declaration. */
25037 else
25042 }
25045 else
25046 {
25047 /* If there was no open parenthesis, we are recovering from
25048 an error, and we are trying to figure out what mistake
25049 the user has made. */
25051 /* If there is an immediate closing parenthesis, the user
25052 probably forgot the opening one (ie, they typed "@catch
25053 NSException *e)". Parse the closing parenthesis and keep
25054 going. */
25058 /* If these is no immediate closing parenthesis, the user
25059 probably doesn't know that parenthesis are required at
25060 all (ie, they typed "@catch NSException *e"). So, just
25061 forget about the closing parenthesis and keep going. */
25062 }
25066 }
25068 {
25071 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
25072 node, lest it get absorbed into the surrounding block. */
25076 }
25079 }
25081 /* Parse an Objective-C synchronized statement.
25083 objc-synchronized-stmt:
25084 @synchronized ( expression ) compound-statement
25086 Returns NULL_TREE. */
25088 static tree
25090 {
25091 location_t location;
25102 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
25103 node, lest it get absorbed into the surrounding block. */
25108 }
25110 /* Parse an Objective-C throw statement.
25112 objc-throw-stmt:
25113 @throw assignment-expression [opt] ;
25115 Returns a constructed '@throw' statement. */
25117 static tree
25119 {
25131 }
25133 /* Parse an Objective-C statement. */
25135 static tree
25137 {
25138 /* Try to figure out what kind of declaration is present. */
25142 {
25153 }
25156 }
25158 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
25159 look ahead to see if an objc keyword follows the attributes. This
25160 is to detect the use of prefix attributes on ObjC @interface and
25161 @protocol. */
25163 static bool
25165 {
25170 {
25173 }
25176 }
25178 /* This routine is a minimal replacement for
25179 c_parser_struct_declaration () used when parsing the list of
25180 types/names or ObjC++ properties. For example, when parsing the
25181 code
25183 @property (readonly) int a, b, c;
25185 this function is responsible for parsing "int a, int b, int c" and
25186 returning the declarations as CHAIN of DECLs.
25188 TODO: Share this code with cp_parser_objc_class_ivars. It's very
25189 similar parsing. */
25190 static tree
25192 {
25194 cp_decl_specifier_seq declspecs;
25196 tree prefix_attributes;
25199 CP_PARSER_FLAGS_NONE,
25206 /* auto, register, static, extern, mutable. */
25208 {
25211 }
25213 /* thread_local. */
25215 {
25218 }
25220 /* typedef. */
25222 {
25225 }
25230 /* Keep going until we hit the `;' at the end of the declaration. */
25232 {
25237 /* Parse the declarator. */
25241 /* Look for attributes that apply to the ivar. */
25243 /* Remember which attributes are prefix attributes and
25244 which are not. */
25246 /* Combine the attributes. */
25256 /* Reset PREFIX_ATTRIBUTES. */
25267 {
25270 }
25271 else
25273 }
25275 }
25277 /* Parse an Objective-C @property declaration. The syntax is:
25279 objc-property-declaration:
25280 '@property' objc-property-attributes[opt] struct-declaration ;
25282 objc-property-attributes:
25283 '(' objc-property-attribute-list ')'
25285 objc-property-attribute-list:
25286 objc-property-attribute
25287 objc-property-attribute-list, objc-property-attribute
25289 objc-property-attribute
25290 'getter' = identifier
25291 'setter' = identifier
25292 'readonly'
25293 'readwrite'
25294 'assign'
25295 'retain'
25296 'copy'
25297 'nonatomic'
25299 For example:
25300 @property NSString *name;
25301 @property (readonly) id object;
25302 @property (retain, nonatomic, getter=getTheName) id name;
25303 @property int a, b, c;
25305 PS: This function is identical to
25306 c_parser_objc_at_property_declaration for C. Keep them in sync. */
25307 static void
25309 {
25310 /* The following variables hold the attributes of the properties as
25311 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
25312 seen. When we see an attribute, we set them to 'true' (if they
25313 are boolean properties) or to the identifier (if they have an
25314 argument, ie, for getter and setter). Note that here we only
25315 parse the list of attributes, check the syntax and accumulate the
25316 attributes that we find. objc_add_property_declaration() will
25317 then process the information. */
25327 /* 'properties' is the list of properties that we read. Usually a
25328 single one, but maybe more (eg, in "@property int a, b, c;" there
25329 are three). */
25330 tree properties;
25331 location_t loc;
25337 /* Parse the optional attribute list... */
25339 {
25340 /* Eat the '('. */
25344 {
25350 {
25353 }
25357 {
25368 {
25372 else
25377 }
25380 {
25384 }
25386 {
25388 {
25391 }
25392 else
25396 else
25398 }
25399 else
25400 {
25402 {
25405 }
25406 else
25408 }
25414 }
25421 else
25423 }
25425 /* FIXME: "@property (setter, assign);" will generate a spurious
25426 "error: expected ‘)’ before ‘,’ token". This is because
25427 cp_parser_require, unlike the C counterpart, will produce an
25428 error even if we are in error recovery. */
25430 {
25435 }
25436 }
25438 /* ... and the property declaration(s). */
25442 {
25444 /* If the next token is now a `;', consume it. */
25448 }
25452 else
25453 {
25454 /* Comma-separated properties are chained together in
25455 reverse order; add them one by one. */
25464 }
25467 }
25469 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
25471 objc-synthesize-declaration:
25472 @synthesize objc-synthesize-identifier-list ;
25474 objc-synthesize-identifier-list:
25475 objc-synthesize-identifier
25476 objc-synthesize-identifier-list, objc-synthesize-identifier
25478 objc-synthesize-identifier
25479 identifier
25480 identifier = identifier
25482 For example:
25483 @synthesize MyProperty;
25484 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
25486 PS: This function is identical to c_parser_objc_at_synthesize_declaration
25487 for C. Keep them in sync.
25488 */
25489 static void
25491 {
25493 location_t loc;
25498 {
25502 {
25505 }
25507 {
25511 {
25514 }
25515 }
25516 else
25521 else
25523 }
25526 }
25528 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
25530 objc-dynamic-declaration:
25531 @dynamic identifier-list ;
25533 For example:
25534 @dynamic MyProperty;
25535 @dynamic MyProperty, AnotherProperty;
25537 PS: This function is identical to c_parser_objc_at_dynamic_declaration
25538 for C. Keep them in sync.
25539 */
25540 static void
25542 {
25544 location_t loc;
25549 {
25550 tree property;
25553 {
25556 }
25560 else
25562 }
25565 }
25567 \f
25568 /* OpenMP 2.5 parsing routines. */
25570 /* Returns name of the next clause.
25571 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
25572 the token is not consumed. Otherwise appropriate pragma_omp_clause is
25573 returned and the token is consumed. */
25575 static pragma_omp_clause
25577 {
25587 {
25592 {
25639 }
25640 }
25646 }
25648 /* Validate that a clause of the given type does not already exist. */
25650 static void
25653 {
25654 tree c;
25658 {
25661 }
25662 }
25664 /* OpenMP 2.5:
25665 variable-list:
25666 identifier
25667 variable-list , identifier
25669 In addition, we match a closing parenthesis. An opening parenthesis
25670 will have been consumed by the caller.
25672 If KIND is nonzero, create the appropriate node and install the decl
25673 in OMP_CLAUSE_DECL and add the node to the head of the list.
25675 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25676 return the list created. */
25678 static tree
25680 tree list)
25681 {
25684 {
25701 {
25706 }
25707 else
25710 get_comma:
25714 }
25717 {
25720 /* Try to resync to an unnested comma. Copied from
25721 cp_parser_parenthesized_expression_list. */
25722 skip_comma:
25729 }
25732 }
25734 /* Similarly, but expect leading and trailing parenthesis. This is a very
25735 common case for omp clauses. */
25737 static tree
25739 {
25743 }
25745 /* OpenMP 3.0:
25746 collapse ( constant-expression ) */
25748 static tree
25750 {
25752 location_t loc;
25753 HOST_WIDE_INT n;
25773 {
25776 }
25784 }
25786 /* OpenMP 2.5:
25787 default ( shared | none ) */
25789 static tree
25791 {
25793 tree c;
25798 {
25803 {
25818 }
25821 }
25822 else
25823 {
25824 invalid_kind:
25826 }
25842 }
25844 /* OpenMP 3.1:
25845 final ( expression ) */
25847 static tree
25849 {
25870 }
25872 /* OpenMP 2.5:
25873 if ( expression ) */
25875 static tree
25877 {
25898 }
25900 /* OpenMP 3.1:
25901 mergeable */
25903 static tree
25906 {
25907 tree c;
25910 location);
25915 }
25917 /* OpenMP 2.5:
25918 nowait */
25920 static tree
25923 {
25924 tree c;
25931 }
25933 /* OpenMP 2.5:
25934 num_threads ( expression ) */
25936 static tree
25938 location_t location)
25939 {
25961 }
25963 /* OpenMP 2.5:
25964 ordered */
25966 static tree
25969 {
25970 tree c;
25978 }
25980 /* OpenMP 2.5:
25981 reduction ( reduction-operator : variable-list )
25983 reduction-operator:
25984 One of: + * - & ^ | && ||
25986 OpenMP 3.1:
25988 reduction-operator:
25989 One of: + * - & ^ | && || min max */
25991 static tree
25993 {
26001 {
26027 {
26032 {
26035 }
26037 {
26040 }
26041 }
26042 /* FALLTHROUGH */
26046 resync_fail:
26051 }
26062 }
26064 /* OpenMP 2.5:
26065 schedule ( schedule-kind )
26066 schedule ( schedule-kind , expression )
26068 schedule-kind:
26069 static | dynamic | guided | runtime | auto */
26071 static tree
26073 {
26082 {
26087 {
26108 }
26109 }
26114 else
26119 {
26134 else
26139 }
26147 invalid_kind:
26149 resync_fail:
26154 }
26156 /* OpenMP 3.0:
26157 untied */
26159 static tree
26162 {
26163 tree c;
26170 }
26172 /* Parse all OpenMP clauses. The set clauses allowed by the directive
26173 is a bitmask in MASK. Return the list of clauses found; the result
26174 of clause default goes in *pdefault. */
26176 static tree
26179 {
26185 {
26186 pragma_omp_clause c_kind;
26198 {
26210 clauses);
26224 clauses);
26233 clauses);
26257 clauses);
26271 clauses);
26282 }
26285 {
26286 /* Remove the invalid clause(s) from the list to avoid
26287 confusing the rest of the compiler. */
26290 }
26291 }
26292 saw_error:
26295 }
26297 /* OpenMP 2.5:
26298 structured-block:
26299 statement
26301 In practice, we're also interested in adding the statement to an
26302 outer node. So it is convenient if we work around the fact that
26303 cp_parser_statement calls add_stmt. */
26305 static unsigned
26307 {
26310 /* Only move the values to IN_OMP_BLOCK if they weren't false.
26311 This preserves the "not within loop or switch" style error messages
26312 for nonsense cases like
26313 void foo() {
26314 #pragma omp single
26315 break;
26316 }
26317 */
26322 }
26324 static void
26326 {
26328 }
26330 static tree
26332 {
26340 }
26342 /* OpenMP 2.5:
26343 # pragma omp atomic new-line
26344 expression-stmt
26346 expression-stmt:
26347 x binop= expr | x++ | ++x | x-- | --x
26348 binop:
26349 +, *, -, /, &, ^, |, <<, >>
26351 where x is an lvalue expression with scalar type.
26353 OpenMP 3.1:
26354 # pragma omp atomic new-line
26355 update-stmt
26357 # pragma omp atomic read new-line
26358 read-stmt
26360 # pragma omp atomic write new-line
26361 write-stmt
26363 # pragma omp atomic update new-line
26364 update-stmt
26366 # pragma omp atomic capture new-line
26367 capture-stmt
26369 # pragma omp atomic capture new-line
26370 capture-block
26372 read-stmt:
26373 v = x
26374 write-stmt:
26375 x = expr
26376 update-stmt:
26377 expression-stmt | x = x binop expr
26378 capture-stmt:
26379 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
26380 capture-block:
26381 { v = x; update-stmt; } | { update-stmt; v = x; }
26383 where x and v are lvalue expressions with scalar type. */
26385 static void
26387 {
26394 {
26406 else
26410 }
26414 {
26425 else
26431 {
26432 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
26433 opcode. */
26438 }
26442 {
26445 }
26446 else
26447 {
26454 }
26457 }
26459 restart:
26464 {
26471 /* FALLTHROUGH */
26481 /* FALLTHROUGH */
26496 /* Undo effects of boolean_increment for post {in,de}crement. */
26498 /* FALLTHRU */
26502 {
26503 /* Undo effects of boolean_increment. */
26505 {
26506 /* This is pre or post increment. */
26511 && !structured_block
26515 }
26516 }
26517 /* FALLTHRU */
26520 {
26550 {
26560 {
26563 {
26571 }
26606 }
26617 }
26618 /* FALLTHROUGH */
26623 }
26630 }
26631 stmt_done:
26633 {
26646 }
26648 {
26651 }
26652 done:
26658 saw_error:
26661 {
26665 {
26669 }
26670 }
26671 }
26674 /* OpenMP 2.5:
26675 # pragma omp barrier new-line */
26677 static void
26679 {
26682 }
26684 /* OpenMP 2.5:
26685 # pragma omp critical [(name)] new-line
26686 structured-block */
26688 static tree
26690 {
26694 {
26706 }
26711 }
26713 /* OpenMP 2.5:
26714 # pragma omp flush flush-vars[opt] new-line
26716 flush-vars:
26717 ( variable-list ) */
26719 static void
26721 {
26727 }
26729 /* Helper function, to parse omp for increment expression. */
26731 static tree
26733 {
26738 {
26741 }
26744 {
26752 }
26754 /* If decl is an iterator, preserve LHS and RHS of the relational
26755 expr until finish_omp_for. */
26765 }
26767 /* Helper function, to parse omp for increment expression. */
26769 static tree
26771 {
26775 cp_id_kind idk;
26779 {
26787 }
26795 {
26800 }
26807 {
26811 }
26823 do
26824 {
26831 {
26833 {
26836 else
26838 tf_warning_or_error);
26839 }
26840 else
26843 }
26844 }
26848 {
26852 }
26853 else
26857 }
26859 /* Parse the restricted form of the for statement allowed by OpenMP. */
26861 static tree
26863 {
26867 location_t loc_first;
26886 {
26889 location_t loc;
26892 {
26895 }
26904 {
26905 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26907 init-expr:
26908 var = lb
26909 integer-type var = lb
26910 random-access-iterator-type var = lb
26911 pointer-type var = lb
26912 */
26913 cp_decl_specifier_seq type_specifiers;
26915 /* First, try to parse as an initialized declaration. See
26916 cp_parser_condition, from whence the bulk of this is copied. */
26923 {
26924 /* If parsing a type specifier seq succeeded, then this
26925 MUST be a initialized declaration. */
26930 CP_PARSER_DECLARATOR_NAMED,
26940 else
26941 {
26951 {
26953 CPP_OPEN_PAREN))
26956 else
26957 /* Trigger an error. */
26962 }
26966 {
26974 {
26977 auto_node);
26982 }
26985 asm_specification,
26986 LOOKUP_ONLYCONVERTING);
26988 {
26991 }
26992 else
26995 }
26996 else
26997 {
26998 /* Consume '='. */
27002 non_class:
27005 else
27008 asm_specification,
27009 LOOKUP_ONLYCONVERTING);
27010 }
27014 }
27015 }
27016 else
27017 {
27018 cp_id_kind idk;
27019 /* If parsing a type specifier sequence failed, then
27020 this MUST be a simple expression. */
27025 && decl
27028 {
27029 tree rhs;
27036 rhs,
27037 tf_warning_or_error));
27039 }
27040 else
27041 {
27046 {
27050 }
27051 }
27052 }
27053 }
27056 {
27059 {
27065 }
27066 else
27068 }
27073 {
27078 {
27082 }
27085 {
27086 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
27087 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
27096 }
27097 else
27098 {
27103 }
27104 }
27107 {
27108 tree c;
27110 {
27119 decl);
27123 decl);
27124 }
27126 {
27131 {
27134 }
27135 }
27136 }
27145 {
27146 /* If decl is an iterator, preserve the operator on decl
27147 until finish_omp_for. */
27149 && ((processing_template_decl
27153 else
27157 }
27172 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
27173 in between the collapsed for loops to be still considered perfectly
27174 nested. Hopefully the final version clarifies this.
27175 For now handle (multiple) {'s and empty statements. */
27177 do
27178 {
27182 {
27184 bracecount++;
27185 }
27189 else
27190 {
27197 }
27198 }
27202 {
27205 }
27206 }
27208 /* Note that we saved the original contents of this flag when we entered
27209 the structured block, and so we don't need to re-save it here. */
27212 /* Note that the grammar doesn't call for a structured block here,
27213 though the loop as a whole is a structured block. */
27220 else
27225 {
27227 {
27229 nbraces--;
27230 }
27233 else
27234 {
27236 {
27239 }
27244 }
27245 }
27252 }
27254 /* OpenMP 2.5:
27255 #pragma omp for for-clause[optseq] new-line
27256 for-loop */
27258 #define OMP_FOR_CLAUSE_MASK \
27259 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27260 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27261 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27262 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27263 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
27264 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
27265 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
27266 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
27268 static tree
27270 {
27286 }
27288 /* OpenMP 2.5:
27289 # pragma omp master new-line
27290 structured-block */
27292 static tree
27294 {
27298 }
27300 /* OpenMP 2.5:
27301 # pragma omp ordered new-line
27302 structured-block */
27304 static tree
27306 {
27310 }
27312 /* OpenMP 2.5:
27314 section-scope:
27315 { section-sequence }
27317 section-sequence:
27318 section-directive[opt] structured-block
27319 section-sequence section-directive structured-block */
27321 static tree
27323 {
27334 {
27341 {
27351 }
27357 }
27360 {
27368 {
27372 }
27374 {
27377 }
27382 }
27393 }
27395 /* OpenMP 2.5:
27396 # pragma omp sections sections-clause[optseq] newline
27397 sections-scope */
27399 #define OMP_SECTIONS_CLAUSE_MASK \
27400 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27401 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27402 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27403 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27404 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27406 static tree
27408 {
27419 }
27421 /* OpenMP 2.5:
27422 # pragma parallel parallel-clause new-line
27423 # pragma parallel for parallel-for-clause new-line
27424 # pragma parallel sections parallel-sections-clause new-line */
27426 #define OMP_PARALLEL_CLAUSE_MASK \
27427 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27428 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27429 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27430 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27431 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27432 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
27433 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27434 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
27436 static tree
27438 {
27447 {
27453 }
27455 {
27459 {
27465 }
27466 }
27473 {
27493 }
27500 }
27502 /* OpenMP 2.5:
27503 # pragma omp single single-clause[optseq] new-line
27504 structured-block */
27506 #define OMP_SINGLE_CLAUSE_MASK \
27507 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27508 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27509 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
27510 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27512 static tree
27514 {
27524 }
27526 /* OpenMP 3.0:
27527 # pragma omp task task-clause[optseq] new-line
27528 structured-block */
27530 #define OMP_TASK_CLAUSE_MASK \
27531 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27532 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
27533 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27534 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27535 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27536 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27537 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
27538 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
27540 static tree
27542 {
27553 }
27555 /* OpenMP 3.0:
27556 # pragma omp taskwait new-line */
27558 static void
27560 {
27563 }
27565 /* OpenMP 3.1:
27566 # pragma omp taskyield new-line */
27568 static void
27570 {
27573 }
27575 /* OpenMP 2.5:
27576 # pragma omp threadprivate (variable-list) */
27578 static void
27580 {
27581 tree vars;
27587 }
27589 /* Main entry point to OpenMP statement pragmas. */
27591 static void
27593 {
27594 tree stmt;
27597 {
27627 }
27631 }
27632 \f
27633 /* Transactional Memory parsing routines. */
27635 /* Parse a transaction attribute.
27637 txn-attribute:
27638 attribute
27639 [ [ identifier ] ]
27641 ??? Simplify this when C++0x bracket attributes are
27642 implemented properly. */
27644 static tree
27646 {
27661 {
27665 /* For keywords, use the canonical spelling,
27666 not the parsed identifier. */
27670 }
27671 else
27675 error1:
27678 }
27680 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27682 transaction-statement:
27683 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27684 compound-statement
27685 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27686 */
27688 static tree
27690 {
27705 else
27706 {
27710 }
27712 /* Parse a noexcept specification. */
27715 /* Keep track if we're in the lexical scope of an outer transaction. */
27727 }
27729 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27731 transaction-expression:
27732 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27733 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27734 */
27736 static tree
27738 {
27763 /* Set this early. This might mean that we allow transaction_cancel in
27764 an expression that we find out later actually has to be a constexpr.
27765 However, we expect that cxx_constant_value will be able to deal with
27766 this; also, if the noexcept has no constexpr, then what we parse next
27767 really is a transaction's body. */
27770 /* Parse a noexcept specification. */
27776 {
27783 }
27784 else
27785 {
27786 /* The only expression that is available got parsed for the noexcept
27787 already. noexcept is true then. */
27790 }
27799 }
27801 /* Parse a function-transaction-block.
27803 function-transaction-block:
27804 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27805 function-body
27806 __transaction_atomic txn-attribute[opt] function-try-block
27807 __transaction_relaxed ctor-initializer[opt] function-body
27808 __transaction_relaxed function-try-block
27809 */
27811 static bool
27813 {
27829 else
27830 {
27834 }
27842 else
27843 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
27851 }
27853 /* Parse a __transaction_cancel statement.
27855 cancel-statement:
27856 __transaction_cancel txn-attribute[opt] ;
27857 __transaction_cancel txn-attribute[opt] throw-expression ;
27859 ??? Cancel and throw is not yet implemented. */
27861 static tree
27863 {
27869 RT_TRANSACTION_CANCEL);
27876 /* ??? Parse cancel-and-throw here. */
27881 {
27885 }
27887 {
27891 }
27893 {
27896 {
27902 }
27903 }
27905 {
27909 }
27916 }
27917 \f
27918 /* The parser. */
27922 \f
27923 /* Special handling for the first token or line in the file. The first
27924 thing in the file might be #pragma GCC pch_preprocess, which loads a
27925 PCH file, which is a GC collection point. So we need to handle this
27926 first pragma without benefit of an existing lexer structure.
27928 Always returns one token to the caller in *FIRST_TOKEN. This is
27929 either the true first token of the file, or the first token after
27930 the initial pragma. */
27932 static void
27934 {
27943 {
27950 }
27951 else
27954 /* Skip to the end of the pragma. */
27958 /* Now actually load the PCH file. */
27962 /* Read one more token to return to our caller. We have to do this
27963 after reading the PCH file in, since its pointers have to be
27964 live. */
27966 }
27968 /* Normal parsing of a pragma token. Here we can (and must) use the
27969 regular lexer. */
27971 static bool
27973 {
27983 {
27991 {
28001 }
28006 {
28016 }
28021 {
28027 "%<#pragma omp taskwait%> may only be "
28032 }
28037 {
28043 "%<#pragma omp taskyield%> may only be "
28048 }
28071 "%<#pragma omp section%> may only be used in "
28080 bad_stmt:
28083 }
28087 }
28089 /* The interface the pragma parsers have to the lexer. */
28091 enum cpp_ttype
28093 {
28106 else
28107 {
28111 }
28114 }
28116 \f
28117 /* External interface. */
28119 /* Parse one entire translation unit. */
28121 void
28123 {
28127 {
28130 }
28138 }