| blob | d55f5f9c7869059fff281143093bd0956485c52b |
1 /* C++ Parser.
2 Copyright (C) 2000-2013 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
44 \f
45 /* The lexer. */
47 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
48 and c-lex.c) and the C++ parser. */
51 {
53 };
55 /* The various kinds of non integral constant we encounter. */
57 NIC_NONE,
58 /* floating-point literal */
59 NIC_FLOAT,
60 /* %<this%> */
61 NIC_THIS,
62 /* %<__FUNCTION__%> */
63 NIC_FUNC_NAME,
64 /* %<__PRETTY_FUNCTION__%> */
65 NIC_PRETTY_FUNC,
66 /* %<__func__%> */
67 NIC_C99_FUNC,
68 /* "%<va_arg%> */
69 NIC_VA_ARG,
70 /* a cast */
71 NIC_CAST,
72 /* %<typeid%> operator */
73 NIC_TYPEID,
74 /* non-constant compound literals */
75 NIC_NCC,
76 /* a function call */
77 NIC_FUNC_CALL,
78 /* an increment */
79 NIC_INC,
80 /* an decrement */
81 NIC_DEC,
82 /* an array reference */
83 NIC_ARRAY_REF,
84 /* %<->%> */
85 NIC_ARROW,
86 /* %<.%> */
87 NIC_POINT,
88 /* the address of a label */
89 NIC_ADDR_LABEL,
90 /* %<*%> */
91 NIC_STAR,
92 /* %<&%> */
93 NIC_ADDR,
94 /* %<++%> */
95 NIC_PREINCREMENT,
96 /* %<--%> */
97 NIC_PREDECREMENT,
98 /* %<new%> */
99 NIC_NEW,
100 /* %<delete%> */
101 NIC_DEL,
102 /* calls to overloaded operators */
103 NIC_OVERLOADED,
104 /* an assignment */
105 NIC_ASSIGNMENT,
106 /* a comma operator */
107 NIC_COMMA,
108 /* a call to a constructor */
109 NIC_CONSTRUCTOR,
110 /* a transaction expression */
111 NIC_TRANSACTION
114 /* The various kinds of errors about name-lookup failing. */
116 /* NULL */
117 NLE_NULL,
118 /* is not a type */
119 NLE_TYPE,
120 /* is not a class or namespace */
121 NLE_CXX98,
122 /* is not a class, namespace, or enumeration */
123 NLE_NOT_CXX98
126 /* The various kinds of required token */
128 RT_NONE,
150 /* The type is CPP_KEYWORD */
179 RT_TRANSACTION_CANCEL /* __transaction_cancel */
182 /* Prototypes. */
188 static void cp_lexer_destroy
190 static int cp_lexer_saving_tokens
194 static void cp_lexer_get_preprocessor_token
202 static bool cp_lexer_next_token_is_not
204 static bool cp_lexer_next_token_is_keyword
208 static void cp_lexer_purge_token
210 static void cp_lexer_purge_tokens_after
212 static void cp_lexer_save_tokens
214 static void cp_lexer_commit_tokens
216 static void cp_lexer_rollback_tokens
218 static void cp_lexer_print_token
222 static void cp_lexer_start_debugging
224 static void cp_lexer_stop_debugging
230 static void cp_parser_initial_pragma
233 static tree cp_literal_operator_id
236 static bool cp_parser_omp_declare_reduction_exprs
239 /* Manifest constants. */
240 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
241 #define CP_SAVED_TOKEN_STACK 5
243 /* Variables. */
245 /* The stream to which debugging output should be written. */
248 /* Nonzero if we are parsing an unevaluated operand: an operand to
249 sizeof, typeof, or alignof. */
252 /* Dump up to NUM tokens in BUFFER to FILE starting with token
253 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
254 first token in BUFFER. If NUM is 0, dump all the tokens. If
255 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
256 highlighted by surrounding it in [[ ]]. */
258 static void
262 {
279 {
282 }
287 {
294 nprinted++;
304 {
314 }
315 }
318 {
321 }
324 }
327 /* Dump all tokens in BUFFER to stderr. */
329 void
331 {
333 }
335 DEBUG_FUNCTION void
337 {
339 }
341 DEBUG_FUNCTION void
343 {
346 else
348 }
351 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
352 description for T. */
354 static void
356 {
358 {
361 }
362 }
365 /* Dump parser context C to FILE. */
367 static void
369 {
374 }
377 /* Print the stack of parsing contexts to FILE starting with FIRST. */
379 static void
381 {
387 {
390 }
391 }
394 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
396 static void
398 {
401 }
404 /* Print an unparsed function entry UF to FILE. */
406 static void
408 {
411 tree fn;
416 i++)
417 {
423 }
428 {
431 }
437 {
440 }
442 }
445 /* Print the stack of unparsed member functions S to FILE. */
447 static void
450 {
456 {
459 }
460 }
463 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
464 the given PARSER. If FILE is NULL, the output is printed on stderr. */
466 static void
468 {
480 next_token);
481 }
484 /* Dump debugging information for the given PARSER. If FILE is NULL,
485 the output is printed on stderr. */
487 void
489 {
492 expanded_location eloc;
568 }
570 DEBUG_FUNCTION void
572 {
574 }
576 DEBUG_FUNCTION void
578 {
581 else
583 }
585 /* Allocate memory for a new lexer object and return it. */
589 {
594 /* Allocate the memory. */
597 /* Initially we are not debugging. */
602 /* Create the buffer. */
606 }
609 /* Create a new main C++ lexer, the lexer that gets tokens from the
610 preprocessor. */
614 {
616 cp_token token;
618 /* It's possible that parsing the first pragma will load a PCH file,
619 which is a GC collection point. So we have to do that before
620 allocating any memory. */
625 /* Put the first token in the buffer. */
628 /* Get the remaining tokens from the preprocessor. */
630 {
633 }
642 /* Subsequent preprocessor diagnostics should use compiler
643 diagnostic functions to get the compiler source location. */
648 }
650 /* Create a new lexer whose token stream is primed with the tokens in
651 CACHE. When these tokens are exhausted, no new tokens will be read. */
655 {
660 /* We do not own the buffer. */
667 /* Initially we are not debugging. */
672 }
674 /* Frees all resources associated with LEXER. */
676 static void
678 {
682 }
684 /* Returns nonzero if debugging information should be output. */
688 {
690 }
695 {
699 }
703 {
705 }
709 {
711 }
715 {
718 else
720 }
724 {
728 }
730 /* nonzero if we are presently saving tokens. */
734 {
736 }
738 /* Store the next token from the preprocessor in *TOKEN. Return true
739 if we reach EOF. If LEXER is NULL, assume we are handling an
740 initial #pragma pch_preprocess, and thus want the lexer to return
741 processed strings. */
743 static void
745 {
748 /* Get a new token from the preprocessor. */
749 token->type
756 /* On some systems, some header files are surrounded by an
757 implicit extern "C" block. Set a flag in the token if it
758 comes from such a header. */
763 /* Check to see if this token is a keyword. */
765 {
767 {
768 /* Mark this token as a keyword. */
770 /* Record which keyword. */
772 }
773 else
774 {
778 {
779 /* Warn about the C++0x keyword (but still treat it as
780 an identifier). */
785 /* Clear out the C_RID_CODE so we don't warn about this
786 particular identifier-turned-keyword again. */
788 }
792 }
793 }
795 {
796 /* This only happens in Objective-C++; it must be a keyword. */
799 {
800 /* Replace 'class' with '@class', 'private' with '@private',
801 etc. This prevents confusion with the C++ keyword
802 'class', and makes the tokens consistent with other
803 Objective-C 'AT' keywords. For example '@class' is
804 reported as RID_AT_CLASS which is consistent with
805 '@synchronized', which is reported as
806 RID_AT_SYNCHRONIZED.
807 */
816 }
817 }
819 {
820 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
824 }
825 }
827 /* Update the globals input_location and the input file stack from TOKEN. */
830 {
832 {
834 }
835 }
837 /* Return a pointer to the next token in the token stream, but do not
838 consume it. */
842 {
844 {
848 }
850 }
852 /* Return true if the next token has the indicated TYPE. */
856 {
858 }
860 /* Return true if the next token does not have the indicated TYPE. */
864 {
866 }
868 /* Return true if the next token is the indicated KEYWORD. */
872 {
874 }
878 {
880 }
882 /* Return true if the next token is not the indicated KEYWORD. */
886 {
888 }
890 /* Return true if the next token is a keyword for a decl-specifier. */
892 static bool
894 {
899 {
900 /* auto specifier: storage-class-specifier in C++,
901 simple-type-specifier in C++0x. */
903 /* Storage classes. */
909 /* Elaborated type specifiers. */
915 /* Simple type specifiers. */
930 /* GNU extensions. */
933 /* C++0x extensions. */
940 }
941 }
943 /* Returns TRUE iff the token T begins a decltype type. */
945 static bool
947 {
950 }
952 /* Returns TRUE iff the next token begins a decltype type. */
954 static bool
956 {
959 }
961 /* Return a pointer to the Nth token in the token stream. If N is 1,
962 then this is precisely equivalent to cp_lexer_peek_token (except
963 that it is not inline). One would like to disallow that case, but
964 there is one case (cp_parser_nth_token_starts_template_id) where
965 the caller passes a variable for N and it might be 1. */
969 {
972 /* N is 1-based, not zero-based. */
983 {
986 {
989 }
993 }
996 {
999 }
1002 }
1004 /* Return the next token, and advance the lexer's next_token pointer
1005 to point to the next non-purged token. */
1009 {
1015 do
1016 {
1019 {
1022 }
1024 }
1029 /* Provide debugging output. */
1031 {
1035 }
1038 }
1040 /* Permanently remove the next token from the token stream, and
1041 advance the next_token pointer to refer to the next non-purged
1042 token. */
1044 static void
1046 {
1055 do
1056 {
1057 tok++;
1059 {
1062 }
1063 }
1066 }
1068 /* Permanently remove all tokens after TOK, up to, but not
1069 including, the token that will be returned next by
1070 cp_lexer_peek_token. */
1072 static void
1074 {
1083 {
1088 }
1089 }
1091 /* Begin saving tokens. All tokens consumed after this point will be
1092 preserved. */
1094 static void
1096 {
1097 /* Provide debugging output. */
1102 }
1104 /* Commit to the portion of the token stream most recently saved. */
1106 static void
1108 {
1109 /* Provide debugging output. */
1114 }
1116 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1117 to the token stream. Stop saving tokens. */
1119 static void
1121 {
1122 /* Provide debugging output. */
1127 }
1129 /* Print a representation of the TOKEN on the STREAM. */
1131 static void
1133 {
1134 /* We don't use cpp_type2name here because the parser defines
1135 a few tokens of its own. */
1137 /* cpplib-defined token types */
1138 #define OP(e, s) #e,
1139 #define TK(e, s) #e,
1140 TTYPE_TABLE
1141 #undef OP
1142 #undef TK
1143 /* C++ parser token types - see "Manifest constants", above. */
1147 };
1149 /* For some tokens, print the associated data. */
1151 {
1153 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1154 For example, `struct' is mapped to an INTEGER_CST. */
1157 /* else fall through */
1175 /* If we have a name for the token, print it out. Otherwise, we
1176 simply give the numeric code. */
1179 else
1182 }
1183 }
1185 DEBUG_FUNCTION void
1187 {
1190 }
1192 DEBUG_FUNCTION void
1194 {
1197 else
1199 }
1202 /* Start emitting debugging information. */
1204 static void
1206 {
1209 }
1211 /* Stop emitting debugging information. */
1213 static void
1215 {
1218 }
1220 /* Create a new cp_token_cache, representing a range of tokens. */
1224 {
1229 }
1231 /* Diagnose if #pragma omp declare simd isn't followed immediately
1232 by function declaration or definition. */
1236 {
1238 {
1242 }
1243 }
1245 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1246 and put that into "omp declare simd" attribute. */
1250 {
1252 {
1254 {
1257 }
1259 {
1262 }
1263 }
1264 }
1265 \f
1266 /* Decl-specifiers. */
1268 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1270 static void
1272 {
1274 }
1276 /* Declarators. */
1278 /* Nothing other than the parser should be creating declarators;
1279 declarators are a semi-syntactic representation of C++ entities.
1280 Other parts of the front end that need to create entities (like
1281 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1296 /* An erroneous declarator. */
1299 /* The obstack on which declarators and related data structures are
1300 allocated. */
1303 /* Alloc BYTES from the declarator memory pool. */
1307 {
1309 }
1311 /* Allocate a declarator of the indicated KIND. Clear fields that are
1312 common to all declarators. */
1316 {
1328 }
1330 /* Make a declarator for a generalized identifier. If
1331 QUALIFYING_SCOPE is non-NULL, the identifier is
1332 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1333 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1334 is, if any. */
1338 special_function_kind sfk)
1339 {
1342 /* It is valid to write:
1344 class C { void f(); };
1345 typedef C D;
1346 void D::f();
1348 The standard is not clear about whether `typedef const C D' is
1349 legal; as of 2002-09-15 the committee is considering that
1350 question. EDG 3.0 allows that syntax. Therefore, we do as
1351 well. */
1365 }
1367 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1368 of modifiers such as const or volatile to apply to the pointer
1369 type, represented as identifiers. ATTRIBUTES represent the attributes that
1370 appertain to the pointer or reference. */
1372 cp_declarator *
1374 tree attributes)
1375 {
1383 {
1387 }
1388 else
1394 }
1396 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1397 represent the attributes that appertain to the pointer or
1398 reference. */
1400 cp_declarator *
1403 {
1411 {
1415 }
1416 else
1422 }
1424 /* Like make_pointer_declarator -- but for a pointer to a non-static
1425 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1426 appertain to the pointer or reference. */
1428 cp_declarator *
1431 tree attributes)
1432 {
1441 {
1444 }
1445 else
1451 }
1453 /* Make a declarator for the function given by TARGET, with the
1454 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1455 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1456 indicates what exceptions can be thrown. */
1458 cp_declarator *
1460 tree parms,
1461 cp_cv_quals cv_qualifiers,
1462 cp_virt_specifiers virt_specifiers,
1463 cp_ref_qualifier ref_qualifier,
1464 tree exception_specification,
1465 tree late_return_type)
1466 {
1478 {
1482 }
1483 else
1487 }
1489 /* Make a declarator for an array of BOUNDS elements, each of which is
1490 defined by ELEMENT. */
1492 cp_declarator *
1494 {
1501 {
1505 }
1506 else
1510 }
1512 /* Determine whether the declarator we've seen so far can be a
1513 parameter pack, when followed by an ellipsis. */
1514 static bool
1516 {
1517 /* Search for a declarator name, or any other declarator that goes
1518 after the point where the ellipsis could appear in a parameter
1519 pack. If we find any of these, then this declarator can not be
1520 made into a parameter pack. */
1523 {
1525 {
1537 }
1538 }
1541 }
1545 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1546 DECLARATOR and DEFAULT_ARGUMENT. */
1548 cp_parameter_declarator *
1551 tree default_argument)
1552 {
1560 else
1567 }
1569 /* Returns true iff DECLARATOR is a declaration for a function. */
1571 static bool
1573 {
1575 {
1583 }
1585 }
1587 /* The parser. */
1589 /* Overview
1590 --------
1592 A cp_parser parses the token stream as specified by the C++
1593 grammar. Its job is purely parsing, not semantic analysis. For
1594 example, the parser breaks the token stream into declarators,
1595 expressions, statements, and other similar syntactic constructs.
1596 It does not check that the types of the expressions on either side
1597 of an assignment-statement are compatible, or that a function is
1598 not declared with a parameter of type `void'.
1600 The parser invokes routines elsewhere in the compiler to perform
1601 semantic analysis and to build up the abstract syntax tree for the
1602 code processed.
1604 The parser (and the template instantiation code, which is, in a
1605 way, a close relative of parsing) are the only parts of the
1606 compiler that should be calling push_scope and pop_scope, or
1607 related functions. The parser (and template instantiation code)
1608 keeps track of what scope is presently active; everything else
1609 should simply honor that. (The code that generates static
1610 initializers may also need to set the scope, in order to check
1611 access control correctly when emitting the initializers.)
1613 Methodology
1614 -----------
1616 The parser is of the standard recursive-descent variety. Upcoming
1617 tokens in the token stream are examined in order to determine which
1618 production to use when parsing a non-terminal. Some C++ constructs
1619 require arbitrary look ahead to disambiguate. For example, it is
1620 impossible, in the general case, to tell whether a statement is an
1621 expression or declaration without scanning the entire statement.
1622 Therefore, the parser is capable of "parsing tentatively." When the
1623 parser is not sure what construct comes next, it enters this mode.
1624 Then, while we attempt to parse the construct, the parser queues up
1625 error messages, rather than issuing them immediately, and saves the
1626 tokens it consumes. If the construct is parsed successfully, the
1627 parser "commits", i.e., it issues any queued error messages and
1628 the tokens that were being preserved are permanently discarded.
1629 If, however, the construct is not parsed successfully, the parser
1630 rolls back its state completely so that it can resume parsing using
1631 a different alternative.
1633 Future Improvements
1634 -------------------
1636 The performance of the parser could probably be improved substantially.
1637 We could often eliminate the need to parse tentatively by looking ahead
1638 a little bit. In some places, this approach might not entirely eliminate
1639 the need to parse tentatively, but it might still speed up the average
1640 case. */
1642 /* Flags that are passed to some parsing functions. These values can
1643 be bitwise-ored together. */
1645 enum
1646 {
1647 /* No flags. */
1649 /* The construct is optional. If it is not present, then no error
1650 should be issued. */
1652 /* When parsing a type-specifier, treat user-defined type-names
1653 as non-type identifiers. */
1655 /* When parsing a type-specifier, do not try to parse a class-specifier
1656 or enum-specifier. */
1658 /* When parsing a decl-specifier-seq, only allow type-specifier or
1659 constexpr. */
1661 };
1663 /* This type is used for parameters and variables which hold
1664 combinations of the above flags. */
1667 /* The different kinds of declarators we want to parse. */
1670 {
1671 /* We want an abstract declarator. */
1672 CP_PARSER_DECLARATOR_ABSTRACT,
1673 /* We want a named declarator. */
1674 CP_PARSER_DECLARATOR_NAMED,
1675 /* We don't mind, but the name must be an unqualified-id. */
1676 CP_PARSER_DECLARATOR_EITHER
1679 /* The precedence values used to parse binary expressions. The minimum value
1680 of PREC must be 1, because zero is reserved to quickly discriminate
1681 binary operators from other tokens. */
1683 enum cp_parser_prec
1684 {
1685 PREC_NOT_OPERATOR,
1686 PREC_LOGICAL_OR_EXPRESSION,
1687 PREC_LOGICAL_AND_EXPRESSION,
1688 PREC_INCLUSIVE_OR_EXPRESSION,
1689 PREC_EXCLUSIVE_OR_EXPRESSION,
1690 PREC_AND_EXPRESSION,
1691 PREC_EQUALITY_EXPRESSION,
1692 PREC_RELATIONAL_EXPRESSION,
1693 PREC_SHIFT_EXPRESSION,
1694 PREC_ADDITIVE_EXPRESSION,
1695 PREC_MULTIPLICATIVE_EXPRESSION,
1696 PREC_PM_EXPRESSION,
1697 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1698 };
1700 /* A mapping from a token type to a corresponding tree node type, with a
1701 precedence value. */
1704 {
1705 /* The token type. */
1707 /* The corresponding tree code. */
1709 /* The precedence of this operator. */
1714 {
1715 /* Left hand side of the binary operation we are currently
1716 parsing. */
1717 tree lhs;
1718 /* Original tree code for left hand side, if it was a binary
1719 expression itself (used for -Wparentheses). */
1721 /* Tree code for the binary operation we are parsing. */
1723 /* Precedence of the binary operation we are parsing. */
1725 /* Location of the binary operation we are parsing. */
1726 location_t loc;
1729 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1730 entries because precedence levels on the stack are monotonically
1731 increasing. */
1735 /* Prototypes. */
1737 /* Constructors and destructors. */
1742 /* Class variables. */
1746 /* The operator-precedence table used by cp_parser_binary_expression.
1747 Transformed into an associative array (binops_by_token) by
1748 cp_parser_new. */
1781 };
1783 /* The same as binops, but initialized by cp_parser_new so that
1784 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1785 for speed. */
1788 /* Constructors and destructors. */
1790 /* Construct a new context. The context below this one on the stack
1791 is given by NEXT. */
1795 {
1798 /* Allocate the storage. */
1800 {
1801 /* Pull the first entry from the free list. */
1805 }
1806 else
1809 /* No errors have occurred yet in this context. */
1811 /* If this is not the bottommost context, copy information that we
1812 need from the previous context. */
1814 {
1815 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1816 expression, then we are parsing one in this context, too. */
1818 /* Thread the stack. */
1820 }
1823 }
1825 /* Managing the unparsed function queues. */
1827 #define unparsed_funs_with_default_args \
1828 parser->unparsed_queues->last ().funs_with_default_args
1829 #define unparsed_funs_with_definitions \
1830 parser->unparsed_queues->last ().funs_with_definitions
1831 #define unparsed_nsdmis \
1832 parser->unparsed_queues->last ().nsdmis
1834 static void
1836 {
1839 }
1841 static void
1843 {
1846 }
1848 /* Prototypes. */
1850 /* Constructors and destructors. */
1855 /* Routines to parse various constructs.
1857 Those that return `tree' will return the error_mark_node (rather
1858 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1859 Sometimes, they will return an ordinary node if error-recovery was
1860 attempted, even though a parse error occurred. So, to check
1861 whether or not a parse error occurred, you should always use
1862 cp_parser_error_occurred. If the construct is optional (indicated
1863 either by an `_opt' in the name of the function that does the
1864 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1865 the construct is not present. */
1867 /* Lexical conventions [gram.lex] */
1869 static tree cp_parser_identifier
1871 static tree cp_parser_string_literal
1873 static tree cp_parser_userdef_char_literal
1875 static tree cp_parser_userdef_string_literal
1877 static tree cp_parser_userdef_numeric_literal
1880 /* Basic concepts [gram.basic] */
1882 static bool cp_parser_translation_unit
1885 /* Expressions [gram.expr] */
1887 static tree cp_parser_primary_expression
1889 static tree cp_parser_id_expression
1891 static tree cp_parser_unqualified_id
1893 static tree cp_parser_nested_name_specifier_opt
1895 static tree cp_parser_nested_name_specifier
1897 static tree cp_parser_qualifying_entity
1899 static tree cp_parser_postfix_expression
1901 static tree cp_parser_postfix_open_square_expression
1903 static tree cp_parser_postfix_dot_deref_expression
1907 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1909 static void cp_parser_pseudo_destructor_name
1911 static tree cp_parser_unary_expression
1913 static enum tree_code cp_parser_unary_operator
1915 static tree cp_parser_new_expression
1919 static tree cp_parser_new_type_id
1927 static tree cp_parser_delete_expression
1929 static tree cp_parser_cast_expression
1931 static tree cp_parser_binary_expression
1933 static tree cp_parser_question_colon_clause
1935 static tree cp_parser_assignment_expression
1937 static enum tree_code cp_parser_assignment_operator_opt
1939 static tree cp_parser_expression
1941 static tree cp_parser_expression
1943 static tree cp_parser_constant_expression
1945 static tree cp_parser_builtin_offsetof
1947 static tree cp_parser_lambda_expression
1949 static void cp_parser_lambda_introducer
1951 static bool cp_parser_lambda_declarator_opt
1953 static void cp_parser_lambda_body
1956 /* Statements [gram.stmt.stmt] */
1958 static void cp_parser_statement
1960 static void cp_parser_label_for_labeled_statement
1962 static tree cp_parser_expression_statement
1964 static tree cp_parser_compound_statement
1966 static void cp_parser_statement_seq_opt
1968 static tree cp_parser_selection_statement
1970 static tree cp_parser_condition
1972 static tree cp_parser_iteration_statement
1974 static bool cp_parser_for_init_statement
1976 static tree cp_parser_for
1978 static tree cp_parser_c_for
1980 static tree cp_parser_range_for
1982 static void do_range_for_auto_deduction
1984 static tree cp_parser_perform_range_for_lookup
1986 static tree cp_parser_range_for_member_function
1988 static tree cp_parser_jump_statement
1990 static void cp_parser_declaration_statement
1993 static tree cp_parser_implicitly_scoped_statement
1995 static void cp_parser_already_scoped_statement
1998 /* Declarations [gram.dcl.dcl] */
2000 static void cp_parser_declaration_seq_opt
2002 static void cp_parser_declaration
2004 static void cp_parser_block_declaration
2006 static void cp_parser_simple_declaration
2008 static void cp_parser_decl_specifier_seq
2010 static tree cp_parser_storage_class_specifier_opt
2012 static tree cp_parser_function_specifier_opt
2014 static tree cp_parser_type_specifier
2017 static tree cp_parser_simple_type_specifier
2019 static tree cp_parser_type_name
2021 static tree cp_parser_nonclass_name
2023 static tree cp_parser_elaborated_type_specifier
2025 static tree cp_parser_enum_specifier
2027 static void cp_parser_enumerator_list
2029 static void cp_parser_enumerator_definition
2031 static tree cp_parser_namespace_name
2033 static void cp_parser_namespace_definition
2035 static void cp_parser_namespace_body
2037 static tree cp_parser_qualified_namespace_specifier
2039 static void cp_parser_namespace_alias_definition
2041 static bool cp_parser_using_declaration
2043 static void cp_parser_using_directive
2045 static tree cp_parser_alias_declaration
2047 static void cp_parser_asm_definition
2049 static void cp_parser_linkage_specification
2051 static void cp_parser_static_assert
2053 static tree cp_parser_decltype
2056 /* Declarators [gram.dcl.decl] */
2058 static tree cp_parser_init_declarator
2059 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2064 static enum tree_code cp_parser_ptr_operator
2066 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2068 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2070 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2072 static tree cp_parser_late_return_type_opt
2074 static tree cp_parser_declarator_id
2076 static tree cp_parser_type_id
2078 static tree cp_parser_template_type_arg
2081 static tree cp_parser_type_id_1
2083 static void cp_parser_type_specifier_seq
2085 static tree cp_parser_parameter_declaration_clause
2087 static tree cp_parser_parameter_declaration_list
2091 static tree cp_parser_default_argument
2093 static void cp_parser_function_body
2095 static tree cp_parser_initializer
2097 static tree cp_parser_initializer_clause
2099 static tree cp_parser_braced_list
2104 static bool cp_parser_ctor_initializer_opt_and_function_body
2107 static tree cp_parser_late_parsing_omp_declare_simd
2110 static tree add_implicit_template_parms
2112 static tree finish_fully_implicit_template
2115 /* Classes [gram.class] */
2117 static tree cp_parser_class_name
2119 static tree cp_parser_class_specifier
2121 static tree cp_parser_class_head
2123 static enum tag_types cp_parser_class_key
2125 static void cp_parser_member_specification_opt
2127 static void cp_parser_member_declaration
2129 static tree cp_parser_pure_specifier
2131 static tree cp_parser_constant_initializer
2134 /* Derived classes [gram.class.derived] */
2136 static tree cp_parser_base_clause
2138 static tree cp_parser_base_specifier
2141 /* Special member functions [gram.special] */
2143 static tree cp_parser_conversion_function_id
2145 static tree cp_parser_conversion_type_id
2149 static bool cp_parser_ctor_initializer_opt
2151 static void cp_parser_mem_initializer_list
2153 static tree cp_parser_mem_initializer
2155 static tree cp_parser_mem_initializer_id
2158 /* Overloading [gram.over] */
2160 static tree cp_parser_operator_function_id
2162 static tree cp_parser_operator
2165 /* Templates [gram.temp] */
2167 static void cp_parser_template_declaration
2169 static tree cp_parser_template_parameter_list
2171 static tree cp_parser_template_parameter
2173 static tree cp_parser_type_parameter
2175 static tree cp_parser_template_id
2177 static tree cp_parser_template_name
2179 static tree cp_parser_template_argument_list
2181 static tree cp_parser_template_argument
2183 static void cp_parser_explicit_instantiation
2185 static void cp_parser_explicit_specialization
2188 /* Exception handling [gram.exception] */
2190 static tree cp_parser_try_block
2192 static bool cp_parser_function_try_block
2194 static void cp_parser_handler_seq
2196 static void cp_parser_handler
2198 static tree cp_parser_exception_declaration
2200 static tree cp_parser_throw_expression
2202 static tree cp_parser_exception_specification_opt
2204 static tree cp_parser_type_id_list
2207 /* GNU Extensions */
2209 static tree cp_parser_asm_specification_opt
2211 static tree cp_parser_asm_operand_list
2213 static tree cp_parser_asm_clobber_list
2215 static tree cp_parser_asm_label_list
2217 static bool cp_next_tokens_can_be_attribute_p
2219 static bool cp_next_tokens_can_be_gnu_attribute_p
2221 static bool cp_next_tokens_can_be_std_attribute_p
2223 static bool cp_nth_tokens_can_be_std_attribute_p
2225 static bool cp_nth_tokens_can_be_gnu_attribute_p
2227 static bool cp_nth_tokens_can_be_attribute_p
2229 static tree cp_parser_attributes_opt
2231 static tree cp_parser_gnu_attributes_opt
2233 static tree cp_parser_gnu_attribute_list
2235 static tree cp_parser_std_attribute
2237 static tree cp_parser_std_attribute_spec
2239 static tree cp_parser_std_attribute_spec_seq
2241 static bool cp_parser_extension_opt
2243 static void cp_parser_label_declaration
2246 /* Transactional Memory Extensions */
2248 static tree cp_parser_transaction
2250 static tree cp_parser_transaction_expression
2252 static bool cp_parser_function_transaction
2254 static tree cp_parser_transaction_cancel
2258 pragma_external,
2259 pragma_member,
2260 pragma_objc_icode,
2261 pragma_stmt,
2262 pragma_compound
2263 };
2264 static bool cp_parser_pragma
2267 /* Objective-C++ Productions */
2269 static tree cp_parser_objc_message_receiver
2271 static tree cp_parser_objc_message_args
2273 static tree cp_parser_objc_message_expression
2275 static tree cp_parser_objc_encode_expression
2277 static tree cp_parser_objc_defs_expression
2279 static tree cp_parser_objc_protocol_expression
2281 static tree cp_parser_objc_selector_expression
2283 static tree cp_parser_objc_expression
2285 static bool cp_parser_objc_selector_p
2287 static tree cp_parser_objc_selector
2289 static tree cp_parser_objc_protocol_refs_opt
2291 static void cp_parser_objc_declaration
2293 static tree cp_parser_objc_statement
2295 static bool cp_parser_objc_valid_prefix_attributes
2297 static void cp_parser_objc_at_property_declaration
2299 static void cp_parser_objc_at_synthesize_declaration
2301 static void cp_parser_objc_at_dynamic_declaration
2303 static tree cp_parser_objc_struct_declaration
2306 /* Utility Routines */
2308 static tree cp_parser_lookup_name
2310 static tree cp_parser_lookup_name_simple
2312 static tree cp_parser_maybe_treat_template_as_class
2314 static bool cp_parser_check_declarator_template_parameters
2316 static bool cp_parser_check_template_parameters
2318 static tree cp_parser_simple_cast_expression
2320 static tree cp_parser_global_scope_opt
2322 static bool cp_parser_constructor_declarator_p
2324 static tree cp_parser_function_definition_from_specifiers_and_declarator
2326 static tree cp_parser_function_definition_after_declarator
2328 static void cp_parser_template_declaration_after_export
2330 static void cp_parser_perform_template_parameter_access_checks
2332 static tree cp_parser_single_declaration
2334 static tree cp_parser_functional_cast
2336 static tree cp_parser_save_member_function_body
2338 static tree cp_parser_save_nsdmi
2340 static tree cp_parser_enclosed_template_argument_list
2342 static void cp_parser_save_default_args
2344 static void cp_parser_late_parsing_for_member
2346 static tree cp_parser_late_parse_one_default_arg
2348 static void cp_parser_late_parsing_nsdmi
2350 static void cp_parser_late_parsing_default_args
2352 static tree cp_parser_sizeof_operand
2354 static tree cp_parser_trait_expr
2356 static bool cp_parser_declares_only_class_p
2358 static void cp_parser_set_storage_class
2360 static void cp_parser_set_decl_spec_type
2362 static void set_and_check_decl_spec_loc
2365 static bool cp_parser_friend_p
2367 static void cp_parser_required_error
2373 static bool cp_parser_token_starts_function_definition_p
2375 static bool cp_parser_next_token_starts_class_definition_p
2377 static bool cp_parser_next_token_ends_template_argument_p
2379 static bool cp_parser_nth_token_starts_template_argument_list_p
2381 static enum tag_types cp_parser_token_is_class_key
2383 static void cp_parser_check_class_key
2385 static void cp_parser_check_access_in_redeclaration
2387 static bool cp_parser_optional_template_keyword
2389 static void cp_parser_pre_parsed_nested_name_specifier
2391 static bool cp_parser_cache_group
2393 static tree cp_parser_cache_defarg
2395 static void cp_parser_parse_tentatively
2397 static void cp_parser_commit_to_tentative_parse
2399 static void cp_parser_commit_to_topmost_tentative_parse
2401 static void cp_parser_abort_tentative_parse
2403 static bool cp_parser_parse_definitely
2407 static bool cp_parser_uncommitted_to_tentative_parse_p
2409 static void cp_parser_error
2411 static void cp_parser_name_lookup_error
2413 static bool cp_parser_simulate_error
2415 static bool cp_parser_check_type_definition
2417 static void cp_parser_check_for_definition_in_return_type
2419 static void cp_parser_check_for_invalid_template_id
2421 static bool cp_parser_non_integral_constant_expression
2423 static void cp_parser_diagnose_invalid_type_name
2425 static bool cp_parser_parse_and_diagnose_invalid_type_name
2427 static int cp_parser_skip_to_closing_parenthesis
2429 static void cp_parser_skip_to_end_of_statement
2431 static void cp_parser_consume_semicolon_at_end_of_statement
2433 static void cp_parser_skip_to_end_of_block_or_statement
2435 static bool cp_parser_skip_to_closing_brace
2437 static void cp_parser_skip_to_end_of_template_parameter_list
2439 static void cp_parser_skip_to_pragma_eol
2441 static bool cp_parser_error_occurred
2443 static bool cp_parser_allow_gnu_extensions_p
2445 static bool cp_parser_is_pure_string_literal
2447 static bool cp_parser_is_string_literal
2449 static bool cp_parser_is_keyword
2451 static tree cp_parser_make_typename_type
2456 /* Returns nonzero if we are parsing tentatively. */
2460 {
2462 }
2464 /* Returns nonzero if TOKEN is a string literal. */
2466 static bool
2468 {
2474 }
2476 /* Returns nonzero if TOKEN is a string literal
2477 of a user-defined string literal. */
2479 static bool
2481 {
2488 }
2490 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2492 static bool
2494 {
2496 }
2498 /* If not parsing tentatively, issue a diagnostic of the form
2499 FILE:LINE: MESSAGE before TOKEN
2500 where TOKEN is the next token in the input stream. MESSAGE
2501 (specified by the caller) is usually of the form "expected
2502 OTHER-TOKEN". */
2504 static void
2506 {
2508 {
2510 /* This diagnostic makes more sense if it is tagged to the line
2511 of the token we just peeked at. */
2515 {
2520 }
2523 /* Because c_parser_error does not understand
2524 CPP_KEYWORD, keywords are treated like
2525 identifiers. */
2528 }
2529 }
2531 /* Issue an error about name-lookup failing. NAME is the
2532 IDENTIFIER_NODE DECL is the result of
2533 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2534 the thing that we hoped to find. */
2536 static void
2538 tree name,
2539 tree decl,
2540 name_lookup_error desired,
2541 location_t location)
2542 {
2543 /* If name lookup completely failed, tell the user that NAME was not
2544 declared. */
2546 {
2559 else
2561 }
2563 {
2565 {
2582 }
2583 }
2585 {
2587 {
2597 name);
2601 }
2602 }
2603 else
2604 {
2606 {
2619 }
2620 }
2621 }
2623 /* If we are parsing tentatively, remember that an error has occurred
2624 during this tentative parse. Returns true if the error was
2625 simulated; false if a message should be issued by the caller. */
2627 static bool
2629 {
2631 {
2634 }
2636 }
2638 /* This function is called when a type is defined. If type
2639 definitions are forbidden at this point, an error message is
2640 issued. */
2642 static bool
2644 {
2645 /* If types are forbidden here, issue a message. */
2647 {
2648 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2649 in the message need to be interpreted. */
2652 }
2654 }
2656 /* This function is called when the DECLARATOR is processed. The TYPE
2657 was a type defined in the decl-specifiers. If it is invalid to
2658 define a type in the decl-specifiers for DECLARATOR, an error is
2659 issued. TYPE_LOCATION is the location of TYPE and is used
2660 for error reporting. */
2662 static void
2665 {
2666 /* [dcl.fct] forbids type definitions in return types.
2667 Unfortunately, it's not easy to know whether or not we are
2668 processing a return type until after the fact. */
2676 {
2681 type);
2682 }
2683 }
2685 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2686 "<" in any valid C++ program. If the next token is indeed "<",
2687 issue a message warning the user about what appears to be an
2688 invalid attempt to form a template-id. LOCATION is the location
2689 of the type-specifier (TYPE) */
2691 static void
2693 tree type,
2695 location_t location)
2696 {
2700 {
2704 {
2707 else
2709 }
2710 else
2712 /* Remember the location of the invalid "<". */
2715 /* Consume the "<". */
2717 /* Parse the template arguments. */
2719 /* Permanently remove the invalid template arguments so that
2720 this error message is not issued again. */
2723 }
2724 }
2726 /* If parsing an integral constant-expression, issue an error message
2727 about the fact that THING appeared and return true. Otherwise,
2728 return false. In either case, set
2729 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2731 static bool
2733 non_integral_constant thing)
2734 {
2737 {
2739 {
2742 {
2749 "enumeration type cannot appear in a "
2840 }
2844 }
2845 }
2847 }
2849 /* Emit a diagnostic for an invalid type name. SCOPE is the
2850 qualifying scope (or NULL, if none) for ID. This function commits
2851 to the current active tentative parse, if any. (Otherwise, the
2852 problematic construct might be encountered again later, resulting
2853 in duplicate error messages.) LOCATION is the location of ID. */
2855 static void
2858 location_t location)
2859 {
2862 /* Try to lookup the identifier. */
2867 /* If the lookup found a template-name, it means that the user forgot
2868 to specify an argument list. Emit a useful error message. */
2872 decl);
2876 /* Something like 'unsigned A a;' */
2879 {
2880 /* Issue an error message. */
2882 /* If we're in a template class, it's possible that the user was
2883 referring to a type from a base class. For example:
2885 template <typename T> struct A { typedef T X; };
2886 template <typename T> struct B : public A<T> { X x; };
2888 The user should have said "typename A<T>::X". */
2894 {
2895 tree b;
2898 b;
2900 {
2904 {
2905 tree field;
2906 /* Go from a particular instantiation of the
2907 template (which will have an empty TYPE_FIELDs),
2908 to the main version. */
2911 field;
2915 {
2920 }
2923 }
2924 }
2925 }
2926 }
2927 /* Here we diagnose qualified-ids where the scope is actually correct,
2928 but the identifier does not resolve to a valid type name. */
2930 {
2932 {
2937 else
2941 }
2944 {
2945 /* A<T>::A<T>() */
2951 }
2958 {
2963 else
2967 }
2968 else
2970 }
2971 }
2973 /* Check for a common situation where a type-name should be present,
2974 but is not, and issue a sensible error message. Returns true if an
2975 invalid type-name was detected.
2977 The situation handled by this function are variable declarations of the
2978 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2979 Usually, `ID' should name a type, but if we got here it means that it
2980 does not. We try to emit the best possible error message depending on
2981 how exactly the id-expression looks like. */
2983 static bool
2985 {
2986 tree id;
2989 /* Avoid duplicate error about ambiguous lookup. */
2991 {
2995 }
3004 /* If the next token is a (, this is a function with no explicit return
3005 type, i.e. constructor, destructor or conversion op. */
3008 {
3011 }
3015 /* Emit a diagnostic for the invalid type. */
3018 out:
3019 /* If we aren't in the middle of a declarator (i.e. in a
3020 parameter-declaration-clause), skip to the end of the declaration;
3021 there's no point in trying to process it. */
3025 }
3027 /* Consume tokens up to, and including, the next non-nested closing `)'.
3028 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3029 are doing error recovery. Returns -1 if OR_COMMA is true and we
3030 found an unnested comma. */
3032 static int
3037 {
3047 {
3051 {
3054 /* If we've run out of tokens, then there is no closing `)'. */
3057 /* This is good for lambda expression capture-lists. */
3067 /* This matches the processing in skip_to_end_of_statement. */
3093 {
3097 }
3102 }
3104 /* Consume the token. */
3106 }
3107 }
3109 /* Consume tokens until we reach the end of the current statement.
3110 Normally, that will be just before consuming a `;'. However, if a
3111 non-nested `}' comes first, then we stop before consuming that. */
3113 static void
3115 {
3119 {
3123 {
3126 /* If we've run out of tokens, stop. */
3130 /* If the next token is a `;', we have reached the end of the
3131 statement. */
3137 /* If this is a non-nested '}', stop before consuming it.
3138 That way, when confronted with something like:
3140 { 3 + }
3142 we stop before consuming the closing '}', even though we
3143 have not yet reached a `;'. */
3147 /* If it is the closing '}' for a block that we have
3148 scanned, stop -- but only after consuming the token.
3149 That way given:
3151 void f g () { ... }
3152 typedef int I;
3154 we will stop after the body of the erroneously declared
3155 function, but before consuming the following `typedef'
3156 declaration. */
3158 {
3161 }
3169 }
3171 /* Consume the token. */
3173 }
3174 }
3176 /* This function is called at the end of a statement or declaration.
3177 If the next token is a semicolon, it is consumed; otherwise, error
3178 recovery is attempted. */
3180 static void
3182 {
3183 /* Look for the trailing `;'. */
3185 {
3186 /* If there is additional (erroneous) input, skip to the end of
3187 the statement. */
3189 /* If the next token is now a `;', consume it. */
3192 }
3193 }
3195 /* Skip tokens until we have consumed an entire block, or until we
3196 have consumed a non-nested `;'. */
3198 static void
3200 {
3204 {
3208 {
3211 /* If we've run out of tokens, stop. */
3215 /* Stop if this is an unnested ';'. */
3221 /* Stop if this is an unnested '}', or closes the outermost
3222 nesting level. */
3223 nesting_depth--;
3231 /* Nest. */
3232 nesting_depth++;
3237 }
3239 /* Consume the token. */
3241 }
3242 }
3244 /* Skip tokens until a non-nested closing curly brace is the next
3245 token, or there are no more tokens. Return true in the first case,
3246 false otherwise. */
3248 static bool
3250 {
3254 {
3258 {
3261 /* If we've run out of tokens, stop. */
3265 /* If the next token is a non-nested `}', then we have reached
3266 the end of the current block. */
3272 /* If it the next token is a `{', then we are entering a new
3273 block. Consume the entire block. */
3279 }
3281 /* Consume the token. */
3283 }
3284 }
3286 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3287 parameter is the PRAGMA token, allowing us to purge the entire pragma
3288 sequence. */
3290 static void
3292 {
3297 do
3301 /* Ensure that the pragma is not parsed again. */
3303 }
3305 /* Require pragma end of line, resyncing with it as necessary. The
3306 arguments are as for cp_parser_skip_to_pragma_eol. */
3308 static void
3310 {
3314 }
3316 /* This is a simple wrapper around make_typename_type. When the id is
3317 an unresolved identifier node, we can provide a superior diagnostic
3318 using cp_parser_diagnose_invalid_type_name. */
3320 static tree
3323 {
3324 tree result;
3326 {
3332 }
3334 }
3336 /* This is a wrapper around the
3337 make_{pointer,ptrmem,reference}_declarator functions that decides
3338 which one to call based on the CODE and CLASS_TYPE arguments. The
3339 CODE argument should be one of the values returned by
3340 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3341 appertain to the pointer or reference. */
3345 cp_cv_quals cv_qualifiers,
3347 tree attributes)
3348 {
3355 else
3365 }
3367 /* Create a new C++ parser. */
3371 {
3376 /* cp_lexer_new_main is called before doing GC allocation because
3377 cp_lexer_new_main might load a PCH file. */
3380 /* Initialize the binops_by_token so that we can get the tree
3381 directly from the token. */
3389 /* For now, we always accept GNU extensions. */
3392 /* The `>' token is a greater-than operator, not the end of a
3393 template-id. */
3398 /* We are not parsing a constant-expression. */
3403 /* Local variable names are not forbidden. */
3406 /* We are not processing an `extern "C"' declaration. */
3409 /* We are not processing a declarator. */
3412 /* We are not processing a template-argument-list. */
3415 /* We are not in an iteration statement. */
3418 /* We are not in a switch statement. */
3421 /* We are not parsing a type-id inside an expression. */
3424 /* Declarations aren't implicitly extern "C". */
3427 /* String literals should be translated to the execution character set. */
3430 /* We are not parsing a function body. */
3433 /* We can correct until told otherwise. */
3436 /* The unparsed function queue is empty. */
3439 /* There are no classes being defined. */
3442 /* No template parameters apply. */
3445 /* Not declaring an implicit function template. */
3449 }
3451 /* Create a cp_lexer structure which will emit the tokens in CACHE
3452 and push it onto the parser's lexer stack. This is used for delayed
3453 parsing of in-class method bodies and default arguments, and should
3454 not be confused with tentative parsing. */
3455 static void
3457 {
3462 /* Move the current source position to that of the first token in the
3463 new lexer. */
3465 }
3467 /* Pop the top lexer off the parser stack. This is never used for the
3468 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3469 static void
3471 {
3476 /* Put the current source position back where it was before this
3477 lexer was pushed. */
3479 }
3481 /* Lexical conventions [gram.lex] */
3483 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3484 identifier. */
3486 static tree
3488 {
3491 /* Look for the identifier. */
3493 /* Return the value. */
3495 }
3497 /* Parse a sequence of adjacent string constants. Returns a
3498 TREE_STRING representing the combined, nul-terminated string
3499 constant. If TRANSLATE is true, translate the string to the
3500 execution character set. If WIDE_OK is true, a wide string is
3501 invalid here.
3503 C++98 [lex.string] says that if a narrow string literal token is
3504 adjacent to a wide string literal token, the behavior is undefined.
3505 However, C99 6.4.5p4 says that this results in a wide string literal.
3506 We follow C99 here, for consistency with the C front end.
3508 This code is largely lifted from lex_string() in c-lex.c.
3510 FUTURE: ObjC++ will need to handle @-strings here. */
3511 static tree
3513 {
3514 tree value;
3521 tree string_tree;
3527 {
3530 }
3533 {
3537 }
3538 else
3539 {
3542 }
3545 /* Try to avoid the overhead of creating and destroying an obstack
3546 for the common case of just one string. */
3549 {
3557 {
3561 }
3562 else
3566 }
3567 else
3568 {
3572 do
3573 {
3575 count++;
3580 {
3583 {
3586 }
3589 {
3594 }
3596 }
3597 else
3601 {
3606 "unsupported non-standard concatenation "
3608 }
3614 {
3618 }
3619 else
3620 {
3624 }
3625 }
3629 }
3632 {
3635 }
3639 {
3644 {
3659 }
3664 {
3669 }
3670 }
3671 else
3672 /* cpp_interpret_string has issued an error. */
3679 }
3681 /* Look up a literal operator with the name and the exact arguments. */
3683 static tree
3685 {
3692 {
3698 {
3701 {
3711 }
3714 /* May be this should be sufficient_parms_p instead,
3715 depending on how exactly should user-defined literals
3716 work in presence of default arguments on the literal
3717 operator parameters. */
3720 }
3721 }
3724 }
3726 /* Parse a user-defined char constant. Returns a call to a user-defined
3727 literal operator taking the character as an argument. */
3729 static tree
3731 {
3739 /* Build up a call to the user-defined operator */
3740 /* Lookup the name we got back from the id-expression. */
3745 {
3750 }
3759 }
3761 /* A subroutine of cp_parser_userdef_numeric_literal to
3762 create a char... template parameter pack from a string node. */
3764 static tree
3766 {
3767 tree charvec;
3773 /* Fill in CHARVEC with all of the parameters. */
3778 /* Build the argument packs. */
3785 }
3787 /* A subroutine of cp_parser_userdef_numeric_literal to
3788 create a char... template parameter pack from a string node. */
3790 static tree
3792 {
3793 tree charvec;
3803 /* First template parm is character type. */
3806 /* Fill in CHARVEC with all of the parameters. */
3809 {
3812 }
3814 {
3818 }
3820 {
3824 }
3826 /* Build the argument packs. */
3833 }
3835 /* Parse a user-defined numeric constant. returns a call to a user-defined
3836 literal operator. */
3838 static tree
3840 {
3851 /* Look for a literal operator taking the exact type of numeric argument
3852 as the literal value. */
3857 {
3860 {
3864 long_long_unsigned_type_node);
3865 else
3866 {
3870 long_double_type_node);
3874 }
3877 }
3878 }
3881 /* If the numeric argument didn't work, look for a raw literal
3882 operator taking a const char* argument consisting of the number
3883 in string format. */
3888 {
3891 {
3894 }
3895 }
3898 /* If the raw literal didn't work, look for a non-type template
3899 function with parameter pack char.... Call the function with
3900 template parameter characters representing the number. */
3904 {
3909 {
3912 }
3913 }
3918 }
3920 /* Parse a user-defined string constant. Returns a call to a user-defined
3921 literal operator taking a character pointer and the length of the string
3922 as arguments. */
3924 static tree
3926 {
3936 /* Look for a template function with typename parameter CharT
3937 and parameter pack CharT... Call the function with
3938 template parameter characters representing the string. */
3942 {
3947 {
3950 }
3951 }
3954 /* Build up a call to the user-defined operator */
3955 /* Lookup the name we got back from the id-expression. */
3961 {
3965 }
3974 }
3977 /* Basic concepts [gram.basic] */
3979 /* Parse a translation-unit.
3981 translation-unit:
3982 declaration-seq [opt]
3984 Returns TRUE if all went well. */
3986 static bool
3988 {
3989 /* The address of the first non-permanent object on the declarator
3990 obstack. */
3995 /* Create the declarator obstack, if necessary. */
3997 {
3999 /* Create the error declarator. */
4001 /* Create the empty parameter list. */
4003 /* Remember where the base of the declarator obstack lies. */
4005 }
4009 /* If there are no tokens left then all went well. */
4011 {
4012 /* Get rid of the token array; we don't need it any more. */
4016 /* This file might have been a context that's implicitly extern
4017 "C". If so, pop the lang context. (Only relevant for PCH.) */
4019 {
4022 }
4024 /* Finish up. */
4028 }
4029 else
4030 {
4033 }
4035 /* Make sure the declarator obstack was fully cleaned up. */
4039 /* All went well. */
4041 }
4043 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4044 decltype context. */
4048 {
4053 }
4055 /* Expressions [gram.expr] */
4057 /* Parse a primary-expression.
4059 primary-expression:
4060 literal
4061 this
4062 ( expression )
4063 id-expression
4065 GNU Extensions:
4067 primary-expression:
4068 ( compound-statement )
4069 __builtin_va_arg ( assignment-expression , type-id )
4070 __builtin_offsetof ( type-id , offsetof-expression )
4072 C++ Extensions:
4073 __has_nothrow_assign ( type-id )
4074 __has_nothrow_constructor ( type-id )
4075 __has_nothrow_copy ( type-id )
4076 __has_trivial_assign ( type-id )
4077 __has_trivial_constructor ( type-id )
4078 __has_trivial_copy ( type-id )
4079 __has_trivial_destructor ( type-id )
4080 __has_virtual_destructor ( type-id )
4081 __is_abstract ( type-id )
4082 __is_base_of ( type-id , type-id )
4083 __is_class ( type-id )
4084 __is_convertible_to ( type-id , type-id )
4085 __is_empty ( type-id )
4086 __is_enum ( type-id )
4087 __is_final ( type-id )
4088 __is_literal_type ( type-id )
4089 __is_pod ( type-id )
4090 __is_polymorphic ( type-id )
4091 __is_std_layout ( type-id )
4092 __is_trivial ( type-id )
4093 __is_union ( type-id )
4095 Objective-C++ Extension:
4097 primary-expression:
4098 objc-expression
4100 literal:
4101 __null
4103 ADDRESS_P is true iff this expression was immediately preceded by
4104 "&" and therefore might denote a pointer-to-member. CAST_P is true
4105 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4106 true iff this expression is a template argument.
4108 Returns a representation of the expression. Upon return, *IDK
4109 indicates what kind of id-expression (if any) was present. */
4111 static tree
4118 {
4121 /* Assume the primary expression is not an id-expression. */
4124 /* Peek at the next token. */
4127 {
4128 /* literal:
4129 integer-literal
4130 character-literal
4131 floating-literal
4132 string-literal
4133 boolean-literal
4134 pointer-literal
4135 user-defined-literal */
4145 {
4149 }
4150 /* Floating-point literals are only allowed in an integral
4151 constant expression if they are cast to an integral or
4152 enumeration type. */
4156 {
4157 /* CAST_P will be set even in invalid code like "int(2.7 +
4158 ...)". Therefore, we have to check that the next token
4159 is sure to end the cast. */
4161 {
4166 enumerator-definition. */
4168 /* The curly brace at the end of an enum-specifier. */
4170 /* The end of a statement. */
4172 /* The end of the cast-expression. */
4174 /* The end of an array bound. */
4176 /* The closing ">" in a template-argument-list. */
4179 /* C++0x only: A ">>" treated like two ">" tokens,
4180 in a template-argument-list. */
4185 }
4187 /* If we are within a cast, then the constraint that the
4188 cast is to an integral or enumeration type will be
4189 checked at that point. If we are not within a cast, then
4190 this code is invalid. */
4193 }
4212 /* ??? Should wide strings be allowed when parser->translate_strings_p
4213 is false (i.e. in attributes)? If not, we can kill the third
4214 argument to cp_parser_string_literal. */
4220 {
4221 tree expr;
4224 /* Consume the `('. */
4226 /* Within a parenthesized expression, a `>' token is always
4227 the greater-than operator. */
4228 saved_greater_than_is_operator_p
4231 /* If we see `( { ' then we are looking at the beginning of
4232 a GNU statement-expression. */
4235 {
4236 /* Statement-expressions are not allowed by the standard. */
4240 /* And they're not allowed outside of a function-body; you
4241 cannot, for example, write:
4243 int i = ({ int j = 3; j + 1; });
4245 at class or namespace scope. */
4248 {
4250 "statement-expressions are not allowed outside "
4254 }
4255 else
4256 {
4257 /* Start the statement-expression. */
4259 /* Parse the compound-statement. */
4261 /* Finish up. */
4263 }
4264 }
4265 else
4266 {
4267 /* Parse the parenthesized expression. */
4269 /* Let the front end know that this expression was
4270 enclosed in parentheses. This matters in case, for
4271 example, the expression is of the form `A::B', since
4272 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4273 not. */
4275 /* DR 705: Wrapping an unqualified name in parentheses
4276 suppresses arg-dependent lookup. We want to pass back
4277 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4278 (c++/37862), but none of the others. */
4281 }
4282 /* The `>' token might be the end of a template-id or
4283 template-parameter-list now. */
4284 parser->greater_than_is_operator_p
4286 /* Consume the `)'. */
4291 }
4295 /* We have an Objective-C++ message. */
4297 {
4299 /* Don't warn about a failed tentative parse. */
4304 }
4308 /* We have an Objective-C++ string literal. */
4315 {
4316 /* These two are the boolean literals. */
4324 /* The `__null' literal. */
4329 /* The `nullptr' literal. */
4334 /* Recognize the `this' keyword. */
4338 {
4342 }
4343 /* Pointers cannot appear in constant-expressions. */
4348 /* The `operator' keyword can be the beginning of an
4349 id-expression. */
4356 {
4357 non_integral_constant name;
4359 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4360 __func__ are the names of variables -- but they are
4361 treated specially. Therefore, they are handled here,
4362 rather than relying on the generic id-expression logic
4363 below. Grammatically, these names are id-expressions.
4365 Consume the token. */
4369 {
4381 }
4386 /* Look up the name. */
4388 }
4391 {
4392 tree expression;
4393 tree type;
4394 source_location type_location;
4396 /* The `__builtin_va_arg' construct is used to handle
4397 `va_arg'. Consume the `__builtin_va_arg' token. */
4399 /* Look for the opening `('. */
4401 /* Now, parse the assignment-expression. */
4404 /* Look for the `,'. */
4407 /* Parse the type-id. */
4409 /* Look for the closing `)'. */
4411 /* Using `va_arg' in a constant-expression is not
4412 allowed. */
4414 NIC_VA_ARG))
4417 }
4445 /* Objective-C++ expressions. */
4455 {
4460 }
4464 }
4466 /* An id-expression can start with either an identifier, a
4467 `::' as the beginning of a qualified-id, or the "operator"
4468 keyword. */
4473 {
4474 tree id_expression;
4475 tree decl;
4481 id_expression:
4482 /* Parse the id-expression. */
4483 id_expression
4500 /* If we have a template-id, then no further lookup is
4501 required. If the template-id was for a template-class, we
4502 will sometimes have a TYPE_DECL at this point. */
4506 /* Look up the name. */
4507 else
4508 {
4509 tree ambiguous_decls;
4511 /* If we already know that this lookup is ambiguous, then
4512 we've already issued an error message; there's no reason
4513 to check again. */
4516 {
4519 }
4522 none_type,
4523 template_p,
4528 /* If the lookup was ambiguous, an error will already have
4529 been issued. */
4533 /* In Objective-C++, we may have an Objective-C 2.0
4534 dot-syntax for classes here. */
4539 {
4540 tree component;
4547 }
4549 /* In Objective-C++, an instance variable (ivar) may be preferred
4550 to whatever cp_parser_lookup_name() found. */
4553 /* If name lookup gives us a SCOPE_REF, then the
4554 qualifying scope was dependent. */
4556 {
4557 /* At this point, we do not know if DECL is a valid
4558 integral constant expression. We assume that it is
4559 in fact such an expression, so that code like:
4561 template <int N> struct A {
4562 int a[B<N>::i];
4563 };
4565 is accepted. At template-instantiation time, we
4566 will check that B<N>::i is actually a constant. */
4568 }
4569 /* Check to see if DECL is a local variable in a context
4570 where that is forbidden. */
4573 {
4574 /* It might be that we only found DECL because we are
4575 trying to be generous with pre-ISO scoping rules.
4576 For example, consider:
4578 int i;
4579 void g() {
4580 for (int i = 0; i < 10; ++i) {}
4581 extern void f(int j = i);
4582 }
4584 Here, name look up will originally find the out
4585 of scope `i'. We need to issue a warning message,
4586 but then use the global `i'. */
4589 {
4592 decl);
4594 }
4595 }
4596 }
4598 decl = (finish_id_expression
4600 idk,
4605 template_arg_p,
4611 }
4613 /* Anything else is an error. */
4617 }
4618 }
4626 {
4629 }
4631 /* Parse an id-expression.
4633 id-expression:
4634 unqualified-id
4635 qualified-id
4637 qualified-id:
4638 :: [opt] nested-name-specifier template [opt] unqualified-id
4639 :: identifier
4640 :: operator-function-id
4641 :: template-id
4643 Return a representation of the unqualified portion of the
4644 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4645 a `::' or nested-name-specifier.
4647 Often, if the id-expression was a qualified-id, the caller will
4648 want to make a SCOPE_REF to represent the qualified-id. This
4649 function does not do this in order to avoid wastefully creating
4650 SCOPE_REFs when they are not required.
4652 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4653 `template' keyword.
4655 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4656 uninstantiated templates.
4658 If *TEMPLATE_P is non-NULL, it is set to true iff the
4659 `template' keyword is used to explicitly indicate that the entity
4660 named is a template.
4662 If DECLARATOR_P is true, the id-expression is appearing as part of
4663 a declarator, rather than as part of an expression. */
4665 static tree
4672 {
4676 /* Assume the `template' keyword was not used. */
4680 /* Look for the optional `::' operator. */
4681 global_scope_p
4684 /* Look for the optional nested-name-specifier. */
4685 nested_name_specifier_p
4688 check_dependency_p,
4690 declarator_p)
4692 /* If there is a nested-name-specifier, then we are looking at
4693 the first qualified-id production. */
4695 {
4696 tree saved_scope;
4697 tree saved_object_scope;
4698 tree saved_qualifying_scope;
4699 tree unqualified_id;
4702 /* See if the next token is the `template' keyword. */
4706 /* Name lookup we do during the processing of the
4707 unqualified-id might obliterate SCOPE. */
4711 /* Process the final unqualified-id. */
4713 check_dependency_p,
4714 declarator_p,
4716 /* Restore the SAVED_SCOPE for our caller. */
4722 }
4723 /* Otherwise, if we are in global scope, then we are looking at one
4724 of the other qualified-id productions. */
4726 {
4728 tree id;
4730 /* Peek at the next token. */
4733 /* If it's an identifier, and the next token is not a "<", then
4734 we can avoid the template-id case. This is an optimization
4735 for this common case. */
4737 && !cp_parser_nth_token_starts_template_argument_list_p
4742 /* Try a template-id. */
4746 none_type,
4747 declarator_p);
4748 /* If that worked, we're done. */
4752 /* Peek at the next token. (Changes in the token buffer may
4753 have invalidated the pointer obtained above.) */
4757 {
4764 /* Fall through. */
4769 }
4770 }
4771 else
4774 declarator_p,
4775 optional_p);
4776 }
4778 /* Parse an unqualified-id.
4780 unqualified-id:
4781 identifier
4782 operator-function-id
4783 conversion-function-id
4784 ~ class-name
4785 template-id
4787 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4788 keyword, in a construct like `A::template ...'.
4790 Returns a representation of unqualified-id. For the `identifier'
4791 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4792 production a BIT_NOT_EXPR is returned; the operand of the
4793 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4794 other productions, see the documentation accompanying the
4795 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4796 names are looked up in uninstantiated templates. If DECLARATOR_P
4797 is true, the unqualified-id is appearing as part of a declarator,
4798 rather than as part of an expression. */
4800 static tree
4806 {
4809 /* Peek at the next token. */
4813 {
4815 {
4816 tree id;
4818 /* We don't know yet whether or not this will be a
4819 template-id. */
4821 /* Try a template-id. */
4823 check_dependency_p,
4824 none_type,
4825 declarator_p);
4826 /* If it worked, we're done. */
4829 /* Otherwise, it's an ordinary identifier. */
4831 }
4835 check_dependency_p,
4836 none_type,
4837 declarator_p);
4840 {
4841 tree type_decl;
4842 tree qualifying_scope;
4843 tree object_scope;
4844 tree scope;
4847 /* Consume the `~' token. */
4849 /* Parse the class-name. The standard, as written, seems to
4850 say that:
4852 template <typename T> struct S { ~S (); };
4853 template <typename T> S<T>::~S() {}
4855 is invalid, since `~' must be followed by a class-name, but
4856 `S<T>' is dependent, and so not known to be a class.
4857 That's not right; we need to look in uninstantiated
4858 templates. A further complication arises from:
4860 template <typename T> void f(T t) {
4861 t.T::~T();
4862 }
4864 Here, it is not possible to look up `T' in the scope of `T'
4865 itself. We must look in both the current scope, and the
4866 scope of the containing complete expression.
4868 Yet another issue is:
4870 struct S {
4871 int S;
4872 ~S();
4873 };
4875 S::~S() {}
4877 The standard does not seem to say that the `S' in `~S'
4878 should refer to the type `S' and not the data member
4879 `S::S'. */
4881 /* DR 244 says that we look up the name after the "~" in the
4882 same scope as we looked up the qualifying name. That idea
4883 isn't fully worked out; it's more complicated than that. */
4888 /* Check for invalid scopes. */
4890 {
4894 }
4896 {
4900 scope);
4905 }
4908 /* If the name is of the form "X::~X" it's OK even if X is a
4909 typedef. */
4918 {
4921 }
4923 /* ~auto means the destructor of whatever the object is. */
4925 {
4928 "%<~auto%> only available with "
4932 }
4934 /* If there was an explicit qualification (S::~T), first look
4935 in the scope given by the qualification (i.e., S).
4937 Note: in the calls to cp_parser_class_name below we pass
4938 typename_type so that lookup finds the injected-class-name
4939 rather than the constructor. */
4943 {
4948 typename_type,
4951 declarator_p);
4954 }
4955 /* In "N::S::~S", look in "N" as well. */
4957 {
4962 type_decl
4966 typename_type,
4969 declarator_p);
4972 }
4973 /* In "p->S::~T", look in the scope given by "*p" as well. */
4975 {
4980 type_decl
4984 typename_type,
4987 declarator_p);
4990 }
4991 /* Look in the surrounding context. */
4993 {
4999 type_decl
5003 typename_type,
5006 declarator_p);
5009 {
5010 /* We couldn't find a type with this name, so just accept
5011 it and check for a match at instantiation time. */
5016 }
5017 }
5018 /* If an error occurred, assume that the name of the
5019 destructor is the same as the name of the qualifying
5020 class. That allows us to keep parsing after running
5021 into ill-formed destructor names. */
5027 /* Check that destructor name and scope match. */
5029 {
5036 }
5038 /* [class.dtor]
5040 A typedef-name that names a class shall not be used as the
5041 identifier in the declarator for a destructor declaration. */
5048 type_decl);
5051 }
5055 {
5056 tree id;
5058 /* This could be a template-id, so we try that first. */
5060 /* Try a template-id. */
5063 none_type,
5064 declarator_p);
5065 /* If that worked, we're done. */
5068 /* We still don't know whether we're looking at an
5069 operator-function-id or a conversion-function-id. */
5071 /* Try an operator-function-id. */
5073 /* If that didn't work, try a conversion-function-id. */
5077 {
5078 /* 17.6.3.3.5 */
5083 }
5086 }
5087 /* Fall through. */
5094 }
5095 }
5097 /* Parse an (optional) nested-name-specifier.
5099 nested-name-specifier: [C++98]
5100 class-or-namespace-name :: nested-name-specifier [opt]
5101 class-or-namespace-name :: template nested-name-specifier [opt]
5103 nested-name-specifier: [C++0x]
5104 type-name ::
5105 namespace-name ::
5106 nested-name-specifier identifier ::
5107 nested-name-specifier template [opt] simple-template-id ::
5109 PARSER->SCOPE should be set appropriately before this function is
5110 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5111 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5112 in name lookups.
5114 Sets PARSER->SCOPE to the class (TYPE) or namespace
5115 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5116 it unchanged if there is no nested-name-specifier. Returns the new
5117 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5119 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5120 part of a declaration and/or decl-specifier. */
5122 static tree
5128 {
5133 /* Remember where the nested-name-specifier starts. */
5135 {
5138 }
5141 {
5142 tree new_scope;
5143 tree old_scope;
5144 tree saved_qualifying_scope;
5147 /* Spot cases that cannot be the beginning of a
5148 nested-name-specifier. */
5151 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5152 the already parsed nested-name-specifier. */
5154 {
5155 /* Grab the nested-name-specifier and continue the loop. */
5157 /* If we originally encountered this nested-name-specifier
5158 with IS_DECLARATION set to false, we will not have
5159 resolved TYPENAME_TYPEs, so we must do so here. */
5162 {
5167 }
5170 }
5172 /* Spot cases that cannot be the beginning of a
5173 nested-name-specifier. On the second and subsequent times
5174 through the loop, we look for the `template' keyword. */
5176 ;
5177 /* A template-id can start a nested-name-specifier. */
5179 ;
5180 /* DR 743: decltype can be used in a nested-name-specifier. */
5182 ;
5183 else
5184 {
5185 /* If the next token is not an identifier, then it is
5186 definitely not a type-name or namespace-name. */
5189 /* If the following token is neither a `<' (to begin a
5190 template-id), nor a `::', then we are not looking at a
5191 nested-name-specifier. */
5197 {
5201 }
5204 && !cp_parser_nth_token_starts_template_argument_list_p
5207 }
5209 /* The nested-name-specifier is optional, so we parse
5210 tentatively. */
5213 /* Look for the optional `template' keyword, if this isn't the
5214 first time through the loop. */
5217 else
5220 /* Save the old scope since the name lookup we are about to do
5221 might destroy it. */
5224 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5225 look up names in "X<T>::I" in order to determine that "Y" is
5226 a template. So, if we have a typename at this point, we make
5227 an effort to look through it. */
5229 && !typename_keyword_p
5234 /* Parse the qualifying entity. */
5235 new_scope
5237 typename_keyword_p,
5238 template_keyword_p,
5239 check_dependency_p,
5240 type_p,
5241 is_declaration);
5242 /* Look for the `::' token. */
5245 /* If we found what we wanted, we keep going; otherwise, we're
5246 done. */
5248 {
5251 /* Restore the OLD_SCOPE since it was valid before the
5252 failed attempt at finding the last
5253 class-or-namespace-name. */
5257 /* If the next token is a decltype, and the one after that is a
5258 `::', then the decltype has failed to resolve to a class or
5259 enumeration type. Give this error even when parsing
5260 tentatively since it can't possibly be valid--and we're going
5261 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5262 won't get another chance.*/
5266 {
5273 /* As below. */
5276 }
5280 /* If the next token is an identifier, and the one after
5281 that is a `::', then any valid interpretation would have
5282 found a class-or-namespace-name. */
5288 {
5291 {
5293 {
5294 tree decl;
5295 tree ambiguous_decls;
5298 none_type,
5307 decl);
5309 {
5310 // cp_parser_lookup_name has the same diagnostic,
5311 // thus make sure to emit it at most once.
5314 {
5319 }
5321 }
5322 else
5323 {
5325 cp_parser_name_lookup_error
5328 else
5329 cp_parser_name_lookup_error
5332 }
5333 }
5336 /* Treat this as a successful nested-name-specifier
5337 due to:
5339 [basic.lookup.qual]
5341 If the name found is not a class-name (clause
5342 _class_) or namespace-name (_namespace.def_), the
5343 program is ill-formed. */
5345 }
5347 }
5349 }
5350 /* We've found one valid nested-name-specifier. */
5352 /* Name lookup always gives us a DECL. */
5355 /* Uses of "template" must be followed by actual templates. */
5367 new_scope);
5368 /* If it is a class scope, try to complete it; we are about to
5369 be looking up names inside the class. */
5371 /* Since checking types for dependency can be expensive,
5372 avoid doing it if the type is already complete. */
5374 /* Do not try to complete dependent types. */
5376 {
5378 /* If it is a typedef to current class, use the current
5379 class instead, as the typedef won't have any names inside
5380 it yet. */
5384 }
5385 /* Make sure we look in the right scope the next time through
5386 the loop. */
5388 }
5390 /* If parsing tentatively, replace the sequence of tokens that makes
5391 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5392 token. That way, should we re-parse the token stream, we will
5393 not have to repeat the effort required to do the parse, nor will
5394 we issue duplicate error messages. */
5396 {
5400 /* Reset the contents of the START token. */
5402 /* Retrieve any deferred checks. Do not pop this access checks yet
5403 so the memory will not be reclaimed during token replacing below. */
5411 /* Purge all subsequent tokens. */
5413 }
5419 }
5421 /* Parse a nested-name-specifier. See
5422 cp_parser_nested_name_specifier_opt for details. This function
5423 behaves identically, except that it will an issue an error if no
5424 nested-name-specifier is present. */
5426 static tree
5432 {
5433 tree scope;
5435 /* Look for the nested-name-specifier. */
5437 typename_keyword_p,
5438 check_dependency_p,
5439 type_p,
5440 is_declaration);
5441 /* If it was not present, issue an error message. */
5443 {
5446 }
5449 }
5451 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5452 this is either a class-name or a namespace-name (which corresponds
5453 to the class-or-namespace-name production in the grammar). For
5454 C++0x, it can also be a type-name that refers to an enumeration
5455 type or a simple-template-id.
5457 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5458 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5459 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5460 TYPE_P is TRUE iff the next name should be taken as a class-name,
5461 even the same name is declared to be another entity in the same
5462 scope.
5464 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5465 specified by the class-or-namespace-name. If neither is found the
5466 ERROR_MARK_NODE is returned. */
5468 static tree
5475 {
5476 tree saved_scope;
5477 tree saved_qualifying_scope;
5478 tree saved_object_scope;
5479 tree scope;
5483 /* DR 743: decltype can appear in a nested-name-specifier. */
5485 {
5489 {
5492 }
5496 }
5498 /* Before we try to parse the class-name, we must save away the
5499 current PARSER->SCOPE since cp_parser_class_name will destroy
5500 it. */
5504 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5505 there is no need to look for a namespace-name. */
5506 only_class_p = template_keyword_p
5511 typename_keyword_p,
5512 template_keyword_p,
5514 check_dependency_p,
5516 is_declaration);
5518 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5522 {
5523 /* Restore the saved scope. */
5528 /* Parse tentatively. */
5531 /* Parse a type-name */
5534 /* "If the name found does not designate a namespace or a class,
5535 enumeration, or dependent type, the program is ill-formed."
5537 We cover classes and dependent types above and namespaces below,
5538 so this code is only looking for enums. */
5544 }
5545 /* If that didn't work, try for a namespace-name. */
5547 {
5548 /* Restore the saved scope. */
5552 /* If we are not looking at an identifier followed by the scope
5553 resolution operator, then this is not part of a
5554 nested-name-specifier. (Note that this function is only used
5555 to parse the components of a nested-name-specifier.) */
5560 }
5563 }
5565 /* Parse a postfix-expression.
5567 postfix-expression:
5568 primary-expression
5569 postfix-expression [ expression ]
5570 postfix-expression ( expression-list [opt] )
5571 simple-type-specifier ( expression-list [opt] )
5572 typename :: [opt] nested-name-specifier identifier
5573 ( expression-list [opt] )
5574 typename :: [opt] nested-name-specifier template [opt] template-id
5575 ( expression-list [opt] )
5576 postfix-expression . template [opt] id-expression
5577 postfix-expression -> template [opt] id-expression
5578 postfix-expression . pseudo-destructor-name
5579 postfix-expression -> pseudo-destructor-name
5580 postfix-expression ++
5581 postfix-expression --
5582 dynamic_cast < type-id > ( expression )
5583 static_cast < type-id > ( expression )
5584 reinterpret_cast < type-id > ( expression )
5585 const_cast < type-id > ( expression )
5586 typeid ( expression )
5587 typeid ( type-id )
5589 GNU Extension:
5591 postfix-expression:
5592 ( type-id ) { initializer-list , [opt] }
5594 This extension is a GNU version of the C99 compound-literal
5595 construct. (The C99 grammar uses `type-name' instead of `type-id',
5596 but they are essentially the same concept.)
5598 If ADDRESS_P is true, the postfix expression is the operand of the
5599 `&' operator. CAST_P is true if this expression is the target of a
5600 cast.
5602 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5603 class member access expressions [expr.ref].
5605 Returns a representation of the expression. */
5607 static tree
5611 {
5613 location_t loc;
5619 /* Peek at the next token. */
5622 /* Some of the productions are determined by keywords. */
5625 {
5630 {
5631 tree type;
5632 tree expression;
5636 /* All of these can be handled in the same way from the point
5637 of view of parsing. Begin by consuming the token
5638 identifying the cast. */
5641 /* New types cannot be defined in the cast. */
5643 parser->type_definition_forbidden_message
5646 /* Look for the opening `<'. */
5648 /* Parse the type to which we are casting. */
5653 /* Look for the closing `>'. */
5655 /* Restore the old message. */
5658 bool saved_greater_than_is_operator_p
5662 /* And the expression which is being cast. */
5667 parser->greater_than_is_operator_p
5670 /* Only type conversions to integral or enumeration types
5671 can be used in constant-expressions. */
5677 {
5679 postfix_expression
5683 postfix_expression
5687 postfix_expression
5689 tf_warning_or_error);
5692 postfix_expression
5697 }
5698 }
5702 {
5703 tree type;
5707 /* Consume the `typeid' token. */
5709 /* Look for the `(' token. */
5711 /* Types cannot be defined in a `typeid' expression. */
5713 parser->type_definition_forbidden_message
5715 /* We can't be sure yet whether we're looking at a type-id or an
5716 expression. */
5718 /* Try a type-id first. */
5723 /* Look for the `)' token. Otherwise, we can't be sure that
5724 we're not looking at an expression: consider `typeid (int
5725 (3))', for example. */
5727 /* If all went well, simply lookup the type-id. */
5730 /* Otherwise, fall back to the expression variant. */
5731 else
5732 {
5733 tree expression;
5735 /* Look for an expression. */
5737 /* Compute its typeid. */
5739 /* Look for the `)' token. */
5741 }
5742 /* Restore the saved message. */
5744 /* `typeid' may not appear in an integral constant expression. */
5747 }
5751 {
5752 tree type;
5753 /* The syntax permitted here is the same permitted for an
5754 elaborated-type-specifier. */
5759 }
5763 {
5766 tree p;
5780 tf_warning_or_error);
5783 tf_warning_or_error);
5784 else
5785 {
5789 }
5791 }
5794 {
5795 tree type;
5797 /* If the next thing is a simple-type-specifier, we may be
5798 looking at a functional cast. We could also be looking at
5799 an id-expression. So, we try the functional cast, and if
5800 that doesn't work we fall back to the primary-expression. */
5802 /* Look for the simple-type-specifier. */
5805 CP_PARSER_FLAGS_NONE);
5806 /* Parse the cast itself. */
5808 postfix_expression
5810 /* If that worked, we're done. */
5814 /* If the functional-cast didn't work out, try a
5815 compound-literal. */
5818 {
5823 /* Consume the `('. */
5825 /* Parse the type. */
5830 /* Look for the `)'. */
5832 /* If things aren't going well, there's no need to
5833 keep going. */
5835 {
5837 {
5839 /* Parse the brace-enclosed initializer list. */
5842 }
5843 else
5845 }
5846 /* If that worked, we're definitely looking at a
5847 compound-literal expression. */
5849 {
5850 /* Warn the user that a compound literal is not
5851 allowed in standard C++. */
5854 /* For simplicity, we disallow compound literals in
5855 constant-expressions. We could
5856 allow compound literals of integer type, whose
5857 initializer was a constant, in constant
5858 expressions. Permitting that usage, as a further
5859 extension, would not change the meaning of any
5860 currently accepted programs. (Of course, as
5861 compound literals are not part of ISO C++, the
5862 standard has nothing to say.) */
5864 NIC_NCC))
5865 {
5868 }
5869 /* Form the representation of the compound-literal. */
5870 postfix_expression
5872 tf_warning_or_error);
5874 }
5875 }
5877 /* It must be a primary-expression. */
5878 postfix_expression
5881 decltype_p,
5883 }
5885 }
5887 /* Note that we don't need to worry about calling build_cplus_new on a
5888 class-valued CALL_EXPR in decltype when it isn't the end of the
5889 postfix-expression; unary_complex_lvalue will take care of that for
5890 all these cases. */
5892 /* Keep looping until the postfix-expression is complete. */
5894 {
5898 /* It is not a Koenig lookup function call. */
5899 postfix_expression
5902 /* Peek at the next token. */
5906 {
5909 {
5911 "two consecutive %<[%> shall "
5914 }
5915 postfix_expression
5917 postfix_expression,
5919 decltype_p);
5925 /* postfix-expression ( expression-list [opt] ) */
5926 {
5936 is_builtin_constant_p
5939 {
5940 /* The whole point of __builtin_constant_p is to allow
5941 non-constant expressions to appear as arguments. */
5942 saved_integral_constant_expression_p
5944 saved_non_integral_constant_expression_p
5947 }
5948 args = (cp_parser_parenthesized_expression_list
5953 {
5954 parser->integral_constant_expression_p
5956 parser->non_integral_constant_expression_p
5958 }
5961 {
5964 }
5966 /* Function calls are not permitted in
5967 constant-expressions. */
5970 NIC_FUNC_CALL))
5971 {
5975 }
5980 {
5982 {
5984 {
5987 postfix_expression
5990 complain);
5991 }
5992 else
5993 postfix_expression
5995 }
5996 /* We do not perform argument-dependent lookup if
5997 normal lookup finds a non-function, in accordance
5998 with the expected resolution of DR 218. */
6001 {
6005 /* Do not do argument dependent lookup if regular
6006 lookup finds a member function or a block-scope
6007 function declaration. [basic.lookup.argdep]/3 */
6010 {
6013 postfix_expression
6016 complain);
6017 }
6018 }
6019 }
6022 {
6032 {
6033 postfix_expression
6037 }
6040 {
6041 postfix_expression
6042 = (build_new_method_call
6048 complain));
6049 }
6050 else
6051 postfix_expression
6055 complain);
6056 }
6060 postfix_expression = (build_offset_ref_call_from_tree
6062 complain));
6064 /* A call to a static class member, or a namespace-scope
6065 function. */
6066 postfix_expression
6069 koenig_p,
6070 complain);
6071 else
6072 /* All other function calls. */
6073 postfix_expression
6076 koenig_p,
6077 complain);
6079 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6083 }
6088 /* postfix-expression . template [opt] id-expression
6089 postfix-expression . pseudo-destructor-name
6090 postfix-expression -> template [opt] id-expression
6091 postfix-expression -> pseudo-destructor-name */
6093 /* Consume the `.' or `->' operator. */
6096 postfix_expression
6098 postfix_expression,
6105 /* postfix-expression ++ */
6106 /* Consume the `++' token. */
6108 /* Generate a representation for the complete expression. */
6109 postfix_expression
6111 POSTINCREMENT_EXPR);
6112 /* Increments may not appear in constant-expressions. */
6120 /* postfix-expression -- */
6121 /* Consume the `--' token. */
6123 /* Generate a representation for the complete expression. */
6124 postfix_expression
6126 POSTDECREMENT_EXPR);
6127 /* Decrements may not appear in constant-expressions. */
6139 else
6141 }
6142 }
6144 /* We should never get here. */
6147 }
6149 /* This function parses Cilk Plus array notations. If a normal array expr. is
6150 parsed then the array index is passed back to the caller through *INIT_INDEX
6151 and the function returns a NULL_TREE. If array notation expr. is parsed,
6152 then *INIT_INDEX is ignored by the caller and the function returns
6153 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6154 error_mark_node. */
6156 static tree
6158 tree array_value)
6159 {
6163 {
6166 }
6175 {
6178 }
6180 {
6181 /* Consume the ':'. */
6184 /* If we are here, then we have a case like this A[:]. */
6186 {
6190 }
6194 }
6195 else
6196 {
6197 /* If we are here, then there are three valid possibilities:
6198 1. ARRAY [ EXP ]
6199 2. ARRAY [ EXP : EXP ]
6200 3. ARRAY [ EXP : EXP : EXP ] */
6204 {
6205 /* This indicates that we have a normal array expression. */
6208 }
6210 /* Consume the ':'. */
6214 {
6217 }
6218 }
6223 {
6227 }
6233 }
6235 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6236 by cp_parser_builtin_offsetof. We're looking for
6238 postfix-expression [ expression ]
6239 postfix-expression [ braced-init-list ] (C++11)
6241 FOR_OFFSETOF is set if we're being called in that context, which
6242 changes how we deal with integer constant expressions. */
6244 static tree
6246 tree postfix_expression,
6249 {
6254 /* Consume the `[' token. */
6260 /* Parse the index expression. */
6261 /* ??? For offsetof, there is a question of what to allow here. If
6262 offsetof is not being used in an integral constant expression context,
6263 then we *could* get the right answer by computing the value at runtime.
6264 If we are in an integral constant expression context, then we might
6265 could accept any constant expression; hard to say without analysis.
6266 Rather than open the barn door too wide right away, allow only integer
6267 constant expressions here. */
6270 else
6271 {
6273 {
6279 {
6281 "braced list index is not allowed with array "
6285 }
6286 }
6288 {
6289 /* Here are have these two options:
6290 ARRAY[EXP : EXP] - Array notation expr with default
6291 stride of 1.
6292 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6293 stride. */
6295 postfix_expression);
6298 }
6299 else
6301 }
6305 /* Look for the closing `]'. */
6308 /* Build the ARRAY_REF. */
6312 /* When not doing offsetof, array references are not permitted in
6313 constant-expressions. */
6319 }
6321 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6322 by cp_parser_builtin_offsetof. We're looking for
6324 postfix-expression . template [opt] id-expression
6325 postfix-expression . pseudo-destructor-name
6326 postfix-expression -> template [opt] id-expression
6327 postfix-expression -> pseudo-destructor-name
6329 FOR_OFFSETOF is set if we're being called in that context. That sorta
6330 limits what of the above we'll actually accept, but nevermind.
6331 TOKEN_TYPE is the "." or "->" token, which will already have been
6332 removed from the stream. */
6334 static tree
6337 tree postfix_expression,
6339 location_t location)
6340 {
6341 tree name;
6346 /* If this is a `->' operator, dereference the pointer. */
6349 tf_warning_or_error);
6350 /* Check to see whether or not the expression is type-dependent. */
6352 /* The identifier following the `->' or `.' is not qualified. */
6358 /* Enter the scope corresponding to the type of the object
6359 given by the POSTFIX_EXPRESSION. */
6361 {
6363 /* According to the standard, no expression should ever have
6364 reference type. Unfortunately, we do not currently match
6365 the standard in this respect in that our internal representation
6366 of an expression may have reference type even when the standard
6367 says it does not. Therefore, we have to manually obtain the
6368 underlying type here. */
6370 /* The type of the POSTFIX_EXPRESSION must be complete. */
6372 {
6374 postfix_expression);
6376 }
6377 /* Unlike the object expression in other contexts, *this is not
6378 required to be of complete type for purposes of class member
6379 access (5.2.5) outside the member function body. */
6383 /* Let the name lookup machinery know that we are processing a
6384 class member access expression. */
6386 /* If something went wrong, we want to be able to discern that case,
6387 as opposed to the case where there was no SCOPE due to the type
6388 of expression being dependent. */
6391 /* If the SCOPE was erroneous, make the various semantic analysis
6392 functions exit quickly -- and without issuing additional error
6393 messages. */
6396 }
6398 /* Assume this expression is not a pseudo-destructor access. */
6401 /* If the SCOPE is a scalar type, then, if this is a valid program,
6402 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6403 is type dependent, it can be pseudo-destructor-name or something else.
6404 Try to parse it as pseudo-destructor-name first. */
6406 {
6407 tree s;
6408 tree type;
6411 /* Parse the pseudo-destructor-name. */
6420 {
6422 postfix_expression
6425 }
6426 }
6429 {
6430 /* If the SCOPE is not a scalar type, we are looking at an
6431 ordinary class member access expression, rather than a
6432 pseudo-destructor-name. */
6435 /* Parse the id-expression. */
6436 name = (cp_parser_id_expression
6443 /* In general, build a SCOPE_REF if the member name is qualified.
6444 However, if the name was not dependent and has already been
6445 resolved; there is no need to build the SCOPE_REF. For example;
6447 struct X { void f(); };
6448 template <typename T> void f(T* t) { t->X::f(); }
6450 Even though "t" is dependent, "X::f" is not and has been resolved
6451 to a BASELINK; there is no need to include scope information. */
6453 /* But we do need to remember that there was an explicit scope for
6454 virtual function calls. */
6458 /* If the name is a template-id that names a type, we will get a
6459 TYPE_DECL here. That is invalid code. */
6461 {
6464 }
6465 else
6466 {
6468 {
6470 {
6474 }
6475 else
6478 name,
6479 template_p);
6483 }
6485 adjust_result_of_qualified_name_lookup
6487 postfix_expression
6489 template_p,
6490 tf_warning_or_error);
6491 }
6492 }
6494 /* We no longer need to look up names in the scope of the object on
6495 the left-hand side of the `.' or `->' operator. */
6498 /* Outside of offsetof, these operators may not appear in
6499 constant-expressions. */
6501 && (cp_parser_non_integral_constant_expression
6506 }
6508 /* Parse a parenthesized expression-list.
6510 expression-list:
6511 assignment-expression
6512 expression-list, assignment-expression
6514 attribute-list:
6515 expression-list
6516 identifier
6517 identifier, expression-list
6519 CAST_P is true if this expression is the target of a cast.
6521 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6522 argument pack.
6524 Returns a vector of trees. Each element is a representation of an
6525 assignment-expression. NULL is returned if the ( and or ) are
6526 missing. An empty, but allocated, vector is returned on no
6527 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6528 if we are parsing an attribute list for an attribute that wants a
6529 plain identifier argument, normal_attr for an attribute that wants
6530 an expression, or non_attr if we aren't parsing an attribute list. If
6531 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6532 not all of the expressions in the list were constant. */
6540 {
6546 /* Assume all the expressions will be constant. */
6555 /* Within a parenthesized expression, a `>' token is always
6556 the greater-than operator. */
6557 saved_greater_than_is_operator_p
6561 /* Consume expressions until there are no more. */
6564 {
6565 tree expr;
6567 /* At the beginning of attribute lists, check to see if the
6568 next token is an identifier. */
6571 {
6574 /* Consume the identifier. */
6576 /* Save the identifier. */
6578 }
6579 else
6580 {
6583 /* Parse the next assignment-expression. */
6585 {
6586 /* A braced-init-list. */
6591 }
6593 {
6594 expr = (cp_parser_constant_expression
6599 }
6600 else
6606 /* If we have an ellipsis, then this is an expression
6607 expansion. */
6610 {
6611 /* Consume the `...'. */
6614 /* Build the argument pack. */
6616 }
6618 /* Add it to the list. We add error_mark_node
6619 expressions to the list, so that we can still tell if
6620 the correct form for a parenthesized expression-list
6621 is found. That gives better errors. */
6626 }
6628 /* After the first item, attribute lists look the same as
6629 expression lists. */
6632 get_comma:;
6633 /* If the next token isn't a `,', then we are done. */
6637 /* Otherwise, consume the `,' and keep going. */
6639 }
6642 {
6645 skip_comma:;
6646 /* We try and resync to an unnested comma, as that will give the
6647 user better diagnostics. */
6655 {
6656 parser->greater_than_is_operator_p
6659 }
6660 }
6662 parser->greater_than_is_operator_p
6669 }
6671 /* Parse a pseudo-destructor-name.
6673 pseudo-destructor-name:
6674 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6675 :: [opt] nested-name-specifier template template-id :: ~ type-name
6676 :: [opt] nested-name-specifier [opt] ~ type-name
6678 If either of the first two productions is used, sets *SCOPE to the
6679 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6680 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6681 or ERROR_MARK_NODE if the parse fails. */
6683 static void
6685 tree object,
6688 {
6691 /* Handle ~auto. */
6695 {
6698 "%<~auto%> only available with "
6705 }
6707 /* Assume that things will not work out. */
6710 /* Look for the optional `::' operator. */
6712 /* Look for the optional nested-name-specifier. */
6713 nested_name_specifier_p
6720 /* Now, if we saw a nested-name-specifier, we might be doing the
6721 second production. */
6724 {
6725 /* Consume the `template' keyword. */
6727 /* Parse the template-id. */
6731 class_type,
6733 /* Look for the `::' token. */
6735 }
6736 /* If the next token is not a `~', then there might be some
6737 additional qualification. */
6739 {
6740 /* At this point, we're looking for "type-name :: ~". The type-name
6741 must not be a class-name, since this is a pseudo-destructor. So,
6742 it must be either an enum-name, or a typedef-name -- both of which
6743 are just identifiers. So, we peek ahead to check that the "::"
6744 and "~" tokens are present; if they are not, then we can avoid
6745 calling type_name. */
6749 {
6752 }
6754 /* Look for the type-name. */
6759 /* Look for the `::' token. */
6761 }
6762 else
6765 /* Look for the `~'. */
6768 /* Once we see the ~, this has to be a pseudo-destructor. */
6772 /* Look for the type-name again. We are not responsible for
6773 checking that it matches the first type-name. */
6775 }
6777 /* Parse a unary-expression.
6779 unary-expression:
6780 postfix-expression
6781 ++ cast-expression
6782 -- cast-expression
6783 unary-operator cast-expression
6784 sizeof unary-expression
6785 sizeof ( type-id )
6786 alignof ( type-id ) [C++0x]
6787 new-expression
6788 delete-expression
6790 GNU Extensions:
6792 unary-expression:
6793 __extension__ cast-expression
6794 __alignof__ unary-expression
6795 __alignof__ ( type-id )
6796 alignof unary-expression [C++0x]
6797 __real__ cast-expression
6798 __imag__ cast-expression
6799 && identifier
6800 sizeof ( type-id ) { initializer-list , [opt] }
6801 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
6802 __alignof__ ( type-id ) { initializer-list , [opt] }
6804 ADDRESS_P is true iff the unary-expression is appearing as the
6805 operand of the `&' operator. CAST_P is true if this expression is
6806 the target of a cast.
6808 Returns a representation of the expression. */
6810 static tree
6813 {
6817 /* Peek at the next token. */
6819 /* Some keywords give away the kind of expression. */
6821 {
6825 {
6828 {
6831 location_t first_loc;
6834 /* Consume the token. */
6837 /* Parse the operand. */
6842 else
6843 {
6844 /* ISO C++ defines alignof only with types, not with
6845 expressions. So pedwarn if alignof is used with a non-
6846 type expression. However, __alignof__ is ok. */
6849 "ISO C++ does not allow %<alignof%> "
6853 }
6854 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6855 SIZEOF_EXPR with the original operand. */
6857 {
6859 {
6861 {
6864 error_mark_node));
6866 }
6867 else
6871 }
6873 }
6875 }
6884 {
6885 /* The saved value of the PEDANTIC flag. */
6887 tree expr;
6889 /* Save away the PEDANTIC flag. */
6891 /* Parse the cast-expression. */
6893 /* Restore the PEDANTIC flag. */
6897 }
6901 {
6902 tree expression;
6904 /* Consume the `__real__' or `__imag__' token. */
6906 /* Parse the cast-expression. */
6908 /* Create the complete representation. */
6912 expression,
6913 tf_warning_or_error);
6914 }
6922 {
6923 tree expr;
6933 parser->type_definition_forbidden_message
6936 saved_integral_constant_expression_p
6938 saved_non_integral_constant_expression_p
6942 saved_greater_than_is_operator_p
6952 parser->greater_than_is_operator_p
6955 parser->integral_constant_expression_p
6957 parser->non_integral_constant_expression_p
6964 }
6968 }
6969 }
6971 /* Look for the `:: new' and `:: delete', which also signal the
6972 beginning of a new-expression, or delete-expression,
6973 respectively. If the next token is `::', then it might be one of
6974 these. */
6976 {
6979 /* See if the token after the `::' is one of the keywords in
6980 which we're interested. */
6982 /* If it's `new', we have a new-expression. */
6985 /* Similarly, for `delete'. */
6988 }
6990 /* Look for a unary operator. */
6992 /* The `++' and `--' operators can be handled similarly, even though
6993 they are not technically unary-operators in the grammar. */
6995 {
7000 /* Handle the GNU address-of-label extension. */
7003 {
7004 tree identifier;
7005 tree expression;
7008 /* Consume the '&&' token. */
7010 /* Look for the identifier. */
7012 /* Create an expression representing the address. */
7015 NIC_ADDR_LABEL))
7018 }
7019 }
7021 {
7022 tree cast_expression;
7028 /* Consume the operator token. */
7030 /* Parse the cast-expression. */
7031 cast_expression
7036 pidk);
7037 /* Now, build an appropriate representation. */
7039 {
7043 RO_UNARY_STAR,
7044 complain);
7049 /* Fall through. */
7052 cast_expression,
7053 complain);
7060 /* Fall through. */
7070 }
7074 non_constant_p))
7078 }
7082 decltype_p,
7083 pidk);
7084 }
7089 {
7092 }
7094 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7095 unary-operator, the corresponding tree code is returned. */
7097 static enum tree_code
7099 {
7101 {
7122 }
7123 }
7125 /* Parse a new-expression.
7127 new-expression:
7128 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7129 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7131 Returns a representation of the expression. */
7133 static tree
7135 {
7138 tree type;
7141 tree ret;
7143 /* Look for the optional `::' operator. */
7144 global_scope_p
7148 /* Look for the `new' operator. */
7150 /* There's no easy way to tell a new-placement from the
7151 `( type-id )' construct. */
7153 /* Look for a new-placement. */
7155 /* If that didn't work out, there's no new-placement. */
7157 {
7161 }
7163 /* If the next token is a `(', then we have a parenthesized
7164 type-id. */
7166 {
7170 /* Consume the `('. */
7173 /* Parse the type-id. */
7174 parser->type_definition_forbidden_message
7179 /* Look for the closing `)'. */
7182 /* There should not be a direct-new-declarator in this production,
7183 but GCC used to allowed this, so we check and emit a sensible error
7184 message for this case. */
7186 {
7192 }
7193 }
7194 /* Otherwise, there must be a new-type-id. */
7195 else
7198 /* If the next token is a `(' or '{', then we have a new-initializer. */
7202 else
7205 /* A new-expression may not appear in an integral constant
7206 expression. */
7209 else
7210 {
7211 /* Create a representation of the new-expression. */
7213 tf_warning_or_error);
7214 }
7222 }
7224 /* Parse a new-placement.
7226 new-placement:
7227 ( expression-list )
7229 Returns the same representation as for an expression-list. */
7233 {
7236 /* Parse the expression-list. */
7237 expression_list = (cp_parser_parenthesized_expression_list
7243 }
7245 /* Parse a new-type-id.
7247 new-type-id:
7248 type-specifier-seq new-declarator [opt]
7250 Returns the TYPE allocated. If the new-type-id indicates an array
7251 type, *NELTS is set to the number of elements in the last array
7252 bound; the TYPE will not include the last array bound. */
7254 static tree
7256 {
7257 cp_decl_specifier_seq type_specifier_seq;
7263 /* The type-specifier sequence must not contain type definitions.
7264 (It cannot contain declarations of new types either, but if they
7265 are not definitions we will catch that because they are not
7266 complete.) */
7268 parser->type_definition_forbidden_message
7270 /* Parse the type-specifier-seq. */
7274 /* Restore the old message. */
7280 /* Parse the new-declarator. */
7283 /* Determine the number of elements in the last array dimension, if
7284 any. */
7286 /* Skip down to the last array dimension. */
7291 {
7294 }
7299 {
7302 }
7305 {
7312 else
7314 }
7317 }
7319 /* Parse an (optional) new-declarator.
7321 new-declarator:
7322 ptr-operator new-declarator [opt]
7323 direct-new-declarator
7325 Returns the declarator. */
7329 {
7332 cp_cv_quals cv_quals;
7334 /* We don't know if there's a ptr-operator next, or not. */
7336 /* Look for a ptr-operator. */
7338 /* If that worked, look for more new-declarators. */
7340 {
7343 /* Parse another optional declarator. */
7346 declarator = cp_parser_make_indirect_declarator
7350 }
7352 /* If the next token is a `[', there is a direct-new-declarator. */
7357 }
7359 /* Parse a direct-new-declarator.
7361 direct-new-declarator:
7362 [ expression ]
7363 direct-new-declarator [constant-expression]
7365 */
7369 {
7373 {
7374 tree expression;
7377 /* Look for the opening `['. */
7382 /* The standard requires that the expression have integral
7383 type. DR 74 adds enumeration types. We believe that the
7384 real intent is that these expressions be handled like the
7385 expression in a `switch' condition, which also allows
7386 classes with a single conversion to integral or
7387 enumeration type. */
7389 {
7390 expression
7392 expression,
7395 {
7397 "expression in new-declarator must have integral "
7400 }
7401 }
7403 /* Look for the closing `]'. */
7406 /* Add this bound to the declarator. */
7409 /* If the next token is not a `[', then there are no more
7410 bounds. */
7413 }
7416 }
7418 /* Parse a new-initializer.
7420 new-initializer:
7421 ( expression-list [opt] )
7422 braced-init-list
7424 Returns a representation of the expression-list. */
7428 {
7432 {
7433 tree t;
7439 }
7440 else
7441 expression_list = (cp_parser_parenthesized_expression_list
7447 }
7449 /* Parse a delete-expression.
7451 delete-expression:
7452 :: [opt] delete cast-expression
7453 :: [opt] delete [ ] cast-expression
7455 Returns a representation of the expression. */
7457 static tree
7459 {
7462 tree expression;
7464 /* Look for the optional `::' operator. */
7465 global_scope_p
7469 /* Look for the `delete' keyword. */
7471 /* See if the array syntax is in use. */
7473 {
7474 /* Consume the `[' token. */
7476 /* Look for the `]' token. */
7478 /* Remember that this is the `[]' construct. */
7480 }
7481 else
7484 /* Parse the cast-expression. */
7487 /* A delete-expression may not appear in an integral constant
7488 expression. */
7493 tf_warning_or_error);
7494 }
7496 /* Returns true if TOKEN may start a cast-expression and false
7497 otherwise. */
7499 static bool
7501 {
7504 {
7544 /* In ((type ()) () the last () isn't a valid cast-expression,
7545 so the whole must be parsed as postfix-expression. */
7549 /* '[' may start a primary-expression in obj-c++. */
7555 }
7556 }
7558 /* Parse a cast-expression.
7560 cast-expression:
7561 unary-expression
7562 ( type-id ) cast-expression
7564 ADDRESS_P is true iff the unary-expression is appearing as the
7565 operand of the `&' operator. CAST_P is true if this expression is
7566 the target of a cast.
7568 Returns a representation of the expression. */
7570 static tree
7573 {
7574 /* If it's a `(', then we might be looking at a cast. */
7576 {
7582 /* There's no way to know yet whether or not this is a cast.
7583 For example, `(int (3))' is a unary-expression, while `(int)
7584 3' is a cast. So, we resort to parsing tentatively. */
7586 /* Types may not be defined in a cast. */
7588 parser->type_definition_forbidden_message
7590 /* Consume the `('. */
7592 /* A very tricky bit is that `(struct S) { 3 }' is a
7593 compound-literal (which we permit in C++ as an extension).
7594 But, that construct is not a cast-expression -- it is a
7595 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7596 is legal; if the compound-literal were a cast-expression,
7597 you'd need an extra set of parentheses.) But, if we parse
7598 the type-id, and it happens to be a class-specifier, then we
7599 will commit to the parse at that point, because we cannot
7600 undo the action that is done when creating a new class. So,
7601 then we cannot back up and do a postfix-expression.
7603 Therefore, we scan ahead to the closing `)', and check to see
7604 if the token after the `)' is a `{'. If so, we are not
7605 looking at a cast-expression.
7607 Save tokens so that we can put them back. */
7609 /* Skip tokens until the next token is a closing parenthesis.
7610 If we find the closing `)', and the next token is a `{', then
7611 we are looking at a compound-literal. */
7612 compound_literal_p
7616 /* Roll back the tokens we skipped. */
7618 /* If we were looking at a compound-literal, simulate an error
7619 so that the call to cp_parser_parse_definitely below will
7620 fail. */
7623 else
7624 {
7627 /* Look for the type-id. */
7629 /* Look for the closing `)'. */
7632 }
7634 /* Restore the saved message. */
7637 /* At this point this can only be either a cast or a
7638 parenthesized ctor such as `(T ())' that looks like a cast to
7639 function returning T. */
7642 {
7648 pidk);
7650 /* Warn about old-style casts, if so requested. */
7652 && !in_system_header
7657 /* Only type conversions to integral or enumeration types
7658 can be used in constant-expressions. */
7661 NIC_CAST))
7664 /* Perform the cast. */
7667 }
7668 else
7670 }
7672 /* If we get here, then it's not a cast, so it must be a
7673 unary-expression. */
7676 }
7678 /* Parse a binary expression of the general form:
7680 pm-expression:
7681 cast-expression
7682 pm-expression .* cast-expression
7683 pm-expression ->* cast-expression
7685 multiplicative-expression:
7686 pm-expression
7687 multiplicative-expression * pm-expression
7688 multiplicative-expression / pm-expression
7689 multiplicative-expression % pm-expression
7691 additive-expression:
7692 multiplicative-expression
7693 additive-expression + multiplicative-expression
7694 additive-expression - multiplicative-expression
7696 shift-expression:
7697 additive-expression
7698 shift-expression << additive-expression
7699 shift-expression >> additive-expression
7701 relational-expression:
7702 shift-expression
7703 relational-expression < shift-expression
7704 relational-expression > shift-expression
7705 relational-expression <= shift-expression
7706 relational-expression >= shift-expression
7708 GNU Extension:
7710 relational-expression:
7711 relational-expression <? shift-expression
7712 relational-expression >? shift-expression
7714 equality-expression:
7715 relational-expression
7716 equality-expression == relational-expression
7717 equality-expression != relational-expression
7719 and-expression:
7720 equality-expression
7721 and-expression & equality-expression
7723 exclusive-or-expression:
7724 and-expression
7725 exclusive-or-expression ^ and-expression
7727 inclusive-or-expression:
7728 exclusive-or-expression
7729 inclusive-or-expression | exclusive-or-expression
7731 logical-and-expression:
7732 inclusive-or-expression
7733 logical-and-expression && inclusive-or-expression
7735 logical-or-expression:
7736 logical-and-expression
7737 logical-or-expression || logical-and-expression
7739 All these are implemented with a single function like:
7741 binary-expression:
7742 simple-cast-expression
7743 binary-expression <token> binary-expression
7745 CAST_P is true if this expression is the target of a cast.
7747 The binops_by_token map is used to get the tree codes for each <token> type.
7748 binary-expressions are associated according to a precedence table. */
7750 #define TOKEN_PRECEDENCE(token) \
7751 (((token->type == CPP_GREATER \
7752 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7753 && !parser->greater_than_is_operator_p) \
7754 ? PREC_NOT_OPERATOR \
7755 : binops_by_token[token->type].prec)
7757 static tree
7763 {
7764 cp_parser_expression_stack stack;
7766 cp_parser_expression_stack_entry current;
7767 tree rhs;
7771 tree overload;
7773 /* Parse the first expression. */
7783 {
7784 /* Get an operator token. */
7790 {
7792 "%<>>%> operator is treated"
7796 }
7800 /* Popping an entry off the stack means we completed a subexpression:
7801 - either we found a token which is not an operator (`>' where it is not
7802 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7803 will happen repeatedly;
7804 - or, we found an operator which has lower priority. This is the case
7805 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7806 parsing `3 * 4'. */
7808 {
7811 else
7813 }
7815 get_rhs:
7819 /* We used the operator token. */
7822 /* For "false && x" or "true || x", x will never be executed;
7823 disable warnings while evaluating it. */
7829 /* Extract another operand. It may be the RHS of this expression
7830 or the LHS of a new, higher priority expression. */
7834 /* Get another operator token. Look up its precedence to avoid
7835 building a useless (immediately popped) stack entry for common
7836 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7840 {
7841 /* ... and prepare to parse the RHS of the new, higher priority
7842 expression. Since precedence levels on the stack are
7843 monotonically increasing, we do not have to care about
7844 stack overflows. */
7853 pop:
7855 /* If the stack is not empty, we have parsed into LHS the right side
7856 (`4' in the example above) of an expression we had suspended.
7857 We can use the information on the stack to recover the LHS (`3')
7858 from the stack together with the tree code (`MULT_EXPR'), and
7859 the precedence of the higher level subexpression
7860 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7861 which will be used to actually build the additive expression. */
7866 }
7868 /* Undo the disabling of warnings done above. */
7875 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7876 ERROR_MARK for everything that is not a binary expression.
7877 This makes warn_about_parentheses miss some warnings that
7878 involve unary operators. For unary expressions we should
7879 pass the correct tree_code unless the unary expression was
7880 surrounded by parentheses.
7881 */
7887 == tcc_comparison
7890 else
7899 /* If the binary operator required the use of an overloaded operator,
7900 then this expression cannot be an integral constant-expression.
7901 An overloaded operator can be used even if both operands are
7902 otherwise permissible in an integral constant-expression if at
7903 least one of the operands is of enumeration type. */
7907 NIC_OVERLOADED))
7909 }
7912 }
7914 static tree
7919 {
7922 }
7924 /* Parse the `? expression : assignment-expression' part of a
7925 conditional-expression. The LOGICAL_OR_EXPR is the
7926 logical-or-expression that started the conditional-expression.
7927 Returns a representation of the entire conditional-expression.
7929 This routine is used by cp_parser_assignment_expression.
7931 ? expression : assignment-expression
7933 GNU Extensions:
7935 ? : assignment-expression */
7937 static tree
7939 {
7940 tree expr;
7941 tree assignment_expr;
7945 /* Consume the `?' token. */
7950 {
7953 /* Implicit true clause. */
7957 }
7958 else
7959 {
7962 /* Parse the expression. */
7965 c_inhibit_evaluation_warnings +=
7969 }
7971 /* The next token should be a `:'. */
7973 /* Parse the assignment-expression. */
7977 /* Build the conditional-expression. */
7979 expr,
7980 assignment_expr,
7981 tf_warning_or_error);
7982 }
7984 /* Parse an assignment-expression.
7986 assignment-expression:
7987 conditional-expression
7988 logical-or-expression assignment-operator assignment_expression
7989 throw-expression
7991 CAST_P is true if this expression is the target of a cast.
7992 DECLTYPE_P is true if this expression is the operand of decltype.
7994 Returns a representation for the expression. */
7996 static tree
7999 {
8000 tree expr;
8002 /* If the next token is the `throw' keyword, then we're looking at
8003 a throw-expression. */
8006 /* Otherwise, it must be that we are looking at a
8007 logical-or-expression. */
8008 else
8009 {
8010 /* Parse the binary expressions (logical-or-expression). */
8012 decltype_p,
8014 /* If the next token is a `?' then we're actually looking at a
8015 conditional-expression. */
8018 else
8019 {
8022 /* If it's an assignment-operator, we're using the second
8023 production. */
8024 enum tree_code assignment_operator
8027 {
8029 location_t saved_input_location;
8031 /* Parse the right-hand side of the assignment. */
8037 /* An assignment may not appear in a
8038 constant-expression. */
8040 NIC_ASSIGNMENT))
8042 /* Build the assignment expression. Its default
8043 location is the location of the '=' token. */
8047 assignment_operator,
8048 rhs,
8051 }
8052 }
8053 }
8056 }
8058 static tree
8061 {
8064 }
8066 /* Parse an (optional) assignment-operator.
8068 assignment-operator: one of
8069 = *= /= %= += -= >>= <<= &= ^= |=
8071 GNU Extension:
8073 assignment-operator: one of
8074 <?= >?=
8076 If the next token is an assignment operator, the corresponding tree
8077 code is returned, and the token is consumed. For example, for
8078 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8079 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8080 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8081 operator, ERROR_MARK is returned. */
8083 static enum tree_code
8085 {
8089 /* Peek at the next token. */
8093 {
8139 /* Nothing else is an assignment operator. */
8141 }
8143 /* If it was an assignment operator, consume it. */
8148 }
8150 /* Parse an expression.
8152 expression:
8153 assignment-expression
8154 expression , assignment-expression
8156 CAST_P is true if this expression is the target of a cast.
8157 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8158 except possibly parenthesized or on the RHS of a comma (N3276).
8160 Returns a representation of the expression. */
8162 static tree
8165 {
8170 {
8171 tree assignment_expression;
8173 /* Parse the next assignment-expression. */
8174 assignment_expression
8177 /* We don't create a temporary for a call that is the immediate operand
8178 of decltype or on the RHS of a comma. But when we see a comma, we
8179 need to create a temporary for a call on the LHS. */
8184 assignment_expression
8188 /* If this is the first assignment-expression, we can just
8189 save it away. */
8192 else
8194 assignment_expression,
8196 /* If the next token is not a comma, then we are done with the
8197 expression. */
8200 /* Consume the `,'. */
8203 /* A comma operator cannot appear in a constant-expression. */
8206 }
8209 }
8213 {
8215 }
8217 /* Parse a constant-expression.
8219 constant-expression:
8220 conditional-expression
8222 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8223 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8224 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8225 is false, NON_CONSTANT_P should be NULL. */
8227 static tree
8231 {
8235 tree expression;
8237 /* It might seem that we could simply parse the
8238 conditional-expression, and then check to see if it were
8239 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8240 one that the compiler can figure out is constant, possibly after
8241 doing some simplifications or optimizations. The standard has a
8242 precise definition of constant-expression, and we must honor
8243 that, even though it is somewhat more restrictive.
8245 For example:
8247 int i[(2, 3)];
8249 is not a legal declaration, because `(2, 3)' is not a
8250 constant-expression. The `,' operator is forbidden in a
8251 constant-expression. However, GCC's constant-folding machinery
8252 will fold this operation to an INTEGER_CST for `3'. */
8254 /* Save the old settings. */
8256 saved_allow_non_integral_constant_expression_p
8259 /* We are now parsing a constant-expression. */
8261 parser->allow_non_integral_constant_expression_p
8264 /* Although the grammar says "conditional-expression", we parse an
8265 "assignment-expression", which also permits "throw-expression"
8266 and the use of assignment operators. In the case that
8267 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8268 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8269 actually essential that we look for an assignment-expression.
8270 For example, cp_parser_initializer_clauses uses this function to
8271 determine whether a particular assignment-expression is in fact
8272 constant. */
8274 /* Restore the old settings. */
8275 parser->integral_constant_expression_p
8277 parser->allow_non_integral_constant_expression_p
8280 {
8281 /* Require an rvalue constant expression here; that's what our
8282 callers expect. Reference constant expressions are handled
8283 separately in e.g. cp_parser_template_argument. */
8288 }
8291 parser->non_integral_constant_expression_p
8295 }
8297 /* Parse __builtin_offsetof.
8299 offsetof-expression:
8300 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8302 offsetof-member-designator:
8303 id-expression
8304 | offsetof-member-designator "." id-expression
8305 | offsetof-member-designator "[" expression "]"
8306 | offsetof-member-designator "->" id-expression */
8308 static tree
8310 {
8313 cp_id_kind dummy;
8316 /* We're about to accept non-integral-constant things, but will
8317 definitely yield an integral constant expression. Save and
8318 restore these values around our local parsing. */
8322 /* Consume the "__builtin_offsetof" token. */
8324 /* Consume the opening `('. */
8326 /* Parse the type-id. */
8328 /* Look for the `,'. */
8332 /* Build the (type *)null that begins the traditional offsetof macro. */
8334 tf_warning_or_error);
8336 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8340 {
8343 {
8345 /* offsetof-member-designator "[" expression "]" */
8351 /* offsetof-member-designator "->" identifier */
8354 /* FALLTHRU */
8357 /* offsetof-member-designator "." identifier */
8365 /* Consume the ")" token. */
8370 /* Error. We know the following require will fail, but
8371 that gives the proper error message. */
8376 }
8377 }
8379 success:
8380 /* If we're processing a template, we can't finish the semantics yet.
8381 Otherwise we can fold the entire expression now. */
8384 else
8387 failure:
8392 }
8394 /* Parse a trait expression.
8396 Returns a representation of the expression, the underlying type
8397 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8399 static tree
8401 {
8402 cp_trait_kind kind;
8405 cp_decl_specifier_seq decl_specs;
8408 {
8485 }
8487 /* Consume the token. */
8497 /* Build a trivial decl-specifier-seq. */
8501 /* Call grokdeclarator to figure out what type this is. */
8506 {
8514 /* Build a trivial decl-specifier-seq. */
8518 /* Call grokdeclarator to figure out what type this is. */
8521 }
8525 /* Complete the trait expression, which may mean either processing
8526 the trait expr now or saving it for template instantiation. */
8528 {
8537 }
8538 }
8540 /* Lambdas that appear in variable initializer or default argument scope
8541 get that in their mangling, so we need to record it. We might as well
8542 use the count for function and namespace scopes as well. */
8546 {
8547 tree t;
8552 static void
8554 {
8555 tree_int ti;
8557 /* Once we're inside a function, we ignore other scopes and just push
8558 the function again so that popping works properly. */
8565 {
8566 /* Don't reset the count if we're still in the same function. */
8569 }
8570 }
8572 static void
8574 {
8577 }
8579 static void
8581 {
8584 {
8587 }
8589 }
8591 /* Parse a lambda expression.
8593 lambda-expression:
8594 lambda-introducer lambda-declarator [opt] compound-statement
8596 Returns a representation of the expression. */
8598 static tree
8600 {
8602 tree type;
8612 /* We may be in the middle of deferred access check. Disable
8613 it now. */
8624 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8627 /* Now that we've started the type, add the capture fields for any
8628 explicit captures. */
8631 {
8632 /* Inside the class, surrounding template-parameter-lists do not apply. */
8633 unsigned int saved_num_template_parameter_lists
8644 /* By virtue of defining a local class, a lambda expression has access to
8645 the private variables of enclosing classes. */
8654 /* The capture list was built up in reverse order; fix that now. */
8667 }
8671 /* This field is only used during parsing of the lambda. */
8674 /* This lambda shouldn't have any proxies left at this point. */
8676 /* And now that we're done, push proxies for an enclosing lambda. */
8681 else
8683 }
8685 /* Parse the beginning of a lambda expression.
8687 lambda-introducer:
8688 [ lambda-capture [opt] ]
8690 LAMBDA_EXPR is the current representation of the lambda expression. */
8692 static void
8694 {
8695 /* Need commas after the first capture. */
8698 /* Eat the leading `['. */
8701 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8709 {
8712 }
8715 {
8717 tree capture_id;
8718 tree capture_init_expr;
8722 enum capture_kind_type
8723 {
8724 BY_COPY,
8725 BY_REFERENCE
8726 };
8730 {
8733 }
8737 else
8740 /* Possibly capture `this'. */
8742 {
8752 explicit_init_p);
8754 }
8756 /* Remember whether we want to capture as a reference or not. */
8758 {
8761 }
8763 /* Get the identifier. */
8768 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8769 delimiters, but I modified this to stop on unnested ']' as well. It
8770 was already changed to stop on unnested '}', so the
8771 "closing_parenthesis" name is no more misleading with my change. */
8772 {
8778 }
8780 /* Find the initializer for this capture. */
8784 {
8786 /* An explicit initializer exists. */
8789 "lambda capture initializers "
8794 }
8795 else
8796 {
8799 /* Turn the identifier into an id-expression. */
8800 capture_init_expr
8805 {
8808 }
8812 {
8815 capture_init_expr);
8818 }
8821 {
8824 capture_init_expr);
8827 }
8829 capture_init_expr
8830 = finish_id_expression
8832 capture_init_expr,
8846 {
8849 }
8850 else
8852 }
8856 {
8861 capture_id);
8865 "capture of %qD redundant with by-reference capture "
8867 }
8870 capture_id,
8871 capture_init_expr,
8873 explicit_init_p);
8874 }
8877 }
8879 /* Parse the (optional) middle of a lambda expression.
8881 lambda-declarator:
8882 < template-parameter-list [opt] >
8883 ( parameter-declaration-clause [opt] )
8884 attribute-specifier [opt]
8885 mutable [opt]
8886 exception-specification [opt]
8887 lambda-return-type-clause [opt]
8889 LAMBDA_EXPR is the current representation of the lambda expression. */
8891 static bool
8893 {
8894 /* 5.1.1.4 of the standard says:
8895 If a lambda-expression does not include a lambda-declarator, it is as if
8896 the lambda-declarator were ().
8897 This means an empty parameter list, no attributes, and no exception
8898 specification. */
8904 /* The template-parameter-list is optional, but must begin with
8905 an opening angle if present. */
8907 {
8910 "lambda templates are only available with "
8919 /* We just processed one more parameter list. */
8921 }
8923 /* The parameter-declaration-clause is optional (unless
8924 template-parameter-list was given), but must begin with an
8925 opening parenthesis if present. */
8927 {
8932 /* Parse parameters. */
8935 /* Default arguments shall not be specified in the
8936 parameter-declaration-clause of a lambda-declarator. */
8946 /* Parse optional `mutable' keyword. */
8948 {
8951 }
8953 /* Parse optional exception specification. */
8956 /* Parse optional trailing return type. */
8958 {
8962 }
8964 /* The function parameters must be in scope all the way until after the
8965 trailing-return-type in case of decltype. */
8967 }
8971 /* Create the function call operator.
8973 Messing with declarators like this is no uglier than building up the
8974 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8975 other code. */
8976 {
8977 cp_decl_specifier_seq return_type_specs;
8979 tree fco;
8986 else
8987 /* Maybe we will deduce the return type later. */
8993 sfk_none);
8998 VIRT_SPEC_UNSPECIFIED,
8999 REF_QUAL_NONE,
9000 exception_spec,
9005 declarator,
9006 attributes);
9008 {
9011 /* Give the object parameter a different name. */
9014 {
9018 }
9021 }
9028 }
9029 }
9031 /* Parse the body of a lambda expression, which is simply
9033 compound-statement
9035 but which requires special handling.
9036 LAMBDA_EXPR is the current representation of the lambda expression. */
9038 static void
9040 {
9045 else
9046 /* Still increment function_depth so that we don't GC in the
9047 middle of an expression. */
9049 /* Clear this in case we're in the middle of a default argument. */
9052 /* Finish the function call operator
9053 - class_specifier
9054 + late_parsing_for_member
9055 + function_definition_after_declarator
9056 + ctor_initializer_opt_and_function_body */
9057 {
9059 tree body;
9061 tree compound_stmt;
9062 tree cap;
9064 /* Let the front end know that we are going to be defining this
9065 function. */
9067 NULL_TREE,
9076 /* Push the proxies for any explicit captures. */
9083 /* 5.1.1.4 of the standard says:
9084 If a lambda-expression does not include a trailing-return-type, it
9085 is as if the trailing-return-type denotes the following type:
9086 * if the compound-statement is of the form
9087 { return attribute-specifier [opt] expression ; }
9088 the type of the returned expression after lvalue-to-rvalue
9089 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9090 (_conv.array_ 4.2), and function-to-pointer conversion
9091 (_conv.func_ 4.3);
9092 * otherwise, void. */
9094 /* In a lambda that has neither a lambda-return-type-clause
9095 nor a deducible form, errors should be reported for return statements
9096 in the body. Since we used void as the placeholder return type, parsing
9097 the body as usual will give such desired behavior. */
9101 {
9105 /* Parse tentatively in case there's more after the initial return
9106 statement. */
9117 {
9121 /* Will get error here if type not deduced yet. */
9125 }
9126 }
9129 {
9134 }
9138 out:
9142 /* Finish the function and generate code for it if necessary. */
9145 /* Only expand if the call op is not a template. */
9148 }
9153 else
9155 }
9157 /* Statements [gram.stmt.stmt] */
9159 /* Parse a statement.
9161 statement:
9162 labeled-statement
9163 expression-statement
9164 compound-statement
9165 selection-statement
9166 iteration-statement
9167 jump-statement
9168 declaration-statement
9169 try-block
9171 C++11:
9173 statement:
9174 labeled-statement
9175 attribute-specifier-seq (opt) expression-statement
9176 attribute-specifier-seq (opt) compound-statement
9177 attribute-specifier-seq (opt) selection-statement
9178 attribute-specifier-seq (opt) iteration-statement
9179 attribute-specifier-seq (opt) jump-statement
9180 declaration-statement
9181 attribute-specifier-seq (opt) try-block
9183 TM Extension:
9185 statement:
9186 atomic-statement
9188 IN_COMPOUND is true when the statement is nested inside a
9189 cp_parser_compound_statement; this matters for certain pragmas.
9191 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9192 is a (possibly labeled) if statement which is not enclosed in braces
9193 and has an else clause. This is used to implement -Wparentheses. */
9195 static void
9198 {
9203 restart:
9206 /* There is no statement yet. */
9212 /* In obj-c++, seeing '[[' might be the either the beginning of
9213 c++11 attributes, or a nested objc-message-expression. So
9214 let's parse the c++11 attributes tentatively. */
9218 {
9221 }
9223 /* Peek at the next token. */
9225 /* Remember the location of the first token in the statement. */
9227 /* If this is a keyword, then that will often determine what kind of
9228 statement we have. */
9230 {
9234 {
9237 /* Looks like a labeled-statement with a case label.
9238 Parse the label, and then use tail recursion to parse
9239 the statement. */
9261 /* Objective-C++ exception-handling constructs. */
9275 /* This must be a namespace alias definition. */
9288 /* It might be a keyword like `int' that can start a
9289 declaration-statement. */
9291 }
9292 }
9294 {
9295 /* If the next token is a `:', then we are looking at a
9296 labeled-statement. */
9299 {
9300 /* Looks like a labeled-statement with an ordinary label.
9301 Parse the label, and then use tail recursion to parse
9302 the statement. */
9306 }
9307 }
9308 /* Anything that starts with a `{' must be a compound-statement. */
9311 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9312 a statement all its own. */
9314 {
9315 /* Only certain OpenMP pragmas are attached to statements, and thus
9316 are considered statements themselves. All others are not. In
9317 the context of a compound, accept the pragma as a "statement" and
9318 return so that we can check for a close brace. Otherwise we
9319 require a real statement and must go back and read one. */
9325 }
9327 {
9330 }
9332 /* Everything else must be a declaration-statement or an
9333 expression-statement. Try for the declaration-statement
9334 first, unless we are looking at a `;', in which case we know that
9335 we have an expression-statement. */
9337 {
9339 {
9341 {
9342 /* Attributes should be parsed as part of the the
9343 declaration, so let's un-parse them. */
9346 }
9349 /* Try to parse the declaration-statement. */
9351 /* If that worked, we're done. */
9354 }
9355 /* Look for an expression-statement instead. */
9357 }
9359 /* Set the line number for the statement. */
9363 /* Note that for now, we don't do anything with c++11 statements
9364 parsed at this level. */
9367 OPT_Wattributes,
9369 }
9371 /* Parse the label for a labeled-statement, i.e.
9373 identifier :
9374 case constant-expression :
9375 default :
9377 GNU Extension:
9378 case constant-expression ... constant-expression : statement
9380 When a label is parsed without errors, the label is added to the
9381 parse tree by the finish_* functions, so this function doesn't
9382 have to return the label. */
9384 static void
9386 {
9391 /* The next token should be an identifier. */
9395 {
9398 }
9402 {
9404 {
9408 /* Consume the `case' token. */
9410 /* Parse the constant-expression. */
9413 NULL);
9417 {
9418 /* Consume the `...' token. */
9420 expr_hi =
9423 NULL);
9424 /* We don't need to emit warnings here, as the common code
9425 will do this for us. */
9426 }
9427 else
9432 else
9435 expr);
9436 }
9440 /* Consume the `default' token. */
9445 else
9450 /* Anything else must be an ordinary label. */
9453 }
9455 /* Require the `:' token. */
9458 /* An ordinary label may optionally be followed by attributes.
9459 However, this is only permitted if the attributes are then
9460 followed by a semicolon. This is because, for backward
9461 compatibility, when parsing
9462 lab: __attribute__ ((unused)) int i;
9463 we want the attribute to attach to "i", not "lab". */
9466 {
9467 tree attrs;
9474 ;
9475 else
9477 }
9483 }
9485 /* Parse an expression-statement.
9487 expression-statement:
9488 expression [opt] ;
9490 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9491 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9492 indicates whether this expression-statement is part of an
9493 expression statement. */
9495 static tree
9497 {
9501 /* If the next token is a ';', then there is no expression
9502 statement. */
9504 {
9508 {
9511 }
9512 }
9514 /* Give a helpful message for "A<T>::type t;" and the like. */
9517 {
9524 {
9525 /* A::A a; */
9530 }
9531 }
9533 /* Consume the final `;'. */
9538 /* This is the final expression statement of a statement
9539 expression. */
9545 }
9547 /* Parse a compound-statement.
9549 compound-statement:
9550 { statement-seq [opt] }
9552 GNU extension:
9554 compound-statement:
9555 { label-declaration-seq [opt] statement-seq [opt] }
9557 label-declaration-seq:
9558 label-declaration
9559 label-declaration-seq label-declaration
9561 Returns a tree representing the statement. */
9563 static tree
9566 {
9567 tree compound_stmt;
9569 /* Consume the `{'. */
9576 /* Begin the compound-statement. */
9578 /* If the next keyword is `__label__' we have a label declaration. */
9581 /* Parse an (optional) statement-seq. */
9583 /* Finish the compound-statement. */
9585 /* Consume the `}'. */
9589 }
9591 /* Parse an (optional) statement-seq.
9593 statement-seq:
9594 statement
9595 statement-seq [opt] statement */
9597 static void
9599 {
9600 /* Scan statements until there aren't any more. */
9602 {
9605 /* If we are looking at a `}', then we have run out of
9606 statements; the same is true if we have reached the end
9607 of file, or have stumbled upon a stray '@end'. */
9614 /* If we are in a compound statement and find 'else' then
9615 something went wrong. */
9617 {
9620 else
9621 {
9624 }
9625 }
9627 /* Parse the statement. */
9629 }
9630 }
9632 /* Parse a selection-statement.
9634 selection-statement:
9635 if ( condition ) statement
9636 if ( condition ) statement else statement
9637 switch ( condition ) statement
9639 Returns the new IF_STMT or SWITCH_STMT.
9641 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9642 is a (possibly labeled) if statement which is not enclosed in
9643 braces and has an else clause. This is used to implement
9644 -Wparentheses. */
9646 static tree
9648 {
9655 /* Peek at the next token. */
9658 /* See what kind of keyword it is. */
9661 {
9664 {
9665 tree statement;
9666 tree condition;
9668 /* Look for the `('. */
9670 {
9673 }
9675 /* Begin the selection-statement. */
9678 else
9681 /* Parse the condition. */
9683 /* Look for the `)'. */
9689 {
9693 /* Add the condition. */
9696 /* Parse the then-clause. */
9700 {
9708 }
9709 else
9715 /* If the next token is `else', parse the else-clause. */
9717 RID_ELSE))
9718 {
9719 /* Consume the `else' keyword. */
9722 /* Parse the else-clause. */
9724 {
9725 location_t loc;
9732 }
9733 else
9738 /* If we are currently parsing a then-clause, then
9739 IF_P will not be NULL. We set it to true to
9740 indicate that this if statement has an else clause.
9741 This may trigger the Wparentheses warning below
9742 when we get back up to the parent if statement. */
9745 }
9746 else
9747 {
9748 /* This if statement does not have an else clause. If
9749 NESTED_IF is true, then the then-clause is an if
9750 statement which does have an else clause. We warn
9751 about the potential ambiguity. */
9754 "suggest explicit braces to avoid ambiguous"
9756 }
9758 /* Now we're all done with the if-statement. */
9760 }
9761 else
9762 {
9766 /* Add the condition. */
9769 /* Parse the body of the switch-statement. */
9778 /* Now we're all done with the switch-statement. */
9780 }
9783 }
9789 }
9790 }
9792 /* Parse a condition.
9794 condition:
9795 expression
9796 type-specifier-seq declarator = initializer-clause
9797 type-specifier-seq declarator braced-init-list
9799 GNU Extension:
9801 condition:
9802 type-specifier-seq declarator asm-specification [opt]
9803 attributes [opt] = assignment-expression
9805 Returns the expression that should be tested. */
9807 static tree
9809 {
9810 cp_decl_specifier_seq type_specifiers;
9814 /* Try the declaration first. */
9816 /* New types are not allowed in the type-specifier-seq for a
9817 condition. */
9819 parser->type_definition_forbidden_message
9821 /* Parse the type-specifier-seq. */
9823 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9826 /* Restore the saved message. */
9828 /* If all is well, we might be looking at a declaration. */
9830 {
9831 tree decl;
9832 tree asm_specification;
9833 tree attributes;
9837 /* Parse the declarator. */
9842 /* Parse the attributes. */
9844 /* Parse the asm-specification. */
9846 /* If the next token is not an `=' or '{', then we might still be
9847 looking at an expression. For example:
9849 if (A(a).x)
9851 looks like a decl-specifier-seq and a declarator -- but then
9852 there is no `=', so this is an expression. */
9857 /* If we did see an `=' or '{', then we are looking at a declaration
9858 for sure. */
9860 {
9861 tree pushed_scope;
9865 /* Create the declaration. */
9871 /* Parse the initializer. */
9873 {
9877 }
9878 else
9879 {
9880 /* Consume the `='. */
9883 }
9887 /* Process the initializer. */
9890 asm_specification,
9891 flags);
9897 }
9898 }
9899 /* If we didn't even get past the declarator successfully, we are
9900 definitely not looking at a declaration. */
9901 else
9904 /* Otherwise, we are looking at an expression. */
9906 }
9908 /* Parses a for-statement or range-for-statement until the closing ')',
9909 not included. */
9911 static tree
9913 {
9917 /* Begin the for-statement. */
9920 /* Parse the initialization. */
9925 else
9927 }
9929 static tree
9931 {
9932 /* Normal for loop */
9935 tree stmt;
9938 /* The for-init-statement has already been parsed in
9939 cp_parser_for_init_statement, so no work is needed here. */
9942 /* If there's a condition, process it. */
9946 {
9950 }
9952 /* Look for the `;'. */
9955 /* If there's an expression, process it. */
9961 }
9963 /* Tries to parse a range-based for-statement:
9965 range-based-for:
9966 decl-specifier-seq declarator : expression
9968 The decl-specifier-seq declarator and the `:' are already parsed by
9969 cp_parser_for_init_statement. If processing_template_decl it returns a
9970 newly created RANGE_FOR_STMT; if not, it is converted to a
9971 regular FOR_STMT. */
9973 static tree
9976 {
9980 {
9983 }
9984 else
9987 /* If in template, STMT is converted to a normal for-statement
9988 at instantiation. If not, it is done just ahead. */
9990 {
9998 /* do_auto_deduction doesn't mess with template init-lists. */
10001 }
10002 else
10003 {
10006 }
10008 }
10010 /* Subroutine of cp_convert_range_for: given the initializer expression,
10011 builds up the range temporary. */
10013 static tree
10015 {
10018 /* Find out the type deduced by the declaration
10019 `auto &&__range = range_expr'. */
10024 /* Create the __range variable. */
10031 }
10033 /* Used by cp_parser_range_for in template context: we aren't going to
10034 do a full conversion yet, but we still need to resolve auto in the
10035 type of the for-range-declaration if present. This is basically
10036 a shortcut version of cp_convert_range_for. */
10038 static void
10040 {
10043 {
10046 iter_type = (cp_parser_perform_range_for_lookup
10049 {
10051 iter_type);
10053 tf_warning_or_error);
10056 }
10057 }
10058 }
10060 /* Converts a range-based for-statement into a normal
10061 for-statement, as per the definition.
10063 for (RANGE_DECL : RANGE_EXPR)
10064 BLOCK
10066 should be equivalent to:
10068 {
10069 auto &&__range = RANGE_EXPR;
10070 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10071 __begin != __end;
10072 ++__begin)
10073 {
10074 RANGE_DECL = *__begin;
10075 BLOCK
10076 }
10077 }
10079 If RANGE_EXPR is an array:
10080 BEGIN_EXPR = __range
10081 END_EXPR = __range + ARRAY_SIZE(__range)
10082 Else if RANGE_EXPR has a member 'begin' or 'end':
10083 BEGIN_EXPR = __range.begin()
10084 END_EXPR = __range.end()
10085 Else:
10086 BEGIN_EXPR = begin(__range)
10087 END_EXPR = end(__range);
10089 If __range has a member 'begin' but not 'end', or vice versa, we must
10090 still use the second alternative (it will surely fail, however).
10091 When calling begin()/end() in the third alternative we must use
10092 argument dependent lookup, but always considering 'std' as an associated
10093 namespace. */
10095 tree
10098 {
10104 /* If an error happened previously do nothing or else a lot of
10105 unhelpful errors would be issued. */
10107 else
10108 {
10109 tree range_temp;
10113 /* Can't bind a reference to an array of runtime bound. */
10115 else
10116 {
10121 LOOKUP_ONLYCONVERTING);
10123 }
10126 }
10128 /* The new for initialization statement. */
10136 LOOKUP_ONLYCONVERTING);
10145 LOOKUP_ONLYCONVERTING);
10149 /* The new for condition. */
10156 /* The new increment expression. */
10159 tf_warning_or_error);
10162 /* The declaration is initialized with *__begin inside the loop body. */
10165 tf_warning_or_error),
10167 LOOKUP_ONLYCONVERTING);
10170 }
10172 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10173 We need to solve both at the same time because the method used
10174 depends on the existence of members begin or end.
10175 Returns the type deduced for the iterator expression. */
10177 static tree
10179 {
10181 {
10184 }
10187 {
10192 }
10194 {
10195 /* If RANGE is an array, we will use pointer arithmetic. */
10198 range,
10202 }
10203 else
10204 {
10205 /* If it is not an array, we must do a bit of magic. */
10215 tf_warning_or_error);
10218 tf_warning_or_error);
10221 {
10222 /* Use the member functions. */
10225 else
10231 else
10234 }
10235 else
10236 {
10237 /* Use global functions with ADL. */
10245 tf_warning_or_error);
10247 tf_warning_or_error);
10250 tf_warning_or_error);
10252 tf_warning_or_error);
10255 }
10257 /* Last common checks. */
10259 {
10260 /* If one of the expressions is an error do no more checks. */
10263 }
10266 /* Can happen, when, eg, in a template context, Koenig lookup
10267 can't resolve begin/end (c++/58503). */
10269 else
10270 {
10272 /* The unqualified type of the __begin and __end temporaries should
10273 be the same, as required by the multiple auto declaration. */
10279 }
10280 }
10281 }
10283 /* Helper function for cp_parser_perform_range_for_lookup.
10284 Builds a tree for RANGE.IDENTIFIER(). */
10286 static tree
10288 {
10301 tf_warning_or_error);
10304 }
10306 /* Parse an iteration-statement.
10308 iteration-statement:
10309 while ( condition ) statement
10310 do statement while ( expression ) ;
10311 for ( for-init-statement condition [opt] ; expression [opt] )
10312 statement
10314 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10316 static tree
10318 {
10321 tree statement;
10324 /* Peek at the next token. */
10329 /* Remember whether or not we are already within an iteration
10330 statement. */
10333 /* See what kind of keyword it is. */
10336 {
10338 {
10339 tree condition;
10341 /* Begin the while-statement. */
10343 /* Look for the `('. */
10345 /* Parse the condition. */
10348 /* Look for the `)'. */
10350 /* Parse the dependent statement. */
10354 /* We're done with the while-statement. */
10356 }
10360 {
10361 tree expression;
10363 /* Begin the do-statement. */
10365 /* Parse the body of the do-statement. */
10370 /* Look for the `while' keyword. */
10372 /* Look for the `('. */
10374 /* Parse the expression. */
10376 /* We're done with the do-statement. */
10378 /* Look for the `)'. */
10380 /* Look for the `;'. */
10382 }
10386 {
10387 /* Look for the `('. */
10392 /* Look for the `)'. */
10395 /* Parse the body of the for-statement. */
10400 /* We're done with the for-statement. */
10402 }
10409 }
10412 }
10414 /* Parse a for-init-statement or the declarator of a range-based-for.
10415 Returns true if a range-based-for declaration is seen.
10417 for-init-statement:
10418 expression-statement
10419 simple-declaration */
10421 static bool
10423 {
10424 /* If the next token is a `;', then we have an empty
10425 expression-statement. Grammatically, this is also a
10426 simple-declaration, but an invalid one, because it does not
10427 declare anything. Therefore, if we did not handle this case
10428 specially, we would issue an error message about an invalid
10429 declaration. */
10431 {
10437 /* We're going to speculatively look for a declaration, falling back
10438 to an expression, if necessary. */
10440 /* Parse the declaration. */
10443 decl);
10446 {
10447 /* It is a range-for, consume the ':' */
10451 {
10453 "range-based %<for%> loops are not allowed "
10456 }
10457 }
10458 else
10459 /* The ';' is not consumed yet because we told
10460 cp_parser_simple_declaration not to. */
10465 /* If the tentative parse failed, then we shall need to look for an
10466 expression-statement. */
10467 }
10468 /* If we are here, it is an expression-statement. */
10471 }
10473 /* Parse a jump-statement.
10475 jump-statement:
10476 break ;
10477 continue ;
10478 return expression [opt] ;
10479 return braced-init-list ;
10480 goto identifier ;
10482 GNU extension:
10484 jump-statement:
10485 goto * expression ;
10487 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10489 static tree
10491 {
10497 /* Peek at the next token. */
10502 /* See what kind of keyword it is. */
10505 {
10509 {
10524 }
10530 {
10543 }
10548 {
10549 tree expr;
10553 {
10556 }
10559 else
10560 /* If the next token is a `;', then there is no
10561 expression. */
10563 /* Build the return-statement. */
10565 /* Look for the final `;'. */
10567 }
10571 /* Create the goto-statement. */
10573 {
10574 /* Issue a warning about this use of a GNU extension. */
10576 /* Consume the '*' token. */
10578 /* Parse the dependent expression. */
10580 }
10581 else
10583 /* Look for the final `;'. */
10590 }
10593 }
10595 /* Parse a declaration-statement.
10597 declaration-statement:
10598 block-declaration */
10600 static void
10602 {
10605 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10608 /* Parse the block-declaration. */
10611 /* Free any declarators allocated. */
10613 }
10615 /* Some dependent statements (like `if (cond) statement'), are
10616 implicitly in their own scope. In other words, if the statement is
10617 a single statement (as opposed to a compound-statement), it is
10618 none-the-less treated as if it were enclosed in braces. Any
10619 declarations appearing in the dependent statement are out of scope
10620 after control passes that point. This function parses a statement,
10621 but ensures that is in its own scope, even if it is not a
10622 compound-statement.
10624 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10625 is a (possibly labeled) if statement which is not enclosed in
10626 braces and has an else clause. This is used to implement
10627 -Wparentheses.
10629 Returns the new statement. */
10631 static tree
10633 {
10634 tree statement;
10639 /* Mark if () ; with a special NOP_EXPR. */
10641 {
10645 }
10646 /* if a compound is opened, we simply parse the statement directly. */
10649 /* If the token is not a `{', then we must take special action. */
10650 else
10651 {
10652 /* Create a compound-statement. */
10654 /* Parse the dependent-statement. */
10656 /* Finish the dummy compound-statement. */
10658 }
10660 /* Return the statement. */
10662 }
10664 /* For some dependent statements (like `while (cond) statement'), we
10665 have already created a scope. Therefore, even if the dependent
10666 statement is a compound-statement, we do not want to create another
10667 scope. */
10669 static void
10671 {
10672 /* If the token is a `{', then we must take special action. */
10675 else
10676 {
10677 /* Avoid calling cp_parser_compound_statement, so that we
10678 don't create a new scope. Do everything else by hand. */
10680 /* If the next keyword is `__label__' we have a label declaration. */
10683 /* Parse an (optional) statement-seq. */
10686 }
10687 }
10689 /* Declarations [gram.dcl.dcl] */
10691 /* Parse an optional declaration-sequence.
10693 declaration-seq:
10694 declaration
10695 declaration-seq declaration */
10697 static void
10699 {
10701 {
10712 {
10713 /* A declaration consisting of a single semicolon is
10714 invalid. Allow it unless we're being pedantic. */
10719 }
10721 /* If we're entering or exiting a region that's implicitly
10722 extern "C", modify the lang context appropriately. */
10724 {
10727 }
10729 {
10732 }
10735 {
10736 /* A top-level declaration can consist solely of a #pragma.
10737 A nested declaration cannot, so this is done here and not
10738 in cp_parser_declaration. (A #pragma at block scope is
10739 handled in cp_parser_statement.) */
10742 }
10744 /* Parse the declaration itself. */
10746 }
10747 }
10749 /* Parse a declaration.
10751 declaration:
10752 block-declaration
10753 function-definition
10754 template-declaration
10755 explicit-instantiation
10756 explicit-specialization
10757 linkage-specification
10758 namespace-definition
10760 GNU extension:
10762 declaration:
10763 __extension__ declaration */
10765 static void
10767 {
10768 cp_token token1;
10769 cp_token token2;
10774 /* Check for the `__extension__' keyword. */
10776 {
10777 /* Parse the qualified declaration. */
10779 /* Restore the PEDANTIC flag. */
10783 }
10785 /* Try to figure out what kind of declaration is present. */
10790 else
10791 {
10794 }
10796 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10799 /* If the next token is `extern' and the following token is a string
10800 literal, then we have a linkage specification. */
10804 /* If the next token is `template', then we have either a template
10805 declaration, an explicit instantiation, or an explicit
10806 specialization. */
10808 {
10809 /* `template <>' indicates a template specialization. */
10813 /* `template <' indicates a template declaration. */
10816 /* Anything else must be an explicit instantiation. */
10817 else
10819 }
10820 /* If the next token is `export', then we have a template
10821 declaration. */
10824 /* If the next token is `extern', 'static' or 'inline' and the one
10825 after that is `template', we have a GNU extended explicit
10826 instantiation directive. */
10833 /* If the next token is `namespace', check for a named or unnamed
10834 namespace definition. */
10840 /* An unnamed namespace definition. */
10844 /* An inline (associated) namespace definition. */
10848 /* Objective-C++ declaration/definition. */
10855 /* We must have either a block declaration or a function
10856 definition. */
10857 else
10858 /* Try to parse a block-declaration, or a function-definition. */
10861 /* Free any declarators allocated. */
10863 }
10865 /* Parse a block-declaration.
10867 block-declaration:
10868 simple-declaration
10869 asm-definition
10870 namespace-alias-definition
10871 using-declaration
10872 using-directive
10874 GNU Extension:
10876 block-declaration:
10877 __extension__ block-declaration
10879 C++0x Extension:
10881 block-declaration:
10882 static_assert-declaration
10884 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10885 part of a declaration-statement. */
10887 static void
10890 {
10894 /* Check for the `__extension__' keyword. */
10896 {
10897 /* Parse the qualified declaration. */
10899 /* Restore the PEDANTIC flag. */
10903 }
10905 /* Peek at the next token to figure out which kind of declaration is
10906 present. */
10909 /* If the next keyword is `asm', we have an asm-definition. */
10911 {
10915 }
10916 /* If the next keyword is `namespace', we have a
10917 namespace-alias-definition. */
10920 /* If the next keyword is `using', we have a
10921 using-declaration, a using-directive, or an alias-declaration. */
10923 {
10928 /* If the token after `using' is `namespace', then we have a
10929 using-directive. */
10933 /* If the second token after 'using' is '=', then we have an
10934 alias-declaration. */
10940 /* Otherwise, it's a using-declaration. */
10941 else
10944 }
10945 /* If the next keyword is `__label__' we have a misplaced label
10946 declaration. */
10948 {
10952 /* If the next token is now a `;', consume it. */
10955 }
10956 /* If the next token is `static_assert' we have a static assertion. */
10959 /* Anything else must be a simple-declaration. */
10960 else
10963 }
10965 /* Parse a simple-declaration.
10967 simple-declaration:
10968 decl-specifier-seq [opt] init-declarator-list [opt] ;
10970 init-declarator-list:
10971 init-declarator
10972 init-declarator-list , init-declarator
10974 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10975 function-definition as a simple-declaration.
10977 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10978 parsed declaration if it is an uninitialized single declarator not followed
10979 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10980 if present, will not be consumed. */
10982 static void
10986 {
10987 cp_decl_specifier_seq decl_specifiers;
10994 /* Defer access checks until we know what is being declared; the
10995 checks for names appearing in the decl-specifier-seq should be
10996 done as if we were in the scope of the thing being declared. */
10999 /* Parse the decl-specifier-seq. We have to keep track of whether
11000 or not the decl-specifier-seq declares a named class or
11001 enumeration type, since that is the only case in which the
11002 init-declarator-list is allowed to be empty.
11004 [dcl.dcl]
11006 In a simple-declaration, the optional init-declarator-list can be
11007 omitted only when declaring a class or enumeration, that is when
11008 the decl-specifier-seq contains either a class-specifier, an
11009 elaborated-type-specifier, or an enum-specifier. */
11011 CP_PARSER_FLAGS_OPTIONAL,
11014 /* We no longer need to defer access checks. */
11017 /* In a block scope, a valid declaration must always have a
11018 decl-specifier-seq. By not trying to parse declarators, we can
11019 resolve the declaration/expression ambiguity more quickly. */
11022 {
11025 }
11027 /* If the next two tokens are both identifiers, the code is
11028 erroneous. The usual cause of this situation is code like:
11030 T t;
11032 where "T" should name a type -- but does not. */
11035 {
11036 /* If parsing tentatively, we should commit; we really are
11037 looking at a declaration. */
11039 /* Give up. */
11041 }
11043 /* If we have seen at least one decl-specifier, and the next token
11044 is not a parenthesis, then we must be looking at a declaration.
11045 (After "int (" we might be looking at a functional cast.) */
11052 /* Keep going until we hit the `;' at the end of the simple
11053 declaration. */
11056 CPP_SEMICOLON))
11057 {
11060 tree decl;
11063 {
11064 /* If we are processing next declarator, coma is expected */
11070 }
11071 else
11074 /* Parse the init-declarator. */
11077 function_definition_allowed_p,
11079 declares_class_or_enum,
11081 maybe_range_for_decl);
11082 /* If an error occurred while parsing tentatively, exit quickly.
11083 (That usually happens when in the body of a function; each
11084 statement is treated as a declaration-statement until proven
11085 otherwise.) */
11088 /* Handle function definitions specially. */
11090 {
11091 /* If the next token is a `,', then we are probably
11092 processing something like:
11094 void f() {}, *p;
11096 which is erroneous. */
11098 {
11101 "mixing"
11103 }
11104 /* Otherwise, we're done with the list of declarators. */
11105 else
11106 {
11109 }
11110 }
11113 /* The next token should be either a `,' or a `;'. */
11115 /* If it's a `,', there are more declarators to come. */
11118 /* If it's a `;', we are done. */
11121 /* Anything else is an error. */
11122 else
11123 {
11124 /* If we have already issued an error message we don't need
11125 to issue another one. */
11129 /* Skip tokens until we reach the end of the statement. */
11131 /* If the next token is now a `;', consume it. */
11135 }
11136 /* After the first time around, a function-definition is not
11137 allowed -- even if it was OK at first. For example:
11139 int i, f() {}
11141 is not valid. */
11143 }
11145 /* Issue an error message if no declarators are present, and the
11146 decl-specifier-seq does not itself declare a class or
11147 enumeration: [dcl.dcl]/3. */
11149 {
11151 {
11155 /* Ensure an error is issued anyway when finish_decltype_type,
11156 called via cp_parser_decl_specifier_seq, returns a class or
11157 an enumeration (c++/51786). */
11160 }
11161 /* Perform any deferred access checks. */
11163 }
11165 /* Consume the `;'. */
11169 done:
11171 }
11173 /* Parse a decl-specifier-seq.
11175 decl-specifier-seq:
11176 decl-specifier-seq [opt] decl-specifier
11177 decl-specifier attribute-specifier-seq [opt] (C++11)
11179 decl-specifier:
11180 storage-class-specifier
11181 type-specifier
11182 function-specifier
11183 friend
11184 typedef
11186 GNU Extension:
11188 decl-specifier:
11189 attributes
11191 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11193 The parser flags FLAGS is used to control type-specifier parsing.
11195 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11196 flags:
11198 1: one of the decl-specifiers is an elaborated-type-specifier
11199 (i.e., a type declaration)
11200 2: one of the decl-specifiers is an enum-specifier or a
11201 class-specifier (i.e., a type definition)
11203 */
11205 static void
11207 cp_parser_flags flags,
11210 {
11214 cp_decl_spec ds;
11216 /* Clear DECL_SPECS. */
11219 /* Assume no class or enumeration type is declared. */
11222 /* Keep reading specifiers until there are no more to read. */
11224 {
11229 /* Peek at the next token. */
11232 /* Save the first token of the decl spec list for error
11233 reporting. */
11236 /* Handle attributes. */
11238 {
11239 /* Parse the attributes. */
11242 /* In a sequence of declaration specifiers, c++11 attributes
11243 appertain to the type that precede them. In that case
11244 [dcl.spec]/1 says:
11246 The attribute-specifier-seq affects the type only for
11247 the declaration it appears in, not other declarations
11248 involving the same type.
11250 But for now let's force the user to position the
11251 attribute either at the beginning of the declaration or
11252 after the declarator-id, which would clearly mean that it
11253 applies to the declarator. */
11255 {
11257 /* The c++11 attribute is at the beginning of the
11258 declaration. It appertains to the entity being
11260 else
11261 {
11263 {
11264 /* This is an attribute following a
11265 class-specifier. */
11270 }
11271 else
11272 {
11273 decl_specs->std_attributes
11275 attrs);
11278 }
11280 }
11281 }
11283 decl_specs->attributes
11285 attrs);
11289 }
11290 /* Assume we will find a decl-specifier keyword. */
11292 /* If the next token is an appropriate keyword, we can simply
11293 add it to the list. */
11295 {
11296 /* decl-specifier:
11297 friend
11298 constexpr */
11301 {
11304 }
11305 else
11306 {
11308 /* Consume the token. */
11310 }
11318 /* function-specifier:
11319 inline
11320 virtual
11321 explicit */
11328 /* decl-specifier:
11329 typedef */
11332 /* Consume the token. */
11334 /* A constructor declarator cannot appear in a typedef. */
11336 /* The "typedef" keyword can only occur in a declaration; we
11337 may as well commit at this point. */
11344 /* storage-class-specifier:
11345 auto
11346 register
11347 static
11348 extern
11349 mutable
11351 GNU Extension:
11352 thread */
11355 {
11356 /* Consume the token. */
11359 /* Complain about `auto' as a storage specifier, if
11360 we're complaining about C++0x compatibility. */
11364 /* Set the storage class anyway. */
11366 token);
11367 }
11368 else
11369 /* C++0x auto type-specifier. */
11377 /* Consume the token. */
11380 token);
11383 /* Consume the token. */
11389 /* We did not yet find a decl-specifier yet. */
11392 }
11402 /* Constructors are a special case. The `S' in `S()' is not a
11403 decl-specifier; it is the beginning of the declarator. */
11404 constructor_p
11405 = (!found_decl_spec
11406 && constructor_possible_p
11407 && (cp_parser_constructor_declarator_p
11410 /* If we don't have a DECL_SPEC yet, then we must be looking at
11411 a type-specifier. */
11413 {
11416 tree type_spec;
11418 type_spec
11420 decl_specs,
11426 /* If this type-specifier referenced a user-defined type
11427 (a typedef, class-name, etc.), then we can't allow any
11428 more such type-specifiers henceforth.
11430 [dcl.spec]
11432 The longest sequence of decl-specifiers that could
11433 possibly be a type name is taken as the
11434 decl-specifier-seq of a declaration. The sequence shall
11435 be self-consistent as described below.
11437 [dcl.type]
11439 As a general rule, at most one type-specifier is allowed
11440 in the complete decl-specifier-seq of a declaration. The
11441 only exceptions are the following:
11443 -- const or volatile can be combined with any other
11444 type-specifier.
11446 -- signed or unsigned can be combined with char, long,
11447 short, or int.
11449 -- ..
11451 Example:
11453 typedef char* Pc;
11454 void g (const int Pc);
11456 Here, Pc is *not* part of the decl-specifier seq; it's
11457 the declarator. Therefore, once we see a type-specifier
11458 (other than a cv-qualifier), we forbid any additional
11459 user-defined types. We *do* still allow things like `int
11460 int' to be considered a decl-specifier-seq, and issue the
11461 error message later. */
11464 /* A constructor declarator cannot follow a type-specifier. */
11466 {
11471 }
11472 }
11474 /* If we still do not have a DECL_SPEC, then there are no more
11475 decl-specifiers. */
11480 /* After we see one decl-specifier, further decl-specifiers are
11481 always optional. */
11483 }
11485 /* Don't allow a friend specifier with a class definition. */
11490 }
11492 /* Parse an (optional) storage-class-specifier.
11494 storage-class-specifier:
11495 auto
11496 register
11497 static
11498 extern
11499 mutable
11501 GNU Extension:
11503 storage-class-specifier:
11504 thread
11506 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11508 static tree
11510 {
11512 {
11516 /* Fall through for C++98. */
11523 /* Consume the token. */
11528 }
11529 }
11531 /* Parse an (optional) function-specifier.
11533 function-specifier:
11534 inline
11535 virtual
11536 explicit
11538 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11539 Updates DECL_SPECS, if it is non-NULL. */
11541 static tree
11544 {
11547 {
11553 /* 14.5.2.3 [temp.mem]
11555 A member function template shall not be virtual. */
11558 else
11568 }
11570 /* Consume the token. */
11572 }
11574 /* Parse a linkage-specification.
11576 linkage-specification:
11577 extern string-literal { declaration-seq [opt] }
11578 extern string-literal declaration */
11580 static void
11582 {
11583 tree linkage;
11585 /* Look for the `extern' keyword. */
11588 /* Look for the string-literal. */
11591 /* Transform the literal into an identifier. If the literal is a
11592 wide-character string, or contains embedded NULs, then we can't
11593 handle it as the user wants. */
11596 {
11598 /* Assume C++ linkage. */
11600 }
11601 else
11604 /* We're now using the new linkage. */
11607 /* If the next token is a `{', then we're using the first
11608 production. */
11610 {
11613 /* Consume the `{' token. */
11615 /* Parse the declarations. */
11617 /* Look for the closing `}'. */
11619 }
11620 /* Otherwise, there's just one declaration. */
11621 else
11622 {
11625 saved_in_unbraced_linkage_specification_p
11629 parser->in_unbraced_linkage_specification_p
11631 }
11633 /* We're done with the linkage-specification. */
11635 }
11637 /* Parse a static_assert-declaration.
11639 static_assert-declaration:
11640 static_assert ( constant-expression , string-literal ) ;
11642 If MEMBER_P, this static_assert is a class member. */
11644 static void
11646 {
11647 tree condition;
11648 tree message;
11650 location_t saved_loc;
11653 /* Peek at the `static_assert' token so we can keep track of exactly
11654 where the static assertion started. */
11658 /* Look for the `static_assert' keyword. */
11660 RT_STATIC_ASSERT))
11663 /* We know we are in a static assertion; commit to any tentative
11664 parse. */
11668 /* Parse the `(' starting the static assertion condition. */
11671 /* Parse the constant-expression. Allow a non-constant expression
11672 here in order to give better diagnostics in finish_static_assert. */
11673 condition =
11678 /* Parse the separating `,'. */
11681 /* Parse the string-literal message. */
11686 /* A `)' completes the static assertion. */
11693 /* A semicolon terminates the declaration. */
11696 /* Complete the static assertion, which may mean either processing
11697 the static assert now or saving it for template instantiation. */
11699 }
11701 /* Parse the expression in decltype ( expression ). */
11703 static tree
11706 {
11708 tree expr;
11710 /* First, try parsing an id-expression. */
11721 {
11724 cp_id_kind idk;
11728 /* Lookup the name we got back from the id-expression. */
11739 {
11740 /* Complete lookup of the id-expression. */
11741 expr = (finish_id_expression
11754 /* We found an id-expression, but it was something that we
11755 should not have found. This is an error, not something
11756 we can recover from, so note that we found an
11757 id-expression and we'll recover as gracefully as
11758 possible. */
11760 }
11765 /* We have an id-expression. */
11767 }
11770 {
11771 /* Abort the id-expression parse. */
11774 /* Parsing tentatively, again. */
11777 /* Parse a class member access. */
11785 /* We have an id-expression. */
11787 }
11790 /* We have parsed the complete id-expression or member access. */
11792 else
11793 {
11794 /* Abort our attempt to parse an id-expression or member access
11795 expression. */
11798 /* Parse a full expression. */
11801 }
11804 }
11806 /* Parse a `decltype' type. Returns the type.
11808 simple-type-specifier:
11809 decltype ( expression )
11810 C++14 proposal:
11811 decltype ( auto ) */
11813 static tree
11815 {
11816 tree expr;
11825 {
11826 /* Already parsed. */
11829 }
11831 /* Look for the `decltype' token. */
11835 /* Parse the opening `('. */
11839 /* decltype (auto) */
11842 {
11849 }
11851 /* Types cannot be defined in a `decltype' expression. Save away the
11852 old message. */
11855 /* And create the new one. */
11856 parser->type_definition_forbidden_message
11859 /* The restrictions on constant-expressions do not apply inside
11860 decltype expressions. */
11861 saved_integral_constant_expression_p
11863 saved_non_integral_constant_expression_p
11867 /* Within a parenthesized expression, a `>' token is always
11868 the greater-than operator. */
11869 saved_greater_than_is_operator_p
11873 /* Do not actually evaluate the expression. */
11876 /* Do not warn about problems with the expression. */
11881 /* Go back to evaluating expressions. */
11885 /* The `>' token might be the end of a template-id or
11886 template-parameter-list now. */
11887 parser->greater_than_is_operator_p
11890 /* Restore the old message and the integral constant expression
11891 flags. */
11893 parser->integral_constant_expression_p
11895 parser->non_integral_constant_expression_p
11898 /* Parse to the closing `)'. */
11900 {
11904 }
11907 tf_warning_or_error);
11909 rewrite:
11910 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11911 it again. */
11918 }
11920 /* Special member functions [gram.special] */
11922 /* Parse a conversion-function-id.
11924 conversion-function-id:
11925 operator conversion-type-id
11927 Returns an IDENTIFIER_NODE representing the operator. */
11929 static tree
11931 {
11932 tree type;
11933 tree saved_scope;
11934 tree saved_qualifying_scope;
11935 tree saved_object_scope;
11938 /* Look for the `operator' token. */
11941 /* When we parse the conversion-type-id, the current scope will be
11942 reset. However, we need that information in able to look up the
11943 conversion function later, so we save it here. */
11947 /* We must enter the scope of the class so that the names of
11948 entities declared within the class are available in the
11949 conversion-type-id. For example, consider:
11951 struct S {
11952 typedef int I;
11953 operator I();
11954 };
11956 S::operator I() { ... }
11958 In order to see that `I' is a type-name in the definition, we
11959 must be in the scope of `S'. */
11962 /* Parse the conversion-type-id. */
11964 /* Leave the scope of the class, if any. */
11967 /* Restore the saved scope. */
11971 /* If the TYPE is invalid, indicate failure. */
11975 }
11977 /* Parse a conversion-type-id:
11979 conversion-type-id:
11980 type-specifier-seq conversion-declarator [opt]
11982 Returns the TYPE specified. */
11984 static tree
11986 {
11987 tree attributes;
11988 cp_decl_specifier_seq type_specifiers;
11990 tree type_specified;
11993 /* Parse the attributes. */
11997 parser->type_definition_forbidden_message
12000 /* Parse the type-specifiers. */
12007 /* If that didn't work, stop. */
12010 /* Parse the conversion-declarator. */
12018 /* Don't give this error when parsing tentatively. This happens to
12019 work because we always parse this definitively once. */
12022 {
12024 {
12027 }
12031 }
12034 }
12036 /* Parse an (optional) conversion-declarator.
12038 conversion-declarator:
12039 ptr-operator conversion-declarator [opt]
12041 */
12045 {
12048 cp_cv_quals cv_quals;
12050 /* We don't know if there's a ptr-operator next, or not. */
12052 /* Try the ptr-operator. */
12055 /* If it worked, look for more conversion-declarators. */
12057 {
12060 /* Parse another optional declarator. */
12063 declarator = cp_parser_make_indirect_declarator
12067 }
12070 }
12072 /* Parse an (optional) ctor-initializer.
12074 ctor-initializer:
12075 : mem-initializer-list
12077 Returns TRUE iff the ctor-initializer was actually present. */
12079 static bool
12081 {
12082 /* If the next token is not a `:', then there is no
12083 ctor-initializer. */
12085 {
12086 /* Do default initialization of any bases and members. */
12091 }
12093 /* Consume the `:' token. */
12095 /* And the mem-initializer-list. */
12099 }
12101 /* Parse a mem-initializer-list.
12103 mem-initializer-list:
12104 mem-initializer ... [opt]
12105 mem-initializer ... [opt] , mem-initializer-list */
12107 static void
12109 {
12114 /* Let the semantic analysis code know that we are starting the
12115 mem-initializer-list. */
12120 /* Loop through the list. */
12122 {
12123 tree mem_initializer;
12126 /* Parse the mem-initializer. */
12128 /* If the next token is a `...', we're expanding member initializers. */
12130 {
12131 /* Consume the `...'. */
12134 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12135 can be expanded but members cannot. */
12138 {
12143 }
12145 /* Construct the pack expansion type. */
12148 }
12151 {
12155 }
12156 /* Look for a target constructor. */
12160 {
12163 {
12167 }
12169 }
12170 /* Add it to the list, unless it was erroneous. */
12172 {
12175 }
12176 /* If the next token is not a `,', we're done. */
12179 /* Consume the `,' token. */
12181 }
12183 /* Perform semantic analysis. */
12186 }
12188 /* Parse a mem-initializer.
12190 mem-initializer:
12191 mem-initializer-id ( expression-list [opt] )
12192 mem-initializer-id braced-init-list
12194 GNU extension:
12196 mem-initializer:
12197 ( expression-list [opt] )
12199 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12200 class) or FIELD_DECL (for a non-static data member) to initialize;
12201 the TREE_VALUE is the expression-list. An empty initialization
12202 list is represented by void_list_node. */
12204 static tree
12206 {
12207 tree mem_initializer_id;
12208 tree expression_list;
12209 tree member;
12212 /* Find out what is being initialized. */
12214 {
12218 }
12219 else
12220 {
12224 }
12230 {
12236 }
12237 else
12238 {
12248 }
12258 }
12260 /* Parse a mem-initializer-id.
12262 mem-initializer-id:
12263 :: [opt] nested-name-specifier [opt] class-name
12264 identifier
12266 Returns a TYPE indicating the class to be initializer for the first
12267 production. Returns an IDENTIFIER_NODE indicating the data member
12268 to be initialized for the second production. */
12270 static tree
12272 {
12276 tree id;
12280 /* `typename' is not allowed in this context ([temp.res]). */
12282 {
12284 "keyword %<typename%> not allowed in this context (a qualified "
12287 }
12288 /* Look for the optional `::' operator. */
12289 global_scope_p
12293 /* Look for the optional nested-name-specifier. The simplest way to
12294 implement:
12296 [temp.res]
12298 The keyword `typename' is not permitted in a base-specifier or
12299 mem-initializer; in these contexts a qualified name that
12300 depends on a template-parameter is implicitly assumed to be a
12301 type name.
12303 is to assume that we have seen the `typename' keyword at this
12304 point. */
12305 nested_name_specifier_p
12314 /* If there is a `::' operator or a nested-name-specifier, then we
12315 are definitely looking for a class-name. */
12320 typename_type,
12324 /* Otherwise, we could also be looking for an ordinary identifier. */
12326 /* Try a class-name. */
12330 none_type,
12334 /* If we found one, we're done. */
12337 /* Otherwise, look for an ordinary identifier. */
12339 }
12341 /* Overloading [gram.over] */
12343 /* Parse an operator-function-id.
12345 operator-function-id:
12346 operator operator
12348 Returns an IDENTIFIER_NODE for the operator which is a
12349 human-readable spelling of the identifier, e.g., `operator +'. */
12351 static tree
12353 {
12354 /* Look for the `operator' keyword. */
12357 /* And then the name of the operator itself. */
12359 }
12361 /* Return an identifier node for a user-defined literal operator.
12362 The suffix identifier is chained to the operator name identifier. */
12364 static tree
12366 {
12367 tree identifier;
12374 }
12376 /* Parse an operator.
12378 operator:
12379 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12380 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12381 || ++ -- , ->* -> () []
12383 GNU Extensions:
12385 operator:
12386 <? >? <?= >?=
12388 Returns an IDENTIFIER_NODE for the operator which is a
12389 human-readable spelling of the identifier, e.g., `operator +'. */
12391 static tree
12393 {
12398 /* Peek at the next token. */
12400 /* Figure out which operator we have. */
12402 {
12404 {
12407 /* The keyword should be either `new' or `delete'. */
12412 else
12415 /* Consume the `new' or `delete' token. */
12418 /* Peek at the next token. */
12420 /* If it's a `[' token then this is the array variant of the
12421 operator. */
12423 {
12424 /* Consume the `[' token. */
12426 /* Look for the `]' token. */
12430 }
12431 /* Otherwise, we have the non-array variant. */
12432 else
12436 }
12583 /* Consume the `('. */
12585 /* Look for the matching `)'. */
12590 /* Consume the `['. */
12592 /* Look for the matching `]'. */
12601 /* Fall through. */
12607 {
12610 }
12612 {
12615 }
12616 /* Consume the string. */
12618 /* Look for the suffix identifier. */
12621 {
12624 {
12627 }
12628 }
12630 {
12634 }
12635 else
12636 {
12639 }
12646 /* Fall through. */
12652 {
12655 }
12656 {
12659 {
12662 }
12664 /* Consume the user-defined string literal. */
12667 {
12670 }
12671 else
12673 }
12676 /* Anything else is an error. */
12678 }
12680 /* If we have selected an identifier, we need to consume the
12681 operator token. */
12684 /* Otherwise, no valid operator name was present. */
12685 else
12686 {
12689 }
12692 }
12694 /* Parse a template-declaration.
12696 template-declaration:
12697 export [opt] template < template-parameter-list > declaration
12699 If MEMBER_P is TRUE, this template-declaration occurs within a
12700 class-specifier.
12702 The grammar rule given by the standard isn't correct. What
12703 is really meant is:
12705 template-declaration:
12706 export [opt] template-parameter-list-seq
12707 decl-specifier-seq [opt] init-declarator [opt] ;
12708 export [opt] template-parameter-list-seq
12709 function-definition
12711 template-parameter-list-seq:
12712 template-parameter-list-seq [opt]
12713 template < template-parameter-list > */
12715 static void
12717 {
12718 /* Check for `export'. */
12720 {
12721 /* Consume the `export' token. */
12723 /* Warn that we do not support `export'. */
12725 }
12728 }
12730 /* Parse a template-parameter-list.
12732 template-parameter-list:
12733 template-parameter
12734 template-parameter-list , template-parameter
12736 Returns a TREE_LIST. Each node represents a template parameter.
12737 The nodes are connected via their TREE_CHAINs. */
12739 static tree
12741 {
12746 /* The loop below parses the template parms. We first need to know
12747 the total number of template parms to be able to compute proper
12748 canonical types of each dependent type. So after the loop, when
12749 we know the total number of template parms,
12750 end_template_parm_list computes the proper canonical types and
12751 fixes up the dependent types accordingly. */
12753 {
12754 tree parameter;
12757 location_t parm_loc;
12759 /* Parse the template-parameter. */
12764 /* Add it to the list. */
12767 parm_loc,
12768 parameter,
12769 is_non_type,
12770 is_parameter_pack);
12771 else
12772 {
12775 }
12777 /* If the next token is not a `,', we're done. */
12780 /* Otherwise, consume the `,' token. */
12782 }
12785 }
12787 /* Parse a template-parameter.
12789 template-parameter:
12790 type-parameter
12791 parameter-declaration
12793 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12794 the parameter. The TREE_PURPOSE is the default value, if any.
12795 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12796 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12797 set to true iff this parameter is a parameter pack. */
12799 static tree
12802 {
12806 tree parm;
12808 /* Assume it is a type parameter or a template parameter. */
12810 /* Assume it not a parameter pack. */
12812 /* Peek at the next token. */
12814 /* If it is `class' or `template', we have a type-parameter. */
12817 /* If it is `class' or `typename' we do not know yet whether it is a
12818 type parameter or a non-type parameter. Consider:
12820 template <typename T, typename T::X X> ...
12822 or:
12824 template <class C, class D*> ...
12826 Here, the first parameter is a type parameter, and the second is
12827 a non-type parameter. We can tell by looking at the token after
12828 the identifier -- if it is a `,', `=', or `>' then we have a type
12829 parameter. */
12831 {
12832 /* Peek at the token after `class' or `typename'. */
12834 /* If it's an ellipsis, we have a template type parameter
12835 pack. */
12838 /* If it's an identifier, skip it. */
12841 /* Now, see if the token looks like the end of a template
12842 parameter. */
12847 }
12849 /* Otherwise, it is a non-type parameter.
12851 [temp.param]
12853 When parsing a default template-argument for a non-type
12854 template-parameter, the first non-nested `>' is taken as the end
12855 of the template parameter-list rather than a greater-than
12856 operator. */
12858 parameter_declarator
12862 /* If the parameter declaration is marked as a parameter pack, set
12863 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12864 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12865 grokdeclarator. */
12869 {
12872 }
12876 {
12877 /* Can happen in some cases of erroneous input (c++/34892). */
12879 /* Consume the `...' for better error recovery. */
12881 }
12882 /* If the next token is an ellipsis, and we don't already have it
12883 marked as a parameter pack, then we have a parameter pack (that
12884 has no declarator). */
12887 && (declarator_can_be_parameter_pack
12889 {
12890 /* Consume the `...'. */
12895 }
12896 /* We might end up with a pack expansion as the type of the non-type
12897 template parameter, in which case this is a non-type template
12898 parameter pack. */
12902 {
12906 }
12909 {
12910 /* Parameter packs cannot have default arguments. However, a
12911 user may try to do so, so we'll parse them and give an
12912 appropriate diagnostic here. */
12916 /* Find the name of the parameter pack. */
12925 else
12929 /* Parse the default argument, but throw away the result. */
12931 }
12941 }
12943 /* Parse a type-parameter.
12945 type-parameter:
12946 class identifier [opt]
12947 class identifier [opt] = type-id
12948 typename identifier [opt]
12949 typename identifier [opt] = type-id
12950 template < template-parameter-list > class identifier [opt]
12951 template < template-parameter-list > class identifier [opt]
12952 = id-expression
12954 GNU Extension (variadic templates):
12956 type-parameter:
12957 class ... identifier [opt]
12958 typename ... identifier [opt]
12960 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12961 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12962 the declaration of the parameter.
12964 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12966 static tree
12968 {
12970 tree parameter;
12972 /* Look for a keyword to tell us what kind of parameter this is. */
12978 {
12981 {
12982 tree identifier;
12983 tree default_argument;
12985 /* If the next token is an ellipsis, we have a template
12986 argument pack. */
12988 {
12989 /* Consume the `...' token. */
12994 }
12996 /* If the next token is an identifier, then it names the
12997 parameter. */
13000 else
13003 /* Create the parameter. */
13006 /* If the next token is an `=', we have a default argument. */
13008 {
13009 /* Consume the `=' token. */
13011 /* Parse the default-argument. */
13015 /* Template parameter packs cannot have default
13016 arguments. */
13018 {
13021 "template parameter pack %qD cannot have a "
13023 else
13025 "template parameter packs cannot have "
13028 }
13030 }
13031 else
13034 /* Create the combined representation of the parameter and the
13035 default argument. */
13037 }
13041 {
13042 tree identifier;
13043 tree default_argument;
13045 /* Look for the `<'. */
13047 /* Parse the template-parameter-list. */
13049 /* Look for the `>'. */
13051 /* Look for the `class' keyword. */
13053 /* If the next token is an ellipsis, we have a template
13054 argument pack. */
13056 {
13057 /* Consume the `...' token. */
13062 }
13063 /* If the next token is an `=', then there is a
13064 default-argument. If the next token is a `>', we are at
13065 the end of the parameter-list. If the next token is a `,',
13066 then we are at the end of this parameter. */
13070 {
13072 /* Treat invalid names as if the parameter were nameless. */
13075 }
13076 else
13079 /* Create the template parameter. */
13081 identifier);
13083 /* If the next token is an `=', then there is a
13084 default-argument. */
13086 {
13089 /* Consume the `='. */
13091 /* Parse the id-expression. */
13093 /* save token before parsing the id-expression, for error
13094 reporting */
13096 default_argument
13104 /* If the id-expression was a template-id that refers to
13105 a template-class, we already have the declaration here,
13106 so no further lookup is needed. */
13107 ;
13108 else
13109 /* Look up the name. */
13110 default_argument
13112 none_type,
13118 /* See if the default argument is valid. */
13119 default_argument
13122 /* Template parameter packs cannot have default
13123 arguments. */
13125 {
13128 "template parameter pack %qD cannot "
13130 identifier);
13131 else
13135 }
13137 }
13138 else
13141 /* Create the combined representation of the parameter and the
13142 default argument. */
13144 }
13150 }
13153 }
13155 /* Parse a template-id.
13157 template-id:
13158 template-name < template-argument-list [opt] >
13160 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13161 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13162 returned. Otherwise, if the template-name names a function, or set
13163 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13164 names a class, returns a TYPE_DECL for the specialization.
13166 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13167 uninstantiated templates. */
13169 static tree
13175 {
13177 tree templ;
13178 tree arguments;
13179 tree template_id;
13186 /* If the next token corresponds to a template-id, there is no need
13187 to reparse it. */
13190 {
13193 /* Get the stored value. */
13195 /* Perform any access checks that were deferred. */
13198 {
13203 tf_warning_or_error);
13204 }
13205 /* Return the stored value. */
13207 }
13209 /* Avoid performing name lookup if there is no possibility of
13210 finding a template-id. */
13213 && !cp_parser_nth_token_starts_template_argument_list_p
13215 {
13218 }
13220 /* Remember where the template-id starts. */
13226 /* Parse the template-name. */
13229 check_dependency_p,
13230 is_declaration,
13231 tag_type,
13234 {
13237 }
13239 /* If we find the sequence `[:' after a template-name, it's probably
13240 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13241 parse correctly the argument list. */
13248 {
13250 /* Change `:' into `::'. */
13252 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13253 CPP_LESS. */
13256 /* Parse the arguments. */
13259 {
13260 /* If we couldn't parse an argument list, then we revert our changes
13261 and return simply an error. Maybe this is not a template-id
13262 after all. */
13267 }
13268 /* Otherwise, emit an error about the invalid digraph, but continue
13269 parsing because we got our argument list. */
13272 {
13275 "%<<:%> is an alternate spelling for %<[%>."
13278 {
13280 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13283 }
13284 }
13285 }
13286 else
13287 {
13288 /* Look for the `<' that starts the template-argument-list. */
13290 {
13293 }
13294 /* Parse the arguments. */
13296 }
13298 /* Build a representation of the specialization. */
13301 TEMPLATE_ID_EXPR,
13305 {
13307 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13308 template (rather than some instantiation thereof) only if
13309 is not nested within some other construct. For example, in
13310 "template <typename T> void f(T) { A<T>::", A<T> is just an
13311 instantiation of A. */
13314 CPP_SCOPE));
13315 template_id
13317 }
13318 else
13319 {
13320 /* If it's not a class-template or a template-template, it should be
13321 a function-template. */
13327 }
13329 /* If parsing tentatively, replace the sequence of tokens that makes
13330 up the template-id with a CPP_TEMPLATE_ID token. That way,
13331 should we re-parse the token stream, we will not have to repeat
13332 the effort required to do the parse, nor will we issue duplicate
13333 error messages about problems during instantiation of the
13334 template. */
13336 {
13339 /* Reset the contents of the START_OF_ID token. */
13341 /* Retrieve any deferred checks. Do not pop this access checks yet
13342 so the memory will not be reclaimed during token replacing below. */
13348 /* Purge all subsequent tokens. */
13351 /* ??? Can we actually assume that, if template_id ==
13352 error_mark_node, we will have issued a diagnostic to the
13353 user, as opposed to simply marking the tentative parse as
13354 failed? */
13357 }
13361 }
13363 /* Parse a template-name.
13365 template-name:
13366 identifier
13368 The standard should actually say:
13370 template-name:
13371 identifier
13372 operator-function-id
13374 A defect report has been filed about this issue.
13376 A conversion-function-id cannot be a template name because they cannot
13377 be part of a template-id. In fact, looking at this code:
13379 a.operator K<int>()
13381 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13382 It is impossible to call a templated conversion-function-id with an
13383 explicit argument list, since the only allowed template parameter is
13384 the type to which it is converting.
13386 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13387 `template' keyword, in a construction like:
13389 T::template f<3>()
13391 In that case `f' is taken to be a template-name, even though there
13392 is no way of knowing for sure.
13394 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13395 name refers to a set of overloaded functions, at least one of which
13396 is a template, or an IDENTIFIER_NODE with the name of the template,
13397 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13398 names are looked up inside uninstantiated templates. */
13400 static tree
13407 {
13408 tree identifier;
13409 tree decl;
13410 tree fns;
13413 /* If the next token is `operator', then we have either an
13414 operator-function-id or a conversion-function-id. */
13416 {
13417 /* We don't know whether we're looking at an
13418 operator-function-id or a conversion-function-id. */
13420 /* Try an operator-function-id. */
13422 /* If that didn't work, try a conversion-function-id. */
13424 {
13427 }
13428 }
13429 /* Look for the identifier. */
13430 else
13433 /* If we didn't find an identifier, we don't have a template-id. */
13437 /* If the name immediately followed the `template' keyword, then it
13438 is a template-name. However, if the next token is not `<', then
13439 we do not treat it as a template-name, since it is not being used
13440 as part of a template-id. This enables us to handle constructs
13441 like:
13443 template <typename T> struct S { S(); };
13444 template <typename T> S<T>::S();
13446 correctly. We would treat `S' as a template -- if it were `S<T>'
13447 -- but we do not if there is no `<'. */
13451 {
13452 /* In a declaration, in a dependent context, we pretend that the
13453 "template" keyword was present in order to improve error
13454 recovery. For example, given:
13456 template <typename T> void f(T::X<int>);
13458 we want to treat "X<int>" as a template-id. */
13460 && !template_keyword_p
13462 && check_dependency_p
13464 /* Do not do this for dtors (or ctors), since they never
13465 need the template keyword before their name. */
13467 {
13470 /* Explain what went wrong. */
13472 identifier);
13475 /* If parsing tentatively, find the location of the "<" token. */
13478 /* Parse the template arguments so that we can issue error
13479 messages about them. */
13482 /* Skip tokens until we find a good place from which to
13483 continue parsing. */
13488 /* If parsing tentatively, permanently remove the
13489 template argument list. That will prevent duplicate
13490 error messages from being issued about the missing
13491 "template" keyword. */
13497 }
13499 /* If the "template" keyword is present, then there is generally
13500 no point in doing name-lookup, so we just return IDENTIFIER.
13501 But, if the qualifying scope is non-dependent then we can
13502 (and must) do name-lookup normally. */
13508 }
13510 /* Look up the name. */
13512 tag_type,
13515 check_dependency_p,
13519 /* If DECL is a template, then the name was a template-name. */
13521 ;
13522 else
13523 {
13526 /* The standard does not explicitly indicate whether a name that
13527 names a set of overloaded declarations, some of which are
13528 templates, is a template-name. However, such a name should
13529 be a template-name; otherwise, there is no way to form a
13530 template-id for the overloaded templates. */
13538 {
13539 /* The name does not name a template. */
13542 }
13543 }
13545 /* If DECL is dependent, and refers to a function, then just return
13546 its name; we will look it up again during template instantiation. */
13548 {
13552 }
13555 }
13557 /* Parse a template-argument-list.
13559 template-argument-list:
13560 template-argument ... [opt]
13561 template-argument-list , template-argument ... [opt]
13563 Returns a TREE_VEC containing the arguments. */
13565 static tree
13567 {
13572 tree vec;
13579 /* Even if the template-id appears in an integral
13580 constant-expression, the contents of the argument list do
13581 not. */
13587 /* Parse the arguments. */
13588 do
13589 {
13590 tree argument;
13593 /* Consume the comma. */
13596 /* Parse the template-argument. */
13599 /* If the next token is an ellipsis, we're expanding a template
13600 argument pack. */
13602 {
13604 {
13608 }
13609 /* Consume the `...' token. */
13612 /* Make the argument into a TYPE_PACK_EXPANSION or
13613 EXPR_PACK_EXPANSION. */
13615 }
13618 {
13622 {
13625 }
13626 else
13628 }
13630 }
13643 #ifdef ENABLE_CHECKING
13645 #endif
13647 }
13649 /* Parse a template-argument.
13651 template-argument:
13652 assignment-expression
13653 type-id
13654 id-expression
13656 The representation is that of an assignment-expression, type-id, or
13657 id-expression -- except that the qualified id-expression is
13658 evaluated, so that the value returned is either a DECL or an
13659 OVERLOAD.
13661 Although the standard says "assignment-expression", it forbids
13662 throw-expressions or assignments in the template argument.
13663 Therefore, we use "conditional-expression" instead. */
13665 static tree
13667 {
13668 tree argument;
13674 cp_id_kind idk;
13676 /* There's really no way to know what we're looking at, so we just
13677 try each alternative in order.
13679 [temp.arg]
13681 In a template-argument, an ambiguity between a type-id and an
13682 expression is resolved to a type-id, regardless of the form of
13683 the corresponding template-parameter.
13685 Therefore, we try a type-id first. */
13688 /* If there was no error parsing the type-id but the next token is a
13689 '>>', our behavior depends on which dialect of C++ we're
13690 parsing. In C++98, we probably found a typo for '> >'. But there
13691 are type-id which are also valid expressions. For instance:
13693 struct X { int operator >> (int); };
13694 template <int V> struct Foo {};
13695 Foo<X () >> 5> r;
13697 Here 'X()' is a valid type-id of a function type, but the user just
13698 wanted to write the expression "X() >> 5". Thus, we remember that we
13699 found a valid type-id, but we still try to parse the argument as an
13700 expression to see what happens.
13702 In C++0x, the '>>' will be considered two separate '>'
13703 tokens. */
13707 {
13710 }
13711 else
13712 {
13713 /* If the next token isn't a `,' or a `>', then this argument wasn't
13714 really finished. This means that the argument is not a valid
13715 type-id. */
13718 /* If that worked, we're done. */
13721 }
13722 /* We're still not sure what the argument will be. */
13724 /* Try a template. */
13732 /* If the next token isn't a `,' or a `>', then this argument wasn't
13733 really finished. */
13737 {
13738 /* Figure out what is being referred to. If the id-expression
13739 was for a class template specialization, then we will have a
13740 TYPE_DECL at this point. There is no need to do name lookup
13741 at this point in that case. */
13744 none_type,
13753 }
13756 /* It must be a non-type argument. There permitted cases are given
13757 in [temp.arg.nontype]:
13759 -- an integral constant-expression of integral or enumeration
13760 type; or
13762 -- the name of a non-type template-parameter; or
13764 -- the name of an object or function with external linkage...
13766 -- the address of an object or function with external linkage...
13768 -- a pointer to member... */
13769 /* Look for a non-type template parameter. */
13771 {
13783 }
13785 /* If the next token is "&", the argument must be the address of an
13786 object or function with external linkage. */
13789 {
13792 }
13793 /* See if we might have an id-expression. */
13800 {
13803 address_p,
13810 else
13811 {
13812 tree probe;
13815 {
13818 }
13820 /* If we're in a template, we represent a qualified-id referring
13821 to a static data member as a SCOPE_REF even if the scope isn't
13822 dependent so that we can check access control later. */
13827 {
13828 /* A variable without external linkage might still be a
13829 valid constant-expression, so no error is issued here
13830 if the external-linkage check fails. */
13833 }
13835 /* All overloaded functions are allowed; if the external
13836 linkage test does not pass, an error will be issued
13837 later. */
13838 ;
13842 /* A pointer-to-member. */
13843 ;
13845 ;
13846 else
13850 {
13853 tf_warning_or_error);
13855 }
13856 }
13857 }
13858 /* If the argument started with "&", there are no other valid
13859 alternatives at this point. */
13861 {
13864 }
13866 /* If the argument wasn't successfully parsed as a type-id followed
13867 by '>>', the argument can only be a constant expression now.
13868 Otherwise, we try parsing the constant-expression tentatively,
13869 because the argument could really be a type-id. */
13881 /* We did our best to parse the argument as a non type-id, but that
13882 was the only alternative that matched (albeit with a '>' after
13883 it). We can assume it's just a typo from the user, and a
13884 diagnostic will then be issued. */
13886 }
13888 /* Parse an explicit-instantiation.
13890 explicit-instantiation:
13891 template declaration
13893 Although the standard says `declaration', what it really means is:
13895 explicit-instantiation:
13896 template decl-specifier-seq [opt] declarator [opt] ;
13898 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13899 supposed to be allowed. A defect report has been filed about this
13900 issue.
13902 GNU Extension:
13904 explicit-instantiation:
13905 storage-class-specifier template
13906 decl-specifier-seq [opt] declarator [opt] ;
13907 function-specifier template
13908 decl-specifier-seq [opt] declarator [opt] ; */
13910 static void
13912 {
13914 cp_decl_specifier_seq decl_specifiers;
13919 /* Look for an (optional) storage-class-specifier or
13920 function-specifier. */
13922 {
13923 extension_specifier
13926 extension_specifier
13929 }
13931 /* Look for the `template' keyword. */
13933 /* Let the front end know that we are processing an explicit
13934 instantiation. */
13936 /* [temp.explicit] says that we are supposed to ignore access
13937 control while processing explicit instantiation directives. */
13939 /* Parse a decl-specifier-seq. */
13941 CP_PARSER_FLAGS_OPTIONAL,
13944 /* If there was exactly one decl-specifier, and it declared a class,
13945 and there's no declarator, then we have an explicit type
13946 instantiation. */
13948 {
13949 tree type;
13953 /* Turn access control back on for names used during
13954 template instantiation. */
13959 }
13960 else
13961 {
13963 tree decl;
13965 /* Parse the declarator. */
13966 declarator
13976 {
13979 "explicit instantiation shall not use"
13983 "explicit instantiation shall not use"
13988 /* Turn access control back on for names used during
13989 template instantiation. */
13991 /* Do the explicit instantiation. */
13993 }
13994 else
13995 {
13997 /* Skip the body of the explicit instantiation. */
13999 }
14000 }
14001 /* We're done with the instantiation. */
14007 }
14009 /* Parse an explicit-specialization.
14011 explicit-specialization:
14012 template < > declaration
14014 Although the standard says `declaration', what it really means is:
14016 explicit-specialization:
14017 template <> decl-specifier [opt] init-declarator [opt] ;
14018 template <> function-definition
14019 template <> explicit-specialization
14020 template <> template-declaration */
14022 static void
14024 {
14028 /* Look for the `template' keyword. */
14030 /* Look for the `<'. */
14032 /* Look for the `>'. */
14034 /* We have processed another parameter list. */
14036 /* [temp]
14038 A template ... explicit specialization ... shall not have C
14039 linkage. */
14041 {
14043 /* Give it C++ linkage to avoid confusing other parts of the
14044 front end. */
14047 }
14048 else
14050 /* Let the front end know that we are beginning a specialization. */
14052 {
14055 }
14057 /* If the next keyword is `template', we need to figure out whether
14058 or not we're looking a template-declaration. */
14060 {
14065 else
14067 }
14068 else
14069 /* Parse the dependent declaration. */
14075 /* We're done with the specialization. */
14077 /* For the erroneous case of a template with C linkage, we pushed an
14078 implicit C++ linkage scope; exit that scope now. */
14081 /* We're done with this parameter list. */
14083 }
14085 /* Parse a type-specifier.
14087 type-specifier:
14088 simple-type-specifier
14089 class-specifier
14090 enum-specifier
14091 elaborated-type-specifier
14092 cv-qualifier
14094 GNU Extension:
14096 type-specifier:
14097 __complex__
14099 Returns a representation of the type-specifier. For a
14100 class-specifier, enum-specifier, or elaborated-type-specifier, a
14101 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14103 The parser flags FLAGS is used to control type-specifier parsing.
14105 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14106 in a decl-specifier-seq.
14108 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14109 class-specifier, enum-specifier, or elaborated-type-specifier, then
14110 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14111 if a type is declared; 2 if it is defined. Otherwise, it is set to
14112 zero.
14114 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14115 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14116 is set to FALSE. */
14118 static tree
14120 cp_parser_flags flags,
14125 {
14131 /* Assume this type-specifier does not declare a new type. */
14134 /* And that it does not specify a cv-qualifier. */
14137 /* Peek at the next token. */
14140 /* If we're looking at a keyword, we can use that to guide the
14141 production we choose. */
14144 {
14149 /* Look for the enum-specifier. */
14151 /* If that worked, we're done. */
14153 {
14158 type_spec,
14159 token,
14162 }
14163 else
14166 /* Any of these indicate either a class-specifier, or an
14167 elaborated-type-specifier. */
14174 /* Parse tentatively so that we can back up if we don't find a
14175 class-specifier. */
14177 /* Look for the class-specifier. */
14180 /* If that worked, we're done. */
14182 {
14187 type_spec,
14188 token,
14191 }
14193 /* Fall through. */
14194 elaborated_type_specifier:
14195 /* We're declaring (not defining) a class or enum. */
14199 /* Fall through. */
14201 /* Look for an elaborated-type-specifier. */
14202 type_spec
14203 = (cp_parser_elaborated_type_specifier
14206 is_declaration));
14209 type_spec,
14210 token,
14233 /* The `__complex__' keyword is a GNU extension. */
14239 }
14241 /* Handle simple keywords. */
14243 {
14245 {
14248 }
14250 }
14252 /* If we do not already have a type-specifier, assume we are looking
14253 at a simple-type-specifier. */
14255 decl_specs,
14256 flags);
14258 /* If we didn't find a type-specifier, and a type-specifier was not
14259 optional in this context, issue an error message. */
14261 {
14264 }
14267 }
14269 /* Parse a simple-type-specifier.
14271 simple-type-specifier:
14272 :: [opt] nested-name-specifier [opt] type-name
14273 :: [opt] nested-name-specifier template template-id
14274 char
14275 wchar_t
14276 bool
14277 short
14278 int
14279 long
14280 signed
14281 unsigned
14282 float
14283 double
14284 void
14286 C++0x Extension:
14288 simple-type-specifier:
14289 auto
14290 decltype ( expression )
14291 char16_t
14292 char32_t
14293 __underlying_type ( type-id )
14295 GNU Extension:
14297 simple-type-specifier:
14298 __int128
14299 __typeof__ unary-expression
14300 __typeof__ ( type-id )
14301 __typeof__ ( type-id ) { initializer-list , [opt] }
14303 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14304 appropriately updated. */
14306 static tree
14309 cp_parser_flags flags)
14310 {
14314 /* Peek at the next token. */
14317 /* If we're looking at a keyword, things are easy. */
14319 {
14382 /* Since DR 743, decltype can either be a simple-type-specifier by
14383 itself or begin a nested-name-specifier. Parsing it will replace
14384 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14385 handling below decide what to do. */
14391 /* Consume the `typeof' token. */
14393 /* Parse the operand to `typeof'. */
14395 /* If it is not already a TYPE, take its type. */
14401 token,
14410 token,
14420 token,
14425 }
14427 /* If token is an already-parsed decltype not followed by ::,
14428 it's a simple-type-specifier. */
14431 {
14435 token,
14439 }
14441 /* If the type-specifier was for a built-in type, we're done. */
14443 {
14444 /* Record the type. */
14451 type,
14452 token,
14457 /* Consume the token. */
14460 /* There is no valid C++ program where a non-template type is
14461 followed by a "<". That usually indicates that the user thought
14462 that the type was a template. */
14467 }
14469 /* The type-specifier must be a user-defined type. */
14471 {
14475 /* Don't gobble tokens or issue error messages if this is an
14476 optional type-specifier. */
14480 /* Look for the optional `::' operator. */
14481 global_p
14485 /* Look for the nested-name specifier. */
14486 qualified_p
14494 /* If we have seen a nested-name-specifier, and the next token
14495 is `template', then we are using the template-id production. */
14498 {
14499 /* Look for the template-id. */
14503 none_type,
14505 /* If the template-id did not name a type, we are out of
14506 luck. */
14508 {
14511 }
14512 }
14513 /* Otherwise, look for a type-name. */
14514 else
14516 /* Keep track of all name-lookups performed in class scopes. */
14518 && !global_p
14519 && !qualified_p
14523 /* If it didn't work out, we don't have a TYPE. */
14529 token,
14531 }
14533 /* If we didn't get a type-name, issue an error message. */
14535 {
14538 }
14541 {
14542 /* See if TYPE is an Objective-C type, and if so, parse and
14543 accept any protocol references following it. Do this before
14544 the cp_parser_check_for_invalid_template_id() call, because
14545 Objective-C types can be followed by '<...>' which would
14546 enclose protocol names rather than template arguments, and so
14547 everything is fine. */
14550 {
14554 /* Clobber the "unqualified" type previously entered into
14555 DECL_SPECS with the new, improved protocol-qualified version. */
14560 }
14562 /* There is no valid C++ program where a non-template type is
14563 followed by a "<". That usually indicates that the user
14564 thought that the type was a template. */
14566 none_type,
14568 }
14571 }
14573 /* Parse a type-name.
14575 type-name:
14576 class-name
14577 enum-name
14578 typedef-name
14579 simple-template-id [in c++0x]
14581 enum-name:
14582 identifier
14584 typedef-name:
14585 identifier
14587 Returns a TYPE_DECL for the type. */
14589 static tree
14591 {
14592 tree type_decl;
14594 /* We can't know yet whether it is a class-name or not. */
14596 /* Try a class-name. */
14600 none_type,
14604 /* If it's not a class-name, keep looking. */
14606 {
14608 /* It must be a typedef-name or an enum-name. */
14612 /* It is either a simple-template-id representing an
14613 instantiation of an alias template... */
14617 none_type,
14619 /* Note that this must be an instantiation of an alias template
14620 because [temp.names]/6 says:
14622 A template-id that names an alias template specialization
14623 is a type-name.
14625 Whereas [temp.names]/7 says:
14627 A simple-template-id that names a class template
14628 specialization is a class-name. */
14633 else
14637 /* ... Or a typedef-name or an enum-name. */
14639 }
14642 }
14644 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14646 enum-name:
14647 identifier
14649 typedef-name:
14650 identifier
14652 Returns a TYPE_DECL for the type. */
14654 static tree
14656 {
14657 tree type_decl;
14658 tree identifier;
14665 /* Look up the type-name. */
14669 {
14673 {
14674 /* We have found a type introduced by a using
14675 declaration at class scope that refers to a dependent
14676 type.
14678 using typename :: [opt] nested-name-specifier unqualified-id ;
14679 */
14685 }
14686 }
14690 {
14691 /* See if this is an Objective-C type. */
14696 }
14698 /* Issue an error if we did not find a type-name. */
14700 /* In Objective-C, we have the complication that class names are
14701 normally type names and start declarations (eg, the
14702 "NSObject" in "NSObject *object;"), but can be used in an
14703 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14704 is an expression. So, a classname followed by a dot is not a
14705 valid type-name. */
14708 {
14713 }
14714 /* Remember that the name was used in the definition of the
14715 current class so that we can check later to see if the
14716 meaning would have been different after the class was
14717 entirely defined. */
14723 }
14725 /* Parse an elaborated-type-specifier. Note that the grammar given
14726 here incorporates the resolution to DR68.
14728 elaborated-type-specifier:
14729 class-key :: [opt] nested-name-specifier [opt] identifier
14730 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14731 enum-key :: [opt] nested-name-specifier [opt] identifier
14732 typename :: [opt] nested-name-specifier identifier
14733 typename :: [opt] nested-name-specifier template [opt]
14734 template-id
14736 GNU extension:
14738 elaborated-type-specifier:
14739 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14740 class-key attributes :: [opt] nested-name-specifier [opt]
14741 template [opt] template-id
14742 enum attributes :: [opt] nested-name-specifier [opt] identifier
14744 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14745 declared `friend'. If IS_DECLARATION is TRUE, then this
14746 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14747 something is being declared.
14749 Returns the TYPE specified. */
14751 static tree
14755 {
14757 tree identifier;
14760 tree globalscope;
14763 /* See if we're looking at the `enum' keyword. */
14765 {
14766 /* Consume the `enum' token. */
14768 /* Remember that it's an enumeration type. */
14770 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14771 enums) is used here. */
14774 {
14778 /* Consume the `struct' or `class' and parse it anyway. */
14780 }
14781 /* Parse the attributes. */
14783 }
14784 /* Or, it might be `typename'. */
14786 RID_TYPENAME))
14787 {
14788 /* Consume the `typename' token. */
14790 /* Remember that it's a `typename' type. */
14792 }
14793 /* Otherwise it must be a class-key. */
14794 else
14795 {
14799 /* Parse the attributes. */
14801 }
14803 /* Look for the `::' operator. */
14806 /* Look for the nested-name-specifier. */
14808 {
14813 is_declaration))
14815 }
14816 else
14817 /* Even though `typename' is not present, the proposed resolution
14818 to Core Issue 180 says that in `class A<T>::B', `B' should be
14819 considered a type-name, even if `A<T>' is dependent. */
14824 is_declaration);
14825 /* For everything but enumeration types, consider a template-id.
14826 For an enumeration type, consider only a plain identifier. */
14828 {
14830 tree decl;
14832 /* Allow the `template' keyword. */
14834 /* If we didn't see `template', we don't know if there's a
14835 template-id or not. */
14838 /* Parse the template-id. */
14842 tag_type,
14843 is_declaration);
14844 /* If we didn't find a template-id, look for an ordinary
14845 identifier. */
14847 ;
14848 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14849 in effect, then we must assume that, upon instantiation, the
14850 template will correspond to a class. */
14854 typename_type,
14856 /* If the `typename' keyword is in effect and DECL is not a type
14857 decl, then type is non existent. */
14859 ;
14865 }
14868 {
14873 {
14876 }
14878 /* For a `typename', we needn't call xref_tag. */
14882 identifier,
14884 /* Look up a qualified name in the usual way. */
14886 {
14887 tree decl;
14888 tree ambiguous_decls;
14891 tag_type,
14898 /* If the lookup was ambiguous, an error will already have been
14899 issued. */
14903 /* If we are parsing friend declaration, DECL may be a
14904 TEMPLATE_DECL tree node here. However, we need to check
14905 whether this TEMPLATE_DECL results in valid code. Consider
14906 the following example:
14908 namespace N {
14909 template <class T> class C {};
14910 }
14911 class X {
14912 template <class T> friend class N::C; // #1, valid code
14913 };
14914 template <class T> class Y {
14915 friend class N::C; // #2, invalid code
14916 };
14918 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14919 name lookup of `N::C'. We see that friend declaration must
14920 be template for the code to be valid. Note that
14921 processing_template_decl does not work here since it is
14922 always 1 for the above two cases. */
14924 decl = (cp_parser_maybe_treat_template_as_class
14929 {
14932 identifier,
14935 }
14938 {
14942 allow_template);
14946 }
14948 /* Forward declarations of nested types, such as
14950 class C1::C2;
14951 class C1::C2::C3;
14953 are invalid unless all components preceding the final '::'
14954 are complete. If all enclosing types are complete, these
14955 declarations become merely pointless.
14957 Invalid forward declarations of nested types are errors
14958 caught elsewhere in parsing. Those that are pointless arrive
14959 here. */
14966 }
14967 else
14968 {
14969 /* An elaborated-type-specifier sometimes introduces a new type and
14970 sometimes names an existing type. Normally, the rule is that it
14971 introduces a new type only if there is not an existing type of
14972 the same name already in scope. For example, given:
14974 struct S {};
14975 void f() { struct S s; }
14977 the `struct S' in the body of `f' is the same `struct S' as in
14978 the global scope; the existing definition is used. However, if
14979 there were no global declaration, this would introduce a new
14980 local class named `S'.
14982 An exception to this rule applies to the following code:
14984 namespace N { struct S; }
14986 Here, the elaborated-type-specifier names a new type
14987 unconditionally; even if there is already an `S' in the
14988 containing scope this declaration names a new type.
14989 This exception only applies if the elaborated-type-specifier
14990 forms the complete declaration:
14992 [class.name]
14994 A declaration consisting solely of `class-key identifier ;' is
14995 either a redeclaration of the name in the current scope or a
14996 forward declaration of the identifier as a class name. It
14997 introduces the name into the current scope.
14999 We are in this situation precisely when the next token is a `;'.
15001 An exception to the exception is that a `friend' declaration does
15002 *not* name a new type; i.e., given:
15004 struct S { friend struct T; };
15006 `T' is not a new type in the scope of `S'.
15008 Also, `new struct S' or `sizeof (struct S)' never results in the
15009 definition of a new type; a new type can only be declared in a
15010 declaration context. */
15012 tag_scope ts;
15016 /* Friends have special name lookup rules. */
15020 CPP_SEMICOLON))
15021 /* This is a `class-key identifier ;' */
15023 else
15026 template_p =
15030 /* An unqualified name was used to reference this type, so
15031 there were no qualifying templates. */
15038 }
15039 }
15044 /* Allow attributes on forward declarations of classes. */
15046 {
15056 else
15059 }
15062 {
15063 /* Indicate whether this class was declared as a `class' or as a
15064 `struct'. */
15068 }
15070 /* A "<" cannot follow an elaborated type specifier. If that
15071 happens, the user was probably trying to form a template-id. */
15076 }
15078 /* Parse an enum-specifier.
15080 enum-specifier:
15081 enum-head { enumerator-list [opt] }
15082 enum-head { enumerator-list , } [C++0x]
15084 enum-head:
15085 enum-key identifier [opt] enum-base [opt]
15086 enum-key nested-name-specifier identifier enum-base [opt]
15088 enum-key:
15089 enum
15090 enum class [C++0x]
15091 enum struct [C++0x]
15093 enum-base: [C++0x]
15094 : type-specifier-seq
15096 opaque-enum-specifier:
15097 enum-key identifier enum-base [opt] ;
15099 GNU Extensions:
15100 enum-key attributes[opt] identifier [opt] enum-base [opt]
15101 { enumerator-list [opt] }attributes[opt]
15102 enum-key attributes[opt] identifier [opt] enum-base [opt]
15103 { enumerator-list, }attributes[opt] [C++0x]
15105 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15106 if the token stream isn't an enum-specifier after all. */
15108 static tree
15110 {
15111 tree identifier;
15113 tree prev_scope;
15115 tree attributes;
15128 /* Parse tentatively so that we can back up if we don't find a
15129 enum-specifier. */
15132 /* Caller guarantees that the current token is 'enum', an identifier
15133 possibly follows, and the token after that is an opening brace.
15134 If we don't have an identifier, fabricate an anonymous name for
15135 the enumeration being defined. */
15138 /* Parse the "class" or "struct", which indicates a scoped
15139 enumeration type in C++0x. */
15142 {
15146 /* Consume the `struct' or `class' token. */
15150 }
15154 /* Clear the qualification. */
15159 /* Figure out in what scope the declaration is being placed. */
15165 nested_name_specifier
15173 {
15174 tree name;
15178 enum_type,
15183 input_location);
15185 {
15188 {
15189 /* Are template enums allowed in ISO? */
15193 /* ignore a typename reference, for it will be solved by name
15194 in start_enum. */
15196 }
15197 }
15200 else
15203 }
15204 else
15205 {
15208 else
15209 {
15215 }
15216 }
15219 /* Check for the `:' that denotes a specified underlying type in C++0x.
15220 Note that a ':' could also indicate a bitfield width, however. */
15222 {
15223 cp_decl_specifier_seq type_specifiers;
15225 /* Consume the `:'. */
15228 /* Parse the type-specifier-seq. */
15233 /* At this point this is surely not elaborated type specifier. */
15242 /* If that didn't work, stop. */
15244 {
15249 }
15250 }
15252 /* Look for the `{' but don't consume it yet. */
15254 {
15256 {
15259 {
15262 }
15263 }
15264 /* An opaque-enum-specifier must have a ';' here. */
15267 {
15270 {
15273 }
15274 }
15275 }
15281 {
15283 {
15287 }
15289 {
15291 }
15292 }
15294 /* Issue an error message if type-definitions are forbidden here. */
15297 else
15298 /* Create the new type. We do this before consuming the opening
15299 brace so the enum will be recorded as being on the line of its
15300 tag (or the 'enum' keyword, if there is no tag). */
15304 /* If the next token is not '{' it is an opaque-enum-specifier or an
15305 elaborated-type-specifier. */
15307 {
15311 {
15312 /* The following catches invalid code such as:
15313 enum class S<int>::E { A, B, C }; */
15320 /* If that scope does not contain the scope in which the
15321 class was originally declared, the program is invalid. */
15323 {
15326 "declaration of %qD in namespace %qD which does not "
15329 else
15334 }
15335 }
15340 /* Consume the opening brace. */
15347 {
15351 }
15352 else
15353 {
15358 }
15362 /* If the next token is not '}', then there are some enumerators. */
15364 {
15368 }
15369 else
15372 /* Consume the final '}'. */
15378 }
15379 else
15380 {
15381 /* If a ';' follows, then it is an opaque-enum-specifier
15382 and additional restrictions apply. */
15384 {
15391 }
15392 }
15394 /* Look for trailing attributes to apply to this enumeration, and
15395 apply them if appropriate. */
15397 {
15401 trailing_attr,
15403 }
15405 /* Finish up the enumeration. */
15407 {
15412 }
15415 {
15417 {
15420 }
15422 {
15424 }
15425 }
15426 out:
15429 }
15431 /* Parse an enumerator-list. The enumerators all have the indicated
15432 TYPE.
15434 enumerator-list:
15435 enumerator-definition
15436 enumerator-list , enumerator-definition */
15438 static void
15440 {
15442 {
15443 /* Parse an enumerator-definition. */
15446 /* If the next token is not a ',', we've reached the end of
15447 the list. */
15450 /* Otherwise, consume the `,' and keep going. */
15452 /* If the next token is a `}', there is a trailing comma. */
15454 {
15459 }
15460 }
15461 }
15463 /* Parse an enumerator-definition. The enumerator has the indicated
15464 TYPE.
15466 enumerator-definition:
15467 enumerator
15468 enumerator = constant-expression
15470 enumerator:
15471 identifier */
15473 static void
15475 {
15476 tree identifier;
15477 tree value;
15478 location_t loc;
15480 /* Save the input location because we are interested in the location
15481 of the identifier and not the location of the explicit value. */
15484 /* Look for the identifier. */
15489 /* If the next token is an '=', then there is an explicit value. */
15491 {
15492 /* Consume the `=' token. */
15494 /* Parse the value. */
15497 NULL);
15498 }
15499 else
15502 /* If we are processing a template, make sure the initializer of the
15503 enumerator doesn't contain any bare template parameter pack. */
15507 /* integral_constant_value will pull out this expression, so make sure
15508 it's folded as appropriate. */
15511 /* Create the enumerator. */
15513 }
15515 /* Parse a namespace-name.
15517 namespace-name:
15518 original-namespace-name
15519 namespace-alias
15521 Returns the NAMESPACE_DECL for the namespace. */
15523 static tree
15525 {
15526 tree identifier;
15527 tree namespace_decl;
15531 /* Get the name of the namespace. */
15536 /* Look up the identifier in the currently active scope. Look only
15537 for namespaces, due to:
15539 [basic.lookup.udir]
15541 When looking up a namespace-name in a using-directive or alias
15542 definition, only namespace names are considered.
15544 And:
15546 [basic.lookup.qual]
15548 During the lookup of a name preceding the :: scope resolution
15549 operator, object, function, and enumerator names are ignored.
15551 (Note that cp_parser_qualifying_entity only calls this
15552 function if the token after the name is the scope resolution
15553 operator.) */
15555 none_type,
15561 /* If it's not a namespace, issue an error. */
15564 {
15569 }
15572 }
15574 /* Parse a namespace-definition.
15576 namespace-definition:
15577 named-namespace-definition
15578 unnamed-namespace-definition
15580 named-namespace-definition:
15581 original-namespace-definition
15582 extension-namespace-definition
15584 original-namespace-definition:
15585 namespace identifier { namespace-body }
15587 extension-namespace-definition:
15588 namespace original-namespace-name { namespace-body }
15590 unnamed-namespace-definition:
15591 namespace { namespace-body } */
15593 static void
15595 {
15602 {
15606 }
15607 else
15610 /* Look for the `namespace' keyword. */
15613 /* Get the name of the namespace. We do not attempt to distinguish
15614 between an original-namespace-definition and an
15615 extension-namespace-definition at this point. The semantic
15616 analysis routines are responsible for that. */
15619 else
15622 /* Parse any specified attributes. */
15625 /* Look for the `{' to start the namespace. */
15627 /* Start the namespace. */
15630 /* "inline namespace" is equivalent to a stub namespace definition
15631 followed by a strong using directive. */
15633 {
15635 /* Set up namespace association. */
15639 /* Import the contents of the inline namespace. */
15643 }
15647 /* Parse the body of the namespace. */
15653 /* Finish the namespace. */
15655 /* Look for the final `}'. */
15657 }
15659 /* Parse a namespace-body.
15661 namespace-body:
15662 declaration-seq [opt] */
15664 static void
15666 {
15668 }
15670 /* Parse a namespace-alias-definition.
15672 namespace-alias-definition:
15673 namespace identifier = qualified-namespace-specifier ; */
15675 static void
15677 {
15678 tree identifier;
15679 tree namespace_specifier;
15683 /* Look for the `namespace' keyword. */
15685 /* Look for the identifier. */
15689 /* Look for the `=' token. */
15692 {
15694 /* Skip the definition. */
15699 }
15701 /* Look for the qualified-namespace-specifier. */
15702 namespace_specifier
15704 /* Look for the `;' token. */
15707 /* Register the alias in the symbol table. */
15709 }
15711 /* Parse a qualified-namespace-specifier.
15713 qualified-namespace-specifier:
15714 :: [opt] nested-name-specifier [opt] namespace-name
15716 Returns a NAMESPACE_DECL corresponding to the specified
15717 namespace. */
15719 static tree
15721 {
15722 /* Look for the optional `::'. */
15726 /* Look for the optional nested-name-specifier. */
15734 }
15736 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15737 access declaration.
15739 using-declaration:
15740 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15741 using :: unqualified-id ;
15743 access-declaration:
15744 qualified-id ;
15746 */
15748 static bool
15751 {
15755 tree decl;
15756 tree identifier;
15757 tree qscope;
15762 {
15765 }
15766 else
15767 {
15768 /* Look for the `using' keyword. */
15771 /* Peek at the next token. */
15773 /* See if it's `typename'. */
15775 {
15776 /* Remember that we've seen it. */
15778 /* Consume the `typename' token. */
15780 }
15781 }
15783 /* Look for the optional global scope qualification. */
15784 global_scope_p
15789 /* If we saw `typename', or didn't see `::', then there must be a
15790 nested-name-specifier present. */
15796 /* Otherwise, we could be in either of the two productions. In that
15797 case, treat the nested-name-specifier as optional. */
15798 else
15808 /* Something has already gone wrong; there's no need to parse
15809 further. Since an error has occurred, the return value of
15810 cp_parser_parse_definitely will be false, as required. */
15814 /* Parse the unqualified-id. */
15822 {
15827 }
15829 /* The function we call to handle a using-declaration is different
15830 depending on what scope we are in. */
15832 ;
15835 /* [namespace.udecl]
15837 A using declaration shall not name a template-id. */
15840 else
15841 {
15843 {
15844 /* Create the USING_DECL. */
15852 else
15853 /* Add it to the list of members in this class. */
15855 }
15856 else
15857 {
15859 identifier,
15869 else
15871 }
15872 }
15874 /* Look for the final `;'. */
15879 "access declarations are deprecated "
15880 "in favour of using-declarations; "
15884 }
15886 /* Parse an alias-declaration.
15888 alias-declaration:
15889 using identifier attribute-specifier-seq [opt] = type-id */
15891 static tree
15893 {
15895 location_t id_location;
15897 cp_decl_specifier_seq decl_specs;
15901 /* Look for the `using' keyword. */
15902 cp_token *using_token
15924 /* Now we are going to parse the type-id of the declaration. */
15926 /*
15927 [dcl.type]/3 says:
15929 "A type-specifier-seq shall not define a class or enumeration
15930 unless it appears in the type-id of an alias-declaration (7.1.3) that
15931 is not the declaration of a template-declaration."
15933 In other words, if we currently are in an alias template, the
15934 type-id should not define a type.
15936 So let's set parser->type_definition_forbidden_message in that
15937 case; cp_parser_check_type_definition (called by
15938 cp_parser_class_specifier) will then emit an error if a type is
15939 defined in the type-id. */
15941 {
15945 }
15949 /* Restore the error message if need be. */
15954 {
15957 }
15962 {
15965 }
15967 /* A typedef-name can also be introduced by an alias-declaration. The
15968 identifier following the using keyword becomes a typedef-name. It has
15969 the same semantics as if it were introduced by the typedef
15970 specifier. In particular, it does not define a new type and it shall
15971 not appear in the type-id. */
15976 {
15979 ds_attribute,
15980 attrs_token);
15981 }
15983 ds_typedef,
15984 using_token);
15986 ds_alias,
15987 using_token);
15996 else
16007 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16008 added into the symbol table; otherwise, return the TYPE_DECL. */
16012 {
16016 }
16019 }
16021 /* Parse a using-directive.
16023 using-directive:
16024 using namespace :: [opt] nested-name-specifier [opt]
16025 namespace-name ; */
16027 static void
16029 {
16030 tree namespace_decl;
16031 tree attribs;
16033 /* Look for the `using' keyword. */
16035 /* And the `namespace' keyword. */
16037 /* Look for the optional `::' operator. */
16039 /* And the optional nested-name-specifier. */
16045 /* Get the namespace being used. */
16047 /* And any specified attributes. */
16049 /* Update the symbol table. */
16051 /* Look for the final `;'. */
16053 }
16055 /* Parse an asm-definition.
16057 asm-definition:
16058 asm ( string-literal ) ;
16060 GNU Extension:
16062 asm-definition:
16063 asm volatile [opt] ( string-literal ) ;
16064 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16065 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16066 : asm-operand-list [opt] ) ;
16067 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16068 : asm-operand-list [opt]
16069 : asm-clobber-list [opt] ) ;
16070 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16071 : asm-clobber-list [opt]
16072 : asm-goto-list ) ; */
16074 static void
16076 {
16077 tree string;
16082 tree asm_stmt;
16090 /* Look for the `asm' keyword. */
16092 /* See if the next token is `volatile'. */
16095 {
16096 /* Remember that we saw the `volatile' keyword. */
16098 /* Consume the token. */
16100 }
16104 {
16105 /* Remember that we saw the `goto' keyword. */
16107 /* Consume the token. */
16109 }
16110 /* Look for the opening `('. */
16113 /* Look for the string. */
16116 {
16120 }
16122 /* If we're allowing GNU extensions, check for the extended assembly
16123 syntax. Unfortunately, the `:' tokens need not be separated by
16124 a space in C, and so, for compatibility, we tolerate that here
16125 too. Doing that means that we have to treat the `::' operator as
16126 two `:' tokens. */
16131 {
16136 /* The extended syntax was used. */
16139 /* Look for outputs. */
16141 {
16142 /* Consume the `:'. */
16144 /* Parse the output-operands. */
16146 CPP_COLON)
16148 CPP_SCOPE)
16150 CPP_CLOSE_PAREN)
16156 }
16157 /* If the next token is `::', there are no outputs, and the
16158 next token is the beginning of the inputs. */
16160 /* The inputs are coming next. */
16163 /* Look for inputs. */
16166 {
16167 /* Consume the `:' or `::'. */
16169 /* Parse the output-operands. */
16171 CPP_COLON)
16173 CPP_SCOPE)
16175 CPP_CLOSE_PAREN))
16180 }
16182 /* The clobbers are coming next. */
16185 /* Look for clobbers. */
16188 {
16190 /* Consume the `:' or `::'. */
16192 /* Parse the clobbers. */
16194 CPP_COLON)
16196 CPP_CLOSE_PAREN))
16198 }
16201 /* The labels are coming next. */
16204 /* Look for labels. */
16207 {
16209 /* Consume the `:' or `::'. */
16211 /* Parse the labels. */
16213 }
16217 }
16221 /* Look for the closing `)'. */
16229 {
16230 /* Create the ASM_EXPR. */
16232 {
16235 /* If the extended syntax was not used, mark the ASM_EXPR. */
16237 {
16243 }
16244 }
16245 else
16247 }
16248 }
16250 /* Declarators [gram.dcl.decl] */
16252 /* Parse an init-declarator.
16254 init-declarator:
16255 declarator initializer [opt]
16257 GNU Extension:
16259 init-declarator:
16260 declarator asm-specification [opt] attributes [opt] initializer [opt]
16262 function-definition:
16263 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16264 function-body
16265 decl-specifier-seq [opt] declarator function-try-block
16267 GNU Extension:
16269 function-definition:
16270 __extension__ function-definition
16272 TM Extension:
16274 function-definition:
16275 decl-specifier-seq [opt] declarator function-transaction-block
16277 The DECL_SPECIFIERS apply to this declarator. Returns a
16278 representation of the entity declared. If MEMBER_P is TRUE, then
16279 this declarator appears in a class scope. The new DECL created by
16280 this declarator is returned.
16282 The CHECKS are access checks that should be performed once we know
16283 what entity is being declared (and, therefore, what classes have
16284 befriended it).
16286 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16287 for a function-definition here as well. If the declarator is a
16288 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16289 be TRUE upon return. By that point, the function-definition will
16290 have been completely parsed.
16292 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16293 is FALSE.
16295 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16296 parsed declaration if it is an uninitialized single declarator not followed
16297 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16298 if present, will not be consumed. If returned, this declarator will be
16299 created with SD_INITIALIZED but will not call cp_finish_decl. */
16301 static tree
16310 {
16314 tree prefix_attributes;
16316 tree asm_specification;
16317 tree initializer;
16319 tree scope;
16321 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16322 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16323 "(...)". */
16333 /* Gather the attributes that were provided with the
16334 decl-specifiers. */
16337 /* Assume that this is not the declarator for a function
16338 definition. */
16342 /* Default arguments are only permitted for function parameters. */
16346 /* Defer access checks while parsing the declarator; we cannot know
16347 what names are accessible until we know what is being
16348 declared. */
16351 /* Parse the declarator. */
16353 declarator
16357 member_p);
16358 /* Gather up the deferred checks. */
16363 /* If the DECLARATOR was erroneous, there's no need to go
16364 further. */
16368 /* Check that the number of template-parameter-lists is OK. */
16378 /* Figure out what scope the entity declared by the DECLARATOR is
16379 located in. `grokdeclarator' sometimes changes the scope, so
16380 we compute it now. */
16383 /* Perform any lookups in the declared type which were thought to be
16384 dependent, but are not in the scope of the declarator. */
16385 decl_specifiers->type
16388 /* If we're allowing GNU extensions, look for an
16389 asm-specification. */
16391 {
16392 /* Look for an asm-specification. */
16395 }
16396 else
16399 /* Look for attributes. */
16403 /* Peek at the next token. */
16407 {
16408 /* Check to see if the token indicates the start of a
16409 function-definition. */
16411 {
16413 {
16414 /* If a function-definition should not appear here, issue an
16415 error message. */
16419 }
16421 location_t func_brace_location
16424 /* Neither attributes nor an asm-specification are allowed
16425 on a function-definition. */
16428 "an asm-specification is not allowed "
16432 "attributes are not allowed "
16434 /* This is a function-definition. */
16437 /* Parse the function definition. */
16440 decl_specifiers,
16441 declarator,
16442 prefix_attributes);
16443 else
16444 decl =
16445 (cp_parser_function_definition_from_specifiers_and_declarator
16449 {
16450 /* This is where the prologue starts... */
16453 }
16456 }
16457 }
16459 /* [dcl.dcl]
16461 Only in function declarations for constructors, destructors, and
16462 type conversions can the decl-specifier-seq be omitted.
16464 We explicitly postpone this check past the point where we handle
16465 function-definitions because we tolerate function-definitions
16466 that are missing their return types in some modes. */
16468 {
16472 }
16474 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16478 {
16486 {
16492 }
16493 }
16494 else
16495 {
16496 /* If the init-declarator isn't initialized and isn't followed by a
16497 `,' or `;', it's not a valid init-declarator. */
16500 {
16503 else
16504 {
16507 }
16508 }
16511 }
16513 /* Because start_decl has side-effects, we should only call it if we
16514 know we're going ahead. By this point, we know that we cannot
16515 possibly be looking at any other construct. */
16518 /* If the decl specifiers were bad, issue an error now that we're
16519 sure this was intended to be a declarator. Then continue
16520 declaring the variable(s), as int, to try to cut down on further
16521 errors. */
16524 {
16527 }
16529 /* Check to see whether or not this declaration is a friend. */
16532 /* Enter the newly declared entry in the symbol table. If we're
16533 processing a declaration in a class-specifier, we wait until
16534 after processing the initializer. */
16536 {
16543 /* Adjust location of decl if declarator->id_loc is more appropriate:
16544 set, and decl wasn't merged with another decl, in which case its
16545 location would be different from input_location, and more accurate. */
16550 }
16552 /* Enter the SCOPE. That way unqualified names appearing in the
16553 initializer will be looked up in SCOPE. */
16556 /* Perform deferred access control checks, now that we know in which
16557 SCOPE the declared entity resides. */
16559 {
16562 /* If the entity being declared is a function, pretend that we
16563 are in its scope. If it is a `friend', it may have access to
16564 things that would not otherwise be accessible. */
16566 {
16569 }
16571 /* Perform access checks for template parameters. */
16574 /* Perform the access control checks for the declarator and the
16575 decl-specifiers. */
16578 /* Restore the saved value. */
16581 }
16583 /* Parse the initializer. */
16588 {
16590 {
16594 else
16595 {
16596 /* If the declaration was erroneous, we don't really
16597 know what the user intended, so just silently
16598 consume the initializer. */
16606 }
16607 }
16608 else
16609 {
16610 /* We want to record the extra mangling scope for in-class
16611 initializers of class members and initializers of static data
16612 member templates. The former involves deferring
16613 parsing of the initializer until end of class as with default
16614 arguments. So right here we only handle the latter. */
16624 }
16625 }
16627 /* The old parser allows attributes to appear after a parenthesized
16628 initializer. Mark Mitchell proposed removing this functionality
16629 on the GCC mailing lists on 2002-08-13. This parser accepts the
16630 attributes -- but ignores them. */
16637 /* For an in-class declaration, use `grokfield' to create the
16638 declaration. */
16640 {
16642 {
16645 }
16653 }
16655 /* Finish processing the declaration. But, skip member
16656 declarations. */
16658 {
16661 asm_specification,
16662 /* If the initializer is in parentheses, then this is
16663 a direct-initialization, which means that an
16664 `explicit' constructor is OK. Otherwise, an
16665 `explicit' constructor cannot be used. */
16668 }
16671 /* Core issue #226 (C++0x only): A default template-argument
16672 shall not be specified in a friend class template
16673 declaration. */
16682 {
16685 else
16687 }
16690 }
16692 /* Parse a declarator.
16694 declarator:
16695 direct-declarator
16696 ptr-operator declarator
16698 abstract-declarator:
16699 ptr-operator abstract-declarator [opt]
16700 direct-abstract-declarator
16702 GNU Extensions:
16704 declarator:
16705 attributes [opt] direct-declarator
16706 attributes [opt] ptr-operator declarator
16708 abstract-declarator:
16709 attributes [opt] ptr-operator abstract-declarator [opt]
16710 attributes [opt] direct-abstract-declarator
16712 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16713 detect constructor, destructor or conversion operators. It is set
16714 to -1 if the declarator is a name, and +1 if it is a
16715 function. Otherwise it is set to zero. Usually you just want to
16716 test for >0, but internally the negative value is used.
16718 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16719 a decl-specifier-seq unless it declares a constructor, destructor,
16720 or conversion. It might seem that we could check this condition in
16721 semantic analysis, rather than parsing, but that makes it difficult
16722 to handle something like `f()'. We want to notice that there are
16723 no decl-specifiers, and therefore realize that this is an
16724 expression, not a declaration.)
16726 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16727 the declarator is a direct-declarator of the form "(...)".
16729 MEMBER_P is true iff this declarator is a member-declarator. */
16733 cp_parser_declarator_kind dcl_kind,
16737 {
16740 cp_cv_quals cv_quals;
16741 tree class_type;
16744 /* Assume this is not a constructor, destructor, or type-conversion
16745 operator. */
16752 /* Check for the ptr-operator production. */
16754 /* Parse the ptr-operator. */
16760 /* If that worked, then we have a ptr-operator. */
16762 {
16763 /* If a ptr-operator was found, then this declarator was not
16764 parenthesized. */
16767 /* The dependent declarator is optional if we are parsing an
16768 abstract-declarator. */
16772 /* Parse the dependent declarator. */
16778 /* If we are parsing an abstract-declarator, we must handle the
16779 case where the dependent declarator is absent. */
16784 declarator = cp_parser_make_indirect_declarator
16786 }
16787 /* Everything else is a direct-declarator. */
16788 else
16789 {
16792 CPP_OPEN_PAREN);
16794 ctor_dtor_or_conv_p,
16795 member_p);
16796 }
16801 }
16803 /* Parse a direct-declarator or direct-abstract-declarator.
16805 direct-declarator:
16806 declarator-id
16807 direct-declarator ( parameter-declaration-clause )
16808 cv-qualifier-seq [opt]
16809 ref-qualifier [opt]
16810 exception-specification [opt]
16811 direct-declarator [ constant-expression [opt] ]
16812 ( declarator )
16814 direct-abstract-declarator:
16815 direct-abstract-declarator [opt]
16816 ( parameter-declaration-clause )
16817 cv-qualifier-seq [opt]
16818 ref-qualifier [opt]
16819 exception-specification [opt]
16820 direct-abstract-declarator [opt] [ constant-expression [opt] ]
16821 ( abstract-declarator )
16823 Returns a representation of the declarator. DCL_KIND is
16824 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
16825 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
16826 we are parsing a direct-declarator. It is
16827 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
16828 of ambiguity we prefer an abstract declarator, as per
16829 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
16830 cp_parser_declarator. */
16834 cp_parser_declarator_kind dcl_kind,
16837 {
16847 {
16848 /* Peek at the next token. */
16851 {
16852 /* This is either a parameter-declaration-clause, or a
16853 parenthesized declarator. When we know we are parsing a
16854 named declarator, it must be a parenthesized declarator
16855 if FIRST is true. For instance, `(int)' is a
16856 parameter-declaration-clause, with an omitted
16857 direct-abstract-declarator. But `((*))', is a
16858 parenthesized abstract declarator. Finally, when T is a
16859 template parameter `(T)' is a
16860 parameter-declaration-clause, and not a parenthesized
16861 named declarator.
16863 We first try and parse a parameter-declaration-clause,
16864 and then try a nested declarator (if FIRST is true).
16866 It is not an error for it not to be a
16867 parameter-declaration-clause, even when FIRST is
16868 false. Consider,
16870 int i (int);
16871 int i (3);
16873 The first is the declaration of a function while the
16874 second is the definition of a variable, including its
16875 initializer.
16877 Having seen only the parenthesis, we cannot know which of
16878 these two alternatives should be selected. Even more
16879 complex are examples like:
16881 int i (int (a));
16882 int i (int (3));
16884 The former is a function-declaration; the latter is a
16885 variable initialization.
16887 Thus again, we try a parameter-declaration-clause, and if
16888 that fails, we back out and return. */
16891 {
16892 tree params;
16896 /* In a member-declarator, the only valid interpretation
16897 of a parenthesis is the start of a
16898 parameter-declaration-clause. (It is invalid to
16899 initialize a static data member with a parenthesized
16900 initializer; only the "=" form of initialization is
16901 permitted.) */
16905 /* Consume the `('. */
16908 {
16909 /* If this is going to be an abstract declarator, we're
16910 in a declarator and we can't have default args. */
16913 }
16915 /* Inside the function parameter list, surrounding
16916 template-parameter-lists do not apply. */
16917 saved_num_template_parameter_lists
16923 /* Parse the parameter-declaration-clause. */
16926 /* Restore saved template parameter lists accounting for implicit
16927 template parameters. */
16928 parser->num_template_parameter_lists
16931 /* Consume the `)'. */
16934 /* If all went well, parse the cv-qualifier-seq,
16935 ref-qualifier and the exception-specification. */
16937 {
16938 cp_cv_quals cv_quals;
16939 cp_virt_specifiers virt_specifiers;
16940 cp_ref_qualifier ref_qual;
16941 tree exception_specification;
16942 tree late_return;
16943 tree attrs;
16953 /* Parse the cv-qualifier-seq. */
16955 /* Parse the ref-qualifier. */
16957 /* And the exception-specification. */
16958 exception_specification
16963 late_return = (cp_parser_late_return_type_opt
16968 /* Parse the virt-specifier-seq. */
16971 /* Create the function-declarator. */
16973 params,
16974 cv_quals,
16975 virt_specifiers,
16976 ref_qual,
16977 exception_specification,
16978 late_return);
16980 /* Any subsequent parameter lists are to do with
16981 return type, so are not those of the declared
16982 function. */
16984 }
16986 /* Remove the function parms from scope. */
16990 /* Repeat the main loop. */
16992 }
16994 /* If this is the first, we can try a parenthesized
16995 declarator. */
16997 {
17003 /* Consume the `('. */
17005 /* Parse the nested declarator. */
17008 declarator
17011 member_p);
17014 /* Expect a `)'. */
17021 }
17022 /* Otherwise, we must be done. */
17023 else
17025 }
17029 {
17030 /* Parse an array-declarator. */
17039 /* Consume the `['. */
17041 /* Peek at the next token. */
17043 /* If the next token is `]', then there is no
17044 constant-expression. */
17046 {
17048 bounds
17058 {
17059 /* Normally, the array bound must be an integral constant
17060 expression. However, as an extension, we allow VLAs
17061 in function scopes as long as they aren't part of a
17062 parameter declaration. */
17066 }
17068 {
17069 /* Remember this wasn't a constant-expression. */
17072 }
17073 }
17074 else
17076 /* Look for the closing `]'. */
17078 {
17081 }
17086 }
17088 {
17089 {
17090 tree qualifying_scope;
17091 tree unqualified_name;
17092 tree attrs;
17093 special_function_kind sfk;
17098 /* Parse a declarator-id */
17101 {
17104 /* If we see an ellipsis, we should be looking at a
17105 parameter pack. */
17107 {
17108 /* Consume the `...' */
17112 }
17113 }
17116 unqualified_name
17120 {
17124 {
17125 /* Check whether an error occurred. */
17128 /* We already consumed the ellipsis to mark a
17129 parameter pack, but we have no way to report it,
17130 so abort the tentative parse. We will be exiting
17131 immediately anyway. */
17133 }
17134 else
17140 && (qualifying_scope
17142 {
17145 }
17146 }
17151 {
17156 }
17162 {
17163 /* In the declaration of a member of a template class
17164 outside of the class itself, the SCOPE will sometimes
17165 be a TYPENAME_TYPE. For example, given:
17167 template <typename T>
17168 int S<T>::R::i = 3;
17170 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17171 this context, we must resolve S<T>::R to an ordinary
17172 type, rather than a typename type.
17174 The reason we normally avoid resolving TYPENAME_TYPEs
17175 is that a specialization of `S' might render
17176 `S<T>::R' not a type. However, if `S' is
17177 specialized, then this `i' will not be used, so there
17178 is no harm in resolving the types here. */
17179 tree type;
17181 /* Resolve the TYPENAME_TYPE. */
17184 /* If that failed, the declarator is invalid. */
17186 {
17189 "cannot define member of dependent typedef "
17191 else
17196 }
17198 }
17203 {
17204 tree class_type;
17209 else
17213 {
17216 {
17219 {
17223 "use %<%T::%D%> instead of %<%T::%D%> to "
17225 class_type,
17230 }
17231 else
17233 }
17234 else
17235 {
17236 /* We do not attempt to print the declarator
17237 here because we do not have enough
17238 information about its original syntactic
17239 form. */
17243 }
17244 }
17247 {
17253 for an anonymous type, even if the type
17254 got a name for linkage purposes. */
17257 class_type))
17258 {
17261 }
17269 }
17270 }
17272 unqualified_name,
17273 sfk);
17280 }
17282 handle_declarator:;
17285 {
17286 /* Any names that appear after the declarator-id for a
17287 member are looked up in the containing scope. */
17289 {
17290 /* But declarations with qualified-ids can't appear in a
17291 function. */
17294 }
17296 }
17300 /* Default args are only allowed on function
17301 declarations. */
17303 else
17307 }
17308 /* We're done. */
17309 else
17311 }
17313 /* For an abstract declarator, we might wind up with nothing at this
17314 point. That's an error; the declarator is not optional. */
17318 /* If we entered a scope, we must exit it now. */
17326 }
17328 /* Parse a ptr-operator.
17330 ptr-operator:
17331 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17332 * cv-qualifier-seq [opt]
17333 &
17334 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17335 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17337 GNU Extension:
17339 ptr-operator:
17340 & cv-qualifier-seq [opt]
17342 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17343 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17344 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17345 filled in with the TYPE containing the member. *CV_QUALS is
17346 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17347 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17348 Note that the tree codes returned by this function have nothing
17349 to do with the types of trees that will be eventually be created
17350 to represent the pointer or reference type being parsed. They are
17351 just constants with suggestive names. */
17352 static enum tree_code
17357 {
17362 /* Assume that it's not a pointer-to-member. */
17364 /* And that there are no cv-qualifiers. */
17367 /* Peek at the next token. */
17370 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17380 {
17381 /* Consume the `*', `&' or `&&'. */
17384 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17385 `&', if we are allowing GNU extensions. (The only qualifier
17386 that can legally appear after `&' is `restrict', but that is
17387 enforced during semantic analysis. */
17395 }
17396 else
17397 {
17398 /* Try the pointer-to-member case. */
17400 /* Look for the optional `::' operator. */
17403 /* Look for the nested-name specifier. */
17410 /* If we found it, and the next token is a `*', then we are
17411 indeed looking at a pointer-to-member operator. */
17414 {
17415 /* Indicate that the `*' operator was used. */
17423 else
17424 {
17425 /* The type of which the member is a member is given by the
17426 current SCOPE. */
17428 /* The next name will not be qualified. */
17432 /* Look for optional c++11 attributes. */
17436 /* Look for the optional cv-qualifier-seq. */
17438 }
17439 }
17440 /* If that didn't work we don't have a ptr-operator. */
17443 }
17446 }
17448 /* Parse an (optional) cv-qualifier-seq.
17450 cv-qualifier-seq:
17451 cv-qualifier cv-qualifier-seq [opt]
17453 cv-qualifier:
17454 const
17455 volatile
17457 GNU Extension:
17459 cv-qualifier:
17460 __restrict__
17462 Returns a bitmask representing the cv-qualifiers. */
17464 static cp_cv_quals
17466 {
17470 {
17472 cp_cv_quals cv_qualifier;
17474 /* Peek at the next token. */
17476 /* See if it's a cv-qualifier. */
17478 {
17494 }
17500 {
17503 }
17504 else
17505 {
17508 }
17509 }
17512 }
17514 /* Parse an (optional) ref-qualifier
17516 ref-qualifier:
17517 &
17518 &&
17520 Returns cp_ref_qualifier representing ref-qualifier. */
17522 static cp_ref_qualifier
17524 {
17527 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17532 {
17537 {
17549 }
17554 {
17557 }
17558 else
17559 {
17562 }
17563 }
17566 }
17568 /* Parse an (optional) virt-specifier-seq.
17570 virt-specifier-seq:
17571 virt-specifier virt-specifier-seq [opt]
17573 virt-specifier:
17574 override
17575 final
17577 Returns a bitmask representing the virt-specifiers. */
17579 static cp_virt_specifiers
17581 {
17585 {
17587 cp_virt_specifiers virt_specifier;
17589 /* Peek at the next token. */
17591 /* See if it's a virt-specifier-qualifier. */
17595 {
17598 }
17600 {
17603 }
17605 {
17607 }
17608 else
17612 {
17615 }
17616 else
17617 {
17620 }
17621 }
17623 }
17625 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
17626 is in scope even though it isn't real. */
17628 static void
17630 {
17631 tree this_parm;
17634 {
17635 /* We don't clear this between NSDMIs. Is it already what we want? */
17640 }
17643 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
17645 current_class_ref
17648 }
17650 /* Return true iff our current scope is a non-static data member
17651 initializer. */
17653 bool
17655 {
17656 /* We recognize NSDMI context by the context-less 'this' pointer set up
17657 by the function above. */
17661 }
17663 /* Parse a late-specified return type, if any. This is not a separate
17664 non-terminal, but part of a function declarator, which looks like
17666 -> trailing-type-specifier-seq abstract-declarator(opt)
17668 Returns the type indicated by the type-id.
17670 In addition to this this parses any queued up omp declare simd
17671 clauses.
17673 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
17674 function. */
17676 static tree
17678 cp_cv_quals quals)
17679 {
17683 && declarator
17686 /* Peek at the next token. */
17688 /* A late-specified return type is indicated by an initial '->'. */
17695 {
17696 /* DR 1207: 'this' is in scope in the trailing return type. */
17698 }
17701 {
17702 /* Consume the ->. */
17706 }
17709 declarator->std_attributes
17714 {
17717 }
17720 }
17722 /* Parse a declarator-id.
17724 declarator-id:
17725 id-expression
17726 :: [opt] nested-name-specifier [opt] type-name
17728 In the `id-expression' case, the value returned is as for
17729 cp_parser_id_expression if the id-expression was an unqualified-id.
17730 If the id-expression was a qualified-id, then a SCOPE_REF is
17731 returned. The first operand is the scope (either a NAMESPACE_DECL
17732 or TREE_TYPE), but the second is still just a representation of an
17733 unqualified-id. */
17735 static tree
17737 {
17738 tree id;
17739 /* The expression must be an id-expression. Assume that qualified
17740 names are the names of types so that:
17742 template <class T>
17743 int S<T>::R::i = 3;
17745 will work; we must treat `S<T>::R' as the name of a type.
17746 Similarly, assume that qualified names are templates, where
17747 required, so that:
17749 template <class T>
17750 int S<T>::R<T>::i = 3;
17752 will work, too. */
17758 optional_p);
17762 }
17764 /* Parse a type-id.
17766 type-id:
17767 type-specifier-seq abstract-declarator [opt]
17769 Returns the TYPE specified. */
17771 static tree
17774 {
17775 cp_decl_specifier_seq type_specifier_seq;
17778 /* Parse the type-specifier-seq. */
17780 is_trailing_return,
17785 /* There might or might not be an abstract declarator. */
17787 /* Look for the declarator. */
17788 abstract_declarator
17792 /* Check to see if there really was a declarator. */
17799 {
17800 /* A type-id with type 'auto' is only ok if the abstract declarator
17801 is a function declarator with a late-specified return type. */
17806 else
17807 {
17810 }
17811 }
17814 is_template_arg);
17815 }
17818 {
17820 }
17823 {
17824 tree r;
17826 parser->type_definition_forbidden_message
17831 }
17834 {
17836 }
17838 /* Parse a type-specifier-seq.
17840 type-specifier-seq:
17841 type-specifier type-specifier-seq [opt]
17843 GNU extension:
17845 type-specifier-seq:
17846 attributes type-specifier-seq [opt]
17848 If IS_DECLARATION is true, we are at the start of a "condition" or
17849 exception-declaration, so we might be followed by a declarator-id.
17851 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
17852 i.e. we've just seen "->".
17854 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
17856 static void
17861 {
17866 /* Clear the TYPE_SPECIFIER_SEQ. */
17869 /* In the context of a trailing return type, enum E { } is an
17870 elaborated-type-specifier followed by a function-body, not an
17871 enum-specifier. */
17875 /* Parse the type-specifiers and attributes. */
17877 {
17878 tree type_specifier;
17881 /* Check for attributes first. */
17883 {
17888 }
17890 /* record the token of the beginning of the type specifier seq,
17891 for error reporting purposes*/
17895 /* Look for the type-specifier. */
17897 flags,
17898 type_specifier_seq,
17900 NULL,
17903 {
17904 /* If the first type-specifier could not be found, this is not a
17905 type-specifier-seq at all. */
17907 {
17911 }
17912 /* If subsequent type-specifiers could not be found, the
17913 type-specifier-seq is complete. */
17915 }
17918 /* The standard says that a condition can be:
17920 type-specifier-seq declarator = assignment-expression
17922 However, given:
17924 struct S {};
17925 if (int S = ...)
17927 we should treat the "S" as a declarator, not as a
17928 type-specifier. The standard doesn't say that explicitly for
17929 type-specifier-seq, but it does say that for
17930 decl-specifier-seq in an ordinary declaration. Perhaps it
17931 would be clearer just to allow a decl-specifier-seq here, and
17932 then add a semantic restriction that if any decl-specifiers
17933 that are not type-specifiers appear, the program is invalid. */
17936 }
17937 }
17939 /* Parse a parameter-declaration-clause.
17941 parameter-declaration-clause:
17942 parameter-declaration-list [opt] ... [opt]
17943 parameter-declaration-list , ...
17945 Returns a representation for the parameter declarations. A return
17946 value of NULL indicates a parameter-declaration-clause consisting
17947 only of an ellipsis. */
17949 static tree
17951 {
17952 tree parameters;
17957 /* Peek at the next token. */
17959 /* Check for trivial parameter-declaration-clauses. */
17961 {
17962 /* Consume the `...' token. */
17965 }
17967 /* There are no parameters. */
17968 {
17969 #ifndef NO_IMPLICIT_EXTERN_C
17973 else
17974 #endif
17976 }
17977 /* Check for `(void)', too, which is a special case. */
17981 {
17982 /* Consume the `void' token. */
17984 /* There are no parameters. */
17986 }
17988 /* Parse the parameter-declaration-list. */
17990 /* If a parse error occurred while parsing the
17991 parameter-declaration-list, then the entire
17992 parameter-declaration-clause is erroneous. */
17996 /* Peek at the next token. */
17998 /* If it's a `,', the clause should terminate with an ellipsis. */
18000 {
18001 /* Consume the `,'. */
18003 /* Expect an ellipsis. */
18004 ellipsis_p
18006 }
18007 /* It might also be `...' if the optional trailing `,' was
18008 omitted. */
18010 {
18011 /* Consume the `...' token. */
18013 /* And remember that we saw it. */
18015 }
18016 else
18019 /* Finish the parameter list. */
18024 }
18026 /* Parse a parameter-declaration-list.
18028 parameter-declaration-list:
18029 parameter-declaration
18030 parameter-declaration-list , parameter-declaration
18032 Returns a representation of the parameter-declaration-list, as for
18033 cp_parser_parameter_declaration_clause. However, the
18034 `void_list_node' is never appended to the list. Upon return,
18035 *IS_ERROR will be true iff an error occurred. */
18037 static tree
18039 {
18046 /* Assume all will go well. */
18048 /* The special considerations that apply to a function within an
18049 unbraced linkage specifications do not apply to the parameters
18050 to the function. */
18051 saved_in_unbraced_linkage_specification_p
18055 /* Look for more parameters. */
18057 {
18061 /* Parse the parameter. */
18062 parameter
18067 /* We don't know yet if the enclosing context is deprecated, so wait
18068 and warn in grokparms if appropriate. */
18072 {
18075 PARM,
18083 }
18087 /* If a parse error occurred parsing the parameter declaration,
18088 then the entire parameter-declaration-list is erroneous. */
18090 {
18094 }
18104 {
18108 }
18110 /* Add the new parameter to the list. */
18114 /* Peek at the next token. */
18117 /* These are for Objective-C++ */
18120 /* The parameter-declaration-list is complete. */
18123 {
18126 /* Peek at the next token. */
18128 /* If it's an ellipsis, then the list is complete. */
18131 /* Otherwise, there must be more parameters. Consume the
18132 `,'. */
18134 /* When parsing something like:
18136 int i(float f, double d)
18138 we can tell after seeing the declaration for "f" that we
18139 are not looking at an initialization of a variable "i",
18140 but rather at the declaration of a function "i".
18142 Due to the fact that the parsing of template arguments
18143 (as specified to a template-id) requires backtracking we
18144 cannot use this technique when inside a template argument
18145 list. */
18149 /* However, a parameter-declaration of the form
18150 "float(f)" (which is a valid declaration of a
18151 parameter "f") can also be interpreted as an
18152 expression (the conversion of "f" to "float"). */
18155 }
18156 else
18157 {
18165 }
18166 }
18168 parser->in_unbraced_linkage_specification_p
18173 implicit_template_parms,
18174 parameters);
18177 }
18179 /* Parse a parameter declaration.
18181 parameter-declaration:
18182 decl-specifier-seq ... [opt] declarator
18183 decl-specifier-seq declarator = assignment-expression
18184 decl-specifier-seq ... [opt] abstract-declarator [opt]
18185 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18187 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18188 declares a template parameter. (In that case, a non-nested `>'
18189 token encountered during the parsing of the assignment-expression
18190 is not interpreted as a greater-than operator.)
18192 Returns a representation of the parameter, or NULL if an error
18193 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18194 true iff the declarator is of the form "(p)". */
18200 {
18202 cp_decl_specifier_seq decl_specifiers;
18204 tree default_argument;
18208 /* In a template parameter, `>' is not an operator.
18210 [temp.param]
18212 When parsing a default template-argument for a non-type
18213 template-parameter, the first non-nested `>' is taken as the end
18214 of the template parameter-list rather than a greater-than
18215 operator. */
18217 /* Type definitions may not appear in parameter types. */
18219 parser->type_definition_forbidden_message
18222 /* Parse the declaration-specifiers. */
18224 CP_PARSER_FLAGS_NONE,
18228 /* Complain about missing 'typename' or other invalid type names. */
18233 /* If an error occurred, there's no reason to attempt to parse the
18234 rest of the declaration. */
18236 {
18239 }
18241 /* Peek at the next token. */
18244 /* If the next token is a `)', `,', `=', `>', or `...', then there
18245 is no declarator. However, when variadic templates are enabled,
18246 there may be a declarator following `...'. */
18251 {
18255 }
18256 /* Otherwise, there should be a declarator. */
18257 else
18258 {
18262 /* After seeing a decl-specifier-seq, if the next token is not a
18263 "(", there is no possibility that the code is a valid
18264 expression. Therefore, if parsing tentatively, we commit at
18265 this point. */
18267 /* In an expression context, having seen:
18269 (int((char ...
18271 we cannot be sure whether we are looking at a
18272 function-type (taking a "char" as a parameter) or a cast
18273 of some object of type "char" to "int". */
18279 /* Parse the declarator. */
18282 CP_PARSER_DECLARATOR_EITHER,
18284 parenthesized_p,
18287 /* After the declarator, allow more attributes. */
18288 decl_specifiers.attributes
18291 }
18293 /* If the next token is an ellipsis, and we have not seen a
18294 declarator name, and the type of the declarator contains parameter
18295 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18296 a parameter pack expansion expression. Otherwise, leave the
18297 ellipsis for a C-style variadic function. */
18300 {
18311 {
18312 /* Consume the `...'. */
18316 /* Build a pack expansion type */
18319 else
18321 }
18322 }
18324 /* The restriction on defining new types applies only to the type
18325 of the parameter, not to the default argument. */
18328 /* If the next token is `=', then process a default argument. */
18330 {
18332 /* If we are defining a class, then the tokens that make up the
18333 default argument must be saved and processed later. */
18338 /* Outside of a class definition, we can just parse the
18339 assignment-expression. */
18340 else
18341 default_argument
18345 {
18348 else
18349 {
18351 "default arguments are only "
18354 }
18355 }
18359 {
18360 /* Find the name of the parameter pack. */
18367 template_parm_p
18373 else
18375 template_parm_p
18382 }
18383 }
18384 else
18388 declarator,
18389 default_argument);
18390 }
18392 /* Parse a default argument and return it.
18394 TEMPLATE_PARM_P is true if this is a default argument for a
18395 non-type template parameter. */
18396 static tree
18398 {
18404 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18405 set correctly. */
18408 /* Local variable names (and the `this' keyword) may not
18409 appear in a default argument. */
18412 /* Parse the assignment-expression. */
18415 default_argument
18425 }
18427 /* Parse a function-body.
18429 function-body:
18430 compound_statement */
18432 static void
18434 {
18436 }
18438 /* Parse a ctor-initializer-opt followed by a function-body. Return
18439 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18440 is true we are parsing a function-try-block. */
18442 static bool
18445 {
18453 /* Begin the function body. */
18455 /* Parse the optional ctor-initializer. */
18458 /* If we're parsing a constexpr constructor definition, we need
18459 to check that the constructor body is indeed empty. However,
18460 before we get to cp_parser_function_body lot of junk has been
18461 generated, so we can't just check that we have an empty block.
18462 Rather we take a snapshot of the outermost block, and check whether
18463 cp_parser_function_body changed its state. */
18465 {
18469 }
18470 /* Parse the function-body. */
18474 /* Finish the function body. */
18478 }
18480 /* Parse an initializer.
18482 initializer:
18483 = initializer-clause
18484 ( expression-list )
18486 Returns an expression representing the initializer. If no
18487 initializer is present, NULL_TREE is returned.
18489 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
18490 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
18491 set to TRUE if there is no initializer present. If there is an
18492 initializer, and it is not a constant-expression, *NON_CONSTANT_P
18493 is set to true; otherwise it is set to false. */
18495 static tree
18498 {
18500 tree init;
18502 /* Peek at the next token. */
18505 /* Let our caller know whether or not this initializer was
18506 parenthesized. */
18508 /* Assume that the initializer is constant. */
18512 {
18513 /* Consume the `='. */
18515 /* Parse the initializer-clause. */
18517 }
18519 {
18524 non_constant_p);
18529 }
18531 {
18535 }
18536 else
18537 {
18538 /* Anything else is an error. */
18541 }
18544 }
18546 /* Parse an initializer-clause.
18548 initializer-clause:
18549 assignment-expression
18550 braced-init-list
18552 Returns an expression representing the initializer.
18554 If the `assignment-expression' production is used the value
18555 returned is simply a representation for the expression.
18557 Otherwise, calls cp_parser_braced_list. */
18559 static tree
18561 {
18562 tree initializer;
18564 /* Assume the expression is constant. */
18567 /* If it is not a `{', then we are looking at an
18568 assignment-expression. */
18570 {
18571 initializer
18574 non_constant_p);
18575 }
18576 else
18580 }
18582 /* Parse a brace-enclosed initializer list.
18584 braced-init-list:
18585 { initializer-list , [opt] }
18586 { }
18588 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
18589 the elements of the initializer-list (or NULL, if the last
18590 production is used). The TREE_TYPE for the CONSTRUCTOR will be
18591 NULL_TREE. There is no way to detect whether or not the optional
18592 trailing `,' was provided. NON_CONSTANT_P is as for
18593 cp_parser_initializer. */
18595 static tree
18597 {
18598 tree initializer;
18600 /* Consume the `{' token. */
18602 /* Create a CONSTRUCTOR to represent the braced-initializer. */
18604 /* If it's not a `}', then there is a non-trivial initializer. */
18606 {
18607 /* Parse the initializer list. */
18610 /* A trailing `,' token is allowed. */
18613 }
18614 else
18616 /* Now, there should be a trailing `}'. */
18620 }
18622 /* Parse an initializer-list.
18624 initializer-list:
18625 initializer-clause ... [opt]
18626 initializer-list , initializer-clause ... [opt]
18628 GNU Extension:
18630 initializer-list:
18631 designation initializer-clause ...[opt]
18632 initializer-list , designation initializer-clause ...[opt]
18634 designation:
18635 . identifier =
18636 identifier :
18637 [ constant-expression ] =
18639 Returns a vec of constructor_elt. The VALUE of each elt is an expression
18640 for the initializer. If the INDEX of the elt is non-NULL, it is the
18641 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
18642 as for cp_parser_initializer. */
18646 {
18649 /* Assume all of the expressions are constant. */
18652 /* Parse the rest of the list. */
18654 {
18656 tree designator;
18657 tree initializer;
18660 /* If the next token is an identifier and the following one is a
18661 colon, we are looking at the GNU designated-initializer
18662 syntax. */
18666 {
18667 /* Warn the user that they are using an extension. */
18670 /* Consume the identifier. */
18672 /* Consume the `:'. */
18674 }
18675 /* Also handle the C99 syntax, '. id ='. */
18680 {
18681 /* Warn the user that they are using an extension. */
18684 /* Consume the `.'. */
18686 /* Consume the identifier. */
18688 /* Consume the `='. */
18690 }
18691 /* Also handle C99 array designators, '[ const ] ='. */
18695 {
18696 /* In C++11, [ could start a lambda-introducer. */
18708 }
18709 else
18712 /* Parse the initializer. */
18715 /* If any clause is non-constant, so is the entire initializer. */
18719 /* If we have an ellipsis, this is an initializer pack
18720 expansion. */
18722 {
18723 /* Consume the `...'. */
18726 /* Turn the initializer into an initializer expansion. */
18728 }
18730 /* Add it to the vector. */
18733 /* If the next token is not a comma, we have reached the end of
18734 the list. */
18738 /* Peek at the next token. */
18740 /* If the next token is a `}', then we're still done. An
18741 initializer-clause can have a trailing `,' after the
18742 initializer-list and before the closing `}'. */
18746 /* Consume the `,' token. */
18748 }
18751 }
18753 /* Classes [gram.class] */
18755 /* Parse a class-name.
18757 class-name:
18758 identifier
18759 template-id
18761 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
18762 to indicate that names looked up in dependent types should be
18763 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
18764 keyword has been used to indicate that the name that appears next
18765 is a template. TAG_TYPE indicates the explicit tag given before
18766 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
18767 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
18768 is the class being defined in a class-head.
18770 Returns the TYPE_DECL representing the class. */
18772 static tree
18780 {
18781 tree decl;
18782 tree scope;
18787 /* All class-names start with an identifier. */
18790 {
18793 }
18795 /* PARSER->SCOPE can be cleared when parsing the template-arguments
18796 to a template-id, so we save it here. */
18801 /* Any name names a type if we're following the `typename' keyword
18802 in a qualified name where the enclosing scope is type-dependent. */
18805 /* Handle the common case (an identifier, but not a template-id)
18806 efficiently. */
18809 {
18813 /* Look for the identifier. */
18817 /* If the next token isn't an identifier, we are certainly not
18818 looking at a class-name. */
18821 /* If we know this is a type-name, there's no need to look it
18822 up. */
18825 else
18826 {
18827 tree ambiguous_decls;
18828 /* If we already know that this lookup is ambiguous, then
18829 we've already issued an error message; there's no reason
18830 to check again. */
18832 {
18835 }
18836 /* If the next token is a `::', then the name must be a type
18837 name.
18839 [basic.lookup.qual]
18841 During the lookup for a name preceding the :: scope
18842 resolution operator, object, function, and enumerator
18843 names are ignored. */
18846 /* Look up the name. */
18848 tag_type,
18851 check_dependency_p,
18855 {
18859 }
18860 }
18861 }
18862 else
18863 {
18864 /* Try a template-id. */
18866 check_dependency_p,
18867 tag_type,
18868 is_declaration);
18871 }
18875 /* If this is a typename, create a TYPENAME_TYPE. */
18877 {
18882 }
18886 /* Check to see that it is really the name of a class. */
18890 /* Situations like this:
18892 template <typename T> struct A {
18893 typename T::template X<int>::I i;
18894 };
18896 are problematic. Is `T::template X<int>' a class-name? The
18897 standard does not seem to be definitive, but there is no other
18898 valid interpretation of the following `::'. Therefore, those
18899 names are considered class-names. */
18900 {
18904 }
18908 /* In Objective-C 2.0, a classname followed by '.' starts a
18909 dot-syntax expression, and it's not a type-name. */
18921 }
18923 /* Parse a class-specifier.
18925 class-specifier:
18926 class-head { member-specification [opt] }
18928 Returns the TREE_TYPE representing the class. */
18930 static tree
18932 {
18933 tree type;
18947 /* Parse the class-head. */
18950 /* If the class-head was a semantic disaster, skip the entire body
18951 of the class. */
18953 {
18957 }
18959 /* Look for the `{'. */
18961 {
18964 }
18968 /* Issue an error message if type-definitions are forbidden here. */
18970 /* Remember that we are defining one more class. */
18972 /* Inside the class, surrounding template-parameter-lists do not
18973 apply. */
18974 saved_num_template_parameter_lists
18977 /* We are not in a function body. */
18980 /* Or in a loop. */
18983 /* Or in a switch. */
18986 /* We are not immediately inside an extern "lang" block. */
18987 saved_in_unbraced_linkage_specification_p
18991 /* Start the class. */
18993 {
18996 }
19000 /* If the type is erroneous, skip the entire body of the class. */
19002 else
19003 /* Parse the member-specification. */
19006 /* Look for the trailing `}'. */
19008 /* Look for trailing attributes to apply to this class. */
19016 /* We've finished a type definition. Check for the common syntax
19017 error of forgetting a semicolon after the definition. We need to
19018 be careful, as we can't just check for not-a-semicolon and be done
19019 with it; the user might have typed:
19021 class X { } c = ...;
19022 class X { } *p = ...;
19024 and so forth. Instead, enumerate all the possible tokens that
19025 might follow this production; if we don't see one of them, then
19026 complain and silently insert the semicolon. */
19027 {
19032 /* Don't try to parse c++11 attributes here. As per the
19033 grammar, that should be a task for
19034 cp_parser_decl_specifier_seq. */
19038 {
19049 /* While it's legal for type qualifiers and storage class
19050 specifiers to follow type definitions in the grammar, only
19051 compiler testsuites contain code like that. Assume that if
19052 we see such code, then what we're really seeing is a case
19053 like:
19055 class X { }
19056 const <type> var = ...;
19058 or
19060 class Y { }
19061 static <type> func (...) ...
19063 i.e. the qualifier or specifier applies to the next
19064 declaration. To do so, however, we need to look ahead one
19065 more token to see if *that* token is a type specifier.
19067 This code could be improved to handle:
19069 class Z { }
19070 static const <type> var = ...; */
19073 {
19076 /* Handling user-defined types here would be nice, but very
19077 tricky. */
19078 want_semicolon
19081 }
19085 }
19087 /* If we don't have a type, then something is very wrong and we
19088 shouldn't try to do anything clever. Likewise for not seeing the
19089 closing brace. */
19091 {
19092 cp_token_position prev
19103 else
19106 /* Unget one token and smash it to look as though we encountered
19107 a semicolon in the input stream. */
19112 }
19113 }
19115 /* If this class is not itself within the scope of another class,
19116 then we need to parse the bodies of all of the queued function
19117 definitions. Note that the queued functions defined in a class
19118 are not always processed immediately following the
19119 class-specifier for that class. Consider:
19121 struct A {
19122 struct B { void f() { sizeof (A); } };
19123 };
19125 If `f' were processed before the processing of `A' were
19126 completed, there would be no way to compute the size of `A'.
19127 Note that the nesting we are interested in here is lexical --
19128 not the semantic nesting given by TYPE_CONTEXT. In particular,
19129 for:
19131 struct A { struct B; };
19132 struct A::B { void f() { } };
19134 there is no need to delay the parsing of `A::B::f'. */
19136 {
19137 tree decl;
19144 /* In a first pass, parse default arguments to the functions.
19145 Then, in a second pass, parse the bodies of the functions.
19146 This two-phased approach handles cases like:
19148 struct S {
19149 void f() { g(); }
19150 void g(int i = 3);
19151 };
19153 */
19155 {
19157 /* If there are default arguments that have not yet been processed,
19158 take care of them now. */
19160 {
19165 }
19166 /* Make sure that any template parameters are in scope. */
19168 /* Parse the default argument expressions. */
19170 /* Remove any template parameters from the symbol table. */
19172 }
19174 /* Now parse any NSDMIs. */
19178 {
19180 {
19185 }
19188 }
19194 /* Now parse the body of the functions. */
19196 {
19197 /* OpenMP UDRs need to be parsed before all other functions. */
19204 }
19205 else
19209 }
19211 /* Put back any saved access checks. */
19214 /* Restore saved state. */
19218 parser->num_template_parameter_lists
19220 parser->in_unbraced_linkage_specification_p
19224 }
19226 static tree
19228 {
19229 tree ret;
19234 }
19236 /* Parse a class-head.
19238 class-head:
19239 class-key identifier [opt] base-clause [opt]
19240 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19241 class-key nested-name-specifier [opt] template-id
19242 base-clause [opt]
19244 class-virt-specifier:
19245 final
19247 GNU Extensions:
19248 class-key attributes identifier [opt] base-clause [opt]
19249 class-key attributes nested-name-specifier identifier base-clause [opt]
19250 class-key attributes nested-name-specifier [opt] template-id
19251 base-clause [opt]
19253 Upon return BASES is initialized to the list of base classes (or
19254 NULL, if there are none) in the same form returned by
19255 cp_parser_base_clause.
19257 Returns the TYPE of the indicated class. Sets
19258 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19259 involving a nested-name-specifier was used, and FALSE otherwise.
19261 Returns error_mark_node if this is not a class-head.
19263 Returns NULL_TREE if the class-head is syntactically valid, but
19264 semantically invalid in a way that means we should skip the entire
19265 body of the class. */
19267 static tree
19270 {
19271 tree nested_name_specifier;
19275 tree attributes;
19276 tree bases;
19286 /* Assume no nested-name-specifier will be present. */
19288 /* Assume no template parameter lists will be used in defining the
19289 type. */
19293 /* Look for the class-key. */
19298 /* Parse the attributes. */
19301 /* If the next token is `::', that is invalid -- but sometimes
19302 people do try to write:
19304 struct ::S {};
19306 Handle this gracefully by accepting the extra qualifier, and then
19307 issuing an error about it later if this really is a
19308 class-head. If it turns out just to be an elaborated type
19309 specifier, remain silent. */
19315 /* Determine the name of the class. Begin by looking for an
19316 optional nested-name-specifier. */
19318 nested_name_specifier
19324 /* If there was a nested-name-specifier, then there *must* be an
19325 identifier. */
19327 {
19329 /* Although the grammar says `identifier', it really means
19330 `class-name' or `template-name'. You are only allowed to
19331 define a class that has already been declared with this
19332 syntax.
19334 The proposed resolution for Core Issue 180 says that wherever
19335 you see `class T::X' you should treat `X' as a type-name.
19337 It is OK to define an inaccessible class; for example:
19339 class A { class B; };
19340 class A::B {};
19342 We do not know if we will see a class-name, or a
19343 template-name. We look for a class-name first, in case the
19344 class-name is a template-id; if we looked for the
19345 template-name first we would stop after the template-name. */
19350 class_type,
19354 /* If that didn't work, ignore the nested-name-specifier. */
19356 {
19362 }
19363 /* If we could not find a corresponding TYPE, treat this
19364 declaration like an unqualified declaration. */
19367 /* Otherwise, count the number of templates used in TYPE and its
19368 containing scopes. */
19369 else
19370 {
19371 tree scope;
19383 }
19384 }
19385 /* Otherwise, the identifier is optional. */
19386 else
19387 {
19388 /* We don't know whether what comes next is a template-id,
19389 an identifier, or nothing at all. */
19391 /* Check for a template-id. */
19396 class_key,
19398 /* If that didn't work, it could still be an identifier. */
19400 {
19402 {
19405 }
19406 else
19408 }
19409 else
19410 {
19413 }
19414 }
19419 {
19421 class_key,
19423 }
19426 /* If it's not a `:' or a `{' then we can't really be looking at a
19427 class-head, since a class-head only appears as part of a
19428 class-specifier. We have to detect this situation before calling
19429 xref_tag, since that has irreversible side-effects. */
19431 {
19435 }
19437 /* At this point, we're going ahead with the class-specifier, even
19438 if some other problem occurs. */
19441 {
19446 }
19447 /* Issue the error about the overly-qualified name now. */
19449 {
19454 }
19456 {
19461 }
19463 {
19464 tree scope;
19466 /* Reject typedef-names in class heads. */
19468 {
19471 type);
19474 }
19476 /* Figure out in what scope the declaration is being placed. */
19478 /* If that scope does not contain the scope in which the
19479 class was originally declared, the program is invalid. */
19481 {
19484 "declaration of %qD in namespace %qD which does not "
19487 else
19493 }
19494 /* [dcl.meaning]
19496 A declarator-id shall not be qualified except for the
19497 definition of a ... nested class outside of its class
19498 ... [or] the definition or explicit instantiation of a
19499 class member of a namespace outside of its namespace. */
19501 {
19506 }
19507 }
19508 /* An explicit-specialization must be preceded by "template <>". If
19509 it is not, try to recover gracefully. */
19513 {
19517 /* Take the same action that would have been taken by
19518 cp_parser_explicit_specialization. */
19521 }
19522 /* There must be no "return" statements between this point and the
19523 end of this function; set "type "to the correct return value and
19524 use "goto done;" to return. */
19525 /* Make sure that the right number of template parameters were
19526 present. */
19530 {
19531 /* If something went wrong, there is no point in even trying to
19532 process the class-definition. */
19535 }
19537 /* Look up the type. */
19539 {
19543 {
19547 }
19548 else
19549 {
19552 }
19555 }
19557 {
19558 tree class_type;
19560 /* Given:
19562 template <typename T> struct S { struct T };
19563 template <typename T> struct S<T>::T { };
19565 we will get a TYPENAME_TYPE when processing the definition of
19566 `S::T'. We need to resolve it to the actual type before we
19567 try to define it. */
19569 {
19574 else
19575 {
19578 }
19579 }
19583 {
19586 }
19589 /* Enter the scope indicated by the nested-name-specifier. */
19591 /* Get the canonical version of this type. */
19595 {
19598 {
19601 }
19602 }
19606 }
19608 {
19609 /* If the class was unnamed, create a dummy name. */
19614 }
19616 /* Indicate whether this class was declared as a `class' or as a
19617 `struct'. */
19622 /* If this type was already complete, and we see another definition,
19623 that's an error. */
19625 {
19627 type);
19629 type);
19632 }
19637 {
19638 /* Apply attributes now, before any use of the class as a template
19639 argument in its base list. */
19642 }
19644 /* We will have entered the scope containing the class; the names of
19645 base classes should be looked up in that context. For example:
19647 struct A { struct B {}; struct C; };
19648 struct A::C : B {};
19650 is valid. */
19652 /* Get the list of base-classes, if there is one. */
19655 else
19658 /* If we're really defining a class, process the base classes.
19659 If they're invalid, fail. */
19664 done:
19665 /* Leave the scope given by the nested-name-specifier. We will
19666 enter the class scope itself while processing the members. */
19671 {
19674 }
19680 out:
19683 }
19685 /* Parse a class-key.
19687 class-key:
19688 class
19689 struct
19690 union
19692 Returns the kind of class-key specified, or none_type to indicate
19693 error. */
19695 static enum tag_types
19697 {
19701 /* Look for the class-key. */
19706 /* Check to see if the TOKEN is a class-key. */
19711 }
19713 /* Parse an (optional) member-specification.
19715 member-specification:
19716 member-declaration member-specification [opt]
19717 access-specifier : member-specification [opt] */
19719 static void
19721 {
19723 {
19727 /* Peek at the next token. */
19729 /* If it's a `}', or EOF then we've seen all the members. */
19735 /* See if this token is a keyword. */
19738 {
19742 /* Consume the access-specifier. */
19744 /* Remember which access-specifier is active. */
19746 /* Look for the `:'. */
19751 /* Accept #pragmas at class scope. */
19753 {
19756 }
19758 /* Otherwise, the next construction must be a
19759 member-declaration. */
19761 }
19762 }
19763 }
19765 /* Parse a member-declaration.
19767 member-declaration:
19768 decl-specifier-seq [opt] member-declarator-list [opt] ;
19769 function-definition ; [opt]
19770 :: [opt] nested-name-specifier template [opt] unqualified-id ;
19771 using-declaration
19772 template-declaration
19773 alias-declaration
19775 member-declarator-list:
19776 member-declarator
19777 member-declarator-list , member-declarator
19779 member-declarator:
19780 declarator pure-specifier [opt]
19781 declarator constant-initializer [opt]
19782 identifier [opt] : constant-expression
19784 GNU Extensions:
19786 member-declaration:
19787 __extension__ member-declaration
19789 member-declarator:
19790 declarator attributes [opt] pure-specifier [opt]
19791 declarator attributes [opt] constant-initializer [opt]
19792 identifier [opt] attributes [opt] : constant-expression
19794 C++0x Extensions:
19796 member-declaration:
19797 static_assert-declaration */
19799 static void
19801 {
19802 cp_decl_specifier_seq decl_specifiers;
19803 tree prefix_attributes;
19804 tree decl;
19813 /* Check for the `__extension__' keyword. */
19815 {
19816 /* Recurse. */
19818 /* Restore the old value of the PEDANTIC flag. */
19822 }
19824 /* Check for a template-declaration. */
19826 {
19827 /* An explicit specialization here is an error condition, and we
19828 expect the specialization handler to detect and report this. */
19832 else
19836 }
19838 /* Check for a using-declaration. */
19840 {
19842 {
19843 /* Parse the using-declaration. */
19847 }
19848 else
19849 {
19850 tree decl;
19854 /* Note that if we actually see the '=' token after the
19855 identifier, cp_parser_alias_declaration commits the
19856 tentative parse. In that case, we really expects an
19857 alias-declaration. Otherwise, we expect a using
19858 declaration. */
19859 alias_decl_expected =
19865 else
19869 }
19870 }
19872 /* Check for @defs. */
19874 {
19879 {
19884 }
19886 }
19888 /* If the next token is `static_assert' we have a static assertion. */
19890 {
19893 }
19900 /* Parse the decl-specifier-seq. */
19903 CP_PARSER_FLAGS_OPTIONAL,
19906 /* Check for an invalid type-name. */
19910 /* If there is no declarator, then the decl-specifier-seq should
19911 specify a type. */
19913 {
19914 /* If there was no decl-specifier-seq, and the next token is a
19915 `;', then we have something like:
19917 struct S { ; };
19919 [class.mem]
19921 Each member-declaration shall declare at least one member
19922 name of the class. */
19924 {
19928 }
19929 else
19930 {
19931 tree type;
19933 /* See if this declaration is a friend. */
19935 /* If there were decl-specifiers, check to see if there was
19936 a class-declaration. */
19939 /* Nested classes have already been added to the class, but
19940 a `friend' needs to be explicitly registered. */
19942 {
19943 /* If the `friend' keyword was present, the friend must
19944 be introduced with a class-key. */
19947 "in C++03 a class-key must be used "
19949 /* In this case:
19951 template <typename T> struct A {
19952 friend struct A<T>::B;
19953 };
19955 A<T>::B will be represented by a TYPENAME_TYPE, and
19956 therefore not recognized by check_tag_decl. */
19958 {
19962 }
19965 "friend declaration does not name a class or "
19967 else
19970 }
19971 /* If there is no TYPE, an error message will already have
19972 been issued. */
19974 ;
19975 /* An anonymous aggregate has to be handled specially; such
19976 a declaration really declares a data member (with a
19977 particular type), as opposed to a nested class. */
19979 {
19980 /* C++11 9.5/6. */
19983 "a storage class on an anonymous aggregate "
19986 /* Remove constructors and such from TYPE, now that we
19987 know it is an anonymous aggregate. */
19989 /* And make the corresponding data member. */
19992 /* Add it to the class. */
19994 }
19995 else
19996 cp_parser_check_access_in_redeclaration
19999 }
20000 }
20001 else
20002 {
20005 /* Clear attributes from the decl_specifiers but keep them
20006 around as prefix attributes that apply them to the entity
20007 being declared. */
20011 /* See if these declarations will be friends. */
20014 /* Keep going until we hit the `;' at the end of the
20015 declaration. */
20017 {
20019 tree first_attribute;
20021 /* Peek at the next token. */
20024 /* Check for a bitfield declaration. */
20029 {
20030 tree identifier;
20031 tree width;
20033 /* Get the name of the bitfield. Note that we cannot just
20034 check TOKEN here because it may have been invalidated by
20035 the call to cp_lexer_peek_nth_token above. */
20038 else
20041 /* Consume the `:' token. */
20043 /* Get the width of the bitfield. */
20044 width
20047 NULL);
20049 /* Look for attributes that apply to the bitfield. */
20051 /* Remember which attributes are prefix attributes and
20052 which are not. */
20054 /* Combine the attributes. */
20057 /* Create the bitfield declaration. */
20060 identifier,
20061 sfk_none)
20064 width,
20065 attributes);
20066 }
20067 else
20068 {
20070 tree initializer;
20071 tree asm_specification;
20074 /* Parse the declarator. */
20075 declarator
20081 /* If something went wrong parsing the declarator, make sure
20082 that we at least consume some tokens. */
20084 {
20085 /* Skip to the end of the statement. */
20087 /* If the next token is not a semicolon, that is
20088 probably because we just skipped over the body of
20089 a function. So, we consume a semicolon if
20090 present, but do not issue an error message if it
20091 is not present. */
20093 CPP_SEMICOLON))
20096 }
20099 cp_parser_check_for_definition_in_return_type
20103 /* Look for an asm-specification. */
20105 /* Look for attributes that apply to the declaration. */
20107 /* Remember which attributes are prefix attributes and
20108 which are not. */
20110 /* Combine the attributes. */
20113 /* If it's an `=', then we have a constant-initializer or a
20114 pure-specifier. It is not correct to parse the
20115 initializer before registering the member declaration
20116 since the member declaration should be in scope while
20117 its initializer is processed. However, the rest of the
20118 front end does not yet provide an interface that allows
20119 us to handle this correctly. */
20121 {
20122 /* In [class.mem]:
20124 A pure-specifier shall be used only in the declaration of
20125 a virtual function.
20127 A member-declarator can contain a constant-initializer
20128 only if it declares a static member of integral or
20129 enumeration type.
20131 Therefore, if the DECLARATOR is for a function, we look
20132 for a pure-specifier; otherwise, we look for a
20133 constant-initializer. When we call `grokfield', it will
20134 perform more stringent semantics checks. */
20146 {
20148 /* Don't require a constant rvalue in C++11, since we
20149 might want a reference constant. We'll enforce
20150 constancy later. */
20152 /* Parse the initializer. */
20155 }
20156 else
20157 /* Parse the initializer. */
20159 }
20162 {
20166 else
20168 }
20169 /* Otherwise, there is no initializer. */
20170 else
20173 /* See if we are probably looking at a function
20174 definition. We are certainly not looking at a
20175 member-declarator. Calling `grokfield' has
20176 side-effects, so we must not do it unless we are sure
20177 that we are looking at a member-declarator. */
20180 {
20181 /* The grammar does not allow a pure-specifier to be
20182 used when a member function is defined. (It is
20183 possible that this fact is an oversight in the
20184 standard, since a pure function may be defined
20185 outside of the class-specifier. */
20191 declarator,
20192 attributes);
20193 /* If the member was not a friend, declare it here. */
20195 {
20199 }
20200 /* Peek at the next token. */
20202 /* If the next token is a semicolon, consume it. */
20206 }
20207 else
20210 /* Create the declaration. */
20216 }
20220 /* Reset PREFIX_ATTRIBUTES. */
20226 /* If there is any qualification still in effect, clear it
20227 now; we will be starting fresh with the next declarator. */
20231 /* If it's a `,', then there are more declarators. */
20233 {
20236 {
20240 }
20241 }
20242 /* If the next token isn't a `;', then we have a parse error. */
20244 CPP_SEMICOLON))
20245 {
20246 /* The next token might be a ways away from where the
20247 actual semicolon is missing. Find the previous token
20248 and use that for our error position. */
20253 /* Assume that the user meant to provide a semicolon. If
20254 we were to cp_parser_skip_to_end_of_statement, we might
20255 skip to a semicolon inside a member function definition
20256 and issue nonsensical error messages. */
20258 }
20261 {
20262 /* Add DECL to the list of members. */
20271 /* Add DECL to the queue of NSDMI to be parsed later. */
20273 }
20277 }
20278 }
20281 out:
20283 }
20285 /* Parse a pure-specifier.
20287 pure-specifier:
20288 = 0
20290 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20291 Otherwise, ERROR_MARK_NODE is returned. */
20293 static tree
20295 {
20298 /* Look for the `=' token. */
20301 /* Look for the `0' token. */
20310 /* Accept = default or = delete in c++0x mode. */
20313 {
20316 }
20318 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20320 {
20325 }
20327 {
20330 }
20333 }
20335 /* Parse a constant-initializer.
20337 constant-initializer:
20338 = constant-expression
20340 Returns a representation of the constant-expression. */
20342 static tree
20344 {
20345 /* Look for the `=' token. */
20349 /* It is invalid to write:
20351 struct S { static const int i = { 7 }; };
20353 */
20355 {
20358 /* Consume the opening brace. */
20360 /* Skip the initializer. */
20362 /* Look for the trailing `}'. */
20366 }
20370 NULL);
20371 }
20373 /* Derived classes [gram.class.derived] */
20375 /* Parse a base-clause.
20377 base-clause:
20378 : base-specifier-list
20380 base-specifier-list:
20381 base-specifier ... [opt]
20382 base-specifier-list , base-specifier ... [opt]
20384 Returns a TREE_LIST representing the base-classes, in the order in
20385 which they were declared. The representation of each node is as
20386 described by cp_parser_base_specifier.
20388 In the case that no bases are specified, this function will return
20389 NULL_TREE, not ERROR_MARK_NODE. */
20391 static tree
20393 {
20396 /* Look for the `:' that begins the list. */
20399 /* Scan the base-specifier-list. */
20401 {
20403 tree base;
20406 /* Look for the base-specifier. */
20408 /* Look for the (optional) ellipsis. */
20410 {
20411 /* Consume the `...'. */
20415 }
20417 /* Add BASE to the front of the list. */
20419 {
20421 /* Make this a pack expansion type. */
20425 {
20428 }
20429 }
20430 /* Peek at the next token. */
20432 /* If it's not a comma, then the list is complete. */
20435 /* Consume the `,'. */
20437 }
20439 /* PARSER->SCOPE may still be non-NULL at this point, if the last
20440 base class had a qualified name. However, the next name that
20441 appears is certainly not qualified. */
20447 }
20449 /* Parse a base-specifier.
20451 base-specifier:
20452 :: [opt] nested-name-specifier [opt] class-name
20453 virtual access-specifier [opt] :: [opt] nested-name-specifier
20454 [opt] class-name
20455 access-specifier virtual [opt] :: [opt] nested-name-specifier
20456 [opt] class-name
20458 Returns a TREE_LIST. The TREE_PURPOSE will be one of
20459 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
20460 indicate the specifiers provided. The TREE_VALUE will be a TYPE
20461 (or the ERROR_MARK_NODE) indicating the type that was specified. */
20463 static tree
20465 {
20473 tree type;
20475 /* Process the optional `virtual' and `access-specifier'. */
20477 {
20478 /* Peek at the next token. */
20480 /* Process `virtual'. */
20482 {
20484 /* If `virtual' appears more than once, issue an error. */
20486 {
20490 }
20494 /* Consume the `virtual' token. */
20502 /* If more than one access specifier appears, issue an
20503 error. */
20506 {
20510 }
20514 /* Consume the access-specifier. */
20522 }
20523 }
20524 /* It is not uncommon to see programs mechanically, erroneously, use
20525 the 'typename' keyword to denote (dependent) qualified types
20526 as base classes. */
20528 {
20533 else
20535 "keyword %<typename%> not allowed in this context "
20538 }
20540 /* Look for the optional `::' operator. */
20542 /* Look for the nested-name-specifier. The simplest way to
20543 implement:
20545 [temp.res]
20547 The keyword `typename' is not permitted in a base-specifier or
20548 mem-initializer; in these contexts a qualified name that
20549 depends on a template-parameter is implicitly assumed to be a
20550 type name.
20552 is to pretend that we have seen the `typename' keyword at this
20553 point. */
20557 typename_type,
20559 /* If the base class is given by a qualified name, assume that names
20560 we see are type names or templates, as appropriate. */
20566 /* DR 950 allows decltype as a base-specifier. */
20568 else
20569 {
20570 /* Otherwise, look for the class-name. */
20572 class_scope_p,
20573 template_p,
20574 typename_type,
20579 }
20585 }
20587 /* Exception handling [gram.exception] */
20589 /* Parse an (optional) noexcept-specification.
20591 noexcept-specification:
20592 noexcept ( constant-expression ) [opt]
20594 If no noexcept-specification is present, returns NULL_TREE.
20595 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
20596 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
20597 there are no parentheses. CONSUMED_EXPR will be set accordingly.
20598 Otherwise, returns a noexcept specification unless RETURN_COND is true,
20599 in which case a boolean condition is returned instead. */
20601 static tree
20606 {
20610 /* Peek at the next token. */
20613 /* Is it a noexcept-specification? */
20615 {
20616 tree expr;
20620 {
20624 {
20625 /* Types may not be defined in an exception-specification. */
20627 parser->type_definition_forbidden_message
20632 /* Restore the saved message. */
20634 }
20635 else
20636 {
20639 }
20642 }
20643 else
20644 {
20648 }
20650 /* We cannot build a noexcept-spec right away because this will check
20651 that expr is a constexpr. */
20654 else
20656 }
20657 else
20659 }
20661 /* Parse an (optional) exception-specification.
20663 exception-specification:
20664 throw ( type-id-list [opt] )
20666 Returns a TREE_LIST representing the exception-specification. The
20667 TREE_VALUE of each node is a type. */
20669 static tree
20671 {
20673 tree type_id_list;
20676 /* Peek at the next token. */
20679 /* Is it a noexcept-specification? */
20685 /* If it's not `throw', then there's no exception-specification. */
20689 #if 0
20690 /* Enable this once a lot of code has transitioned to noexcept? */
20694 #endif
20696 /* Consume the `throw'. */
20699 /* Look for the `('. */
20702 /* Peek at the next token. */
20704 /* If it's not a `)', then there is a type-id-list. */
20706 {
20707 /* Types may not be defined in an exception-specification. */
20709 parser->type_definition_forbidden_message
20711 /* Parse the type-id-list. */
20713 /* Restore the saved message. */
20715 }
20716 else
20719 /* Look for the `)'. */
20723 }
20725 /* Parse an (optional) type-id-list.
20727 type-id-list:
20728 type-id ... [opt]
20729 type-id-list , type-id ... [opt]
20731 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
20732 in the order that the types were presented. */
20734 static tree
20736 {
20740 {
20742 tree type;
20744 /* Get the next type-id. */
20746 /* Parse the optional ellipsis. */
20748 {
20749 /* Consume the `...'. */
20752 /* Turn the type into a pack expansion expression. */
20754 }
20755 /* Add it to the list. */
20757 /* Peek at the next token. */
20759 /* If it is not a `,', we are done. */
20762 /* Consume the `,'. */
20764 }
20767 }
20769 /* Parse a try-block.
20771 try-block:
20772 try compound-statement handler-seq */
20774 static tree
20776 {
20777 tree try_block;
20787 }
20789 /* Parse a function-try-block.
20791 function-try-block:
20792 try ctor-initializer [opt] function-body handler-seq */
20794 static bool
20796 {
20797 tree compound_stmt;
20798 tree try_block;
20801 /* Look for the `try' keyword. */
20804 /* Let the rest of the front end know where we are. */
20806 /* Parse the function-body. */
20807 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
20809 /* We're done with the `try' part. */
20811 /* Parse the handlers. */
20813 /* We're done with the handlers. */
20817 }
20819 /* Parse a handler-seq.
20821 handler-seq:
20822 handler handler-seq [opt] */
20824 static void
20826 {
20828 {
20831 /* Parse the handler. */
20833 /* Peek at the next token. */
20835 /* If it's not `catch' then there are no more handlers. */
20838 }
20839 }
20841 /* Parse a handler.
20843 handler:
20844 catch ( exception-declaration ) compound-statement */
20846 static void
20848 {
20849 tree handler;
20850 tree declaration;
20860 }
20862 /* Parse an exception-declaration.
20864 exception-declaration:
20865 type-specifier-seq declarator
20866 type-specifier-seq abstract-declarator
20867 type-specifier-seq
20868 ...
20870 Returns a VAR_DECL for the declaration, or NULL_TREE if the
20871 ellipsis variant is used. */
20873 static tree
20875 {
20876 cp_decl_specifier_seq type_specifiers;
20880 /* If it's an ellipsis, it's easy to handle. */
20882 {
20883 /* Consume the `...' token. */
20886 }
20888 /* Types may not be defined in exception-declarations. */
20890 parser->type_definition_forbidden_message
20893 /* Parse the type-specifier-seq. */
20897 /* If it's a `)', then there is no declarator. */
20900 else
20906 /* Restore the saved message. */
20913 }
20915 /* Parse a throw-expression.
20917 throw-expression:
20918 throw assignment-expression [opt]
20920 Returns a THROW_EXPR representing the throw-expression. */
20922 static tree
20924 {
20925 tree expression;
20930 /* Figure out whether or not there is an assignment-expression
20931 following the "throw" keyword. */
20939 else
20944 }
20946 /* GNU Extensions */
20948 /* Parse an (optional) asm-specification.
20950 asm-specification:
20951 asm ( string-literal )
20953 If the asm-specification is present, returns a STRING_CST
20954 corresponding to the string-literal. Otherwise, returns
20955 NULL_TREE. */
20957 static tree
20959 {
20961 tree asm_specification;
20963 /* Peek at the next token. */
20965 /* If the next token isn't the `asm' keyword, then there's no
20966 asm-specification. */
20970 /* Consume the `asm' token. */
20972 /* Look for the `('. */
20975 /* Look for the string-literal. */
20978 /* Look for the `)'. */
20982 }
20984 /* Parse an asm-operand-list.
20986 asm-operand-list:
20987 asm-operand
20988 asm-operand-list , asm-operand
20990 asm-operand:
20991 string-literal ( expression )
20992 [ string-literal ] string-literal ( expression )
20994 Returns a TREE_LIST representing the operands. The TREE_VALUE of
20995 each node is the expression. The TREE_PURPOSE is itself a
20996 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
20997 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
20998 is a STRING_CST for the string literal before the parenthesis. Returns
20999 ERROR_MARK_NODE if any of the operands are invalid. */
21001 static tree
21003 {
21008 {
21009 tree string_literal;
21010 tree expression;
21011 tree name;
21014 {
21015 /* Consume the `[' token. */
21017 /* Read the operand name. */
21022 /* Look for the closing `]'. */
21024 }
21025 else
21027 /* Look for the string-literal. */
21030 /* Look for the `('. */
21032 /* Parse the expression. */
21034 /* Look for the `)'. */
21042 /* Add this operand to the list. */
21044 expression,
21045 asm_operands);
21046 /* If the next token is not a `,', there are no more
21047 operands. */
21050 /* Consume the `,'. */
21052 }
21055 }
21057 /* Parse an asm-clobber-list.
21059 asm-clobber-list:
21060 string-literal
21061 asm-clobber-list , string-literal
21063 Returns a TREE_LIST, indicating the clobbers in the order that they
21064 appeared. The TREE_VALUE of each node is a STRING_CST. */
21066 static tree
21068 {
21072 {
21073 tree string_literal;
21075 /* Look for the string literal. */
21077 /* Add it to the list. */
21079 /* If the next token is not a `,', then the list is
21080 complete. */
21083 /* Consume the `,' token. */
21085 }
21088 }
21090 /* Parse an asm-label-list.
21092 asm-label-list:
21093 identifier
21094 asm-label-list , identifier
21096 Returns a TREE_LIST, indicating the labels in the order that they
21097 appeared. The TREE_VALUE of each node is a label. */
21099 static tree
21101 {
21105 {
21108 /* Look for the identifier. */
21111 {
21114 {
21120 }
21121 }
21122 /* If the next token is not a `,', then the list is
21123 complete. */
21126 /* Consume the `,' token. */
21128 }
21131 }
21133 /* Return TRUE iff the next tokens in the stream are possibly the
21134 beginning of a GNU extension attribute. */
21136 static bool
21138 {
21140 }
21142 /* Return TRUE iff the next tokens in the stream are possibly the
21143 beginning of a standard C++-11 attribute specifier. */
21145 static bool
21147 {
21149 }
21151 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21152 beginning of a standard C++-11 attribute specifier. */
21154 static bool
21156 {
21164 }
21166 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21167 beginning of a GNU extension attribute. */
21169 static bool
21171 {
21175 }
21177 /* Return true iff the next tokens can be the beginning of either a
21178 GNU attribute list, or a standard C++11 attribute sequence. */
21180 static bool
21182 {
21185 }
21187 /* Return true iff the next Nth tokens can be the beginning of either
21188 a GNU attribute list, or a standard C++11 attribute sequence. */
21190 static bool
21192 {
21195 }
21197 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21198 of GNU attributes, or return NULL. */
21200 static tree
21202 {
21206 }
21208 /* Parse an (optional) series of attributes.
21210 attributes:
21211 attributes attribute
21213 attribute:
21214 __attribute__ (( attribute-list [opt] ))
21216 The return value is as for cp_parser_gnu_attribute_list. */
21218 static tree
21220 {
21224 {
21226 tree attribute_list;
21229 /* Peek at the next token. */
21231 /* If it's not `__attribute__', then we're done. */
21235 /* Consume the `__attribute__' keyword. */
21237 /* Look for the two `(' tokens. */
21241 /* Peek at the next token. */
21244 /* Parse the attribute-list. */
21246 else
21247 /* If the next token is a `)', then there is no attribute
21248 list. */
21251 /* Look for the two `)' tokens. */
21259 /* Add these new attributes to the list. */
21261 }
21264 }
21266 /* Parse a GNU attribute-list.
21268 attribute-list:
21269 attribute
21270 attribute-list , attribute
21272 attribute:
21273 identifier
21274 identifier ( identifier )
21275 identifier ( identifier , expression-list )
21276 identifier ( expression-list )
21278 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21279 to an attribute. The TREE_PURPOSE of each node is the identifier
21280 indicating which attribute is in use. The TREE_VALUE represents
21281 the arguments, if any. */
21283 static tree
21285 {
21291 {
21293 tree identifier;
21294 tree attribute;
21296 /* Look for the identifier. We also allow keywords here; for
21297 example `__attribute__ ((const))' is legal. */
21301 {
21304 /* Consume the token. */
21307 /* Save away the identifier that indicates which attribute
21308 this is. */
21310 /* For keywords, use the canonical spelling, not the
21311 parsed identifier. */
21317 /* Peek at the next token. */
21319 /* If it's an `(', then parse the attribute arguments. */
21321 {
21325 vec = cp_parser_parenthesized_expression_list
21331 else
21332 {
21335 }
21336 /* Save the arguments away. */
21338 }
21341 {
21342 /* Add this attribute to the list. */
21345 }
21348 }
21349 /* Now, look for more attributes. If the next token isn't a
21350 `,', we're done. */
21354 /* Consume the comma and keep going. */
21356 }
21359 /* We built up the list in reverse order. */
21361 }
21363 /* Parse a standard C++11 attribute.
21365 The returned representation is a TREE_LIST which TREE_PURPOSE is
21366 the scoped name of the attribute, and the TREE_VALUE is its
21367 arguments list.
21369 Note that the scoped name of the attribute is itself a TREE_LIST
21370 which TREE_PURPOSE is the namespace of the attribute, and
21371 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
21372 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
21373 and which TREE_PURPOSE is directly the attribute name.
21375 Clients of the attribute code should use get_attribute_namespace
21376 and get_attribute_name to get the actual namespace and name of
21377 attributes, regardless of their being GNU or C++11 attributes.
21379 attribute:
21380 attribute-token attribute-argument-clause [opt]
21382 attribute-token:
21383 identifier
21384 attribute-scoped-token
21386 attribute-scoped-token:
21387 attribute-namespace :: identifier
21389 attribute-namespace:
21390 identifier
21392 attribute-argument-clause:
21393 ( balanced-token-seq )
21395 balanced-token-seq:
21396 balanced-token [opt]
21397 balanced-token-seq balanced-token
21399 balanced-token:
21400 ( balanced-token-seq )
21401 [ balanced-token-seq ]
21402 { balanced-token-seq }. */
21404 static tree
21406 {
21410 /* First, parse name of the the attribute, a.k.a
21411 attribute-token. */
21428 {
21429 /* We are seeing a scoped attribute token. */
21439 else
21440 {
21444 }
21446 NULL_TREE);
21448 }
21449 else
21450 {
21452 NULL_TREE);
21453 /* C++11 noreturn attribute is equivalent to GNU's. */
21456 /* C++14 deprecated attribute is equivalent to GNU's. */
21459 }
21461 /* Now parse the optional argument clause of the attribute. */
21466 {
21472 /* A GNU attribute that takes an identifier in parameter. */
21475 vec = cp_parser_parenthesized_expression_list
21481 else
21482 {
21485 }
21489 else
21491 }
21494 }
21496 /* Parse a list of standard C++-11 attributes.
21498 attribute-list:
21499 attribute [opt]
21500 attribute-list , attribute[opt]
21501 attribute ...
21502 attribute-list , attribute ...
21503 */
21505 static tree
21507 {
21512 {
21517 {
21520 }
21525 }
21528 }
21530 /* Parse a standard C++-11 attribute specifier.
21532 attribute-specifier:
21533 [ [ attribute-list ] ]
21534 alignment-specifier
21536 alignment-specifier:
21537 alignas ( type-id ... [opt] )
21538 alignas ( alignment-expression ... [opt] ). */
21540 static tree
21542 {
21548 {
21557 else
21558 /* Warn about parsing c++11 attribute in non-c++1 mode, only
21559 when we are sure that we have actually parsed them. */
21561 }
21562 else
21563 {
21564 tree alignas_expr;
21566 /* Look for an alignment-specifier. */
21578 {
21581 }
21587 {
21591 alignas_expr =
21599 }
21602 {
21605 }
21609 /* Build the C++-11 representation of an 'aligned'
21610 attribute. */
21611 attributes =
21615 }
21618 }
21620 /* Parse a standard C++-11 attribute-specifier-seq.
21622 attribute-specifier-seq:
21623 attribute-specifier-seq [opt] attribute-specifier
21624 */
21626 static tree
21628 {
21632 {
21641 }
21645 }
21647 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
21648 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
21649 current value of the PEDANTIC flag, regardless of whether or not
21650 the `__extension__' keyword is present. The caller is responsible
21651 for restoring the value of the PEDANTIC flag. */
21653 static bool
21655 {
21656 /* Save the old value of the PEDANTIC flag. */
21660 {
21661 /* Consume the `__extension__' token. */
21663 /* We're not being pedantic while the `__extension__' keyword is
21664 in effect. */
21668 }
21671 }
21673 /* Parse a label declaration.
21675 label-declaration:
21676 __label__ label-declarator-seq ;
21678 label-declarator-seq:
21679 identifier , label-declarator-seq
21680 identifier */
21682 static void
21684 {
21685 /* Look for the `__label__' keyword. */
21689 {
21690 tree identifier;
21692 /* Look for an identifier. */
21694 /* If we failed, stop. */
21697 /* Declare it as a label. */
21699 /* If the next token is a `;', stop. */
21702 /* Look for the `,' separating the label declarations. */
21704 }
21706 /* Look for the final `;'. */
21708 }
21710 /* Support Functions */
21712 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
21713 NAME should have one of the representations used for an
21714 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
21715 is returned. If PARSER->SCOPE is a dependent type, then a
21716 SCOPE_REF is returned.
21718 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
21719 returned; the name was already resolved when the TEMPLATE_ID_EXPR
21720 was formed. Abstractly, such entities should not be passed to this
21721 function, because they do not need to be looked up, but it is
21722 simpler to check for this special case here, rather than at the
21723 call-sites.
21725 In cases not explicitly covered above, this function returns a
21726 DECL, OVERLOAD, or baselink representing the result of the lookup.
21727 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
21728 is returned.
21730 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
21731 (e.g., "struct") that was used. In that case bindings that do not
21732 refer to types are ignored.
21734 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
21735 ignored.
21737 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
21738 are ignored.
21740 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
21741 types.
21743 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
21744 TREE_LIST of candidates if name-lookup results in an ambiguity, and
21745 NULL_TREE otherwise. */
21747 static tree
21754 location_t name_location)
21755 {
21756 tree decl;
21759 /* Assume that the lookup will be unambiguous. */
21763 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
21764 no longer valid. Note that if we are parsing tentatively, and
21765 the parse fails, OBJECT_TYPE will be automatically restored. */
21771 /* A template-id has already been resolved; there is no lookup to
21772 do. */
21776 {
21780 }
21782 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
21783 it should already have been checked to make sure that the name
21784 used matches the type being destroyed. */
21786 {
21787 tree type;
21789 /* Figure out to which type this destructor applies. */
21794 else
21796 /* If that's not a class type, there is no destructor. */
21803 /* If it was a class type, return the destructor. */
21805 }
21807 /* By this point, the NAME should be an ordinary identifier. If
21808 the id-expression was a qualified name, the qualifying scope is
21809 stored in PARSER->SCOPE at this point. */
21812 /* Perform the lookup. */
21814 {
21820 /* If the SCOPE is dependent, the lookup must be deferred until
21821 the template is instantiated -- unless we are explicitly
21822 looking up names in uninstantiated templates. Even then, we
21823 cannot look up the name if the scope is not a class type; it
21824 might, for example, be a template type parameter. */
21829 /* Defer lookup. */
21831 else
21832 {
21835 /* If PARSER->SCOPE is a dependent type, then it must be a
21836 class type, and we must not be checking dependencies;
21837 otherwise, we would have processed this lookup above. So
21838 that PARSER->SCOPE is not considered a dependent base by
21839 lookup_member, we must enter the scope here. */
21843 /* If the PARSER->SCOPE is a template specialization, it
21844 may be instantiated during name lookup. In that case,
21845 errors may be issued. Even if we rollback the current
21846 tentative parse, those errors are valid. */
21851 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
21852 lookup result and the nested-name-specifier nominates a class C:
21853 * if the name specified after the nested-name-specifier, when
21854 looked up in C, is the injected-class-name of C (Clause 9), or
21855 * if the name specified after the nested-name-specifier is the
21856 same as the identifier or the simple-template-id's template-
21857 name in the last component of the nested-name-specifier,
21858 the name is instead considered to name the constructor of
21859 class C. [ Note: for example, the constructor is not an
21860 acceptable lookup result in an elaborated-type-specifier so
21861 the constructor would not be used in place of the
21862 injected-class-name. --end note ] Such a constructor name
21863 shall be used only in the declarator-id of a declaration that
21864 names a constructor or in a using-declaration. */
21872 /* If we have a single function from a using decl, pull it out. */
21879 }
21881 /* If the scope is a dependent type and either we deferred lookup or
21882 we did lookup but didn't find the name, rememeber the name. */
21885 {
21887 {
21888 tree type;
21890 /* The resolution to Core Issue 180 says that `struct
21891 A::B' should be considered a type-name, even if `A'
21892 is dependent. */
21897 }
21901 CPP_CLOSE_PAREN)))
21905 else
21908 is_template);
21909 }
21912 }
21914 {
21915 /* Look up the name in the scope of the OBJECT_TYPE, unless the
21916 OBJECT_TYPE is not a class. */
21918 /* If the OBJECT_TYPE is a template specialization, it may
21919 be instantiated during name lookup. In that case, errors
21920 may be issued. Even if we rollback the current tentative
21921 parse, those errors are valid. */
21923 name,
21926 tf_warning_or_error);
21927 else
21931 /* Look it up in the enclosing context. */
21937 }
21938 else
21939 {
21945 }
21947 /* If the lookup failed, let our caller know. */
21951 /* Pull out the template from an injected-class-name (or multiple). */
21955 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
21957 {
21960 /* The error message we have to print is too complicated for
21961 cp_parser_error, so we incorporate its actions directly. */
21963 {
21965 name);
21967 }
21969 }
21977 /* If we have resolved the name of a member declaration, check to
21978 see if the declaration is accessible. When the name resolves to
21979 set of overloaded functions, accessibility is checked when
21980 overload resolution is done.
21982 During an explicit instantiation, access is not checked at all,
21983 as per [temp.explicit]. */
21990 }
21992 /* Like cp_parser_lookup_name, but for use in the typical case where
21993 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
21994 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
21996 static tree
21998 {
22000 none_type,
22005 location);
22006 }
22008 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22009 the current context, return the TYPE_DECL. If TAG_NAME_P is
22010 true, the DECL indicates the class being defined in a class-head,
22011 or declared in an elaborated-type-specifier.
22013 Otherwise, return DECL. */
22015 static tree
22017 {
22018 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22019 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22021 struct A {
22022 template <typename T> struct B;
22023 };
22025 template <typename T> struct A::B {};
22027 Similarly, in an elaborated-type-specifier:
22029 namespace N { struct X{}; }
22031 struct A {
22032 template <typename T> friend struct N::X;
22033 };
22035 However, if the DECL refers to a class type, and we are in
22036 the scope of the class, then the name lookup automatically
22037 finds the TYPE_DECL created by build_self_reference rather
22038 than a TEMPLATE_DECL. For example, in:
22040 template <class T> struct S {
22041 S s;
22042 };
22044 there is no need to handle such case. */
22050 }
22052 /* If too many, or too few, template-parameter lists apply to the
22053 declarator, issue an error message. Returns TRUE if all went well,
22054 and FALSE otherwise. */
22056 static bool
22059 location_t declarator_location)
22060 {
22062 {
22064 {
22072 /* If the DECLARATOR has the form `X<y>' then it uses one
22073 additional level of template parameters. */
22076 return cp_parser_check_template_parameters
22078 }
22093 }
22095 }
22097 /* NUM_TEMPLATES were used in the current declaration. If that is
22098 invalid, return FALSE and issue an error messages. Otherwise,
22099 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22100 declarator and we can print more accurate diagnostics. */
22102 static bool
22105 location_t location,
22107 {
22108 /* If there are the same number of template classes and parameter
22109 lists, that's OK. */
22112 /* If there are more, but only one more, then we are referring to a
22113 member template. That's OK too. */
22116 /* If there are more template classes than parameter lists, we have
22117 something like:
22119 template <class T> void S<T>::R<T>::f (); */
22121 {
22131 else
22134 }
22135 /* Otherwise, there are too many template parameter lists. We have
22136 something like:
22138 template <class T> template <class U> void S::f(); */
22141 }
22143 /* Parse an optional `::' token indicating that the following name is
22144 from the global namespace. If so, PARSER->SCOPE is set to the
22145 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22146 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22147 Returns the new value of PARSER->SCOPE, if the `::' token is
22148 present, and NULL_TREE otherwise. */
22150 static tree
22152 {
22155 /* Peek at the next token. */
22157 /* If we're looking at a `::' token then we're starting from the
22158 global namespace, not our current location. */
22160 {
22161 /* Consume the `::' token. */
22163 /* Set the SCOPE so that we know where to start the lookup. */
22169 }
22171 {
22175 }
22178 }
22180 /* Returns TRUE if the upcoming token sequence is the start of a
22181 constructor declarator. If FRIEND_P is true, the declarator is
22182 preceded by the `friend' specifier. */
22184 static bool
22186 {
22188 tree nested_name_specifier;
22191 /* The common case is that this is not a constructor declarator, so
22192 try to avoid doing lots of work if at all possible. It's not
22193 valid declare a constructor at function scope. */
22196 /* And only certain tokens can begin a constructor declarator. */
22204 /* Parse tentatively; we are going to roll back all of the tokens
22205 consumed here. */
22207 /* Assume that we are looking at a constructor declarator. */
22210 /* Look for the optional `::' operator. */
22213 /* Look for the nested-name-specifier. */
22214 nested_name_specifier
22220 /* Outside of a class-specifier, there must be a
22221 nested-name-specifier. */
22229 /* If we have a class scope, this is easy; DR 147 says that S::S always
22230 names the constructor, and no other qualified name could. */
22233 {
22243 }
22244 /* If we still think that this might be a constructor-declarator,
22245 look for a class-name. */
22247 {
22248 /* If we have:
22250 template <typename T> struct S {
22251 S();
22252 };
22254 we must recognize that the nested `S' names a class. */
22255 tree type_decl;
22259 none_type,
22263 /* If there was no class-name, then this is not a constructor. */
22266 /* If we're still considering a constructor, we have to see a `(',
22267 to begin the parameter-declaration-clause, followed by either a
22268 `)', an `...', or a decl-specifier. We need to check for a
22269 type-specifier to avoid being fooled into thinking that:
22271 S (f) (int);
22273 is a constructor. (It is actually a function named `f' that
22274 takes one parameter (of type `int') and returns a value of type
22275 `S'. */
22283 /* A parameter declaration begins with a decl-specifier,
22284 which is either the "attribute" keyword, a storage class
22285 specifier, or (usually) a type-specifier. */
22287 {
22288 tree type;
22292 /* Names appearing in the type-specifier should be looked up
22293 in the scope of the class. */
22296 else
22297 {
22300 {
22304 {
22307 }
22308 }
22310 }
22312 /* Inside the constructor parameter list, surrounding
22313 template-parameter-lists do not apply. */
22314 saved_num_template_parameter_lists
22318 /* Look for the type-specifier. */
22320 CP_PARSER_FLAGS_NONE,
22326 parser->num_template_parameter_lists
22329 /* Leave the scope of the class. */
22334 }
22335 }
22337 /* We did not really want to consume any tokens. */
22341 }
22343 /* Parse the definition of the function given by the DECL_SPECIFIERS,
22344 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
22345 they must be performed once we are in the scope of the function.
22347 Returns the function defined. */
22349 static tree
22350 cp_parser_function_definition_from_specifiers_and_declarator
22353 tree attributes,
22355 {
22356 tree fn;
22359 /* Begin the function-definition. */
22362 /* The things we're about to see are not directly qualified by any
22363 template headers we've seen thus far. */
22366 /* If there were names looked up in the decl-specifier-seq that we
22367 did not check, check them now. We must wait until we are in the
22368 scope of the function to perform the checks, since the function
22369 might be a friend. */
22373 {
22376 }
22379 {
22380 /* Skip the entire function. */
22383 }
22385 {
22386 /* Seen already, skip it. An error message has already been output. */
22390 /* If this is a function from a class, pop the nested class. */
22393 }
22394 else
22395 {
22396 timevar_id_t tv;
22399 else
22405 }
22408 }
22410 /* Parse the part of a function-definition that follows the
22411 declarator. INLINE_P is TRUE iff this function is an inline
22412 function defined within a class-specifier.
22414 Returns the function defined. */
22416 static tree
22419 {
22420 tree fn;
22429 /* If the next token is `return', then the code may be trying to
22430 make use of the "named return value" extension that G++ used to
22431 support. */
22434 {
22435 /* Consume the `return' keyword. */
22437 /* Look for the identifier that indicates what value is to be
22438 returned. */
22440 /* Issue an error message. */
22443 /* Skip tokens until we reach the start of the function body. */
22445 {
22452 }
22453 }
22454 /* The `extern' in `extern "C" void f () { ... }' does not apply to
22455 anything declared inside `f'. */
22456 saved_in_unbraced_linkage_specification_p
22459 /* Inside the function, surrounding template-parameter-lists do not
22460 apply. */
22461 saved_num_template_parameter_lists
22467 /* If the next token is `try', `__transaction_atomic', or
22468 `__transaction_relaxed`, then we are looking at either function-try-block
22469 or function-transaction-block. Note that all of these include the
22470 function-body. */
22473 RID_TRANSACTION_ATOMIC);
22475 RID_TRANSACTION_RELAXED))
22477 RID_TRANSACTION_RELAXED);
22480 else
22481 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
22486 /* Finish the function. */
22489 /* Generate code for it, if necessary. */
22491 /* Restore the saved values. */
22492 parser->in_unbraced_linkage_specification_p
22494 parser->num_template_parameter_lists
22502 }
22504 /* Parse a template-declaration, assuming that the `export' (and
22505 `extern') keywords, if present, has already been scanned. MEMBER_P
22506 is as for cp_parser_template_declaration. */
22508 static void
22510 {
22513 tree parameter_list;
22518 /* Look for the `template' keyword. */
22523 /* And the `<'. */
22527 {
22528 /* 14.5.2.2 [temp.mem]
22530 A local class shall not have member templates. */
22535 }
22536 /* [temp]
22538 A template ... shall not have C linkage. */
22540 {
22542 /* Give it C++ linkage to avoid confusing other parts of the
22543 front end. */
22546 }
22547 else
22550 /* We cannot perform access checks on the template parameter
22551 declarations until we know what is being declared, just as we
22552 cannot check the decl-specifier list. */
22555 /* If the next token is `>', then we have an invalid
22556 specialization. Rather than complain about an invalid template
22557 parameter, issue an error message here. */
22559 {
22563 }
22564 else
22565 {
22566 /* Parse the template parameters. */
22568 }
22570 /* Get the deferred access checks from the parameter list. These
22571 will be checked once we know what is being declared, as for a
22572 member template the checks must be performed in the scope of the
22573 class containing the member. */
22576 /* Look for the `>'. */
22578 /* We just processed one more parameter list. */
22580 /* If the next token is `template', there are more template
22581 parameters. */
22583 RID_TEMPLATE))
22588 else
22589 {
22590 /* There are no access checks when parsing a template, as we do not
22591 know if a specialization will be a friend. */
22595 checks,
22596 member_p,
22601 /* If this is a member template declaration, let the front
22602 end know. */
22604 {
22609 }
22614 }
22615 /* We are done with the current parameter list. */
22620 /* Finish up. */
22623 /* Check the template arguments for a literal operator template. */
22627 {
22631 else
22632 {
22635 {
22641 }
22643 {
22651 }
22652 else
22654 }
22657 " Expected non-type template argument pack <char...>"
22659 decl);
22660 }
22661 /* Register member declarations. */
22664 /* For the erroneous case of a template with C linkage, we pushed an
22665 implicit C++ linkage scope; exit that scope now. */
22668 /* If DECL is a function template, we must return to parse it later.
22669 (Even though there is no definition, there might be default
22670 arguments that need handling.) */
22674 }
22676 /* Perform the deferred access checks from a template-parameter-list.
22677 CHECKS is a TREE_LIST of access checks, as returned by
22678 get_deferred_access_checks. */
22680 static void
22681 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
22682 {
22686 }
22688 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
22689 `function-definition' sequence that follows a template header.
22690 If MEMBER_P is true, this declaration appears in a class scope.
22692 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
22693 *FRIEND_P is set to TRUE iff the declaration is a friend. */
22695 static tree
22701 {
22704 cp_decl_specifier_seq decl_specifiers;
22708 /* This function is only used when processing a template
22709 declaration. */
22713 /* Defer access checks until we know what is being declared. */
22716 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
22717 alternative. */
22720 CP_PARSER_FLAGS_OPTIONAL,
22726 /* There are no template typedefs. */
22728 {
22732 }
22734 /* Gather up the access checks that occurred the
22735 decl-specifier-seq. */
22738 /* Check for the declaration of a template class. */
22740 {
22742 {
22745 /* In this case:
22747 struct C {
22748 friend template <typename T> struct A<T>::B;
22749 };
22751 A<T>::B will be represented by a TYPENAME_TYPE, and
22752 therefore not recognized by shadow_tag. */
22754 && !decl
22761 else
22764 /* Perform access checks for template parameters. */
22766 }
22767 }
22769 /* Complain about missing 'typename' or other invalid type names. */
22772 {
22773 /* cp_parser_parse_and_diagnose_invalid_type_name calls
22774 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
22775 the rest of this declaration. */
22778 }
22780 /* If it's not a template class, try for a template function. If
22781 the next token is a `;', then this declaration does not declare
22782 anything. But, if there were errors in the decl-specifiers, then
22783 the error might well have come from an attempted class-specifier.
22784 In that case, there's no need to warn about a missing declarator. */
22788 {
22791 checks,
22793 member_p,
22794 declares_class_or_enum,
22796 NULL);
22798 /* 7.1.1-1 [dcl.stc]
22800 A storage-class-specifier shall not be specified in an explicit
22801 specialization... */
22803 && explicit_specialization_p
22805 {
22809 }
22813 }
22815 /* Look for a trailing `;' after the declaration. */
22821 out:
22824 /* Clear any current qualification; whatever comes next is the start
22825 of something new. */
22831 }
22833 /* Parse a cast-expression that is not the operand of a unary "&". */
22835 static tree
22837 {
22840 }
22842 /* Parse a functional cast to TYPE. Returns an expression
22843 representing the cast. */
22845 static tree
22847 {
22849 tree expression_list;
22850 tree cast;
22854 {
22861 tf_warning_or_error);
22862 }
22871 else
22872 {
22875 }
22878 tf_warning_or_error);
22879 /* [expr.const]/1: In an integral constant expression "only type
22880 conversions to integral or enumeration type can be used". */
22886 NIC_CONSTRUCTOR))
22889 }
22891 /* Save the tokens that make up the body of a member function defined
22892 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
22893 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
22894 specifiers applied to the declaration. Returns the FUNCTION_DECL
22895 for the member function. */
22897 static tree
22901 tree attributes)
22902 {
22905 tree fn;
22907 /* Create the FUNCTION_DECL. */
22910 /* If something went badly wrong, bail out now. */
22912 {
22913 /* If there's a function-body, skip it. */
22918 }
22920 /* Remember it, if there default args to post process. */
22923 /* Save away the tokens that make up the body of the
22924 function. */
22926 /* Handle function try blocks. */
22929 /* We can have braced-init-list mem-initializers before the fn body. */
22931 {
22934 {
22935 /* cache_group will stop after an un-nested { } pair, too. */
22939 /* variadic mem-inits have ... after the ')'. */
22942 }
22943 }
22945 /* Handle function try blocks. */
22950 /* Save away the inline definition; we will process it when the
22951 class is complete. */
22955 /* We need to know that this was defined in the class, so that
22956 friend templates are handled correctly. */
22959 /* Add FN to the queue of functions to be parsed later. */
22963 }
22965 /* Save the tokens that make up the in-class initializer for a non-static
22966 data member. Returns a DEFAULT_ARG. */
22968 static tree
22970 {
22972 }
22974 /* Parse a template-argument-list, as well as the trailing ">" (but
22975 not the opening "<"). See cp_parser_template_argument_list for the
22976 return value. */
22978 static tree
22980 {
22981 tree arguments;
22982 tree saved_scope;
22983 tree saved_qualifying_scope;
22984 tree saved_object_scope;
22989 /* [temp.names]
22991 When parsing a template-id, the first non-nested `>' is taken as
22992 the end of the template-argument-list rather than a greater-than
22993 operator. */
22994 saved_greater_than_is_operator_p
22997 /* Parsing the argument list may modify SCOPE, so we save it
22998 here. */
23002 /* We need to evaluate the template arguments, even though this
23003 template-id may be nested within a "sizeof". */
23008 /* Parse the template-argument-list itself. */
23012 else
23014 /* Look for the `>' that ends the template-argument-list. If we find
23015 a '>>' instead, it's probably just a typo. */
23017 {
23019 {
23020 /* In C++0x, a `>>' in a template argument list or cast
23021 expression is considered to be two separate `>'
23022 tokens. So, change the current token to a `>', but don't
23023 consume it: it will be consumed later when the outer
23024 template argument list (or cast expression) is parsed.
23025 Note that this replacement of `>' for `>>' is necessary
23026 even if we are parsing tentatively: in the tentative
23027 case, after calling
23028 cp_parser_enclosed_template_argument_list we will always
23029 throw away all of the template arguments and the first
23030 closing `>', either because the template argument list
23031 was erroneous or because we are replacing those tokens
23032 with a CPP_TEMPLATE_ID token. The second `>' (which will
23033 not have been thrown away) is needed either to close an
23034 outer template argument list or to complete a new-style
23035 cast. */
23038 }
23040 {
23041 /* If we're in a nested template argument list, the '>>' has
23042 to be a typo for '> >'. We emit the error message, but we
23043 continue parsing and we push a '>' as next token, so that
23044 the argument list will be parsed correctly. Note that the
23045 global source location is still on the token before the
23046 '>>', so we need to say explicitly where we want it. */
23052 }
23053 else
23054 {
23055 /* If this is not a nested template argument list, the '>>'
23056 is a typo for '>'. Emit an error message and continue.
23057 Same deal about the token location, but here we can get it
23058 right by consuming the '>>' before issuing the diagnostic. */
23061 "spurious %<>>%>, use %<>%> to terminate "
23063 }
23064 }
23065 else
23067 /* The `>' token might be a greater-than operator again now. */
23068 parser->greater_than_is_operator_p
23070 /* Restore the SAVED_SCOPE. */
23078 }
23080 /* MEMBER_FUNCTION is a member function, or a friend. If default
23081 arguments, or the body of the function have not yet been parsed,
23082 parse them now. */
23084 static void
23086 {
23088 /* If this member is a template, get the underlying
23089 FUNCTION_DECL. */
23093 /* There should not be any class definitions in progress at this
23094 point; the bodies of members are only parsed outside of all class
23095 definitions. */
23097 /* While we're parsing the member functions we might encounter more
23098 classes. We want to handle them right away, but we don't want
23099 them getting mixed up with functions that are currently in the
23100 queue. */
23103 /* Make sure that any template parameters are in scope. */
23106 /* If the body of the function has not yet been parsed, parse it
23107 now. */
23109 {
23110 tree function_scope;
23113 /* The function is no longer pending; we are processing it. */
23118 /* If this is a local class, enter the scope of the containing
23119 function. */
23124 /* Push the body of the function onto the lexer stack. */
23127 /* Let the front end know that we going to be defining this
23128 function. */
23132 /* Don't do access checking if it is a templated function. */
23136 /* #pragma omp declare reduction needs special parsing. */
23138 {
23143 }
23144 else
23145 /* Now, parse the body of the function. */
23152 /* Leave the scope of the containing function. */
23156 }
23158 /* Remove any template parameters from the symbol table. */
23161 /* Restore the queue. */
23164 }
23166 /* If DECL contains any default args, remember it on the unparsed
23167 functions queue. */
23169 static void
23171 {
23172 tree probe;
23175 probe;
23178 {
23182 }
23183 }
23185 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
23186 which is either a FIELD_DECL or PARM_DECL. Parse it and return
23187 the result. For a PARM_DECL, PARMTYPE is the corresponding type
23188 from the parameter-type-list. */
23190 static tree
23193 {
23195 tree parsed_arg;
23201 /* Push the saved tokens for the default argument onto the parser's
23202 lexer stack. */
23208 /* Parse the default argument. */
23219 {
23220 /* In a non-template class, check conversions now. In a template,
23221 we'll wait and instantiate these as needed. */
23224 tf_warning_or_error);
23225 else
23226 {
23233 /* This represents the whole initialization. */
23235 }
23236 }
23238 /* If the token stream has not been completely used up, then
23239 there was extra junk after the end of the default
23240 argument. */
23242 {
23245 else
23247 }
23249 /* Revert to the main lexer. */
23253 }
23255 /* FIELD is a non-static data member with an initializer which we saved for
23256 later; parse it now. */
23258 static void
23260 {
23261 tree def;
23266 NULL_TREE);
23270 }
23272 /* FN is a FUNCTION_DECL which may contains a parameter with an
23273 unparsed DEFAULT_ARG. Parse the default args now. This function
23274 assumes that the current scope is the scope in which the default
23275 argument should be processed. */
23277 static void
23279 {
23283 /* While we're parsing the default args, we might (due to the
23284 statement expression extension) encounter more classes. We want
23285 to handle them right away, but we don't want them getting mixed
23286 up with default args that are currently in the queue. */
23289 /* Local variable names (and the `this' keyword) may not appear
23290 in a default argument. */
23301 {
23303 tree parsed_arg;
23305 tree copy;
23312 /* This can happen for a friend declaration for a function
23313 already declared with default arguments. */
23316 parsed_arg
23318 default_arg,
23321 {
23323 }
23327 /* Update any instantiations we've already created. */
23331 }
23335 /* Make sure no default arg is missing. */
23338 /* Restore the state of local_variables_forbidden_p. */
23341 /* Restore the queue. */
23343 }
23345 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
23347 sizeof ... ( identifier )
23349 where the 'sizeof' token has already been consumed. */
23351 static tree
23353 {
23354 /* Consume the `...'. */
23361 else
23369 /* The name is not qualified. */
23387 }
23389 /* Parse the operand of `sizeof' (or a similar operator). Returns
23390 either a TYPE or an expression, depending on the form of the
23391 input. The KEYWORD indicates which kind of expression we have
23392 encountered. */
23394 static tree
23396 {
23403 /* If it's a `...', then we are computing the length of a parameter
23404 pack. */
23409 /* Types cannot be defined in a `sizeof' expression. Save away the
23410 old message. */
23412 /* And create the new one. */
23418 /* The restrictions on constant-expressions do not apply inside
23419 sizeof expressions. */
23420 saved_integral_constant_expression_p
23422 saved_non_integral_constant_expression_p
23426 /* Do not actually evaluate the expression. */
23429 /* If it's a `(', then we might be looking at the type-id
23430 construction. */
23432 {
23436 /* We can't be sure yet whether we're looking at a type-id or an
23437 expression. */
23439 /* Consume the `('. */
23441 /* Note: as a GNU Extension, compound literals are considered
23442 postfix-expressions as they are in C99, so they are valid
23443 arguments to sizeof. See comment in cp_parser_cast_expression
23444 for details. */
23446 /* Skip tokens until the next token is a closing parenthesis.
23447 If we find the closing `)', and the next token is a `{', then
23448 we are looking at a compound-literal. */
23449 compound_literal_p
23453 /* Roll back the tokens we skipped. */
23455 /* If we were looking at a compound-literal, simulate an error
23456 so that the call to cp_parser_parse_definitely below will
23457 fail. */
23460 else
23461 {
23464 /* Look for the type-id. */
23466 /* Look for the closing `)'. */
23469 }
23471 /* If all went well, then we're done. */
23473 {
23474 cp_decl_specifier_seq decl_specs;
23476 /* Build a trivial decl-specifier-seq. */
23480 /* Call grokdeclarator to figure out what type this is. */
23483 TYPENAME,
23486 }
23487 }
23489 /* If the type-id production did not work out, then we must be
23490 looking at the unary-expression production. */
23495 /* Go back to evaluating expressions. */
23499 /* Free the message we created. */
23501 /* And restore the old one. */
23503 parser->integral_constant_expression_p
23505 parser->non_integral_constant_expression_p
23509 }
23511 /* If the current declaration has no declarator, return true. */
23513 static bool
23515 {
23516 /* If the next token is a `;' or a `,' then there is no
23517 declarator. */
23520 }
23522 /* Update the DECL_SPECS to reflect the storage class indicated by
23523 KEYWORD. */
23525 static void
23530 {
23531 cp_storage_class storage_class;
23534 {
23538 }
23540 {
23543 }
23548 {
23551 }
23554 {
23572 }
23576 /* A storage class specifier cannot be applied alongside a typedef
23577 specifier. If there is a typedef specifier present then set
23578 conflicting_specifiers_p which will trigger an error later
23579 on in grokdeclarator. */
23582 }
23584 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
23585 is true, the type is a class or enum definition. */
23587 static void
23589 tree type_spec,
23592 {
23595 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
23596 (with, for example, in "typedef int wchar_t;") we remember that
23597 this is what happened. In system headers, we ignore these
23598 declarations so that G++ can work with system headers that are not
23599 C++-safe. */
23601 && !type_definition_p
23611 {
23614 ds_redefined_builtin_type_spec,
23615 token);
23617 {
23621 }
23622 }
23625 else
23626 {
23631 }
23632 }
23634 /* True iff TOKEN is the GNU keyword __thread. */
23636 static bool
23638 {
23641 }
23643 /* Set the location for a declarator specifier and check if it is
23644 duplicated.
23646 DECL_SPECS is the sequence of declarator specifiers onto which to
23647 set the location.
23649 DS is the single declarator specifier to set which location is to
23650 be set onto the existing sequence of declarators.
23652 LOCATION is the location for the declarator specifier to
23653 consider. */
23655 static void
23658 {
23667 {
23671 }
23672 else
23673 {
23675 {
23679 else
23680 {
23683 OPT_Wlong_long,
23685 }
23686 }
23688 {
23693 else
23695 }
23696 else
23697 {
23713 "__complex"
23714 };
23717 }
23718 }
23719 }
23721 /* Return true iff the declarator specifier DS is present in the
23722 sequence of declarator specifiers DECL_SPECS. */
23724 bool
23726 cp_decl_spec ds)
23727 {
23734 }
23736 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
23737 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
23739 static bool
23741 {
23743 }
23745 /* Issue an error message indicating that TOKEN_DESC was expected.
23746 If KEYWORD is true, it indicated this function is called by
23747 cp_parser_require_keword and the required token can only be
23748 a indicated keyword. */
23750 static void
23752 required_token token_desc,
23754 {
23756 {
23825 }
23827 {
23829 {
23908 }
23909 }
23910 else
23912 }
23916 /* If the next token is of the indicated TYPE, consume it. Otherwise,
23917 issue an error message indicating that TOKEN_DESC was expected.
23919 Returns the token consumed, if the token had the appropriate type.
23920 Otherwise, returns NULL. */
23925 required_token token_desc)
23926 {
23929 else
23930 {
23931 /* Output the MESSAGE -- unless we're parsing tentatively. */
23935 }
23936 }
23938 /* An error message is produced if the next token is not '>'.
23939 All further tokens are skipped until the desired token is
23940 found or '{', '}', ';' or an unbalanced ')' or ']'. */
23942 static void
23944 {
23945 /* Current level of '< ... >'. */
23947 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
23950 /* Are we ready, yet? If not, issue error message. */
23954 /* Skip tokens until the desired token is found. */
23956 {
23957 /* Peek at the next token. */
23959 {
23967 /* C++0x views the `>>' operator as two `>' tokens, but
23968 C++98 does not. */
23971 {
23972 /* We've hit a `>>' where the first `>' closes the
23973 template argument list, and the second `>' is
23974 spurious. Just consume the `>>' and stop; we've
23975 already produced at least one error. */
23978 }
23979 /* Fall through for C++0x, so we handle the second `>' in
23980 the `>>'. */
23984 {
23985 /* We've reached the token we want, consume it and stop. */
23988 }
24007 /* The '>' was probably forgotten, don't look further. */
24012 }
24014 /* Consume this token. */
24016 }
24017 }
24019 /* If the next token is the indicated keyword, consume it. Otherwise,
24020 issue an error message indicating that TOKEN_DESC was expected.
24022 Returns the token consumed, if the token had the appropriate type.
24023 Otherwise, returns NULL. */
24028 required_token token_desc)
24029 {
24033 {
24036 }
24039 }
24041 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24042 function-definition. */
24044 static bool
24046 {
24049 /* A ctor-initializer begins with a `:'. */
24051 /* A function-try-block begins with `try'. */
24053 /* A function-transaction-block begins with `__transaction_atomic'
24054 or `__transaction_relaxed'. */
24057 /* The named return value extension begins with `return'. */
24059 }
24061 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24062 definition. */
24064 static bool
24066 {
24073 }
24075 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24076 C++0x) ending a template-argument. */
24078 static bool
24080 {
24088 }
24090 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24091 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24093 static bool
24096 {
24102 /* Check for the sequence `<::' in the original code. It would be lexed as
24103 `[:', where `[' is a digraph, and there is no whitespace before
24104 `:'. */
24106 {
24111 }
24113 }
24115 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24116 or none_type otherwise. */
24118 static enum tag_types
24120 {
24122 {
24132 }
24133 }
24135 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24137 static void
24139 {
24143 {
24147 type))
24150 }
24151 }
24153 /* Issue an error message if DECL is redeclared with different
24154 access than its original declaration [class.access.spec/3].
24155 This applies to nested classes and nested class templates.
24156 [class.mem/1]. */
24158 static void
24160 {
24169 }
24171 /* Look for the `template' keyword, as a syntactic disambiguator.
24172 Return TRUE iff it is present, in which case it will be
24173 consumed. */
24175 static bool
24177 {
24179 {
24180 /* In C++98 the `template' keyword can only be used within templates;
24181 outside templates the parser can always figure out what is a
24182 template and what is not. In C++11, per the resolution of DR 468,
24183 `template' is allowed in cases where it is not strictly necessary. */
24186 {
24189 "in C++98 %<template%> (as a disambiguator) is only "
24191 /* If this part of the token stream is rescanned, the same
24192 error message would be generated. So, we purge the token
24193 from the stream. */
24196 }
24197 else
24198 {
24199 /* Consume the `template' keyword. */
24202 }
24203 }
24205 }
24207 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
24208 set PARSER->SCOPE, and perform other related actions. */
24210 static void
24212 {
24218 /* Get the stored value. */
24220 /* Perform any access checks that were deferred. */
24223 {
24228 }
24229 /* Set the scope from the stored value. */
24233 }
24235 /* Consume tokens up through a non-nested END token. Returns TRUE if we
24236 encounter the end of a block before what we were looking for. */
24238 static bool
24242 {
24244 {
24247 /* Abort a parenthesized expression if we encounter a semicolon. */
24251 /* If we've reached the end of the file, stop. */
24257 /* We've hit the end of an enclosing block, so there's been some
24258 kind of syntax error. */
24261 /* Consume the token. */
24263 /* See if it starts a new group. */
24265 {
24267 /* In theory this should probably check end == '}', but
24268 cp_parser_save_member_function_body needs it to exit
24269 after either '}' or ')' when called with ')'. */
24272 }
24274 {
24278 }
24283 }
24284 }
24286 /* Like above, for caching a default argument or NSDMI. Both of these are
24287 terminated by a non-nested comma, but it can be unclear whether or not a
24288 comma is nested in a template argument list unless we do more parsing.
24289 In order to handle this ambiguity, when we encounter a ',' after a '<'
24290 we try to parse what follows as a parameter-declaration-list (in the
24291 case of a default argument) or a member-declarator (in the case of an
24292 NSDMI). If that succeeds, then we stop caching. */
24294 static tree
24296 {
24301 tree default_argument;
24303 /* Add tokens until we have processed the entire default
24304 argument. We add the range [first_token, token). */
24307 {
24308 /* For list-initialization, this is straightforward. */
24311 }
24313 {
24316 /* Peek at the next token. */
24318 /* What we do depends on what token we have. */
24320 {
24321 /* In valid code, a default argument must be
24322 immediately followed by a `,' `)', or `...'. */
24325 {
24326 /* If we've seen a '<', we might be in a
24327 template-argument-list. Until Core issue 325 is
24328 resolved, we don't know how this situation ought
24329 to be handled, so try to DTRT. We check whether
24330 what comes after the comma is a valid parameter
24331 declaration list. If it is, then the comma ends
24332 the default argument; otherwise the default
24333 argument continues. */
24336 /* Set ITALP so cp_parser_parameter_declaration_list
24337 doesn't decide to commit to this parse. */
24345 {
24351 }
24352 else
24353 {
24357 }
24364 }
24367 /* If we run into a non-nested `;', `}', or `]',
24368 then the code is invalid -- but the default
24369 argument is certainly over. */
24374 /* Handle correctly int n = sizeof ... ( p ); */
24377 /* Update DEPTH, if necessary. */
24392 /* This might be the comparison operator, or it might
24393 start a template argument list. */
24400 /* Fall through for C++0x, which treats the `>>'
24401 operator like two `>' tokens in certain
24402 cases. */
24406 {
24407 /* This might be an operator, or it might close a
24408 template argument list. But if a previous '<'
24409 started a template argument list, this will have
24410 closed it, so we can't be in one anymore. */
24414 }
24417 /* If we run out of tokens, issue an error message. */
24426 /* In these cases, we should look for template-ids.
24427 For example, if the default argument is
24428 `X<int, double>()', we need to do name lookup to
24429 figure out whether or not `X' is a template; if
24430 so, the `,' does not end the default argument.
24432 That is not yet done. */
24437 }
24439 /* If we've reached the end, stop. */
24443 /* Add the token to the token block. */
24445 }
24447 /* Create a DEFAULT_ARG to represent the unparsed default
24448 argument. */
24455 }
24457 /* Begin parsing tentatively. We always save tokens while parsing
24458 tentatively so that if the tentative parsing fails we can restore the
24459 tokens. */
24461 static void
24463 {
24464 /* Enter a new parsing context. */
24466 /* Begin saving tokens. */
24468 /* In order to avoid repetitive access control error messages,
24469 access checks are queued up until we are no longer parsing
24470 tentatively. */
24472 }
24474 /* Commit to the currently active tentative parse. */
24476 static void
24478 {
24482 /* Mark all of the levels as committed. */
24485 {
24492 }
24493 }
24495 /* Commit to the topmost currently active tentative parse.
24497 Note that this function shouldn't be called when there are
24498 irreversible side-effects while in a tentative state. For
24499 example, we shouldn't create a permanent entry in the symbol
24500 table, or issue an error message that might not apply if the
24501 tentative parse is aborted. */
24503 static void
24505 {
24510 {
24518 }
24519 }
24521 /* Abort the currently active tentative parse. All consumed tokens
24522 will be rolled back, and no diagnostics will be issued. */
24524 static void
24526 {
24530 /* Now, pretend that we want to see if the construct was
24531 successfully parsed. */
24533 }
24535 /* Stop parsing tentatively. If a parse error has occurred, restore the
24536 token stream. Otherwise, commit to the tokens we have consumed.
24537 Returns true if no error occurred; false otherwise. */
24539 static bool
24541 {
24545 /* Remember whether or not an error occurred, since we are about to
24546 destroy that information. */
24548 /* Remove the topmost context from the stack. */
24551 /* If no parse errors occurred, commit to the tentative parse. */
24553 {
24554 /* Commit to the tokens read tentatively, unless that was
24555 already done. */
24560 }
24561 /* Otherwise, if errors occurred, roll back our state so that things
24562 are just as they were before we began the tentative parse. */
24563 else
24564 {
24567 }
24568 /* Add the context to the front of the free list. */
24573 }
24575 /* Returns true if we are parsing tentatively and are not committed to
24576 this tentative parse. */
24578 static bool
24580 {
24583 }
24585 /* Returns nonzero iff an error has occurred during the most recent
24586 tentative parse. */
24588 static bool
24590 {
24593 }
24595 /* Returns nonzero if GNU extensions are allowed. */
24597 static bool
24599 {
24601 }
24602 \f
24603 /* Objective-C++ Productions */
24606 /* Parse an Objective-C expression, which feeds into a primary-expression
24607 above.
24609 objc-expression:
24610 objc-message-expression
24611 objc-string-literal
24612 objc-encode-expression
24613 objc-protocol-expression
24614 objc-selector-expression
24616 Returns a tree representation of the expression. */
24618 static tree
24620 {
24621 /* Try to figure out what kind of declaration is present. */
24625 {
24635 {
24647 }
24653 }
24656 }
24658 /* Parse an Objective-C message expression.
24660 objc-message-expression:
24661 [ objc-message-receiver objc-message-args ]
24663 Returns a representation of an Objective-C message. */
24665 static tree
24667 {
24676 }
24678 /* Parse an objc-message-receiver.
24680 objc-message-receiver:
24681 expression
24682 simple-type-specifier
24684 Returns a representation of the type or expression. */
24686 static tree
24688 {
24689 tree rcv;
24691 /* An Objective-C message receiver may be either (1) a type
24692 or (2) an expression. */
24701 CP_PARSER_FLAGS_NONE);
24704 }
24706 /* Parse the arguments and selectors comprising an Objective-C message.
24708 objc-message-args:
24709 objc-selector
24710 objc-selector-args
24711 objc-selector-args , objc-comma-args
24713 objc-selector-args:
24714 objc-selector [opt] : assignment-expression
24715 objc-selector-args objc-selector [opt] : assignment-expression
24717 objc-comma-args:
24718 assignment-expression
24719 objc-comma-args , assignment-expression
24721 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
24722 selector arguments and TREE_VALUE containing a list of comma
24723 arguments. */
24725 static tree
24727 {
24733 {
24739 /* Detect if we have a unary selector. */
24748 sel_args
24753 }
24755 /* Handle non-selector arguments, if any. */
24757 {
24758 tree arg;
24763 addl_args
24768 }
24771 {
24774 }
24777 }
24779 /* Parse an Objective-C encode expression.
24781 objc-encode-expression:
24782 @encode objc-typename
24784 Returns an encoded representation of the type argument. */
24786 static tree
24788 {
24789 tree type;
24799 {
24803 }
24805 /* This happens if we find @encode(T) (where T is a template
24806 typename or something dependent on a template typename) when
24807 parsing a template. In that case, we can't compile it
24808 immediately, but we rather create an AT_ENCODE_EXPR which will
24809 need to be instantiated when the template is used.
24810 */
24812 {
24816 }
24819 }
24821 /* Parse an Objective-C @defs expression. */
24823 static tree
24825 {
24826 tree name;
24834 }
24836 /* Parse an Objective-C protocol expression.
24838 objc-protocol-expression:
24839 @protocol ( identifier )
24841 Returns a representation of the protocol expression. */
24843 static tree
24845 {
24846 tree proto;
24854 }
24856 /* Parse an Objective-C selector expression.
24858 objc-selector-expression:
24859 @selector ( objc-method-signature )
24861 objc-method-signature:
24862 objc-selector
24863 objc-selector-seq
24865 objc-selector-seq:
24866 objc-selector :
24867 objc-selector-seq objc-selector :
24869 Returns a representation of the method selector. */
24871 static tree
24873 {
24885 {
24894 {
24895 /* Detect if we have a unary selector. */
24897 {
24900 }
24901 else
24902 {
24904 }
24905 }
24910 {
24911 sel_seq
24914 sel_seq
24917 }
24918 else
24919 sel_seq
24924 }
24926 finish_selector:
24930 }
24932 /* Parse a list of identifiers.
24934 objc-identifier-list:
24935 identifier
24936 objc-identifier-list , identifier
24938 Returns a TREE_LIST of identifier nodes. */
24940 static tree
24942 {
24943 tree identifier;
24944 tree list;
24955 {
24962 identifier));
24964 }
24967 }
24969 /* Parse an Objective-C alias declaration.
24971 objc-alias-declaration:
24972 @compatibility_alias identifier identifier ;
24974 This function registers the alias mapping with the Objective-C front end.
24975 It returns nothing. */
24977 static void
24979 {
24987 }
24989 /* Parse an Objective-C class forward-declaration.
24991 objc-class-declaration:
24992 @class objc-identifier-list ;
24994 The function registers the forward declarations with the Objective-C
24995 front end. It returns nothing. */
24997 static void
24999 {
25002 {
25003 tree id;
25013 else
25015 }
25017 }
25019 /* Parse a list of Objective-C protocol references.
25021 objc-protocol-refs-opt:
25022 objc-protocol-refs [opt]
25024 objc-protocol-refs:
25025 < objc-identifier-list >
25027 Returns a TREE_LIST of identifiers, if any. */
25029 static tree
25031 {
25035 {
25039 }
25042 }
25044 /* Parse a Objective-C visibility specification. */
25046 static void
25048 {
25052 {
25067 }
25069 /* Eat '@private'/'@protected'/'@public'. */
25071 }
25073 /* Parse an Objective-C method type. Return 'true' if it is a class
25074 (+) method, and 'false' if it is an instance (-) method. */
25078 {
25081 else
25083 }
25085 /* Parse an Objective-C protocol qualifier. */
25087 static tree
25089 {
25102 {
25107 }
25110 }
25112 /* Parse an Objective-C typename. */
25114 static tree
25116 {
25120 {
25126 /* An ObjC type name may consist of just protocol qualifiers, in which
25127 case the type shall default to 'id'. */
25129 {
25132 /* If the type could not be parsed, an error has already
25133 been produced. For error recovery, behave as if it had
25134 not been specified, which will use the default type
25135 'id'. */
25137 {
25139 /* We need to skip to the closing parenthesis as
25140 cp_parser_type_id() does not seem to do it for
25141 us. */
25146 }
25147 }
25151 }
25154 }
25156 /* Check to see if TYPE refers to an Objective-C selector name. */
25158 static bool
25160 {
25166 }
25168 /* Parse an Objective-C selector. */
25170 static tree
25172 {
25176 {
25179 }
25181 /* C++ operator names are allowed to appear in ObjC selectors. */
25183 {
25196 }
25197 }
25199 /* Parse an Objective-C params list. */
25201 static tree
25203 {
25209 {
25219 /* Detect if we have a unary selector. */
25222 {
25225 }
25229 {
25230 /* Something went quite wrong. There should be a colon
25231 here, but there is not. Stop parsing parameters. */
25233 }
25235 /* New ObjC allows attributes on parameters too. */
25240 params
25243 type_name,
25244 identifier,
25245 parm_attr));
25248 }
25251 {
25254 }
25256 /* We allow tail attributes for the method. */
25258 {
25266 }
25269 {
25272 }
25274 }
25276 /* Parse the non-keyword Objective-C params. */
25278 static tree
25281 {
25287 {
25289 tree parm;
25295 {
25300 }
25302 /* TODO: parse attributes for tail parameters. */
25311 }
25313 /* We allow tail attributes for the method. */
25315 {
25317 {
25322 }
25323 else
25324 /* We have an error, but parse the attributes, so that we can
25325 carry on. */
25331 }
25334 }
25336 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
25338 static void
25340 {
25343 /* If the next token is `extern' and the following token is a string
25344 literal, then we have a linkage specification. */
25346 && cp_parser_is_pure_string_literal
25349 /* Handle #pragma, if any. */
25352 /* Allow stray semicolons. */
25355 /* Mark methods as optional or required, when building protocols. */
25357 {
25360 }
25362 {
25365 }
25368 /* Other stray characters must generate errors. */
25370 {
25374 }
25375 /* Finally, try to parse a block-declaration, or a function-definition. */
25376 else
25378 }
25380 /* Parse a method signature. */
25382 static tree
25384 {
25400 }
25402 static bool
25404 {
25405 tree tattr;
25410 /* If the attributes are followed by a method introducer, this is not allowed.
25411 Dump the attributes and flag the situation. */
25416 /* Otherwise, the attributes introduce some interstitial code, possibly so
25417 rewind to allow that check. */
25420 }
25422 /* Parse an Objective-C method prototype list. */
25424 static void
25426 {
25430 {
25432 {
25437 else
25441 {
25445 }
25448 }
25454 OPT_Wattributes,
25456 else
25457 /* Allow for interspersed non-ObjC++ code. */
25461 }
25465 else
25469 }
25471 /* Parse an Objective-C method definition list. */
25473 static void
25475 {
25479 {
25480 tree meth;
25483 {
25489 else
25494 {
25498 }
25500 NULL_TREE);
25502 /* For historical reasons, we accept an optional semicolon. */
25509 {
25516 }
25517 }
25518 /* The following case will be removed once @synthesize is
25519 completely implemented. */
25530 else
25531 /* Allow for interspersed non-ObjC++ code. */
25535 }
25539 else
25543 }
25545 /* Parse Objective-C ivars. */
25547 static void
25549 {
25560 {
25561 cp_decl_specifier_seq declspecs;
25563 tree prefix_attributes;
25571 CP_PARSER_FLAGS_OPTIONAL,
25575 /* auto, register, static, extern, mutable. */
25577 {
25580 }
25582 /* thread_local. */
25584 {
25587 }
25589 /* typedef. */
25591 {
25594 }
25599 /* Keep going until we hit the `;' at the end of the
25600 declaration. */
25602 {
25607 /* Check for a (possibly unnamed) bitfield declaration. */
25615 {
25616 /* Get the name of the bitfield. */
25619 sfk_none);
25621 eat_colon:
25623 /* Get the width of the bitfield. */
25624 width
25627 NULL);
25628 }
25629 else
25630 {
25631 /* Parse the declarator. */
25632 declarator
25637 }
25639 /* Look for attributes that apply to the ivar. */
25641 /* Remember which attributes are prefix attributes and
25642 which are not. */
25644 /* Combine the attributes. */
25648 /* Create the bitfield declaration. */
25650 width,
25651 attributes);
25652 else
25657 /* Add the instance variable. */
25661 /* Reset PREFIX_ATTRIBUTES. */
25670 {
25673 }
25675 }
25679 }
25684 /* Do not consume the RID_AT_END, so it will be read again as terminating
25685 the @interface of @implementation. */
25689 /* For historical reasons, we accept an optional semicolon. */
25692 }
25694 /* Parse an Objective-C protocol declaration. */
25696 static void
25698 {
25704 {
25709 }
25711 /* See if we have a forward declaration or a definition. */
25714 /* Try a forward declaration first. */
25716 {
25718 {
25719 tree id;
25729 else
25731 }
25733 }
25735 /* Ok, we got a full-fledged definition (or at least should). */
25736 else
25737 {
25742 }
25743 }
25745 /* Parse an Objective-C superclass or category. */
25747 static void
25752 {
25758 {
25761 }
25763 {
25766 /* If there is no category name, and this is an @interface, we
25767 have a class extension. */
25769 {
25772 }
25773 else
25777 }
25778 }
25780 /* Parse an Objective-C class interface. */
25782 static void
25784 {
25791 {
25792 /* It's hard to recover because even if valid @interface stuff
25793 is to follow, we can't compile it (or validate it) if we
25794 don't even know which class it refers to. Let's assume this
25795 was a stray '@interface' token in the stream and skip it.
25796 */
25798 }
25803 /* We have either a class or a category on our hands. */
25806 else
25807 {
25809 /* Handle instance variable declarations, if any. */
25812 }
25815 }
25817 /* Parse an Objective-C class implementation. */
25819 static void
25821 {
25828 {
25829 /* It's hard to recover because even if valid @implementation
25830 stuff is to follow, we can't compile it (or validate it) if
25831 we don't even know which class it refers to. Let's assume
25832 this was a stray '@implementation' token in the stream and
25833 skip it.
25834 */
25836 }
25840 /* We have either a class or a category on our hands. */
25843 else
25844 {
25846 /* Handle instance variable declarations, if any. */
25849 }
25852 }
25854 /* Consume the @end token and finish off the implementation. */
25856 static void
25858 {
25861 }
25863 /* Parse an Objective-C declaration. */
25865 static void
25867 {
25868 /* Try to figure out what kind of declaration is present. */
25873 {
25889 }
25892 {
25915 }
25916 }
25918 /* Parse an Objective-C try-catch-finally statement.
25920 objc-try-catch-finally-stmt:
25921 @try compound-statement objc-catch-clause-seq [opt]
25922 objc-finally-clause [opt]
25924 objc-catch-clause-seq:
25925 objc-catch-clause objc-catch-clause-seq [opt]
25927 objc-catch-clause:
25928 @catch ( objc-exception-declaration ) compound-statement
25930 objc-finally-clause:
25931 @finally compound-statement
25933 objc-exception-declaration:
25934 parameter-declaration
25935 '...'
25937 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
25939 Returns NULL_TREE.
25941 PS: This function is identical to c_parser_objc_try_catch_finally_statement
25942 for C. Keep them in sync. */
25944 static tree
25946 {
25947 location_t location;
25948 tree stmt;
25953 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
25954 node, lest it get absorbed into the surrounding block. */
25960 {
25969 {
25970 /* We have "@catch (...)" (where the '...' are literally
25971 what is in the code). Skip the '...'.
25972 parameter_declaration is set to NULL_TREE, and
25973 objc_being_catch_clauses() knows that that means
25974 '...'. */
25977 }
25978 else
25979 {
25980 /* We have "@catch (NSException *exception)" or something
25981 like that. Parse the parameter declaration. */
25985 else
25990 }
25993 else
25994 {
25995 /* If there was no open parenthesis, we are recovering from
25996 an error, and we are trying to figure out what mistake
25997 the user has made. */
25999 /* If there is an immediate closing parenthesis, the user
26000 probably forgot the opening one (ie, they typed "@catch
26001 NSException *e)". Parse the closing parenthesis and keep
26002 going. */
26006 /* If these is no immediate closing parenthesis, the user
26007 probably doesn't know that parenthesis are required at
26008 all (ie, they typed "@catch NSException *e"). So, just
26009 forget about the closing parenthesis and keep going. */
26010 }
26014 }
26016 {
26019 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26020 node, lest it get absorbed into the surrounding block. */
26024 }
26027 }
26029 /* Parse an Objective-C synchronized statement.
26031 objc-synchronized-stmt:
26032 @synchronized ( expression ) compound-statement
26034 Returns NULL_TREE. */
26036 static tree
26038 {
26039 location_t location;
26050 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26051 node, lest it get absorbed into the surrounding block. */
26056 }
26058 /* Parse an Objective-C throw statement.
26060 objc-throw-stmt:
26061 @throw assignment-expression [opt] ;
26063 Returns a constructed '@throw' statement. */
26065 static tree
26067 {
26079 }
26081 /* Parse an Objective-C statement. */
26083 static tree
26085 {
26086 /* Try to figure out what kind of declaration is present. */
26090 {
26101 }
26104 }
26106 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26107 look ahead to see if an objc keyword follows the attributes. This
26108 is to detect the use of prefix attributes on ObjC @interface and
26109 @protocol. */
26111 static bool
26113 {
26118 {
26121 }
26124 }
26126 /* This routine is a minimal replacement for
26127 c_parser_struct_declaration () used when parsing the list of
26128 types/names or ObjC++ properties. For example, when parsing the
26129 code
26131 @property (readonly) int a, b, c;
26133 this function is responsible for parsing "int a, int b, int c" and
26134 returning the declarations as CHAIN of DECLs.
26136 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26137 similar parsing. */
26138 static tree
26140 {
26142 cp_decl_specifier_seq declspecs;
26144 tree prefix_attributes;
26147 CP_PARSER_FLAGS_NONE,
26154 /* auto, register, static, extern, mutable. */
26156 {
26159 }
26161 /* thread_local. */
26163 {
26166 }
26168 /* typedef. */
26170 {
26173 }
26178 /* Keep going until we hit the `;' at the end of the declaration. */
26180 {
26185 /* Parse the declarator. */
26189 /* Look for attributes that apply to the ivar. */
26191 /* Remember which attributes are prefix attributes and
26192 which are not. */
26194 /* Combine the attributes. */
26204 /* Reset PREFIX_ATTRIBUTES. */
26215 {
26218 }
26219 else
26221 }
26223 }
26225 /* Parse an Objective-C @property declaration. The syntax is:
26227 objc-property-declaration:
26228 '@property' objc-property-attributes[opt] struct-declaration ;
26230 objc-property-attributes:
26231 '(' objc-property-attribute-list ')'
26233 objc-property-attribute-list:
26234 objc-property-attribute
26235 objc-property-attribute-list, objc-property-attribute
26237 objc-property-attribute
26238 'getter' = identifier
26239 'setter' = identifier
26240 'readonly'
26241 'readwrite'
26242 'assign'
26243 'retain'
26244 'copy'
26245 'nonatomic'
26247 For example:
26248 @property NSString *name;
26249 @property (readonly) id object;
26250 @property (retain, nonatomic, getter=getTheName) id name;
26251 @property int a, b, c;
26253 PS: This function is identical to
26254 c_parser_objc_at_property_declaration for C. Keep them in sync. */
26255 static void
26257 {
26258 /* The following variables hold the attributes of the properties as
26259 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
26260 seen. When we see an attribute, we set them to 'true' (if they
26261 are boolean properties) or to the identifier (if they have an
26262 argument, ie, for getter and setter). Note that here we only
26263 parse the list of attributes, check the syntax and accumulate the
26264 attributes that we find. objc_add_property_declaration() will
26265 then process the information. */
26275 /* 'properties' is the list of properties that we read. Usually a
26276 single one, but maybe more (eg, in "@property int a, b, c;" there
26277 are three). */
26278 tree properties;
26279 location_t loc;
26285 /* Parse the optional attribute list... */
26287 {
26288 /* Eat the '('. */
26292 {
26298 {
26301 }
26305 {
26316 {
26320 else
26325 }
26328 {
26332 }
26334 {
26336 {
26339 }
26340 else
26344 else
26346 }
26347 else
26348 {
26350 {
26353 }
26354 else
26356 }
26362 }
26369 else
26371 }
26373 /* FIXME: "@property (setter, assign);" will generate a spurious
26374 "error: expected ‘)’ before ‘,’ token". This is because
26375 cp_parser_require, unlike the C counterpart, will produce an
26376 error even if we are in error recovery. */
26378 {
26383 }
26384 }
26386 /* ... and the property declaration(s). */
26390 {
26392 /* If the next token is now a `;', consume it. */
26396 }
26400 else
26401 {
26402 /* Comma-separated properties are chained together in
26403 reverse order; add them one by one. */
26412 }
26415 }
26417 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
26419 objc-synthesize-declaration:
26420 @synthesize objc-synthesize-identifier-list ;
26422 objc-synthesize-identifier-list:
26423 objc-synthesize-identifier
26424 objc-synthesize-identifier-list, objc-synthesize-identifier
26426 objc-synthesize-identifier
26427 identifier
26428 identifier = identifier
26430 For example:
26431 @synthesize MyProperty;
26432 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
26434 PS: This function is identical to c_parser_objc_at_synthesize_declaration
26435 for C. Keep them in sync.
26436 */
26437 static void
26439 {
26441 location_t loc;
26446 {
26450 {
26453 }
26455 {
26459 {
26462 }
26463 }
26464 else
26469 else
26471 }
26474 }
26476 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
26478 objc-dynamic-declaration:
26479 @dynamic identifier-list ;
26481 For example:
26482 @dynamic MyProperty;
26483 @dynamic MyProperty, AnotherProperty;
26485 PS: This function is identical to c_parser_objc_at_dynamic_declaration
26486 for C. Keep them in sync.
26487 */
26488 static void
26490 {
26492 location_t loc;
26497 {
26498 tree property;
26501 {
26504 }
26508 else
26510 }
26513 }
26515 \f
26516 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
26518 /* Returns name of the next clause.
26519 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
26520 the token is not consumed. Otherwise appropriate pragma_omp_clause is
26521 returned and the token is consumed. */
26523 static pragma_omp_clause
26525 {
26537 {
26542 {
26637 }
26638 }
26644 }
26646 /* Validate that a clause of the given type does not already exist. */
26648 static void
26651 {
26652 tree c;
26656 {
26659 }
26660 }
26662 /* OpenMP 2.5:
26663 variable-list:
26664 identifier
26665 variable-list , identifier
26667 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
26668 colon). An opening parenthesis will have been consumed by the caller.
26670 If KIND is nonzero, create the appropriate node and install the decl
26671 in OMP_CLAUSE_DECL and add the node to the head of the list.
26673 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
26674 return the list created.
26676 COLON can be NULL if only closing parenthesis should end the list,
26677 or pointer to bool which will receive false if the list is terminated
26678 by closing parenthesis or true if the list is terminated by colon. */
26680 static tree
26683 {
26687 {
26690 }
26692 {
26709 {
26711 {
26717 {
26724 NULL);
26726 parser->colon_corrects_to_scope_p
26730 else
26731 {
26732 /* Look for `:'. */
26736 CPP_CLOSE_SQUARE))
26739 NULL);
26740 }
26741 /* Look for the closing `]'. */
26743 RT_CLOSE_SQUARE))
26746 }
26750 }
26756 }
26757 else
26760 get_comma:
26764 }
26770 {
26774 }
26777 {
26780 /* Try to resync to an unnested comma. Copied from
26781 cp_parser_parenthesized_expression_list. */
26782 skip_comma:
26791 }
26794 }
26796 /* Similarly, but expect leading and trailing parenthesis. This is a very
26797 common case for omp clauses. */
26799 static tree
26801 {
26805 }
26807 /* OpenMP 3.0:
26808 collapse ( constant-expression ) */
26810 static tree
26812 {
26814 location_t loc;
26815 HOST_WIDE_INT n;
26835 {
26838 }
26846 }
26848 /* OpenMP 2.5:
26849 default ( shared | none ) */
26851 static tree
26853 {
26855 tree c;
26860 {
26865 {
26880 }
26883 }
26884 else
26885 {
26886 invalid_kind:
26888 }
26904 }
26906 /* OpenMP 3.1:
26907 final ( expression ) */
26909 static tree
26911 {
26932 }
26934 /* OpenMP 2.5:
26935 if ( expression ) */
26937 static tree
26939 {
26960 }
26962 /* OpenMP 3.1:
26963 mergeable */
26965 static tree
26968 {
26969 tree c;
26972 location);
26977 }
26979 /* OpenMP 2.5:
26980 nowait */
26982 static tree
26985 {
26986 tree c;
26993 }
26995 /* OpenMP 2.5:
26996 num_threads ( expression ) */
26998 static tree
27000 location_t location)
27001 {
27023 }
27025 /* OpenMP 2.5:
27026 ordered */
27028 static tree
27031 {
27032 tree c;
27040 }
27042 /* OpenMP 2.5:
27043 reduction ( reduction-operator : variable-list )
27045 reduction-operator:
27046 One of: + * - & ^ | && ||
27048 OpenMP 3.1:
27050 reduction-operator:
27051 One of: + * - & ^ | && || min max
27053 OpenMP 4.0:
27055 reduction-operator:
27056 One of: + * - & ^ | && ||
27057 id-expression */
27059 static tree
27061 {
27069 {
27079 }
27083 else
27084 {
27095 {
27125 }
27126 else
27127 {
27129 resync_fail:
27134 }
27135 }
27141 NULL);
27143 {
27146 }
27149 }
27151 /* OpenMP 2.5:
27152 schedule ( schedule-kind )
27153 schedule ( schedule-kind , expression )
27155 schedule-kind:
27156 static | dynamic | guided | runtime | auto */
27158 static tree
27160 {
27169 {
27174 {
27195 }
27196 }
27201 else
27206 {
27221 else
27226 }
27234 invalid_kind:
27236 resync_fail:
27241 }
27243 /* OpenMP 3.0:
27244 untied */
27246 static tree
27249 {
27250 tree c;
27257 }
27259 /* OpenMP 4.0:
27260 inbranch
27261 notinbranch */
27263 static tree
27266 {
27271 }
27273 /* OpenMP 4.0:
27274 parallel
27275 for
27276 sections
27277 taskgroup */
27279 static tree
27283 {
27287 }
27289 /* OpenMP 4.0:
27290 num_teams ( expression ) */
27292 static tree
27294 location_t location)
27295 {
27317 }
27319 /* OpenMP 4.0:
27320 thread_limit ( expression ) */
27322 static tree
27324 location_t location)
27325 {
27347 }
27349 /* OpenMP 4.0:
27350 aligned ( variable-list )
27351 aligned ( variable-list : constant-expression ) */
27353 static tree
27355 {
27366 {
27376 }
27382 }
27384 /* OpenMP 4.0:
27385 linear ( variable-list )
27386 linear ( variable-list : expression ) */
27388 static tree
27390 {
27401 {
27411 }
27417 }
27419 /* OpenMP 4.0:
27420 safelen ( constant-expression ) */
27422 static tree
27424 location_t location)
27425 {
27446 }
27448 /* OpenMP 4.0:
27449 simdlen ( constant-expression ) */
27451 static tree
27453 location_t location)
27454 {
27475 }
27477 /* OpenMP 4.0:
27478 depend ( depend-kind : variable-list )
27480 depend-kind:
27481 in | out | inout */
27483 static tree
27485 {
27493 {
27503 else
27505 }
27506 else
27514 NULL);
27521 invalid_kind:
27523 resync_fail:
27528 }
27530 /* OpenMP 4.0:
27531 map ( map-kind : variable-list )
27532 map ( variable-list )
27534 map-kind:
27535 alloc | to | from | tofrom */
27537 static tree
27539 {
27548 {
27560 else
27561 {
27567 }
27570 }
27573 NULL);
27579 }
27581 /* OpenMP 4.0:
27582 device ( expression ) */
27584 static tree
27586 location_t location)
27587 {
27609 }
27611 /* OpenMP 4.0:
27612 dist_schedule ( static )
27613 dist_schedule ( static , expression ) */
27615 static tree
27617 location_t location)
27618 {
27631 {
27642 }
27647 location);
27651 invalid_kind:
27653 resync_fail:
27658 }
27660 /* OpenMP 4.0:
27661 proc_bind ( proc-bind-kind )
27663 proc-bind-kind:
27664 master | close | spread */
27666 static tree
27668 location_t location)
27669 {
27670 tree c;
27677 {
27687 else
27689 }
27690 else
27699 location);
27704 invalid_kind:
27706 resync_fail:
27711 }
27713 /* Parse all OpenMP clauses. The set clauses allowed by the directive
27714 is a bitmask in MASK. Return the list of clauses found; the result
27715 of clause default goes in *pdefault. */
27717 static tree
27721 {
27727 {
27728 pragma_omp_clause c_kind;
27739 {
27751 clauses);
27765 clauses);
27774 clauses);
27798 clauses);
27812 clauses);
27827 OMP_CLAUSE_NOTINBRANCH,
27836 {
27837 clause_not_first:
27841 }
27866 clauses);
27871 clauses);
27876 clauses);
27933 }
27938 {
27939 /* Remove the invalid clause(s) from the list to avoid
27940 confusing the rest of the compiler. */
27943 }
27944 }
27945 saw_error:
27950 }
27952 /* OpenMP 2.5:
27953 structured-block:
27954 statement
27956 In practice, we're also interested in adding the statement to an
27957 outer node. So it is convenient if we work around the fact that
27958 cp_parser_statement calls add_stmt. */
27960 static unsigned
27962 {
27965 /* Only move the values to IN_OMP_BLOCK if they weren't false.
27966 This preserves the "not within loop or switch" style error messages
27967 for nonsense cases like
27968 void foo() {
27969 #pragma omp single
27970 break;
27971 }
27972 */
27977 }
27979 static void
27981 {
27983 }
27985 static tree
27987 {
27995 }
27997 /* OpenMP 2.5:
27998 # pragma omp atomic new-line
27999 expression-stmt
28001 expression-stmt:
28002 x binop= expr | x++ | ++x | x-- | --x
28003 binop:
28004 +, *, -, /, &, ^, |, <<, >>
28006 where x is an lvalue expression with scalar type.
28008 OpenMP 3.1:
28009 # pragma omp atomic new-line
28010 update-stmt
28012 # pragma omp atomic read new-line
28013 read-stmt
28015 # pragma omp atomic write new-line
28016 write-stmt
28018 # pragma omp atomic update new-line
28019 update-stmt
28021 # pragma omp atomic capture new-line
28022 capture-stmt
28024 # pragma omp atomic capture new-line
28025 capture-block
28027 read-stmt:
28028 v = x
28029 write-stmt:
28030 x = expr
28031 update-stmt:
28032 expression-stmt | x = x binop expr
28033 capture-stmt:
28034 v = expression-stmt
28035 capture-block:
28036 { v = x; update-stmt; } | { update-stmt; v = x; }
28038 OpenMP 4.0:
28039 update-stmt:
28040 expression-stmt | x = x binop expr | x = expr binop x
28041 capture-stmt:
28042 v = update-stmt
28043 capture-block:
28044 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28046 where x and v are lvalue expressions with scalar type. */
28048 static void
28050 {
28058 {
28070 else
28074 }
28077 {
28082 {
28085 }
28086 }
28090 {
28101 else
28107 {
28108 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28109 opcode. */
28114 }
28118 {
28121 }
28122 else
28123 {
28130 }
28133 }
28135 restart:
28140 {
28147 /* FALLTHROUGH */
28157 /* FALLTHROUGH */
28172 /* Undo effects of boolean_increment for post {in,de}crement. */
28174 /* FALLTHRU */
28178 {
28179 /* Undo effects of boolean_increment. */
28181 {
28182 /* This is pre or post increment. */
28187 && !structured_block
28191 }
28192 }
28193 /* FALLTHRU */
28196 {
28231 {
28235 }
28238 {
28244 {
28249 }
28251 {
28262 {
28264 {
28269 }
28270 else
28272 }
28276 }
28279 {
28286 }
28290 }
28294 {
28297 {
28305 }
28307 {
28312 }
28347 }
28358 /* FALLTHROUGH */
28363 }
28370 }
28371 stmt_done:
28373 {
28386 }
28388 {
28391 }
28392 done:
28398 saw_error:
28401 {
28405 {
28409 }
28410 }
28411 }
28414 /* OpenMP 2.5:
28415 # pragma omp barrier new-line */
28417 static void
28419 {
28422 }
28424 /* OpenMP 2.5:
28425 # pragma omp critical [(name)] new-line
28426 structured-block */
28428 static tree
28430 {
28434 {
28446 }
28451 }
28453 /* OpenMP 2.5:
28454 # pragma omp flush flush-vars[opt] new-line
28456 flush-vars:
28457 ( variable-list ) */
28459 static void
28461 {
28467 }
28469 /* Helper function, to parse omp for increment expression. */
28471 static tree
28473 {
28478 {
28481 }
28484 {
28492 }
28494 /* If decl is an iterator, preserve LHS and RHS of the relational
28495 expr until finish_omp_for. */
28505 }
28507 /* Helper function, to parse omp for increment expression. */
28509 static tree
28511 {
28515 cp_id_kind idk;
28519 {
28527 }
28535 {
28540 }
28547 {
28551 }
28563 do
28564 {
28571 {
28573 {
28576 else
28578 tf_warning_or_error);
28579 }
28580 else
28583 }
28584 }
28588 {
28592 }
28593 else
28597 }
28599 /* Parse the restricted form of the for statement allowed by OpenMP. */
28601 static tree
28604 {
28608 location_t loc_first;
28627 {
28630 location_t loc;
28633 {
28636 }
28645 {
28646 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
28648 init-expr:
28649 var = lb
28650 integer-type var = lb
28651 random-access-iterator-type var = lb
28652 pointer-type var = lb
28653 */
28654 cp_decl_specifier_seq type_specifiers;
28656 /* First, try to parse as an initialized declaration. See
28657 cp_parser_condition, from whence the bulk of this is copied. */
28664 {
28665 /* If parsing a type specifier seq succeeded, then this
28666 MUST be a initialized declaration. */
28671 CP_PARSER_DECLARATOR_NAMED,
28681 else
28682 {
28692 {
28694 CPP_OPEN_PAREN))
28697 else
28698 /* Trigger an error. */
28703 }
28707 {
28715 {
28718 auto_node);
28723 }
28726 asm_specification,
28727 LOOKUP_ONLYCONVERTING);
28729 {
28732 }
28733 else
28736 }
28737 else
28738 {
28739 /* Consume '='. */
28743 non_class:
28746 else
28749 asm_specification,
28750 LOOKUP_ONLYCONVERTING);
28751 }
28755 }
28756 }
28757 else
28758 {
28759 cp_id_kind idk;
28760 /* If parsing a type specifier sequence failed, then
28761 this MUST be a simple expression. */
28766 && decl
28769 {
28770 tree rhs;
28777 rhs,
28778 tf_warning_or_error));
28780 }
28781 else
28782 {
28787 {
28791 }
28792 }
28793 }
28794 }
28797 {
28800 {
28806 }
28807 else
28809 }
28816 {
28821 {
28825 }
28828 {
28829 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
28830 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
28839 }
28840 else
28841 {
28846 }
28847 }
28850 {
28851 tree c;
28853 {
28862 decl);
28866 decl);
28867 }
28869 {
28874 {
28877 }
28878 }
28879 }
28888 {
28889 /* If decl is an iterator, preserve the operator on decl
28890 until finish_omp_for. */
28892 && ((processing_template_decl
28896 else
28900 }
28915 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
28916 in between the collapsed for loops to be still considered perfectly
28917 nested. Hopefully the final version clarifies this.
28918 For now handle (multiple) {'s and empty statements. */
28920 do
28921 {
28925 {
28927 bracecount++;
28928 }
28932 else
28933 {
28940 }
28941 }
28945 {
28948 }
28949 }
28951 /* Note that we saved the original contents of this flag when we entered
28952 the structured block, and so we don't need to re-save it here. */
28955 /* Note that the grammar doesn't call for a structured block here,
28956 though the loop as a whole is a structured block. */
28963 else
28968 {
28970 {
28972 nbraces--;
28973 }
28976 else
28977 {
28979 {
28982 }
28987 }
28988 }
28995 }
28997 /* Helper function for OpenMP parsing, split clauses and call
28998 finish_omp_clauses on each of the set of clauses afterwards. */
29000 static void
29003 {
29009 }
29011 /* OpenMP 4.0:
29012 #pragma omp simd simd-clause[optseq] new-line
29013 for-loop */
29015 #define OMP_SIMD_CLAUSE_MASK \
29016 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29017 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29018 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29019 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29020 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29021 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29022 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29024 static tree
29027 {
29039 {
29042 }
29053 }
29055 /* OpenMP 2.5:
29056 #pragma omp for for-clause[optseq] new-line
29057 for-loop
29059 OpenMP 4.0:
29060 #pragma omp for simd for-simd-clause[optseq] new-line
29061 for-loop */
29063 #define OMP_FOR_CLAUSE_MASK \
29064 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29065 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29066 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29067 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29068 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29069 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29070 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29071 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29073 static tree
29076 {
29087 {
29092 {
29101 cclauses);
29113 }
29114 }
29119 {
29122 }
29133 }
29135 /* OpenMP 2.5:
29136 # pragma omp master new-line
29137 structured-block */
29139 static tree
29141 {
29145 }
29147 /* OpenMP 2.5:
29148 # pragma omp ordered new-line
29149 structured-block */
29151 static tree
29153 {
29157 }
29159 /* OpenMP 2.5:
29161 section-scope:
29162 { section-sequence }
29164 section-sequence:
29165 section-directive[opt] structured-block
29166 section-sequence section-directive structured-block */
29168 static tree
29170 {
29181 {
29185 }
29188 {
29196 {
29200 }
29202 {
29205 }
29210 }
29221 }
29223 /* OpenMP 2.5:
29224 # pragma omp sections sections-clause[optseq] newline
29225 sections-scope */
29227 #define OMP_SECTIONS_CLAUSE_MASK \
29228 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29229 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29230 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29231 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29232 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29234 static tree
29237 {
29249 {
29252 }
29259 }
29261 /* OpenMP 2.5:
29262 # pragma parallel parallel-clause new-line
29263 # pragma parallel for parallel-for-clause new-line
29264 # pragma parallel sections parallel-sections-clause new-line
29266 OpenMP 4.0:
29267 # pragma parallel for simd parallel-for-simd-clause new-line */
29269 #define OMP_PARALLEL_CLAUSE_MASK \
29270 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29272 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29273 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29274 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29275 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
29276 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29277 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
29278 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
29280 static tree
29283 {
29292 {
29303 block);
29306 }
29308 {
29312 }
29314 {
29318 {
29328 block);
29331 }
29332 }
29342 }
29344 /* OpenMP 2.5:
29345 # pragma omp single single-clause[optseq] new-line
29346 structured-block */
29348 #define OMP_SINGLE_CLAUSE_MASK \
29349 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29350 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29351 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
29352 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
29354 static tree
29356 {
29366 }
29368 /* OpenMP 3.0:
29369 # pragma omp task task-clause[optseq] new-line
29370 structured-block */
29372 #define OMP_TASK_CLAUSE_MASK \
29373 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
29374 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
29375 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
29376 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29377 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29378 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29379 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
29380 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
29381 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
29383 static tree
29385 {
29396 }
29398 /* OpenMP 3.0:
29399 # pragma omp taskwait new-line */
29401 static void
29403 {
29406 }
29408 /* OpenMP 3.1:
29409 # pragma omp taskyield new-line */
29411 static void
29413 {
29416 }
29418 /* OpenMP 4.0:
29419 # pragma omp taskgroup new-line
29420 structured-block */
29422 static tree
29424 {
29428 }
29431 /* OpenMP 2.5:
29432 # pragma omp threadprivate (variable-list) */
29434 static void
29436 {
29437 tree vars;
29443 }
29445 /* OpenMP 4.0:
29446 # pragma omp cancel cancel-clause[optseq] new-line */
29448 #define OMP_CANCEL_CLAUSE_MASK \
29449 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29450 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29451 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29452 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
29453 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29455 static void
29457 {
29461 }
29463 /* OpenMP 4.0:
29464 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
29466 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
29467 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
29468 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
29469 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
29470 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
29472 static void
29474 {
29475 tree clauses;
29479 {
29484 {
29487 }
29488 }
29490 {
29494 }
29497 OMP_CANCELLATION_POINT_CLAUSE_MASK,
29499 pragma_tok);
29501 }
29503 /* OpenMP 4.0:
29504 #pragma omp distribute distribute-clause[optseq] new-line
29505 for-loop */
29507 #define OMP_DISTRIBUTE_CLAUSE_MASK \
29508 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29509 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29510 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
29511 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29513 static tree
29516 {
29525 {
29533 else
29536 {
29545 cclauses);
29546 else
29548 cclauses);
29560 }
29561 }
29566 {
29569 }
29580 }
29582 /* OpenMP 4.0:
29583 # pragma omp teams teams-clause[optseq] new-line
29584 structured-block */
29586 #define OMP_TEAMS_CLAUSE_MASK \
29587 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29588 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29589 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
29590 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29591 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
29592 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
29593 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
29595 static tree
29598 {
29607 {
29611 {
29620 cclauses);
29631 }
29632 }
29637 {
29640 }
29648 }
29650 /* OpenMP 4.0:
29651 # pragma omp target data target-data-clause[optseq] new-line
29652 structured-block */
29654 #define OMP_TARGET_DATA_CLAUSE_MASK \
29655 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
29656 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
29657 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29659 static tree
29661 {
29673 }
29675 /* OpenMP 4.0:
29676 # pragma omp target update target-update-clause[optseq] new-line */
29678 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
29679 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
29680 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
29681 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
29682 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29684 static bool
29687 {
29689 {
29691 "%<#pragma omp target update%> may only be "
29695 }
29697 tree clauses
29702 {
29704 "%<#pragma omp target update must contain at least one "
29707 }
29715 }
29717 /* OpenMP 4.0:
29718 # pragma omp target target-clause[optseq] new-line
29719 structured-block */
29721 #define OMP_TARGET_CLAUSE_MASK \
29722 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
29723 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
29724 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
29726 static bool
29729 {
29731 {
29735 }
29738 {
29743 {
29747 }
29749 {
29752 }
29754 {
29776 }
29777 }
29791 }
29793 /* OpenMP 4.0:
29794 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
29796 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
29797 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
29798 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29799 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29800 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
29801 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
29802 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
29804 static void
29807 {
29809 cp_omp_declare_simd_data data;
29811 {
29816 }
29827 {
29831 {
29844 }
29849 "%<#pragma omp declare simd%> not immediately followed by "
29853 }
29854 }
29856 /* Finalize #pragma omp declare simd clauses after direct declarator has
29857 been parsed, and put that into "omp declare simd" attribute. */
29859 static tree
29861 {
29867 {
29872 }
29877 {
29895 }
29899 }
29902 /* OpenMP 4.0:
29903 # pragma omp declare target new-line
29904 declarations and definitions
29905 # pragma omp end declare target new-line */
29907 static void
29909 {
29912 }
29914 static void
29916 {
29919 {
29922 }
29924 {
29928 {
29931 }
29934 else
29935 {
29939 }
29940 }
29941 else
29942 {
29946 }
29950 "%<#pragma omp end declare target%> without corresponding "
29952 else
29954 }
29956 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
29957 expression and optional initializer clause of
29958 #pragma omp declare reduction. We store the expression(s) as
29959 either 3, 6 or 7 special statements inside of the artificial function's
29960 body. The first two statements are DECL_EXPRs for the artificial
29961 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
29962 expression that uses those variables.
29963 If there was any INITIALIZER clause, this is followed by further statements,
29964 the fourth and fifth statements are DECL_EXPRs for the artificial
29965 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
29966 constructor variant (first token after open paren is not omp_priv),
29967 then the sixth statement is a statement with the function call expression
29968 that uses the OMP_PRIV and optionally OMP_ORIG variable.
29969 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
29970 to initialize the OMP_PRIV artificial variable and there is seventh
29971 statement, a DECL_EXPR of the OMP_PRIV statement again. */
29973 static bool
29975 {
29987 tree combiner;
30002 {
30005 }
30008 {
30015 {
30018 }
30034 {
30038 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30042 == CPP_CLOSE_PAREN
30045 {
30049 }
30054 }
30055 else
30056 {
30072 {
30077 }
30079 tree arg;
30092 }
30103 }
30109 }
30111 /* OpenMP 4.0
30112 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30113 initializer-clause[opt] new-line
30115 initializer-clause:
30116 initializer (omp_priv initializer)
30117 initializer (function-name (argument-list)) */
30119 static void
30122 {
30135 {
30167 }
30179 /* Types may not be defined in declare reduction type list. */
30182 parser->type_definition_forbidden_message
30188 saved_colon_doesnt_start_class_def_p
30193 {
30197 ;
30218 else
30223 else
30225 }
30227 /* Restore the saved message. */
30230 parser->colon_doesnt_start_class_def_p
30235 {
30236 fail:
30240 }
30246 {
30247 tree fntype
30250 NULL_TREE);
30269 {
30274 }
30276 {
30278 {
30287 }
30294 }
30295 else
30296 {
30299 }
30302 else
30305 {
30308 }
30310 {
30313 else
30318 }
30323 else
30324 {
30333 }
30340 }
30344 }
30346 /* OpenMP 4.0
30347 #pragma omp declare simd declare-simd-clauses[optseq] new-line
30348 #pragma omp declare reduction (reduction-id : typename-list : expression) \
30349 initializer-clause[opt] new-line
30350 #pragma omp declare target new-line */
30352 static void
30355 {
30357 {
30362 {
30365 context);
30367 }
30370 {
30373 context);
30375 }
30377 {
30381 }
30382 }
30386 }
30388 /* Main entry point to OpenMP statement pragmas. */
30390 static void
30392 {
30393 tree stmt;
30398 {
30446 }
30450 }
30451 \f
30452 /* Transactional Memory parsing routines. */
30454 /* Parse a transaction attribute.
30456 txn-attribute:
30457 attribute
30458 [ [ identifier ] ]
30460 ??? Simplify this when C++0x bracket attributes are
30461 implemented properly. */
30463 static tree
30465 {
30480 {
30484 /* For keywords, use the canonical spelling,
30485 not the parsed identifier. */
30489 }
30490 else
30494 error1:
30497 }
30499 /* Parse a __transaction_atomic or __transaction_relaxed statement.
30501 transaction-statement:
30502 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
30503 compound-statement
30504 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
30505 */
30507 static tree
30509 {
30524 else
30525 {
30529 }
30531 /* Parse a noexcept specification. */
30534 /* Keep track if we're in the lexical scope of an outer transaction. */
30546 }
30548 /* Parse a __transaction_atomic or __transaction_relaxed expression.
30550 transaction-expression:
30551 __transaction_atomic txn-noexcept-spec[opt] ( expression )
30552 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
30553 */
30555 static tree
30557 {
30582 /* Set this early. This might mean that we allow transaction_cancel in
30583 an expression that we find out later actually has to be a constexpr.
30584 However, we expect that cxx_constant_value will be able to deal with
30585 this; also, if the noexcept has no constexpr, then what we parse next
30586 really is a transaction's body. */
30589 /* Parse a noexcept specification. */
30595 {
30602 }
30603 else
30604 {
30605 /* The only expression that is available got parsed for the noexcept
30606 already. noexcept is true then. */
30609 }
30618 }
30620 /* Parse a function-transaction-block.
30622 function-transaction-block:
30623 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
30624 function-body
30625 __transaction_atomic txn-attribute[opt] function-try-block
30626 __transaction_relaxed ctor-initializer[opt] function-body
30627 __transaction_relaxed function-try-block
30628 */
30630 static bool
30632 {
30648 else
30649 {
30653 }
30661 else
30662 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
30670 }
30672 /* Parse a __transaction_cancel statement.
30674 cancel-statement:
30675 __transaction_cancel txn-attribute[opt] ;
30676 __transaction_cancel txn-attribute[opt] throw-expression ;
30678 ??? Cancel and throw is not yet implemented. */
30680 static tree
30682 {
30688 RT_TRANSACTION_CANCEL);
30695 /* ??? Parse cancel-and-throw here. */
30700 {
30704 }
30706 {
30710 }
30712 {
30715 {
30721 }
30722 }
30724 {
30728 }
30734 }
30735 \f
30736 /* The parser. */
30740 \f
30741 /* Special handling for the first token or line in the file. The first
30742 thing in the file might be #pragma GCC pch_preprocess, which loads a
30743 PCH file, which is a GC collection point. So we need to handle this
30744 first pragma without benefit of an existing lexer structure.
30746 Always returns one token to the caller in *FIRST_TOKEN. This is
30747 either the true first token of the file, or the first token after
30748 the initial pragma. */
30750 static void
30752 {
30761 {
30768 }
30769 else
30772 /* Skip to the end of the pragma. */
30776 /* Now actually load the PCH file. */
30780 /* Read one more token to return to our caller. We have to do this
30781 after reading the PCH file in, since its pointers have to be
30782 live. */
30784 }
30786 /* Normal parsing of a pragma token. Here we can (and must) use the
30787 regular lexer. */
30789 static bool
30791 {
30803 {
30811 {
30821 }
30826 {
30836 }
30841 {
30847 "%<#pragma omp taskwait%> may only be "
30852 }
30857 {
30863 "%<#pragma omp taskyield%> may only be "
30868 }
30873 {
30879 "%<#pragma omp cancel%> may only be "
30884 }
30889 {
30895 "%<#pragma omp cancellation point%> may only be "
30900 }
30938 "%<#pragma omp section%> may only be used in "
30943 {
30950 {
30953 }
30956 }
30963 bad_stmt:
30966 }
30970 }
30972 /* The interface the pragma parsers have to the lexer. */
30974 enum cpp_ttype
30976 {
30989 else
30990 {
30994 }
30997 }
30999 \f
31000 /* External interface. */
31002 /* Parse one entire translation unit. */
31004 void
31006 {
31010 {
31013 }
31021 }
31023 /* Create an identifier for a generic parameter type (a synthesized
31024 template parameter implied by `auto' or a concept identifier). */
31027 static tree
31029 {
31033 }
31035 /* Predicate that behaves as is_auto_or_concept but matches the parent
31036 node of the generic type rather than the generic type itself. This
31037 allows for type transformation in add_implicit_template_parms. */
31041 {
31043 }
31045 /* Add EXPECT_COUNT implicit template parameters gleaned from the generic
31046 type parameters in PARAMETERS to the CURRENT_TEMPLATE_PARMS (creating a new
31047 template parameter list if necessary). Returns PARAMETERS suitably rewritten
31048 to reference the newly created types or ERROR_MARK_NODE on failure. */
31050 tree
31052 tree parameters)
31053 {
31063 /* Roll back a scope level and either introduce a new template parameter list
31064 or update an existing one. The function scope is added back after template
31065 parameter synthesis below. */
31068 /* TPARMS tracks the function's template parameter list. This is either a new
31069 chain in the case of a fully implicit function template or an extension of
31070 the function's explicitly specified template parameter list. */
31074 {
31080 }
31081 else
31082 {
31083 /* Roll back the innermost template parameter list such that it may be
31084 extended in the loop below as if it were being explicitly declared. */
31088 /* Pop the innermost template parms into TPARMS. */
31094 {
31098 }
31101 }
31104 {
31105 tree generic_type_ptr
31115 synth_id);
31119 synth_tmpl_parm),
31123 /* Rewrite the type of P to be the template_parm added above (getdecls is
31124 used to retrieve it since it is the most recent declaration in this
31125 scope). Qualifiers need to be preserved also. */
31132 else
31134 }
31143 }
31145 /* Finish the declaration of a fully implicit function template. Such a
31146 template has no explicit template parameter list so has not been through the
31147 normal template head and tail processing. add_implicit_template_parms tries
31148 to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
31149 provided if the declaration is a class member such that its template
31150 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
31151 form is returned. Otherwise NULL_TREE is returned. */
31153 tree
31155 {
31160 {
31164 }
31175 }