| blob | 190b8d94113bd6ae3e9450994867d1abc66e24f0 |
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 {
3536 }
3537 }
3538 else
3539 /* cpp_interpret_string has issued an error. */
3546 }
3548 /* Look up a literal operator with the name and the exact arguments. */
3550 static tree
3552 {
3559 {
3566 {
3569 {
3579 }
3582 /* May be this should be sufficient_parms_p instead,
3583 depending on how exactly should user-defined literals
3584 work in presence of default arguments on the literal
3585 operator parameters. */
3588 }
3589 }
3592 }
3594 /* Parse a user-defined char constant. Returns a call to a user-defined
3595 literal operator taking the character as an argument. */
3597 static tree
3599 {
3607 /* Build up a call to the user-defined operator */
3608 /* Lookup the name we got back from the id-expression. */
3613 {
3618 }
3627 }
3629 /* A subroutine of cp_parser_userdef_numeric_literal to
3630 create a char... template parameter pack from a string node. */
3632 static tree
3634 {
3635 tree charvec;
3641 /* Fill in CHARVEC with all of the parameters. */
3646 /* Build the argument packs. */
3653 }
3655 /* Parse a user-defined numeric constant. returns a call to a user-defined
3656 literal operator. */
3658 static tree
3660 {
3671 /* Look for a literal operator taking the exact type of numeric argument
3672 as the literal value. */
3677 {
3680 {
3684 long_long_unsigned_type_node);
3685 else
3686 {
3690 long_double_type_node);
3694 }
3697 }
3698 }
3701 /* If the numeric argument didn't work, look for a raw literal
3702 operator taking a const char* argument consisting of the number
3703 in string format. */
3708 {
3711 {
3714 }
3715 }
3718 /* If the raw literal didn't work, look for a non-type template
3719 function with parameter pack char.... Call the function with
3720 template parameter characters representing the number. */
3724 {
3729 {
3732 }
3733 }
3738 }
3740 /* Parse a user-defined string constant. Returns a call to a user-defined
3741 literal operator taking a character pointer and the length of the string
3742 as arguments. */
3744 static tree
3746 {
3755 /* Build up a call to the user-defined operator */
3756 /* Lookup the name we got back from the id-expression. */
3762 {
3766 }
3775 }
3778 /* Basic concepts [gram.basic] */
3780 /* Parse a translation-unit.
3782 translation-unit:
3783 declaration-seq [opt]
3785 Returns TRUE if all went well. */
3787 static bool
3789 {
3790 /* The address of the first non-permanent object on the declarator
3791 obstack. */
3796 /* Create the declarator obstack, if necessary. */
3798 {
3800 /* Create the error declarator. */
3802 /* Create the empty parameter list. */
3804 /* Remember where the base of the declarator obstack lies. */
3806 }
3810 /* If there are no tokens left then all went well. */
3812 {
3813 /* Get rid of the token array; we don't need it any more. */
3817 /* This file might have been a context that's implicitly extern
3818 "C". If so, pop the lang context. (Only relevant for PCH.) */
3820 {
3823 }
3825 /* Finish up. */
3829 }
3830 else
3831 {
3834 }
3836 /* Make sure the declarator obstack was fully cleaned up. */
3840 /* All went well. */
3842 }
3844 /* Expressions [gram.expr] */
3846 /* Parse a primary-expression.
3848 primary-expression:
3849 literal
3850 this
3851 ( expression )
3852 id-expression
3854 GNU Extensions:
3856 primary-expression:
3857 ( compound-statement )
3858 __builtin_va_arg ( assignment-expression , type-id )
3859 __builtin_offsetof ( type-id , offsetof-expression )
3861 C++ Extensions:
3862 __has_nothrow_assign ( type-id )
3863 __has_nothrow_constructor ( type-id )
3864 __has_nothrow_copy ( type-id )
3865 __has_trivial_assign ( type-id )
3866 __has_trivial_constructor ( type-id )
3867 __has_trivial_copy ( type-id )
3868 __has_trivial_destructor ( type-id )
3869 __has_virtual_destructor ( type-id )
3870 __is_abstract ( type-id )
3871 __is_base_of ( type-id , type-id )
3872 __is_class ( type-id )
3873 __is_convertible_to ( type-id , type-id )
3874 __is_empty ( type-id )
3875 __is_enum ( type-id )
3876 __is_final ( type-id )
3877 __is_literal_type ( type-id )
3878 __is_pod ( type-id )
3879 __is_polymorphic ( type-id )
3880 __is_std_layout ( type-id )
3881 __is_trivial ( type-id )
3882 __is_union ( type-id )
3884 Objective-C++ Extension:
3886 primary-expression:
3887 objc-expression
3889 literal:
3890 __null
3892 ADDRESS_P is true iff this expression was immediately preceded by
3893 "&" and therefore might denote a pointer-to-member. CAST_P is true
3894 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3895 true iff this expression is a template argument.
3897 Returns a representation of the expression. Upon return, *IDK
3898 indicates what kind of id-expression (if any) was present. */
3900 static tree
3906 {
3909 /* Assume the primary expression is not an id-expression. */
3912 /* Peek at the next token. */
3915 {
3916 /* literal:
3917 integer-literal
3918 character-literal
3919 floating-literal
3920 string-literal
3921 boolean-literal
3922 pointer-literal
3923 user-defined-literal */
3933 {
3937 }
3938 /* Floating-point literals are only allowed in an integral
3939 constant expression if they are cast to an integral or
3940 enumeration type. */
3944 {
3945 /* CAST_P will be set even in invalid code like "int(2.7 +
3946 ...)". Therefore, we have to check that the next token
3947 is sure to end the cast. */
3949 {
3954 enumerator-definition. */
3956 /* The curly brace at the end of an enum-specifier. */
3958 /* The end of a statement. */
3960 /* The end of the cast-expression. */
3962 /* The end of an array bound. */
3964 /* The closing ">" in a template-argument-list. */
3967 /* C++0x only: A ">>" treated like two ">" tokens,
3968 in a template-argument-list. */
3973 }
3975 /* If we are within a cast, then the constraint that the
3976 cast is to an integral or enumeration type will be
3977 checked at that point. If we are not within a cast, then
3978 this code is invalid. */
3981 }
4000 /* ??? Should wide strings be allowed when parser->translate_strings_p
4001 is false (i.e. in attributes)? If not, we can kill the third
4002 argument to cp_parser_string_literal. */
4008 {
4009 tree expr;
4012 /* Consume the `('. */
4014 /* Within a parenthesized expression, a `>' token is always
4015 the greater-than operator. */
4016 saved_greater_than_is_operator_p
4019 /* If we see `( { ' then we are looking at the beginning of
4020 a GNU statement-expression. */
4023 {
4024 /* Statement-expressions are not allowed by the standard. */
4028 /* And they're not allowed outside of a function-body; you
4029 cannot, for example, write:
4031 int i = ({ int j = 3; j + 1; });
4033 at class or namespace scope. */
4036 {
4038 "statement-expressions are not allowed outside "
4042 }
4043 else
4044 {
4045 /* Start the statement-expression. */
4047 /* Parse the compound-statement. */
4049 /* Finish up. */
4051 }
4052 }
4053 else
4054 {
4055 /* Parse the parenthesized expression. */
4057 /* Let the front end know that this expression was
4058 enclosed in parentheses. This matters in case, for
4059 example, the expression is of the form `A::B', since
4060 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4061 not. */
4063 /* DR 705: Wrapping an unqualified name in parentheses
4064 suppresses arg-dependent lookup. We want to pass back
4065 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4066 (c++/37862), but none of the others. */
4069 }
4070 /* The `>' token might be the end of a template-id or
4071 template-parameter-list now. */
4072 parser->greater_than_is_operator_p
4074 /* Consume the `)'. */
4079 }
4083 /* We have an Objective-C++ message. */
4085 {
4087 /* Don't warn about a failed tentative parse. */
4092 }
4096 /* We have an Objective-C++ string literal. */
4103 {
4104 /* These two are the boolean literals. */
4112 /* The `__null' literal. */
4117 /* The `nullptr' literal. */
4122 /* Recognize the `this' keyword. */
4126 {
4130 }
4131 /* Pointers cannot appear in constant-expressions. */
4136 /* The `operator' keyword can be the beginning of an
4137 id-expression. */
4144 {
4145 non_integral_constant name;
4147 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4148 __func__ are the names of variables -- but they are
4149 treated specially. Therefore, they are handled here,
4150 rather than relying on the generic id-expression logic
4151 below. Grammatically, these names are id-expressions.
4153 Consume the token. */
4157 {
4169 }
4174 /* Look up the name. */
4176 }
4179 {
4180 tree expression;
4181 tree type;
4182 source_location type_location;
4184 /* The `__builtin_va_arg' construct is used to handle
4185 `va_arg'. Consume the `__builtin_va_arg' token. */
4187 /* Look for the opening `('. */
4189 /* Now, parse the assignment-expression. */
4192 /* Look for the `,'. */
4195 /* Parse the type-id. */
4197 /* Look for the closing `)'. */
4199 /* Using `va_arg' in a constant-expression is not
4200 allowed. */
4202 NIC_VA_ARG))
4205 }
4233 /* Objective-C++ expressions. */
4243 {
4248 }
4252 }
4254 /* An id-expression can start with either an identifier, a
4255 `::' as the beginning of a qualified-id, or the "operator"
4256 keyword. */
4261 {
4262 tree id_expression;
4263 tree decl;
4269 id_expression:
4270 /* Parse the id-expression. */
4271 id_expression
4288 /* If we have a template-id, then no further lookup is
4289 required. If the template-id was for a template-class, we
4290 will sometimes have a TYPE_DECL at this point. */
4294 /* Look up the name. */
4295 else
4296 {
4297 tree ambiguous_decls;
4299 /* If we already know that this lookup is ambiguous, then
4300 we've already issued an error message; there's no reason
4301 to check again. */
4304 {
4307 }
4310 none_type,
4311 template_p,
4316 /* If the lookup was ambiguous, an error will already have
4317 been issued. */
4321 /* In Objective-C++, we may have an Objective-C 2.0
4322 dot-syntax for classes here. */
4327 {
4328 tree component;
4335 }
4337 /* In Objective-C++, an instance variable (ivar) may be preferred
4338 to whatever cp_parser_lookup_name() found. */
4341 /* If name lookup gives us a SCOPE_REF, then the
4342 qualifying scope was dependent. */
4344 {
4345 /* At this point, we do not know if DECL is a valid
4346 integral constant expression. We assume that it is
4347 in fact such an expression, so that code like:
4349 template <int N> struct A {
4350 int a[B<N>::i];
4351 };
4353 is accepted. At template-instantiation time, we
4354 will check that B<N>::i is actually a constant. */
4356 }
4357 /* Check to see if DECL is a local variable in a context
4358 where that is forbidden. */
4361 {
4362 /* It might be that we only found DECL because we are
4363 trying to be generous with pre-ISO scoping rules.
4364 For example, consider:
4366 int i;
4367 void g() {
4368 for (int i = 0; i < 10; ++i) {}
4369 extern void f(int j = i);
4370 }
4372 Here, name look up will originally find the out
4373 of scope `i'. We need to issue a warning message,
4374 but then use the global `i'. */
4377 {
4380 decl);
4382 }
4383 }
4384 }
4386 decl = (finish_id_expression
4388 idk,
4393 template_arg_p,
4399 }
4401 /* Anything else is an error. */
4405 }
4406 }
4408 /* Parse an id-expression.
4410 id-expression:
4411 unqualified-id
4412 qualified-id
4414 qualified-id:
4415 :: [opt] nested-name-specifier template [opt] unqualified-id
4416 :: identifier
4417 :: operator-function-id
4418 :: template-id
4420 Return a representation of the unqualified portion of the
4421 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4422 a `::' or nested-name-specifier.
4424 Often, if the id-expression was a qualified-id, the caller will
4425 want to make a SCOPE_REF to represent the qualified-id. This
4426 function does not do this in order to avoid wastefully creating
4427 SCOPE_REFs when they are not required.
4429 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4430 `template' keyword.
4432 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4433 uninstantiated templates.
4435 If *TEMPLATE_P is non-NULL, it is set to true iff the
4436 `template' keyword is used to explicitly indicate that the entity
4437 named is a template.
4439 If DECLARATOR_P is true, the id-expression is appearing as part of
4440 a declarator, rather than as part of an expression. */
4442 static tree
4449 {
4453 /* Assume the `template' keyword was not used. */
4457 /* Look for the optional `::' operator. */
4458 global_scope_p
4461 /* Look for the optional nested-name-specifier. */
4462 nested_name_specifier_p
4465 check_dependency_p,
4467 declarator_p)
4469 /* If there is a nested-name-specifier, then we are looking at
4470 the first qualified-id production. */
4472 {
4473 tree saved_scope;
4474 tree saved_object_scope;
4475 tree saved_qualifying_scope;
4476 tree unqualified_id;
4479 /* See if the next token is the `template' keyword. */
4483 /* Name lookup we do during the processing of the
4484 unqualified-id might obliterate SCOPE. */
4488 /* Process the final unqualified-id. */
4490 check_dependency_p,
4491 declarator_p,
4493 /* Restore the SAVED_SCOPE for our caller. */
4499 }
4500 /* Otherwise, if we are in global scope, then we are looking at one
4501 of the other qualified-id productions. */
4503 {
4505 tree id;
4507 /* Peek at the next token. */
4510 /* If it's an identifier, and the next token is not a "<", then
4511 we can avoid the template-id case. This is an optimization
4512 for this common case. */
4514 && !cp_parser_nth_token_starts_template_argument_list_p
4519 /* Try a template-id. */
4523 none_type,
4524 declarator_p);
4525 /* If that worked, we're done. */
4529 /* Peek at the next token. (Changes in the token buffer may
4530 have invalidated the pointer obtained above.) */
4534 {
4541 /* Fall through. */
4546 }
4547 }
4548 else
4551 declarator_p,
4552 optional_p);
4553 }
4555 /* Parse an unqualified-id.
4557 unqualified-id:
4558 identifier
4559 operator-function-id
4560 conversion-function-id
4561 ~ class-name
4562 template-id
4564 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4565 keyword, in a construct like `A::template ...'.
4567 Returns a representation of unqualified-id. For the `identifier'
4568 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4569 production a BIT_NOT_EXPR is returned; the operand of the
4570 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4571 other productions, see the documentation accompanying the
4572 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4573 names are looked up in uninstantiated templates. If DECLARATOR_P
4574 is true, the unqualified-id is appearing as part of a declarator,
4575 rather than as part of an expression. */
4577 static tree
4583 {
4586 /* Peek at the next token. */
4590 {
4592 {
4593 tree id;
4595 /* We don't know yet whether or not this will be a
4596 template-id. */
4598 /* Try a template-id. */
4600 check_dependency_p,
4601 none_type,
4602 declarator_p);
4603 /* If it worked, we're done. */
4606 /* Otherwise, it's an ordinary identifier. */
4608 }
4612 check_dependency_p,
4613 none_type,
4614 declarator_p);
4617 {
4618 tree type_decl;
4619 tree qualifying_scope;
4620 tree object_scope;
4621 tree scope;
4624 /* Consume the `~' token. */
4626 /* Parse the class-name. The standard, as written, seems to
4627 say that:
4629 template <typename T> struct S { ~S (); };
4630 template <typename T> S<T>::~S() {}
4632 is invalid, since `~' must be followed by a class-name, but
4633 `S<T>' is dependent, and so not known to be a class.
4634 That's not right; we need to look in uninstantiated
4635 templates. A further complication arises from:
4637 template <typename T> void f(T t) {
4638 t.T::~T();
4639 }
4641 Here, it is not possible to look up `T' in the scope of `T'
4642 itself. We must look in both the current scope, and the
4643 scope of the containing complete expression.
4645 Yet another issue is:
4647 struct S {
4648 int S;
4649 ~S();
4650 };
4652 S::~S() {}
4654 The standard does not seem to say that the `S' in `~S'
4655 should refer to the type `S' and not the data member
4656 `S::S'. */
4658 /* DR 244 says that we look up the name after the "~" in the
4659 same scope as we looked up the qualifying name. That idea
4660 isn't fully worked out; it's more complicated than that. */
4665 /* Check for invalid scopes. */
4667 {
4671 }
4673 {
4677 scope);
4682 }
4685 /* If the name is of the form "X::~X" it's OK even if X is a
4686 typedef. */
4695 {
4698 }
4700 /* If there was an explicit qualification (S::~T), first look
4701 in the scope given by the qualification (i.e., S).
4703 Note: in the calls to cp_parser_class_name below we pass
4704 typename_type so that lookup finds the injected-class-name
4705 rather than the constructor. */
4709 {
4714 typename_type,
4717 declarator_p);
4720 }
4721 /* In "N::S::~S", look in "N" as well. */
4723 {
4728 type_decl
4732 typename_type,
4735 declarator_p);
4738 }
4739 /* In "p->S::~T", look in the scope given by "*p" as well. */
4741 {
4746 type_decl
4750 typename_type,
4753 declarator_p);
4756 }
4757 /* Look in the surrounding context. */
4759 {
4765 type_decl
4769 typename_type,
4772 declarator_p);
4775 {
4776 /* We couldn't find a type with this name, so just accept
4777 it and check for a match at instantiation time. */
4782 }
4783 }
4784 /* If an error occurred, assume that the name of the
4785 destructor is the same as the name of the qualifying
4786 class. That allows us to keep parsing after running
4787 into ill-formed destructor names. */
4793 /* Check that destructor name and scope match. */
4795 {
4802 }
4804 /* [class.dtor]
4806 A typedef-name that names a class shall not be used as the
4807 identifier in the declarator for a destructor declaration. */
4814 type_decl);
4817 }
4821 {
4822 tree id;
4824 /* This could be a template-id, so we try that first. */
4826 /* Try a template-id. */
4829 none_type,
4830 declarator_p);
4831 /* If that worked, we're done. */
4834 /* We still don't know whether we're looking at an
4835 operator-function-id or a conversion-function-id. */
4837 /* Try an operator-function-id. */
4839 /* If that didn't work, try a conversion-function-id. */
4843 {
4844 /* 17.6.3.3.5 */
4849 }
4852 }
4853 /* Fall through. */
4860 }
4861 }
4863 /* Parse an (optional) nested-name-specifier.
4865 nested-name-specifier: [C++98]
4866 class-or-namespace-name :: nested-name-specifier [opt]
4867 class-or-namespace-name :: template nested-name-specifier [opt]
4869 nested-name-specifier: [C++0x]
4870 type-name ::
4871 namespace-name ::
4872 nested-name-specifier identifier ::
4873 nested-name-specifier template [opt] simple-template-id ::
4875 PARSER->SCOPE should be set appropriately before this function is
4876 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4877 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4878 in name lookups.
4880 Sets PARSER->SCOPE to the class (TYPE) or namespace
4881 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4882 it unchanged if there is no nested-name-specifier. Returns the new
4883 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4885 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4886 part of a declaration and/or decl-specifier. */
4888 static tree
4894 {
4899 /* Remember where the nested-name-specifier starts. */
4901 {
4904 }
4907 {
4908 tree new_scope;
4909 tree old_scope;
4910 tree saved_qualifying_scope;
4913 /* Spot cases that cannot be the beginning of a
4914 nested-name-specifier. */
4917 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4918 the already parsed nested-name-specifier. */
4920 {
4921 /* Grab the nested-name-specifier and continue the loop. */
4923 /* If we originally encountered this nested-name-specifier
4924 with IS_DECLARATION set to false, we will not have
4925 resolved TYPENAME_TYPEs, so we must do so here. */
4928 {
4933 }
4936 }
4938 /* Spot cases that cannot be the beginning of a
4939 nested-name-specifier. On the second and subsequent times
4940 through the loop, we look for the `template' keyword. */
4942 ;
4943 /* A template-id can start a nested-name-specifier. */
4945 ;
4946 /* DR 743: decltype can be used in a nested-name-specifier. */
4948 ;
4949 else
4950 {
4951 /* If the next token is not an identifier, then it is
4952 definitely not a type-name or namespace-name. */
4955 /* If the following token is neither a `<' (to begin a
4956 template-id), nor a `::', then we are not looking at a
4957 nested-name-specifier. */
4963 {
4967 }
4970 && !cp_parser_nth_token_starts_template_argument_list_p
4973 }
4975 /* The nested-name-specifier is optional, so we parse
4976 tentatively. */
4979 /* Look for the optional `template' keyword, if this isn't the
4980 first time through the loop. */
4983 else
4986 /* Save the old scope since the name lookup we are about to do
4987 might destroy it. */
4990 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4991 look up names in "X<T>::I" in order to determine that "Y" is
4992 a template. So, if we have a typename at this point, we make
4993 an effort to look through it. */
4995 && !typename_keyword_p
5000 /* Parse the qualifying entity. */
5001 new_scope
5003 typename_keyword_p,
5004 template_keyword_p,
5005 check_dependency_p,
5006 type_p,
5007 is_declaration);
5008 /* Look for the `::' token. */
5011 /* If we found what we wanted, we keep going; otherwise, we're
5012 done. */
5014 {
5017 /* Restore the OLD_SCOPE since it was valid before the
5018 failed attempt at finding the last
5019 class-or-namespace-name. */
5023 /* If the next token is a decltype, and the one after that is a
5024 `::', then the decltype has failed to resolve to a class or
5025 enumeration type. Give this error even when parsing
5026 tentatively since it can't possibly be valid--and we're going
5027 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5028 won't get another chance.*/
5032 {
5039 /* As below. */
5042 }
5046 /* If the next token is an identifier, and the one after
5047 that is a `::', then any valid interpretation would have
5048 found a class-or-namespace-name. */
5054 {
5057 {
5059 {
5060 tree decl;
5061 tree ambiguous_decls;
5064 none_type,
5073 decl);
5075 {
5081 }
5082 else
5083 {
5085 cp_parser_name_lookup_error
5088 else
5089 cp_parser_name_lookup_error
5092 }
5093 }
5096 /* Treat this as a successful nested-name-specifier
5097 due to:
5099 [basic.lookup.qual]
5101 If the name found is not a class-name (clause
5102 _class_) or namespace-name (_namespace.def_), the
5103 program is ill-formed. */
5105 }
5107 }
5109 }
5110 /* We've found one valid nested-name-specifier. */
5112 /* Name lookup always gives us a DECL. */
5115 /* Uses of "template" must be followed by actual templates. */
5127 new_scope);
5128 /* If it is a class scope, try to complete it; we are about to
5129 be looking up names inside the class. */
5131 /* Since checking types for dependency can be expensive,
5132 avoid doing it if the type is already complete. */
5134 /* Do not try to complete dependent types. */
5136 {
5138 /* If it is a typedef to current class, use the current
5139 class instead, as the typedef won't have any names inside
5140 it yet. */
5144 }
5145 /* Make sure we look in the right scope the next time through
5146 the loop. */
5148 }
5150 /* If parsing tentatively, replace the sequence of tokens that makes
5151 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5152 token. That way, should we re-parse the token stream, we will
5153 not have to repeat the effort required to do the parse, nor will
5154 we issue duplicate error messages. */
5156 {
5160 /* Reset the contents of the START token. */
5162 /* Retrieve any deferred checks. Do not pop this access checks yet
5163 so the memory will not be reclaimed during token replacing below. */
5171 /* Purge all subsequent tokens. */
5173 }
5179 }
5181 /* Parse a nested-name-specifier. See
5182 cp_parser_nested_name_specifier_opt for details. This function
5183 behaves identically, except that it will an issue an error if no
5184 nested-name-specifier is present. */
5186 static tree
5192 {
5193 tree scope;
5195 /* Look for the nested-name-specifier. */
5197 typename_keyword_p,
5198 check_dependency_p,
5199 type_p,
5200 is_declaration);
5201 /* If it was not present, issue an error message. */
5203 {
5206 }
5209 }
5211 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5212 this is either a class-name or a namespace-name (which corresponds
5213 to the class-or-namespace-name production in the grammar). For
5214 C++0x, it can also be a type-name that refers to an enumeration
5215 type or a simple-template-id.
5217 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5218 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5219 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5220 TYPE_P is TRUE iff the next name should be taken as a class-name,
5221 even the same name is declared to be another entity in the same
5222 scope.
5224 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5225 specified by the class-or-namespace-name. If neither is found the
5226 ERROR_MARK_NODE is returned. */
5228 static tree
5235 {
5236 tree saved_scope;
5237 tree saved_qualifying_scope;
5238 tree saved_object_scope;
5239 tree scope;
5243 /* DR 743: decltype can appear in a nested-name-specifier. */
5245 {
5249 {
5252 }
5256 }
5258 /* Before we try to parse the class-name, we must save away the
5259 current PARSER->SCOPE since cp_parser_class_name will destroy
5260 it. */
5264 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5265 there is no need to look for a namespace-name. */
5266 only_class_p = template_keyword_p
5271 typename_keyword_p,
5272 template_keyword_p,
5274 check_dependency_p,
5276 is_declaration);
5278 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5282 {
5283 /* Restore the saved scope. */
5288 /* Parse tentatively. */
5291 /* Parse a type-name */
5294 /* "If the name found does not designate a namespace or a class,
5295 enumeration, or dependent type, the program is ill-formed."
5297 We cover classes and dependent types above and namespaces below,
5298 so this code is only looking for enums. */
5304 }
5305 /* If that didn't work, try for a namespace-name. */
5307 {
5308 /* Restore the saved scope. */
5312 /* If we are not looking at an identifier followed by the scope
5313 resolution operator, then this is not part of a
5314 nested-name-specifier. (Note that this function is only used
5315 to parse the components of a nested-name-specifier.) */
5320 }
5323 }
5325 /* Parse a postfix-expression.
5327 postfix-expression:
5328 primary-expression
5329 postfix-expression [ expression ]
5330 postfix-expression ( expression-list [opt] )
5331 simple-type-specifier ( expression-list [opt] )
5332 typename :: [opt] nested-name-specifier identifier
5333 ( expression-list [opt] )
5334 typename :: [opt] nested-name-specifier template [opt] template-id
5335 ( expression-list [opt] )
5336 postfix-expression . template [opt] id-expression
5337 postfix-expression -> template [opt] id-expression
5338 postfix-expression . pseudo-destructor-name
5339 postfix-expression -> pseudo-destructor-name
5340 postfix-expression ++
5341 postfix-expression --
5342 dynamic_cast < type-id > ( expression )
5343 static_cast < type-id > ( expression )
5344 reinterpret_cast < type-id > ( expression )
5345 const_cast < type-id > ( expression )
5346 typeid ( expression )
5347 typeid ( type-id )
5349 GNU Extension:
5351 postfix-expression:
5352 ( type-id ) { initializer-list , [opt] }
5354 This extension is a GNU version of the C99 compound-literal
5355 construct. (The C99 grammar uses `type-name' instead of `type-id',
5356 but they are essentially the same concept.)
5358 If ADDRESS_P is true, the postfix expression is the operand of the
5359 `&' operator. CAST_P is true if this expression is the target of a
5360 cast.
5362 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5363 class member access expressions [expr.ref].
5365 Returns a representation of the expression. */
5367 static tree
5371 {
5378 /* Peek at the next token. */
5380 /* Some of the productions are determined by keywords. */
5383 {
5388 {
5389 tree type;
5390 tree expression;
5393 /* All of these can be handled in the same way from the point
5394 of view of parsing. Begin by consuming the token
5395 identifying the cast. */
5398 /* New types cannot be defined in the cast. */
5400 parser->type_definition_forbidden_message
5403 /* Look for the opening `<'. */
5405 /* Parse the type to which we are casting. */
5407 /* Look for the closing `>'. */
5409 /* Restore the old message. */
5412 /* And the expression which is being cast. */
5417 /* Only type conversions to integral or enumeration types
5418 can be used in constant-expressions. */
5424 {
5426 postfix_expression
5430 postfix_expression
5434 postfix_expression
5436 tf_warning_or_error);
5439 postfix_expression
5444 }
5445 }
5449 {
5450 tree type;
5454 /* Consume the `typeid' token. */
5456 /* Look for the `(' token. */
5458 /* Types cannot be defined in a `typeid' expression. */
5460 parser->type_definition_forbidden_message
5462 /* We can't be sure yet whether we're looking at a type-id or an
5463 expression. */
5465 /* Try a type-id first. */
5470 /* Look for the `)' token. Otherwise, we can't be sure that
5471 we're not looking at an expression: consider `typeid (int
5472 (3))', for example. */
5474 /* If all went well, simply lookup the type-id. */
5477 /* Otherwise, fall back to the expression variant. */
5478 else
5479 {
5480 tree expression;
5482 /* Look for an expression. */
5484 /* Compute its typeid. */
5486 /* Look for the `)' token. */
5488 }
5489 /* Restore the saved message. */
5491 /* `typeid' may not appear in an integral constant expression. */
5494 }
5498 {
5499 tree type;
5500 /* The syntax permitted here is the same permitted for an
5501 elaborated-type-specifier. */
5506 }
5510 {
5513 tree p;
5530 else
5531 {
5535 }
5537 }
5540 {
5541 tree type;
5543 /* If the next thing is a simple-type-specifier, we may be
5544 looking at a functional cast. We could also be looking at
5545 an id-expression. So, we try the functional cast, and if
5546 that doesn't work we fall back to the primary-expression. */
5548 /* Look for the simple-type-specifier. */
5551 CP_PARSER_FLAGS_NONE);
5552 /* Parse the cast itself. */
5554 postfix_expression
5556 /* If that worked, we're done. */
5560 /* If the functional-cast didn't work out, try a
5561 compound-literal. */
5564 {
5569 /* Consume the `('. */
5571 /* Parse the type. */
5576 /* Look for the `)'. */
5578 /* Look for the `{'. */
5580 /* If things aren't going well, there's no need to
5581 keep going. */
5583 {
5585 /* Parse the initializer-list. */
5586 initializer_list
5588 /* Allow a trailing `,'. */
5591 /* Look for the final `}'. */
5593 }
5594 /* If that worked, we're definitely looking at a
5595 compound-literal expression. */
5597 {
5598 /* Warn the user that a compound literal is not
5599 allowed in standard C++. */
5601 /* For simplicity, we disallow compound literals in
5602 constant-expressions. We could
5603 allow compound literals of integer type, whose
5604 initializer was a constant, in constant
5605 expressions. Permitting that usage, as a further
5606 extension, would not change the meaning of any
5607 currently accepted programs. (Of course, as
5608 compound literals are not part of ISO C++, the
5609 standard has nothing to say.) */
5611 NIC_NCC))
5612 {
5615 }
5616 /* Form the representation of the compound-literal. */
5617 postfix_expression
5618 = (finish_compound_literal
5620 initializer_list),
5621 tf_warning_or_error));
5623 }
5624 }
5626 /* It must be a primary-expression. */
5627 postfix_expression
5631 }
5633 }
5635 /* Keep looping until the postfix-expression is complete. */
5637 {
5641 /* It is not a Koenig lookup function call. */
5642 postfix_expression
5645 /* Peek at the next token. */
5649 {
5652 {
5654 "two consecutive %<[%> shall "
5657 }
5658 postfix_expression
5660 postfix_expression,
5667 /* postfix-expression ( expression-list [opt] ) */
5668 {
5677 is_builtin_constant_p
5680 {
5681 /* The whole point of __builtin_constant_p is to allow
5682 non-constant expressions to appear as arguments. */
5683 saved_integral_constant_expression_p
5685 saved_non_integral_constant_expression_p
5688 }
5689 args = (cp_parser_parenthesized_expression_list
5694 {
5695 parser->integral_constant_expression_p
5697 parser->non_integral_constant_expression_p
5699 }
5702 {
5705 }
5707 /* Function calls are not permitted in
5708 constant-expressions. */
5711 NIC_FUNC_CALL))
5712 {
5716 }
5721 {
5723 {
5725 {
5728 postfix_expression
5731 tf_warning_or_error);
5732 }
5733 else
5734 postfix_expression
5736 }
5737 /* We do not perform argument-dependent lookup if
5738 normal lookup finds a non-function, in accordance
5739 with the expected resolution of DR 218. */
5742 {
5746 /* Do not do argument dependent lookup if regular
5747 lookup finds a member function or a block-scope
5748 function declaration. [basic.lookup.argdep]/3 */
5751 {
5754 postfix_expression
5757 tf_warning_or_error);
5758 }
5759 }
5760 }
5763 {
5773 {
5774 postfix_expression
5778 }
5781 {
5782 postfix_expression
5783 = (build_new_method_call
5789 tf_warning_or_error));
5790 }
5791 else
5792 postfix_expression
5796 tf_warning_or_error);
5797 }
5801 postfix_expression = (build_offset_ref_call_from_tree
5803 tf_warning_or_error));
5805 /* A call to a static class member, or a namespace-scope
5806 function. */
5807 postfix_expression
5810 koenig_p,
5811 tf_warning_or_error);
5812 else
5813 /* All other function calls. */
5814 postfix_expression
5817 koenig_p,
5818 tf_warning_or_error);
5820 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5824 }
5829 /* postfix-expression . template [opt] id-expression
5830 postfix-expression . pseudo-destructor-name
5831 postfix-expression -> template [opt] id-expression
5832 postfix-expression -> pseudo-destructor-name */
5834 /* Consume the `.' or `->' operator. */
5837 postfix_expression
5839 postfix_expression,
5847 /* postfix-expression ++ */
5848 /* Consume the `++' token. */
5850 /* Generate a representation for the complete expression. */
5851 postfix_expression
5853 POSTINCREMENT_EXPR);
5854 /* Increments may not appear in constant-expressions. */
5862 /* postfix-expression -- */
5863 /* Consume the `--' token. */
5865 /* Generate a representation for the complete expression. */
5866 postfix_expression
5868 POSTDECREMENT_EXPR);
5869 /* Decrements may not appear in constant-expressions. */
5881 else
5883 }
5884 }
5886 /* We should never get here. */
5889 }
5891 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5892 by cp_parser_builtin_offsetof. We're looking for
5894 postfix-expression [ expression ]
5895 postfix-expression [ braced-init-list ] (C++11)
5897 FOR_OFFSETOF is set if we're being called in that context, which
5898 changes how we deal with integer constant expressions. */
5900 static tree
5902 tree postfix_expression,
5904 {
5905 tree index;
5908 /* Consume the `[' token. */
5911 /* Parse the index expression. */
5912 /* ??? For offsetof, there is a question of what to allow here. If
5913 offsetof is not being used in an integral constant expression context,
5914 then we *could* get the right answer by computing the value at runtime.
5915 If we are in an integral constant expression context, then we might
5916 could accept any constant expression; hard to say without analysis.
5917 Rather than open the barn door too wide right away, allow only integer
5918 constant expressions here. */
5921 else
5922 {
5924 {
5928 }
5929 else
5931 }
5933 /* Look for the closing `]'. */
5936 /* Build the ARRAY_REF. */
5939 /* When not doing offsetof, array references are not permitted in
5940 constant-expressions. */
5946 }
5948 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5949 by cp_parser_builtin_offsetof. We're looking for
5951 postfix-expression . template [opt] id-expression
5952 postfix-expression . pseudo-destructor-name
5953 postfix-expression -> template [opt] id-expression
5954 postfix-expression -> pseudo-destructor-name
5956 FOR_OFFSETOF is set if we're being called in that context. That sorta
5957 limits what of the above we'll actually accept, but nevermind.
5958 TOKEN_TYPE is the "." or "->" token, which will already have been
5959 removed from the stream. */
5961 static tree
5964 tree postfix_expression,
5966 location_t location)
5967 {
5968 tree name;
5973 /* If this is a `->' operator, dereference the pointer. */
5976 tf_warning_or_error);
5977 /* Check to see whether or not the expression is type-dependent. */
5979 /* The identifier following the `->' or `.' is not qualified. */
5985 /* Enter the scope corresponding to the type of the object
5986 given by the POSTFIX_EXPRESSION. */
5988 {
5990 /* According to the standard, no expression should ever have
5991 reference type. Unfortunately, we do not currently match
5992 the standard in this respect in that our internal representation
5993 of an expression may have reference type even when the standard
5994 says it does not. Therefore, we have to manually obtain the
5995 underlying type here. */
5997 /* The type of the POSTFIX_EXPRESSION must be complete. */
5999 {
6001 postfix_expression);
6003 }
6004 /* Unlike the object expression in other contexts, *this is not
6005 required to be of complete type for purposes of class member
6006 access (5.2.5) outside the member function body. */
6010 /* Let the name lookup machinery know that we are processing a
6011 class member access expression. */
6013 /* If something went wrong, we want to be able to discern that case,
6014 as opposed to the case where there was no SCOPE due to the type
6015 of expression being dependent. */
6018 /* If the SCOPE was erroneous, make the various semantic analysis
6019 functions exit quickly -- and without issuing additional error
6020 messages. */
6023 }
6025 /* Assume this expression is not a pseudo-destructor access. */
6028 /* If the SCOPE is a scalar type, then, if this is a valid program,
6029 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6030 is type dependent, it can be pseudo-destructor-name or something else.
6031 Try to parse it as pseudo-destructor-name first. */
6033 {
6034 tree s;
6035 tree type;
6038 /* Parse the pseudo-destructor-name. */
6047 {
6049 postfix_expression
6052 }
6053 }
6056 {
6057 /* If the SCOPE is not a scalar type, we are looking at an
6058 ordinary class member access expression, rather than a
6059 pseudo-destructor-name. */
6062 /* Parse the id-expression. */
6063 name = (cp_parser_id_expression
6070 /* In general, build a SCOPE_REF if the member name is qualified.
6071 However, if the name was not dependent and has already been
6072 resolved; there is no need to build the SCOPE_REF. For example;
6074 struct X { void f(); };
6075 template <typename T> void f(T* t) { t->X::f(); }
6077 Even though "t" is dependent, "X::f" is not and has been resolved
6078 to a BASELINK; there is no need to include scope information. */
6080 /* But we do need to remember that there was an explicit scope for
6081 virtual function calls. */
6085 /* If the name is a template-id that names a type, we will get a
6086 TYPE_DECL here. That is invalid code. */
6088 {
6091 }
6092 else
6093 {
6095 {
6097 {
6101 }
6102 else
6105 name,
6106 template_p);
6110 }
6112 adjust_result_of_qualified_name_lookup
6114 postfix_expression
6116 template_p,
6117 tf_warning_or_error);
6118 }
6119 }
6121 /* We no longer need to look up names in the scope of the object on
6122 the left-hand side of the `.' or `->' operator. */
6125 /* Outside of offsetof, these operators may not appear in
6126 constant-expressions. */
6128 && (cp_parser_non_integral_constant_expression
6133 }
6135 /* Parse a parenthesized expression-list.
6137 expression-list:
6138 assignment-expression
6139 expression-list, assignment-expression
6141 attribute-list:
6142 expression-list
6143 identifier
6144 identifier, expression-list
6146 CAST_P is true if this expression is the target of a cast.
6148 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6149 argument pack.
6151 Returns a vector of trees. Each element is a representation of an
6152 assignment-expression. NULL is returned if the ( and or ) are
6153 missing. An empty, but allocated, vector is returned on no
6154 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6155 if we are parsing an attribute list for an attribute that wants a
6156 plain identifier argument, normal_attr for an attribute that wants
6157 an expression, or non_attr if we aren't parsing an attribute list. If
6158 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6159 not all of the expressions in the list were constant. */
6167 {
6173 /* Assume all the expressions will be constant. */
6182 /* Within a parenthesized expression, a `>' token is always
6183 the greater-than operator. */
6184 saved_greater_than_is_operator_p
6188 /* Consume expressions until there are no more. */
6191 {
6192 tree expr;
6194 /* At the beginning of attribute lists, check to see if the
6195 next token is an identifier. */
6198 {
6201 /* Consume the identifier. */
6203 /* Save the identifier. */
6205 }
6206 else
6207 {
6210 /* Parse the next assignment-expression. */
6212 {
6213 /* A braced-init-list. */
6218 }
6220 {
6221 expr = (cp_parser_constant_expression
6226 }
6227 else
6233 /* If we have an ellipsis, then this is an expression
6234 expansion. */
6237 {
6238 /* Consume the `...'. */
6241 /* Build the argument pack. */
6243 }
6245 /* Add it to the list. We add error_mark_node
6246 expressions to the list, so that we can still tell if
6247 the correct form for a parenthesized expression-list
6248 is found. That gives better errors. */
6253 }
6255 /* After the first item, attribute lists look the same as
6256 expression lists. */
6259 get_comma:;
6260 /* If the next token isn't a `,', then we are done. */
6264 /* Otherwise, consume the `,' and keep going. */
6266 }
6269 {
6272 skip_comma:;
6273 /* We try and resync to an unnested comma, as that will give the
6274 user better diagnostics. */
6282 {
6283 parser->greater_than_is_operator_p
6286 }
6287 }
6289 parser->greater_than_is_operator_p
6296 }
6298 /* Parse a pseudo-destructor-name.
6300 pseudo-destructor-name:
6301 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6302 :: [opt] nested-name-specifier template template-id :: ~ type-name
6303 :: [opt] nested-name-specifier [opt] ~ type-name
6305 If either of the first two productions is used, sets *SCOPE to the
6306 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6307 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6308 or ERROR_MARK_NODE if the parse fails. */
6310 static void
6314 {
6317 /* Assume that things will not work out. */
6320 /* Look for the optional `::' operator. */
6322 /* Look for the optional nested-name-specifier. */
6323 nested_name_specifier_p
6330 /* Now, if we saw a nested-name-specifier, we might be doing the
6331 second production. */
6334 {
6335 /* Consume the `template' keyword. */
6337 /* Parse the template-id. */
6341 class_type,
6343 /* Look for the `::' token. */
6345 }
6346 /* If the next token is not a `~', then there might be some
6347 additional qualification. */
6349 {
6350 /* At this point, we're looking for "type-name :: ~". The type-name
6351 must not be a class-name, since this is a pseudo-destructor. So,
6352 it must be either an enum-name, or a typedef-name -- both of which
6353 are just identifiers. So, we peek ahead to check that the "::"
6354 and "~" tokens are present; if they are not, then we can avoid
6355 calling type_name. */
6359 {
6362 }
6364 /* Look for the type-name. */
6369 /* Look for the `::' token. */
6371 }
6372 else
6375 /* Look for the `~'. */
6378 /* Once we see the ~, this has to be a pseudo-destructor. */
6382 /* Look for the type-name again. We are not responsible for
6383 checking that it matches the first type-name. */
6385 }
6387 /* Parse a unary-expression.
6389 unary-expression:
6390 postfix-expression
6391 ++ cast-expression
6392 -- cast-expression
6393 unary-operator cast-expression
6394 sizeof unary-expression
6395 sizeof ( type-id )
6396 alignof ( type-id ) [C++0x]
6397 new-expression
6398 delete-expression
6400 GNU Extensions:
6402 unary-expression:
6403 __extension__ cast-expression
6404 __alignof__ unary-expression
6405 __alignof__ ( type-id )
6406 alignof unary-expression [C++0x]
6407 __real__ cast-expression
6408 __imag__ cast-expression
6409 && identifier
6411 ADDRESS_P is true iff the unary-expression is appearing as the
6412 operand of the `&' operator. CAST_P is true if this expression is
6413 the target of a cast.
6415 Returns a representation of the expression. */
6417 static tree
6420 {
6424 /* Peek at the next token. */
6426 /* Some keywords give away the kind of expression. */
6428 {
6432 {
6435 {
6438 location_t first_loc;
6441 /* Consume the token. */
6444 /* Parse the operand. */
6449 else
6450 {
6451 /* ISO C++ defines alignof only with types, not with
6452 expressions. So pedwarn if alignof is used with a non-
6453 type expression. However, __alignof__ is ok. */
6456 "ISO C++ does not allow %<alignof%> "
6460 }
6461 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6462 SIZEOF_EXPR with the original operand. */
6464 {
6466 {
6468 {
6471 error_mark_node));
6473 }
6474 else
6478 }
6480 }
6482 }
6491 {
6492 /* The saved value of the PEDANTIC flag. */
6494 tree expr;
6496 /* Save away the PEDANTIC flag. */
6498 /* Parse the cast-expression. */
6500 /* Restore the PEDANTIC flag. */
6504 }
6508 {
6509 tree expression;
6511 /* Consume the `__real__' or `__imag__' token. */
6513 /* Parse the cast-expression. */
6515 /* Create the complete representation. */
6519 expression,
6520 tf_warning_or_error);
6521 }
6529 {
6530 tree expr;
6540 parser->type_definition_forbidden_message
6543 saved_integral_constant_expression_p
6545 saved_non_integral_constant_expression_p
6549 saved_greater_than_is_operator_p
6559 parser->greater_than_is_operator_p
6562 parser->integral_constant_expression_p
6564 parser->non_integral_constant_expression_p
6571 }
6575 }
6576 }
6578 /* Look for the `:: new' and `:: delete', which also signal the
6579 beginning of a new-expression, or delete-expression,
6580 respectively. If the next token is `::', then it might be one of
6581 these. */
6583 {
6586 /* See if the token after the `::' is one of the keywords in
6587 which we're interested. */
6589 /* If it's `new', we have a new-expression. */
6592 /* Similarly, for `delete'. */
6595 }
6597 /* Look for a unary operator. */
6599 /* The `++' and `--' operators can be handled similarly, even though
6600 they are not technically unary-operators in the grammar. */
6602 {
6607 /* Handle the GNU address-of-label extension. */
6610 {
6611 tree identifier;
6612 tree expression;
6615 /* Consume the '&&' token. */
6617 /* Look for the identifier. */
6619 /* Create an expression representing the address. */
6622 NIC_ADDR_LABEL))
6625 }
6626 }
6628 {
6629 tree cast_expression;
6634 /* Consume the operator token. */
6636 /* Parse the cast-expression. */
6637 cast_expression
6641 /* Now, build an appropriate representation. */
6643 {
6647 RO_UNARY_STAR,
6648 tf_warning_or_error);
6653 /* Fall through. */
6656 cast_expression,
6657 tf_warning_or_error);
6664 /* Fall through. */
6669 cast_expression);
6674 }
6678 non_constant_p))
6682 }
6686 pidk);
6687 }
6689 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6690 unary-operator, the corresponding tree code is returned. */
6692 static enum tree_code
6694 {
6696 {
6717 }
6718 }
6720 /* Parse a new-expression.
6722 new-expression:
6723 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6724 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6726 Returns a representation of the expression. */
6728 static tree
6730 {
6733 tree type;
6736 tree ret;
6738 /* Look for the optional `::' operator. */
6739 global_scope_p
6743 /* Look for the `new' operator. */
6745 /* There's no easy way to tell a new-placement from the
6746 `( type-id )' construct. */
6748 /* Look for a new-placement. */
6750 /* If that didn't work out, there's no new-placement. */
6752 {
6756 }
6758 /* If the next token is a `(', then we have a parenthesized
6759 type-id. */
6761 {
6765 /* Consume the `('. */
6768 /* Parse the type-id. */
6769 parser->type_definition_forbidden_message
6774 /* Look for the closing `)'. */
6777 /* There should not be a direct-new-declarator in this production,
6778 but GCC used to allowed this, so we check and emit a sensible error
6779 message for this case. */
6781 {
6787 }
6788 }
6789 /* Otherwise, there must be a new-type-id. */
6790 else
6793 /* If the next token is a `(' or '{', then we have a new-initializer. */
6797 else
6800 /* A new-expression may not appear in an integral constant
6801 expression. */
6804 else
6805 {
6806 /* Create a representation of the new-expression. */
6808 tf_warning_or_error);
6809 }
6817 }
6819 /* Parse a new-placement.
6821 new-placement:
6822 ( expression-list )
6824 Returns the same representation as for an expression-list. */
6828 {
6831 /* Parse the expression-list. */
6832 expression_list = (cp_parser_parenthesized_expression_list
6838 }
6840 /* Parse a new-type-id.
6842 new-type-id:
6843 type-specifier-seq new-declarator [opt]
6845 Returns the TYPE allocated. If the new-type-id indicates an array
6846 type, *NELTS is set to the number of elements in the last array
6847 bound; the TYPE will not include the last array bound. */
6849 static tree
6851 {
6852 cp_decl_specifier_seq type_specifier_seq;
6858 /* The type-specifier sequence must not contain type definitions.
6859 (It cannot contain declarations of new types either, but if they
6860 are not definitions we will catch that because they are not
6861 complete.) */
6863 parser->type_definition_forbidden_message
6865 /* Parse the type-specifier-seq. */
6869 /* Restore the old message. */
6875 /* Parse the new-declarator. */
6878 /* Determine the number of elements in the last array dimension, if
6879 any. */
6881 /* Skip down to the last array dimension. */
6886 {
6889 }
6894 {
6897 }
6900 {
6907 else
6909 }
6912 }
6914 /* Parse an (optional) new-declarator.
6916 new-declarator:
6917 ptr-operator new-declarator [opt]
6918 direct-new-declarator
6920 Returns the declarator. */
6924 {
6927 cp_cv_quals cv_quals;
6929 /* We don't know if there's a ptr-operator next, or not. */
6931 /* Look for a ptr-operator. */
6933 /* If that worked, look for more new-declarators. */
6935 {
6938 /* Parse another optional declarator. */
6941 declarator = cp_parser_make_indirect_declarator
6945 }
6947 /* If the next token is a `[', there is a direct-new-declarator. */
6952 }
6954 /* Parse a direct-new-declarator.
6956 direct-new-declarator:
6957 [ expression ]
6958 direct-new-declarator [constant-expression]
6960 */
6964 {
6968 {
6969 tree expression;
6972 /* Look for the opening `['. */
6977 /* The standard requires that the expression have integral
6978 type. DR 74 adds enumeration types. We believe that the
6979 real intent is that these expressions be handled like the
6980 expression in a `switch' condition, which also allows
6981 classes with a single conversion to integral or
6982 enumeration type. */
6984 {
6985 expression
6987 expression,
6990 {
6992 "expression in new-declarator must have integral "
6995 }
6996 }
6998 /* Look for the closing `]'. */
7001 /* Add this bound to the declarator. */
7004 /* If the next token is not a `[', then there are no more
7005 bounds. */
7008 }
7011 }
7013 /* Parse a new-initializer.
7015 new-initializer:
7016 ( expression-list [opt] )
7017 braced-init-list
7019 Returns a representation of the expression-list. */
7023 {
7027 {
7028 tree t;
7034 }
7035 else
7036 expression_list = (cp_parser_parenthesized_expression_list
7042 }
7044 /* Parse a delete-expression.
7046 delete-expression:
7047 :: [opt] delete cast-expression
7048 :: [opt] delete [ ] cast-expression
7050 Returns a representation of the expression. */
7052 static tree
7054 {
7057 tree expression;
7059 /* Look for the optional `::' operator. */
7060 global_scope_p
7064 /* Look for the `delete' keyword. */
7066 /* See if the array syntax is in use. */
7068 {
7069 /* Consume the `[' token. */
7071 /* Look for the `]' token. */
7073 /* Remember that this is the `[]' construct. */
7075 }
7076 else
7079 /* Parse the cast-expression. */
7082 /* A delete-expression may not appear in an integral constant
7083 expression. */
7088 tf_warning_or_error);
7089 }
7091 /* Returns true if TOKEN may start a cast-expression and false
7092 otherwise. */
7094 static bool
7096 {
7098 {
7137 /* '[' may start a primary-expression in obj-c++. */
7143 }
7144 }
7146 /* Parse a cast-expression.
7148 cast-expression:
7149 unary-expression
7150 ( type-id ) cast-expression
7152 ADDRESS_P is true iff the unary-expression is appearing as the
7153 operand of the `&' operator. CAST_P is true if this expression is
7154 the target of a cast.
7156 Returns a representation of the expression. */
7158 static tree
7161 {
7162 /* If it's a `(', then we might be looking at a cast. */
7164 {
7170 /* There's no way to know yet whether or not this is a cast.
7171 For example, `(int (3))' is a unary-expression, while `(int)
7172 3' is a cast. So, we resort to parsing tentatively. */
7174 /* Types may not be defined in a cast. */
7176 parser->type_definition_forbidden_message
7178 /* Consume the `('. */
7180 /* A very tricky bit is that `(struct S) { 3 }' is a
7181 compound-literal (which we permit in C++ as an extension).
7182 But, that construct is not a cast-expression -- it is a
7183 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7184 is legal; if the compound-literal were a cast-expression,
7185 you'd need an extra set of parentheses.) But, if we parse
7186 the type-id, and it happens to be a class-specifier, then we
7187 will commit to the parse at that point, because we cannot
7188 undo the action that is done when creating a new class. So,
7189 then we cannot back up and do a postfix-expression.
7191 Therefore, we scan ahead to the closing `)', and check to see
7192 if the token after the `)' is a `{'. If so, we are not
7193 looking at a cast-expression.
7195 Save tokens so that we can put them back. */
7197 /* Skip tokens until the next token is a closing parenthesis.
7198 If we find the closing `)', and the next token is a `{', then
7199 we are looking at a compound-literal. */
7200 compound_literal_p
7204 /* Roll back the tokens we skipped. */
7206 /* If we were looking at a compound-literal, simulate an error
7207 so that the call to cp_parser_parse_definitely below will
7208 fail. */
7211 else
7212 {
7215 /* Look for the type-id. */
7217 /* Look for the closing `)'. */
7220 }
7222 /* Restore the saved message. */
7225 /* At this point this can only be either a cast or a
7226 parenthesized ctor such as `(T ())' that looks like a cast to
7227 function returning T. */
7231 {
7237 /* Warn about old-style casts, if so requested. */
7239 && !in_system_header
7244 /* Only type conversions to integral or enumeration types
7245 can be used in constant-expressions. */
7248 NIC_CAST))
7251 /* Perform the cast. */
7254 }
7255 else
7257 }
7259 /* If we get here, then it's not a cast, so it must be a
7260 unary-expression. */
7262 }
7264 /* Parse a binary expression of the general form:
7266 pm-expression:
7267 cast-expression
7268 pm-expression .* cast-expression
7269 pm-expression ->* cast-expression
7271 multiplicative-expression:
7272 pm-expression
7273 multiplicative-expression * pm-expression
7274 multiplicative-expression / pm-expression
7275 multiplicative-expression % pm-expression
7277 additive-expression:
7278 multiplicative-expression
7279 additive-expression + multiplicative-expression
7280 additive-expression - multiplicative-expression
7282 shift-expression:
7283 additive-expression
7284 shift-expression << additive-expression
7285 shift-expression >> additive-expression
7287 relational-expression:
7288 shift-expression
7289 relational-expression < shift-expression
7290 relational-expression > shift-expression
7291 relational-expression <= shift-expression
7292 relational-expression >= shift-expression
7294 GNU Extension:
7296 relational-expression:
7297 relational-expression <? shift-expression
7298 relational-expression >? shift-expression
7300 equality-expression:
7301 relational-expression
7302 equality-expression == relational-expression
7303 equality-expression != relational-expression
7305 and-expression:
7306 equality-expression
7307 and-expression & equality-expression
7309 exclusive-or-expression:
7310 and-expression
7311 exclusive-or-expression ^ and-expression
7313 inclusive-or-expression:
7314 exclusive-or-expression
7315 inclusive-or-expression | exclusive-or-expression
7317 logical-and-expression:
7318 inclusive-or-expression
7319 logical-and-expression && inclusive-or-expression
7321 logical-or-expression:
7322 logical-and-expression
7323 logical-or-expression || logical-and-expression
7325 All these are implemented with a single function like:
7327 binary-expression:
7328 simple-cast-expression
7329 binary-expression <token> binary-expression
7331 CAST_P is true if this expression is the target of a cast.
7333 The binops_by_token map is used to get the tree codes for each <token> type.
7334 binary-expressions are associated according to a precedence table. */
7336 #define TOKEN_PRECEDENCE(token) \
7337 (((token->type == CPP_GREATER \
7338 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7339 && !parser->greater_than_is_operator_p) \
7340 ? PREC_NOT_OPERATOR \
7341 : binops_by_token[token->type].prec)
7343 static tree
7348 {
7349 cp_parser_expression_stack stack;
7351 cp_parser_expression_stack_entry current;
7352 tree rhs;
7356 tree overload;
7358 /* Parse the first expression. */
7368 {
7369 /* Get an operator token. */
7375 {
7377 "%<>>%> operator is treated"
7381 }
7385 /* Popping an entry off the stack means we completed a subexpression:
7386 - either we found a token which is not an operator (`>' where it is not
7387 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7388 will happen repeatedly;
7389 - or, we found an operator which has lower priority. This is the case
7390 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7391 parsing `3 * 4'. */
7393 {
7396 else
7398 }
7400 get_rhs:
7404 /* We used the operator token. */
7407 /* For "false && x" or "true || x", x will never be executed;
7408 disable warnings while evaluating it. */
7414 /* Extract another operand. It may be the RHS of this expression
7415 or the LHS of a new, higher priority expression. */
7419 /* Get another operator token. Look up its precedence to avoid
7420 building a useless (immediately popped) stack entry for common
7421 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7425 {
7426 /* ... and prepare to parse the RHS of the new, higher priority
7427 expression. Since precedence levels on the stack are
7428 monotonically increasing, we do not have to care about
7429 stack overflows. */
7438 pop:
7440 /* If the stack is not empty, we have parsed into LHS the right side
7441 (`4' in the example above) of an expression we had suspended.
7442 We can use the information on the stack to recover the LHS (`3')
7443 from the stack together with the tree code (`MULT_EXPR'), and
7444 the precedence of the higher level subexpression
7445 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7446 which will be used to actually build the additive expression. */
7451 }
7453 /* Undo the disabling of warnings done above. */
7460 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7461 ERROR_MARK for everything that is not a binary expression.
7462 This makes warn_about_parentheses miss some warnings that
7463 involve unary operators. For unary expressions we should
7464 pass the correct tree_code unless the unary expression was
7465 surrounded by parentheses.
7466 */
7473 else
7477 tf_warning_or_error);
7482 /* If the binary operator required the use of an overloaded operator,
7483 then this expression cannot be an integral constant-expression.
7484 An overloaded operator can be used even if both operands are
7485 otherwise permissible in an integral constant-expression if at
7486 least one of the operands is of enumeration type. */
7490 NIC_OVERLOADED))
7492 }
7495 }
7498 /* Parse the `? expression : assignment-expression' part of a
7499 conditional-expression. The LOGICAL_OR_EXPR is the
7500 logical-or-expression that started the conditional-expression.
7501 Returns a representation of the entire conditional-expression.
7503 This routine is used by cp_parser_assignment_expression.
7505 ? expression : assignment-expression
7507 GNU Extensions:
7509 ? : assignment-expression */
7511 static tree
7513 {
7514 tree expr;
7515 tree assignment_expr;
7519 /* Consume the `?' token. */
7524 {
7527 /* Implicit true clause. */
7531 }
7532 else
7533 {
7536 /* Parse the expression. */
7539 c_inhibit_evaluation_warnings +=
7543 }
7545 /* The next token should be a `:'. */
7547 /* Parse the assignment-expression. */
7551 /* Build the conditional-expression. */
7553 expr,
7554 assignment_expr,
7555 tf_warning_or_error);
7556 }
7558 /* Parse an assignment-expression.
7560 assignment-expression:
7561 conditional-expression
7562 logical-or-expression assignment-operator assignment_expression
7563 throw-expression
7565 CAST_P is true if this expression is the target of a cast.
7567 Returns a representation for the expression. */
7569 static tree
7572 {
7573 tree expr;
7575 /* If the next token is the `throw' keyword, then we're looking at
7576 a throw-expression. */
7579 /* Otherwise, it must be that we are looking at a
7580 logical-or-expression. */
7581 else
7582 {
7583 /* Parse the binary expressions (logical-or-expression). */
7586 /* If the next token is a `?' then we're actually looking at a
7587 conditional-expression. */
7590 else
7591 {
7594 /* If it's an assignment-operator, we're using the second
7595 production. */
7596 enum tree_code assignment_operator
7599 {
7601 location_t saved_input_location;
7603 /* Parse the right-hand side of the assignment. */
7609 /* An assignment may not appear in a
7610 constant-expression. */
7612 NIC_ASSIGNMENT))
7614 /* Build the assignment expression. Its default
7615 location is the location of the '=' token. */
7619 assignment_operator,
7620 rhs,
7621 tf_warning_or_error);
7623 }
7624 }
7625 }
7628 }
7630 /* Parse an (optional) assignment-operator.
7632 assignment-operator: one of
7633 = *= /= %= += -= >>= <<= &= ^= |=
7635 GNU Extension:
7637 assignment-operator: one of
7638 <?= >?=
7640 If the next token is an assignment operator, the corresponding tree
7641 code is returned, and the token is consumed. For example, for
7642 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7643 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7644 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7645 operator, ERROR_MARK is returned. */
7647 static enum tree_code
7649 {
7653 /* Peek at the next token. */
7657 {
7703 /* Nothing else is an assignment operator. */
7705 }
7707 /* If it was an assignment operator, consume it. */
7712 }
7714 /* Parse an expression.
7716 expression:
7717 assignment-expression
7718 expression , assignment-expression
7720 CAST_P is true if this expression is the target of a cast.
7722 Returns a representation of the expression. */
7724 static tree
7726 {
7731 {
7732 tree assignment_expression;
7734 /* Parse the next assignment-expression. */
7735 assignment_expression
7737 /* If this is the first assignment-expression, we can just
7738 save it away. */
7741 else
7743 assignment_expression,
7744 tf_warning_or_error);
7745 /* If the next token is not a comma, then we are done with the
7746 expression. */
7749 /* Consume the `,'. */
7752 /* A comma operator cannot appear in a constant-expression. */
7755 }
7758 }
7760 /* Parse a constant-expression.
7762 constant-expression:
7763 conditional-expression
7765 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7766 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7767 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7768 is false, NON_CONSTANT_P should be NULL. */
7770 static tree
7774 {
7778 tree expression;
7780 /* It might seem that we could simply parse the
7781 conditional-expression, and then check to see if it were
7782 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7783 one that the compiler can figure out is constant, possibly after
7784 doing some simplifications or optimizations. The standard has a
7785 precise definition of constant-expression, and we must honor
7786 that, even though it is somewhat more restrictive.
7788 For example:
7790 int i[(2, 3)];
7792 is not a legal declaration, because `(2, 3)' is not a
7793 constant-expression. The `,' operator is forbidden in a
7794 constant-expression. However, GCC's constant-folding machinery
7795 will fold this operation to an INTEGER_CST for `3'. */
7797 /* Save the old settings. */
7799 saved_allow_non_integral_constant_expression_p
7802 /* We are now parsing a constant-expression. */
7804 parser->allow_non_integral_constant_expression_p
7807 /* Although the grammar says "conditional-expression", we parse an
7808 "assignment-expression", which also permits "throw-expression"
7809 and the use of assignment operators. In the case that
7810 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7811 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7812 actually essential that we look for an assignment-expression.
7813 For example, cp_parser_initializer_clauses uses this function to
7814 determine whether a particular assignment-expression is in fact
7815 constant. */
7817 /* Restore the old settings. */
7818 parser->integral_constant_expression_p
7820 parser->allow_non_integral_constant_expression_p
7823 {
7824 /* Require an rvalue constant expression here; that's what our
7825 callers expect. Reference constant expressions are handled
7826 separately in e.g. cp_parser_template_argument. */
7831 }
7834 parser->non_integral_constant_expression_p
7838 }
7840 /* Parse __builtin_offsetof.
7842 offsetof-expression:
7843 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7845 offsetof-member-designator:
7846 id-expression
7847 | offsetof-member-designator "." id-expression
7848 | offsetof-member-designator "[" expression "]"
7849 | offsetof-member-designator "->" id-expression */
7851 static tree
7853 {
7856 cp_id_kind dummy;
7859 /* We're about to accept non-integral-constant things, but will
7860 definitely yield an integral constant expression. Save and
7861 restore these values around our local parsing. */
7865 /* Consume the "__builtin_offsetof" token. */
7867 /* Consume the opening `('. */
7869 /* Parse the type-id. */
7871 /* Look for the `,'. */
7875 /* Build the (type *)null that begins the traditional offsetof macro. */
7877 tf_warning_or_error);
7879 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7883 {
7886 {
7888 /* offsetof-member-designator "[" expression "]" */
7893 /* offsetof-member-designator "->" identifier */
7895 /* FALLTHRU */
7898 /* offsetof-member-designator "." identifier */
7906 /* Consume the ")" token. */
7911 /* Error. We know the following require will fail, but
7912 that gives the proper error message. */
7917 }
7918 }
7920 success:
7921 /* If we're processing a template, we can't finish the semantics yet.
7922 Otherwise we can fold the entire expression now. */
7925 else
7928 failure:
7933 }
7935 /* Parse a trait expression.
7937 Returns a representation of the expression, the underlying type
7938 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7940 static tree
7942 {
7943 cp_trait_kind kind;
7946 cp_decl_specifier_seq decl_specs;
7949 {
8026 }
8028 /* Consume the token. */
8038 /* Build a trivial decl-specifier-seq. */
8042 /* Call grokdeclarator to figure out what type this is. */
8047 {
8055 /* Build a trivial decl-specifier-seq. */
8059 /* Call grokdeclarator to figure out what type this is. */
8062 }
8066 /* Complete the trait expression, which may mean either processing
8067 the trait expr now or saving it for template instantiation. */
8069 {
8078 }
8079 }
8081 /* Lambdas that appear in variable initializer or default argument scope
8082 get that in their mangling, so we need to record it. We might as well
8083 use the count for function and namespace scopes as well. */
8087 {
8088 tree t;
8093 static void
8095 {
8096 tree_int ti;
8098 /* Once we're inside a function, we ignore other scopes and just push
8099 the function again so that popping works properly. */
8106 {
8107 /* Don't reset the count if we're still in the same function. */
8110 }
8111 }
8113 static void
8115 {
8118 }
8120 static void
8122 {
8125 {
8128 }
8130 }
8132 /* Parse a lambda expression.
8134 lambda-expression:
8135 lambda-introducer lambda-declarator [opt] compound-statement
8137 Returns a representation of the expression. */
8139 static tree
8141 {
8143 tree type;
8153 /* We may be in the middle of deferred access check. Disable
8154 it now. */
8165 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8168 /* Now that we've started the type, add the capture fields for any
8169 explicit captures. */
8172 {
8173 /* Inside the class, surrounding template-parameter-lists do not apply. */
8174 unsigned int saved_num_template_parameter_lists
8183 /* By virtue of defining a local class, a lambda expression has access to
8184 the private variables of enclosing classes. */
8193 /* The capture list was built up in reverse order; fix that now. */
8194 {
8200 {
8204 }
8206 }
8216 }
8220 /* This field is only used during parsing of the lambda. */
8223 /* This lambda shouldn't have any proxies left at this point. */
8225 /* And now that we're done, push proxies for an enclosing lambda. */
8230 else
8232 }
8234 /* Parse the beginning of a lambda expression.
8236 lambda-introducer:
8237 [ lambda-capture [opt] ]
8239 LAMBDA_EXPR is the current representation of the lambda expression. */
8241 static void
8243 {
8244 /* Need commas after the first capture. */
8247 /* Eat the leading `['. */
8250 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8258 {
8261 }
8264 {
8266 tree capture_id;
8267 tree capture_init_expr;
8271 enum capture_kind_type
8272 {
8273 BY_COPY,
8274 BY_REFERENCE
8275 };
8279 {
8282 }
8286 else
8289 /* Possibly capture `this'. */
8291 {
8301 explicit_init_p);
8303 }
8305 /* Remember whether we want to capture as a reference or not. */
8307 {
8310 }
8312 /* Get the identifier. */
8317 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8318 delimiters, but I modified this to stop on unnested ']' as well. It
8319 was already changed to stop on unnested '}', so the
8320 "closing_parenthesis" name is no more misleading with my change. */
8321 {
8327 }
8329 /* Find the initializer for this capture. */
8331 {
8332 /* An explicit expression exists. */
8335 "ISO C++ does not allow initializers "
8341 }
8342 else
8343 {
8346 /* Turn the identifier into an id-expression. */
8347 capture_init_expr
8348 = cp_parser_lookup_name
8350 capture_id,
8351 none_type,
8359 {
8362 }
8366 {
8369 capture_init_expr);
8372 }
8375 {
8378 capture_init_expr);
8381 }
8383 capture_init_expr
8384 = finish_id_expression
8386 capture_init_expr,
8398 }
8402 {
8407 capture_id);
8411 "capture of %qD redundant with by-reference capture "
8413 }
8416 capture_id,
8417 capture_init_expr,
8419 explicit_init_p);
8420 }
8423 }
8425 /* Parse the (optional) middle of a lambda expression.
8427 lambda-declarator:
8428 ( parameter-declaration-clause [opt] )
8429 attribute-specifier [opt]
8430 mutable [opt]
8431 exception-specification [opt]
8432 lambda-return-type-clause [opt]
8434 LAMBDA_EXPR is the current representation of the lambda expression. */
8436 static bool
8438 {
8439 /* 5.1.1.4 of the standard says:
8440 If a lambda-expression does not include a lambda-declarator, it is as if
8441 the lambda-declarator were ().
8442 This means an empty parameter list, no attributes, and no exception
8443 specification. */
8447 tree t;
8449 /* The lambda-declarator is optional, but must begin with an opening
8450 parenthesis if present. */
8452 {
8457 /* Parse parameters. */
8460 /* Default arguments shall not be specified in the
8461 parameter-declaration-clause of a lambda-declarator. */
8471 /* Parse optional `mutable' keyword. */
8473 {
8476 }
8478 /* Parse optional exception specification. */
8481 /* Parse optional trailing return type. */
8483 {
8486 }
8488 /* The function parameters must be in scope all the way until after the
8489 trailing-return-type in case of decltype. */
8494 }
8496 /* Create the function call operator.
8498 Messing with declarators like this is no uglier than building up the
8499 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8500 other code. */
8501 {
8502 cp_decl_specifier_seq return_type_specs;
8504 tree fco;
8511 else
8512 /* Maybe we will deduce the return type later. */
8518 sfk_none);
8523 VIRT_SPEC_UNSPECIFIED,
8524 exception_spec,
8529 declarator,
8530 attributes);
8532 {
8535 /* Give the object parameter a different name. */
8537 }
8544 }
8545 }
8547 /* Parse the body of a lambda expression, which is simply
8549 compound-statement
8551 but which requires special handling.
8552 LAMBDA_EXPR is the current representation of the lambda expression. */
8554 static void
8556 {
8561 else
8562 /* Still increment function_depth so that we don't GC in the
8563 middle of an expression. */
8565 /* Clear this in case we're in the middle of a default argument. */
8568 /* Finish the function call operator
8569 - class_specifier
8570 + late_parsing_for_member
8571 + function_definition_after_declarator
8572 + ctor_initializer_opt_and_function_body */
8573 {
8575 tree body;
8577 tree compound_stmt;
8578 tree cap;
8580 /* Let the front end know that we are going to be defining this
8581 function. */
8583 NULL_TREE,
8592 /* Push the proxies for any explicit captures. */
8599 /* 5.1.1.4 of the standard says:
8600 If a lambda-expression does not include a trailing-return-type, it
8601 is as if the trailing-return-type denotes the following type:
8602 * if the compound-statement is of the form
8603 { return attribute-specifier [opt] expression ; }
8604 the type of the returned expression after lvalue-to-rvalue
8605 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8606 (_conv.array_ 4.2), and function-to-pointer conversion
8607 (_conv.func_ 4.3);
8608 * otherwise, void. */
8610 /* In a lambda that has neither a lambda-return-type-clause
8611 nor a deducible form, errors should be reported for return statements
8612 in the body. Since we used void as the placeholder return type, parsing
8613 the body as usual will give such desired behavior. */
8617 {
8621 /* Parse tentatively in case there's more after the initial return
8622 statement. */
8633 {
8637 /* Will get error here if type not deduced yet. */
8641 }
8642 }
8645 {
8650 }
8654 out:
8658 /* Finish the function and generate code for it if necessary. */
8660 }
8665 else
8667 }
8669 /* Statements [gram.stmt.stmt] */
8671 /* Parse a statement.
8673 statement:
8674 labeled-statement
8675 expression-statement
8676 compound-statement
8677 selection-statement
8678 iteration-statement
8679 jump-statement
8680 declaration-statement
8681 try-block
8683 C++11:
8685 statement:
8686 labeled-statement
8687 attribute-specifier-seq (opt) expression-statement
8688 attribute-specifier-seq (opt) compound-statement
8689 attribute-specifier-seq (opt) selection-statement
8690 attribute-specifier-seq (opt) iteration-statement
8691 attribute-specifier-seq (opt) jump-statement
8692 declaration-statement
8693 attribute-specifier-seq (opt) try-block
8695 TM Extension:
8697 statement:
8698 atomic-statement
8700 IN_COMPOUND is true when the statement is nested inside a
8701 cp_parser_compound_statement; this matters for certain pragmas.
8703 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8704 is a (possibly labeled) if statement which is not enclosed in braces
8705 and has an else clause. This is used to implement -Wparentheses. */
8707 static void
8710 {
8715 restart:
8718 /* There is no statement yet. */
8724 /* In obj-c++, seing '[[' might be the either the beginning of
8725 c++11 attributes, or a nested objc-message-expression. So
8726 let's parse the c++11 attributes tentatively. */
8730 {
8733 }
8735 /* Peek at the next token. */
8737 /* Remember the location of the first token in the statement. */
8739 /* If this is a keyword, then that will often determine what kind of
8740 statement we have. */
8742 {
8746 {
8749 /* Looks like a labeled-statement with a case label.
8750 Parse the label, and then use tail recursion to parse
8751 the statement. */
8773 /* Objective-C++ exception-handling constructs. */
8787 /* This must be a namespace alias definition. */
8800 /* It might be a keyword like `int' that can start a
8801 declaration-statement. */
8803 }
8804 }
8806 {
8807 /* If the next token is a `:', then we are looking at a
8808 labeled-statement. */
8811 {
8812 /* Looks like a labeled-statement with an ordinary label.
8813 Parse the label, and then use tail recursion to parse
8814 the statement. */
8818 }
8819 }
8820 /* Anything that starts with a `{' must be a compound-statement. */
8823 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8824 a statement all its own. */
8826 {
8827 /* Only certain OpenMP pragmas are attached to statements, and thus
8828 are considered statements themselves. All others are not. In
8829 the context of a compound, accept the pragma as a "statement" and
8830 return so that we can check for a close brace. Otherwise we
8831 require a real statement and must go back and read one. */
8837 }
8839 {
8842 }
8844 /* Everything else must be a declaration-statement or an
8845 expression-statement. Try for the declaration-statement
8846 first, unless we are looking at a `;', in which case we know that
8847 we have an expression-statement. */
8849 {
8851 {
8853 {
8854 /* Attributes should be parsed as part of the the
8855 declaration, so let's un-parse them. */
8858 }
8861 /* Try to parse the declaration-statement. */
8863 /* If that worked, we're done. */
8866 }
8867 /* Look for an expression-statement instead. */
8869 }
8871 /* Set the line number for the statement. */
8875 /* Note that for now, we don't do anything with c++11 statements
8876 parsed at this level. */
8879 OPT_Wattributes,
8881 }
8883 /* Parse the label for a labeled-statement, i.e.
8885 identifier :
8886 case constant-expression :
8887 default :
8889 GNU Extension:
8890 case constant-expression ... constant-expression : statement
8892 When a label is parsed without errors, the label is added to the
8893 parse tree by the finish_* functions, so this function doesn't
8894 have to return the label. */
8896 static void
8898 {
8903 /* The next token should be an identifier. */
8907 {
8910 }
8914 {
8916 {
8920 /* Consume the `case' token. */
8922 /* Parse the constant-expression. */
8925 NULL);
8929 {
8930 /* Consume the `...' token. */
8932 expr_hi =
8935 NULL);
8936 /* We don't need to emit warnings here, as the common code
8937 will do this for us. */
8938 }
8939 else
8944 else
8947 expr);
8948 }
8952 /* Consume the `default' token. */
8957 else
8962 /* Anything else must be an ordinary label. */
8965 }
8967 /* Require the `:' token. */
8970 /* An ordinary label may optionally be followed by attributes.
8971 However, this is only permitted if the attributes are then
8972 followed by a semicolon. This is because, for backward
8973 compatibility, when parsing
8974 lab: __attribute__ ((unused)) int i;
8975 we want the attribute to attach to "i", not "lab". */
8978 {
8979 tree attrs;
8986 ;
8987 else
8989 }
8995 }
8997 /* Parse an expression-statement.
8999 expression-statement:
9000 expression [opt] ;
9002 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9003 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9004 indicates whether this expression-statement is part of an
9005 expression statement. */
9007 static tree
9009 {
9013 /* If the next token is a ';', then there is no expression
9014 statement. */
9018 /* Give a helpful message for "A<T>::type t;" and the like. */
9021 {
9028 {
9029 /* A::A a; */
9034 }
9035 }
9037 /* Consume the final `;'. */
9042 /* This is the final expression statement of a statement
9043 expression. */
9047 else
9051 }
9053 /* Parse a compound-statement.
9055 compound-statement:
9056 { statement-seq [opt] }
9058 GNU extension:
9060 compound-statement:
9061 { label-declaration-seq [opt] statement-seq [opt] }
9063 label-declaration-seq:
9064 label-declaration
9065 label-declaration-seq label-declaration
9067 Returns a tree representing the statement. */
9069 static tree
9072 {
9073 tree compound_stmt;
9075 /* Consume the `{'. */
9082 /* Begin the compound-statement. */
9084 /* If the next keyword is `__label__' we have a label declaration. */
9087 /* Parse an (optional) statement-seq. */
9089 /* Finish the compound-statement. */
9091 /* Consume the `}'. */
9095 }
9097 /* Parse an (optional) statement-seq.
9099 statement-seq:
9100 statement
9101 statement-seq [opt] statement */
9103 static void
9105 {
9106 /* Scan statements until there aren't any more. */
9108 {
9111 /* If we are looking at a `}', then we have run out of
9112 statements; the same is true if we have reached the end
9113 of file, or have stumbled upon a stray '@end'. */
9120 /* If we are in a compound statement and find 'else' then
9121 something went wrong. */
9123 {
9126 else
9127 {
9130 }
9131 }
9133 /* Parse the statement. */
9135 }
9136 }
9138 /* Parse a selection-statement.
9140 selection-statement:
9141 if ( condition ) statement
9142 if ( condition ) statement else statement
9143 switch ( condition ) statement
9145 Returns the new IF_STMT or SWITCH_STMT.
9147 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9148 is a (possibly labeled) if statement which is not enclosed in
9149 braces and has an else clause. This is used to implement
9150 -Wparentheses. */
9152 static tree
9154 {
9161 /* Peek at the next token. */
9164 /* See what kind of keyword it is. */
9167 {
9170 {
9171 tree statement;
9172 tree condition;
9174 /* Look for the `('. */
9176 {
9179 }
9181 /* Begin the selection-statement. */
9184 else
9187 /* Parse the condition. */
9189 /* Look for the `)'. */
9195 {
9199 /* Add the condition. */
9202 /* Parse the then-clause. */
9206 {
9214 }
9215 else
9221 /* If the next token is `else', parse the else-clause. */
9223 RID_ELSE))
9224 {
9225 /* Consume the `else' keyword. */
9228 /* Parse the else-clause. */
9230 {
9231 location_t loc;
9238 }
9239 else
9244 /* If we are currently parsing a then-clause, then
9245 IF_P will not be NULL. We set it to true to
9246 indicate that this if statement has an else clause.
9247 This may trigger the Wparentheses warning below
9248 when we get back up to the parent if statement. */
9251 }
9252 else
9253 {
9254 /* This if statement does not have an else clause. If
9255 NESTED_IF is true, then the then-clause is an if
9256 statement which does have an else clause. We warn
9257 about the potential ambiguity. */
9260 "suggest explicit braces to avoid ambiguous"
9262 }
9264 /* Now we're all done with the if-statement. */
9266 }
9267 else
9268 {
9272 /* Add the condition. */
9275 /* Parse the body of the switch-statement. */
9284 /* Now we're all done with the switch-statement. */
9286 }
9289 }
9295 }
9296 }
9298 /* Parse a condition.
9300 condition:
9301 expression
9302 type-specifier-seq declarator = initializer-clause
9303 type-specifier-seq declarator braced-init-list
9305 GNU Extension:
9307 condition:
9308 type-specifier-seq declarator asm-specification [opt]
9309 attributes [opt] = assignment-expression
9311 Returns the expression that should be tested. */
9313 static tree
9315 {
9316 cp_decl_specifier_seq type_specifiers;
9320 /* Try the declaration first. */
9322 /* New types are not allowed in the type-specifier-seq for a
9323 condition. */
9325 parser->type_definition_forbidden_message
9327 /* Parse the type-specifier-seq. */
9329 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9332 /* Restore the saved message. */
9334 /* If all is well, we might be looking at a declaration. */
9336 {
9337 tree decl;
9338 tree asm_specification;
9339 tree attributes;
9343 /* Parse the declarator. */
9348 /* Parse the attributes. */
9350 /* Parse the asm-specification. */
9352 /* If the next token is not an `=' or '{', then we might still be
9353 looking at an expression. For example:
9355 if (A(a).x)
9357 looks like a decl-specifier-seq and a declarator -- but then
9358 there is no `=', so this is an expression. */
9363 /* If we did see an `=' or '{', then we are looking at a declaration
9364 for sure. */
9366 {
9367 tree pushed_scope;
9371 /* Create the declaration. */
9377 /* Parse the initializer. */
9379 {
9383 }
9384 else
9385 {
9386 /* Consume the `='. */
9389 }
9393 /* Process the initializer. */
9396 asm_specification,
9397 flags);
9403 }
9404 }
9405 /* If we didn't even get past the declarator successfully, we are
9406 definitely not looking at a declaration. */
9407 else
9410 /* Otherwise, we are looking at an expression. */
9412 }
9414 /* Parses a for-statement or range-for-statement until the closing ')',
9415 not included. */
9417 static tree
9419 {
9423 /* Begin the for-statement. */
9426 /* Parse the initialization. */
9431 else
9433 }
9435 static tree
9437 {
9438 /* Normal for loop */
9441 tree stmt;
9444 /* The for-init-statement has already been parsed in
9445 cp_parser_for_init_statement, so no work is needed here. */
9448 /* If there's a condition, process it. */
9452 /* Look for the `;'. */
9455 /* If there's an expression, process it. */
9461 }
9463 /* Tries to parse a range-based for-statement:
9465 range-based-for:
9466 decl-specifier-seq declarator : expression
9468 The decl-specifier-seq declarator and the `:' are already parsed by
9469 cp_parser_for_init_statement. If processing_template_decl it returns a
9470 newly created RANGE_FOR_STMT; if not, it is converted to a
9471 regular FOR_STMT. */
9473 static tree
9475 {
9479 {
9482 }
9483 else
9486 /* If in template, STMT is converted to a normal for-statement
9487 at instantiation. If not, it is done just ahead. */
9489 {
9495 /* do_auto_deduction doesn't mess with template init-lists. */
9498 }
9499 else
9500 {
9503 }
9505 }
9507 /* Subroutine of cp_convert_range_for: given the initializer expression,
9508 builds up the range temporary. */
9510 static tree
9512 {
9515 /* Find out the type deduced by the declaration
9516 `auto &&__range = range_expr'. */
9521 /* Create the __range variable. */
9528 }
9530 /* Used by cp_parser_range_for in template context: we aren't going to
9531 do a full conversion yet, but we still need to resolve auto in the
9532 type of the for-range-declaration if present. This is basically
9533 a shortcut version of cp_convert_range_for. */
9535 static void
9537 {
9540 {
9543 iter_type = (cp_parser_perform_range_for_lookup
9547 tf_warning_or_error);
9550 }
9551 }
9553 /* Converts a range-based for-statement into a normal
9554 for-statement, as per the definition.
9556 for (RANGE_DECL : RANGE_EXPR)
9557 BLOCK
9559 should be equivalent to:
9561 {
9562 auto &&__range = RANGE_EXPR;
9563 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9564 __begin != __end;
9565 ++__begin)
9566 {
9567 RANGE_DECL = *__begin;
9568 BLOCK
9569 }
9570 }
9572 If RANGE_EXPR is an array:
9573 BEGIN_EXPR = __range
9574 END_EXPR = __range + ARRAY_SIZE(__range)
9575 Else if RANGE_EXPR has a member 'begin' or 'end':
9576 BEGIN_EXPR = __range.begin()
9577 END_EXPR = __range.end()
9578 Else:
9579 BEGIN_EXPR = begin(__range)
9580 END_EXPR = end(__range);
9582 If __range has a member 'begin' but not 'end', or vice versa, we must
9583 still use the second alternative (it will surely fail, however).
9584 When calling begin()/end() in the third alternative we must use
9585 argument dependent lookup, but always considering 'std' as an associated
9586 namespace. */
9588 tree
9590 {
9596 /* If an error happened previously do nothing or else a lot of
9597 unhelpful errors would be issued. */
9599 else
9600 {
9605 LOOKUP_ONLYCONVERTING);
9610 }
9612 /* The new for initialization statement. */
9620 LOOKUP_ONLYCONVERTING);
9629 LOOKUP_ONLYCONVERTING);
9633 /* The new for condition. */
9640 /* The new increment expression. */
9645 /* The declaration is initialized with *__begin inside the loop body. */
9648 tf_warning_or_error),
9650 LOOKUP_ONLYCONVERTING);
9653 }
9655 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9656 We need to solve both at the same time because the method used
9657 depends on the existence of members begin or end.
9658 Returns the type deduced for the iterator expression. */
9660 static tree
9662 {
9664 {
9667 }
9670 {
9675 }
9677 {
9678 /* If RANGE is an array, we will use pointer arithmetic. */
9681 range,
9685 }
9686 else
9687 {
9688 /* If it is not an array, we must do a bit of magic. */
9698 tf_warning_or_error);
9701 tf_warning_or_error);
9704 {
9705 /* Use the member functions. */
9708 else
9714 else
9717 }
9718 else
9719 {
9720 /* Use global functions with ADL. */
9728 tf_warning_or_error);
9730 tf_warning_or_error);
9733 tf_warning_or_error);
9735 tf_warning_or_error);
9738 }
9740 /* Last common checks. */
9742 {
9743 /* If one of the expressions is an error do no more checks. */
9746 }
9747 else
9748 {
9750 /* The unqualified type of the __begin and __end temporaries should
9751 be the same, as required by the multiple auto declaration. */
9757 }
9758 }
9759 }
9761 /* Helper function for cp_parser_perform_range_for_lookup.
9762 Builds a tree for RANGE.IDENTIFIER(). */
9764 static tree
9766 {
9779 tf_warning_or_error);
9782 }
9784 /* Parse an iteration-statement.
9786 iteration-statement:
9787 while ( condition ) statement
9788 do statement while ( expression ) ;
9789 for ( for-init-statement condition [opt] ; expression [opt] )
9790 statement
9792 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9794 static tree
9796 {
9799 tree statement;
9802 /* Peek at the next token. */
9807 /* Remember whether or not we are already within an iteration
9808 statement. */
9811 /* See what kind of keyword it is. */
9814 {
9816 {
9817 tree condition;
9819 /* Begin the while-statement. */
9821 /* Look for the `('. */
9823 /* Parse the condition. */
9826 /* Look for the `)'. */
9828 /* Parse the dependent statement. */
9832 /* We're done with the while-statement. */
9834 }
9838 {
9839 tree expression;
9841 /* Begin the do-statement. */
9843 /* Parse the body of the do-statement. */
9848 /* Look for the `while' keyword. */
9850 /* Look for the `('. */
9852 /* Parse the expression. */
9854 /* We're done with the do-statement. */
9856 /* Look for the `)'. */
9858 /* Look for the `;'. */
9860 }
9864 {
9865 /* Look for the `('. */
9870 /* Look for the `)'. */
9873 /* Parse the body of the for-statement. */
9878 /* We're done with the for-statement. */
9880 }
9887 }
9890 }
9892 /* Parse a for-init-statement or the declarator of a range-based-for.
9893 Returns true if a range-based-for declaration is seen.
9895 for-init-statement:
9896 expression-statement
9897 simple-declaration */
9899 static bool
9901 {
9902 /* If the next token is a `;', then we have an empty
9903 expression-statement. Grammatically, this is also a
9904 simple-declaration, but an invalid one, because it does not
9905 declare anything. Therefore, if we did not handle this case
9906 specially, we would issue an error message about an invalid
9907 declaration. */
9909 {
9915 /* We're going to speculatively look for a declaration, falling back
9916 to an expression, if necessary. */
9918 /* Parse the declaration. */
9921 decl);
9924 {
9925 /* It is a range-for, consume the ':' */
9929 {
9931 "range-based %<for%> loops are not allowed "
9934 }
9935 }
9936 else
9937 /* The ';' is not consumed yet because we told
9938 cp_parser_simple_declaration not to. */
9943 /* If the tentative parse failed, then we shall need to look for an
9944 expression-statement. */
9945 }
9946 /* If we are here, it is an expression-statement. */
9949 }
9951 /* Parse a jump-statement.
9953 jump-statement:
9954 break ;
9955 continue ;
9956 return expression [opt] ;
9957 return braced-init-list ;
9958 goto identifier ;
9960 GNU extension:
9962 jump-statement:
9963 goto * expression ;
9965 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9967 static tree
9969 {
9975 /* Peek at the next token. */
9980 /* See what kind of keyword it is. */
9983 {
9987 {
10002 }
10008 {
10021 }
10026 {
10027 tree expr;
10031 {
10034 }
10037 else
10038 /* If the next token is a `;', then there is no
10039 expression. */
10041 /* Build the return-statement. */
10043 /* Look for the final `;'. */
10045 }
10049 /* Create the goto-statement. */
10051 {
10052 /* Issue a warning about this use of a GNU extension. */
10054 /* Consume the '*' token. */
10056 /* Parse the dependent expression. */
10058 }
10059 else
10061 /* Look for the final `;'. */
10068 }
10071 }
10073 /* Parse a declaration-statement.
10075 declaration-statement:
10076 block-declaration */
10078 static void
10080 {
10083 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10086 /* Parse the block-declaration. */
10089 /* Free any declarators allocated. */
10092 /* Finish off the statement. */
10094 }
10096 /* Some dependent statements (like `if (cond) statement'), are
10097 implicitly in their own scope. In other words, if the statement is
10098 a single statement (as opposed to a compound-statement), it is
10099 none-the-less treated as if it were enclosed in braces. Any
10100 declarations appearing in the dependent statement are out of scope
10101 after control passes that point. This function parses a statement,
10102 but ensures that is in its own scope, even if it is not a
10103 compound-statement.
10105 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10106 is a (possibly labeled) if statement which is not enclosed in
10107 braces and has an else clause. This is used to implement
10108 -Wparentheses.
10110 Returns the new statement. */
10112 static tree
10114 {
10115 tree statement;
10120 /* Mark if () ; with a special NOP_EXPR. */
10122 {
10126 }
10127 /* if a compound is opened, we simply parse the statement directly. */
10130 /* If the token is not a `{', then we must take special action. */
10131 else
10132 {
10133 /* Create a compound-statement. */
10135 /* Parse the dependent-statement. */
10137 /* Finish the dummy compound-statement. */
10139 }
10141 /* Return the statement. */
10143 }
10145 /* For some dependent statements (like `while (cond) statement'), we
10146 have already created a scope. Therefore, even if the dependent
10147 statement is a compound-statement, we do not want to create another
10148 scope. */
10150 static void
10152 {
10153 /* If the token is a `{', then we must take special action. */
10156 else
10157 {
10158 /* Avoid calling cp_parser_compound_statement, so that we
10159 don't create a new scope. Do everything else by hand. */
10161 /* If the next keyword is `__label__' we have a label declaration. */
10164 /* Parse an (optional) statement-seq. */
10167 }
10168 }
10170 /* Declarations [gram.dcl.dcl] */
10172 /* Parse an optional declaration-sequence.
10174 declaration-seq:
10175 declaration
10176 declaration-seq declaration */
10178 static void
10180 {
10182 {
10193 {
10194 /* A declaration consisting of a single semicolon is
10195 invalid. Allow it unless we're being pedantic. */
10200 }
10202 /* If we're entering or exiting a region that's implicitly
10203 extern "C", modify the lang context appropriately. */
10205 {
10208 }
10210 {
10213 }
10216 {
10217 /* A top-level declaration can consist solely of a #pragma.
10218 A nested declaration cannot, so this is done here and not
10219 in cp_parser_declaration. (A #pragma at block scope is
10220 handled in cp_parser_statement.) */
10223 }
10225 /* Parse the declaration itself. */
10227 }
10228 }
10230 /* Parse a declaration.
10232 declaration:
10233 block-declaration
10234 function-definition
10235 template-declaration
10236 explicit-instantiation
10237 explicit-specialization
10238 linkage-specification
10239 namespace-definition
10241 GNU extension:
10243 declaration:
10244 __extension__ declaration */
10246 static void
10248 {
10249 cp_token token1;
10250 cp_token token2;
10255 /* Check for the `__extension__' keyword. */
10257 {
10258 /* Parse the qualified declaration. */
10260 /* Restore the PEDANTIC flag. */
10264 }
10266 /* Try to figure out what kind of declaration is present. */
10271 else
10272 {
10275 }
10277 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10280 /* If the next token is `extern' and the following token is a string
10281 literal, then we have a linkage specification. */
10285 /* If the next token is `template', then we have either a template
10286 declaration, an explicit instantiation, or an explicit
10287 specialization. */
10289 {
10290 /* `template <>' indicates a template specialization. */
10294 /* `template <' indicates a template declaration. */
10297 /* Anything else must be an explicit instantiation. */
10298 else
10300 }
10301 /* If the next token is `export', then we have a template
10302 declaration. */
10305 /* If the next token is `extern', 'static' or 'inline' and the one
10306 after that is `template', we have a GNU extended explicit
10307 instantiation directive. */
10314 /* If the next token is `namespace', check for a named or unnamed
10315 namespace definition. */
10321 /* An unnamed namespace definition. */
10325 /* An inline (associated) namespace definition. */
10329 /* Objective-C++ declaration/definition. */
10336 /* We must have either a block declaration or a function
10337 definition. */
10338 else
10339 /* Try to parse a block-declaration, or a function-definition. */
10342 /* Free any declarators allocated. */
10344 }
10346 /* Parse a block-declaration.
10348 block-declaration:
10349 simple-declaration
10350 asm-definition
10351 namespace-alias-definition
10352 using-declaration
10353 using-directive
10355 GNU Extension:
10357 block-declaration:
10358 __extension__ block-declaration
10360 C++0x Extension:
10362 block-declaration:
10363 static_assert-declaration
10365 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10366 part of a declaration-statement. */
10368 static void
10371 {
10375 /* Check for the `__extension__' keyword. */
10377 {
10378 /* Parse the qualified declaration. */
10380 /* Restore the PEDANTIC flag. */
10384 }
10386 /* Peek at the next token to figure out which kind of declaration is
10387 present. */
10390 /* If the next keyword is `asm', we have an asm-definition. */
10392 {
10396 }
10397 /* If the next keyword is `namespace', we have a
10398 namespace-alias-definition. */
10401 /* If the next keyword is `using', we have a
10402 using-declaration, a using-directive, or an alias-declaration. */
10404 {
10409 /* If the token after `using' is `namespace', then we have a
10410 using-directive. */
10414 /* If the second token after 'using' is '=', then we have an
10415 alias-declaration. */
10421 /* Otherwise, it's a using-declaration. */
10422 else
10425 }
10426 /* If the next keyword is `__label__' we have a misplaced label
10427 declaration. */
10429 {
10433 /* If the next token is now a `;', consume it. */
10436 }
10437 /* If the next token is `static_assert' we have a static assertion. */
10440 /* Anything else must be a simple-declaration. */
10441 else
10444 }
10446 /* Parse a simple-declaration.
10448 simple-declaration:
10449 decl-specifier-seq [opt] init-declarator-list [opt] ;
10451 init-declarator-list:
10452 init-declarator
10453 init-declarator-list , init-declarator
10455 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10456 function-definition as a simple-declaration.
10458 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10459 parsed declaration if it is an uninitialized single declarator not followed
10460 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10461 if present, will not be consumed. */
10463 static void
10467 {
10468 cp_decl_specifier_seq decl_specifiers;
10475 /* Defer access checks until we know what is being declared; the
10476 checks for names appearing in the decl-specifier-seq should be
10477 done as if we were in the scope of the thing being declared. */
10480 /* Parse the decl-specifier-seq. We have to keep track of whether
10481 or not the decl-specifier-seq declares a named class or
10482 enumeration type, since that is the only case in which the
10483 init-declarator-list is allowed to be empty.
10485 [dcl.dcl]
10487 In a simple-declaration, the optional init-declarator-list can be
10488 omitted only when declaring a class or enumeration, that is when
10489 the decl-specifier-seq contains either a class-specifier, an
10490 elaborated-type-specifier, or an enum-specifier. */
10492 CP_PARSER_FLAGS_OPTIONAL,
10495 /* We no longer need to defer access checks. */
10498 /* In a block scope, a valid declaration must always have a
10499 decl-specifier-seq. By not trying to parse declarators, we can
10500 resolve the declaration/expression ambiguity more quickly. */
10503 {
10506 }
10508 /* If the next two tokens are both identifiers, the code is
10509 erroneous. The usual cause of this situation is code like:
10511 T t;
10513 where "T" should name a type -- but does not. */
10516 {
10517 /* If parsing tentatively, we should commit; we really are
10518 looking at a declaration. */
10520 /* Give up. */
10522 }
10524 /* If we have seen at least one decl-specifier, and the next token
10525 is not a parenthesis, then we must be looking at a declaration.
10526 (After "int (" we might be looking at a functional cast.) */
10533 /* Keep going until we hit the `;' at the end of the simple
10534 declaration. */
10537 CPP_SEMICOLON))
10538 {
10541 tree decl;
10544 {
10545 /* If we are processing next declarator, coma is expected */
10551 }
10552 else
10555 /* Parse the init-declarator. */
10558 function_definition_allowed_p,
10560 declares_class_or_enum,
10562 maybe_range_for_decl);
10563 /* If an error occurred while parsing tentatively, exit quickly.
10564 (That usually happens when in the body of a function; each
10565 statement is treated as a declaration-statement until proven
10566 otherwise.) */
10569 /* Handle function definitions specially. */
10571 {
10572 /* If the next token is a `,', then we are probably
10573 processing something like:
10575 void f() {}, *p;
10577 which is erroneous. */
10579 {
10582 "mixing"
10584 }
10585 /* Otherwise, we're done with the list of declarators. */
10586 else
10587 {
10590 }
10591 }
10594 /* The next token should be either a `,' or a `;'. */
10596 /* If it's a `,', there are more declarators to come. */
10599 /* If it's a `;', we are done. */
10602 /* Anything else is an error. */
10603 else
10604 {
10605 /* If we have already issued an error message we don't need
10606 to issue another one. */
10610 /* Skip tokens until we reach the end of the statement. */
10612 /* If the next token is now a `;', consume it. */
10616 }
10617 /* After the first time around, a function-definition is not
10618 allowed -- even if it was OK at first. For example:
10620 int i, f() {}
10622 is not valid. */
10624 }
10626 /* Issue an error message if no declarators are present, and the
10627 decl-specifier-seq does not itself declare a class or
10628 enumeration. */
10630 {
10633 /* Perform any deferred access checks. */
10635 }
10637 /* Consume the `;'. */
10641 done:
10643 }
10645 /* Parse a decl-specifier-seq.
10647 decl-specifier-seq:
10648 decl-specifier-seq [opt] decl-specifier
10649 decl-specifier attribute-specifier-seq [opt] (C++11)
10651 decl-specifier:
10652 storage-class-specifier
10653 type-specifier
10654 function-specifier
10655 friend
10656 typedef
10658 GNU Extension:
10660 decl-specifier:
10661 attributes
10663 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10665 The parser flags FLAGS is used to control type-specifier parsing.
10667 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10668 flags:
10670 1: one of the decl-specifiers is an elaborated-type-specifier
10671 (i.e., a type declaration)
10672 2: one of the decl-specifiers is an enum-specifier or a
10673 class-specifier (i.e., a type definition)
10675 */
10677 static void
10679 cp_parser_flags flags,
10682 {
10686 cp_decl_spec ds;
10688 /* Clear DECL_SPECS. */
10691 /* Assume no class or enumeration type is declared. */
10694 /* Keep reading specifiers until there are no more to read. */
10696 {
10701 /* Peek at the next token. */
10704 /* Save the first token of the decl spec list for error
10705 reporting. */
10708 /* Handle attributes. */
10710 {
10711 /* Parse the attributes. */
10714 /* In a sequence of declaration specifiers, c++11 attributes
10715 appertain to the type that precede them. In that case
10716 [dcl.spec]/1 says:
10718 The attribute-specifier-seq affects the type only for
10719 the declaration it appears in, not other declarations
10720 involving the same type.
10722 But for now let's force the user to position the
10723 attribute either at the beginning of the declaration or
10724 after the declarator-id, which would clearly mean that it
10725 applies to the declarator. */
10727 {
10729 /* The c++11 attribute is at the beginning of the
10730 declaration. It appertains to the entity being
10732 else
10733 {
10735 {
10736 /* This is an attribute following a
10737 class-specifier. */
10742 }
10743 else
10744 {
10745 decl_specs->std_attributes
10747 attrs);
10750 }
10752 }
10753 }
10755 decl_specs->attributes
10757 attrs);
10761 }
10762 /* Assume we will find a decl-specifier keyword. */
10764 /* If the next token is an appropriate keyword, we can simply
10765 add it to the list. */
10767 {
10768 /* decl-specifier:
10769 friend
10770 constexpr */
10773 {
10776 }
10777 else
10778 {
10780 /* Consume the token. */
10782 }
10790 /* function-specifier:
10791 inline
10792 virtual
10793 explicit */
10800 /* decl-specifier:
10801 typedef */
10804 /* Consume the token. */
10806 /* A constructor declarator cannot appear in a typedef. */
10808 /* The "typedef" keyword can only occur in a declaration; we
10809 may as well commit at this point. */
10816 /* storage-class-specifier:
10817 auto
10818 register
10819 static
10820 extern
10821 mutable
10823 GNU Extension:
10824 thread */
10827 {
10828 /* Consume the token. */
10831 /* Complain about `auto' as a storage specifier, if
10832 we're complaining about C++0x compatibility. */
10836 /* Set the storage class anyway. */
10838 token);
10839 }
10840 else
10841 /* C++0x auto type-specifier. */
10849 /* Consume the token. */
10852 token);
10855 /* Consume the token. */
10861 /* We did not yet find a decl-specifier yet. */
10864 }
10874 /* Constructors are a special case. The `S' in `S()' is not a
10875 decl-specifier; it is the beginning of the declarator. */
10876 constructor_p
10877 = (!found_decl_spec
10878 && constructor_possible_p
10879 && (cp_parser_constructor_declarator_p
10882 /* If we don't have a DECL_SPEC yet, then we must be looking at
10883 a type-specifier. */
10885 {
10888 tree type_spec;
10890 type_spec
10892 decl_specs,
10898 /* If this type-specifier referenced a user-defined type
10899 (a typedef, class-name, etc.), then we can't allow any
10900 more such type-specifiers henceforth.
10902 [dcl.spec]
10904 The longest sequence of decl-specifiers that could
10905 possibly be a type name is taken as the
10906 decl-specifier-seq of a declaration. The sequence shall
10907 be self-consistent as described below.
10909 [dcl.type]
10911 As a general rule, at most one type-specifier is allowed
10912 in the complete decl-specifier-seq of a declaration. The
10913 only exceptions are the following:
10915 -- const or volatile can be combined with any other
10916 type-specifier.
10918 -- signed or unsigned can be combined with char, long,
10919 short, or int.
10921 -- ..
10923 Example:
10925 typedef char* Pc;
10926 void g (const int Pc);
10928 Here, Pc is *not* part of the decl-specifier seq; it's
10929 the declarator. Therefore, once we see a type-specifier
10930 (other than a cv-qualifier), we forbid any additional
10931 user-defined types. We *do* still allow things like `int
10932 int' to be considered a decl-specifier-seq, and issue the
10933 error message later. */
10936 /* A constructor declarator cannot follow a type-specifier. */
10938 {
10943 }
10944 }
10946 /* If we still do not have a DECL_SPEC, then there are no more
10947 decl-specifiers. */
10952 /* After we see one decl-specifier, further decl-specifiers are
10953 always optional. */
10955 }
10957 /* Don't allow a friend specifier with a class definition. */
10962 }
10964 /* Parse an (optional) storage-class-specifier.
10966 storage-class-specifier:
10967 auto
10968 register
10969 static
10970 extern
10971 mutable
10973 GNU Extension:
10975 storage-class-specifier:
10976 thread
10978 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10980 static tree
10982 {
10984 {
10988 /* Fall through for C++98. */
10995 /* Consume the token. */
11000 }
11001 }
11003 /* Parse an (optional) function-specifier.
11005 function-specifier:
11006 inline
11007 virtual
11008 explicit
11010 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11011 Updates DECL_SPECS, if it is non-NULL. */
11013 static tree
11016 {
11019 {
11025 /* 14.5.2.3 [temp.mem]
11027 A member function template shall not be virtual. */
11039 }
11041 /* Consume the token. */
11043 }
11045 /* Parse a linkage-specification.
11047 linkage-specification:
11048 extern string-literal { declaration-seq [opt] }
11049 extern string-literal declaration */
11051 static void
11053 {
11054 tree linkage;
11056 /* Look for the `extern' keyword. */
11059 /* Look for the string-literal. */
11062 /* Transform the literal into an identifier. If the literal is a
11063 wide-character string, or contains embedded NULs, then we can't
11064 handle it as the user wants. */
11067 {
11069 /* Assume C++ linkage. */
11071 }
11072 else
11075 /* We're now using the new linkage. */
11078 /* If the next token is a `{', then we're using the first
11079 production. */
11081 {
11082 /* Consume the `{' token. */
11084 /* Parse the declarations. */
11086 /* Look for the closing `}'. */
11088 }
11089 /* Otherwise, there's just one declaration. */
11090 else
11091 {
11094 saved_in_unbraced_linkage_specification_p
11098 parser->in_unbraced_linkage_specification_p
11100 }
11102 /* We're done with the linkage-specification. */
11104 }
11106 /* Parse a static_assert-declaration.
11108 static_assert-declaration:
11109 static_assert ( constant-expression , string-literal ) ;
11111 If MEMBER_P, this static_assert is a class member. */
11113 static void
11115 {
11116 tree condition;
11117 tree message;
11119 location_t saved_loc;
11122 /* Peek at the `static_assert' token so we can keep track of exactly
11123 where the static assertion started. */
11127 /* Look for the `static_assert' keyword. */
11129 RT_STATIC_ASSERT))
11132 /* We know we are in a static assertion; commit to any tentative
11133 parse. */
11137 /* Parse the `(' starting the static assertion condition. */
11140 /* Parse the constant-expression. Allow a non-constant expression
11141 here in order to give better diagnostics in finish_static_assert. */
11142 condition =
11147 /* Parse the separating `,'. */
11150 /* Parse the string-literal message. */
11155 /* A `)' completes the static assertion. */
11162 /* A semicolon terminates the declaration. */
11165 /* Complete the static assertion, which may mean either processing
11166 the static assert now or saving it for template instantiation. */
11168 }
11170 /* Parse a `decltype' type. Returns the type.
11172 simple-type-specifier:
11173 decltype ( expression ) */
11175 static tree
11177 {
11178 tree expr;
11187 {
11188 /* Already parsed. */
11191 }
11193 /* Look for the `decltype' token. */
11197 /* Types cannot be defined in a `decltype' expression. Save away the
11198 old message. */
11201 /* And create the new one. */
11202 parser->type_definition_forbidden_message
11205 /* The restrictions on constant-expressions do not apply inside
11206 decltype expressions. */
11207 saved_integral_constant_expression_p
11209 saved_non_integral_constant_expression_p
11213 /* Do not actually evaluate the expression. */
11216 /* Do not warn about problems with the expression. */
11219 /* Parse the opening `('. */
11223 /* First, try parsing an id-expression. */
11234 {
11237 cp_id_kind idk;
11241 /* Lookup the name we got back from the id-expression. */
11243 none_type,
11257 {
11258 /* Complete lookup of the id-expression. */
11259 expr = (finish_id_expression
11272 /* We found an id-expression, but it was something that we
11273 should not have found. This is an error, not something
11274 we can recover from, so note that we found an
11275 id-expression and we'll recover as gracefully as
11276 possible. */
11278 }
11283 /* We have an id-expression. */
11285 }
11288 {
11289 /* Abort the id-expression parse. */
11292 /* Parsing tentatively, again. */
11295 /* Parse a class member access. */
11303 /* We have an id-expression. */
11305 }
11308 /* We have parsed the complete id-expression or member access. */
11310 else
11311 {
11314 /* Abort our attempt to parse an id-expression or member access
11315 expression. */
11318 /* Within a parenthesized expression, a `>' token is always
11319 the greater-than operator. */
11320 saved_greater_than_is_operator_p
11324 /* Parse a full expression. */
11327 /* The `>' token might be the end of a template-id or
11328 template-parameter-list now. */
11329 parser->greater_than_is_operator_p
11331 }
11333 /* Go back to evaluating expressions. */
11337 /* Restore the old message and the integral constant expression
11338 flags. */
11340 parser->integral_constant_expression_p
11342 parser->non_integral_constant_expression_p
11345 /* Parse to the closing `)'. */
11347 {
11351 }
11354 tf_warning_or_error);
11356 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11357 it again. */
11364 }
11366 /* Special member functions [gram.special] */
11368 /* Parse a conversion-function-id.
11370 conversion-function-id:
11371 operator conversion-type-id
11373 Returns an IDENTIFIER_NODE representing the operator. */
11375 static tree
11377 {
11378 tree type;
11379 tree saved_scope;
11380 tree saved_qualifying_scope;
11381 tree saved_object_scope;
11384 /* Look for the `operator' token. */
11387 /* When we parse the conversion-type-id, the current scope will be
11388 reset. However, we need that information in able to look up the
11389 conversion function later, so we save it here. */
11393 /* We must enter the scope of the class so that the names of
11394 entities declared within the class are available in the
11395 conversion-type-id. For example, consider:
11397 struct S {
11398 typedef int I;
11399 operator I();
11400 };
11402 S::operator I() { ... }
11404 In order to see that `I' is a type-name in the definition, we
11405 must be in the scope of `S'. */
11408 /* Parse the conversion-type-id. */
11410 /* Leave the scope of the class, if any. */
11413 /* Restore the saved scope. */
11417 /* If the TYPE is invalid, indicate failure. */
11421 }
11423 /* Parse a conversion-type-id:
11425 conversion-type-id:
11426 type-specifier-seq conversion-declarator [opt]
11428 Returns the TYPE specified. */
11430 static tree
11432 {
11433 tree attributes;
11434 cp_decl_specifier_seq type_specifiers;
11436 tree type_specified;
11438 /* Parse the attributes. */
11440 /* Parse the type-specifiers. */
11444 /* If that didn't work, stop. */
11447 /* Parse the conversion-declarator. */
11455 /* Don't give this error when parsing tentatively. This happens to
11456 work because we always parse this definitively once. */
11459 {
11461 {
11464 }
11468 }
11471 }
11473 /* Parse an (optional) conversion-declarator.
11475 conversion-declarator:
11476 ptr-operator conversion-declarator [opt]
11478 */
11482 {
11485 cp_cv_quals cv_quals;
11487 /* We don't know if there's a ptr-operator next, or not. */
11489 /* Try the ptr-operator. */
11492 /* If it worked, look for more conversion-declarators. */
11494 {
11497 /* Parse another optional declarator. */
11500 declarator = cp_parser_make_indirect_declarator
11504 }
11507 }
11509 /* Parse an (optional) ctor-initializer.
11511 ctor-initializer:
11512 : mem-initializer-list
11514 Returns TRUE iff the ctor-initializer was actually present. */
11516 static bool
11518 {
11519 /* If the next token is not a `:', then there is no
11520 ctor-initializer. */
11522 {
11523 /* Do default initialization of any bases and members. */
11528 }
11530 /* Consume the `:' token. */
11532 /* And the mem-initializer-list. */
11536 }
11538 /* Parse a mem-initializer-list.
11540 mem-initializer-list:
11541 mem-initializer ... [opt]
11542 mem-initializer ... [opt] , mem-initializer-list */
11544 static void
11546 {
11551 /* Let the semantic analysis code know that we are starting the
11552 mem-initializer-list. */
11557 /* Loop through the list. */
11559 {
11560 tree mem_initializer;
11563 /* Parse the mem-initializer. */
11565 /* If the next token is a `...', we're expanding member initializers. */
11567 {
11568 /* Consume the `...'. */
11571 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11572 can be expanded but members cannot. */
11575 {
11580 }
11582 /* Construct the pack expansion type. */
11585 }
11588 {
11592 }
11593 /* Look for a target constructor. */
11597 {
11600 {
11604 }
11606 }
11607 /* Add it to the list, unless it was erroneous. */
11609 {
11612 }
11613 /* If the next token is not a `,', we're done. */
11616 /* Consume the `,' token. */
11618 }
11620 /* Perform semantic analysis. */
11623 }
11625 /* Parse a mem-initializer.
11627 mem-initializer:
11628 mem-initializer-id ( expression-list [opt] )
11629 mem-initializer-id braced-init-list
11631 GNU extension:
11633 mem-initializer:
11634 ( expression-list [opt] )
11636 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11637 class) or FIELD_DECL (for a non-static data member) to initialize;
11638 the TREE_VALUE is the expression-list. An empty initialization
11639 list is represented by void_list_node. */
11641 static tree
11643 {
11644 tree mem_initializer_id;
11645 tree expression_list;
11646 tree member;
11649 /* Find out what is being initialized. */
11651 {
11655 }
11656 else
11657 {
11661 }
11667 {
11673 }
11674 else
11675 {
11685 }
11695 }
11697 /* Parse a mem-initializer-id.
11699 mem-initializer-id:
11700 :: [opt] nested-name-specifier [opt] class-name
11701 identifier
11703 Returns a TYPE indicating the class to be initializer for the first
11704 production. Returns an IDENTIFIER_NODE indicating the data member
11705 to be initialized for the second production. */
11707 static tree
11709 {
11713 tree id;
11717 /* `typename' is not allowed in this context ([temp.res]). */
11719 {
11721 "keyword %<typename%> not allowed in this context (a qualified "
11724 }
11725 /* Look for the optional `::' operator. */
11726 global_scope_p
11730 /* Look for the optional nested-name-specifier. The simplest way to
11731 implement:
11733 [temp.res]
11735 The keyword `typename' is not permitted in a base-specifier or
11736 mem-initializer; in these contexts a qualified name that
11737 depends on a template-parameter is implicitly assumed to be a
11738 type name.
11740 is to assume that we have seen the `typename' keyword at this
11741 point. */
11742 nested_name_specifier_p
11751 /* If there is a `::' operator or a nested-name-specifier, then we
11752 are definitely looking for a class-name. */
11757 typename_type,
11761 /* Otherwise, we could also be looking for an ordinary identifier. */
11763 /* Try a class-name. */
11767 none_type,
11771 /* If we found one, we're done. */
11774 /* Otherwise, look for an ordinary identifier. */
11776 }
11778 /* Overloading [gram.over] */
11780 /* Parse an operator-function-id.
11782 operator-function-id:
11783 operator operator
11785 Returns an IDENTIFIER_NODE for the operator which is a
11786 human-readable spelling of the identifier, e.g., `operator +'. */
11788 static tree
11790 {
11791 /* Look for the `operator' keyword. */
11794 /* And then the name of the operator itself. */
11796 }
11798 /* Return an identifier node for a user-defined literal operator.
11799 The suffix identifier is chained to the operator name identifier. */
11801 static tree
11803 {
11804 tree identifier;
11809 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11812 }
11814 /* Parse an operator.
11816 operator:
11817 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11818 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11819 || ++ -- , ->* -> () []
11821 GNU Extensions:
11823 operator:
11824 <? >? <?= >?=
11826 Returns an IDENTIFIER_NODE for the operator which is a
11827 human-readable spelling of the identifier, e.g., `operator +'. */
11829 static tree
11831 {
11835 /* Peek at the next token. */
11837 /* Figure out which operator we have. */
11839 {
11841 {
11844 /* The keyword should be either `new' or `delete'. */
11849 else
11852 /* Consume the `new' or `delete' token. */
11855 /* Peek at the next token. */
11857 /* If it's a `[' token then this is the array variant of the
11858 operator. */
11860 {
11861 /* Consume the `[' token. */
11863 /* Look for the `]' token. */
11867 }
11868 /* Otherwise, we have the non-array variant. */
11869 else
11873 }
12020 /* Consume the `('. */
12022 /* Look for the matching `)'. */
12027 /* Consume the `['. */
12029 /* Look for the matching `]'. */
12037 {
12040 }
12041 /* Consume the string. */
12043 /* Look for the suffix identifier. */
12046 {
12049 {
12052 }
12053 }
12054 else
12055 {
12058 }
12065 /* Anything else is an error. */
12067 }
12069 /* If we have selected an identifier, we need to consume the
12070 operator token. */
12073 /* Otherwise, no valid operator name was present. */
12074 else
12075 {
12078 }
12081 }
12083 /* Parse a template-declaration.
12085 template-declaration:
12086 export [opt] template < template-parameter-list > declaration
12088 If MEMBER_P is TRUE, this template-declaration occurs within a
12089 class-specifier.
12091 The grammar rule given by the standard isn't correct. What
12092 is really meant is:
12094 template-declaration:
12095 export [opt] template-parameter-list-seq
12096 decl-specifier-seq [opt] init-declarator [opt] ;
12097 export [opt] template-parameter-list-seq
12098 function-definition
12100 template-parameter-list-seq:
12101 template-parameter-list-seq [opt]
12102 template < template-parameter-list > */
12104 static void
12106 {
12107 /* Check for `export'. */
12109 {
12110 /* Consume the `export' token. */
12112 /* Warn that we do not support `export'. */
12114 }
12117 }
12119 /* Parse a template-parameter-list.
12121 template-parameter-list:
12122 template-parameter
12123 template-parameter-list , template-parameter
12125 Returns a TREE_LIST. Each node represents a template parameter.
12126 The nodes are connected via their TREE_CHAINs. */
12128 static tree
12130 {
12135 /* The loop below parses the template parms. We first need to know
12136 the total number of template parms to be able to compute proper
12137 canonical types of each dependent type. So after the loop, when
12138 we know the total number of template parms,
12139 end_template_parm_list computes the proper canonical types and
12140 fixes up the dependent types accordingly. */
12142 {
12143 tree parameter;
12146 location_t parm_loc;
12148 /* Parse the template-parameter. */
12153 /* Add it to the list. */
12156 parm_loc,
12157 parameter,
12158 is_non_type,
12159 is_parameter_pack);
12160 else
12161 {
12164 }
12166 /* If the next token is not a `,', we're done. */
12169 /* Otherwise, consume the `,' token. */
12171 }
12174 }
12176 /* Parse a template-parameter.
12178 template-parameter:
12179 type-parameter
12180 parameter-declaration
12182 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12183 the parameter. The TREE_PURPOSE is the default value, if any.
12184 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12185 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12186 set to true iff this parameter is a parameter pack. */
12188 static tree
12191 {
12195 tree parm;
12197 /* Assume it is a type parameter or a template parameter. */
12199 /* Assume it not a parameter pack. */
12201 /* Peek at the next token. */
12203 /* If it is `class' or `template', we have a type-parameter. */
12206 /* If it is `class' or `typename' we do not know yet whether it is a
12207 type parameter or a non-type parameter. Consider:
12209 template <typename T, typename T::X X> ...
12211 or:
12213 template <class C, class D*> ...
12215 Here, the first parameter is a type parameter, and the second is
12216 a non-type parameter. We can tell by looking at the token after
12217 the identifier -- if it is a `,', `=', or `>' then we have a type
12218 parameter. */
12220 {
12221 /* Peek at the token after `class' or `typename'. */
12223 /* If it's an ellipsis, we have a template type parameter
12224 pack. */
12227 /* If it's an identifier, skip it. */
12230 /* Now, see if the token looks like the end of a template
12231 parameter. */
12236 }
12238 /* Otherwise, it is a non-type parameter.
12240 [temp.param]
12242 When parsing a default template-argument for a non-type
12243 template-parameter, the first non-nested `>' is taken as the end
12244 of the template parameter-list rather than a greater-than
12245 operator. */
12247 parameter_declarator
12251 /* If the parameter declaration is marked as a parameter pack, set
12252 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12253 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12254 grokdeclarator. */
12258 {
12261 }
12265 {
12266 /* Can happen in some cases of erroneous input (c++/34892). */
12268 /* Consume the `...' for better error recovery. */
12270 }
12271 /* If the next token is an ellipsis, and we don't already have it
12272 marked as a parameter pack, then we have a parameter pack (that
12273 has no declarator). */
12276 && (declarator_can_be_parameter_pack
12278 {
12279 /* Consume the `...'. */
12284 }
12285 /* We might end up with a pack expansion as the type of the non-type
12286 template parameter, in which case this is a non-type template
12287 parameter pack. */
12291 {
12295 }
12298 {
12299 /* Parameter packs cannot have default arguments. However, a
12300 user may try to do so, so we'll parse them and give an
12301 appropriate diagnostic here. */
12305 /* Find the name of the parameter pack. */
12314 else
12318 /* Parse the default argument, but throw away the result. */
12320 }
12330 }
12332 /* Parse a type-parameter.
12334 type-parameter:
12335 class identifier [opt]
12336 class identifier [opt] = type-id
12337 typename identifier [opt]
12338 typename identifier [opt] = type-id
12339 template < template-parameter-list > class identifier [opt]
12340 template < template-parameter-list > class identifier [opt]
12341 = id-expression
12343 GNU Extension (variadic templates):
12345 type-parameter:
12346 class ... identifier [opt]
12347 typename ... identifier [opt]
12349 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12350 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12351 the declaration of the parameter.
12353 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12355 static tree
12357 {
12359 tree parameter;
12361 /* Look for a keyword to tell us what kind of parameter this is. */
12367 {
12370 {
12371 tree identifier;
12372 tree default_argument;
12374 /* If the next token is an ellipsis, we have a template
12375 argument pack. */
12377 {
12378 /* Consume the `...' token. */
12383 }
12385 /* If the next token is an identifier, then it names the
12386 parameter. */
12389 else
12392 /* Create the parameter. */
12395 /* If the next token is an `=', we have a default argument. */
12397 {
12398 /* Consume the `=' token. */
12400 /* Parse the default-argument. */
12404 /* Template parameter packs cannot have default
12405 arguments. */
12407 {
12410 "template parameter pack %qD cannot have a "
12412 else
12414 "template parameter packs cannot have "
12417 }
12419 }
12420 else
12423 /* Create the combined representation of the parameter and the
12424 default argument. */
12426 }
12430 {
12431 tree identifier;
12432 tree default_argument;
12434 /* Look for the `<'. */
12436 /* Parse the template-parameter-list. */
12438 /* Look for the `>'. */
12440 /* Look for the `class' keyword. */
12442 /* If the next token is an ellipsis, we have a template
12443 argument pack. */
12445 {
12446 /* Consume the `...' token. */
12451 }
12452 /* If the next token is an `=', then there is a
12453 default-argument. If the next token is a `>', we are at
12454 the end of the parameter-list. If the next token is a `,',
12455 then we are at the end of this parameter. */
12459 {
12461 /* Treat invalid names as if the parameter were nameless. */
12464 }
12465 else
12468 /* Create the template parameter. */
12470 identifier);
12472 /* If the next token is an `=', then there is a
12473 default-argument. */
12475 {
12478 /* Consume the `='. */
12480 /* Parse the id-expression. */
12482 /* save token before parsing the id-expression, for error
12483 reporting */
12485 default_argument
12493 /* If the id-expression was a template-id that refers to
12494 a template-class, we already have the declaration here,
12495 so no further lookup is needed. */
12496 ;
12497 else
12498 /* Look up the name. */
12499 default_argument
12501 none_type,
12507 /* See if the default argument is valid. */
12508 default_argument
12511 /* Template parameter packs cannot have default
12512 arguments. */
12514 {
12517 "template parameter pack %qD cannot "
12519 identifier);
12520 else
12524 }
12526 }
12527 else
12530 /* Create the combined representation of the parameter and the
12531 default argument. */
12533 }
12539 }
12542 }
12544 /* Parse a template-id.
12546 template-id:
12547 template-name < template-argument-list [opt] >
12549 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12550 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12551 returned. Otherwise, if the template-name names a function, or set
12552 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12553 names a class, returns a TYPE_DECL for the specialization.
12555 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12556 uninstantiated templates. */
12558 static tree
12564 {
12566 tree templ;
12567 tree arguments;
12568 tree template_id;
12575 /* If the next token corresponds to a template-id, there is no need
12576 to reparse it. */
12579 {
12582 /* Get the stored value. */
12584 /* Perform any access checks that were deferred. */
12587 {
12592 tf_warning_or_error);
12593 }
12594 /* Return the stored value. */
12596 }
12598 /* Avoid performing name lookup if there is no possibility of
12599 finding a template-id. */
12602 && !cp_parser_nth_token_starts_template_argument_list_p
12604 {
12607 }
12609 /* Remember where the template-id starts. */
12615 /* Parse the template-name. */
12618 check_dependency_p,
12619 is_declaration,
12620 tag_type,
12623 {
12626 }
12628 /* If we find the sequence `[:' after a template-name, it's probably
12629 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12630 parse correctly the argument list. */
12637 {
12639 /* Change `:' into `::'. */
12641 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12642 CPP_LESS. */
12645 /* Parse the arguments. */
12648 {
12649 /* If we couldn't parse an argument list, then we revert our changes
12650 and return simply an error. Maybe this is not a template-id
12651 after all. */
12656 }
12657 /* Otherwise, emit an error about the invalid digraph, but continue
12658 parsing because we got our argument list. In C++11 do not emit
12659 any error, per 2.5/3. */
12663 {
12666 "%<<:%> is an alternate spelling for %<[%>."
12669 {
12671 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
12674 }
12675 }
12676 }
12677 else
12678 {
12679 /* Look for the `<' that starts the template-argument-list. */
12681 {
12684 }
12685 /* Parse the arguments. */
12687 }
12689 /* Build a representation of the specialization. */
12692 TEMPLATE_ID_EXPR,
12696 {
12698 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12699 template (rather than some instantiation thereof) only if
12700 is not nested within some other construct. For example, in
12701 "template <typename T> void f(T) { A<T>::", A<T> is just an
12702 instantiation of A. */
12705 CPP_SCOPE));
12706 template_id
12708 }
12709 else
12710 {
12711 /* If it's not a class-template or a template-template, it should be
12712 a function-template. */
12718 }
12720 /* If parsing tentatively, replace the sequence of tokens that makes
12721 up the template-id with a CPP_TEMPLATE_ID token. That way,
12722 should we re-parse the token stream, we will not have to repeat
12723 the effort required to do the parse, nor will we issue duplicate
12724 error messages about problems during instantiation of the
12725 template. */
12727 {
12730 /* Reset the contents of the START_OF_ID token. */
12732 /* Retrieve any deferred checks. Do not pop this access checks yet
12733 so the memory will not be reclaimed during token replacing below. */
12739 /* Purge all subsequent tokens. */
12742 /* ??? Can we actually assume that, if template_id ==
12743 error_mark_node, we will have issued a diagnostic to the
12744 user, as opposed to simply marking the tentative parse as
12745 failed? */
12748 }
12752 }
12754 /* Parse a template-name.
12756 template-name:
12757 identifier
12759 The standard should actually say:
12761 template-name:
12762 identifier
12763 operator-function-id
12765 A defect report has been filed about this issue.
12767 A conversion-function-id cannot be a template name because they cannot
12768 be part of a template-id. In fact, looking at this code:
12770 a.operator K<int>()
12772 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12773 It is impossible to call a templated conversion-function-id with an
12774 explicit argument list, since the only allowed template parameter is
12775 the type to which it is converting.
12777 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12778 `template' keyword, in a construction like:
12780 T::template f<3>()
12782 In that case `f' is taken to be a template-name, even though there
12783 is no way of knowing for sure.
12785 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12786 name refers to a set of overloaded functions, at least one of which
12787 is a template, or an IDENTIFIER_NODE with the name of the template,
12788 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12789 names are looked up inside uninstantiated templates. */
12791 static tree
12798 {
12799 tree identifier;
12800 tree decl;
12801 tree fns;
12804 /* If the next token is `operator', then we have either an
12805 operator-function-id or a conversion-function-id. */
12807 {
12808 /* We don't know whether we're looking at an
12809 operator-function-id or a conversion-function-id. */
12811 /* Try an operator-function-id. */
12813 /* If that didn't work, try a conversion-function-id. */
12815 {
12818 }
12819 }
12820 /* Look for the identifier. */
12821 else
12824 /* If we didn't find an identifier, we don't have a template-id. */
12828 /* If the name immediately followed the `template' keyword, then it
12829 is a template-name. However, if the next token is not `<', then
12830 we do not treat it as a template-name, since it is not being used
12831 as part of a template-id. This enables us to handle constructs
12832 like:
12834 template <typename T> struct S { S(); };
12835 template <typename T> S<T>::S();
12837 correctly. We would treat `S' as a template -- if it were `S<T>'
12838 -- but we do not if there is no `<'. */
12842 {
12843 /* In a declaration, in a dependent context, we pretend that the
12844 "template" keyword was present in order to improve error
12845 recovery. For example, given:
12847 template <typename T> void f(T::X<int>);
12849 we want to treat "X<int>" as a template-id. */
12851 && !template_keyword_p
12853 && check_dependency_p
12855 /* Do not do this for dtors (or ctors), since they never
12856 need the template keyword before their name. */
12858 {
12861 /* Explain what went wrong. */
12863 identifier);
12866 /* If parsing tentatively, find the location of the "<" token. */
12869 /* Parse the template arguments so that we can issue error
12870 messages about them. */
12873 /* Skip tokens until we find a good place from which to
12874 continue parsing. */
12879 /* If parsing tentatively, permanently remove the
12880 template argument list. That will prevent duplicate
12881 error messages from being issued about the missing
12882 "template" keyword. */
12888 }
12890 /* If the "template" keyword is present, then there is generally
12891 no point in doing name-lookup, so we just return IDENTIFIER.
12892 But, if the qualifying scope is non-dependent then we can
12893 (and must) do name-lookup normally. */
12899 }
12901 /* Look up the name. */
12903 tag_type,
12906 check_dependency_p,
12910 /* If DECL is a template, then the name was a template-name. */
12912 ;
12913 else
12914 {
12917 /* The standard does not explicitly indicate whether a name that
12918 names a set of overloaded declarations, some of which are
12919 templates, is a template-name. However, such a name should
12920 be a template-name; otherwise, there is no way to form a
12921 template-id for the overloaded templates. */
12929 {
12930 /* The name does not name a template. */
12933 }
12934 }
12936 /* If DECL is dependent, and refers to a function, then just return
12937 its name; we will look it up again during template instantiation. */
12939 {
12943 }
12946 }
12948 /* Parse a template-argument-list.
12950 template-argument-list:
12951 template-argument ... [opt]
12952 template-argument-list , template-argument ... [opt]
12954 Returns a TREE_VEC containing the arguments. */
12956 static tree
12958 {
12963 tree vec;
12970 /* Even if the template-id appears in an integral
12971 constant-expression, the contents of the argument list do
12972 not. */
12978 /* Parse the arguments. */
12979 do
12980 {
12981 tree argument;
12984 /* Consume the comma. */
12987 /* Parse the template-argument. */
12990 /* If the next token is an ellipsis, we're expanding a template
12991 argument pack. */
12993 {
12995 {
12999 }
13000 /* Consume the `...' token. */
13003 /* Make the argument into a TYPE_PACK_EXPANSION or
13004 EXPR_PACK_EXPANSION. */
13006 }
13009 {
13013 {
13016 }
13017 else
13019 }
13021 }
13034 #ifdef ENABLE_CHECKING
13036 #endif
13038 }
13040 /* Parse a template-argument.
13042 template-argument:
13043 assignment-expression
13044 type-id
13045 id-expression
13047 The representation is that of an assignment-expression, type-id, or
13048 id-expression -- except that the qualified id-expression is
13049 evaluated, so that the value returned is either a DECL or an
13050 OVERLOAD.
13052 Although the standard says "assignment-expression", it forbids
13053 throw-expressions or assignments in the template argument.
13054 Therefore, we use "conditional-expression" instead. */
13056 static tree
13058 {
13059 tree argument;
13065 cp_id_kind idk;
13067 /* There's really no way to know what we're looking at, so we just
13068 try each alternative in order.
13070 [temp.arg]
13072 In a template-argument, an ambiguity between a type-id and an
13073 expression is resolved to a type-id, regardless of the form of
13074 the corresponding template-parameter.
13076 Therefore, we try a type-id first. */
13079 /* If there was no error parsing the type-id but the next token is a
13080 '>>', our behavior depends on which dialect of C++ we're
13081 parsing. In C++98, we probably found a typo for '> >'. But there
13082 are type-id which are also valid expressions. For instance:
13084 struct X { int operator >> (int); };
13085 template <int V> struct Foo {};
13086 Foo<X () >> 5> r;
13088 Here 'X()' is a valid type-id of a function type, but the user just
13089 wanted to write the expression "X() >> 5". Thus, we remember that we
13090 found a valid type-id, but we still try to parse the argument as an
13091 expression to see what happens.
13093 In C++0x, the '>>' will be considered two separate '>'
13094 tokens. */
13098 {
13101 }
13102 else
13103 {
13104 /* If the next token isn't a `,' or a `>', then this argument wasn't
13105 really finished. This means that the argument is not a valid
13106 type-id. */
13109 /* If that worked, we're done. */
13112 }
13113 /* We're still not sure what the argument will be. */
13115 /* Try a template. */
13123 /* If the next token isn't a `,' or a `>', then this argument wasn't
13124 really finished. */
13128 {
13129 /* Figure out what is being referred to. If the id-expression
13130 was for a class template specialization, then we will have a
13131 TYPE_DECL at this point. There is no need to do name lookup
13132 at this point in that case. */
13135 none_type,
13144 }
13147 /* It must be a non-type argument. There permitted cases are given
13148 in [temp.arg.nontype]:
13150 -- an integral constant-expression of integral or enumeration
13151 type; or
13153 -- the name of a non-type template-parameter; or
13155 -- the name of an object or function with external linkage...
13157 -- the address of an object or function with external linkage...
13159 -- a pointer to member... */
13160 /* Look for a non-type template parameter. */
13162 {
13174 }
13176 /* If the next token is "&", the argument must be the address of an
13177 object or function with external linkage. */
13180 {
13183 }
13184 /* See if we might have an id-expression. */
13191 {
13194 address_p,
13201 else
13202 {
13203 tree probe;
13206 {
13209 }
13211 /* If we're in a template, we represent a qualified-id referring
13212 to a static data member as a SCOPE_REF even if the scope isn't
13213 dependent so that we can check access control later. */
13218 {
13219 /* A variable without external linkage might still be a
13220 valid constant-expression, so no error is issued here
13221 if the external-linkage check fails. */
13224 }
13226 /* All overloaded functions are allowed; if the external
13227 linkage test does not pass, an error will be issued
13228 later. */
13229 ;
13233 /* A pointer-to-member. */
13234 ;
13236 ;
13237 else
13241 {
13244 tf_warning_or_error);
13246 }
13247 }
13248 }
13249 /* If the argument started with "&", there are no other valid
13250 alternatives at this point. */
13252 {
13255 }
13257 /* If the argument wasn't successfully parsed as a type-id followed
13258 by '>>', the argument can only be a constant expression now.
13259 Otherwise, we try parsing the constant-expression tentatively,
13260 because the argument could really be a type-id. */
13273 /* We did our best to parse the argument as a non type-id, but that
13274 was the only alternative that matched (albeit with a '>' after
13275 it). We can assume it's just a typo from the user, and a
13276 diagnostic will then be issued. */
13278 }
13280 /* Parse an explicit-instantiation.
13282 explicit-instantiation:
13283 template declaration
13285 Although the standard says `declaration', what it really means is:
13287 explicit-instantiation:
13288 template decl-specifier-seq [opt] declarator [opt] ;
13290 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13291 supposed to be allowed. A defect report has been filed about this
13292 issue.
13294 GNU Extension:
13296 explicit-instantiation:
13297 storage-class-specifier template
13298 decl-specifier-seq [opt] declarator [opt] ;
13299 function-specifier template
13300 decl-specifier-seq [opt] declarator [opt] ; */
13302 static void
13304 {
13306 cp_decl_specifier_seq decl_specifiers;
13311 /* Look for an (optional) storage-class-specifier or
13312 function-specifier. */
13314 {
13315 extension_specifier
13318 extension_specifier
13321 }
13323 /* Look for the `template' keyword. */
13325 /* Let the front end know that we are processing an explicit
13326 instantiation. */
13328 /* [temp.explicit] says that we are supposed to ignore access
13329 control while processing explicit instantiation directives. */
13331 /* Parse a decl-specifier-seq. */
13333 CP_PARSER_FLAGS_OPTIONAL,
13336 /* If there was exactly one decl-specifier, and it declared a class,
13337 and there's no declarator, then we have an explicit type
13338 instantiation. */
13340 {
13341 tree type;
13345 /* Turn access control back on for names used during
13346 template instantiation. */
13351 }
13352 else
13353 {
13355 tree decl;
13357 /* Parse the declarator. */
13358 declarator
13368 {
13371 "explicit instantiation shall not use"
13375 "explicit instantiation shall not use"
13380 /* Turn access control back on for names used during
13381 template instantiation. */
13383 /* Do the explicit instantiation. */
13385 }
13386 else
13387 {
13389 /* Skip the body of the explicit instantiation. */
13391 }
13392 }
13393 /* We're done with the instantiation. */
13399 }
13401 /* Parse an explicit-specialization.
13403 explicit-specialization:
13404 template < > declaration
13406 Although the standard says `declaration', what it really means is:
13408 explicit-specialization:
13409 template <> decl-specifier [opt] init-declarator [opt] ;
13410 template <> function-definition
13411 template <> explicit-specialization
13412 template <> template-declaration */
13414 static void
13416 {
13420 /* Look for the `template' keyword. */
13422 /* Look for the `<'. */
13424 /* Look for the `>'. */
13426 /* We have processed another parameter list. */
13428 /* [temp]
13430 A template ... explicit specialization ... shall not have C
13431 linkage. */
13433 {
13435 /* Give it C++ linkage to avoid confusing other parts of the
13436 front end. */
13439 }
13440 else
13442 /* Let the front end know that we are beginning a specialization. */
13444 {
13447 }
13449 /* If the next keyword is `template', we need to figure out whether
13450 or not we're looking a template-declaration. */
13452 {
13457 else
13459 }
13460 else
13461 /* Parse the dependent declaration. */
13467 /* We're done with the specialization. */
13469 /* For the erroneous case of a template with C linkage, we pushed an
13470 implicit C++ linkage scope; exit that scope now. */
13473 /* We're done with this parameter list. */
13475 }
13477 /* Parse a type-specifier.
13479 type-specifier:
13480 simple-type-specifier
13481 class-specifier
13482 enum-specifier
13483 elaborated-type-specifier
13484 cv-qualifier
13486 GNU Extension:
13488 type-specifier:
13489 __complex__
13491 Returns a representation of the type-specifier. For a
13492 class-specifier, enum-specifier, or elaborated-type-specifier, a
13493 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13495 The parser flags FLAGS is used to control type-specifier parsing.
13497 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13498 in a decl-specifier-seq.
13500 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13501 class-specifier, enum-specifier, or elaborated-type-specifier, then
13502 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13503 if a type is declared; 2 if it is defined. Otherwise, it is set to
13504 zero.
13506 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13507 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13508 is set to FALSE. */
13510 static tree
13512 cp_parser_flags flags,
13517 {
13523 /* Assume this type-specifier does not declare a new type. */
13526 /* And that it does not specify a cv-qualifier. */
13529 /* Peek at the next token. */
13532 /* If we're looking at a keyword, we can use that to guide the
13533 production we choose. */
13536 {
13541 /* Look for the enum-specifier. */
13543 /* If that worked, we're done. */
13545 {
13550 type_spec,
13551 token,
13554 }
13555 else
13558 /* Any of these indicate either a class-specifier, or an
13559 elaborated-type-specifier. */
13566 /* Parse tentatively so that we can back up if we don't find a
13567 class-specifier. */
13569 /* Look for the class-specifier. */
13572 /* If that worked, we're done. */
13574 {
13579 type_spec,
13580 token,
13583 }
13585 /* Fall through. */
13586 elaborated_type_specifier:
13587 /* We're declaring (not defining) a class or enum. */
13591 /* Fall through. */
13593 /* Look for an elaborated-type-specifier. */
13594 type_spec
13595 = (cp_parser_elaborated_type_specifier
13598 is_declaration));
13601 type_spec,
13602 token,
13625 /* The `__complex__' keyword is a GNU extension. */
13631 }
13633 /* Handle simple keywords. */
13635 {
13637 {
13640 }
13642 }
13644 /* If we do not already have a type-specifier, assume we are looking
13645 at a simple-type-specifier. */
13647 decl_specs,
13648 flags);
13650 /* If we didn't find a type-specifier, and a type-specifier was not
13651 optional in this context, issue an error message. */
13653 {
13656 }
13659 }
13661 /* Parse a simple-type-specifier.
13663 simple-type-specifier:
13664 :: [opt] nested-name-specifier [opt] type-name
13665 :: [opt] nested-name-specifier template template-id
13666 char
13667 wchar_t
13668 bool
13669 short
13670 int
13671 long
13672 signed
13673 unsigned
13674 float
13675 double
13676 void
13678 C++0x Extension:
13680 simple-type-specifier:
13681 auto
13682 decltype ( expression )
13683 char16_t
13684 char32_t
13685 __underlying_type ( type-id )
13687 GNU Extension:
13689 simple-type-specifier:
13690 __int128
13691 __typeof__ unary-expression
13692 __typeof__ ( type-id )
13694 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13695 appropriately updated. */
13697 static tree
13700 cp_parser_flags flags)
13701 {
13705 /* Peek at the next token. */
13708 /* If we're looking at a keyword, things are easy. */
13710 {
13773 /* Since DR 743, decltype can either be a simple-type-specifier by
13774 itself or begin a nested-name-specifier. Parsing it will replace
13775 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13776 handling below decide what to do. */
13782 /* Consume the `typeof' token. */
13784 /* Parse the operand to `typeof'. */
13786 /* If it is not already a TYPE, take its type. */
13792 token,
13801 token,
13811 token,
13816 }
13818 /* If token is an already-parsed decltype not followed by ::,
13819 it's a simple-type-specifier. */
13822 {
13826 token,
13830 }
13832 /* If the type-specifier was for a built-in type, we're done. */
13834 {
13835 /* Record the type. */
13842 type,
13843 token,
13848 /* Consume the token. */
13851 /* There is no valid C++ program where a non-template type is
13852 followed by a "<". That usually indicates that the user thought
13853 that the type was a template. */
13858 }
13860 /* The type-specifier must be a user-defined type. */
13862 {
13866 /* Don't gobble tokens or issue error messages if this is an
13867 optional type-specifier. */
13871 /* Look for the optional `::' operator. */
13872 global_p
13876 /* Look for the nested-name specifier. */
13877 qualified_p
13885 /* If we have seen a nested-name-specifier, and the next token
13886 is `template', then we are using the template-id production. */
13889 {
13890 /* Look for the template-id. */
13894 none_type,
13896 /* If the template-id did not name a type, we are out of
13897 luck. */
13899 {
13902 }
13903 }
13904 /* Otherwise, look for a type-name. */
13905 else
13907 /* Keep track of all name-lookups performed in class scopes. */
13909 && !global_p
13910 && !qualified_p
13914 /* If it didn't work out, we don't have a TYPE. */
13920 token,
13922 }
13924 /* If we didn't get a type-name, issue an error message. */
13926 {
13929 }
13932 {
13933 /* See if TYPE is an Objective-C type, and if so, parse and
13934 accept any protocol references following it. Do this before
13935 the cp_parser_check_for_invalid_template_id() call, because
13936 Objective-C types can be followed by '<...>' which would
13937 enclose protocol names rather than template arguments, and so
13938 everything is fine. */
13941 {
13945 /* Clobber the "unqualified" type previously entered into
13946 DECL_SPECS with the new, improved protocol-qualified version. */
13951 }
13953 /* There is no valid C++ program where a non-template type is
13954 followed by a "<". That usually indicates that the user
13955 thought that the type was a template. */
13957 none_type,
13959 }
13962 }
13964 /* Parse a type-name.
13966 type-name:
13967 class-name
13968 enum-name
13969 typedef-name
13970 simple-template-id [in c++0x]
13972 enum-name:
13973 identifier
13975 typedef-name:
13976 identifier
13978 Returns a TYPE_DECL for the type. */
13980 static tree
13982 {
13983 tree type_decl;
13985 /* We can't know yet whether it is a class-name or not. */
13987 /* Try a class-name. */
13991 none_type,
13995 /* If it's not a class-name, keep looking. */
13997 {
13999 /* It must be a typedef-name or an enum-name. */
14003 /* It is either a simple-template-id representing an
14004 instantiation of an alias template... */
14008 none_type,
14010 /* Note that this must be an instantiation of an alias template
14011 because [temp.names]/6 says:
14013 A template-id that names an alias template specialization
14014 is a type-name.
14016 Whereas [temp.names]/7 says:
14018 A simple-template-id that names a class template
14019 specialization is a class-name. */
14024 else
14028 /* ... Or a typedef-name or an enum-name. */
14030 }
14033 }
14035 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14037 enum-name:
14038 identifier
14040 typedef-name:
14041 identifier
14043 Returns a TYPE_DECL for the type. */
14045 static tree
14047 {
14048 tree type_decl;
14049 tree identifier;
14056 /* Look up the type-name. */
14060 {
14064 {
14065 /* We have found a type introduced by a using
14066 declaration at class scope that refers to a dependent
14067 type.
14069 using typename :: [opt] nested-name-specifier unqualified-id ;
14070 */
14076 }
14077 }
14081 {
14082 /* See if this is an Objective-C type. */
14087 }
14089 /* Issue an error if we did not find a type-name. */
14091 /* In Objective-C, we have the complication that class names are
14092 normally type names and start declarations (eg, the
14093 "NSObject" in "NSObject *object;"), but can be used in an
14094 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14095 is an expression. So, a classname followed by a dot is not a
14096 valid type-name. */
14099 {
14104 }
14105 /* Remember that the name was used in the definition of the
14106 current class so that we can check later to see if the
14107 meaning would have been different after the class was
14108 entirely defined. */
14114 }
14116 /* Parse an elaborated-type-specifier. Note that the grammar given
14117 here incorporates the resolution to DR68.
14119 elaborated-type-specifier:
14120 class-key :: [opt] nested-name-specifier [opt] identifier
14121 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14122 enum-key :: [opt] nested-name-specifier [opt] identifier
14123 typename :: [opt] nested-name-specifier identifier
14124 typename :: [opt] nested-name-specifier template [opt]
14125 template-id
14127 GNU extension:
14129 elaborated-type-specifier:
14130 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14131 class-key attributes :: [opt] nested-name-specifier [opt]
14132 template [opt] template-id
14133 enum attributes :: [opt] nested-name-specifier [opt] identifier
14135 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14136 declared `friend'. If IS_DECLARATION is TRUE, then this
14137 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14138 something is being declared.
14140 Returns the TYPE specified. */
14142 static tree
14146 {
14148 tree identifier;
14151 tree globalscope;
14154 /* See if we're looking at the `enum' keyword. */
14156 {
14157 /* Consume the `enum' token. */
14159 /* Remember that it's an enumeration type. */
14161 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14162 enums) is used here. */
14165 {
14169 /* Consume the `struct' or `class' and parse it anyway. */
14171 }
14172 /* Parse the attributes. */
14174 }
14175 /* Or, it might be `typename'. */
14177 RID_TYPENAME))
14178 {
14179 /* Consume the `typename' token. */
14181 /* Remember that it's a `typename' type. */
14183 }
14184 /* Otherwise it must be a class-key. */
14185 else
14186 {
14190 /* Parse the attributes. */
14192 }
14194 /* Look for the `::' operator. */
14197 /* Look for the nested-name-specifier. */
14199 {
14204 is_declaration))
14206 }
14207 else
14208 /* Even though `typename' is not present, the proposed resolution
14209 to Core Issue 180 says that in `class A<T>::B', `B' should be
14210 considered a type-name, even if `A<T>' is dependent. */
14215 is_declaration);
14216 /* For everything but enumeration types, consider a template-id.
14217 For an enumeration type, consider only a plain identifier. */
14219 {
14221 tree decl;
14223 /* Allow the `template' keyword. */
14225 /* If we didn't see `template', we don't know if there's a
14226 template-id or not. */
14229 /* Parse the template-id. */
14233 tag_type,
14234 is_declaration);
14235 /* If we didn't find a template-id, look for an ordinary
14236 identifier. */
14238 ;
14239 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14240 in effect, then we must assume that, upon instantiation, the
14241 template will correspond to a class. */
14245 typename_type,
14247 /* If the `typename' keyword is in effect and DECL is not a type
14248 decl. Then type is non existant. */
14251 else
14254 }
14257 {
14262 {
14265 }
14267 /* For a `typename', we needn't call xref_tag. */
14271 identifier,
14273 /* Look up a qualified name in the usual way. */
14275 {
14276 tree decl;
14277 tree ambiguous_decls;
14280 tag_type,
14287 /* If the lookup was ambiguous, an error will already have been
14288 issued. */
14292 /* If we are parsing friend declaration, DECL may be a
14293 TEMPLATE_DECL tree node here. However, we need to check
14294 whether this TEMPLATE_DECL results in valid code. Consider
14295 the following example:
14297 namespace N {
14298 template <class T> class C {};
14299 }
14300 class X {
14301 template <class T> friend class N::C; // #1, valid code
14302 };
14303 template <class T> class Y {
14304 friend class N::C; // #2, invalid code
14305 };
14307 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14308 name lookup of `N::C'. We see that friend declaration must
14309 be template for the code to be valid. Note that
14310 processing_template_decl does not work here since it is
14311 always 1 for the above two cases. */
14313 decl = (cp_parser_maybe_treat_template_as_class
14318 {
14321 identifier,
14324 }
14327 {
14331 allow_template);
14335 }
14337 /* Forward declarations of nested types, such as
14339 class C1::C2;
14340 class C1::C2::C3;
14342 are invalid unless all components preceding the final '::'
14343 are complete. If all enclosing types are complete, these
14344 declarations become merely pointless.
14346 Invalid forward declarations of nested types are errors
14347 caught elsewhere in parsing. Those that are pointless arrive
14348 here. */
14355 }
14356 else
14357 {
14358 /* An elaborated-type-specifier sometimes introduces a new type and
14359 sometimes names an existing type. Normally, the rule is that it
14360 introduces a new type only if there is not an existing type of
14361 the same name already in scope. For example, given:
14363 struct S {};
14364 void f() { struct S s; }
14366 the `struct S' in the body of `f' is the same `struct S' as in
14367 the global scope; the existing definition is used. However, if
14368 there were no global declaration, this would introduce a new
14369 local class named `S'.
14371 An exception to this rule applies to the following code:
14373 namespace N { struct S; }
14375 Here, the elaborated-type-specifier names a new type
14376 unconditionally; even if there is already an `S' in the
14377 containing scope this declaration names a new type.
14378 This exception only applies if the elaborated-type-specifier
14379 forms the complete declaration:
14381 [class.name]
14383 A declaration consisting solely of `class-key identifier ;' is
14384 either a redeclaration of the name in the current scope or a
14385 forward declaration of the identifier as a class name. It
14386 introduces the name into the current scope.
14388 We are in this situation precisely when the next token is a `;'.
14390 An exception to the exception is that a `friend' declaration does
14391 *not* name a new type; i.e., given:
14393 struct S { friend struct T; };
14395 `T' is not a new type in the scope of `S'.
14397 Also, `new struct S' or `sizeof (struct S)' never results in the
14398 definition of a new type; a new type can only be declared in a
14399 declaration context. */
14401 tag_scope ts;
14405 /* Friends have special name lookup rules. */
14409 CPP_SEMICOLON))
14410 /* This is a `class-key identifier ;' */
14412 else
14415 template_p =
14419 /* An unqualified name was used to reference this type, so
14420 there were no qualifying templates. */
14427 }
14428 }
14433 /* Allow attributes on forward declarations of classes. */
14435 {
14445 else
14448 }
14451 {
14452 /* Indicate whether this class was declared as a `class' or as a
14453 `struct'. */
14457 }
14459 /* A "<" cannot follow an elaborated type specifier. If that
14460 happens, the user was probably trying to form a template-id. */
14465 }
14467 /* Parse an enum-specifier.
14469 enum-specifier:
14470 enum-head { enumerator-list [opt] }
14471 enum-head { enumerator-list , } [C++0x]
14473 enum-head:
14474 enum-key identifier [opt] enum-base [opt]
14475 enum-key nested-name-specifier identifier enum-base [opt]
14477 enum-key:
14478 enum
14479 enum class [C++0x]
14480 enum struct [C++0x]
14482 enum-base: [C++0x]
14483 : type-specifier-seq
14485 opaque-enum-specifier:
14486 enum-key identifier enum-base [opt] ;
14488 GNU Extensions:
14489 enum-key attributes[opt] identifier [opt] enum-base [opt]
14490 { enumerator-list [opt] }attributes[opt]
14491 enum-key attributes[opt] identifier [opt] enum-base [opt]
14492 { enumerator-list, }attributes[opt] [C++0x]
14494 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14495 if the token stream isn't an enum-specifier after all. */
14497 static tree
14499 {
14500 tree identifier;
14502 tree prev_scope;
14504 tree attributes;
14517 /* Parse tentatively so that we can back up if we don't find a
14518 enum-specifier. */
14521 /* Caller guarantees that the current token is 'enum', an identifier
14522 possibly follows, and the token after that is an opening brace.
14523 If we don't have an identifier, fabricate an anonymous name for
14524 the enumeration being defined. */
14527 /* Parse the "class" or "struct", which indicates a scoped
14528 enumeration type in C++0x. */
14531 {
14535 /* Consume the `struct' or `class' token. */
14539 }
14543 /* Clear the qualification. */
14548 /* Figure out in what scope the declaration is being placed. */
14554 nested_name_specifier
14562 {
14563 tree name;
14567 enum_type,
14572 input_location);
14574 {
14577 {
14578 /* Are template enums allowed in ISO? */
14582 /* ignore a typename reference, for it will be solved by name
14583 in start_enum. */
14585 }
14586 }
14587 else
14590 }
14591 else
14592 {
14595 else
14596 {
14599 }
14600 }
14603 /* Check for the `:' that denotes a specified underlying type in C++0x.
14604 Note that a ':' could also indicate a bitfield width, however. */
14606 {
14607 cp_decl_specifier_seq type_specifiers;
14609 /* Consume the `:'. */
14612 /* Parse the type-specifier-seq. */
14617 /* At this point this is surely not elaborated type specifier. */
14626 /* If that didn't work, stop. */
14628 {
14633 }
14634 }
14636 /* Look for the `{' but don't consume it yet. */
14638 {
14640 {
14643 {
14646 }
14647 }
14648 /* An opaque-enum-specifier must have a ';' here. */
14651 {
14654 {
14657 }
14658 }
14659 }
14665 {
14667 {
14671 }
14673 {
14675 }
14676 }
14678 /* Issue an error message if type-definitions are forbidden here. */
14681 else
14682 /* Create the new type. We do this before consuming the opening
14683 brace so the enum will be recorded as being on the line of its
14684 tag (or the 'enum' keyword, if there is no tag). */
14688 /* If the next token is not '{' it is an opaque-enum-specifier or an
14689 elaborated-type-specifier. */
14691 {
14694 {
14695 /* The following catches invalid code such as:
14696 enum class S<int>::E { A, B, C }; */
14703 /* If that scope does not contain the scope in which the
14704 class was originally declared, the program is invalid. */
14706 {
14709 "declaration of %qD in namespace %qD which does not "
14712 else
14717 }
14718 }
14723 /* Consume the opening brace. */
14730 {
14734 }
14735 else
14736 {
14741 }
14745 /* If the next token is not '}', then there are some enumerators. */
14749 /* Consume the final '}'. */
14755 }
14756 else
14757 {
14758 /* If a ';' follows, then it is an opaque-enum-specifier
14759 and additional restrictions apply. */
14761 {
14768 }
14769 }
14771 /* Look for trailing attributes to apply to this enumeration, and
14772 apply them if appropriate. */
14774 {
14778 trailing_attr,
14780 }
14782 /* Finish up the enumeration. */
14784 {
14789 }
14792 {
14794 {
14797 }
14799 {
14801 }
14802 }
14803 out:
14806 }
14808 /* Parse an enumerator-list. The enumerators all have the indicated
14809 TYPE.
14811 enumerator-list:
14812 enumerator-definition
14813 enumerator-list , enumerator-definition */
14815 static void
14817 {
14819 {
14820 /* Parse an enumerator-definition. */
14823 /* If the next token is not a ',', we've reached the end of
14824 the list. */
14827 /* Otherwise, consume the `,' and keep going. */
14829 /* If the next token is a `}', there is a trailing comma. */
14831 {
14836 }
14837 }
14838 }
14840 /* Parse an enumerator-definition. The enumerator has the indicated
14841 TYPE.
14843 enumerator-definition:
14844 enumerator
14845 enumerator = constant-expression
14847 enumerator:
14848 identifier */
14850 static void
14852 {
14853 tree identifier;
14854 tree value;
14855 location_t loc;
14857 /* Save the input location because we are interested in the location
14858 of the identifier and not the location of the explicit value. */
14861 /* Look for the identifier. */
14866 /* If the next token is an '=', then there is an explicit value. */
14868 {
14869 /* Consume the `=' token. */
14871 /* Parse the value. */
14874 NULL);
14875 }
14876 else
14879 /* If we are processing a template, make sure the initializer of the
14880 enumerator doesn't contain any bare template parameter pack. */
14884 /* integral_constant_value will pull out this expression, so make sure
14885 it's folded as appropriate. */
14888 /* Create the enumerator. */
14890 }
14892 /* Parse a namespace-name.
14894 namespace-name:
14895 original-namespace-name
14896 namespace-alias
14898 Returns the NAMESPACE_DECL for the namespace. */
14900 static tree
14902 {
14903 tree identifier;
14904 tree namespace_decl;
14908 /* Get the name of the namespace. */
14913 /* Look up the identifier in the currently active scope. Look only
14914 for namespaces, due to:
14916 [basic.lookup.udir]
14918 When looking up a namespace-name in a using-directive or alias
14919 definition, only namespace names are considered.
14921 And:
14923 [basic.lookup.qual]
14925 During the lookup of a name preceding the :: scope resolution
14926 operator, object, function, and enumerator names are ignored.
14928 (Note that cp_parser_qualifying_entity only calls this
14929 function if the token after the name is the scope resolution
14930 operator.) */
14932 none_type,
14938 /* If it's not a namespace, issue an error. */
14941 {
14946 }
14949 }
14951 /* Parse a namespace-definition.
14953 namespace-definition:
14954 named-namespace-definition
14955 unnamed-namespace-definition
14957 named-namespace-definition:
14958 original-namespace-definition
14959 extension-namespace-definition
14961 original-namespace-definition:
14962 namespace identifier { namespace-body }
14964 extension-namespace-definition:
14965 namespace original-namespace-name { namespace-body }
14967 unnamed-namespace-definition:
14968 namespace { namespace-body } */
14970 static void
14972 {
14978 {
14982 }
14983 else
14986 /* Look for the `namespace' keyword. */
14989 /* Get the name of the namespace. We do not attempt to distinguish
14990 between an original-namespace-definition and an
14991 extension-namespace-definition at this point. The semantic
14992 analysis routines are responsible for that. */
14995 else
14998 /* Parse any specified attributes. */
15001 /* Look for the `{' to start the namespace. */
15003 /* Start the namespace. */
15006 /* "inline namespace" is equivalent to a stub namespace definition
15007 followed by a strong using directive. */
15009 {
15011 /* Set up namespace association. */
15015 /* Import the contents of the inline namespace. */
15019 }
15023 /* Parse the body of the namespace. */
15029 /* Finish the namespace. */
15031 /* Look for the final `}'. */
15033 }
15035 /* Parse a namespace-body.
15037 namespace-body:
15038 declaration-seq [opt] */
15040 static void
15042 {
15044 }
15046 /* Parse a namespace-alias-definition.
15048 namespace-alias-definition:
15049 namespace identifier = qualified-namespace-specifier ; */
15051 static void
15053 {
15054 tree identifier;
15055 tree namespace_specifier;
15059 /* Look for the `namespace' keyword. */
15061 /* Look for the identifier. */
15065 /* Look for the `=' token. */
15068 {
15070 /* Skip the definition. */
15075 }
15077 /* Look for the qualified-namespace-specifier. */
15078 namespace_specifier
15080 /* Look for the `;' token. */
15083 /* Register the alias in the symbol table. */
15085 }
15087 /* Parse a qualified-namespace-specifier.
15089 qualified-namespace-specifier:
15090 :: [opt] nested-name-specifier [opt] namespace-name
15092 Returns a NAMESPACE_DECL corresponding to the specified
15093 namespace. */
15095 static tree
15097 {
15098 /* Look for the optional `::'. */
15102 /* Look for the optional nested-name-specifier. */
15110 }
15112 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15113 access declaration.
15115 using-declaration:
15116 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15117 using :: unqualified-id ;
15119 access-declaration:
15120 qualified-id ;
15122 */
15124 static bool
15127 {
15131 tree decl;
15132 tree identifier;
15133 tree qscope;
15138 {
15141 }
15142 else
15143 {
15144 /* Look for the `using' keyword. */
15147 /* Peek at the next token. */
15149 /* See if it's `typename'. */
15151 {
15152 /* Remember that we've seen it. */
15154 /* Consume the `typename' token. */
15156 }
15157 }
15159 /* Look for the optional global scope qualification. */
15160 global_scope_p
15165 /* If we saw `typename', or didn't see `::', then there must be a
15166 nested-name-specifier present. */
15172 /* Otherwise, we could be in either of the two productions. In that
15173 case, treat the nested-name-specifier as optional. */
15174 else
15184 /* Something has already gone wrong; there's no need to parse
15185 further. Since an error has occurred, the return value of
15186 cp_parser_parse_definitely will be false, as required. */
15190 /* Parse the unqualified-id. */
15198 {
15203 }
15205 /* The function we call to handle a using-declaration is different
15206 depending on what scope we are in. */
15208 ;
15211 /* [namespace.udecl]
15213 A using declaration shall not name a template-id. */
15216 else
15217 {
15219 {
15220 /* Create the USING_DECL. */
15228 else
15229 /* Add it to the list of members in this class. */
15231 }
15232 else
15233 {
15235 identifier,
15245 else
15247 }
15248 }
15250 /* Look for the final `;'. */
15255 "access declarations are deprecated "
15256 "in favour of using-declarations; "
15260 }
15262 /* Parse an alias-declaration.
15264 alias-declaration:
15265 using identifier attribute-specifier-seq [opt] = type-id */
15267 static tree
15269 {
15271 location_t id_location;
15273 cp_decl_specifier_seq decl_specs;
15277 /* Look for the `using' keyword. */
15278 cp_token *using_token
15298 /* Now we are going to parse the type-id of the declaration. */
15300 /*
15301 [dcl.type]/3 says:
15303 "A type-specifier-seq shall not define a class or enumeration
15304 unless it appears in the type-id of an alias-declaration (7.1.3) that
15305 is not the declaration of a template-declaration."
15307 In other words, if we currently are in an alias template, the
15308 type-id should not define a type.
15310 So let's set parser->type_definition_forbidden_message in that
15311 case; cp_parser_check_type_definition (called by
15312 cp_parser_class_specifier) will then emit an error if a type is
15313 defined in the type-id. */
15315 {
15319 }
15323 /* Restore the error message if need be. */
15332 /* A typedef-name can also be introduced by an alias-declaration. The
15333 identifier following the using keyword becomes a typedef-name. It has
15334 the same semantics as if it were introduced by the typedef
15335 specifier. In particular, it does not define a new type and it shall
15336 not appear in the type-id. */
15341 {
15344 ds_attribute,
15345 attrs_token);
15346 }
15348 ds_typedef,
15349 using_token);
15351 ds_alias,
15352 using_token);
15361 else
15372 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15373 added into the symbol table; otherwise, return the TYPE_DECL. */
15377 {
15381 }
15384 }
15386 /* Parse a using-directive.
15388 using-directive:
15389 using namespace :: [opt] nested-name-specifier [opt]
15390 namespace-name ; */
15392 static void
15394 {
15395 tree namespace_decl;
15396 tree attribs;
15398 /* Look for the `using' keyword. */
15400 /* And the `namespace' keyword. */
15402 /* Look for the optional `::' operator. */
15404 /* And the optional nested-name-specifier. */
15410 /* Get the namespace being used. */
15412 /* And any specified attributes. */
15414 /* Update the symbol table. */
15416 /* Look for the final `;'. */
15418 }
15420 /* Parse an asm-definition.
15422 asm-definition:
15423 asm ( string-literal ) ;
15425 GNU Extension:
15427 asm-definition:
15428 asm volatile [opt] ( string-literal ) ;
15429 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15430 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15431 : asm-operand-list [opt] ) ;
15432 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15433 : asm-operand-list [opt]
15434 : asm-clobber-list [opt] ) ;
15435 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15436 : asm-clobber-list [opt]
15437 : asm-goto-list ) ; */
15439 static void
15441 {
15442 tree string;
15447 tree asm_stmt;
15455 /* Look for the `asm' keyword. */
15457 /* See if the next token is `volatile'. */
15460 {
15461 /* Remember that we saw the `volatile' keyword. */
15463 /* Consume the token. */
15465 }
15469 {
15470 /* Remember that we saw the `goto' keyword. */
15472 /* Consume the token. */
15474 }
15475 /* Look for the opening `('. */
15478 /* Look for the string. */
15481 {
15485 }
15487 /* If we're allowing GNU extensions, check for the extended assembly
15488 syntax. Unfortunately, the `:' tokens need not be separated by
15489 a space in C, and so, for compatibility, we tolerate that here
15490 too. Doing that means that we have to treat the `::' operator as
15491 two `:' tokens. */
15496 {
15501 /* The extended syntax was used. */
15504 /* Look for outputs. */
15506 {
15507 /* Consume the `:'. */
15509 /* Parse the output-operands. */
15511 CPP_COLON)
15513 CPP_SCOPE)
15515 CPP_CLOSE_PAREN)
15521 }
15522 /* If the next token is `::', there are no outputs, and the
15523 next token is the beginning of the inputs. */
15525 /* The inputs are coming next. */
15528 /* Look for inputs. */
15531 {
15532 /* Consume the `:' or `::'. */
15534 /* Parse the output-operands. */
15536 CPP_COLON)
15538 CPP_SCOPE)
15540 CPP_CLOSE_PAREN))
15545 }
15547 /* The clobbers are coming next. */
15550 /* Look for clobbers. */
15553 {
15555 /* Consume the `:' or `::'. */
15557 /* Parse the clobbers. */
15559 CPP_COLON)
15561 CPP_CLOSE_PAREN))
15563 }
15566 /* The labels are coming next. */
15569 /* Look for labels. */
15572 {
15574 /* Consume the `:' or `::'. */
15576 /* Parse the labels. */
15578 }
15582 }
15586 /* Look for the closing `)'. */
15594 {
15595 /* Create the ASM_EXPR. */
15597 {
15600 /* If the extended syntax was not used, mark the ASM_EXPR. */
15602 {
15608 }
15609 }
15610 else
15612 }
15613 }
15615 /* Declarators [gram.dcl.decl] */
15617 /* Parse an init-declarator.
15619 init-declarator:
15620 declarator initializer [opt]
15622 GNU Extension:
15624 init-declarator:
15625 declarator asm-specification [opt] attributes [opt] initializer [opt]
15627 function-definition:
15628 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15629 function-body
15630 decl-specifier-seq [opt] declarator function-try-block
15632 GNU Extension:
15634 function-definition:
15635 __extension__ function-definition
15637 TM Extension:
15639 function-definition:
15640 decl-specifier-seq [opt] declarator function-transaction-block
15642 The DECL_SPECIFIERS apply to this declarator. Returns a
15643 representation of the entity declared. If MEMBER_P is TRUE, then
15644 this declarator appears in a class scope. The new DECL created by
15645 this declarator is returned.
15647 The CHECKS are access checks that should be performed once we know
15648 what entity is being declared (and, therefore, what classes have
15649 befriended it).
15651 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15652 for a function-definition here as well. If the declarator is a
15653 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15654 be TRUE upon return. By that point, the function-definition will
15655 have been completely parsed.
15657 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15658 is FALSE.
15660 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15661 parsed declaration if it is an uninitialized single declarator not followed
15662 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15663 if present, will not be consumed. If returned, this declarator will be
15664 created with SD_INITIALIZED but will not call cp_finish_decl. */
15666 static tree
15675 {
15679 tree prefix_attributes;
15681 tree asm_specification;
15682 tree initializer;
15684 tree scope;
15686 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15687 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15688 "(...)". */
15697 /* Gather the attributes that were provided with the
15698 decl-specifiers. */
15701 /* Assume that this is not the declarator for a function
15702 definition. */
15706 /* Defer access checks while parsing the declarator; we cannot know
15707 what names are accessible until we know what is being
15708 declared. */
15711 /* Parse the declarator. */
15713 declarator
15717 member_p);
15718 /* Gather up the deferred checks. */
15721 /* If the DECLARATOR was erroneous, there's no need to go
15722 further. */
15726 /* Check that the number of template-parameter-lists is OK. */
15736 /* Figure out what scope the entity declared by the DECLARATOR is
15737 located in. `grokdeclarator' sometimes changes the scope, so
15738 we compute it now. */
15741 /* Perform any lookups in the declared type which were thought to be
15742 dependent, but are not in the scope of the declarator. */
15743 decl_specifiers->type
15746 /* If we're allowing GNU extensions, look for an
15747 asm-specification. */
15749 {
15750 /* Look for an asm-specification. */
15753 }
15754 else
15757 /* Look for attributes. */
15761 /* Peek at the next token. */
15763 /* Check to see if the token indicates the start of a
15764 function-definition. */
15767 {
15769 {
15770 /* If a function-definition should not appear here, issue an
15771 error message. */
15775 }
15776 else
15777 {
15778 location_t func_brace_location
15781 /* Neither attributes nor an asm-specification are allowed
15782 on a function-definition. */
15785 "an asm-specification is not allowed "
15790 /* This is a function-definition. */
15793 /* Parse the function definition. */
15796 decl_specifiers,
15797 declarator,
15798 prefix_attributes);
15799 else
15800 decl
15801 = (cp_parser_function_definition_from_specifiers_and_declarator
15805 {
15806 /* This is where the prologue starts... */
15809 }
15812 }
15813 }
15815 /* [dcl.dcl]
15817 Only in function declarations for constructors, destructors, and
15818 type conversions can the decl-specifier-seq be omitted.
15820 We explicitly postpone this check past the point where we handle
15821 function-definitions because we tolerate function-definitions
15822 that are missing their return types in some modes. */
15824 {
15828 }
15830 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15834 {
15842 {
15848 }
15849 }
15850 else
15851 {
15852 /* If the init-declarator isn't initialized and isn't followed by a
15853 `,' or `;', it's not a valid init-declarator. */
15856 {
15859 else
15860 {
15863 }
15864 }
15867 }
15869 /* Because start_decl has side-effects, we should only call it if we
15870 know we're going ahead. By this point, we know that we cannot
15871 possibly be looking at any other construct. */
15874 /* If the decl specifiers were bad, issue an error now that we're
15875 sure this was intended to be a declarator. Then continue
15876 declaring the variable(s), as int, to try to cut down on further
15877 errors. */
15880 {
15883 }
15885 /* Check to see whether or not this declaration is a friend. */
15888 /* Enter the newly declared entry in the symbol table. If we're
15889 processing a declaration in a class-specifier, we wait until
15890 after processing the initializer. */
15892 {
15899 /* Adjust location of decl if declarator->id_loc is more appropriate:
15900 set, and decl wasn't merged with another decl, in which case its
15901 location would be different from input_location, and more accurate. */
15906 }
15908 /* Enter the SCOPE. That way unqualified names appearing in the
15909 initializer will be looked up in SCOPE. */
15912 /* Perform deferred access control checks, now that we know in which
15913 SCOPE the declared entity resides. */
15915 {
15918 /* If the entity being declared is a function, pretend that we
15919 are in its scope. If it is a `friend', it may have access to
15920 things that would not otherwise be accessible. */
15922 {
15925 }
15927 /* Perform access checks for template parameters. */
15930 /* Perform the access control checks for the declarator and the
15931 decl-specifiers. */
15934 /* Restore the saved value. */
15937 }
15939 /* Parse the initializer. */
15944 {
15946 {
15950 else
15951 {
15952 /* If the declaration was erroneous, we don't really
15953 know what the user intended, so just silently
15954 consume the initializer. */
15962 }
15963 }
15964 else
15965 {
15966 /* We want to record the extra mangling scope for in-class
15967 initializers of class members and initializers of static data
15968 member templates. The former involves deferring
15969 parsing of the initializer until end of class as with default
15970 arguments. So right here we only handle the latter. */
15980 }
15981 }
15983 /* The old parser allows attributes to appear after a parenthesized
15984 initializer. Mark Mitchell proposed removing this functionality
15985 on the GCC mailing lists on 2002-08-13. This parser accepts the
15986 attributes -- but ignores them. */
15993 /* For an in-class declaration, use `grokfield' to create the
15994 declaration. */
15996 {
15998 {
16001 }
16005 prefix_attributes);
16008 }
16010 /* Finish processing the declaration. But, skip member
16011 declarations. */
16013 {
16016 asm_specification,
16017 /* If the initializer is in parentheses, then this is
16018 a direct-initialization, which means that an
16019 `explicit' constructor is OK. Otherwise, an
16020 `explicit' constructor cannot be used. */
16023 }
16026 /* Core issue #226 (C++0x only): A default template-argument
16027 shall not be specified in a friend class template
16028 declaration. */
16036 }
16038 /* Parse a declarator.
16040 declarator:
16041 direct-declarator
16042 ptr-operator declarator
16044 abstract-declarator:
16045 ptr-operator abstract-declarator [opt]
16046 direct-abstract-declarator
16048 GNU Extensions:
16050 declarator:
16051 attributes [opt] direct-declarator
16052 attributes [opt] ptr-operator declarator
16054 abstract-declarator:
16055 attributes [opt] ptr-operator abstract-declarator [opt]
16056 attributes [opt] direct-abstract-declarator
16058 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16059 detect constructor, destructor or conversion operators. It is set
16060 to -1 if the declarator is a name, and +1 if it is a
16061 function. Otherwise it is set to zero. Usually you just want to
16062 test for >0, but internally the negative value is used.
16064 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16065 a decl-specifier-seq unless it declares a constructor, destructor,
16066 or conversion. It might seem that we could check this condition in
16067 semantic analysis, rather than parsing, but that makes it difficult
16068 to handle something like `f()'. We want to notice that there are
16069 no decl-specifiers, and therefore realize that this is an
16070 expression, not a declaration.)
16072 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16073 the declarator is a direct-declarator of the form "(...)".
16075 MEMBER_P is true iff this declarator is a member-declarator. */
16079 cp_parser_declarator_kind dcl_kind,
16083 {
16086 cp_cv_quals cv_quals;
16087 tree class_type;
16090 /* Assume this is not a constructor, destructor, or type-conversion
16091 operator. */
16098 /* Check for the ptr-operator production. */
16100 /* Parse the ptr-operator. */
16106 /* If that worked, then we have a ptr-operator. */
16108 {
16109 /* If a ptr-operator was found, then this declarator was not
16110 parenthesized. */
16113 /* The dependent declarator is optional if we are parsing an
16114 abstract-declarator. */
16118 /* Parse the dependent declarator. */
16124 /* If we are parsing an abstract-declarator, we must handle the
16125 case where the dependent declarator is absent. */
16130 declarator = cp_parser_make_indirect_declarator
16132 }
16133 /* Everything else is a direct-declarator. */
16134 else
16135 {
16138 CPP_OPEN_PAREN);
16140 ctor_dtor_or_conv_p,
16141 member_p);
16142 }
16147 }
16149 /* Parse a direct-declarator or direct-abstract-declarator.
16151 direct-declarator:
16152 declarator-id
16153 direct-declarator ( parameter-declaration-clause )
16154 cv-qualifier-seq [opt]
16155 exception-specification [opt]
16156 direct-declarator [ constant-expression [opt] ]
16157 ( declarator )
16159 direct-abstract-declarator:
16160 direct-abstract-declarator [opt]
16161 ( parameter-declaration-clause )
16162 cv-qualifier-seq [opt]
16163 exception-specification [opt]
16164 direct-abstract-declarator [opt] [ constant-expression [opt] ]
16165 ( abstract-declarator )
16167 Returns a representation of the declarator. DCL_KIND is
16168 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
16169 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
16170 we are parsing a direct-declarator. It is
16171 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
16172 of ambiguity we prefer an abstract declarator, as per
16173 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
16174 cp_parser_declarator. */
16178 cp_parser_declarator_kind dcl_kind,
16181 {
16191 {
16192 /* Peek at the next token. */
16195 {
16196 /* This is either a parameter-declaration-clause, or a
16197 parenthesized declarator. When we know we are parsing a
16198 named declarator, it must be a parenthesized declarator
16199 if FIRST is true. For instance, `(int)' is a
16200 parameter-declaration-clause, with an omitted
16201 direct-abstract-declarator. But `((*))', is a
16202 parenthesized abstract declarator. Finally, when T is a
16203 template parameter `(T)' is a
16204 parameter-declaration-clause, and not a parenthesized
16205 named declarator.
16207 We first try and parse a parameter-declaration-clause,
16208 and then try a nested declarator (if FIRST is true).
16210 It is not an error for it not to be a
16211 parameter-declaration-clause, even when FIRST is
16212 false. Consider,
16214 int i (int);
16215 int i (3);
16217 The first is the declaration of a function while the
16218 second is the definition of a variable, including its
16219 initializer.
16221 Having seen only the parenthesis, we cannot know which of
16222 these two alternatives should be selected. Even more
16223 complex are examples like:
16225 int i (int (a));
16226 int i (int (3));
16228 The former is a function-declaration; the latter is a
16229 variable initialization.
16231 Thus again, we try a parameter-declaration-clause, and if
16232 that fails, we back out and return. */
16235 {
16236 tree params;
16239 tree t;
16241 /* In a member-declarator, the only valid interpretation
16242 of a parenthesis is the start of a
16243 parameter-declaration-clause. (It is invalid to
16244 initialize a static data member with a parenthesized
16245 initializer; only the "=" form of initialization is
16246 permitted.) */
16250 /* Consume the `('. */
16253 {
16254 /* If this is going to be an abstract declarator, we're
16255 in a declarator and we can't have default args. */
16258 }
16260 /* Inside the function parameter list, surrounding
16261 template-parameter-lists do not apply. */
16262 saved_num_template_parameter_lists
16268 /* Parse the parameter-declaration-clause. */
16271 parser->num_template_parameter_lists
16274 /* Consume the `)'. */
16277 /* If all went well, parse the cv-qualifier-seq and the
16278 exception-specification. */
16280 {
16281 cp_cv_quals cv_quals;
16282 cp_virt_specifiers virt_specifiers;
16283 tree exception_specification;
16284 tree late_return;
16285 tree attrs;
16293 /* Parse the cv-qualifier-seq. */
16295 /* And the exception-specification. */
16296 exception_specification
16301 late_return = (cp_parser_late_return_type_opt
16304 /* Parse the virt-specifier-seq. */
16307 /* Create the function-declarator. */
16309 params,
16310 cv_quals,
16311 virt_specifiers,
16312 exception_specification,
16313 late_return);
16315 /* Any subsequent parameter lists are to do with
16316 return type, so are not those of the declared
16317 function. */
16319 }
16321 /* Remove the function parms from scope. */
16327 /* Repeat the main loop. */
16329 }
16331 /* If this is the first, we can try a parenthesized
16332 declarator. */
16334 {
16340 /* Consume the `('. */
16342 /* Parse the nested declarator. */
16345 declarator
16348 member_p);
16351 /* Expect a `)'. */
16358 }
16359 /* Otherwise, we must be done. */
16360 else
16362 }
16366 {
16367 /* Parse an array-declarator. */
16376 /* Consume the `['. */
16378 /* Peek at the next token. */
16380 /* If the next token is `]', then there is no
16381 constant-expression. */
16383 {
16386 bounds
16396 {
16397 /* Normally, the array bound must be an integral constant
16398 expression. However, as an extension, we allow VLAs
16399 in function scopes as long as they aren't part of a
16400 parameter declaration. */
16404 }
16406 {
16407 /* Remember this wasn't a constant-expression. */
16410 }
16411 }
16412 else
16414 /* Look for the closing `]'. */
16416 {
16419 }
16424 }
16426 {
16427 {
16428 tree qualifying_scope;
16429 tree unqualified_name;
16430 tree attrs;
16431 special_function_kind sfk;
16436 /* Parse a declarator-id */
16439 {
16442 /* If we see an ellipsis, we should be looking at a
16443 parameter pack. */
16445 {
16446 /* Consume the `...' */
16450 }
16451 }
16454 unqualified_name
16458 {
16462 {
16463 /* Check whether an error occurred. */
16466 /* We already consumed the ellipsis to mark a
16467 parameter pack, but we have no way to report it,
16468 so abort the tentative parse. We will be exiting
16469 immediately anyway. */
16471 }
16472 else
16478 && (qualifying_scope
16481 {
16484 }
16485 }
16490 {
16495 }
16501 {
16502 /* In the declaration of a member of a template class
16503 outside of the class itself, the SCOPE will sometimes
16504 be a TYPENAME_TYPE. For example, given:
16506 template <typename T>
16507 int S<T>::R::i = 3;
16509 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16510 this context, we must resolve S<T>::R to an ordinary
16511 type, rather than a typename type.
16513 The reason we normally avoid resolving TYPENAME_TYPEs
16514 is that a specialization of `S' might render
16515 `S<T>::R' not a type. However, if `S' is
16516 specialized, then this `i' will not be used, so there
16517 is no harm in resolving the types here. */
16518 tree type;
16520 /* Resolve the TYPENAME_TYPE. */
16523 /* If that failed, the declarator is invalid. */
16525 {
16528 "cannot define member of dependent typedef "
16530 else
16535 }
16537 }
16542 {
16543 tree class_type;
16548 else
16552 {
16555 {
16558 {
16562 "use %<%T::%D%> instead of %<%T::%D%> to "
16564 class_type,
16569 }
16570 else
16572 }
16573 else
16574 {
16575 /* We do not attempt to print the declarator
16576 here because we do not have enough
16577 information about its original syntactic
16578 form. */
16582 }
16583 }
16586 {
16592 for an anonymous type, even if the type
16593 got a name for linkage purposes. */
16596 class_type))
16597 {
16600 }
16608 }
16609 }
16611 unqualified_name,
16612 sfk);
16619 }
16621 handle_declarator:;
16624 /* Any names that appear after the declarator-id for a
16625 member are looked up in the containing scope. */
16630 /* Default args are only allowed on function
16631 declarations. */
16633 else
16637 }
16638 /* We're done. */
16639 else
16641 }
16643 /* For an abstract declarator, we might wind up with nothing at this
16644 point. That's an error; the declarator is not optional. */
16648 /* If we entered a scope, we must exit it now. */
16656 }
16658 /* Parse a ptr-operator.
16660 ptr-operator:
16661 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16662 * cv-qualifier-seq [opt]
16663 &
16664 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16665 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16667 GNU Extension:
16669 ptr-operator:
16670 & cv-qualifier-seq [opt]
16672 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16673 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16674 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16675 filled in with the TYPE containing the member. *CV_QUALS is
16676 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16677 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16678 Note that the tree codes returned by this function have nothing
16679 to do with the types of trees that will be eventually be created
16680 to represent the pointer or reference type being parsed. They are
16681 just constants with suggestive names. */
16682 static enum tree_code
16687 {
16692 /* Assume that it's not a pointer-to-member. */
16694 /* And that there are no cv-qualifiers. */
16697 /* Peek at the next token. */
16700 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16710 {
16711 /* Consume the `*', `&' or `&&'. */
16714 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16715 `&', if we are allowing GNU extensions. (The only qualifier
16716 that can legally appear after `&' is `restrict', but that is
16717 enforced during semantic analysis. */
16725 }
16726 else
16727 {
16728 /* Try the pointer-to-member case. */
16730 /* Look for the optional `::' operator. */
16733 /* Look for the nested-name specifier. */
16740 /* If we found it, and the next token is a `*', then we are
16741 indeed looking at a pointer-to-member operator. */
16744 {
16745 /* Indicate that the `*' operator was used. */
16753 else
16754 {
16755 /* The type of which the member is a member is given by the
16756 current SCOPE. */
16758 /* The next name will not be qualified. */
16762 /* Look for optional c++11 attributes. */
16766 /* Look for the optional cv-qualifier-seq. */
16768 }
16769 }
16770 /* If that didn't work we don't have a ptr-operator. */
16773 }
16776 }
16778 /* Parse an (optional) cv-qualifier-seq.
16780 cv-qualifier-seq:
16781 cv-qualifier cv-qualifier-seq [opt]
16783 cv-qualifier:
16784 const
16785 volatile
16787 GNU Extension:
16789 cv-qualifier:
16790 __restrict__
16792 Returns a bitmask representing the cv-qualifiers. */
16794 static cp_cv_quals
16796 {
16800 {
16802 cp_cv_quals cv_qualifier;
16804 /* Peek at the next token. */
16806 /* See if it's a cv-qualifier. */
16808 {
16824 }
16830 {
16833 }
16834 else
16835 {
16838 }
16839 }
16842 }
16844 /* Parse an (optional) virt-specifier-seq.
16846 virt-specifier-seq:
16847 virt-specifier virt-specifier-seq [opt]
16849 virt-specifier:
16850 override
16851 final
16853 Returns a bitmask representing the virt-specifiers. */
16855 static cp_virt_specifiers
16857 {
16861 {
16863 cp_virt_specifiers virt_specifier;
16865 /* Peek at the next token. */
16867 /* See if it's a virt-specifier-qualifier. */
16871 {
16874 }
16876 {
16879 }
16881 {
16883 }
16884 else
16888 {
16891 }
16892 else
16893 {
16896 }
16897 }
16899 }
16901 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16902 is in scope even though it isn't real. */
16904 static void
16906 {
16907 tree this_parm;
16910 {
16911 /* We don't clear this between NSDMIs. Is it already what we want? */
16916 }
16919 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16921 current_class_ref
16924 }
16926 /* Parse a late-specified return type, if any. This is not a separate
16927 non-terminal, but part of a function declarator, which looks like
16929 -> trailing-type-specifier-seq abstract-declarator(opt)
16931 Returns the type indicated by the type-id.
16933 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16934 function. */
16936 static tree
16938 {
16940 tree type;
16942 /* Peek at the next token. */
16944 /* A late-specified return type is indicated by an initial '->'. */
16948 /* Consume the ->. */
16952 {
16953 /* DR 1207: 'this' is in scope in the trailing return type. */
16956 }
16964 }
16966 /* Parse a declarator-id.
16968 declarator-id:
16969 id-expression
16970 :: [opt] nested-name-specifier [opt] type-name
16972 In the `id-expression' case, the value returned is as for
16973 cp_parser_id_expression if the id-expression was an unqualified-id.
16974 If the id-expression was a qualified-id, then a SCOPE_REF is
16975 returned. The first operand is the scope (either a NAMESPACE_DECL
16976 or TREE_TYPE), but the second is still just a representation of an
16977 unqualified-id. */
16979 static tree
16981 {
16982 tree id;
16983 /* The expression must be an id-expression. Assume that qualified
16984 names are the names of types so that:
16986 template <class T>
16987 int S<T>::R::i = 3;
16989 will work; we must treat `S<T>::R' as the name of a type.
16990 Similarly, assume that qualified names are templates, where
16991 required, so that:
16993 template <class T>
16994 int S<T>::R<T>::i = 3;
16996 will work, too. */
17002 optional_p);
17006 }
17008 /* Parse a type-id.
17010 type-id:
17011 type-specifier-seq abstract-declarator [opt]
17013 Returns the TYPE specified. */
17015 static tree
17018 {
17019 cp_decl_specifier_seq type_specifier_seq;
17022 /* Parse the type-specifier-seq. */
17024 is_trailing_return,
17029 /* There might or might not be an abstract declarator. */
17031 /* Look for the declarator. */
17032 abstract_declarator
17036 /* Check to see if there really was a declarator. */
17042 {
17043 /* A type-id with type 'auto' is only ok if the abstract declarator
17044 is a function declarator with a late-specified return type. */
17049 else
17050 {
17053 }
17054 }
17057 is_template_arg);
17058 }
17061 {
17063 }
17066 {
17067 tree r;
17069 parser->type_definition_forbidden_message
17074 }
17077 {
17079 }
17081 /* Parse a type-specifier-seq.
17083 type-specifier-seq:
17084 type-specifier type-specifier-seq [opt]
17086 GNU extension:
17088 type-specifier-seq:
17089 attributes type-specifier-seq [opt]
17091 If IS_DECLARATION is true, we are at the start of a "condition" or
17092 exception-declaration, so we might be followed by a declarator-id.
17094 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
17095 i.e. we've just seen "->".
17097 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
17099 static void
17104 {
17109 /* Clear the TYPE_SPECIFIER_SEQ. */
17112 /* In the context of a trailing return type, enum E { } is an
17113 elaborated-type-specifier followed by a function-body, not an
17114 enum-specifier. */
17118 /* Parse the type-specifiers and attributes. */
17120 {
17121 tree type_specifier;
17124 /* Check for attributes first. */
17126 {
17131 }
17133 /* record the token of the beginning of the type specifier seq,
17134 for error reporting purposes*/
17138 /* Look for the type-specifier. */
17140 flags,
17141 type_specifier_seq,
17143 NULL,
17146 {
17147 /* If the first type-specifier could not be found, this is not a
17148 type-specifier-seq at all. */
17150 {
17154 }
17155 /* If subsequent type-specifiers could not be found, the
17156 type-specifier-seq is complete. */
17158 }
17161 /* The standard says that a condition can be:
17163 type-specifier-seq declarator = assignment-expression
17165 However, given:
17167 struct S {};
17168 if (int S = ...)
17170 we should treat the "S" as a declarator, not as a
17171 type-specifier. The standard doesn't say that explicitly for
17172 type-specifier-seq, but it does say that for
17173 decl-specifier-seq in an ordinary declaration. Perhaps it
17174 would be clearer just to allow a decl-specifier-seq here, and
17175 then add a semantic restriction that if any decl-specifiers
17176 that are not type-specifiers appear, the program is invalid. */
17179 }
17180 }
17182 /* Parse a parameter-declaration-clause.
17184 parameter-declaration-clause:
17185 parameter-declaration-list [opt] ... [opt]
17186 parameter-declaration-list , ...
17188 Returns a representation for the parameter declarations. A return
17189 value of NULL indicates a parameter-declaration-clause consisting
17190 only of an ellipsis. */
17192 static tree
17194 {
17195 tree parameters;
17200 /* Peek at the next token. */
17202 /* Check for trivial parameter-declaration-clauses. */
17204 {
17205 /* Consume the `...' token. */
17208 }
17210 /* There are no parameters. */
17211 {
17212 #ifndef NO_IMPLICIT_EXTERN_C
17216 else
17217 #endif
17219 }
17220 /* Check for `(void)', too, which is a special case. */
17224 {
17225 /* Consume the `void' token. */
17227 /* There are no parameters. */
17229 }
17231 /* Parse the parameter-declaration-list. */
17233 /* If a parse error occurred while parsing the
17234 parameter-declaration-list, then the entire
17235 parameter-declaration-clause is erroneous. */
17239 /* Peek at the next token. */
17241 /* If it's a `,', the clause should terminate with an ellipsis. */
17243 {
17244 /* Consume the `,'. */
17246 /* Expect an ellipsis. */
17247 ellipsis_p
17249 }
17250 /* It might also be `...' if the optional trailing `,' was
17251 omitted. */
17253 {
17254 /* Consume the `...' token. */
17256 /* And remember that we saw it. */
17258 }
17259 else
17262 /* Finish the parameter list. */
17267 }
17269 /* Parse a parameter-declaration-list.
17271 parameter-declaration-list:
17272 parameter-declaration
17273 parameter-declaration-list , parameter-declaration
17275 Returns a representation of the parameter-declaration-list, as for
17276 cp_parser_parameter_declaration_clause. However, the
17277 `void_list_node' is never appended to the list. Upon return,
17278 *IS_ERROR will be true iff an error occurred. */
17280 static tree
17282 {
17288 /* Assume all will go well. */
17290 /* The special considerations that apply to a function within an
17291 unbraced linkage specifications do not apply to the parameters
17292 to the function. */
17293 saved_in_unbraced_linkage_specification_p
17297 /* Look for more parameters. */
17299 {
17303 /* Parse the parameter. */
17304 parameter
17309 /* We don't know yet if the enclosing context is deprecated, so wait
17310 and warn in grokparms if appropriate. */
17316 PARM,
17322 /* If a parse error occurred parsing the parameter declaration,
17323 then the entire parameter-declaration-list is erroneous. */
17325 {
17329 }
17339 {
17343 }
17345 /* Add the new parameter to the list. */
17349 /* Peek at the next token. */
17352 /* These are for Objective-C++ */
17355 /* The parameter-declaration-list is complete. */
17358 {
17361 /* Peek at the next token. */
17363 /* If it's an ellipsis, then the list is complete. */
17366 /* Otherwise, there must be more parameters. Consume the
17367 `,'. */
17369 /* When parsing something like:
17371 int i(float f, double d)
17373 we can tell after seeing the declaration for "f" that we
17374 are not looking at an initialization of a variable "i",
17375 but rather at the declaration of a function "i".
17377 Due to the fact that the parsing of template arguments
17378 (as specified to a template-id) requires backtracking we
17379 cannot use this technique when inside a template argument
17380 list. */
17384 /* However, a parameter-declaration of the form
17385 "foat(f)" (which is a valid declaration of a
17386 parameter "f") can also be interpreted as an
17387 expression (the conversion of "f" to "float"). */
17390 }
17391 else
17392 {
17400 }
17401 }
17403 parser->in_unbraced_linkage_specification_p
17407 }
17409 /* Parse a parameter declaration.
17411 parameter-declaration:
17412 decl-specifier-seq ... [opt] declarator
17413 decl-specifier-seq declarator = assignment-expression
17414 decl-specifier-seq ... [opt] abstract-declarator [opt]
17415 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17417 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17418 declares a template parameter. (In that case, a non-nested `>'
17419 token encountered during the parsing of the assignment-expression
17420 is not interpreted as a greater-than operator.)
17422 Returns a representation of the parameter, or NULL if an error
17423 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17424 true iff the declarator is of the form "(p)". */
17430 {
17432 cp_decl_specifier_seq decl_specifiers;
17434 tree default_argument;
17438 /* In a template parameter, `>' is not an operator.
17440 [temp.param]
17442 When parsing a default template-argument for a non-type
17443 template-parameter, the first non-nested `>' is taken as the end
17444 of the template parameter-list rather than a greater-than
17445 operator. */
17447 /* Type definitions may not appear in parameter types. */
17449 parser->type_definition_forbidden_message
17452 /* Parse the declaration-specifiers. */
17454 CP_PARSER_FLAGS_NONE,
17458 /* Complain about missing 'typename' or other invalid type names. */
17462 /* If an error occurred, there's no reason to attempt to parse the
17463 rest of the declaration. */
17465 {
17468 }
17470 /* Peek at the next token. */
17473 /* If the next token is a `)', `,', `=', `>', or `...', then there
17474 is no declarator. However, when variadic templates are enabled,
17475 there may be a declarator following `...'. */
17480 {
17484 }
17485 /* Otherwise, there should be a declarator. */
17486 else
17487 {
17491 /* After seeing a decl-specifier-seq, if the next token is not a
17492 "(", there is no possibility that the code is a valid
17493 expression. Therefore, if parsing tentatively, we commit at
17494 this point. */
17496 /* In an expression context, having seen:
17498 (int((char ...
17500 we cannot be sure whether we are looking at a
17501 function-type (taking a "char" as a parameter) or a cast
17502 of some object of type "char" to "int". */
17508 /* Parse the declarator. */
17511 CP_PARSER_DECLARATOR_EITHER,
17513 parenthesized_p,
17516 /* After the declarator, allow more attributes. */
17517 decl_specifiers.attributes
17520 }
17522 /* If the next token is an ellipsis, and we have not seen a
17523 declarator name, and the type of the declarator contains parameter
17524 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17525 a parameter pack expansion expression. Otherwise, leave the
17526 ellipsis for a C-style variadic function. */
17529 {
17540 {
17541 /* Consume the `...'. */
17545 /* Build a pack expansion type */
17548 else
17550 }
17551 }
17553 /* The restriction on defining new types applies only to the type
17554 of the parameter, not to the default argument. */
17557 /* If the next token is `=', then process a default argument. */
17559 {
17561 /* If we are defining a class, then the tokens that make up the
17562 default argument must be saved and processed later. */
17567 /* Outside of a class definition, we can just parse the
17568 assignment-expression. */
17569 else
17570 default_argument
17574 {
17577 else
17578 {
17580 "default arguments are only "
17583 }
17584 }
17588 {
17589 /* Find the name of the parameter pack. */
17596 template_parm_p
17602 else
17604 template_parm_p
17611 }
17612 }
17613 else
17617 declarator,
17618 default_argument);
17619 }
17621 /* Parse a default argument and return it.
17623 TEMPLATE_PARM_P is true if this is a default argument for a
17624 non-type template parameter. */
17625 static tree
17627 {
17633 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17634 set correctly. */
17637 /* Local variable names (and the `this' keyword) may not
17638 appear in a default argument. */
17641 /* Parse the assignment-expression. */
17644 default_argument
17654 }
17656 /* Parse a function-body.
17658 function-body:
17659 compound_statement */
17661 static void
17663 {
17665 }
17667 /* Parse a ctor-initializer-opt followed by a function-body. Return
17668 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17669 is true we are parsing a function-try-block. */
17671 static bool
17674 {
17682 /* Begin the function body. */
17684 /* Parse the optional ctor-initializer. */
17687 /* If we're parsing a constexpr constructor definition, we need
17688 to check that the constructor body is indeed empty. However,
17689 before we get to cp_parser_function_body lot of junk has been
17690 generated, so we can't just check that we have an empty block.
17691 Rather we take a snapshot of the outermost block, and check whether
17692 cp_parser_function_body changed its state. */
17694 {
17698 }
17699 /* Parse the function-body. */
17703 /* Finish the function body. */
17707 }
17709 /* Parse an initializer.
17711 initializer:
17712 = initializer-clause
17713 ( expression-list )
17715 Returns an expression representing the initializer. If no
17716 initializer is present, NULL_TREE is returned.
17718 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17719 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17720 set to TRUE if there is no initializer present. If there is an
17721 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17722 is set to true; otherwise it is set to false. */
17724 static tree
17727 {
17729 tree init;
17731 /* Peek at the next token. */
17734 /* Let our caller know whether or not this initializer was
17735 parenthesized. */
17737 /* Assume that the initializer is constant. */
17741 {
17742 /* Consume the `='. */
17744 /* Parse the initializer-clause. */
17746 }
17748 {
17753 non_constant_p);
17758 }
17760 {
17764 }
17765 else
17766 {
17767 /* Anything else is an error. */
17770 }
17773 }
17775 /* Parse an initializer-clause.
17777 initializer-clause:
17778 assignment-expression
17779 braced-init-list
17781 Returns an expression representing the initializer.
17783 If the `assignment-expression' production is used the value
17784 returned is simply a representation for the expression.
17786 Otherwise, calls cp_parser_braced_list. */
17788 static tree
17790 {
17791 tree initializer;
17793 /* Assume the expression is constant. */
17796 /* If it is not a `{', then we are looking at an
17797 assignment-expression. */
17799 {
17800 initializer
17803 non_constant_p);
17804 }
17805 else
17809 }
17811 /* Parse a brace-enclosed initializer list.
17813 braced-init-list:
17814 { initializer-list , [opt] }
17815 { }
17817 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17818 the elements of the initializer-list (or NULL, if the last
17819 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17820 NULL_TREE. There is no way to detect whether or not the optional
17821 trailing `,' was provided. NON_CONSTANT_P is as for
17822 cp_parser_initializer. */
17824 static tree
17826 {
17827 tree initializer;
17829 /* Consume the `{' token. */
17831 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17833 /* If it's not a `}', then there is a non-trivial initializer. */
17835 {
17836 /* Parse the initializer list. */
17839 /* A trailing `,' token is allowed. */
17842 }
17843 /* Now, there should be a trailing `}'. */
17847 }
17849 /* Parse an initializer-list.
17851 initializer-list:
17852 initializer-clause ... [opt]
17853 initializer-list , initializer-clause ... [opt]
17855 GNU Extension:
17857 initializer-list:
17858 designation initializer-clause ...[opt]
17859 initializer-list , designation initializer-clause ...[opt]
17861 designation:
17862 . identifier =
17863 identifier :
17864 [ constant-expression ] =
17866 Returns a vec of constructor_elt. The VALUE of each elt is an expression
17867 for the initializer. If the INDEX of the elt is non-NULL, it is the
17868 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17869 as for cp_parser_initializer. */
17873 {
17876 /* Assume all of the expressions are constant. */
17879 /* Parse the rest of the list. */
17881 {
17883 tree designator;
17884 tree initializer;
17887 /* If the next token is an identifier and the following one is a
17888 colon, we are looking at the GNU designated-initializer
17889 syntax. */
17893 {
17894 /* Warn the user that they are using an extension. */
17897 /* Consume the identifier. */
17899 /* Consume the `:'. */
17901 }
17902 /* Also handle the C99 syntax, '. id ='. */
17907 {
17908 /* Warn the user that they are using an extension. */
17911 /* Consume the `.'. */
17913 /* Consume the identifier. */
17915 /* Consume the `='. */
17917 }
17918 /* Also handle C99 array designators, '[ const ] ='. */
17922 {
17923 /* In C++11, [ could start a lambda-introducer. */
17931 }
17932 else
17935 /* Parse the initializer. */
17938 /* If any clause is non-constant, so is the entire initializer. */
17942 /* If we have an ellipsis, this is an initializer pack
17943 expansion. */
17945 {
17946 /* Consume the `...'. */
17949 /* Turn the initializer into an initializer expansion. */
17951 }
17953 /* Add it to the vector. */
17956 /* If the next token is not a comma, we have reached the end of
17957 the list. */
17961 /* Peek at the next token. */
17963 /* If the next token is a `}', then we're still done. An
17964 initializer-clause can have a trailing `,' after the
17965 initializer-list and before the closing `}'. */
17969 /* Consume the `,' token. */
17971 }
17974 }
17976 /* Classes [gram.class] */
17978 /* Parse a class-name.
17980 class-name:
17981 identifier
17982 template-id
17984 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17985 to indicate that names looked up in dependent types should be
17986 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17987 keyword has been used to indicate that the name that appears next
17988 is a template. TAG_TYPE indicates the explicit tag given before
17989 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17990 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17991 is the class being defined in a class-head.
17993 Returns the TYPE_DECL representing the class. */
17995 static tree
18003 {
18004 tree decl;
18005 tree scope;
18010 /* All class-names start with an identifier. */
18013 {
18016 }
18018 /* PARSER->SCOPE can be cleared when parsing the template-arguments
18019 to a template-id, so we save it here. */
18024 /* Any name names a type if we're following the `typename' keyword
18025 in a qualified name where the enclosing scope is type-dependent. */
18028 /* Handle the common case (an identifier, but not a template-id)
18029 efficiently. */
18032 {
18036 /* Look for the identifier. */
18040 /* If the next token isn't an identifier, we are certainly not
18041 looking at a class-name. */
18044 /* If we know this is a type-name, there's no need to look it
18045 up. */
18048 else
18049 {
18050 tree ambiguous_decls;
18051 /* If we already know that this lookup is ambiguous, then
18052 we've already issued an error message; there's no reason
18053 to check again. */
18055 {
18058 }
18059 /* If the next token is a `::', then the name must be a type
18060 name.
18062 [basic.lookup.qual]
18064 During the lookup for a name preceding the :: scope
18065 resolution operator, object, function, and enumerator
18066 names are ignored. */
18069 /* Look up the name. */
18071 tag_type,
18074 check_dependency_p,
18078 {
18082 }
18083 }
18084 }
18085 else
18086 {
18087 /* Try a template-id. */
18089 check_dependency_p,
18090 tag_type,
18091 is_declaration);
18094 }
18098 /* If this is a typename, create a TYPENAME_TYPE. */
18100 {
18105 }
18109 /* Check to see that it is really the name of a class. */
18113 /* Situations like this:
18115 template <typename T> struct A {
18116 typename T::template X<int>::I i;
18117 };
18119 are problematic. Is `T::template X<int>' a class-name? The
18120 standard does not seem to be definitive, but there is no other
18121 valid interpretation of the following `::'. Therefore, those
18122 names are considered class-names. */
18123 {
18127 }
18131 /* In Objective-C 2.0, a classname followed by '.' starts a
18132 dot-syntax expression, and it's not a type-name. */
18144 }
18146 /* Parse a class-specifier.
18148 class-specifier:
18149 class-head { member-specification [opt] }
18151 Returns the TREE_TYPE representing the class. */
18153 static tree
18155 {
18156 tree type;
18170 /* Parse the class-head. */
18173 /* If the class-head was a semantic disaster, skip the entire body
18174 of the class. */
18176 {
18180 }
18182 /* Look for the `{'. */
18184 {
18187 }
18189 /* Issue an error message if type-definitions are forbidden here. */
18191 /* Remember that we are defining one more class. */
18193 /* Inside the class, surrounding template-parameter-lists do not
18194 apply. */
18195 saved_num_template_parameter_lists
18198 /* We are not in a function body. */
18201 /* Or in a loop. */
18204 /* Or in a switch. */
18207 /* We are not immediately inside an extern "lang" block. */
18208 saved_in_unbraced_linkage_specification_p
18212 /* Start the class. */
18214 {
18217 }
18221 /* If the type is erroneous, skip the entire body of the class. */
18223 else
18224 /* Parse the member-specification. */
18227 /* Look for the trailing `}'. */
18229 /* Look for trailing attributes to apply to this class. */
18237 /* We've finished a type definition. Check for the common syntax
18238 error of forgetting a semicolon after the definition. We need to
18239 be careful, as we can't just check for not-a-semicolon and be done
18240 with it; the user might have typed:
18242 class X { } c = ...;
18243 class X { } *p = ...;
18245 and so forth. Instead, enumerate all the possible tokens that
18246 might follow this production; if we don't see one of them, then
18247 complain and silently insert the semicolon. */
18248 {
18253 /* Don't try to parse c++11 attributes here. As per the
18254 grammar, that should be a task for
18255 cp_parser_decl_specifier_seq. */
18259 {
18270 /* While it's legal for type qualifiers and storage class
18271 specifiers to follow type definitions in the grammar, only
18272 compiler testsuites contain code like that. Assume that if
18273 we see such code, then what we're really seeing is a case
18274 like:
18276 class X { }
18277 const <type> var = ...;
18279 or
18281 class Y { }
18282 static <type> func (...) ...
18284 i.e. the qualifier or specifier applies to the next
18285 declaration. To do so, however, we need to look ahead one
18286 more token to see if *that* token is a type specifier.
18288 This code could be improved to handle:
18290 class Z { }
18291 static const <type> var = ...; */
18294 {
18297 /* Handling user-defined types here would be nice, but very
18298 tricky. */
18299 want_semicolon
18302 }
18306 }
18308 /* If we don't have a type, then something is very wrong and we
18309 shouldn't try to do anything clever. Likewise for not seeing the
18310 closing brace. */
18312 {
18313 cp_token_position prev
18324 else
18327 /* Unget one token and smash it to look as though we encountered
18328 a semicolon in the input stream. */
18333 }
18334 }
18336 /* If this class is not itself within the scope of another class,
18337 then we need to parse the bodies of all of the queued function
18338 definitions. Note that the queued functions defined in a class
18339 are not always processed immediately following the
18340 class-specifier for that class. Consider:
18342 struct A {
18343 struct B { void f() { sizeof (A); } };
18344 };
18346 If `f' were processed before the processing of `A' were
18347 completed, there would be no way to compute the size of `A'.
18348 Note that the nesting we are interested in here is lexical --
18349 not the semantic nesting given by TYPE_CONTEXT. In particular,
18350 for:
18352 struct A { struct B; };
18353 struct A::B { void f() { } };
18355 there is no need to delay the parsing of `A::B::f'. */
18357 {
18358 tree decl;
18365 /* In a first pass, parse default arguments to the functions.
18366 Then, in a second pass, parse the bodies of the functions.
18367 This two-phased approach handles cases like:
18369 struct S {
18370 void f() { g(); }
18371 void g(int i = 3);
18372 };
18374 */
18376 {
18378 /* If there are default arguments that have not yet been processed,
18379 take care of them now. */
18381 {
18386 }
18387 /* Make sure that any template parameters are in scope. */
18389 /* Parse the default argument expressions. */
18391 /* Remove any template parameters from the symbol table. */
18393 }
18395 /* Now parse any NSDMIs. */
18399 {
18401 {
18406 }
18409 }
18415 /* Now parse the body of the functions. */
18419 }
18421 /* Put back any saved access checks. */
18424 /* Restore saved state. */
18428 parser->num_template_parameter_lists
18430 parser->in_unbraced_linkage_specification_p
18434 }
18436 static tree
18438 {
18439 tree ret;
18444 }
18446 /* Parse a class-head.
18448 class-head:
18449 class-key identifier [opt] base-clause [opt]
18450 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18451 class-key nested-name-specifier [opt] template-id
18452 base-clause [opt]
18454 class-virt-specifier:
18455 final
18457 GNU Extensions:
18458 class-key attributes identifier [opt] base-clause [opt]
18459 class-key attributes nested-name-specifier identifier base-clause [opt]
18460 class-key attributes nested-name-specifier [opt] template-id
18461 base-clause [opt]
18463 Upon return BASES is initialized to the list of base classes (or
18464 NULL, if there are none) in the same form returned by
18465 cp_parser_base_clause.
18467 Returns the TYPE of the indicated class. Sets
18468 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18469 involving a nested-name-specifier was used, and FALSE otherwise.
18471 Returns error_mark_node if this is not a class-head.
18473 Returns NULL_TREE if the class-head is syntactically valid, but
18474 semantically invalid in a way that means we should skip the entire
18475 body of the class. */
18477 static tree
18480 {
18481 tree nested_name_specifier;
18485 tree attributes;
18486 tree bases;
18496 /* Assume no nested-name-specifier will be present. */
18498 /* Assume no template parameter lists will be used in defining the
18499 type. */
18503 /* Look for the class-key. */
18508 /* Parse the attributes. */
18511 /* If the next token is `::', that is invalid -- but sometimes
18512 people do try to write:
18514 struct ::S {};
18516 Handle this gracefully by accepting the extra qualifier, and then
18517 issuing an error about it later if this really is a
18518 class-head. If it turns out just to be an elaborated type
18519 specifier, remain silent. */
18525 /* Determine the name of the class. Begin by looking for an
18526 optional nested-name-specifier. */
18528 nested_name_specifier
18534 /* If there was a nested-name-specifier, then there *must* be an
18535 identifier. */
18537 {
18539 /* Although the grammar says `identifier', it really means
18540 `class-name' or `template-name'. You are only allowed to
18541 define a class that has already been declared with this
18542 syntax.
18544 The proposed resolution for Core Issue 180 says that wherever
18545 you see `class T::X' you should treat `X' as a type-name.
18547 It is OK to define an inaccessible class; for example:
18549 class A { class B; };
18550 class A::B {};
18552 We do not know if we will see a class-name, or a
18553 template-name. We look for a class-name first, in case the
18554 class-name is a template-id; if we looked for the
18555 template-name first we would stop after the template-name. */
18560 class_type,
18564 /* If that didn't work, ignore the nested-name-specifier. */
18566 {
18572 }
18573 /* If we could not find a corresponding TYPE, treat this
18574 declaration like an unqualified declaration. */
18577 /* Otherwise, count the number of templates used in TYPE and its
18578 containing scopes. */
18579 else
18580 {
18581 tree scope;
18595 }
18596 }
18597 /* Otherwise, the identifier is optional. */
18598 else
18599 {
18600 /* We don't know whether what comes next is a template-id,
18601 an identifier, or nothing at all. */
18603 /* Check for a template-id. */
18608 class_key,
18610 /* If that didn't work, it could still be an identifier. */
18612 {
18614 {
18617 }
18618 else
18620 }
18621 else
18622 {
18625 }
18626 }
18631 {
18633 class_key,
18635 }
18638 /* If it's not a `:' or a `{' then we can't really be looking at a
18639 class-head, since a class-head only appears as part of a
18640 class-specifier. We have to detect this situation before calling
18641 xref_tag, since that has irreversible side-effects. */
18643 {
18647 }
18649 /* At this point, we're going ahead with the class-specifier, even
18650 if some other problem occurs. */
18653 {
18658 }
18659 /* Issue the error about the overly-qualified name now. */
18661 {
18666 }
18668 {
18673 }
18675 {
18676 tree scope;
18678 /* Reject typedef-names in class heads. */
18680 {
18683 type);
18686 }
18688 /* Figure out in what scope the declaration is being placed. */
18690 /* If that scope does not contain the scope in which the
18691 class was originally declared, the program is invalid. */
18693 {
18696 "declaration of %qD in namespace %qD which does not "
18699 else
18705 }
18706 /* [dcl.meaning]
18708 A declarator-id shall not be qualified except for the
18709 definition of a ... nested class outside of its class
18710 ... [or] the definition or explicit instantiation of a
18711 class member of a namespace outside of its namespace. */
18713 {
18718 }
18719 }
18720 /* An explicit-specialization must be preceded by "template <>". If
18721 it is not, try to recover gracefully. */
18725 {
18729 /* Take the same action that would have been taken by
18730 cp_parser_explicit_specialization. */
18733 }
18734 /* There must be no "return" statements between this point and the
18735 end of this function; set "type "to the correct return value and
18736 use "goto done;" to return. */
18737 /* Make sure that the right number of template parameters were
18738 present. */
18742 {
18743 /* If something went wrong, there is no point in even trying to
18744 process the class-definition. */
18747 }
18749 /* Look up the type. */
18751 {
18755 {
18759 }
18760 else
18761 {
18764 }
18767 }
18769 {
18770 tree class_type;
18772 /* Given:
18774 template <typename T> struct S { struct T };
18775 template <typename T> struct S<T>::T { };
18777 we will get a TYPENAME_TYPE when processing the definition of
18778 `S::T'. We need to resolve it to the actual type before we
18779 try to define it. */
18781 {
18786 else
18787 {
18790 }
18791 }
18795 {
18798 }
18801 /* Enter the scope indicated by the nested-name-specifier. */
18803 /* Get the canonical version of this type. */
18807 {
18810 {
18813 }
18814 }
18818 }
18820 {
18821 /* If the class was unnamed, create a dummy name. */
18826 }
18828 /* Indicate whether this class was declared as a `class' or as a
18829 `struct'. */
18834 /* If this type was already complete, and we see another definition,
18835 that's an error. */
18837 {
18839 type);
18841 type);
18844 }
18849 {
18850 /* Apply attributes now, before any use of the class as a template
18851 argument in its base list. */
18854 }
18856 /* We will have entered the scope containing the class; the names of
18857 base classes should be looked up in that context. For example:
18859 struct A { struct B {}; struct C; };
18860 struct A::C : B {};
18862 is valid. */
18864 /* Get the list of base-classes, if there is one. */
18867 else
18870 /* If we're really defining a class, process the base classes.
18871 If they're invalid, fail. */
18876 done:
18877 /* Leave the scope given by the nested-name-specifier. We will
18878 enter the class scope itself while processing the members. */
18883 {
18886 }
18892 out:
18895 }
18897 /* Parse a class-key.
18899 class-key:
18900 class
18901 struct
18902 union
18904 Returns the kind of class-key specified, or none_type to indicate
18905 error. */
18907 static enum tag_types
18909 {
18913 /* Look for the class-key. */
18918 /* Check to see if the TOKEN is a class-key. */
18923 }
18925 /* Parse an (optional) member-specification.
18927 member-specification:
18928 member-declaration member-specification [opt]
18929 access-specifier : member-specification [opt] */
18931 static void
18933 {
18935 {
18939 /* Peek at the next token. */
18941 /* If it's a `}', or EOF then we've seen all the members. */
18947 /* See if this token is a keyword. */
18950 {
18954 /* Consume the access-specifier. */
18956 /* Remember which access-specifier is active. */
18958 /* Look for the `:'. */
18963 /* Accept #pragmas at class scope. */
18965 {
18968 }
18970 /* Otherwise, the next construction must be a
18971 member-declaration. */
18973 }
18974 }
18975 }
18977 /* Parse a member-declaration.
18979 member-declaration:
18980 decl-specifier-seq [opt] member-declarator-list [opt] ;
18981 function-definition ; [opt]
18982 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18983 using-declaration
18984 template-declaration
18985 alias-declaration
18987 member-declarator-list:
18988 member-declarator
18989 member-declarator-list , member-declarator
18991 member-declarator:
18992 declarator pure-specifier [opt]
18993 declarator constant-initializer [opt]
18994 identifier [opt] : constant-expression
18996 GNU Extensions:
18998 member-declaration:
18999 __extension__ member-declaration
19001 member-declarator:
19002 declarator attributes [opt] pure-specifier [opt]
19003 declarator attributes [opt] constant-initializer [opt]
19004 identifier [opt] attributes [opt] : constant-expression
19006 C++0x Extensions:
19008 member-declaration:
19009 static_assert-declaration */
19011 static void
19013 {
19014 cp_decl_specifier_seq decl_specifiers;
19015 tree prefix_attributes;
19016 tree decl;
19025 /* Check for the `__extension__' keyword. */
19027 {
19028 /* Recurse. */
19030 /* Restore the old value of the PEDANTIC flag. */
19034 }
19036 /* Check for a template-declaration. */
19038 {
19039 /* An explicit specialization here is an error condition, and we
19040 expect the specialization handler to detect and report this. */
19044 else
19048 }
19050 /* Check for a using-declaration. */
19052 {
19054 {
19055 /* Parse the using-declaration. */
19059 }
19060 else
19061 {
19062 tree decl;
19067 else
19071 }
19072 }
19074 /* Check for @defs. */
19076 {
19081 {
19086 }
19088 }
19090 /* If the next token is `static_assert' we have a static assertion. */
19092 {
19095 }
19102 /* Parse the decl-specifier-seq. */
19105 CP_PARSER_FLAGS_OPTIONAL,
19108 /* Check for an invalid type-name. */
19112 /* If there is no declarator, then the decl-specifier-seq should
19113 specify a type. */
19115 {
19116 /* If there was no decl-specifier-seq, and the next token is a
19117 `;', then we have something like:
19119 struct S { ; };
19121 [class.mem]
19123 Each member-declaration shall declare at least one member
19124 name of the class. */
19126 {
19130 }
19131 else
19132 {
19133 tree type;
19135 /* See if this declaration is a friend. */
19137 /* If there were decl-specifiers, check to see if there was
19138 a class-declaration. */
19141 /* Nested classes have already been added to the class, but
19142 a `friend' needs to be explicitly registered. */
19144 {
19145 /* If the `friend' keyword was present, the friend must
19146 be introduced with a class-key. */
19149 "in C++03 a class-key must be used "
19151 /* In this case:
19153 template <typename T> struct A {
19154 friend struct A<T>::B;
19155 };
19157 A<T>::B will be represented by a TYPENAME_TYPE, and
19158 therefore not recognized by check_tag_decl. */
19160 {
19164 }
19167 "friend declaration does not name a class or "
19169 else
19172 }
19173 /* If there is no TYPE, an error message will already have
19174 been issued. */
19176 ;
19177 /* An anonymous aggregate has to be handled specially; such
19178 a declaration really declares a data member (with a
19179 particular type), as opposed to a nested class. */
19181 {
19182 /* C++11 9.5/6. */
19185 "a storage class on an anonymous aggregate "
19188 /* Remove constructors and such from TYPE, now that we
19189 know it is an anonymous aggregate. */
19191 /* And make the corresponding data member. */
19194 /* Add it to the class. */
19196 }
19197 else
19198 cp_parser_check_access_in_redeclaration
19201 }
19202 }
19203 else
19204 {
19207 /* Clear attributes from the decl_specifiers but keep them
19208 around as prefix attributes that apply them to the entity
19209 being declared. */
19213 /* See if these declarations will be friends. */
19216 /* Keep going until we hit the `;' at the end of the
19217 declaration. */
19219 {
19221 tree first_attribute;
19223 /* Peek at the next token. */
19226 /* Check for a bitfield declaration. */
19231 {
19232 tree identifier;
19233 tree width;
19235 /* Get the name of the bitfield. Note that we cannot just
19236 check TOKEN here because it may have been invalidated by
19237 the call to cp_lexer_peek_nth_token above. */
19240 else
19243 /* Consume the `:' token. */
19245 /* Get the width of the bitfield. */
19246 width
19249 NULL);
19251 /* Look for attributes that apply to the bitfield. */
19253 /* Remember which attributes are prefix attributes and
19254 which are not. */
19256 /* Combine the attributes. */
19259 /* Create the bitfield declaration. */
19262 identifier,
19263 sfk_none)
19266 width,
19267 attributes);
19268 }
19269 else
19270 {
19272 tree initializer;
19273 tree asm_specification;
19276 /* Parse the declarator. */
19277 declarator
19283 /* If something went wrong parsing the declarator, make sure
19284 that we at least consume some tokens. */
19286 {
19287 /* Skip to the end of the statement. */
19289 /* If the next token is not a semicolon, that is
19290 probably because we just skipped over the body of
19291 a function. So, we consume a semicolon if
19292 present, but do not issue an error message if it
19293 is not present. */
19295 CPP_SEMICOLON))
19298 }
19301 cp_parser_check_for_definition_in_return_type
19305 /* Look for an asm-specification. */
19307 /* Look for attributes that apply to the declaration. */
19309 /* Remember which attributes are prefix attributes and
19310 which are not. */
19312 /* Combine the attributes. */
19315 /* If it's an `=', then we have a constant-initializer or a
19316 pure-specifier. It is not correct to parse the
19317 initializer before registering the member declaration
19318 since the member declaration should be in scope while
19319 its initializer is processed. However, the rest of the
19320 front end does not yet provide an interface that allows
19321 us to handle this correctly. */
19323 {
19324 /* In [class.mem]:
19326 A pure-specifier shall be used only in the declaration of
19327 a virtual function.
19329 A member-declarator can contain a constant-initializer
19330 only if it declares a static member of integral or
19331 enumeration type.
19333 Therefore, if the DECLARATOR is for a function, we look
19334 for a pure-specifier; otherwise, we look for a
19335 constant-initializer. When we call `grokfield', it will
19336 perform more stringent semantics checks. */
19347 {
19349 /* Don't require a constant rvalue in C++11, since we
19350 might want a reference constant. We'll enforce
19351 constancy later. */
19353 /* Parse the initializer. */
19356 }
19357 else
19358 /* Parse the initializer. */
19360 }
19363 {
19367 else
19369 }
19370 /* Otherwise, there is no initializer. */
19371 else
19374 /* See if we are probably looking at a function
19375 definition. We are certainly not looking at a
19376 member-declarator. Calling `grokfield' has
19377 side-effects, so we must not do it unless we are sure
19378 that we are looking at a member-declarator. */
19381 {
19382 /* The grammar does not allow a pure-specifier to be
19383 used when a member function is defined. (It is
19384 possible that this fact is an oversight in the
19385 standard, since a pure function may be defined
19386 outside of the class-specifier. */
19392 declarator,
19393 attributes);
19394 /* If the member was not a friend, declare it here. */
19397 /* Peek at the next token. */
19399 /* If the next token is a semicolon, consume it. */
19403 }
19404 else
19407 /* Create the declaration. */
19410 asm_specification,
19411 attributes);
19412 }
19414 /* Reset PREFIX_ATTRIBUTES. */
19420 /* If there is any qualification still in effect, clear it
19421 now; we will be starting fresh with the next declarator. */
19425 /* If it's a `,', then there are more declarators. */
19427 {
19430 {
19434 }
19435 }
19436 /* If the next token isn't a `;', then we have a parse error. */
19438 CPP_SEMICOLON))
19439 {
19440 /* The next token might be a ways away from where the
19441 actual semicolon is missing. Find the previous token
19442 and use that for our error position. */
19447 /* Assume that the user meant to provide a semicolon. If
19448 we were to cp_parser_skip_to_end_of_statement, we might
19449 skip to a semicolon inside a member function definition
19450 and issue nonsensical error messages. */
19452 }
19455 {
19456 /* Add DECL to the list of members. */
19465 /* Add DECL to the queue of NSDMI to be parsed later. */
19467 }
19471 }
19472 }
19475 out:
19477 }
19479 /* Parse a pure-specifier.
19481 pure-specifier:
19482 = 0
19484 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19485 Otherwise, ERROR_MARK_NODE is returned. */
19487 static tree
19489 {
19492 /* Look for the `=' token. */
19495 /* Look for the `0' token. */
19504 /* Accept = default or = delete in c++0x mode. */
19507 {
19510 }
19512 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19514 {
19519 }
19521 {
19524 }
19527 }
19529 /* Parse a constant-initializer.
19531 constant-initializer:
19532 = constant-expression
19534 Returns a representation of the constant-expression. */
19536 static tree
19538 {
19539 /* Look for the `=' token. */
19543 /* It is invalid to write:
19545 struct S { static const int i = { 7 }; };
19547 */
19549 {
19552 /* Consume the opening brace. */
19554 /* Skip the initializer. */
19556 /* Look for the trailing `}'. */
19560 }
19564 NULL);
19565 }
19567 /* Derived classes [gram.class.derived] */
19569 /* Parse a base-clause.
19571 base-clause:
19572 : base-specifier-list
19574 base-specifier-list:
19575 base-specifier ... [opt]
19576 base-specifier-list , base-specifier ... [opt]
19578 Returns a TREE_LIST representing the base-classes, in the order in
19579 which they were declared. The representation of each node is as
19580 described by cp_parser_base_specifier.
19582 In the case that no bases are specified, this function will return
19583 NULL_TREE, not ERROR_MARK_NODE. */
19585 static tree
19587 {
19590 /* Look for the `:' that begins the list. */
19593 /* Scan the base-specifier-list. */
19595 {
19597 tree base;
19600 /* Look for the base-specifier. */
19602 /* Look for the (optional) ellipsis. */
19604 {
19605 /* Consume the `...'. */
19609 }
19611 /* Add BASE to the front of the list. */
19613 {
19615 /* Make this a pack expansion type. */
19619 {
19622 }
19623 }
19624 /* Peek at the next token. */
19626 /* If it's not a comma, then the list is complete. */
19629 /* Consume the `,'. */
19631 }
19633 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19634 base class had a qualified name. However, the next name that
19635 appears is certainly not qualified. */
19641 }
19643 /* Parse a base-specifier.
19645 base-specifier:
19646 :: [opt] nested-name-specifier [opt] class-name
19647 virtual access-specifier [opt] :: [opt] nested-name-specifier
19648 [opt] class-name
19649 access-specifier virtual [opt] :: [opt] nested-name-specifier
19650 [opt] class-name
19652 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19653 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19654 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19655 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19657 static tree
19659 {
19667 tree type;
19669 /* Process the optional `virtual' and `access-specifier'. */
19671 {
19672 /* Peek at the next token. */
19674 /* Process `virtual'. */
19676 {
19678 /* If `virtual' appears more than once, issue an error. */
19680 {
19684 }
19688 /* Consume the `virtual' token. */
19696 /* If more than one access specifier appears, issue an
19697 error. */
19700 {
19704 }
19708 /* Consume the access-specifier. */
19716 }
19717 }
19718 /* It is not uncommon to see programs mechanically, erroneously, use
19719 the 'typename' keyword to denote (dependent) qualified types
19720 as base classes. */
19722 {
19727 else
19729 "keyword %<typename%> not allowed in this context "
19732 }
19734 /* Look for the optional `::' operator. */
19736 /* Look for the nested-name-specifier. The simplest way to
19737 implement:
19739 [temp.res]
19741 The keyword `typename' is not permitted in a base-specifier or
19742 mem-initializer; in these contexts a qualified name that
19743 depends on a template-parameter is implicitly assumed to be a
19744 type name.
19746 is to pretend that we have seen the `typename' keyword at this
19747 point. */
19751 typename_type,
19753 /* If the base class is given by a qualified name, assume that names
19754 we see are type names or templates, as appropriate. */
19760 /* DR 950 allows decltype as a base-specifier. */
19762 else
19763 {
19764 /* Otherwise, look for the class-name. */
19766 class_scope_p,
19767 template_p,
19768 typename_type,
19773 }
19779 }
19781 /* Exception handling [gram.exception] */
19783 /* Parse an (optional) noexcept-specification.
19785 noexcept-specification:
19786 noexcept ( constant-expression ) [opt]
19788 If no noexcept-specification is present, returns NULL_TREE.
19789 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19790 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19791 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19792 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19793 in which case a boolean condition is returned instead. */
19795 static tree
19800 {
19804 /* Peek at the next token. */
19807 /* Is it a noexcept-specification? */
19809 {
19810 tree expr;
19814 {
19818 {
19819 /* Types may not be defined in an exception-specification. */
19821 parser->type_definition_forbidden_message
19826 /* Restore the saved message. */
19828 }
19829 else
19830 {
19833 }
19836 }
19837 else
19838 {
19842 }
19844 /* We cannot build a noexcept-spec right away because this will check
19845 that expr is a constexpr. */
19848 else
19850 }
19851 else
19853 }
19855 /* Parse an (optional) exception-specification.
19857 exception-specification:
19858 throw ( type-id-list [opt] )
19860 Returns a TREE_LIST representing the exception-specification. The
19861 TREE_VALUE of each node is a type. */
19863 static tree
19865 {
19867 tree type_id_list;
19870 /* Peek at the next token. */
19873 /* Is it a noexcept-specification? */
19879 /* If it's not `throw', then there's no exception-specification. */
19883 #if 0
19884 /* Enable this once a lot of code has transitioned to noexcept? */
19888 #endif
19890 /* Consume the `throw'. */
19893 /* Look for the `('. */
19896 /* Peek at the next token. */
19898 /* If it's not a `)', then there is a type-id-list. */
19900 {
19901 /* Types may not be defined in an exception-specification. */
19903 parser->type_definition_forbidden_message
19905 /* Parse the type-id-list. */
19907 /* Restore the saved message. */
19909 }
19910 else
19913 /* Look for the `)'. */
19917 }
19919 /* Parse an (optional) type-id-list.
19921 type-id-list:
19922 type-id ... [opt]
19923 type-id-list , type-id ... [opt]
19925 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19926 in the order that the types were presented. */
19928 static tree
19930 {
19934 {
19936 tree type;
19938 /* Get the next type-id. */
19940 /* Parse the optional ellipsis. */
19942 {
19943 /* Consume the `...'. */
19946 /* Turn the type into a pack expansion expression. */
19948 }
19949 /* Add it to the list. */
19951 /* Peek at the next token. */
19953 /* If it is not a `,', we are done. */
19956 /* Consume the `,'. */
19958 }
19961 }
19963 /* Parse a try-block.
19965 try-block:
19966 try compound-statement handler-seq */
19968 static tree
19970 {
19971 tree try_block;
19981 }
19983 /* Parse a function-try-block.
19985 function-try-block:
19986 try ctor-initializer [opt] function-body handler-seq */
19988 static bool
19990 {
19991 tree compound_stmt;
19992 tree try_block;
19995 /* Look for the `try' keyword. */
19998 /* Let the rest of the front end know where we are. */
20000 /* Parse the function-body. */
20001 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
20003 /* We're done with the `try' part. */
20005 /* Parse the handlers. */
20007 /* We're done with the handlers. */
20011 }
20013 /* Parse a handler-seq.
20015 handler-seq:
20016 handler handler-seq [opt] */
20018 static void
20020 {
20022 {
20025 /* Parse the handler. */
20027 /* Peek at the next token. */
20029 /* If it's not `catch' then there are no more handlers. */
20032 }
20033 }
20035 /* Parse a handler.
20037 handler:
20038 catch ( exception-declaration ) compound-statement */
20040 static void
20042 {
20043 tree handler;
20044 tree declaration;
20054 }
20056 /* Parse an exception-declaration.
20058 exception-declaration:
20059 type-specifier-seq declarator
20060 type-specifier-seq abstract-declarator
20061 type-specifier-seq
20062 ...
20064 Returns a VAR_DECL for the declaration, or NULL_TREE if the
20065 ellipsis variant is used. */
20067 static tree
20069 {
20070 cp_decl_specifier_seq type_specifiers;
20074 /* If it's an ellipsis, it's easy to handle. */
20076 {
20077 /* Consume the `...' token. */
20080 }
20082 /* Types may not be defined in exception-declarations. */
20084 parser->type_definition_forbidden_message
20087 /* Parse the type-specifier-seq. */
20091 /* If it's a `)', then there is no declarator. */
20094 else
20100 /* Restore the saved message. */
20107 }
20109 /* Parse a throw-expression.
20111 throw-expression:
20112 throw assignment-expression [opt]
20114 Returns a THROW_EXPR representing the throw-expression. */
20116 static tree
20118 {
20119 tree expression;
20124 /* Figure out whether or not there is an assignment-expression
20125 following the "throw" keyword. */
20133 else
20138 }
20140 /* GNU Extensions */
20142 /* Parse an (optional) asm-specification.
20144 asm-specification:
20145 asm ( string-literal )
20147 If the asm-specification is present, returns a STRING_CST
20148 corresponding to the string-literal. Otherwise, returns
20149 NULL_TREE. */
20151 static tree
20153 {
20155 tree asm_specification;
20157 /* Peek at the next token. */
20159 /* If the next token isn't the `asm' keyword, then there's no
20160 asm-specification. */
20164 /* Consume the `asm' token. */
20166 /* Look for the `('. */
20169 /* Look for the string-literal. */
20172 /* Look for the `)'. */
20176 }
20178 /* Parse an asm-operand-list.
20180 asm-operand-list:
20181 asm-operand
20182 asm-operand-list , asm-operand
20184 asm-operand:
20185 string-literal ( expression )
20186 [ string-literal ] string-literal ( expression )
20188 Returns a TREE_LIST representing the operands. The TREE_VALUE of
20189 each node is the expression. The TREE_PURPOSE is itself a
20190 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
20191 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
20192 is a STRING_CST for the string literal before the parenthesis. Returns
20193 ERROR_MARK_NODE if any of the operands are invalid. */
20195 static tree
20197 {
20202 {
20203 tree string_literal;
20204 tree expression;
20205 tree name;
20208 {
20209 /* Consume the `[' token. */
20211 /* Read the operand name. */
20216 /* Look for the closing `]'. */
20218 }
20219 else
20221 /* Look for the string-literal. */
20224 /* Look for the `('. */
20226 /* Parse the expression. */
20228 /* Look for the `)'. */
20236 /* Add this operand to the list. */
20238 expression,
20239 asm_operands);
20240 /* If the next token is not a `,', there are no more
20241 operands. */
20244 /* Consume the `,'. */
20246 }
20249 }
20251 /* Parse an asm-clobber-list.
20253 asm-clobber-list:
20254 string-literal
20255 asm-clobber-list , string-literal
20257 Returns a TREE_LIST, indicating the clobbers in the order that they
20258 appeared. The TREE_VALUE of each node is a STRING_CST. */
20260 static tree
20262 {
20266 {
20267 tree string_literal;
20269 /* Look for the string literal. */
20271 /* Add it to the list. */
20273 /* If the next token is not a `,', then the list is
20274 complete. */
20277 /* Consume the `,' token. */
20279 }
20282 }
20284 /* Parse an asm-label-list.
20286 asm-label-list:
20287 identifier
20288 asm-label-list , identifier
20290 Returns a TREE_LIST, indicating the labels in the order that they
20291 appeared. The TREE_VALUE of each node is a label. */
20293 static tree
20295 {
20299 {
20302 /* Look for the identifier. */
20305 {
20308 {
20314 }
20315 }
20316 /* If the next token is not a `,', then the list is
20317 complete. */
20320 /* Consume the `,' token. */
20322 }
20325 }
20327 /* Return TRUE iff the next tokens in the stream are possibly the
20328 beginning of a GNU extension attribute. */
20330 static bool
20332 {
20334 }
20336 /* Return TRUE iff the next tokens in the stream are possibly the
20337 beginning of a standard C++-11 attribute specifier. */
20339 static bool
20341 {
20343 }
20345 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20346 beginning of a standard C++-11 attribute specifier. */
20348 static bool
20350 {
20358 }
20360 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20361 beginning of a GNU extension attribute. */
20363 static bool
20365 {
20369 }
20371 /* Return true iff the next tokens can be the beginning of either a
20372 GNU attribute list, or a standard C++11 attribute sequence. */
20374 static bool
20376 {
20379 }
20381 /* Return true iff the next Nth tokens can be the beginning of either
20382 a GNU attribute list, or a standard C++11 attribute sequence. */
20384 static bool
20386 {
20389 }
20391 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
20392 of GNU attributes, or return NULL. */
20394 static tree
20396 {
20400 }
20402 /* Parse an (optional) series of attributes.
20404 attributes:
20405 attributes attribute
20407 attribute:
20408 __attribute__ (( attribute-list [opt] ))
20410 The return value is as for cp_parser_gnu_attribute_list. */
20412 static tree
20414 {
20418 {
20420 tree attribute_list;
20423 /* Peek at the next token. */
20425 /* If it's not `__attribute__', then we're done. */
20429 /* Consume the `__attribute__' keyword. */
20431 /* Look for the two `(' tokens. */
20435 /* Peek at the next token. */
20438 /* Parse the attribute-list. */
20440 else
20441 /* If the next token is a `)', then there is no attribute
20442 list. */
20445 /* Look for the two `)' tokens. */
20453 /* Add these new attributes to the list. */
20455 }
20458 }
20460 /* Parse a GNU attribute-list.
20462 attribute-list:
20463 attribute
20464 attribute-list , attribute
20466 attribute:
20467 identifier
20468 identifier ( identifier )
20469 identifier ( identifier , expression-list )
20470 identifier ( expression-list )
20472 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20473 to an attribute. The TREE_PURPOSE of each node is the identifier
20474 indicating which attribute is in use. The TREE_VALUE represents
20475 the arguments, if any. */
20477 static tree
20479 {
20485 {
20487 tree identifier;
20488 tree attribute;
20490 /* Look for the identifier. We also allow keywords here; for
20491 example `__attribute__ ((const))' is legal. */
20495 {
20498 /* Consume the token. */
20501 /* Save away the identifier that indicates which attribute
20502 this is. */
20504 /* For keywords, use the canonical spelling, not the
20505 parsed identifier. */
20511 /* Peek at the next token. */
20513 /* If it's an `(', then parse the attribute arguments. */
20515 {
20519 vec = cp_parser_parenthesized_expression_list
20525 else
20526 {
20529 }
20530 /* Save the arguments away. */
20532 }
20535 {
20536 /* Add this attribute to the list. */
20539 }
20542 }
20543 /* Now, look for more attributes. If the next token isn't a
20544 `,', we're done. */
20548 /* Consume the comma and keep going. */
20550 }
20553 /* We built up the list in reverse order. */
20555 }
20557 /* Parse a standard C++11 attribute.
20559 The returned representation is a TREE_LIST which TREE_PURPOSE is
20560 the scoped name of the attribute, and the TREE_VALUE is its
20561 arguments list.
20563 Note that the scoped name of the attribute is itself a TREE_LIST
20564 which TREE_PURPOSE is the namespace of the attribute, and
20565 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
20566 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
20567 and which TREE_PURPOSE is directly the attribute name.
20569 Clients of the attribute code should use get_attribute_namespace
20570 and get_attribute_name to get the actual namespace and name of
20571 attributes, regardless of their being GNU or C++11 attributes.
20573 attribute:
20574 attribute-token attribute-argument-clause [opt]
20576 attribute-token:
20577 identifier
20578 attribute-scoped-token
20580 attribute-scoped-token:
20581 attribute-namespace :: identifier
20583 attribute-namespace:
20584 identifier
20586 attribute-argument-clause:
20587 ( balanced-token-seq )
20589 balanced-token-seq:
20590 balanced-token [opt]
20591 balanced-token-seq balanced-token
20593 balanced-token:
20594 ( balanced-token-seq )
20595 [ balanced-token-seq ]
20596 { balanced-token-seq }. */
20598 static tree
20600 {
20604 /* First, parse name of the the attribute, a.k.a
20605 attribute-token. */
20622 {
20623 /* We are seeing a scoped attribute token. */
20633 else
20634 {
20638 }
20640 NULL_TREE);
20642 }
20643 else
20645 NULL_TREE);
20647 /* Now parse the optional argument clause of the attribute. */
20652 {
20658 /* A GNU attribute that takes an identifier in parameter. */
20661 vec = cp_parser_parenthesized_expression_list
20667 else
20668 {
20671 }
20675 else
20677 }
20680 }
20682 /* Parse a list of standard C++-11 attributes.
20684 attribute-list:
20685 attribute [opt]
20686 attribute-list , attribute[opt]
20687 attribute ...
20688 attribute-list , attribute ...
20689 */
20691 static tree
20693 {
20698 {
20703 {
20706 }
20711 }
20714 }
20716 /* Parse a standard C++-11 attribute specifier.
20718 attribute-specifier:
20719 [ [ attribute-list ] ]
20720 alignment-specifier
20722 alignment-specifier:
20723 alignas ( type-id ... [opt] )
20724 alignas ( alignment-expression ... [opt] ). */
20726 static tree
20728 {
20734 {
20743 else
20744 /* Warn about parsing c++11 attribute in non-c++1 mode, only
20745 when we are sure that we have actually parsed them. */
20747 }
20748 else
20749 {
20750 tree alignas_expr;
20752 /* Look for an alignment-specifier. */
20764 {
20767 }
20773 {
20777 alignas_expr =
20783 }
20786 {
20789 }
20793 /* Build the C++-11 representation of an 'aligned'
20794 attribute. */
20795 attributes =
20799 }
20802 }
20804 /* Parse a standard C++-11 attribute-specifier-seq.
20806 attribute-specifier-seq:
20807 attribute-specifier-seq [opt] attribute-specifier
20808 */
20810 static tree
20812 {
20816 {
20825 }
20829 }
20831 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20832 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20833 current value of the PEDANTIC flag, regardless of whether or not
20834 the `__extension__' keyword is present. The caller is responsible
20835 for restoring the value of the PEDANTIC flag. */
20837 static bool
20839 {
20840 /* Save the old value of the PEDANTIC flag. */
20844 {
20845 /* Consume the `__extension__' token. */
20847 /* We're not being pedantic while the `__extension__' keyword is
20848 in effect. */
20852 }
20855 }
20857 /* Parse a label declaration.
20859 label-declaration:
20860 __label__ label-declarator-seq ;
20862 label-declarator-seq:
20863 identifier , label-declarator-seq
20864 identifier */
20866 static void
20868 {
20869 /* Look for the `__label__' keyword. */
20873 {
20874 tree identifier;
20876 /* Look for an identifier. */
20878 /* If we failed, stop. */
20881 /* Declare it as a label. */
20883 /* If the next token is a `;', stop. */
20886 /* Look for the `,' separating the label declarations. */
20888 }
20890 /* Look for the final `;'. */
20892 }
20894 /* Support Functions */
20896 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20897 NAME should have one of the representations used for an
20898 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20899 is returned. If PARSER->SCOPE is a dependent type, then a
20900 SCOPE_REF is returned.
20902 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20903 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20904 was formed. Abstractly, such entities should not be passed to this
20905 function, because they do not need to be looked up, but it is
20906 simpler to check for this special case here, rather than at the
20907 call-sites.
20909 In cases not explicitly covered above, this function returns a
20910 DECL, OVERLOAD, or baselink representing the result of the lookup.
20911 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20912 is returned.
20914 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20915 (e.g., "struct") that was used. In that case bindings that do not
20916 refer to types are ignored.
20918 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20919 ignored.
20921 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20922 are ignored.
20924 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20925 types.
20927 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20928 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20929 NULL_TREE otherwise. */
20931 static tree
20938 location_t name_location)
20939 {
20940 tree decl;
20943 /* Assume that the lookup will be unambiguous. */
20947 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20948 no longer valid. Note that if we are parsing tentatively, and
20949 the parse fails, OBJECT_TYPE will be automatically restored. */
20955 /* A template-id has already been resolved; there is no lookup to
20956 do. */
20960 {
20964 }
20966 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20967 it should already have been checked to make sure that the name
20968 used matches the type being destroyed. */
20970 {
20971 tree type;
20973 /* Figure out to which type this destructor applies. */
20978 else
20980 /* If that's not a class type, there is no destructor. */
20987 /* If it was a class type, return the destructor. */
20989 }
20991 /* By this point, the NAME should be an ordinary identifier. If
20992 the id-expression was a qualified name, the qualifying scope is
20993 stored in PARSER->SCOPE at this point. */
20996 /* Perform the lookup. */
20998 {
21004 /* If the SCOPE is dependent, the lookup must be deferred until
21005 the template is instantiated -- unless we are explicitly
21006 looking up names in uninstantiated templates. Even then, we
21007 cannot look up the name if the scope is not a class type; it
21008 might, for example, be a template type parameter. */
21013 /* Defer lookup. */
21015 else
21016 {
21019 /* If PARSER->SCOPE is a dependent type, then it must be a
21020 class type, and we must not be checking dependencies;
21021 otherwise, we would have processed this lookup above. So
21022 that PARSER->SCOPE is not considered a dependent base by
21023 lookup_member, we must enter the scope here. */
21027 /* If the PARSER->SCOPE is a template specialization, it
21028 may be instantiated during name lookup. In that case,
21029 errors may be issued. Even if we rollback the current
21030 tentative parse, those errors are valid. */
21035 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
21036 lookup result and the nested-name-specifier nominates a class C:
21037 * if the name specified after the nested-name-specifier, when
21038 looked up in C, is the injected-class-name of C (Clause 9), or
21039 * if the name specified after the nested-name-specifier is the
21040 same as the identifier or the simple-template-id's template-
21041 name in the last component of the nested-name-specifier,
21042 the name is instead considered to name the constructor of
21043 class C. [ Note: for example, the constructor is not an
21044 acceptable lookup result in an elaborated-type-specifier so
21045 the constructor would not be used in place of the
21046 injected-class-name. --end note ] Such a constructor name
21047 shall be used only in the declarator-id of a declaration that
21048 names a constructor or in a using-declaration. */
21056 /* If we have a single function from a using decl, pull it out. */
21063 }
21065 /* If the scope is a dependent type and either we deferred lookup or
21066 we did lookup but didn't find the name, rememeber the name. */
21069 {
21071 {
21072 tree type;
21074 /* The resolution to Core Issue 180 says that `struct
21075 A::B' should be considered a type-name, even if `A'
21076 is dependent. */
21080 }
21084 CPP_CLOSE_PAREN)))
21088 else
21091 is_template);
21092 }
21095 }
21097 {
21099 /* Look up the name in the scope of the OBJECT_TYPE, unless the
21100 OBJECT_TYPE is not a class. */
21102 /* If the OBJECT_TYPE is a template specialization, it may
21103 be instantiated during name lookup. In that case, errors
21104 may be issued. Even if we rollback the current tentative
21105 parse, those errors are valid. */
21107 name,
21110 tf_warning_or_error);
21111 /* Look it up in the enclosing context, too. */
21119 }
21120 else
21121 {
21127 }
21129 /* If the lookup failed, let our caller know. */
21133 /* Pull out the template from an injected-class-name (or multiple). */
21137 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
21139 {
21142 /* The error message we have to print is too complicated for
21143 cp_parser_error, so we incorporate its actions directly. */
21145 {
21147 name);
21149 }
21151 }
21159 /* If we have resolved the name of a member declaration, check to
21160 see if the declaration is accessible. When the name resolves to
21161 set of overloaded functions, accessibility is checked when
21162 overload resolution is done.
21164 During an explicit instantiation, access is not checked at all,
21165 as per [temp.explicit]. */
21172 }
21174 /* Like cp_parser_lookup_name, but for use in the typical case where
21175 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
21176 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
21178 static tree
21180 {
21182 none_type,
21187 location);
21188 }
21190 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
21191 the current context, return the TYPE_DECL. If TAG_NAME_P is
21192 true, the DECL indicates the class being defined in a class-head,
21193 or declared in an elaborated-type-specifier.
21195 Otherwise, return DECL. */
21197 static tree
21199 {
21200 /* If the TEMPLATE_DECL is being declared as part of a class-head,
21201 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
21203 struct A {
21204 template <typename T> struct B;
21205 };
21207 template <typename T> struct A::B {};
21209 Similarly, in an elaborated-type-specifier:
21211 namespace N { struct X{}; }
21213 struct A {
21214 template <typename T> friend struct N::X;
21215 };
21217 However, if the DECL refers to a class type, and we are in
21218 the scope of the class, then the name lookup automatically
21219 finds the TYPE_DECL created by build_self_reference rather
21220 than a TEMPLATE_DECL. For example, in:
21222 template <class T> struct S {
21223 S s;
21224 };
21226 there is no need to handle such case. */
21232 }
21234 /* If too many, or too few, template-parameter lists apply to the
21235 declarator, issue an error message. Returns TRUE if all went well,
21236 and FALSE otherwise. */
21238 static bool
21241 location_t declarator_location)
21242 {
21244 {
21246 {
21254 /* If the DECLARATOR has the form `X<y>' then it uses one
21255 additional level of template parameters. */
21258 return cp_parser_check_template_parameters
21260 }
21275 }
21277 }
21279 /* NUM_TEMPLATES were used in the current declaration. If that is
21280 invalid, return FALSE and issue an error messages. Otherwise,
21281 return TRUE. If DECLARATOR is non-NULL, then we are checking a
21282 declarator and we can print more accurate diagnostics. */
21284 static bool
21287 location_t location,
21289 {
21290 /* If there are the same number of template classes and parameter
21291 lists, that's OK. */
21294 /* If there are more, but only one more, then we are referring to a
21295 member template. That's OK too. */
21298 /* If there are more template classes than parameter lists, we have
21299 something like:
21301 template <class T> void S<T>::R<T>::f (); */
21303 {
21313 else
21316 }
21317 /* Otherwise, there are too many template parameter lists. We have
21318 something like:
21320 template <class T> template <class U> void S::f(); */
21323 }
21325 /* Parse an optional `::' token indicating that the following name is
21326 from the global namespace. If so, PARSER->SCOPE is set to the
21327 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
21328 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
21329 Returns the new value of PARSER->SCOPE, if the `::' token is
21330 present, and NULL_TREE otherwise. */
21332 static tree
21334 {
21337 /* Peek at the next token. */
21339 /* If we're looking at a `::' token then we're starting from the
21340 global namespace, not our current location. */
21342 {
21343 /* Consume the `::' token. */
21345 /* Set the SCOPE so that we know where to start the lookup. */
21351 }
21353 {
21357 }
21360 }
21362 /* Returns TRUE if the upcoming token sequence is the start of a
21363 constructor declarator. If FRIEND_P is true, the declarator is
21364 preceded by the `friend' specifier. */
21366 static bool
21368 {
21370 tree nested_name_specifier;
21373 /* The common case is that this is not a constructor declarator, so
21374 try to avoid doing lots of work if at all possible. It's not
21375 valid declare a constructor at function scope. */
21378 /* And only certain tokens can begin a constructor declarator. */
21386 /* Parse tentatively; we are going to roll back all of the tokens
21387 consumed here. */
21389 /* Assume that we are looking at a constructor declarator. */
21392 /* Look for the optional `::' operator. */
21395 /* Look for the nested-name-specifier. */
21396 nested_name_specifier
21402 /* Outside of a class-specifier, there must be a
21403 nested-name-specifier. */
21411 /* If we have a class scope, this is easy; DR 147 says that S::S always
21412 names the constructor, and no other qualified name could. */
21415 {
21425 }
21426 /* If we still think that this might be a constructor-declarator,
21427 look for a class-name. */
21429 {
21430 /* If we have:
21432 template <typename T> struct S {
21433 S();
21434 };
21436 we must recognize that the nested `S' names a class. */
21437 tree type_decl;
21441 none_type,
21445 /* If there was no class-name, then this is not a constructor. */
21448 /* If we're still considering a constructor, we have to see a `(',
21449 to begin the parameter-declaration-clause, followed by either a
21450 `)', an `...', or a decl-specifier. We need to check for a
21451 type-specifier to avoid being fooled into thinking that:
21453 S (f) (int);
21455 is a constructor. (It is actually a function named `f' that
21456 takes one parameter (of type `int') and returns a value of type
21457 `S'. */
21465 /* A parameter declaration begins with a decl-specifier,
21466 which is either the "attribute" keyword, a storage class
21467 specifier, or (usually) a type-specifier. */
21469 {
21470 tree type;
21474 /* Names appearing in the type-specifier should be looked up
21475 in the scope of the class. */
21478 else
21479 {
21482 {
21486 {
21489 }
21490 }
21492 }
21494 /* Inside the constructor parameter list, surrounding
21495 template-parameter-lists do not apply. */
21496 saved_num_template_parameter_lists
21500 /* Look for the type-specifier. */
21502 CP_PARSER_FLAGS_NONE,
21508 parser->num_template_parameter_lists
21511 /* Leave the scope of the class. */
21516 }
21517 }
21519 /* We did not really want to consume any tokens. */
21523 }
21525 /* Parse the definition of the function given by the DECL_SPECIFIERS,
21526 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
21527 they must be performed once we are in the scope of the function.
21529 Returns the function defined. */
21531 static tree
21532 cp_parser_function_definition_from_specifiers_and_declarator
21535 tree attributes,
21537 {
21538 tree fn;
21541 /* Begin the function-definition. */
21544 /* The things we're about to see are not directly qualified by any
21545 template headers we've seen thus far. */
21548 /* If there were names looked up in the decl-specifier-seq that we
21549 did not check, check them now. We must wait until we are in the
21550 scope of the function to perform the checks, since the function
21551 might be a friend. */
21555 {
21556 /* Skip the entire function. */
21559 }
21561 {
21562 /* Seen already, skip it. An error message has already been output. */
21566 /* If this is a function from a class, pop the nested class. */
21569 }
21570 else
21571 {
21572 timevar_id_t tv;
21575 else
21581 }
21584 }
21586 /* Parse the part of a function-definition that follows the
21587 declarator. INLINE_P is TRUE iff this function is an inline
21588 function defined within a class-specifier.
21590 Returns the function defined. */
21592 static tree
21595 {
21596 tree fn;
21605 /* If the next token is `return', then the code may be trying to
21606 make use of the "named return value" extension that G++ used to
21607 support. */
21610 {
21611 /* Consume the `return' keyword. */
21613 /* Look for the identifier that indicates what value is to be
21614 returned. */
21616 /* Issue an error message. */
21619 /* Skip tokens until we reach the start of the function body. */
21621 {
21628 }
21629 }
21630 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21631 anything declared inside `f'. */
21632 saved_in_unbraced_linkage_specification_p
21635 /* Inside the function, surrounding template-parameter-lists do not
21636 apply. */
21637 saved_num_template_parameter_lists
21643 /* If the next token is `try', `__transaction_atomic', or
21644 `__transaction_relaxed`, then we are looking at either function-try-block
21645 or function-transaction-block. Note that all of these include the
21646 function-body. */
21649 RID_TRANSACTION_ATOMIC);
21651 RID_TRANSACTION_RELAXED))
21653 RID_TRANSACTION_RELAXED);
21656 else
21657 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21662 /* Finish the function. */
21665 /* Generate code for it, if necessary. */
21667 /* Restore the saved values. */
21668 parser->in_unbraced_linkage_specification_p
21670 parser->num_template_parameter_lists
21675 }
21677 /* Parse a template-declaration, assuming that the `export' (and
21678 `extern') keywords, if present, has already been scanned. MEMBER_P
21679 is as for cp_parser_template_declaration. */
21681 static void
21683 {
21686 tree parameter_list;
21691 /* Look for the `template' keyword. */
21696 /* And the `<'. */
21700 {
21701 /* 14.5.2.2 [temp.mem]
21703 A local class shall not have member templates. */
21708 }
21709 /* [temp]
21711 A template ... shall not have C linkage. */
21713 {
21715 /* Give it C++ linkage to avoid confusing other parts of the
21716 front end. */
21719 }
21720 else
21723 /* We cannot perform access checks on the template parameter
21724 declarations until we know what is being declared, just as we
21725 cannot check the decl-specifier list. */
21728 /* If the next token is `>', then we have an invalid
21729 specialization. Rather than complain about an invalid template
21730 parameter, issue an error message here. */
21732 {
21736 }
21737 else
21738 {
21739 /* Parse the template parameters. */
21741 }
21743 /* Get the deferred access checks from the parameter list. These
21744 will be checked once we know what is being declared, as for a
21745 member template the checks must be performed in the scope of the
21746 class containing the member. */
21749 /* Look for the `>'. */
21751 /* We just processed one more parameter list. */
21753 /* If the next token is `template', there are more template
21754 parameters. */
21756 RID_TEMPLATE))
21761 else
21762 {
21763 /* There are no access checks when parsing a template, as we do not
21764 know if a specialization will be a friend. */
21768 checks,
21769 member_p,
21774 /* If this is a member template declaration, let the front
21775 end know. */
21777 {
21782 }
21788 }
21789 /* We are done with the current parameter list. */
21794 /* Finish up. */
21797 /* Check the template arguments for a literal operator template. */
21801 {
21805 else
21806 {
21810 else
21811 {
21817 }
21818 }
21822 decl);
21823 }
21824 /* Register member declarations. */
21827 /* For the erroneous case of a template with C linkage, we pushed an
21828 implicit C++ linkage scope; exit that scope now. */
21831 /* If DECL is a function template, we must return to parse it later.
21832 (Even though there is no definition, there might be default
21833 arguments that need handling.) */
21838 }
21840 /* Perform the deferred access checks from a template-parameter-list.
21841 CHECKS is a TREE_LIST of access checks, as returned by
21842 get_deferred_access_checks. */
21844 static void
21845 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
21846 {
21850 }
21852 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21853 `function-definition' sequence that follows a template header.
21854 If MEMBER_P is true, this declaration appears in a class scope.
21856 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21857 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21859 static tree
21865 {
21868 cp_decl_specifier_seq decl_specifiers;
21872 /* This function is only used when processing a template
21873 declaration. */
21877 /* Defer access checks until we know what is being declared. */
21880 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21881 alternative. */
21884 CP_PARSER_FLAGS_OPTIONAL,
21890 /* There are no template typedefs. */
21892 {
21896 }
21898 /* Gather up the access checks that occurred the
21899 decl-specifier-seq. */
21902 /* Check for the declaration of a template class. */
21904 {
21906 {
21909 /* In this case:
21911 struct C {
21912 friend template <typename T> struct A<T>::B;
21913 };
21915 A<T>::B will be represented by a TYPENAME_TYPE, and
21916 therefore not recognized by shadow_tag. */
21918 && !decl
21925 else
21928 /* Perform access checks for template parameters. */
21930 }
21931 }
21933 /* Complain about missing 'typename' or other invalid type names. */
21936 {
21937 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21938 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21939 the rest of this declaration. */
21942 }
21944 /* If it's not a template class, try for a template function. If
21945 the next token is a `;', then this declaration does not declare
21946 anything. But, if there were errors in the decl-specifiers, then
21947 the error might well have come from an attempted class-specifier.
21948 In that case, there's no need to warn about a missing declarator. */
21952 {
21955 checks,
21957 member_p,
21958 declares_class_or_enum,
21960 NULL);
21962 /* 7.1.1-1 [dcl.stc]
21964 A storage-class-specifier shall not be specified in an explicit
21965 specialization... */
21967 && explicit_specialization_p
21969 {
21973 }
21977 }
21979 /* Look for a trailing `;' after the declaration. */
21985 out:
21988 /* Clear any current qualification; whatever comes next is the start
21989 of something new. */
21995 }
21997 /* Parse a cast-expression that is not the operand of a unary "&". */
21999 static tree
22001 {
22004 }
22006 /* Parse a functional cast to TYPE. Returns an expression
22007 representing the cast. */
22009 static tree
22011 {
22013 tree expression_list;
22014 tree cast;
22018 {
22025 tf_warning_or_error);
22026 }
22035 else
22036 {
22039 }
22042 tf_warning_or_error);
22043 /* [expr.const]/1: In an integral constant expression "only type
22044 conversions to integral or enumeration type can be used". */
22050 NIC_CONSTRUCTOR))
22053 }
22055 /* Save the tokens that make up the body of a member function defined
22056 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
22057 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
22058 specifiers applied to the declaration. Returns the FUNCTION_DECL
22059 for the member function. */
22061 static tree
22065 tree attributes)
22066 {
22069 tree fn;
22071 /* Create the FUNCTION_DECL. */
22073 /* If something went badly wrong, bail out now. */
22075 {
22076 /* If there's a function-body, skip it. */
22081 }
22083 /* Remember it, if there default args to post process. */
22086 /* Save away the tokens that make up the body of the
22087 function. */
22089 /* We can have braced-init-list mem-initializers before the fn body. */
22091 {
22095 {
22096 /* cache_group will stop after an un-nested { } pair, too. */
22100 /* variadic mem-inits have ... after the ')'. */
22103 }
22104 }
22106 /* Handle function try blocks. */
22111 /* Save away the inline definition; we will process it when the
22112 class is complete. */
22116 /* We need to know that this was defined in the class, so that
22117 friend templates are handled correctly. */
22120 /* Add FN to the queue of functions to be parsed later. */
22124 }
22126 /* Save the tokens that make up the in-class initializer for a non-static
22127 data member. Returns a DEFAULT_ARG. */
22129 static tree
22131 {
22133 }
22135 /* Parse a template-argument-list, as well as the trailing ">" (but
22136 not the opening "<"). See cp_parser_template_argument_list for the
22137 return value. */
22139 static tree
22141 {
22142 tree arguments;
22143 tree saved_scope;
22144 tree saved_qualifying_scope;
22145 tree saved_object_scope;
22150 /* [temp.names]
22152 When parsing a template-id, the first non-nested `>' is taken as
22153 the end of the template-argument-list rather than a greater-than
22154 operator. */
22155 saved_greater_than_is_operator_p
22158 /* Parsing the argument list may modify SCOPE, so we save it
22159 here. */
22163 /* We need to evaluate the template arguments, even though this
22164 template-id may be nested within a "sizeof". */
22169 /* Parse the template-argument-list itself. */
22173 else
22175 /* Look for the `>' that ends the template-argument-list. If we find
22176 a '>>' instead, it's probably just a typo. */
22178 {
22180 {
22181 /* In C++0x, a `>>' in a template argument list or cast
22182 expression is considered to be two separate `>'
22183 tokens. So, change the current token to a `>', but don't
22184 consume it: it will be consumed later when the outer
22185 template argument list (or cast expression) is parsed.
22186 Note that this replacement of `>' for `>>' is necessary
22187 even if we are parsing tentatively: in the tentative
22188 case, after calling
22189 cp_parser_enclosed_template_argument_list we will always
22190 throw away all of the template arguments and the first
22191 closing `>', either because the template argument list
22192 was erroneous or because we are replacing those tokens
22193 with a CPP_TEMPLATE_ID token. The second `>' (which will
22194 not have been thrown away) is needed either to close an
22195 outer template argument list or to complete a new-style
22196 cast. */
22199 }
22201 {
22202 /* If we're in a nested template argument list, the '>>' has
22203 to be a typo for '> >'. We emit the error message, but we
22204 continue parsing and we push a '>' as next token, so that
22205 the argument list will be parsed correctly. Note that the
22206 global source location is still on the token before the
22207 '>>', so we need to say explicitly where we want it. */
22213 }
22214 else
22215 {
22216 /* If this is not a nested template argument list, the '>>'
22217 is a typo for '>'. Emit an error message and continue.
22218 Same deal about the token location, but here we can get it
22219 right by consuming the '>>' before issuing the diagnostic. */
22222 "spurious %<>>%>, use %<>%> to terminate "
22224 }
22225 }
22226 else
22228 /* The `>' token might be a greater-than operator again now. */
22229 parser->greater_than_is_operator_p
22231 /* Restore the SAVED_SCOPE. */
22239 }
22241 /* MEMBER_FUNCTION is a member function, or a friend. If default
22242 arguments, or the body of the function have not yet been parsed,
22243 parse them now. */
22245 static void
22247 {
22249 /* If this member is a template, get the underlying
22250 FUNCTION_DECL. */
22254 /* There should not be any class definitions in progress at this
22255 point; the bodies of members are only parsed outside of all class
22256 definitions. */
22258 /* While we're parsing the member functions we might encounter more
22259 classes. We want to handle them right away, but we don't want
22260 them getting mixed up with functions that are currently in the
22261 queue. */
22264 /* Make sure that any template parameters are in scope. */
22267 /* If the body of the function has not yet been parsed, parse it
22268 now. */
22270 {
22271 tree function_scope;
22274 /* The function is no longer pending; we are processing it. */
22279 /* If this is a local class, enter the scope of the containing
22280 function. */
22285 /* Push the body of the function onto the lexer stack. */
22288 /* Let the front end know that we going to be defining this
22289 function. */
22293 /* Don't do access checking if it is a templated function. */
22297 /* Now, parse the body of the function. */
22304 /* Leave the scope of the containing function. */
22308 }
22310 /* Remove any template parameters from the symbol table. */
22313 /* Restore the queue. */
22316 }
22318 /* If DECL contains any default args, remember it on the unparsed
22319 functions queue. */
22321 static void
22323 {
22324 tree probe;
22327 probe;
22330 {
22334 }
22335 }
22337 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
22338 which is either a FIELD_DECL or PARM_DECL. Parse it and return
22339 the result. For a PARM_DECL, PARMTYPE is the corresponding type
22340 from the parameter-type-list. */
22342 static tree
22345 {
22347 tree parsed_arg;
22353 /* Push the saved tokens for the default argument onto the parser's
22354 lexer stack. */
22360 /* Parse the default argument. */
22371 {
22372 /* In a non-template class, check conversions now. In a template,
22373 we'll wait and instantiate these as needed. */
22376 else
22377 {
22383 }
22384 }
22386 /* If the token stream has not been completely used up, then
22387 there was extra junk after the end of the default
22388 argument. */
22390 {
22393 else
22395 }
22397 /* Revert to the main lexer. */
22401 }
22403 /* FIELD is a non-static data member with an initializer which we saved for
22404 later; parse it now. */
22406 static void
22408 {
22409 tree def;
22414 NULL_TREE);
22418 }
22420 /* FN is a FUNCTION_DECL which may contains a parameter with an
22421 unparsed DEFAULT_ARG. Parse the default args now. This function
22422 assumes that the current scope is the scope in which the default
22423 argument should be processed. */
22425 static void
22427 {
22431 /* While we're parsing the default args, we might (due to the
22432 statement expression extension) encounter more classes. We want
22433 to handle them right away, but we don't want them getting mixed
22434 up with default args that are currently in the queue. */
22437 /* Local variable names (and the `this' keyword) may not appear
22438 in a default argument. */
22449 {
22451 tree parsed_arg;
22453 tree copy;
22460 /* This can happen for a friend declaration for a function
22461 already declared with default arguments. */
22464 parsed_arg
22466 default_arg,
22469 {
22471 }
22475 /* Update any instantiations we've already created. */
22479 }
22483 /* Make sure no default arg is missing. */
22486 /* Restore the state of local_variables_forbidden_p. */
22489 /* Restore the queue. */
22491 }
22493 /* Parse the operand of `sizeof' (or a similar operator). Returns
22494 either a TYPE or an expression, depending on the form of the
22495 input. The KEYWORD indicates which kind of expression we have
22496 encountered. */
22498 static tree
22500 {
22508 /* Types cannot be defined in a `sizeof' expression. Save away the
22509 old message. */
22511 /* And create the new one. */
22517 /* The restrictions on constant-expressions do not apply inside
22518 sizeof expressions. */
22519 saved_integral_constant_expression_p
22521 saved_non_integral_constant_expression_p
22525 /* If it's a `...', then we are computing the length of a parameter
22526 pack. */
22529 {
22530 /* Consume the `...'. */
22534 /* Note that this is an expansion. */
22536 }
22538 /* Do not actually evaluate the expression. */
22541 /* If it's a `(', then we might be looking at the type-id
22542 construction. */
22544 {
22545 tree type;
22548 /* We can't be sure yet whether we're looking at a type-id or an
22549 expression. */
22551 /* Consume the `('. */
22553 /* Parse the type-id. */
22558 /* Now, look for the trailing `)'. */
22560 /* If all went well, then we're done. */
22562 {
22563 cp_decl_specifier_seq decl_specs;
22565 /* Build a trivial decl-specifier-seq. */
22569 /* Call grokdeclarator to figure out what type this is. */
22572 TYPENAME,
22575 }
22576 }
22581 /* If the type-id production did not work out, then we must be
22582 looking at the unary-expression production. */
22588 /* Build a pack expansion. */
22591 /* Go back to evaluating expressions. */
22595 /* Free the message we created. */
22597 /* And restore the old one. */
22599 parser->integral_constant_expression_p
22601 parser->non_integral_constant_expression_p
22605 }
22607 /* If the current declaration has no declarator, return true. */
22609 static bool
22611 {
22612 /* If the next token is a `;' or a `,' then there is no
22613 declarator. */
22616 }
22618 /* Update the DECL_SPECS to reflect the storage class indicated by
22619 KEYWORD. */
22621 static void
22626 {
22627 cp_storage_class storage_class;
22630 {
22634 }
22636 {
22639 }
22644 {
22647 }
22650 {
22668 }
22672 /* A storage class specifier cannot be applied alongside a typedef
22673 specifier. If there is a typedef specifier present then set
22674 conflicting_specifiers_p which will trigger an error later
22675 on in grokdeclarator. */
22678 }
22680 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22681 is true, the type is a class or enum definition. */
22683 static void
22685 tree type_spec,
22688 {
22691 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22692 (with, for example, in "typedef int wchar_t;") we remember that
22693 this is what happened. In system headers, we ignore these
22694 declarations so that G++ can work with system headers that are not
22695 C++-safe. */
22697 && !type_definition_p
22707 {
22710 ds_redefined_builtin_type_spec,
22711 token);
22713 {
22717 }
22718 }
22721 else
22722 {
22727 }
22728 }
22730 /* True iff TOKEN is the GNU keyword __thread. */
22732 static bool
22734 {
22737 }
22739 /* Set the location for a declarator specifier and check if it is
22740 duplicated.
22742 DECL_SPECS is the sequence of declarator specifiers onto which to
22743 set the location.
22745 DS is the single declarator specifier to set which location is to
22746 be set onto the existing sequence of declarators.
22748 LOCATION is the location for the declarator specifier to
22749 consider. */
22751 static void
22754 {
22763 {
22767 }
22768 else
22769 {
22771 {
22775 else
22776 {
22779 OPT_Wlong_long,
22781 }
22782 }
22784 {
22789 else
22791 }
22792 else
22793 {
22809 "__complex"
22810 };
22813 }
22814 }
22815 }
22817 /* Return true iff the declarator specifier DS is present in the
22818 sequence of declarator specifiers DECL_SPECS. */
22820 bool
22822 cp_decl_spec ds)
22823 {
22830 }
22832 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22833 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22835 static bool
22837 {
22839 }
22841 /* Issue an error message indicating that TOKEN_DESC was expected.
22842 If KEYWORD is true, it indicated this function is called by
22843 cp_parser_require_keword and the required token can only be
22844 a indicated keyword. */
22846 static void
22848 required_token token_desc,
22850 {
22852 {
22921 }
22923 {
22925 {
23004 }
23005 }
23006 else
23008 }
23012 /* If the next token is of the indicated TYPE, consume it. Otherwise,
23013 issue an error message indicating that TOKEN_DESC was expected.
23015 Returns the token consumed, if the token had the appropriate type.
23016 Otherwise, returns NULL. */
23021 required_token token_desc)
23022 {
23025 else
23026 {
23027 /* Output the MESSAGE -- unless we're parsing tentatively. */
23031 }
23032 }
23034 /* An error message is produced if the next token is not '>'.
23035 All further tokens are skipped until the desired token is
23036 found or '{', '}', ';' or an unbalanced ')' or ']'. */
23038 static void
23040 {
23041 /* Current level of '< ... >'. */
23043 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
23046 /* Are we ready, yet? If not, issue error message. */
23050 /* Skip tokens until the desired token is found. */
23052 {
23053 /* Peek at the next token. */
23055 {
23063 /* C++0x views the `>>' operator as two `>' tokens, but
23064 C++98 does not. */
23067 {
23068 /* We've hit a `>>' where the first `>' closes the
23069 template argument list, and the second `>' is
23070 spurious. Just consume the `>>' and stop; we've
23071 already produced at least one error. */
23074 }
23075 /* Fall through for C++0x, so we handle the second `>' in
23076 the `>>'. */
23080 {
23081 /* We've reached the token we want, consume it and stop. */
23084 }
23103 /* The '>' was probably forgotten, don't look further. */
23108 }
23110 /* Consume this token. */
23112 }
23113 }
23115 /* If the next token is the indicated keyword, consume it. Otherwise,
23116 issue an error message indicating that TOKEN_DESC was expected.
23118 Returns the token consumed, if the token had the appropriate type.
23119 Otherwise, returns NULL. */
23124 required_token token_desc)
23125 {
23129 {
23132 }
23135 }
23137 /* Returns TRUE iff TOKEN is a token that can begin the body of a
23138 function-definition. */
23140 static bool
23142 {
23145 /* A ctor-initializer begins with a `:'. */
23147 /* A function-try-block begins with `try'. */
23149 /* A function-transaction-block begins with `__transaction_atomic'
23150 or `__transaction_relaxed'. */
23153 /* The named return value extension begins with `return'. */
23155 }
23157 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
23158 definition. */
23160 static bool
23162 {
23167 }
23169 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
23170 C++0x) ending a template-argument. */
23172 static bool
23174 {
23182 }
23184 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
23185 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
23187 static bool
23190 {
23196 /* Check for the sequence `<::' in the original code. It would be lexed as
23197 `[:', where `[' is a digraph, and there is no whitespace before
23198 `:'. */
23200 {
23205 }
23207 }
23209 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
23210 or none_type otherwise. */
23212 static enum tag_types
23214 {
23216 {
23226 }
23227 }
23229 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
23231 static void
23233 {
23237 {
23241 type);
23244 }
23245 }
23247 /* Issue an error message if DECL is redeclared with different
23248 access than its original declaration [class.access.spec/3].
23249 This applies to nested classes and nested class templates.
23250 [class.mem/1]. */
23252 static void
23254 {
23263 }
23265 /* Look for the `template' keyword, as a syntactic disambiguator.
23266 Return TRUE iff it is present, in which case it will be
23267 consumed. */
23269 static bool
23271 {
23273 {
23274 /* In C++98 the `template' keyword can only be used within templates;
23275 outside templates the parser can always figure out what is a
23276 template and what is not. In C++11, per the resolution of DR 468,
23277 `template' is allowed in cases where it is not strictly necessary. */
23280 {
23283 "in C++98 %<template%> (as a disambiguator) is only "
23285 /* If this part of the token stream is rescanned, the same
23286 error message would be generated. So, we purge the token
23287 from the stream. */
23290 }
23291 else
23292 {
23293 /* Consume the `template' keyword. */
23296 }
23297 }
23299 }
23301 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
23302 set PARSER->SCOPE, and perform other related actions. */
23304 static void
23306 {
23312 /* Get the stored value. */
23314 /* Perform any access checks that were deferred. */
23317 {
23322 }
23323 /* Set the scope from the stored value. */
23327 }
23329 /* Consume tokens up through a non-nested END token. Returns TRUE if we
23330 encounter the end of a block before what we were looking for. */
23332 static bool
23336 {
23338 {
23341 /* Abort a parenthesized expression if we encounter a semicolon. */
23345 /* If we've reached the end of the file, stop. */
23351 /* We've hit the end of an enclosing block, so there's been some
23352 kind of syntax error. */
23355 /* Consume the token. */
23357 /* See if it starts a new group. */
23359 {
23361 /* In theory this should probably check end == '}', but
23362 cp_parser_save_member_function_body needs it to exit
23363 after either '}' or ')' when called with ')'. */
23366 }
23368 {
23372 }
23377 }
23378 }
23380 /* Like above, for caching a default argument or NSDMI. Both of these are
23381 terminated by a non-nested comma, but it can be unclear whether or not a
23382 comma is nested in a template argument list unless we do more parsing.
23383 In order to handle this ambiguity, when we encounter a ',' after a '<'
23384 we try to parse what follows as a parameter-declaration-list (in the
23385 case of a default argument) or a member-declarator (in the case of an
23386 NSDMI). If that succeeds, then we stop caching. */
23388 static tree
23390 {
23395 tree default_argument;
23397 /* Add tokens until we have processed the entire default
23398 argument. We add the range [first_token, token). */
23401 {
23402 /* For list-initialization, this is straightforward. */
23405 }
23407 {
23410 /* Peek at the next token. */
23412 /* What we do depends on what token we have. */
23414 {
23415 /* In valid code, a default argument must be
23416 immediately followed by a `,' `)', or `...'. */
23419 {
23420 /* If we've seen a '<', we might be in a
23421 template-argument-list. Until Core issue 325 is
23422 resolved, we don't know how this situation ought
23423 to be handled, so try to DTRT. We check whether
23424 what comes after the comma is a valid parameter
23425 declaration list. If it is, then the comma ends
23426 the default argument; otherwise the default
23427 argument continues. */
23429 tree t;
23431 /* Set ITALP so cp_parser_parameter_declaration_list
23432 doesn't decide to commit to this parse. */
23440 {
23446 }
23447 else
23448 {
23454 }
23461 }
23464 /* If we run into a non-nested `;', `}', or `]',
23465 then the code is invalid -- but the default
23466 argument is certainly over. */
23472 /* Update DEPTH, if necessary. */
23487 /* This might be the comparison operator, or it might
23488 start a template argument list. */
23495 /* Fall through for C++0x, which treats the `>>'
23496 operator like two `>' tokens in certain
23497 cases. */
23501 {
23502 /* This might be an operator, or it might close a
23503 template argument list. But if a previous '<'
23504 started a template argument list, this will have
23505 closed it, so we can't be in one anymore. */
23509 }
23512 /* If we run out of tokens, issue an error message. */
23521 /* In these cases, we should look for template-ids.
23522 For example, if the default argument is
23523 `X<int, double>()', we need to do name lookup to
23524 figure out whether or not `X' is a template; if
23525 so, the `,' does not end the default argument.
23527 That is not yet done. */
23532 }
23534 /* If we've reached the end, stop. */
23538 /* Add the token to the token block. */
23540 }
23542 /* Create a DEFAULT_ARG to represent the unparsed default
23543 argument. */
23550 }
23552 /* Begin parsing tentatively. We always save tokens while parsing
23553 tentatively so that if the tentative parsing fails we can restore the
23554 tokens. */
23556 static void
23558 {
23559 /* Enter a new parsing context. */
23561 /* Begin saving tokens. */
23563 /* In order to avoid repetitive access control error messages,
23564 access checks are queued up until we are no longer parsing
23565 tentatively. */
23567 }
23569 /* Commit to the currently active tentative parse. */
23571 static void
23573 {
23577 /* Mark all of the levels as committed. */
23580 {
23587 }
23588 }
23590 /* Abort the currently active tentative parse. All consumed tokens
23591 will be rolled back, and no diagnostics will be issued. */
23593 static void
23595 {
23599 /* Now, pretend that we want to see if the construct was
23600 successfully parsed. */
23602 }
23604 /* Stop parsing tentatively. If a parse error has occurred, restore the
23605 token stream. Otherwise, commit to the tokens we have consumed.
23606 Returns true if no error occurred; false otherwise. */
23608 static bool
23610 {
23614 /* Remember whether or not an error occurred, since we are about to
23615 destroy that information. */
23617 /* Remove the topmost context from the stack. */
23620 /* If no parse errors occurred, commit to the tentative parse. */
23622 {
23623 /* Commit to the tokens read tentatively, unless that was
23624 already done. */
23629 }
23630 /* Otherwise, if errors occurred, roll back our state so that things
23631 are just as they were before we began the tentative parse. */
23632 else
23633 {
23636 }
23637 /* Add the context to the front of the free list. */
23642 }
23644 /* Returns true if we are parsing tentatively and are not committed to
23645 this tentative parse. */
23647 static bool
23649 {
23652 }
23654 /* Returns nonzero iff an error has occurred during the most recent
23655 tentative parse. */
23657 static bool
23659 {
23662 }
23664 /* Returns nonzero if GNU extensions are allowed. */
23666 static bool
23668 {
23670 }
23671 \f
23672 /* Objective-C++ Productions */
23675 /* Parse an Objective-C expression, which feeds into a primary-expression
23676 above.
23678 objc-expression:
23679 objc-message-expression
23680 objc-string-literal
23681 objc-encode-expression
23682 objc-protocol-expression
23683 objc-selector-expression
23685 Returns a tree representation of the expression. */
23687 static tree
23689 {
23690 /* Try to figure out what kind of declaration is present. */
23694 {
23704 {
23716 }
23722 }
23725 }
23727 /* Parse an Objective-C message expression.
23729 objc-message-expression:
23730 [ objc-message-receiver objc-message-args ]
23732 Returns a representation of an Objective-C message. */
23734 static tree
23736 {
23745 }
23747 /* Parse an objc-message-receiver.
23749 objc-message-receiver:
23750 expression
23751 simple-type-specifier
23753 Returns a representation of the type or expression. */
23755 static tree
23757 {
23758 tree rcv;
23760 /* An Objective-C message receiver may be either (1) a type
23761 or (2) an expression. */
23770 CP_PARSER_FLAGS_NONE);
23773 }
23775 /* Parse the arguments and selectors comprising an Objective-C message.
23777 objc-message-args:
23778 objc-selector
23779 objc-selector-args
23780 objc-selector-args , objc-comma-args
23782 objc-selector-args:
23783 objc-selector [opt] : assignment-expression
23784 objc-selector-args objc-selector [opt] : assignment-expression
23786 objc-comma-args:
23787 assignment-expression
23788 objc-comma-args , assignment-expression
23790 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23791 selector arguments and TREE_VALUE containing a list of comma
23792 arguments. */
23794 static tree
23796 {
23802 {
23808 /* Detect if we have a unary selector. */
23817 sel_args
23822 }
23824 /* Handle non-selector arguments, if any. */
23826 {
23827 tree arg;
23832 addl_args
23837 }
23840 {
23843 }
23846 }
23848 /* Parse an Objective-C encode expression.
23850 objc-encode-expression:
23851 @encode objc-typename
23853 Returns an encoded representation of the type argument. */
23855 static tree
23857 {
23858 tree type;
23868 {
23872 }
23874 /* This happens if we find @encode(T) (where T is a template
23875 typename or something dependent on a template typename) when
23876 parsing a template. In that case, we can't compile it
23877 immediately, but we rather create an AT_ENCODE_EXPR which will
23878 need to be instantiated when the template is used.
23879 */
23881 {
23885 }
23888 }
23890 /* Parse an Objective-C @defs expression. */
23892 static tree
23894 {
23895 tree name;
23903 }
23905 /* Parse an Objective-C protocol expression.
23907 objc-protocol-expression:
23908 @protocol ( identifier )
23910 Returns a representation of the protocol expression. */
23912 static tree
23914 {
23915 tree proto;
23923 }
23925 /* Parse an Objective-C selector expression.
23927 objc-selector-expression:
23928 @selector ( objc-method-signature )
23930 objc-method-signature:
23931 objc-selector
23932 objc-selector-seq
23934 objc-selector-seq:
23935 objc-selector :
23936 objc-selector-seq objc-selector :
23938 Returns a representation of the method selector. */
23940 static tree
23942 {
23954 {
23963 {
23964 /* Detect if we have a unary selector. */
23966 {
23969 }
23970 else
23971 {
23973 }
23974 }
23979 {
23980 sel_seq
23983 sel_seq
23986 }
23987 else
23988 sel_seq
23993 }
23995 finish_selector:
23999 }
24001 /* Parse a list of identifiers.
24003 objc-identifier-list:
24004 identifier
24005 objc-identifier-list , identifier
24007 Returns a TREE_LIST of identifier nodes. */
24009 static tree
24011 {
24012 tree identifier;
24013 tree list;
24024 {
24031 identifier));
24033 }
24036 }
24038 /* Parse an Objective-C alias declaration.
24040 objc-alias-declaration:
24041 @compatibility_alias identifier identifier ;
24043 This function registers the alias mapping with the Objective-C front end.
24044 It returns nothing. */
24046 static void
24048 {
24056 }
24058 /* Parse an Objective-C class forward-declaration.
24060 objc-class-declaration:
24061 @class objc-identifier-list ;
24063 The function registers the forward declarations with the Objective-C
24064 front end. It returns nothing. */
24066 static void
24068 {
24071 {
24072 tree id;
24082 else
24084 }
24086 }
24088 /* Parse a list of Objective-C protocol references.
24090 objc-protocol-refs-opt:
24091 objc-protocol-refs [opt]
24093 objc-protocol-refs:
24094 < objc-identifier-list >
24096 Returns a TREE_LIST of identifiers, if any. */
24098 static tree
24100 {
24104 {
24108 }
24111 }
24113 /* Parse a Objective-C visibility specification. */
24115 static void
24117 {
24121 {
24136 }
24138 /* Eat '@private'/'@protected'/'@public'. */
24140 }
24142 /* Parse an Objective-C method type. Return 'true' if it is a class
24143 (+) method, and 'false' if it is an instance (-) method. */
24147 {
24150 else
24152 }
24154 /* Parse an Objective-C protocol qualifier. */
24156 static tree
24158 {
24171 {
24176 }
24179 }
24181 /* Parse an Objective-C typename. */
24183 static tree
24185 {
24189 {
24195 /* An ObjC type name may consist of just protocol qualifiers, in which
24196 case the type shall default to 'id'. */
24198 {
24201 /* If the type could not be parsed, an error has already
24202 been produced. For error recovery, behave as if it had
24203 not been specified, which will use the default type
24204 'id'. */
24206 {
24208 /* We need to skip to the closing parenthesis as
24209 cp_parser_type_id() does not seem to do it for
24210 us. */
24215 }
24216 }
24220 }
24223 }
24225 /* Check to see if TYPE refers to an Objective-C selector name. */
24227 static bool
24229 {
24235 }
24237 /* Parse an Objective-C selector. */
24239 static tree
24241 {
24245 {
24248 }
24250 /* C++ operator names are allowed to appear in ObjC selectors. */
24252 {
24265 }
24266 }
24268 /* Parse an Objective-C params list. */
24270 static tree
24272 {
24278 {
24288 /* Detect if we have a unary selector. */
24291 {
24294 }
24298 {
24299 /* Something went quite wrong. There should be a colon
24300 here, but there is not. Stop parsing parameters. */
24302 }
24304 /* New ObjC allows attributes on parameters too. */
24309 params
24312 type_name,
24313 identifier,
24314 parm_attr));
24317 }
24320 {
24323 }
24325 /* We allow tail attributes for the method. */
24327 {
24335 }
24338 {
24341 }
24343 }
24345 /* Parse the non-keyword Objective-C params. */
24347 static tree
24350 {
24356 {
24358 tree parm;
24364 {
24369 }
24371 /* TODO: parse attributes for tail parameters. */
24380 }
24382 /* We allow tail attributes for the method. */
24384 {
24386 {
24391 }
24392 else
24393 /* We have an error, but parse the attributes, so that we can
24394 carry on. */
24400 }
24403 }
24405 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
24407 static void
24409 {
24412 /* If the next token is `extern' and the following token is a string
24413 literal, then we have a linkage specification. */
24415 && cp_parser_is_pure_string_literal
24418 /* Handle #pragma, if any. */
24421 /* Allow stray semicolons. */
24424 /* Mark methods as optional or required, when building protocols. */
24426 {
24429 }
24431 {
24434 }
24437 /* Other stray characters must generate errors. */
24439 {
24443 }
24444 /* Finally, try to parse a block-declaration, or a function-definition. */
24445 else
24447 }
24449 /* Parse a method signature. */
24451 static tree
24453 {
24469 }
24471 static bool
24473 {
24474 tree tattr;
24479 /* If the attributes are followed by a method introducer, this is not allowed.
24480 Dump the attributes and flag the situation. */
24485 /* Otherwise, the attributes introduce some interstitial code, possibly so
24486 rewind to allow that check. */
24489 }
24491 /* Parse an Objective-C method prototype list. */
24493 static void
24495 {
24499 {
24501 {
24506 else
24510 {
24514 }
24517 }
24523 OPT_Wattributes,
24525 else
24526 /* Allow for interspersed non-ObjC++ code. */
24530 }
24534 else
24538 }
24540 /* Parse an Objective-C method definition list. */
24542 static void
24544 {
24548 {
24549 tree meth;
24552 {
24558 else
24563 {
24567 }
24569 NULL_TREE);
24571 /* For historical reasons, we accept an optional semicolon. */
24578 {
24585 }
24586 }
24587 /* The following case will be removed once @synthesize is
24588 completely implemented. */
24599 else
24600 /* Allow for interspersed non-ObjC++ code. */
24604 }
24608 else
24612 }
24614 /* Parse Objective-C ivars. */
24616 static void
24618 {
24629 {
24630 cp_decl_specifier_seq declspecs;
24632 tree prefix_attributes;
24640 CP_PARSER_FLAGS_OPTIONAL,
24644 /* auto, register, static, extern, mutable. */
24646 {
24649 }
24651 /* thread_local. */
24653 {
24656 }
24658 /* typedef. */
24660 {
24663 }
24668 /* Keep going until we hit the `;' at the end of the
24669 declaration. */
24671 {
24676 /* Check for a (possibly unnamed) bitfield declaration. */
24684 {
24685 /* Get the name of the bitfield. */
24688 sfk_none);
24690 eat_colon:
24692 /* Get the width of the bitfield. */
24693 width
24696 NULL);
24697 }
24698 else
24699 {
24700 /* Parse the declarator. */
24701 declarator
24706 }
24708 /* Look for attributes that apply to the ivar. */
24710 /* Remember which attributes are prefix attributes and
24711 which are not. */
24713 /* Combine the attributes. */
24717 /* Create the bitfield declaration. */
24719 width,
24720 attributes);
24721 else
24726 /* Add the instance variable. */
24730 /* Reset PREFIX_ATTRIBUTES. */
24739 {
24742 }
24744 }
24748 }
24753 /* Do not consume the RID_AT_END, so it will be read again as terminating
24754 the @interface of @implementation. */
24758 /* For historical reasons, we accept an optional semicolon. */
24761 }
24763 /* Parse an Objective-C protocol declaration. */
24765 static void
24767 {
24773 {
24778 }
24780 /* See if we have a forward declaration or a definition. */
24783 /* Try a forward declaration first. */
24785 {
24787 {
24788 tree id;
24798 else
24800 }
24802 }
24804 /* Ok, we got a full-fledged definition (or at least should). */
24805 else
24806 {
24811 }
24812 }
24814 /* Parse an Objective-C superclass or category. */
24816 static void
24821 {
24827 {
24830 }
24832 {
24835 /* If there is no category name, and this is an @interface, we
24836 have a class extension. */
24838 {
24841 }
24842 else
24846 }
24847 }
24849 /* Parse an Objective-C class interface. */
24851 static void
24853 {
24860 {
24861 /* It's hard to recover because even if valid @interface stuff
24862 is to follow, we can't compile it (or validate it) if we
24863 don't even know which class it refers to. Let's assume this
24864 was a stray '@interface' token in the stream and skip it.
24865 */
24867 }
24872 /* We have either a class or a category on our hands. */
24875 else
24876 {
24878 /* Handle instance variable declarations, if any. */
24881 }
24884 }
24886 /* Parse an Objective-C class implementation. */
24888 static void
24890 {
24897 {
24898 /* It's hard to recover because even if valid @implementation
24899 stuff is to follow, we can't compile it (or validate it) if
24900 we don't even know which class it refers to. Let's assume
24901 this was a stray '@implementation' token in the stream and
24902 skip it.
24903 */
24905 }
24909 /* We have either a class or a category on our hands. */
24912 else
24913 {
24915 /* Handle instance variable declarations, if any. */
24918 }
24921 }
24923 /* Consume the @end token and finish off the implementation. */
24925 static void
24927 {
24930 }
24932 /* Parse an Objective-C declaration. */
24934 static void
24936 {
24937 /* Try to figure out what kind of declaration is present. */
24942 {
24958 }
24961 {
24984 }
24985 }
24987 /* Parse an Objective-C try-catch-finally statement.
24989 objc-try-catch-finally-stmt:
24990 @try compound-statement objc-catch-clause-seq [opt]
24991 objc-finally-clause [opt]
24993 objc-catch-clause-seq:
24994 objc-catch-clause objc-catch-clause-seq [opt]
24996 objc-catch-clause:
24997 @catch ( objc-exception-declaration ) compound-statement
24999 objc-finally-clause:
25000 @finally compound-statement
25002 objc-exception-declaration:
25003 parameter-declaration
25004 '...'
25006 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
25008 Returns NULL_TREE.
25010 PS: This function is identical to c_parser_objc_try_catch_finally_statement
25011 for C. Keep them in sync. */
25013 static tree
25015 {
25016 location_t location;
25017 tree stmt;
25022 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
25023 node, lest it get absorbed into the surrounding block. */
25029 {
25038 {
25039 /* We have "@catch (...)" (where the '...' are literally
25040 what is in the code). Skip the '...'.
25041 parameter_declaration is set to NULL_TREE, and
25042 objc_being_catch_clauses() knows that that means
25043 '...'. */
25046 }
25047 else
25048 {
25049 /* We have "@catch (NSException *exception)" or something
25050 like that. Parse the parameter declaration. */
25054 else
25059 }
25062 else
25063 {
25064 /* If there was no open parenthesis, we are recovering from
25065 an error, and we are trying to figure out what mistake
25066 the user has made. */
25068 /* If there is an immediate closing parenthesis, the user
25069 probably forgot the opening one (ie, they typed "@catch
25070 NSException *e)". Parse the closing parenthesis and keep
25071 going. */
25075 /* If these is no immediate closing parenthesis, the user
25076 probably doesn't know that parenthesis are required at
25077 all (ie, they typed "@catch NSException *e"). So, just
25078 forget about the closing parenthesis and keep going. */
25079 }
25083 }
25085 {
25088 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
25089 node, lest it get absorbed into the surrounding block. */
25093 }
25096 }
25098 /* Parse an Objective-C synchronized statement.
25100 objc-synchronized-stmt:
25101 @synchronized ( expression ) compound-statement
25103 Returns NULL_TREE. */
25105 static tree
25107 {
25108 location_t location;
25119 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
25120 node, lest it get absorbed into the surrounding block. */
25125 }
25127 /* Parse an Objective-C throw statement.
25129 objc-throw-stmt:
25130 @throw assignment-expression [opt] ;
25132 Returns a constructed '@throw' statement. */
25134 static tree
25136 {
25148 }
25150 /* Parse an Objective-C statement. */
25152 static tree
25154 {
25155 /* Try to figure out what kind of declaration is present. */
25159 {
25170 }
25173 }
25175 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
25176 look ahead to see if an objc keyword follows the attributes. This
25177 is to detect the use of prefix attributes on ObjC @interface and
25178 @protocol. */
25180 static bool
25182 {
25187 {
25190 }
25193 }
25195 /* This routine is a minimal replacement for
25196 c_parser_struct_declaration () used when parsing the list of
25197 types/names or ObjC++ properties. For example, when parsing the
25198 code
25200 @property (readonly) int a, b, c;
25202 this function is responsible for parsing "int a, int b, int c" and
25203 returning the declarations as CHAIN of DECLs.
25205 TODO: Share this code with cp_parser_objc_class_ivars. It's very
25206 similar parsing. */
25207 static tree
25209 {
25211 cp_decl_specifier_seq declspecs;
25213 tree prefix_attributes;
25216 CP_PARSER_FLAGS_NONE,
25223 /* auto, register, static, extern, mutable. */
25225 {
25228 }
25230 /* thread_local. */
25232 {
25235 }
25237 /* typedef. */
25239 {
25242 }
25247 /* Keep going until we hit the `;' at the end of the declaration. */
25249 {
25254 /* Parse the declarator. */
25258 /* Look for attributes that apply to the ivar. */
25260 /* Remember which attributes are prefix attributes and
25261 which are not. */
25263 /* Combine the attributes. */
25273 /* Reset PREFIX_ATTRIBUTES. */
25284 {
25287 }
25288 else
25290 }
25292 }
25294 /* Parse an Objective-C @property declaration. The syntax is:
25296 objc-property-declaration:
25297 '@property' objc-property-attributes[opt] struct-declaration ;
25299 objc-property-attributes:
25300 '(' objc-property-attribute-list ')'
25302 objc-property-attribute-list:
25303 objc-property-attribute
25304 objc-property-attribute-list, objc-property-attribute
25306 objc-property-attribute
25307 'getter' = identifier
25308 'setter' = identifier
25309 'readonly'
25310 'readwrite'
25311 'assign'
25312 'retain'
25313 'copy'
25314 'nonatomic'
25316 For example:
25317 @property NSString *name;
25318 @property (readonly) id object;
25319 @property (retain, nonatomic, getter=getTheName) id name;
25320 @property int a, b, c;
25322 PS: This function is identical to
25323 c_parser_objc_at_property_declaration for C. Keep them in sync. */
25324 static void
25326 {
25327 /* The following variables hold the attributes of the properties as
25328 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
25329 seen. When we see an attribute, we set them to 'true' (if they
25330 are boolean properties) or to the identifier (if they have an
25331 argument, ie, for getter and setter). Note that here we only
25332 parse the list of attributes, check the syntax and accumulate the
25333 attributes that we find. objc_add_property_declaration() will
25334 then process the information. */
25344 /* 'properties' is the list of properties that we read. Usually a
25345 single one, but maybe more (eg, in "@property int a, b, c;" there
25346 are three). */
25347 tree properties;
25348 location_t loc;
25354 /* Parse the optional attribute list... */
25356 {
25357 /* Eat the '('. */
25361 {
25367 {
25370 }
25374 {
25385 {
25389 else
25394 }
25397 {
25401 }
25403 {
25405 {
25408 }
25409 else
25413 else
25415 }
25416 else
25417 {
25419 {
25422 }
25423 else
25425 }
25431 }
25438 else
25440 }
25442 /* FIXME: "@property (setter, assign);" will generate a spurious
25443 "error: expected ‘)’ before ‘,’ token". This is because
25444 cp_parser_require, unlike the C counterpart, will produce an
25445 error even if we are in error recovery. */
25447 {
25452 }
25453 }
25455 /* ... and the property declaration(s). */
25459 {
25461 /* If the next token is now a `;', consume it. */
25465 }
25469 else
25470 {
25471 /* Comma-separated properties are chained together in
25472 reverse order; add them one by one. */
25481 }
25484 }
25486 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
25488 objc-synthesize-declaration:
25489 @synthesize objc-synthesize-identifier-list ;
25491 objc-synthesize-identifier-list:
25492 objc-synthesize-identifier
25493 objc-synthesize-identifier-list, objc-synthesize-identifier
25495 objc-synthesize-identifier
25496 identifier
25497 identifier = identifier
25499 For example:
25500 @synthesize MyProperty;
25501 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
25503 PS: This function is identical to c_parser_objc_at_synthesize_declaration
25504 for C. Keep them in sync.
25505 */
25506 static void
25508 {
25510 location_t loc;
25515 {
25519 {
25522 }
25524 {
25528 {
25531 }
25532 }
25533 else
25538 else
25540 }
25543 }
25545 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
25547 objc-dynamic-declaration:
25548 @dynamic identifier-list ;
25550 For example:
25551 @dynamic MyProperty;
25552 @dynamic MyProperty, AnotherProperty;
25554 PS: This function is identical to c_parser_objc_at_dynamic_declaration
25555 for C. Keep them in sync.
25556 */
25557 static void
25559 {
25561 location_t loc;
25566 {
25567 tree property;
25570 {
25573 }
25577 else
25579 }
25582 }
25584 \f
25585 /* OpenMP 2.5 parsing routines. */
25587 /* Returns name of the next clause.
25588 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
25589 the token is not consumed. Otherwise appropriate pragma_omp_clause is
25590 returned and the token is consumed. */
25592 static pragma_omp_clause
25594 {
25604 {
25609 {
25656 }
25657 }
25663 }
25665 /* Validate that a clause of the given type does not already exist. */
25667 static void
25670 {
25671 tree c;
25675 {
25678 }
25679 }
25681 /* OpenMP 2.5:
25682 variable-list:
25683 identifier
25684 variable-list , identifier
25686 In addition, we match a closing parenthesis. An opening parenthesis
25687 will have been consumed by the caller.
25689 If KIND is nonzero, create the appropriate node and install the decl
25690 in OMP_CLAUSE_DECL and add the node to the head of the list.
25692 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25693 return the list created. */
25695 static tree
25697 tree list)
25698 {
25701 {
25718 {
25723 }
25724 else
25727 get_comma:
25731 }
25734 {
25737 /* Try to resync to an unnested comma. Copied from
25738 cp_parser_parenthesized_expression_list. */
25739 skip_comma:
25746 }
25749 }
25751 /* Similarly, but expect leading and trailing parenthesis. This is a very
25752 common case for omp clauses. */
25754 static tree
25756 {
25760 }
25762 /* OpenMP 3.0:
25763 collapse ( constant-expression ) */
25765 static tree
25767 {
25769 location_t loc;
25770 HOST_WIDE_INT n;
25790 {
25793 }
25801 }
25803 /* OpenMP 2.5:
25804 default ( shared | none ) */
25806 static tree
25808 {
25810 tree c;
25815 {
25820 {
25835 }
25838 }
25839 else
25840 {
25841 invalid_kind:
25843 }
25859 }
25861 /* OpenMP 3.1:
25862 final ( expression ) */
25864 static tree
25866 {
25887 }
25889 /* OpenMP 2.5:
25890 if ( expression ) */
25892 static tree
25894 {
25915 }
25917 /* OpenMP 3.1:
25918 mergeable */
25920 static tree
25923 {
25924 tree c;
25927 location);
25932 }
25934 /* OpenMP 2.5:
25935 nowait */
25937 static tree
25940 {
25941 tree c;
25948 }
25950 /* OpenMP 2.5:
25951 num_threads ( expression ) */
25953 static tree
25955 location_t location)
25956 {
25978 }
25980 /* OpenMP 2.5:
25981 ordered */
25983 static tree
25986 {
25987 tree c;
25995 }
25997 /* OpenMP 2.5:
25998 reduction ( reduction-operator : variable-list )
26000 reduction-operator:
26001 One of: + * - & ^ | && ||
26003 OpenMP 3.1:
26005 reduction-operator:
26006 One of: + * - & ^ | && || min max */
26008 static tree
26010 {
26018 {
26044 {
26049 {
26052 }
26054 {
26057 }
26058 }
26059 /* FALLTHROUGH */
26063 resync_fail:
26068 }
26079 }
26081 /* OpenMP 2.5:
26082 schedule ( schedule-kind )
26083 schedule ( schedule-kind , expression )
26085 schedule-kind:
26086 static | dynamic | guided | runtime | auto */
26088 static tree
26090 {
26099 {
26104 {
26125 }
26126 }
26131 else
26136 {
26151 else
26156 }
26164 invalid_kind:
26166 resync_fail:
26171 }
26173 /* OpenMP 3.0:
26174 untied */
26176 static tree
26179 {
26180 tree c;
26187 }
26189 /* Parse all OpenMP clauses. The set clauses allowed by the directive
26190 is a bitmask in MASK. Return the list of clauses found; the result
26191 of clause default goes in *pdefault. */
26193 static tree
26196 {
26202 {
26203 pragma_omp_clause c_kind;
26215 {
26227 clauses);
26241 clauses);
26250 clauses);
26274 clauses);
26288 clauses);
26299 }
26302 {
26303 /* Remove the invalid clause(s) from the list to avoid
26304 confusing the rest of the compiler. */
26307 }
26308 }
26309 saw_error:
26312 }
26314 /* OpenMP 2.5:
26315 structured-block:
26316 statement
26318 In practice, we're also interested in adding the statement to an
26319 outer node. So it is convenient if we work around the fact that
26320 cp_parser_statement calls add_stmt. */
26322 static unsigned
26324 {
26327 /* Only move the values to IN_OMP_BLOCK if they weren't false.
26328 This preserves the "not within loop or switch" style error messages
26329 for nonsense cases like
26330 void foo() {
26331 #pragma omp single
26332 break;
26333 }
26334 */
26339 }
26341 static void
26343 {
26345 }
26347 static tree
26349 {
26357 }
26359 /* OpenMP 2.5:
26360 # pragma omp atomic new-line
26361 expression-stmt
26363 expression-stmt:
26364 x binop= expr | x++ | ++x | x-- | --x
26365 binop:
26366 +, *, -, /, &, ^, |, <<, >>
26368 where x is an lvalue expression with scalar type.
26370 OpenMP 3.1:
26371 # pragma omp atomic new-line
26372 update-stmt
26374 # pragma omp atomic read new-line
26375 read-stmt
26377 # pragma omp atomic write new-line
26378 write-stmt
26380 # pragma omp atomic update new-line
26381 update-stmt
26383 # pragma omp atomic capture new-line
26384 capture-stmt
26386 # pragma omp atomic capture new-line
26387 capture-block
26389 read-stmt:
26390 v = x
26391 write-stmt:
26392 x = expr
26393 update-stmt:
26394 expression-stmt | x = x binop expr
26395 capture-stmt:
26396 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
26397 capture-block:
26398 { v = x; update-stmt; } | { update-stmt; v = x; }
26400 where x and v are lvalue expressions with scalar type. */
26402 static void
26404 {
26411 {
26423 else
26427 }
26431 {
26442 else
26448 {
26449 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
26450 opcode. */
26455 }
26459 {
26462 }
26463 else
26464 {
26471 }
26474 }
26476 restart:
26481 {
26488 /* FALLTHROUGH */
26498 /* FALLTHROUGH */
26513 /* Undo effects of boolean_increment for post {in,de}crement. */
26515 /* FALLTHRU */
26519 {
26520 /* Undo effects of boolean_increment. */
26522 {
26523 /* This is pre or post increment. */
26528 && !structured_block
26532 }
26533 }
26534 /* FALLTHRU */
26537 {
26567 {
26577 {
26580 {
26588 }
26623 }
26634 }
26635 /* FALLTHROUGH */
26640 }
26647 }
26648 stmt_done:
26650 {
26663 }
26665 {
26668 }
26669 done:
26675 saw_error:
26678 {
26682 {
26686 }
26687 }
26688 }
26691 /* OpenMP 2.5:
26692 # pragma omp barrier new-line */
26694 static void
26696 {
26699 }
26701 /* OpenMP 2.5:
26702 # pragma omp critical [(name)] new-line
26703 structured-block */
26705 static tree
26707 {
26711 {
26723 }
26728 }
26730 /* OpenMP 2.5:
26731 # pragma omp flush flush-vars[opt] new-line
26733 flush-vars:
26734 ( variable-list ) */
26736 static void
26738 {
26744 }
26746 /* Helper function, to parse omp for increment expression. */
26748 static tree
26750 {
26755 {
26758 }
26761 {
26769 }
26771 /* If decl is an iterator, preserve LHS and RHS of the relational
26772 expr until finish_omp_for. */
26782 }
26784 /* Helper function, to parse omp for increment expression. */
26786 static tree
26788 {
26792 cp_id_kind idk;
26796 {
26804 }
26812 {
26817 }
26824 {
26828 }
26840 do
26841 {
26848 {
26850 {
26853 else
26855 tf_warning_or_error);
26856 }
26857 else
26860 }
26861 }
26865 {
26869 }
26870 else
26874 }
26876 /* Parse the restricted form of the for statement allowed by OpenMP. */
26878 static tree
26880 {
26884 location_t loc_first;
26903 {
26906 location_t loc;
26909 {
26912 }
26921 {
26922 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26924 init-expr:
26925 var = lb
26926 integer-type var = lb
26927 random-access-iterator-type var = lb
26928 pointer-type var = lb
26929 */
26930 cp_decl_specifier_seq type_specifiers;
26932 /* First, try to parse as an initialized declaration. See
26933 cp_parser_condition, from whence the bulk of this is copied. */
26940 {
26941 /* If parsing a type specifier seq succeeded, then this
26942 MUST be a initialized declaration. */
26947 CP_PARSER_DECLARATOR_NAMED,
26957 else
26958 {
26968 {
26970 CPP_OPEN_PAREN))
26973 else
26974 /* Trigger an error. */
26979 }
26983 {
26991 {
26994 auto_node);
26999 }
27002 asm_specification,
27003 LOOKUP_ONLYCONVERTING);
27005 {
27008 }
27009 else
27012 }
27013 else
27014 {
27015 /* Consume '='. */
27019 non_class:
27022 else
27025 asm_specification,
27026 LOOKUP_ONLYCONVERTING);
27027 }
27031 }
27032 }
27033 else
27034 {
27035 cp_id_kind idk;
27036 /* If parsing a type specifier sequence failed, then
27037 this MUST be a simple expression. */
27042 && decl
27045 {
27046 tree rhs;
27053 rhs,
27054 tf_warning_or_error));
27056 }
27057 else
27058 {
27063 {
27067 }
27068 }
27069 }
27070 }
27073 {
27076 {
27082 }
27083 else
27085 }
27090 {
27095 {
27099 }
27102 {
27103 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
27104 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
27113 }
27114 else
27115 {
27120 }
27121 }
27124 {
27125 tree c;
27127 {
27136 decl);
27140 decl);
27141 }
27143 {
27148 {
27151 }
27152 }
27153 }
27162 {
27163 /* If decl is an iterator, preserve the operator on decl
27164 until finish_omp_for. */
27166 && ((processing_template_decl
27170 else
27174 }
27189 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
27190 in between the collapsed for loops to be still considered perfectly
27191 nested. Hopefully the final version clarifies this.
27192 For now handle (multiple) {'s and empty statements. */
27194 do
27195 {
27199 {
27201 bracecount++;
27202 }
27206 else
27207 {
27214 }
27215 }
27219 {
27222 }
27223 }
27225 /* Note that we saved the original contents of this flag when we entered
27226 the structured block, and so we don't need to re-save it here. */
27229 /* Note that the grammar doesn't call for a structured block here,
27230 though the loop as a whole is a structured block. */
27237 else
27242 {
27244 {
27246 nbraces--;
27247 }
27250 else
27251 {
27253 {
27256 }
27261 }
27262 }
27269 }
27271 /* OpenMP 2.5:
27272 #pragma omp for for-clause[optseq] new-line
27273 for-loop */
27275 #define OMP_FOR_CLAUSE_MASK \
27276 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27277 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27278 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27279 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27280 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
27281 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
27282 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
27283 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
27285 static tree
27287 {
27303 }
27305 /* OpenMP 2.5:
27306 # pragma omp master new-line
27307 structured-block */
27309 static tree
27311 {
27315 }
27317 /* OpenMP 2.5:
27318 # pragma omp ordered new-line
27319 structured-block */
27321 static tree
27323 {
27327 }
27329 /* OpenMP 2.5:
27331 section-scope:
27332 { section-sequence }
27334 section-sequence:
27335 section-directive[opt] structured-block
27336 section-sequence section-directive structured-block */
27338 static tree
27340 {
27351 {
27358 {
27368 }
27374 }
27377 {
27385 {
27389 }
27391 {
27394 }
27399 }
27410 }
27412 /* OpenMP 2.5:
27413 # pragma omp sections sections-clause[optseq] newline
27414 sections-scope */
27416 #define OMP_SECTIONS_CLAUSE_MASK \
27417 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27418 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27419 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27420 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27421 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27423 static tree
27425 {
27436 }
27438 /* OpenMP 2.5:
27439 # pragma parallel parallel-clause new-line
27440 # pragma parallel for parallel-for-clause new-line
27441 # pragma parallel sections parallel-sections-clause new-line */
27443 #define OMP_PARALLEL_CLAUSE_MASK \
27444 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27445 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27446 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27447 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27448 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27449 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
27450 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27451 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
27453 static tree
27455 {
27464 {
27470 }
27472 {
27476 {
27482 }
27483 }
27490 {
27510 }
27517 }
27519 /* OpenMP 2.5:
27520 # pragma omp single single-clause[optseq] new-line
27521 structured-block */
27523 #define OMP_SINGLE_CLAUSE_MASK \
27524 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27525 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27526 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
27527 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27529 static tree
27531 {
27541 }
27543 /* OpenMP 3.0:
27544 # pragma omp task task-clause[optseq] new-line
27545 structured-block */
27547 #define OMP_TASK_CLAUSE_MASK \
27548 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27549 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
27550 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27551 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27552 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27553 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27554 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
27555 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
27557 static tree
27559 {
27570 }
27572 /* OpenMP 3.0:
27573 # pragma omp taskwait new-line */
27575 static void
27577 {
27580 }
27582 /* OpenMP 3.1:
27583 # pragma omp taskyield new-line */
27585 static void
27587 {
27590 }
27592 /* OpenMP 2.5:
27593 # pragma omp threadprivate (variable-list) */
27595 static void
27597 {
27598 tree vars;
27604 }
27606 /* Main entry point to OpenMP statement pragmas. */
27608 static void
27610 {
27611 tree stmt;
27614 {
27644 }
27648 }
27649 \f
27650 /* Transactional Memory parsing routines. */
27652 /* Parse a transaction attribute.
27654 txn-attribute:
27655 attribute
27656 [ [ identifier ] ]
27658 ??? Simplify this when C++0x bracket attributes are
27659 implemented properly. */
27661 static tree
27663 {
27678 {
27682 /* For keywords, use the canonical spelling,
27683 not the parsed identifier. */
27687 }
27688 else
27692 error1:
27695 }
27697 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27699 transaction-statement:
27700 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27701 compound-statement
27702 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27703 */
27705 static tree
27707 {
27722 else
27723 {
27727 }
27729 /* Parse a noexcept specification. */
27732 /* Keep track if we're in the lexical scope of an outer transaction. */
27744 }
27746 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27748 transaction-expression:
27749 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27750 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27751 */
27753 static tree
27755 {
27780 /* Set this early. This might mean that we allow transaction_cancel in
27781 an expression that we find out later actually has to be a constexpr.
27782 However, we expect that cxx_constant_value will be able to deal with
27783 this; also, if the noexcept has no constexpr, then what we parse next
27784 really is a transaction's body. */
27787 /* Parse a noexcept specification. */
27793 {
27800 }
27801 else
27802 {
27803 /* The only expression that is available got parsed for the noexcept
27804 already. noexcept is true then. */
27807 }
27816 }
27818 /* Parse a function-transaction-block.
27820 function-transaction-block:
27821 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27822 function-body
27823 __transaction_atomic txn-attribute[opt] function-try-block
27824 __transaction_relaxed ctor-initializer[opt] function-body
27825 __transaction_relaxed function-try-block
27826 */
27828 static bool
27830 {
27846 else
27847 {
27851 }
27859 else
27860 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
27868 }
27870 /* Parse a __transaction_cancel statement.
27872 cancel-statement:
27873 __transaction_cancel txn-attribute[opt] ;
27874 __transaction_cancel txn-attribute[opt] throw-expression ;
27876 ??? Cancel and throw is not yet implemented. */
27878 static tree
27880 {
27886 RT_TRANSACTION_CANCEL);
27893 /* ??? Parse cancel-and-throw here. */
27898 {
27902 }
27904 {
27908 }
27910 {
27913 {
27919 }
27920 }
27922 {
27926 }
27933 }
27934 \f
27935 /* The parser. */
27939 \f
27940 /* Special handling for the first token or line in the file. The first
27941 thing in the file might be #pragma GCC pch_preprocess, which loads a
27942 PCH file, which is a GC collection point. So we need to handle this
27943 first pragma without benefit of an existing lexer structure.
27945 Always returns one token to the caller in *FIRST_TOKEN. This is
27946 either the true first token of the file, or the first token after
27947 the initial pragma. */
27949 static void
27951 {
27960 {
27967 }
27968 else
27971 /* Skip to the end of the pragma. */
27975 /* Now actually load the PCH file. */
27979 /* Read one more token to return to our caller. We have to do this
27980 after reading the PCH file in, since its pointers have to be
27981 live. */
27983 }
27985 /* Normal parsing of a pragma token. Here we can (and must) use the
27986 regular lexer. */
27988 static bool
27990 {
28000 {
28008 {
28018 }
28023 {
28033 }
28038 {
28044 "%<#pragma omp taskwait%> may only be "
28049 }
28054 {
28060 "%<#pragma omp taskyield%> may only be "
28065 }
28088 "%<#pragma omp section%> may only be used in "
28097 bad_stmt:
28100 }
28104 }
28106 /* The interface the pragma parsers have to the lexer. */
28108 enum cpp_ttype
28110 {
28123 else
28124 {
28128 }
28131 }
28133 \f
28134 /* External interface. */
28136 /* Parse one entire translation unit. */
28138 void
28140 {
28144 {
28147 }
28155 }