| blob | 6a03f6eb298a33f0f725292c421a818d319d985e |
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
47 // A helper function. Returns the object pointed to by P
48 // and sets P to NULL.
51 {
55 }
59 /* The lexer. */
61 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
62 and c-lex.c) and the C++ parser. */
65 {
67 };
69 /* The various kinds of non integral constant we encounter. */
71 NIC_NONE,
72 /* floating-point literal */
73 NIC_FLOAT,
74 /* %<this%> */
75 NIC_THIS,
76 /* %<__FUNCTION__%> */
77 NIC_FUNC_NAME,
78 /* %<__PRETTY_FUNCTION__%> */
79 NIC_PRETTY_FUNC,
80 /* %<__func__%> */
81 NIC_C99_FUNC,
82 /* "%<va_arg%> */
83 NIC_VA_ARG,
84 /* a cast */
85 NIC_CAST,
86 /* %<typeid%> operator */
87 NIC_TYPEID,
88 /* non-constant compound literals */
89 NIC_NCC,
90 /* a function call */
91 NIC_FUNC_CALL,
92 /* an increment */
93 NIC_INC,
94 /* an decrement */
95 NIC_DEC,
96 /* an array reference */
97 NIC_ARRAY_REF,
98 /* %<->%> */
99 NIC_ARROW,
100 /* %<.%> */
101 NIC_POINT,
102 /* the address of a label */
103 NIC_ADDR_LABEL,
104 /* %<*%> */
105 NIC_STAR,
106 /* %<&%> */
107 NIC_ADDR,
108 /* %<++%> */
109 NIC_PREINCREMENT,
110 /* %<--%> */
111 NIC_PREDECREMENT,
112 /* %<new%> */
113 NIC_NEW,
114 /* %<delete%> */
115 NIC_DEL,
116 /* calls to overloaded operators */
117 NIC_OVERLOADED,
118 /* an assignment */
119 NIC_ASSIGNMENT,
120 /* a comma operator */
121 NIC_COMMA,
122 /* a call to a constructor */
123 NIC_CONSTRUCTOR,
124 /* a transaction expression */
125 NIC_TRANSACTION
128 /* The various kinds of errors about name-lookup failing. */
130 /* NULL */
131 NLE_NULL,
132 /* is not a type */
133 NLE_TYPE,
134 /* is not a class or namespace */
135 NLE_CXX98,
136 /* is not a class, namespace, or enumeration */
137 NLE_NOT_CXX98
140 /* The various kinds of required token */
142 RT_NONE,
164 /* The type is CPP_KEYWORD */
193 RT_TRANSACTION_CANCEL /* __transaction_cancel */
196 /* Prototypes. */
202 static void cp_lexer_destroy
204 static int cp_lexer_saving_tokens
208 static void cp_lexer_get_preprocessor_token
216 static bool cp_lexer_next_token_is_not
218 static bool cp_lexer_next_token_is_keyword
222 static void cp_lexer_purge_token
224 static void cp_lexer_purge_tokens_after
226 static void cp_lexer_save_tokens
228 static void cp_lexer_commit_tokens
230 static void cp_lexer_rollback_tokens
232 static void cp_lexer_print_token
236 static void cp_lexer_start_debugging
238 static void cp_lexer_stop_debugging
244 static void cp_parser_initial_pragma
247 static tree cp_literal_operator_id
250 static void cp_parser_cilk_simd
252 static bool cp_parser_omp_declare_reduction_exprs
255 /* Manifest constants. */
256 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
257 #define CP_SAVED_TOKEN_STACK 5
259 /* Variables. */
261 /* The stream to which debugging output should be written. */
264 /* Nonzero if we are parsing an unevaluated operand: an operand to
265 sizeof, typeof, or alignof. */
268 /* Dump up to NUM tokens in BUFFER to FILE starting with token
269 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
270 first token in BUFFER. If NUM is 0, dump all the tokens. If
271 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
272 highlighted by surrounding it in [[ ]]. */
274 static void
278 {
295 {
298 }
303 {
310 nprinted++;
320 {
330 }
331 }
334 {
337 }
340 }
343 /* Dump all tokens in BUFFER to stderr. */
345 void
347 {
349 }
351 DEBUG_FUNCTION void
353 {
355 }
357 DEBUG_FUNCTION void
359 {
362 else
364 }
367 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
368 description for T. */
370 static void
372 {
374 {
377 }
378 }
381 /* Dump parser context C to FILE. */
383 static void
385 {
390 }
393 /* Print the stack of parsing contexts to FILE starting with FIRST. */
395 static void
397 {
403 {
406 }
407 }
410 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
412 static void
414 {
417 }
420 /* Print an unparsed function entry UF to FILE. */
422 static void
424 {
427 tree fn;
432 i++)
433 {
439 }
444 {
447 }
453 {
456 }
458 }
461 /* Print the stack of unparsed member functions S to FILE. */
463 static void
466 {
472 {
475 }
476 }
479 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
480 the given PARSER. If FILE is NULL, the output is printed on stderr. */
482 static void
484 {
496 next_token);
497 }
500 /* Dump debugging information for the given PARSER. If FILE is NULL,
501 the output is printed on stderr. */
503 void
505 {
508 expanded_location eloc;
586 }
588 DEBUG_FUNCTION void
590 {
592 }
594 DEBUG_FUNCTION void
596 {
599 else
601 }
603 /* Allocate memory for a new lexer object and return it. */
607 {
612 /* Allocate the memory. */
615 /* Initially we are not debugging. */
620 /* Create the buffer. */
624 }
627 /* Create a new main C++ lexer, the lexer that gets tokens from the
628 preprocessor. */
632 {
634 cp_token token;
636 /* It's possible that parsing the first pragma will load a PCH file,
637 which is a GC collection point. So we have to do that before
638 allocating any memory. */
643 /* Put the first token in the buffer. */
646 /* Get the remaining tokens from the preprocessor. */
648 {
651 }
660 /* Subsequent preprocessor diagnostics should use compiler
661 diagnostic functions to get the compiler source location. */
666 }
668 /* Create a new lexer whose token stream is primed with the tokens in
669 CACHE. When these tokens are exhausted, no new tokens will be read. */
673 {
678 /* We do not own the buffer. */
685 /* Initially we are not debugging. */
690 }
692 /* Frees all resources associated with LEXER. */
694 static void
696 {
700 }
702 /* Returns nonzero if debugging information should be output. */
706 {
708 }
713 {
717 }
721 {
723 }
727 {
729 }
733 {
736 else
738 }
742 {
746 }
748 /* nonzero if we are presently saving tokens. */
752 {
754 }
756 /* Store the next token from the preprocessor in *TOKEN. Return true
757 if we reach EOF. If LEXER is NULL, assume we are handling an
758 initial #pragma pch_preprocess, and thus want the lexer to return
759 processed strings. */
761 static void
763 {
766 /* Get a new token from the preprocessor. */
767 token->type
774 /* On some systems, some header files are surrounded by an
775 implicit extern "C" block. Set a flag in the token if it
776 comes from such a header. */
781 /* Check to see if this token is a keyword. */
783 {
785 {
786 /* Mark this token as a keyword. */
788 /* Record which keyword. */
790 }
791 else
792 {
796 {
797 /* Warn about the C++0x keyword (but still treat it as
798 an identifier). */
803 /* Clear out the C_RID_CODE so we don't warn about this
804 particular identifier-turned-keyword again. */
806 }
810 }
811 }
813 {
814 /* This only happens in Objective-C++; it must be a keyword. */
817 {
818 /* Replace 'class' with '@class', 'private' with '@private',
819 etc. This prevents confusion with the C++ keyword
820 'class', and makes the tokens consistent with other
821 Objective-C 'AT' keywords. For example '@class' is
822 reported as RID_AT_CLASS which is consistent with
823 '@synchronized', which is reported as
824 RID_AT_SYNCHRONIZED.
825 */
834 }
835 }
837 {
838 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
842 }
843 }
845 /* Update the globals input_location and the input file stack from TOKEN. */
848 {
850 {
852 }
853 }
855 /* Return a pointer to the next token in the token stream, but do not
856 consume it. */
860 {
862 {
866 }
868 }
870 /* Return true if the next token has the indicated TYPE. */
874 {
876 }
878 /* Return true if the next token does not have the indicated TYPE. */
882 {
884 }
886 /* Return true if the next token is the indicated KEYWORD. */
890 {
892 }
896 {
898 }
900 /* Return true if the next token is not the indicated KEYWORD. */
904 {
906 }
908 /* Return true if the next token is a keyword for a decl-specifier. */
910 static bool
912 {
917 {
918 /* auto specifier: storage-class-specifier in C++,
919 simple-type-specifier in C++0x. */
921 /* Storage classes. */
927 /* Elaborated type specifiers. */
933 /* Simple type specifiers. */
948 /* GNU extensions. */
951 /* C++0x extensions. */
958 }
959 }
961 /* Returns TRUE iff the token T begins a decltype type. */
963 static bool
965 {
968 }
970 /* Returns TRUE iff the next token begins a decltype type. */
972 static bool
974 {
977 }
979 /* Return a pointer to the Nth token in the token stream. If N is 1,
980 then this is precisely equivalent to cp_lexer_peek_token (except
981 that it is not inline). One would like to disallow that case, but
982 there is one case (cp_parser_nth_token_starts_template_id) where
983 the caller passes a variable for N and it might be 1. */
987 {
990 /* N is 1-based, not zero-based. */
1001 {
1004 {
1007 }
1011 }
1014 {
1017 }
1020 }
1022 /* Return the next token, and advance the lexer's next_token pointer
1023 to point to the next non-purged token. */
1027 {
1033 do
1034 {
1037 {
1040 }
1042 }
1047 /* Provide debugging output. */
1049 {
1053 }
1056 }
1058 /* Permanently remove the next token from the token stream, and
1059 advance the next_token pointer to refer to the next non-purged
1060 token. */
1062 static void
1064 {
1073 do
1074 {
1075 tok++;
1077 {
1080 }
1081 }
1084 }
1086 /* Permanently remove all tokens after TOK, up to, but not
1087 including, the token that will be returned next by
1088 cp_lexer_peek_token. */
1090 static void
1092 {
1101 {
1106 }
1107 }
1109 /* Begin saving tokens. All tokens consumed after this point will be
1110 preserved. */
1112 static void
1114 {
1115 /* Provide debugging output. */
1120 }
1122 /* Commit to the portion of the token stream most recently saved. */
1124 static void
1126 {
1127 /* Provide debugging output. */
1132 }
1134 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1135 to the token stream. Stop saving tokens. */
1137 static void
1139 {
1140 /* Provide debugging output. */
1145 }
1147 /* Print a representation of the TOKEN on the STREAM. */
1149 static void
1151 {
1152 /* We don't use cpp_type2name here because the parser defines
1153 a few tokens of its own. */
1155 /* cpplib-defined token types */
1156 #define OP(e, s) #e,
1157 #define TK(e, s) #e,
1158 TTYPE_TABLE
1159 #undef OP
1160 #undef TK
1161 /* C++ parser token types - see "Manifest constants", above. */
1165 };
1167 /* For some tokens, print the associated data. */
1169 {
1171 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1172 For example, `struct' is mapped to an INTEGER_CST. */
1175 /* else fall through */
1193 /* If we have a name for the token, print it out. Otherwise, we
1194 simply give the numeric code. */
1197 else
1200 }
1201 }
1203 DEBUG_FUNCTION void
1205 {
1208 }
1210 DEBUG_FUNCTION void
1212 {
1215 else
1217 }
1220 /* Start emitting debugging information. */
1222 static void
1224 {
1227 }
1229 /* Stop emitting debugging information. */
1231 static void
1233 {
1236 }
1238 /* Create a new cp_token_cache, representing a range of tokens. */
1242 {
1247 }
1249 /* Diagnose if #pragma omp declare simd isn't followed immediately
1250 by function declaration or definition. */
1254 {
1256 {
1260 }
1261 }
1263 /* Finalize #pragma omp declare simd clauses after FNDECL has been parsed,
1264 and put that into "omp declare simd" attribute. */
1268 {
1270 {
1272 {
1275 }
1277 {
1280 }
1281 }
1282 }
1283 \f
1284 /* Decl-specifiers. */
1286 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1288 static void
1290 {
1292 }
1294 /* Declarators. */
1296 /* Nothing other than the parser should be creating declarators;
1297 declarators are a semi-syntactic representation of C++ entities.
1298 Other parts of the front end that need to create entities (like
1299 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1314 /* An erroneous declarator. */
1317 /* The obstack on which declarators and related data structures are
1318 allocated. */
1321 /* Alloc BYTES from the declarator memory pool. */
1325 {
1327 }
1329 /* Allocate a declarator of the indicated KIND. Clear fields that are
1330 common to all declarators. */
1334 {
1346 }
1348 /* Make a declarator for a generalized identifier. If
1349 QUALIFYING_SCOPE is non-NULL, the identifier is
1350 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1351 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1352 is, if any. */
1356 special_function_kind sfk)
1357 {
1360 /* It is valid to write:
1362 class C { void f(); };
1363 typedef C D;
1364 void D::f();
1366 The standard is not clear about whether `typedef const C D' is
1367 legal; as of 2002-09-15 the committee is considering that
1368 question. EDG 3.0 allows that syntax. Therefore, we do as
1369 well. */
1383 }
1385 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1386 of modifiers such as const or volatile to apply to the pointer
1387 type, represented as identifiers. ATTRIBUTES represent the attributes that
1388 appertain to the pointer or reference. */
1390 cp_declarator *
1392 tree attributes)
1393 {
1401 {
1405 }
1406 else
1412 }
1414 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1415 represent the attributes that appertain to the pointer or
1416 reference. */
1418 cp_declarator *
1421 {
1429 {
1433 }
1434 else
1440 }
1442 /* Like make_pointer_declarator -- but for a pointer to a non-static
1443 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1444 appertain to the pointer or reference. */
1446 cp_declarator *
1449 tree attributes)
1450 {
1459 {
1462 }
1463 else
1469 }
1471 /* Make a declarator for the function given by TARGET, with the
1472 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1473 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1474 indicates what exceptions can be thrown. */
1476 cp_declarator *
1478 tree parms,
1479 cp_cv_quals cv_qualifiers,
1480 cp_virt_specifiers virt_specifiers,
1481 cp_ref_qualifier ref_qualifier,
1482 tree exception_specification,
1483 tree late_return_type)
1484 {
1496 {
1500 }
1501 else
1505 }
1507 /* Make a declarator for an array of BOUNDS elements, each of which is
1508 defined by ELEMENT. */
1510 cp_declarator *
1512 {
1519 {
1523 }
1524 else
1528 }
1530 /* Determine whether the declarator we've seen so far can be a
1531 parameter pack, when followed by an ellipsis. */
1532 static bool
1534 {
1535 /* Search for a declarator name, or any other declarator that goes
1536 after the point where the ellipsis could appear in a parameter
1537 pack. If we find any of these, then this declarator can not be
1538 made into a parameter pack. */
1541 {
1543 {
1555 }
1556 }
1559 }
1563 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1564 DECLARATOR and DEFAULT_ARGUMENT. */
1566 cp_parameter_declarator *
1569 tree default_argument)
1570 {
1578 else
1585 }
1587 /* Returns true iff DECLARATOR is a declaration for a function. */
1589 static bool
1591 {
1593 {
1601 }
1603 }
1605 /* The parser. */
1607 /* Overview
1608 --------
1610 A cp_parser parses the token stream as specified by the C++
1611 grammar. Its job is purely parsing, not semantic analysis. For
1612 example, the parser breaks the token stream into declarators,
1613 expressions, statements, and other similar syntactic constructs.
1614 It does not check that the types of the expressions on either side
1615 of an assignment-statement are compatible, or that a function is
1616 not declared with a parameter of type `void'.
1618 The parser invokes routines elsewhere in the compiler to perform
1619 semantic analysis and to build up the abstract syntax tree for the
1620 code processed.
1622 The parser (and the template instantiation code, which is, in a
1623 way, a close relative of parsing) are the only parts of the
1624 compiler that should be calling push_scope and pop_scope, or
1625 related functions. The parser (and template instantiation code)
1626 keeps track of what scope is presently active; everything else
1627 should simply honor that. (The code that generates static
1628 initializers may also need to set the scope, in order to check
1629 access control correctly when emitting the initializers.)
1631 Methodology
1632 -----------
1634 The parser is of the standard recursive-descent variety. Upcoming
1635 tokens in the token stream are examined in order to determine which
1636 production to use when parsing a non-terminal. Some C++ constructs
1637 require arbitrary look ahead to disambiguate. For example, it is
1638 impossible, in the general case, to tell whether a statement is an
1639 expression or declaration without scanning the entire statement.
1640 Therefore, the parser is capable of "parsing tentatively." When the
1641 parser is not sure what construct comes next, it enters this mode.
1642 Then, while we attempt to parse the construct, the parser queues up
1643 error messages, rather than issuing them immediately, and saves the
1644 tokens it consumes. If the construct is parsed successfully, the
1645 parser "commits", i.e., it issues any queued error messages and
1646 the tokens that were being preserved are permanently discarded.
1647 If, however, the construct is not parsed successfully, the parser
1648 rolls back its state completely so that it can resume parsing using
1649 a different alternative.
1651 Future Improvements
1652 -------------------
1654 The performance of the parser could probably be improved substantially.
1655 We could often eliminate the need to parse tentatively by looking ahead
1656 a little bit. In some places, this approach might not entirely eliminate
1657 the need to parse tentatively, but it might still speed up the average
1658 case. */
1660 /* Flags that are passed to some parsing functions. These values can
1661 be bitwise-ored together. */
1663 enum
1664 {
1665 /* No flags. */
1667 /* The construct is optional. If it is not present, then no error
1668 should be issued. */
1670 /* When parsing a type-specifier, treat user-defined type-names
1671 as non-type identifiers. */
1673 /* When parsing a type-specifier, do not try to parse a class-specifier
1674 or enum-specifier. */
1676 /* When parsing a decl-specifier-seq, only allow type-specifier or
1677 constexpr. */
1679 };
1681 /* This type is used for parameters and variables which hold
1682 combinations of the above flags. */
1685 /* The different kinds of declarators we want to parse. */
1688 {
1689 /* We want an abstract declarator. */
1690 CP_PARSER_DECLARATOR_ABSTRACT,
1691 /* We want a named declarator. */
1692 CP_PARSER_DECLARATOR_NAMED,
1693 /* We don't mind, but the name must be an unqualified-id. */
1694 CP_PARSER_DECLARATOR_EITHER
1697 /* The precedence values used to parse binary expressions. The minimum value
1698 of PREC must be 1, because zero is reserved to quickly discriminate
1699 binary operators from other tokens. */
1701 enum cp_parser_prec
1702 {
1703 PREC_NOT_OPERATOR,
1704 PREC_LOGICAL_OR_EXPRESSION,
1705 PREC_LOGICAL_AND_EXPRESSION,
1706 PREC_INCLUSIVE_OR_EXPRESSION,
1707 PREC_EXCLUSIVE_OR_EXPRESSION,
1708 PREC_AND_EXPRESSION,
1709 PREC_EQUALITY_EXPRESSION,
1710 PREC_RELATIONAL_EXPRESSION,
1711 PREC_SHIFT_EXPRESSION,
1712 PREC_ADDITIVE_EXPRESSION,
1713 PREC_MULTIPLICATIVE_EXPRESSION,
1714 PREC_PM_EXPRESSION,
1715 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1716 };
1718 /* A mapping from a token type to a corresponding tree node type, with a
1719 precedence value. */
1722 {
1723 /* The token type. */
1725 /* The corresponding tree code. */
1727 /* The precedence of this operator. */
1732 {
1733 /* Left hand side of the binary operation we are currently
1734 parsing. */
1735 tree lhs;
1736 /* Original tree code for left hand side, if it was a binary
1737 expression itself (used for -Wparentheses). */
1739 /* Tree code for the binary operation we are parsing. */
1741 /* Precedence of the binary operation we are parsing. */
1743 /* Location of the binary operation we are parsing. */
1744 location_t loc;
1747 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1748 entries because precedence levels on the stack are monotonically
1749 increasing. */
1753 /* Prototypes. */
1755 /* Constructors and destructors. */
1760 /* Class variables. */
1764 /* The operator-precedence table used by cp_parser_binary_expression.
1765 Transformed into an associative array (binops_by_token) by
1766 cp_parser_new. */
1799 };
1801 /* The same as binops, but initialized by cp_parser_new so that
1802 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1803 for speed. */
1806 /* Constructors and destructors. */
1808 /* Construct a new context. The context below this one on the stack
1809 is given by NEXT. */
1813 {
1816 /* Allocate the storage. */
1818 {
1819 /* Pull the first entry from the free list. */
1823 }
1824 else
1827 /* No errors have occurred yet in this context. */
1829 /* If this is not the bottommost context, copy information that we
1830 need from the previous context. */
1832 {
1833 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1834 expression, then we are parsing one in this context, too. */
1836 /* Thread the stack. */
1838 }
1841 }
1843 /* Managing the unparsed function queues. */
1845 #define unparsed_funs_with_default_args \
1846 parser->unparsed_queues->last ().funs_with_default_args
1847 #define unparsed_funs_with_definitions \
1848 parser->unparsed_queues->last ().funs_with_definitions
1849 #define unparsed_nsdmis \
1850 parser->unparsed_queues->last ().nsdmis
1852 static void
1854 {
1857 }
1859 static void
1861 {
1864 }
1866 /* Prototypes. */
1868 /* Constructors and destructors. */
1873 /* Routines to parse various constructs.
1875 Those that return `tree' will return the error_mark_node (rather
1876 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1877 Sometimes, they will return an ordinary node if error-recovery was
1878 attempted, even though a parse error occurred. So, to check
1879 whether or not a parse error occurred, you should always use
1880 cp_parser_error_occurred. If the construct is optional (indicated
1881 either by an `_opt' in the name of the function that does the
1882 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1883 the construct is not present. */
1885 /* Lexical conventions [gram.lex] */
1887 static tree cp_parser_identifier
1889 static tree cp_parser_string_literal
1891 static tree cp_parser_userdef_char_literal
1893 static tree cp_parser_userdef_string_literal
1895 static tree cp_parser_userdef_numeric_literal
1898 /* Basic concepts [gram.basic] */
1900 static bool cp_parser_translation_unit
1903 /* Expressions [gram.expr] */
1905 static tree cp_parser_primary_expression
1907 static tree cp_parser_id_expression
1909 static tree cp_parser_unqualified_id
1911 static tree cp_parser_nested_name_specifier_opt
1913 static tree cp_parser_nested_name_specifier
1915 static tree cp_parser_qualifying_entity
1917 static tree cp_parser_postfix_expression
1919 static tree cp_parser_postfix_open_square_expression
1921 static tree cp_parser_postfix_dot_deref_expression
1925 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1927 static void cp_parser_pseudo_destructor_name
1929 static tree cp_parser_unary_expression
1931 static enum tree_code cp_parser_unary_operator
1933 static tree cp_parser_new_expression
1937 static tree cp_parser_new_type_id
1945 static tree cp_parser_delete_expression
1947 static tree cp_parser_cast_expression
1949 static tree cp_parser_binary_expression
1951 static tree cp_parser_question_colon_clause
1953 static tree cp_parser_assignment_expression
1955 static enum tree_code cp_parser_assignment_operator_opt
1957 static tree cp_parser_expression
1959 static tree cp_parser_expression
1961 static tree cp_parser_constant_expression
1963 static tree cp_parser_builtin_offsetof
1965 static tree cp_parser_lambda_expression
1967 static void cp_parser_lambda_introducer
1969 static bool cp_parser_lambda_declarator_opt
1971 static void cp_parser_lambda_body
1974 /* Statements [gram.stmt.stmt] */
1976 static void cp_parser_statement
1978 static void cp_parser_label_for_labeled_statement
1980 static tree cp_parser_expression_statement
1982 static tree cp_parser_compound_statement
1984 static void cp_parser_statement_seq_opt
1986 static tree cp_parser_selection_statement
1988 static tree cp_parser_condition
1990 static tree cp_parser_iteration_statement
1992 static bool cp_parser_for_init_statement
1994 static tree cp_parser_for
1996 static tree cp_parser_c_for
1998 static tree cp_parser_range_for
2000 static void do_range_for_auto_deduction
2002 static tree cp_parser_perform_range_for_lookup
2004 static tree cp_parser_range_for_member_function
2006 static tree cp_parser_jump_statement
2008 static void cp_parser_declaration_statement
2011 static tree cp_parser_implicitly_scoped_statement
2013 static void cp_parser_already_scoped_statement
2016 /* Declarations [gram.dcl.dcl] */
2018 static void cp_parser_declaration_seq_opt
2020 static void cp_parser_declaration
2022 static void cp_parser_block_declaration
2024 static void cp_parser_simple_declaration
2026 static void cp_parser_decl_specifier_seq
2028 static tree cp_parser_storage_class_specifier_opt
2030 static tree cp_parser_function_specifier_opt
2032 static tree cp_parser_type_specifier
2035 static tree cp_parser_simple_type_specifier
2037 static tree cp_parser_type_name
2039 static tree cp_parser_nonclass_name
2041 static tree cp_parser_elaborated_type_specifier
2043 static tree cp_parser_enum_specifier
2045 static void cp_parser_enumerator_list
2047 static void cp_parser_enumerator_definition
2049 static tree cp_parser_namespace_name
2051 static void cp_parser_namespace_definition
2053 static void cp_parser_namespace_body
2055 static tree cp_parser_qualified_namespace_specifier
2057 static void cp_parser_namespace_alias_definition
2059 static bool cp_parser_using_declaration
2061 static void cp_parser_using_directive
2063 static tree cp_parser_alias_declaration
2065 static void cp_parser_asm_definition
2067 static void cp_parser_linkage_specification
2069 static void cp_parser_static_assert
2071 static tree cp_parser_decltype
2074 /* Declarators [gram.dcl.decl] */
2076 static tree cp_parser_init_declarator
2077 (cp_parser *, cp_decl_specifier_seq *, vec<deferred_access_check, va_gc> *, bool, bool, int, bool *, tree *);
2082 static enum tree_code cp_parser_ptr_operator
2084 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
2086 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
2088 static cp_ref_qualifier cp_parser_ref_qualifier_opt
2090 static tree cp_parser_late_return_type_opt
2092 static tree cp_parser_declarator_id
2094 static tree cp_parser_type_id
2096 static tree cp_parser_template_type_arg
2099 static tree cp_parser_type_id_1
2101 static void cp_parser_type_specifier_seq
2103 static tree cp_parser_parameter_declaration_clause
2105 static tree cp_parser_parameter_declaration_list
2109 static tree cp_parser_default_argument
2111 static void cp_parser_function_body
2113 static tree cp_parser_initializer
2115 static tree cp_parser_initializer_clause
2117 static tree cp_parser_braced_list
2122 static bool cp_parser_ctor_initializer_opt_and_function_body
2125 static tree cp_parser_late_parsing_omp_declare_simd
2128 static tree synthesize_implicit_template_parm
2130 static tree finish_fully_implicit_template
2133 /* Classes [gram.class] */
2135 static tree cp_parser_class_name
2137 static tree cp_parser_class_specifier
2139 static tree cp_parser_class_head
2141 static enum tag_types cp_parser_class_key
2143 static void cp_parser_member_specification_opt
2145 static void cp_parser_member_declaration
2147 static tree cp_parser_pure_specifier
2149 static tree cp_parser_constant_initializer
2152 /* Derived classes [gram.class.derived] */
2154 static tree cp_parser_base_clause
2156 static tree cp_parser_base_specifier
2159 /* Special member functions [gram.special] */
2161 static tree cp_parser_conversion_function_id
2163 static tree cp_parser_conversion_type_id
2167 static bool cp_parser_ctor_initializer_opt
2169 static void cp_parser_mem_initializer_list
2171 static tree cp_parser_mem_initializer
2173 static tree cp_parser_mem_initializer_id
2176 /* Overloading [gram.over] */
2178 static tree cp_parser_operator_function_id
2180 static tree cp_parser_operator
2183 /* Templates [gram.temp] */
2185 static void cp_parser_template_declaration
2187 static tree cp_parser_template_parameter_list
2189 static tree cp_parser_template_parameter
2191 static tree cp_parser_type_parameter
2193 static tree cp_parser_template_id
2195 static tree cp_parser_template_name
2197 static tree cp_parser_template_argument_list
2199 static tree cp_parser_template_argument
2201 static void cp_parser_explicit_instantiation
2203 static void cp_parser_explicit_specialization
2206 /* Exception handling [gram.exception] */
2208 static tree cp_parser_try_block
2210 static bool cp_parser_function_try_block
2212 static void cp_parser_handler_seq
2214 static void cp_parser_handler
2216 static tree cp_parser_exception_declaration
2218 static tree cp_parser_throw_expression
2220 static tree cp_parser_exception_specification_opt
2222 static tree cp_parser_type_id_list
2225 /* GNU Extensions */
2227 static tree cp_parser_asm_specification_opt
2229 static tree cp_parser_asm_operand_list
2231 static tree cp_parser_asm_clobber_list
2233 static tree cp_parser_asm_label_list
2235 static bool cp_next_tokens_can_be_attribute_p
2237 static bool cp_next_tokens_can_be_gnu_attribute_p
2239 static bool cp_next_tokens_can_be_std_attribute_p
2241 static bool cp_nth_tokens_can_be_std_attribute_p
2243 static bool cp_nth_tokens_can_be_gnu_attribute_p
2245 static bool cp_nth_tokens_can_be_attribute_p
2247 static tree cp_parser_attributes_opt
2249 static tree cp_parser_gnu_attributes_opt
2251 static tree cp_parser_gnu_attribute_list
2253 static tree cp_parser_std_attribute
2255 static tree cp_parser_std_attribute_spec
2257 static tree cp_parser_std_attribute_spec_seq
2259 static bool cp_parser_extension_opt
2261 static void cp_parser_label_declaration
2264 /* Concept Extensions */
2266 static tree cp_parser_requires_clause
2268 static tree cp_parser_requires_clause_opt
2270 static tree cp_parser_requires_expression
2272 static tree cp_parser_requirement_parameter_list
2274 static tree cp_parser_requirement_body
2276 static tree cp_parser_requirement_list
2278 static tree cp_parser_requirement
2280 static tree cp_parser_simple_requirement
2282 static tree cp_parser_compound_requirement
2284 static tree cp_parser_type_requirement
2286 static tree cp_parser_nested_requirement
2288 static tree cp_parser_constexpr_constraint_spec
2290 static tree cp_parser_noexcept_constraint_spec
2292 static tree cp_parser_constraint_spec
2294 static tree cp_parser_constraint_specifier_seq
2297 /* Transactional Memory Extensions */
2299 static tree cp_parser_transaction
2301 static tree cp_parser_transaction_expression
2303 static bool cp_parser_function_transaction
2305 static tree cp_parser_transaction_cancel
2309 pragma_external,
2310 pragma_member,
2311 pragma_objc_icode,
2312 pragma_stmt,
2313 pragma_compound
2314 };
2315 static bool cp_parser_pragma
2318 /* Objective-C++ Productions */
2320 static tree cp_parser_objc_message_receiver
2322 static tree cp_parser_objc_message_args
2324 static tree cp_parser_objc_message_expression
2326 static tree cp_parser_objc_encode_expression
2328 static tree cp_parser_objc_defs_expression
2330 static tree cp_parser_objc_protocol_expression
2332 static tree cp_parser_objc_selector_expression
2334 static tree cp_parser_objc_expression
2336 static bool cp_parser_objc_selector_p
2338 static tree cp_parser_objc_selector
2340 static tree cp_parser_objc_protocol_refs_opt
2342 static void cp_parser_objc_declaration
2344 static tree cp_parser_objc_statement
2346 static bool cp_parser_objc_valid_prefix_attributes
2348 static void cp_parser_objc_at_property_declaration
2350 static void cp_parser_objc_at_synthesize_declaration
2352 static void cp_parser_objc_at_dynamic_declaration
2354 static tree cp_parser_objc_struct_declaration
2357 /* Utility Routines */
2359 static tree cp_parser_lookup_name
2361 static tree cp_parser_lookup_name_simple
2363 static tree cp_parser_maybe_treat_template_as_class
2365 static bool cp_parser_check_declarator_template_parameters
2367 static bool cp_parser_check_template_parameters
2369 static tree cp_parser_simple_cast_expression
2371 static tree cp_parser_global_scope_opt
2373 static bool cp_parser_constructor_declarator_p
2375 static tree cp_parser_function_definition_from_specifiers_and_declarator
2377 static tree cp_parser_function_definition_after_declarator
2379 static void cp_parser_template_declaration_after_export
2381 static void cp_parser_perform_template_parameter_access_checks
2383 static tree cp_parser_single_declaration
2385 static tree cp_parser_functional_cast
2387 static tree cp_parser_save_member_function_body
2389 static tree cp_parser_save_nsdmi
2391 static tree cp_parser_enclosed_template_argument_list
2393 static void cp_parser_save_default_args
2395 static void cp_parser_late_parsing_for_member
2397 static tree cp_parser_late_parse_one_default_arg
2399 static void cp_parser_late_parsing_nsdmi
2401 static void cp_parser_late_parsing_default_args
2403 static tree cp_parser_sizeof_operand
2405 static tree cp_parser_trait_expr
2407 static bool cp_parser_declares_only_class_p
2409 static void cp_parser_set_storage_class
2411 static void cp_parser_set_decl_spec_type
2413 static void set_and_check_decl_spec_loc
2416 static bool cp_parser_friend_p
2418 static void cp_parser_required_error
2424 static bool cp_parser_token_starts_function_definition_p
2426 static bool cp_parser_next_token_starts_class_definition_p
2428 static bool cp_parser_next_token_ends_template_argument_p
2430 static bool cp_parser_nth_token_starts_template_argument_list_p
2432 static enum tag_types cp_parser_token_is_class_key
2434 static void cp_parser_check_class_key
2436 static void cp_parser_check_access_in_redeclaration
2438 static bool cp_parser_optional_template_keyword
2440 static void cp_parser_pre_parsed_nested_name_specifier
2442 static bool cp_parser_cache_group
2444 static tree cp_parser_cache_defarg
2446 static void cp_parser_parse_tentatively
2448 static void cp_parser_commit_to_tentative_parse
2450 static void cp_parser_commit_to_topmost_tentative_parse
2452 static void cp_parser_abort_tentative_parse
2454 static bool cp_parser_parse_definitely
2458 static bool cp_parser_uncommitted_to_tentative_parse_p
2460 static void cp_parser_error
2462 static void cp_parser_name_lookup_error
2464 static bool cp_parser_simulate_error
2466 static bool cp_parser_check_type_definition
2468 static void cp_parser_check_for_definition_in_return_type
2470 static void cp_parser_check_for_invalid_template_id
2472 static bool cp_parser_non_integral_constant_expression
2474 static void cp_parser_diagnose_invalid_type_name
2476 static bool cp_parser_parse_and_diagnose_invalid_type_name
2478 static int cp_parser_skip_to_closing_parenthesis
2480 static void cp_parser_skip_to_end_of_statement
2482 static void cp_parser_consume_semicolon_at_end_of_statement
2484 static void cp_parser_skip_to_end_of_block_or_statement
2486 static bool cp_parser_skip_to_closing_brace
2488 static void cp_parser_skip_to_end_of_template_parameter_list
2490 static void cp_parser_skip_to_pragma_eol
2492 static bool cp_parser_error_occurred
2494 static bool cp_parser_allow_gnu_extensions_p
2496 static bool cp_parser_is_pure_string_literal
2498 static bool cp_parser_is_string_literal
2500 static bool cp_parser_is_keyword
2502 static tree cp_parser_make_typename_type
2509 // -------------------------------------------------------------------------- //
2510 // Unevaluated Operand Guard
2511 //
2512 // Implementation of an RAII helper for unevaluated operand parsing.
2514 {
2517 }
2520 {
2523 }
2525 // -------------------------------------------------------------------------- //
2526 // Tentative Parsing
2528 /* Returns nonzero if we are parsing tentatively. */
2532 {
2534 }
2536 /* Returns nonzero if TOKEN is a string literal. */
2538 static bool
2540 {
2546 }
2548 /* Returns nonzero if TOKEN is a string literal
2549 of a user-defined string literal. */
2551 static bool
2553 {
2560 }
2562 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2564 static bool
2566 {
2568 }
2570 /* If not parsing tentatively, issue a diagnostic of the form
2571 FILE:LINE: MESSAGE before TOKEN
2572 where TOKEN is the next token in the input stream. MESSAGE
2573 (specified by the caller) is usually of the form "expected
2574 OTHER-TOKEN". */
2576 static void
2578 {
2580 {
2582 /* This diagnostic makes more sense if it is tagged to the line
2583 of the token we just peeked at. */
2587 {
2592 }
2595 /* Because c_parser_error does not understand
2596 CPP_KEYWORD, keywords are treated like
2597 identifiers. */
2600 }
2601 }
2603 /* Issue an error about name-lookup failing. NAME is the
2604 IDENTIFIER_NODE DECL is the result of
2605 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2606 the thing that we hoped to find. */
2608 static void
2610 tree name,
2611 tree decl,
2612 name_lookup_error desired,
2613 location_t location)
2614 {
2615 /* If name lookup completely failed, tell the user that NAME was not
2616 declared. */
2618 {
2631 else
2633 }
2635 {
2637 {
2654 }
2655 }
2657 {
2659 {
2669 name);
2673 }
2674 }
2675 else
2676 {
2678 {
2691 }
2692 }
2693 }
2695 /* If we are parsing tentatively, remember that an error has occurred
2696 during this tentative parse. Returns true if the error was
2697 simulated; false if a message should be issued by the caller. */
2699 static bool
2701 {
2703 {
2706 }
2708 }
2710 /* This function is called when a type is defined. If type
2711 definitions are forbidden at this point, an error message is
2712 issued. */
2714 static bool
2716 {
2717 /* If types are forbidden here, issue a message. */
2719 {
2720 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2721 in the message need to be interpreted. */
2724 }
2726 }
2728 /* This function is called when the DECLARATOR is processed. The TYPE
2729 was a type defined in the decl-specifiers. If it is invalid to
2730 define a type in the decl-specifiers for DECLARATOR, an error is
2731 issued. TYPE_LOCATION is the location of TYPE and is used
2732 for error reporting. */
2734 static void
2737 {
2738 /* [dcl.fct] forbids type definitions in return types.
2739 Unfortunately, it's not easy to know whether or not we are
2740 processing a return type until after the fact. */
2748 {
2753 type);
2754 }
2755 }
2757 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2758 "<" in any valid C++ program. If the next token is indeed "<",
2759 issue a message warning the user about what appears to be an
2760 invalid attempt to form a template-id. LOCATION is the location
2761 of the type-specifier (TYPE) */
2763 static void
2765 tree type,
2767 location_t location)
2768 {
2772 {
2776 {
2779 else
2781 }
2782 else
2784 /* Remember the location of the invalid "<". */
2787 /* Consume the "<". */
2789 /* Parse the template arguments. */
2791 /* Permanently remove the invalid template arguments so that
2792 this error message is not issued again. */
2795 }
2796 }
2798 /* If parsing an integral constant-expression, issue an error message
2799 about the fact that THING appeared and return true. Otherwise,
2800 return false. In either case, set
2801 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2803 static bool
2805 non_integral_constant thing)
2806 {
2809 {
2811 {
2814 {
2821 "enumeration type cannot appear in a "
2912 }
2916 }
2917 }
2919 }
2921 /* Emit a diagnostic for an invalid type name. SCOPE is the
2922 qualifying scope (or NULL, if none) for ID. This function commits
2923 to the current active tentative parse, if any. (Otherwise, the
2924 problematic construct might be encountered again later, resulting
2925 in duplicate error messages.) LOCATION is the location of ID. */
2927 static void
2930 location_t location)
2931 {
2934 /* Try to lookup the identifier. */
2939 /* If the lookup found a template-name, it means that the user forgot
2940 to specify an argument list. Emit a useful error message. */
2944 decl);
2948 /* Something like 'unsigned A a;' */
2951 {
2952 /* Issue an error message. */
2954 /* If we're in a template class, it's possible that the user was
2955 referring to a type from a base class. For example:
2957 template <typename T> struct A { typedef T X; };
2958 template <typename T> struct B : public A<T> { X x; };
2960 The user should have said "typename A<T>::X". */
2966 {
2967 tree b;
2970 b;
2972 {
2976 {
2977 tree field;
2978 /* Go from a particular instantiation of the
2979 template (which will have an empty TYPE_FIELDs),
2980 to the main version. */
2983 field;
2987 {
2992 }
2995 }
2996 }
2997 }
2998 }
2999 /* Here we diagnose qualified-ids where the scope is actually correct,
3000 but the identifier does not resolve to a valid type name. */
3002 {
3004 {
3009 else
3013 }
3016 {
3017 /* A<T>::A<T>() */
3023 }
3030 {
3035 else
3039 }
3040 else
3042 }
3043 }
3045 /* Check for a common situation where a type-name should be present,
3046 but is not, and issue a sensible error message. Returns true if an
3047 invalid type-name was detected.
3049 The situation handled by this function are variable declarations of the
3050 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
3051 Usually, `ID' should name a type, but if we got here it means that it
3052 does not. We try to emit the best possible error message depending on
3053 how exactly the id-expression looks like. */
3055 static bool
3057 {
3058 tree id;
3061 /* Avoid duplicate error about ambiguous lookup. */
3063 {
3067 }
3076 /* If the next token is a (, this is a function with no explicit return
3077 type, i.e. constructor, destructor or conversion op. */
3080 {
3083 }
3087 /* Emit a diagnostic for the invalid type. */
3090 out:
3091 /* If we aren't in the middle of a declarator (i.e. in a
3092 parameter-declaration-clause), skip to the end of the declaration;
3093 there's no point in trying to process it. */
3097 }
3099 /* Consume tokens up to, and including, the next non-nested closing `)'.
3100 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
3101 are doing error recovery. Returns -1 if OR_COMMA is true and we
3102 found an unnested comma. */
3104 static int
3109 {
3119 {
3123 {
3126 /* If we've run out of tokens, then there is no closing `)'. */
3129 /* This is good for lambda expression capture-lists. */
3139 /* This matches the processing in skip_to_end_of_statement. */
3165 {
3169 }
3174 }
3176 /* Consume the token. */
3178 }
3179 }
3181 /* Consume tokens until we reach the end of the current statement.
3182 Normally, that will be just before consuming a `;'. However, if a
3183 non-nested `}' comes first, then we stop before consuming that. */
3185 static void
3187 {
3191 {
3195 {
3198 /* If we've run out of tokens, stop. */
3202 /* If the next token is a `;', we have reached the end of the
3203 statement. */
3209 /* If this is a non-nested '}', stop before consuming it.
3210 That way, when confronted with something like:
3212 { 3 + }
3214 we stop before consuming the closing '}', even though we
3215 have not yet reached a `;'. */
3219 /* If it is the closing '}' for a block that we have
3220 scanned, stop -- but only after consuming the token.
3221 That way given:
3223 void f g () { ... }
3224 typedef int I;
3226 we will stop after the body of the erroneously declared
3227 function, but before consuming the following `typedef'
3228 declaration. */
3230 {
3233 }
3241 }
3243 /* Consume the token. */
3245 }
3246 }
3248 /* This function is called at the end of a statement or declaration.
3249 If the next token is a semicolon, it is consumed; otherwise, error
3250 recovery is attempted. */
3252 static void
3254 {
3255 /* Look for the trailing `;'. */
3257 {
3258 /* If there is additional (erroneous) input, skip to the end of
3259 the statement. */
3261 /* If the next token is now a `;', consume it. */
3264 }
3265 }
3267 /* Skip tokens until we have consumed an entire block, or until we
3268 have consumed a non-nested `;'. */
3270 static void
3272 {
3276 {
3280 {
3283 /* If we've run out of tokens, stop. */
3287 /* Stop if this is an unnested ';'. */
3293 /* Stop if this is an unnested '}', or closes the outermost
3294 nesting level. */
3295 nesting_depth--;
3303 /* Nest. */
3304 nesting_depth++;
3309 }
3311 /* Consume the token. */
3313 }
3314 }
3316 /* Skip tokens until a non-nested closing curly brace is the next
3317 token, or there are no more tokens. Return true in the first case,
3318 false otherwise. */
3320 static bool
3322 {
3326 {
3330 {
3333 /* If we've run out of tokens, stop. */
3337 /* If the next token is a non-nested `}', then we have reached
3338 the end of the current block. */
3344 /* If it the next token is a `{', then we are entering a new
3345 block. Consume the entire block. */
3351 }
3353 /* Consume the token. */
3355 }
3356 }
3358 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3359 parameter is the PRAGMA token, allowing us to purge the entire pragma
3360 sequence. */
3362 static void
3364 {
3369 do
3373 /* Ensure that the pragma is not parsed again. */
3375 }
3377 /* Require pragma end of line, resyncing with it as necessary. The
3378 arguments are as for cp_parser_skip_to_pragma_eol. */
3380 static void
3382 {
3386 }
3388 /* This is a simple wrapper around make_typename_type. When the id is
3389 an unresolved identifier node, we can provide a superior diagnostic
3390 using cp_parser_diagnose_invalid_type_name. */
3392 static tree
3395 {
3396 tree result;
3398 {
3404 }
3406 }
3408 /* This is a wrapper around the
3409 make_{pointer,ptrmem,reference}_declarator functions that decides
3410 which one to call based on the CODE and CLASS_TYPE arguments. The
3411 CODE argument should be one of the values returned by
3412 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3413 appertain to the pointer or reference. */
3417 cp_cv_quals cv_qualifiers,
3419 tree attributes)
3420 {
3427 else
3437 }
3439 /* Create a new C++ parser. */
3443 {
3448 /* cp_lexer_new_main is called before doing GC allocation because
3449 cp_lexer_new_main might load a PCH file. */
3452 /* Initialize the binops_by_token so that we can get the tree
3453 directly from the token. */
3461 /* For now, we always accept GNU extensions. */
3464 /* The `>' token is a greater-than operator, not the end of a
3465 template-id. */
3470 /* We are not parsing a constant-expression. */
3475 /* Local variable names are not forbidden. */
3478 /* We are not processing an `extern "C"' declaration. */
3481 /* We are not processing a declarator. */
3484 /* We are not processing a template-argument-list. */
3487 /* We are not in an iteration statement. */
3490 /* We are not in a switch statement. */
3493 /* We are not parsing a type-id inside an expression. */
3496 /* Declarations aren't implicitly extern "C". */
3499 /* String literals should be translated to the execution character set. */
3502 /* We are not parsing a function body. */
3505 /* We can correct until told otherwise. */
3508 /* The unparsed function queue is empty. */
3511 /* There are no classes being defined. */
3514 /* No template parameters apply. */
3517 /* Not declaring an implicit function template. */
3524 }
3526 /* Create a cp_lexer structure which will emit the tokens in CACHE
3527 and push it onto the parser's lexer stack. This is used for delayed
3528 parsing of in-class method bodies and default arguments, and should
3529 not be confused with tentative parsing. */
3530 static void
3532 {
3537 /* Move the current source position to that of the first token in the
3538 new lexer. */
3540 }
3542 /* Pop the top lexer off the parser stack. This is never used for the
3543 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3544 static void
3546 {
3551 /* Put the current source position back where it was before this
3552 lexer was pushed. */
3554 }
3556 /* Lexical conventions [gram.lex] */
3558 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3559 identifier. */
3561 static tree
3563 {
3566 /* Look for the identifier. */
3568 /* Return the value. */
3570 }
3572 /* Parse a sequence of adjacent string constants. Returns a
3573 TREE_STRING representing the combined, nul-terminated string
3574 constant. If TRANSLATE is true, translate the string to the
3575 execution character set. If WIDE_OK is true, a wide string is
3576 invalid here.
3578 C++98 [lex.string] says that if a narrow string literal token is
3579 adjacent to a wide string literal token, the behavior is undefined.
3580 However, C99 6.4.5p4 says that this results in a wide string literal.
3581 We follow C99 here, for consistency with the C front end.
3583 This code is largely lifted from lex_string() in c-lex.c.
3585 FUTURE: ObjC++ will need to handle @-strings here. */
3586 static tree
3588 {
3589 tree value;
3596 tree string_tree;
3602 {
3605 }
3608 {
3612 }
3613 else
3614 {
3617 }
3620 /* Try to avoid the overhead of creating and destroying an obstack
3621 for the common case of just one string. */
3624 {
3632 {
3636 }
3637 else
3641 }
3642 else
3643 {
3647 do
3648 {
3650 count++;
3655 {
3658 {
3661 }
3664 {
3669 }
3671 }
3672 else
3676 {
3681 "unsupported non-standard concatenation "
3683 }
3689 {
3693 }
3694 else
3695 {
3699 }
3700 }
3704 }
3707 {
3710 }
3714 {
3719 {
3734 }
3739 {
3744 }
3745 }
3746 else
3747 /* cpp_interpret_string has issued an error. */
3754 }
3756 /* Look up a literal operator with the name and the exact arguments. */
3758 static tree
3760 {
3767 {
3773 {
3776 {
3786 }
3789 /* May be this should be sufficient_parms_p instead,
3790 depending on how exactly should user-defined literals
3791 work in presence of default arguments on the literal
3792 operator parameters. */
3795 }
3796 }
3799 }
3801 /* Parse a user-defined char constant. Returns a call to a user-defined
3802 literal operator taking the character as an argument. */
3804 static tree
3806 {
3814 /* Build up a call to the user-defined operator */
3815 /* Lookup the name we got back from the id-expression. */
3820 {
3825 }
3834 }
3836 /* A subroutine of cp_parser_userdef_numeric_literal to
3837 create a char... template parameter pack from a string node. */
3839 static tree
3841 {
3842 tree charvec;
3848 /* Fill in CHARVEC with all of the parameters. */
3853 /* Build the argument packs. */
3860 }
3862 /* A subroutine of cp_parser_userdef_numeric_literal to
3863 create a char... template parameter pack from a string node. */
3865 static tree
3867 {
3868 tree charvec;
3878 /* First template parm is character type. */
3881 /* Fill in CHARVEC with all of the parameters. */
3884 {
3887 }
3889 {
3893 }
3895 {
3899 }
3901 /* Build the argument packs. */
3908 }
3910 /* Parse a user-defined numeric constant. returns a call to a user-defined
3911 literal operator. */
3913 static tree
3915 {
3926 /* Look for a literal operator taking the exact type of numeric argument
3927 as the literal value. */
3932 {
3935 {
3939 long_long_unsigned_type_node);
3940 else
3941 {
3945 long_double_type_node);
3949 }
3952 }
3953 }
3956 /* If the numeric argument didn't work, look for a raw literal
3957 operator taking a const char* argument consisting of the number
3958 in string format. */
3963 {
3966 {
3969 }
3970 }
3973 /* If the raw literal didn't work, look for a non-type template
3974 function with parameter pack char.... Call the function with
3975 template parameter characters representing the number. */
3979 {
3984 {
3987 }
3988 }
3993 }
3995 /* Parse a user-defined string constant. Returns a call to a user-defined
3996 literal operator taking a character pointer and the length of the string
3997 as arguments. */
3999 static tree
4001 {
4011 /* Look for a template function with typename parameter CharT
4012 and parameter pack CharT... Call the function with
4013 template parameter characters representing the string. */
4017 {
4022 {
4025 }
4026 }
4029 /* Build up a call to the user-defined operator */
4030 /* Lookup the name we got back from the id-expression. */
4036 {
4040 }
4049 }
4052 /* Basic concepts [gram.basic] */
4054 /* Parse a translation-unit.
4056 translation-unit:
4057 declaration-seq [opt]
4059 Returns TRUE if all went well. */
4061 static bool
4063 {
4064 /* The address of the first non-permanent object on the declarator
4065 obstack. */
4070 /* Create the declarator obstack, if necessary. */
4072 {
4074 /* Create the error declarator. */
4076 /* Create the empty parameter list. */
4078 /* Remember where the base of the declarator obstack lies. */
4080 }
4084 /* If there are no tokens left then all went well. */
4086 {
4087 /* Get rid of the token array; we don't need it any more. */
4091 /* This file might have been a context that's implicitly extern
4092 "C". If so, pop the lang context. (Only relevant for PCH.) */
4094 {
4097 }
4099 /* Finish up. */
4103 }
4104 else
4105 {
4108 }
4110 /* Make sure the declarator obstack was fully cleaned up. */
4114 /* All went well. */
4116 }
4118 /* Return the appropriate tsubst flags for parsing, possibly in N3276
4119 decltype context. */
4123 {
4128 }
4130 /* Expressions [gram.expr] */
4132 /* Parse a primary-expression.
4134 primary-expression:
4135 literal
4136 this
4137 ( expression )
4138 id-expression
4140 GNU Extensions:
4142 primary-expression:
4143 ( compound-statement )
4144 __builtin_va_arg ( assignment-expression , type-id )
4145 __builtin_offsetof ( type-id , offsetof-expression )
4147 C++ Extensions:
4148 __has_nothrow_assign ( type-id )
4149 __has_nothrow_constructor ( type-id )
4150 __has_nothrow_copy ( type-id )
4151 __has_trivial_assign ( type-id )
4152 __has_trivial_constructor ( type-id )
4153 __has_trivial_copy ( type-id )
4154 __has_trivial_destructor ( type-id )
4155 __has_virtual_destructor ( type-id )
4156 __is_abstract ( type-id )
4157 __is_base_of ( type-id , type-id )
4158 __is_class ( type-id )
4159 __is_convertible_to ( type-id , type-id )
4160 __is_empty ( type-id )
4161 __is_enum ( type-id )
4162 __is_final ( type-id )
4163 __is_literal_type ( type-id )
4164 __is_pod ( type-id )
4165 __is_polymorphic ( type-id )
4166 __is_std_layout ( type-id )
4167 __is_trivial ( type-id )
4168 __is_union ( type-id )
4170 Objective-C++ Extension:
4172 primary-expression:
4173 objc-expression
4175 literal:
4176 __null
4178 ADDRESS_P is true iff this expression was immediately preceded by
4179 "&" and therefore might denote a pointer-to-member. CAST_P is true
4180 iff this expression is the target of a cast. TEMPLATE_ARG_P is
4181 true iff this expression is a template argument.
4183 Returns a representation of the expression. Upon return, *IDK
4184 indicates what kind of id-expression (if any) was present. */
4186 static tree
4193 {
4196 /* Assume the primary expression is not an id-expression. */
4199 /* Peek at the next token. */
4202 {
4203 /* literal:
4204 integer-literal
4205 character-literal
4206 floating-literal
4207 string-literal
4208 boolean-literal
4209 pointer-literal
4210 user-defined-literal */
4220 {
4224 }
4225 /* Floating-point literals are only allowed in an integral
4226 constant expression if they are cast to an integral or
4227 enumeration type. */
4231 {
4232 /* CAST_P will be set even in invalid code like "int(2.7 +
4233 ...)". Therefore, we have to check that the next token
4234 is sure to end the cast. */
4236 {
4241 enumerator-definition. */
4243 /* The curly brace at the end of an enum-specifier. */
4245 /* The end of a statement. */
4247 /* The end of the cast-expression. */
4249 /* The end of an array bound. */
4251 /* The closing ">" in a template-argument-list. */
4254 /* C++0x only: A ">>" treated like two ">" tokens,
4255 in a template-argument-list. */
4260 }
4262 /* If we are within a cast, then the constraint that the
4263 cast is to an integral or enumeration type will be
4264 checked at that point. If we are not within a cast, then
4265 this code is invalid. */
4268 }
4287 /* ??? Should wide strings be allowed when parser->translate_strings_p
4288 is false (i.e. in attributes)? If not, we can kill the third
4289 argument to cp_parser_string_literal. */
4295 {
4296 tree expr;
4299 /* Consume the `('. */
4301 /* Within a parenthesized expression, a `>' token is always
4302 the greater-than operator. */
4303 saved_greater_than_is_operator_p
4306 /* If we see `( { ' then we are looking at the beginning of
4307 a GNU statement-expression. */
4310 {
4311 /* Statement-expressions are not allowed by the standard. */
4315 /* And they're not allowed outside of a function-body; you
4316 cannot, for example, write:
4318 int i = ({ int j = 3; j + 1; });
4320 at class or namespace scope. */
4323 {
4325 "statement-expressions are not allowed outside "
4329 }
4330 else
4331 {
4332 /* Start the statement-expression. */
4334 /* Parse the compound-statement. */
4336 /* Finish up. */
4338 }
4339 }
4340 else
4341 {
4342 /* Parse the parenthesized expression. */
4344 /* Let the front end know that this expression was
4345 enclosed in parentheses. This matters in case, for
4346 example, the expression is of the form `A::B', since
4347 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4348 not. */
4350 /* DR 705: Wrapping an unqualified name in parentheses
4351 suppresses arg-dependent lookup. We want to pass back
4352 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4353 (c++/37862), but none of the others. */
4356 }
4357 /* The `>' token might be the end of a template-id or
4358 template-parameter-list now. */
4359 parser->greater_than_is_operator_p
4361 /* Consume the `)'. */
4366 }
4370 /* We have an Objective-C++ message. */
4372 {
4374 /* Don't warn about a failed tentative parse. */
4379 }
4383 /* We have an Objective-C++ string literal. */
4390 {
4391 /* These two are the boolean literals. */
4399 /* The `__null' literal. */
4404 /* The `nullptr' literal. */
4409 /* Recognize the `this' keyword. */
4413 {
4417 }
4418 /* Pointers cannot appear in constant-expressions. */
4423 /* The `operator' keyword can be the beginning of an
4424 id-expression. */
4431 {
4432 non_integral_constant name;
4434 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4435 __func__ are the names of variables -- but they are
4436 treated specially. Therefore, they are handled here,
4437 rather than relying on the generic id-expression logic
4438 below. Grammatically, these names are id-expressions.
4440 Consume the token. */
4444 {
4456 }
4461 /* Look up the name. */
4463 }
4466 {
4467 tree expression;
4468 tree type;
4469 source_location type_location;
4471 /* The `__builtin_va_arg' construct is used to handle
4472 `va_arg'. Consume the `__builtin_va_arg' token. */
4474 /* Look for the opening `('. */
4476 /* Now, parse the assignment-expression. */
4479 /* Look for the `,'. */
4482 /* Parse the type-id. */
4484 /* Look for the closing `)'. */
4486 /* Using `va_arg' in a constant-expression is not
4487 allowed. */
4489 NIC_VA_ARG))
4492 }
4521 // C++ concepts
4525 /* Objective-C++ expressions. */
4535 {
4540 }
4544 }
4546 /* An id-expression can start with either an identifier, a
4547 `::' as the beginning of a qualified-id, or the "operator"
4548 keyword. */
4553 {
4554 tree id_expression;
4555 tree decl;
4561 id_expression:
4562 /* Parse the id-expression. */
4563 id_expression
4580 /* If we have a template-id, then no further lookup is
4581 required. If the template-id was for a template-class, we
4582 will sometimes have a TYPE_DECL at this point. */
4586 /* Look up the name. */
4587 else
4588 {
4589 tree ambiguous_decls;
4591 /* If we already know that this lookup is ambiguous, then
4592 we've already issued an error message; there's no reason
4593 to check again. */
4596 {
4599 }
4602 none_type,
4603 template_p,
4608 /* If the lookup was ambiguous, an error will already have
4609 been issued. */
4613 /* In Objective-C++, we may have an Objective-C 2.0
4614 dot-syntax for classes here. */
4619 {
4620 tree component;
4627 }
4629 /* In Objective-C++, an instance variable (ivar) may be preferred
4630 to whatever cp_parser_lookup_name() found. */
4633 /* If name lookup gives us a SCOPE_REF, then the
4634 qualifying scope was dependent. */
4636 {
4637 /* At this point, we do not know if DECL is a valid
4638 integral constant expression. We assume that it is
4639 in fact such an expression, so that code like:
4641 template <int N> struct A {
4642 int a[B<N>::i];
4643 };
4645 is accepted. At template-instantiation time, we
4646 will check that B<N>::i is actually a constant. */
4648 }
4649 /* Check to see if DECL is a local variable in a context
4650 where that is forbidden. */
4653 {
4654 /* It might be that we only found DECL because we are
4655 trying to be generous with pre-ISO scoping rules.
4656 For example, consider:
4658 int i;
4659 void g() {
4660 for (int i = 0; i < 10; ++i) {}
4661 extern void f(int j = i);
4662 }
4664 Here, name look up will originally find the out
4665 of scope `i'. We need to issue a warning message,
4666 but then use the global `i'. */
4669 {
4672 decl);
4674 }
4675 }
4676 }
4678 decl = (finish_id_expression
4680 idk,
4685 template_arg_p,
4691 }
4693 /* Anything else is an error. */
4697 }
4698 }
4706 {
4709 }
4711 /* Parse an id-expression.
4713 id-expression:
4714 unqualified-id
4715 qualified-id
4717 qualified-id:
4718 :: [opt] nested-name-specifier template [opt] unqualified-id
4719 :: identifier
4720 :: operator-function-id
4721 :: template-id
4723 Return a representation of the unqualified portion of the
4724 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4725 a `::' or nested-name-specifier.
4727 Often, if the id-expression was a qualified-id, the caller will
4728 want to make a SCOPE_REF to represent the qualified-id. This
4729 function does not do this in order to avoid wastefully creating
4730 SCOPE_REFs when they are not required.
4732 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4733 `template' keyword.
4735 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4736 uninstantiated templates.
4738 If *TEMPLATE_P is non-NULL, it is set to true iff the
4739 `template' keyword is used to explicitly indicate that the entity
4740 named is a template.
4742 If DECLARATOR_P is true, the id-expression is appearing as part of
4743 a declarator, rather than as part of an expression. */
4745 static tree
4752 {
4756 /* Assume the `template' keyword was not used. */
4760 /* Look for the optional `::' operator. */
4761 global_scope_p
4764 /* Look for the optional nested-name-specifier. */
4765 nested_name_specifier_p
4768 check_dependency_p,
4770 declarator_p)
4772 /* If there is a nested-name-specifier, then we are looking at
4773 the first qualified-id production. */
4775 {
4776 tree saved_scope;
4777 tree saved_object_scope;
4778 tree saved_qualifying_scope;
4779 tree unqualified_id;
4782 /* See if the next token is the `template' keyword. */
4786 /* Name lookup we do during the processing of the
4787 unqualified-id might obliterate SCOPE. */
4791 /* Process the final unqualified-id. */
4793 check_dependency_p,
4794 declarator_p,
4796 /* Restore the SAVED_SCOPE for our caller. */
4802 }
4803 /* Otherwise, if we are in global scope, then we are looking at one
4804 of the other qualified-id productions. */
4806 {
4808 tree id;
4810 /* Peek at the next token. */
4813 /* If it's an identifier, and the next token is not a "<", then
4814 we can avoid the template-id case. This is an optimization
4815 for this common case. */
4817 && !cp_parser_nth_token_starts_template_argument_list_p
4822 /* Try a template-id. */
4826 none_type,
4827 declarator_p);
4828 /* If that worked, we're done. */
4832 /* Peek at the next token. (Changes in the token buffer may
4833 have invalidated the pointer obtained above.) */
4837 {
4844 /* Fall through. */
4849 }
4850 }
4851 else
4854 declarator_p,
4855 optional_p);
4856 }
4858 /* Parse an unqualified-id.
4860 unqualified-id:
4861 identifier
4862 operator-function-id
4863 conversion-function-id
4864 ~ class-name
4865 template-id
4867 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4868 keyword, in a construct like `A::template ...'.
4870 Returns a representation of unqualified-id. For the `identifier'
4871 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4872 production a BIT_NOT_EXPR is returned; the operand of the
4873 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4874 other productions, see the documentation accompanying the
4875 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4876 names are looked up in uninstantiated templates. If DECLARATOR_P
4877 is true, the unqualified-id is appearing as part of a declarator,
4878 rather than as part of an expression. */
4880 static tree
4886 {
4889 /* Peek at the next token. */
4893 {
4895 {
4896 tree id;
4898 /* We don't know yet whether or not this will be a
4899 template-id. */
4901 /* Try a template-id. */
4903 check_dependency_p,
4904 none_type,
4905 declarator_p);
4906 /* If it worked, we're done. */
4909 /* Otherwise, it's an ordinary identifier. */
4911 }
4915 check_dependency_p,
4916 none_type,
4917 declarator_p);
4920 {
4921 tree type_decl;
4922 tree qualifying_scope;
4923 tree object_scope;
4924 tree scope;
4927 /* Consume the `~' token. */
4929 /* Parse the class-name. The standard, as written, seems to
4930 say that:
4932 template <typename T> struct S { ~S (); };
4933 template <typename T> S<T>::~S() {}
4935 is invalid, since `~' must be followed by a class-name, but
4936 `S<T>' is dependent, and so not known to be a class.
4937 That's not right; we need to look in uninstantiated
4938 templates. A further complication arises from:
4940 template <typename T> void f(T t) {
4941 t.T::~T();
4942 }
4944 Here, it is not possible to look up `T' in the scope of `T'
4945 itself. We must look in both the current scope, and the
4946 scope of the containing complete expression.
4948 Yet another issue is:
4950 struct S {
4951 int S;
4952 ~S();
4953 };
4955 S::~S() {}
4957 The standard does not seem to say that the `S' in `~S'
4958 should refer to the type `S' and not the data member
4959 `S::S'. */
4961 /* DR 244 says that we look up the name after the "~" in the
4962 same scope as we looked up the qualifying name. That idea
4963 isn't fully worked out; it's more complicated than that. */
4968 /* Check for invalid scopes. */
4970 {
4974 }
4976 {
4980 scope);
4985 }
4988 /* If the name is of the form "X::~X" it's OK even if X is a
4989 typedef. */
4998 {
5001 }
5003 /* ~auto means the destructor of whatever the object is. */
5005 {
5008 "%<~auto%> only available with "
5012 }
5014 /* If there was an explicit qualification (S::~T), first look
5015 in the scope given by the qualification (i.e., S).
5017 Note: in the calls to cp_parser_class_name below we pass
5018 typename_type so that lookup finds the injected-class-name
5019 rather than the constructor. */
5023 {
5028 typename_type,
5031 declarator_p);
5034 }
5035 /* In "N::S::~S", look in "N" as well. */
5037 {
5042 type_decl
5046 typename_type,
5049 declarator_p);
5052 }
5053 /* In "p->S::~T", look in the scope given by "*p" as well. */
5055 {
5060 type_decl
5064 typename_type,
5067 declarator_p);
5070 }
5071 /* Look in the surrounding context. */
5073 {
5079 type_decl
5083 typename_type,
5086 declarator_p);
5089 {
5090 /* We couldn't find a type with this name, so just accept
5091 it and check for a match at instantiation time. */
5096 }
5097 }
5098 /* If an error occurred, assume that the name of the
5099 destructor is the same as the name of the qualifying
5100 class. That allows us to keep parsing after running
5101 into ill-formed destructor names. */
5107 /* Check that destructor name and scope match. */
5109 {
5116 }
5118 /* [class.dtor]
5120 A typedef-name that names a class shall not be used as the
5121 identifier in the declarator for a destructor declaration. */
5128 type_decl);
5131 }
5135 {
5136 tree id;
5138 /* This could be a template-id, so we try that first. */
5140 /* Try a template-id. */
5143 none_type,
5144 declarator_p);
5145 /* If that worked, we're done. */
5148 /* We still don't know whether we're looking at an
5149 operator-function-id or a conversion-function-id. */
5151 /* Try an operator-function-id. */
5153 /* If that didn't work, try a conversion-function-id. */
5157 {
5158 /* 17.6.3.3.5 */
5163 }
5166 }
5167 /* Fall through. */
5174 }
5175 }
5177 /* Parse an (optional) nested-name-specifier.
5179 nested-name-specifier: [C++98]
5180 class-or-namespace-name :: nested-name-specifier [opt]
5181 class-or-namespace-name :: template nested-name-specifier [opt]
5183 nested-name-specifier: [C++0x]
5184 type-name ::
5185 namespace-name ::
5186 nested-name-specifier identifier ::
5187 nested-name-specifier template [opt] simple-template-id ::
5189 PARSER->SCOPE should be set appropriately before this function is
5190 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
5191 effect. TYPE_P is TRUE if we non-type bindings should be ignored
5192 in name lookups.
5194 Sets PARSER->SCOPE to the class (TYPE) or namespace
5195 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
5196 it unchanged if there is no nested-name-specifier. Returns the new
5197 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
5199 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
5200 part of a declaration and/or decl-specifier. */
5202 static tree
5208 {
5213 /* Remember where the nested-name-specifier starts. */
5215 {
5218 }
5221 {
5222 tree new_scope;
5223 tree old_scope;
5224 tree saved_qualifying_scope;
5227 /* Spot cases that cannot be the beginning of a
5228 nested-name-specifier. */
5231 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
5232 the already parsed nested-name-specifier. */
5234 {
5235 /* Grab the nested-name-specifier and continue the loop. */
5237 /* If we originally encountered this nested-name-specifier
5238 with IS_DECLARATION set to false, we will not have
5239 resolved TYPENAME_TYPEs, so we must do so here. */
5242 {
5247 }
5250 }
5252 /* Spot cases that cannot be the beginning of a
5253 nested-name-specifier. On the second and subsequent times
5254 through the loop, we look for the `template' keyword. */
5256 ;
5257 /* A template-id can start a nested-name-specifier. */
5259 ;
5260 /* DR 743: decltype can be used in a nested-name-specifier. */
5262 ;
5263 else
5264 {
5265 /* If the next token is not an identifier, then it is
5266 definitely not a type-name or namespace-name. */
5269 /* If the following token is neither a `<' (to begin a
5270 template-id), nor a `::', then we are not looking at a
5271 nested-name-specifier. */
5277 {
5281 }
5284 && !cp_parser_nth_token_starts_template_argument_list_p
5287 }
5289 /* The nested-name-specifier is optional, so we parse
5290 tentatively. */
5293 /* Look for the optional `template' keyword, if this isn't the
5294 first time through the loop. */
5297 else
5300 /* Save the old scope since the name lookup we are about to do
5301 might destroy it. */
5304 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
5305 look up names in "X<T>::I" in order to determine that "Y" is
5306 a template. So, if we have a typename at this point, we make
5307 an effort to look through it. */
5309 && !typename_keyword_p
5314 /* Parse the qualifying entity. */
5315 new_scope
5317 typename_keyword_p,
5318 template_keyword_p,
5319 check_dependency_p,
5320 type_p,
5321 is_declaration);
5322 /* Look for the `::' token. */
5325 /* If we found what we wanted, we keep going; otherwise, we're
5326 done. */
5328 {
5331 /* Restore the OLD_SCOPE since it was valid before the
5332 failed attempt at finding the last
5333 class-or-namespace-name. */
5337 /* If the next token is a decltype, and the one after that is a
5338 `::', then the decltype has failed to resolve to a class or
5339 enumeration type. Give this error even when parsing
5340 tentatively since it can't possibly be valid--and we're going
5341 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5342 won't get another chance.*/
5346 {
5353 /* As below. */
5356 }
5360 /* If the next token is an identifier, and the one after
5361 that is a `::', then any valid interpretation would have
5362 found a class-or-namespace-name. */
5368 {
5371 {
5373 {
5374 tree decl;
5375 tree ambiguous_decls;
5378 none_type,
5387 decl);
5389 {
5390 // cp_parser_lookup_name has the same diagnostic,
5391 // thus make sure to emit it at most once.
5394 {
5399 }
5401 }
5402 else
5403 {
5405 cp_parser_name_lookup_error
5408 else
5409 cp_parser_name_lookup_error
5412 }
5413 }
5416 /* Treat this as a successful nested-name-specifier
5417 due to:
5419 [basic.lookup.qual]
5421 If the name found is not a class-name (clause
5422 _class_) or namespace-name (_namespace.def_), the
5423 program is ill-formed. */
5425 }
5427 }
5429 }
5430 /* We've found one valid nested-name-specifier. */
5432 /* Name lookup always gives us a DECL. */
5435 /* Uses of "template" must be followed by actual templates. */
5447 new_scope);
5448 /* If it is a class scope, try to complete it; we are about to
5449 be looking up names inside the class. */
5451 /* Since checking types for dependency can be expensive,
5452 avoid doing it if the type is already complete. */
5454 /* Do not try to complete dependent types. */
5456 {
5458 /* If it is a typedef to current class, use the current
5459 class instead, as the typedef won't have any names inside
5460 it yet. */
5464 }
5465 /* Make sure we look in the right scope the next time through
5466 the loop. */
5468 }
5470 /* If parsing tentatively, replace the sequence of tokens that makes
5471 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5472 token. That way, should we re-parse the token stream, we will
5473 not have to repeat the effort required to do the parse, nor will
5474 we issue duplicate error messages. */
5476 {
5480 /* Reset the contents of the START token. */
5482 /* Retrieve any deferred checks. Do not pop this access checks yet
5483 so the memory will not be reclaimed during token replacing below. */
5491 /* Purge all subsequent tokens. */
5493 }
5499 }
5501 /* Parse a nested-name-specifier. See
5502 cp_parser_nested_name_specifier_opt for details. This function
5503 behaves identically, except that it will an issue an error if no
5504 nested-name-specifier is present. */
5506 static tree
5512 {
5513 tree scope;
5515 /* Look for the nested-name-specifier. */
5517 typename_keyword_p,
5518 check_dependency_p,
5519 type_p,
5520 is_declaration);
5521 /* If it was not present, issue an error message. */
5523 {
5526 }
5529 }
5531 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5532 this is either a class-name or a namespace-name (which corresponds
5533 to the class-or-namespace-name production in the grammar). For
5534 C++0x, it can also be a type-name that refers to an enumeration
5535 type or a simple-template-id.
5537 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5538 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5539 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5540 TYPE_P is TRUE iff the next name should be taken as a class-name,
5541 even the same name is declared to be another entity in the same
5542 scope.
5544 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5545 specified by the class-or-namespace-name. If neither is found the
5546 ERROR_MARK_NODE is returned. */
5548 static tree
5555 {
5556 tree saved_scope;
5557 tree saved_qualifying_scope;
5558 tree saved_object_scope;
5559 tree scope;
5563 /* DR 743: decltype can appear in a nested-name-specifier. */
5565 {
5569 {
5572 }
5576 }
5578 /* Before we try to parse the class-name, we must save away the
5579 current PARSER->SCOPE since cp_parser_class_name will destroy
5580 it. */
5584 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5585 there is no need to look for a namespace-name. */
5586 only_class_p = template_keyword_p
5591 typename_keyword_p,
5592 template_keyword_p,
5594 check_dependency_p,
5596 is_declaration);
5598 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5602 {
5603 /* Restore the saved scope. */
5608 /* Parse tentatively. */
5611 /* Parse a type-name */
5614 /* "If the name found does not designate a namespace or a class,
5615 enumeration, or dependent type, the program is ill-formed."
5617 We cover classes and dependent types above and namespaces below,
5618 so this code is only looking for enums. */
5624 }
5625 /* If that didn't work, try for a namespace-name. */
5627 {
5628 /* Restore the saved scope. */
5632 /* If we are not looking at an identifier followed by the scope
5633 resolution operator, then this is not part of a
5634 nested-name-specifier. (Note that this function is only used
5635 to parse the components of a nested-name-specifier.) */
5640 }
5643 }
5645 /* Parse a postfix-expression.
5647 postfix-expression:
5648 primary-expression
5649 postfix-expression [ expression ]
5650 postfix-expression ( expression-list [opt] )
5651 simple-type-specifier ( expression-list [opt] )
5652 typename :: [opt] nested-name-specifier identifier
5653 ( expression-list [opt] )
5654 typename :: [opt] nested-name-specifier template [opt] template-id
5655 ( expression-list [opt] )
5656 postfix-expression . template [opt] id-expression
5657 postfix-expression -> template [opt] id-expression
5658 postfix-expression . pseudo-destructor-name
5659 postfix-expression -> pseudo-destructor-name
5660 postfix-expression ++
5661 postfix-expression --
5662 dynamic_cast < type-id > ( expression )
5663 static_cast < type-id > ( expression )
5664 reinterpret_cast < type-id > ( expression )
5665 const_cast < type-id > ( expression )
5666 typeid ( expression )
5667 typeid ( type-id )
5669 GNU Extension:
5671 postfix-expression:
5672 ( type-id ) { initializer-list , [opt] }
5674 This extension is a GNU version of the C99 compound-literal
5675 construct. (The C99 grammar uses `type-name' instead of `type-id',
5676 but they are essentially the same concept.)
5678 If ADDRESS_P is true, the postfix expression is the operand of the
5679 `&' operator. CAST_P is true if this expression is the target of a
5680 cast.
5682 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5683 class member access expressions [expr.ref].
5685 Returns a representation of the expression. */
5687 static tree
5691 {
5693 location_t loc;
5699 /* Peek at the next token. */
5702 /* Some of the productions are determined by keywords. */
5705 {
5710 {
5711 tree type;
5712 tree expression;
5716 /* All of these can be handled in the same way from the point
5717 of view of parsing. Begin by consuming the token
5718 identifying the cast. */
5721 /* New types cannot be defined in the cast. */
5723 parser->type_definition_forbidden_message
5726 /* Look for the opening `<'. */
5728 /* Parse the type to which we are casting. */
5733 /* Look for the closing `>'. */
5735 /* Restore the old message. */
5738 bool saved_greater_than_is_operator_p
5742 /* And the expression which is being cast. */
5747 parser->greater_than_is_operator_p
5750 /* Only type conversions to integral or enumeration types
5751 can be used in constant-expressions. */
5757 {
5759 postfix_expression
5763 postfix_expression
5767 postfix_expression
5769 tf_warning_or_error);
5772 postfix_expression
5777 }
5778 }
5782 {
5783 tree type;
5787 /* Consume the `typeid' token. */
5789 /* Look for the `(' token. */
5791 /* Types cannot be defined in a `typeid' expression. */
5793 parser->type_definition_forbidden_message
5795 /* We can't be sure yet whether we're looking at a type-id or an
5796 expression. */
5798 /* Try a type-id first. */
5803 /* Look for the `)' token. Otherwise, we can't be sure that
5804 we're not looking at an expression: consider `typeid (int
5805 (3))', for example. */
5807 /* If all went well, simply lookup the type-id. */
5810 /* Otherwise, fall back to the expression variant. */
5811 else
5812 {
5813 tree expression;
5815 /* Look for an expression. */
5817 /* Compute its typeid. */
5819 /* Look for the `)' token. */
5821 }
5822 /* Restore the saved message. */
5824 /* `typeid' may not appear in an integral constant expression. */
5827 }
5831 {
5832 tree type;
5833 /* The syntax permitted here is the same permitted for an
5834 elaborated-type-specifier. */
5839 }
5843 {
5846 tree p;
5860 tf_warning_or_error);
5863 tf_warning_or_error);
5864 else
5865 {
5869 }
5871 }
5874 {
5875 tree type;
5877 /* If the next thing is a simple-type-specifier, we may be
5878 looking at a functional cast. We could also be looking at
5879 an id-expression. So, we try the functional cast, and if
5880 that doesn't work we fall back to the primary-expression. */
5882 /* Look for the simple-type-specifier. */
5885 CP_PARSER_FLAGS_NONE);
5886 /* Parse the cast itself. */
5888 postfix_expression
5890 /* If that worked, we're done. */
5894 /* If the functional-cast didn't work out, try a
5895 compound-literal. */
5898 {
5903 /* Consume the `('. */
5906 /* Avoid calling cp_parser_type_id pointlessly, see comment
5907 in cp_parser_cast_expression about c++/29234. */
5910 compound_literal_p
5915 /* Roll back the tokens we skipped. */
5920 else
5921 {
5922 /* Parse the type. */
5927 /* Look for the `)'. */
5929 }
5931 /* If things aren't going well, there's no need to
5932 keep going. */
5934 {
5936 /* Parse the brace-enclosed initializer list. */
5939 }
5940 /* If that worked, we're definitely looking at a
5941 compound-literal expression. */
5943 {
5944 /* Warn the user that a compound literal is not
5945 allowed in standard C++. */
5948 /* For simplicity, we disallow compound literals in
5949 constant-expressions. We could
5950 allow compound literals of integer type, whose
5951 initializer was a constant, in constant
5952 expressions. Permitting that usage, as a further
5953 extension, would not change the meaning of any
5954 currently accepted programs. (Of course, as
5955 compound literals are not part of ISO C++, the
5956 standard has nothing to say.) */
5958 NIC_NCC))
5959 {
5962 }
5963 /* Form the representation of the compound-literal. */
5964 postfix_expression
5966 tf_warning_or_error);
5968 }
5969 }
5971 /* It must be a primary-expression. */
5972 postfix_expression
5975 decltype_p,
5977 }
5979 }
5981 /* Note that we don't need to worry about calling build_cplus_new on a
5982 class-valued CALL_EXPR in decltype when it isn't the end of the
5983 postfix-expression; unary_complex_lvalue will take care of that for
5984 all these cases. */
5986 /* Keep looping until the postfix-expression is complete. */
5988 {
5992 /* It is not a Koenig lookup function call. */
5993 postfix_expression
5996 /* Peek at the next token. */
6000 {
6003 {
6005 "two consecutive %<[%> shall "
6008 }
6009 postfix_expression
6011 postfix_expression,
6013 decltype_p);
6019 /* postfix-expression ( expression-list [opt] ) */
6020 {
6030 is_builtin_constant_p
6033 {
6034 /* The whole point of __builtin_constant_p is to allow
6035 non-constant expressions to appear as arguments. */
6036 saved_integral_constant_expression_p
6038 saved_non_integral_constant_expression_p
6041 }
6042 args = (cp_parser_parenthesized_expression_list
6047 {
6048 parser->integral_constant_expression_p
6050 parser->non_integral_constant_expression_p
6052 }
6055 {
6058 }
6060 /* Function calls are not permitted in
6061 constant-expressions. */
6064 NIC_FUNC_CALL))
6065 {
6069 }
6074 {
6076 {
6078 {
6081 postfix_expression
6084 complain);
6085 }
6086 else
6087 postfix_expression
6089 }
6090 /* We do not perform argument-dependent lookup if
6091 normal lookup finds a non-function, in accordance
6092 with the expected resolution of DR 218. */
6095 {
6099 /* Do not do argument dependent lookup if regular
6100 lookup finds a member function or a block-scope
6101 function declaration. [basic.lookup.argdep]/3 */
6104 {
6107 postfix_expression
6110 complain);
6111 }
6112 }
6113 }
6116 {
6126 {
6127 postfix_expression
6131 }
6134 {
6135 postfix_expression
6136 = (build_new_method_call
6142 complain));
6143 }
6144 else
6145 postfix_expression
6149 complain);
6150 }
6154 postfix_expression = (build_offset_ref_call_from_tree
6156 complain));
6158 /* A call to a static class member, or a namespace-scope
6159 function. */
6160 postfix_expression
6163 koenig_p,
6164 complain);
6165 else
6166 /* All other function calls. */
6167 postfix_expression
6170 koenig_p,
6171 complain);
6173 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
6177 }
6182 /* postfix-expression . template [opt] id-expression
6183 postfix-expression . pseudo-destructor-name
6184 postfix-expression -> template [opt] id-expression
6185 postfix-expression -> pseudo-destructor-name */
6187 /* Consume the `.' or `->' operator. */
6190 postfix_expression
6192 postfix_expression,
6199 /* postfix-expression ++ */
6200 /* Consume the `++' token. */
6202 /* Generate a representation for the complete expression. */
6203 postfix_expression
6205 POSTINCREMENT_EXPR);
6206 /* Increments may not appear in constant-expressions. */
6214 /* postfix-expression -- */
6215 /* Consume the `--' token. */
6217 /* Generate a representation for the complete expression. */
6218 postfix_expression
6220 POSTDECREMENT_EXPR);
6221 /* Decrements may not appear in constant-expressions. */
6233 else
6235 }
6236 }
6238 /* We should never get here. */
6241 }
6243 /* This function parses Cilk Plus array notations. If a normal array expr. is
6244 parsed then the array index is passed back to the caller through *INIT_INDEX
6245 and the function returns a NULL_TREE. If array notation expr. is parsed,
6246 then *INIT_INDEX is ignored by the caller and the function returns
6247 a tree of type ARRAY_NOTATION_REF. If some error occurred it returns
6248 error_mark_node. */
6250 static tree
6252 tree array_value)
6253 {
6257 {
6260 }
6269 {
6272 }
6274 {
6275 /* Consume the ':'. */
6278 /* If we are here, then we have a case like this A[:]. */
6280 {
6284 }
6288 }
6289 else
6290 {
6291 /* If we are here, then there are three valid possibilities:
6292 1. ARRAY [ EXP ]
6293 2. ARRAY [ EXP : EXP ]
6294 3. ARRAY [ EXP : EXP : EXP ] */
6298 {
6299 /* This indicates that we have a normal array expression. */
6302 }
6304 /* Consume the ':'. */
6308 {
6311 }
6312 }
6317 {
6321 }
6327 }
6329 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6330 by cp_parser_builtin_offsetof. We're looking for
6332 postfix-expression [ expression ]
6333 postfix-expression [ braced-init-list ] (C++11)
6335 FOR_OFFSETOF is set if we're being called in that context, which
6336 changes how we deal with integer constant expressions. */
6338 static tree
6340 tree postfix_expression,
6343 {
6348 /* Consume the `[' token. */
6354 /* Parse the index expression. */
6355 /* ??? For offsetof, there is a question of what to allow here. If
6356 offsetof is not being used in an integral constant expression context,
6357 then we *could* get the right answer by computing the value at runtime.
6358 If we are in an integral constant expression context, then we might
6359 could accept any constant expression; hard to say without analysis.
6360 Rather than open the barn door too wide right away, allow only integer
6361 constant expressions here. */
6364 else
6365 {
6367 {
6373 {
6375 "braced list index is not allowed with array "
6379 }
6380 }
6382 {
6383 /* Here are have these two options:
6384 ARRAY[EXP : EXP] - Array notation expr with default
6385 stride of 1.
6386 ARRAY[EXP : EXP : EXP] - Array Notation with user-defined
6387 stride. */
6389 postfix_expression);
6392 }
6393 else
6395 }
6399 /* Look for the closing `]'. */
6402 /* Build the ARRAY_REF. */
6406 /* When not doing offsetof, array references are not permitted in
6407 constant-expressions. */
6413 }
6415 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
6416 by cp_parser_builtin_offsetof. We're looking for
6418 postfix-expression . template [opt] id-expression
6419 postfix-expression . pseudo-destructor-name
6420 postfix-expression -> template [opt] id-expression
6421 postfix-expression -> pseudo-destructor-name
6423 FOR_OFFSETOF is set if we're being called in that context. That sorta
6424 limits what of the above we'll actually accept, but nevermind.
6425 TOKEN_TYPE is the "." or "->" token, which will already have been
6426 removed from the stream. */
6428 static tree
6431 tree postfix_expression,
6433 location_t location)
6434 {
6435 tree name;
6440 /* If this is a `->' operator, dereference the pointer. */
6443 tf_warning_or_error);
6444 /* Check to see whether or not the expression is type-dependent. */
6446 /* The identifier following the `->' or `.' is not qualified. */
6452 /* Enter the scope corresponding to the type of the object
6453 given by the POSTFIX_EXPRESSION. */
6455 {
6457 /* According to the standard, no expression should ever have
6458 reference type. Unfortunately, we do not currently match
6459 the standard in this respect in that our internal representation
6460 of an expression may have reference type even when the standard
6461 says it does not. Therefore, we have to manually obtain the
6462 underlying type here. */
6464 /* The type of the POSTFIX_EXPRESSION must be complete. */
6466 {
6468 postfix_expression);
6470 }
6471 /* Unlike the object expression in other contexts, *this is not
6472 required to be of complete type for purposes of class member
6473 access (5.2.5) outside the member function body. */
6477 /* Let the name lookup machinery know that we are processing a
6478 class member access expression. */
6480 /* If something went wrong, we want to be able to discern that case,
6481 as opposed to the case where there was no SCOPE due to the type
6482 of expression being dependent. */
6485 /* If the SCOPE was erroneous, make the various semantic analysis
6486 functions exit quickly -- and without issuing additional error
6487 messages. */
6490 }
6492 /* Assume this expression is not a pseudo-destructor access. */
6495 /* If the SCOPE is a scalar type, then, if this is a valid program,
6496 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6497 is type dependent, it can be pseudo-destructor-name or something else.
6498 Try to parse it as pseudo-destructor-name first. */
6500 {
6501 tree s;
6502 tree type;
6505 /* Parse the pseudo-destructor-name. */
6514 {
6516 postfix_expression
6519 }
6520 }
6523 {
6524 /* If the SCOPE is not a scalar type, we are looking at an
6525 ordinary class member access expression, rather than a
6526 pseudo-destructor-name. */
6529 /* Parse the id-expression. */
6530 name = (cp_parser_id_expression
6537 /* In general, build a SCOPE_REF if the member name is qualified.
6538 However, if the name was not dependent and has already been
6539 resolved; there is no need to build the SCOPE_REF. For example;
6541 struct X { void f(); };
6542 template <typename T> void f(T* t) { t->X::f(); }
6544 Even though "t" is dependent, "X::f" is not and has been resolved
6545 to a BASELINK; there is no need to include scope information. */
6547 /* But we do need to remember that there was an explicit scope for
6548 virtual function calls. */
6552 /* If the name is a template-id that names a type, we will get a
6553 TYPE_DECL here. That is invalid code. */
6555 {
6558 }
6559 else
6560 {
6562 {
6564 {
6568 }
6569 else
6572 name,
6573 template_p);
6577 }
6579 adjust_result_of_qualified_name_lookup
6581 postfix_expression
6583 template_p,
6584 tf_warning_or_error);
6585 }
6586 }
6588 /* We no longer need to look up names in the scope of the object on
6589 the left-hand side of the `.' or `->' operator. */
6592 /* Outside of offsetof, these operators may not appear in
6593 constant-expressions. */
6595 && (cp_parser_non_integral_constant_expression
6600 }
6602 /* Parse a parenthesized expression-list.
6604 expression-list:
6605 assignment-expression
6606 expression-list, assignment-expression
6608 attribute-list:
6609 expression-list
6610 identifier
6611 identifier, expression-list
6613 CAST_P is true if this expression is the target of a cast.
6615 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6616 argument pack.
6618 Returns a vector of trees. Each element is a representation of an
6619 assignment-expression. NULL is returned if the ( and or ) are
6620 missing. An empty, but allocated, vector is returned on no
6621 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6622 if we are parsing an attribute list for an attribute that wants a
6623 plain identifier argument, normal_attr for an attribute that wants
6624 an expression, or non_attr if we aren't parsing an attribute list. If
6625 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6626 not all of the expressions in the list were constant. */
6634 {
6640 /* Assume all the expressions will be constant. */
6649 /* Within a parenthesized expression, a `>' token is always
6650 the greater-than operator. */
6651 saved_greater_than_is_operator_p
6655 /* Consume expressions until there are no more. */
6658 {
6659 tree expr;
6661 /* At the beginning of attribute lists, check to see if the
6662 next token is an identifier. */
6665 {
6668 /* Consume the identifier. */
6670 /* Save the identifier. */
6672 }
6673 else
6674 {
6677 /* Parse the next assignment-expression. */
6679 {
6680 /* A braced-init-list. */
6685 }
6687 {
6688 expr = (cp_parser_constant_expression
6693 }
6694 else
6700 /* If we have an ellipsis, then this is an expression
6701 expansion. */
6704 {
6705 /* Consume the `...'. */
6708 /* Build the argument pack. */
6710 }
6712 /* Add it to the list. We add error_mark_node
6713 expressions to the list, so that we can still tell if
6714 the correct form for a parenthesized expression-list
6715 is found. That gives better errors. */
6720 }
6722 /* After the first item, attribute lists look the same as
6723 expression lists. */
6726 get_comma:;
6727 /* If the next token isn't a `,', then we are done. */
6731 /* Otherwise, consume the `,' and keep going. */
6733 }
6736 {
6739 skip_comma:;
6740 /* We try and resync to an unnested comma, as that will give the
6741 user better diagnostics. */
6749 {
6750 parser->greater_than_is_operator_p
6753 }
6754 }
6756 parser->greater_than_is_operator_p
6763 }
6765 /* Parse a pseudo-destructor-name.
6767 pseudo-destructor-name:
6768 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6769 :: [opt] nested-name-specifier template template-id :: ~ type-name
6770 :: [opt] nested-name-specifier [opt] ~ type-name
6772 If either of the first two productions is used, sets *SCOPE to the
6773 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6774 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6775 or ERROR_MARK_NODE if the parse fails. */
6777 static void
6779 tree object,
6782 {
6785 /* Handle ~auto. */
6789 {
6792 "%<~auto%> only available with "
6799 }
6801 /* Assume that things will not work out. */
6804 /* Look for the optional `::' operator. */
6806 /* Look for the optional nested-name-specifier. */
6807 nested_name_specifier_p
6814 /* Now, if we saw a nested-name-specifier, we might be doing the
6815 second production. */
6818 {
6819 /* Consume the `template' keyword. */
6821 /* Parse the template-id. */
6825 class_type,
6827 /* Look for the `::' token. */
6829 }
6830 /* If the next token is not a `~', then there might be some
6831 additional qualification. */
6833 {
6834 /* At this point, we're looking for "type-name :: ~". The type-name
6835 must not be a class-name, since this is a pseudo-destructor. So,
6836 it must be either an enum-name, or a typedef-name -- both of which
6837 are just identifiers. So, we peek ahead to check that the "::"
6838 and "~" tokens are present; if they are not, then we can avoid
6839 calling type_name. */
6843 {
6846 }
6848 /* Look for the type-name. */
6853 /* Look for the `::' token. */
6855 }
6856 else
6859 /* Look for the `~'. */
6862 /* Once we see the ~, this has to be a pseudo-destructor. */
6866 /* Look for the type-name again. We are not responsible for
6867 checking that it matches the first type-name. */
6869 }
6871 /* Parse a unary-expression.
6873 unary-expression:
6874 postfix-expression
6875 ++ cast-expression
6876 -- cast-expression
6877 unary-operator cast-expression
6878 sizeof unary-expression
6879 sizeof ( type-id )
6880 alignof ( type-id ) [C++0x]
6881 new-expression
6882 delete-expression
6884 GNU Extensions:
6886 unary-expression:
6887 __extension__ cast-expression
6888 __alignof__ unary-expression
6889 __alignof__ ( type-id )
6890 alignof unary-expression [C++0x]
6891 __real__ cast-expression
6892 __imag__ cast-expression
6893 && identifier
6894 sizeof ( type-id ) { initializer-list , [opt] }
6895 alignof ( type-id ) { initializer-list , [opt] } [C++0x]
6896 __alignof__ ( type-id ) { initializer-list , [opt] }
6898 ADDRESS_P is true iff the unary-expression is appearing as the
6899 operand of the `&' operator. CAST_P is true if this expression is
6900 the target of a cast.
6902 Returns a representation of the expression. */
6904 static tree
6907 {
6911 /* Peek at the next token. */
6913 /* Some keywords give away the kind of expression. */
6915 {
6919 {
6922 {
6925 location_t first_loc;
6928 /* Consume the token. */
6931 /* Parse the operand. */
6936 else
6937 {
6938 /* ISO C++ defines alignof only with types, not with
6939 expressions. So pedwarn if alignof is used with a non-
6940 type expression. However, __alignof__ is ok. */
6943 "ISO C++ does not allow %<alignof%> "
6947 }
6948 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6949 SIZEOF_EXPR with the original operand. */
6951 {
6953 {
6955 {
6958 error_mark_node));
6960 }
6961 else
6965 }
6967 }
6969 }
6978 {
6979 /* The saved value of the PEDANTIC flag. */
6981 tree expr;
6983 /* Save away the PEDANTIC flag. */
6985 /* Parse the cast-expression. */
6987 /* Restore the PEDANTIC flag. */
6991 }
6995 {
6996 tree expression;
6998 /* Consume the `__real__' or `__imag__' token. */
7000 /* Parse the cast-expression. */
7002 /* Create the complete representation. */
7006 expression,
7007 tf_warning_or_error);
7008 }
7016 {
7017 tree expr;
7027 parser->type_definition_forbidden_message
7030 saved_integral_constant_expression_p
7032 saved_non_integral_constant_expression_p
7036 saved_greater_than_is_operator_p
7046 parser->greater_than_is_operator_p
7049 parser->integral_constant_expression_p
7051 parser->non_integral_constant_expression_p
7058 }
7062 }
7063 }
7065 /* Look for the `:: new' and `:: delete', which also signal the
7066 beginning of a new-expression, or delete-expression,
7067 respectively. If the next token is `::', then it might be one of
7068 these. */
7070 {
7073 /* See if the token after the `::' is one of the keywords in
7074 which we're interested. */
7076 /* If it's `new', we have a new-expression. */
7079 /* Similarly, for `delete'. */
7082 }
7084 /* Look for a unary operator. */
7086 /* The `++' and `--' operators can be handled similarly, even though
7087 they are not technically unary-operators in the grammar. */
7089 {
7094 /* Handle the GNU address-of-label extension. */
7097 {
7098 tree identifier;
7099 tree expression;
7102 /* Consume the '&&' token. */
7104 /* Look for the identifier. */
7106 /* Create an expression representing the address. */
7109 NIC_ADDR_LABEL))
7112 }
7113 }
7115 {
7116 tree cast_expression;
7122 /* Consume the operator token. */
7124 /* Parse the cast-expression. */
7125 cast_expression
7130 pidk);
7131 /* Now, build an appropriate representation. */
7133 {
7137 RO_UNARY_STAR,
7138 complain);
7143 /* Fall through. */
7146 cast_expression,
7147 complain);
7154 /* Fall through. */
7164 }
7168 non_constant_p))
7172 }
7176 decltype_p,
7177 pidk);
7178 }
7183 {
7186 }
7188 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
7189 unary-operator, the corresponding tree code is returned. */
7191 static enum tree_code
7193 {
7195 {
7216 }
7217 }
7219 /* Parse a new-expression.
7221 new-expression:
7222 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
7223 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
7225 Returns a representation of the expression. */
7227 static tree
7229 {
7232 tree type;
7235 tree ret;
7237 /* Look for the optional `::' operator. */
7238 global_scope_p
7242 /* Look for the `new' operator. */
7244 /* There's no easy way to tell a new-placement from the
7245 `( type-id )' construct. */
7247 /* Look for a new-placement. */
7249 /* If that didn't work out, there's no new-placement. */
7251 {
7255 }
7257 /* If the next token is a `(', then we have a parenthesized
7258 type-id. */
7260 {
7264 /* Consume the `('. */
7267 /* Parse the type-id. */
7268 parser->type_definition_forbidden_message
7273 /* Look for the closing `)'. */
7276 /* There should not be a direct-new-declarator in this production,
7277 but GCC used to allowed this, so we check and emit a sensible error
7278 message for this case. */
7280 {
7286 }
7287 }
7288 /* Otherwise, there must be a new-type-id. */
7289 else
7292 /* If the next token is a `(' or '{', then we have a new-initializer. */
7296 else
7299 /* A new-expression may not appear in an integral constant
7300 expression. */
7303 else
7304 {
7305 /* Create a representation of the new-expression. */
7307 tf_warning_or_error);
7308 }
7316 }
7318 /* Parse a new-placement.
7320 new-placement:
7321 ( expression-list )
7323 Returns the same representation as for an expression-list. */
7327 {
7330 /* Parse the expression-list. */
7331 expression_list = (cp_parser_parenthesized_expression_list
7337 }
7339 /* Parse a new-type-id.
7341 new-type-id:
7342 type-specifier-seq new-declarator [opt]
7344 Returns the TYPE allocated. If the new-type-id indicates an array
7345 type, *NELTS is set to the number of elements in the last array
7346 bound; the TYPE will not include the last array bound. */
7348 static tree
7350 {
7351 cp_decl_specifier_seq type_specifier_seq;
7357 /* The type-specifier sequence must not contain type definitions.
7358 (It cannot contain declarations of new types either, but if they
7359 are not definitions we will catch that because they are not
7360 complete.) */
7362 parser->type_definition_forbidden_message
7364 /* Parse the type-specifier-seq. */
7368 /* Restore the old message. */
7374 /* Parse the new-declarator. */
7377 /* Determine the number of elements in the last array dimension, if
7378 any. */
7380 /* Skip down to the last array dimension. */
7385 {
7388 }
7393 {
7396 }
7399 {
7406 else
7408 }
7411 }
7413 /* Parse an (optional) new-declarator.
7415 new-declarator:
7416 ptr-operator new-declarator [opt]
7417 direct-new-declarator
7419 Returns the declarator. */
7423 {
7426 cp_cv_quals cv_quals;
7428 /* We don't know if there's a ptr-operator next, or not. */
7430 /* Look for a ptr-operator. */
7432 /* If that worked, look for more new-declarators. */
7434 {
7437 /* Parse another optional declarator. */
7440 declarator = cp_parser_make_indirect_declarator
7444 }
7446 /* If the next token is a `[', there is a direct-new-declarator. */
7451 }
7453 /* Parse a direct-new-declarator.
7455 direct-new-declarator:
7456 [ expression ]
7457 direct-new-declarator [constant-expression]
7459 */
7463 {
7467 {
7468 tree expression;
7471 /* Look for the opening `['. */
7476 /* The standard requires that the expression have integral
7477 type. DR 74 adds enumeration types. We believe that the
7478 real intent is that these expressions be handled like the
7479 expression in a `switch' condition, which also allows
7480 classes with a single conversion to integral or
7481 enumeration type. */
7483 {
7484 expression
7486 expression,
7489 {
7491 "expression in new-declarator must have integral "
7494 }
7495 }
7497 /* Look for the closing `]'. */
7500 /* Add this bound to the declarator. */
7503 /* If the next token is not a `[', then there are no more
7504 bounds. */
7507 }
7510 }
7512 /* Parse a new-initializer.
7514 new-initializer:
7515 ( expression-list [opt] )
7516 braced-init-list
7518 Returns a representation of the expression-list. */
7522 {
7526 {
7527 tree t;
7533 }
7534 else
7535 expression_list = (cp_parser_parenthesized_expression_list
7541 }
7543 /* Parse a delete-expression.
7545 delete-expression:
7546 :: [opt] delete cast-expression
7547 :: [opt] delete [ ] cast-expression
7549 Returns a representation of the expression. */
7551 static tree
7553 {
7556 tree expression;
7558 /* Look for the optional `::' operator. */
7559 global_scope_p
7563 /* Look for the `delete' keyword. */
7565 /* See if the array syntax is in use. */
7567 {
7568 /* Consume the `[' token. */
7570 /* Look for the `]' token. */
7572 /* Remember that this is the `[]' construct. */
7574 }
7575 else
7578 /* Parse the cast-expression. */
7581 /* A delete-expression may not appear in an integral constant
7582 expression. */
7587 tf_warning_or_error);
7588 }
7590 /* Returns true if TOKEN may start a cast-expression and false
7591 otherwise. */
7593 static bool
7595 {
7598 {
7639 /* In ((type ()) () the last () isn't a valid cast-expression,
7640 so the whole must be parsed as postfix-expression. */
7644 /* '[' may start a primary-expression in obj-c++. */
7650 }
7651 }
7653 /* Parse a cast-expression.
7655 cast-expression:
7656 unary-expression
7657 ( type-id ) cast-expression
7659 ADDRESS_P is true iff the unary-expression is appearing as the
7660 operand of the `&' operator. CAST_P is true if this expression is
7661 the target of a cast.
7663 Returns a representation of the expression. */
7665 static tree
7668 {
7669 /* If it's a `(', then we might be looking at a cast. */
7671 {
7677 /* There's no way to know yet whether or not this is a cast.
7678 For example, `(int (3))' is a unary-expression, while `(int)
7679 3' is a cast. So, we resort to parsing tentatively. */
7681 /* Types may not be defined in a cast. */
7683 parser->type_definition_forbidden_message
7685 /* Consume the `('. */
7687 /* A very tricky bit is that `(struct S) { 3 }' is a
7688 compound-literal (which we permit in C++ as an extension).
7689 But, that construct is not a cast-expression -- it is a
7690 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7691 is legal; if the compound-literal were a cast-expression,
7692 you'd need an extra set of parentheses.) But, if we parse
7693 the type-id, and it happens to be a class-specifier, then we
7694 will commit to the parse at that point, because we cannot
7695 undo the action that is done when creating a new class. So,
7696 then we cannot back up and do a postfix-expression.
7697 Another tricky case is the following (c++/29234):
7699 struct S { void operator () (); };
7701 void foo ()
7702 {
7703 ( S()() );
7704 }
7706 As a type-id we parse the parenthesized S()() as a function
7707 returning a function, groktypename complains and we cannot
7708 back up in this case either.
7710 Therefore, we scan ahead to the closing `)', and check to see
7711 if the tokens after the `)' can start a cast-expression. Otherwise
7712 we are dealing with an unary-expression, a postfix-expression
7713 or something else.
7715 Save tokens so that we can put them back. */
7718 /* We may be looking at a cast-expression. */
7719 cast_expression_p
7724 /* Roll back the tokens we skipped. */
7726 /* If we aren't looking at a cast-expression, simulate an error so
7727 that the call to cp_parser_parse_definitely below will fail. */
7730 else
7731 {
7734 /* Look for the type-id. */
7736 /* Look for the closing `)'. */
7739 }
7741 /* Restore the saved message. */
7744 /* At this point this can only be either a cast or a
7745 parenthesized ctor such as `(T ())' that looks like a cast to
7746 function returning T. */
7748 {
7754 pidk);
7756 /* Warn about old-style casts, if so requested. */
7758 && !in_system_header
7763 /* Only type conversions to integral or enumeration types
7764 can be used in constant-expressions. */
7767 NIC_CAST))
7770 /* Perform the cast. */
7773 }
7774 else
7776 }
7778 /* If we get here, then it's not a cast, so it must be a
7779 unary-expression. */
7782 }
7784 /* Parse a binary expression of the general form:
7786 pm-expression:
7787 cast-expression
7788 pm-expression .* cast-expression
7789 pm-expression ->* cast-expression
7791 multiplicative-expression:
7792 pm-expression
7793 multiplicative-expression * pm-expression
7794 multiplicative-expression / pm-expression
7795 multiplicative-expression % pm-expression
7797 additive-expression:
7798 multiplicative-expression
7799 additive-expression + multiplicative-expression
7800 additive-expression - multiplicative-expression
7802 shift-expression:
7803 additive-expression
7804 shift-expression << additive-expression
7805 shift-expression >> additive-expression
7807 relational-expression:
7808 shift-expression
7809 relational-expression < shift-expression
7810 relational-expression > shift-expression
7811 relational-expression <= shift-expression
7812 relational-expression >= shift-expression
7814 GNU Extension:
7816 relational-expression:
7817 relational-expression <? shift-expression
7818 relational-expression >? shift-expression
7820 equality-expression:
7821 relational-expression
7822 equality-expression == relational-expression
7823 equality-expression != relational-expression
7825 and-expression:
7826 equality-expression
7827 and-expression & equality-expression
7829 exclusive-or-expression:
7830 and-expression
7831 exclusive-or-expression ^ and-expression
7833 inclusive-or-expression:
7834 exclusive-or-expression
7835 inclusive-or-expression | exclusive-or-expression
7837 logical-and-expression:
7838 inclusive-or-expression
7839 logical-and-expression && inclusive-or-expression
7841 logical-or-expression:
7842 logical-and-expression
7843 logical-or-expression || logical-and-expression
7845 All these are implemented with a single function like:
7847 binary-expression:
7848 simple-cast-expression
7849 binary-expression <token> binary-expression
7851 CAST_P is true if this expression is the target of a cast.
7853 The binops_by_token map is used to get the tree codes for each <token> type.
7854 binary-expressions are associated according to a precedence table. */
7856 #define TOKEN_PRECEDENCE(token) \
7857 (((token->type == CPP_GREATER \
7858 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7859 && !parser->greater_than_is_operator_p) \
7860 ? PREC_NOT_OPERATOR \
7861 : binops_by_token[token->type].prec)
7863 static tree
7869 {
7870 cp_parser_expression_stack stack;
7872 cp_parser_expression_stack_entry current;
7873 tree rhs;
7877 tree overload;
7879 /* Parse the first expression. */
7889 {
7890 /* Get an operator token. */
7896 {
7898 "%<>>%> operator is treated"
7902 }
7906 /* Popping an entry off the stack means we completed a subexpression:
7907 - either we found a token which is not an operator (`>' where it is not
7908 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7909 will happen repeatedly;
7910 - or, we found an operator which has lower priority. This is the case
7911 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7912 parsing `3 * 4'. */
7914 {
7917 else
7919 }
7921 get_rhs:
7925 /* We used the operator token. */
7928 /* For "false && x" or "true || x", x will never be executed;
7929 disable warnings while evaluating it. */
7935 /* Extract another operand. It may be the RHS of this expression
7936 or the LHS of a new, higher priority expression. */
7940 /* Get another operator token. Look up its precedence to avoid
7941 building a useless (immediately popped) stack entry for common
7942 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7946 {
7947 /* ... and prepare to parse the RHS of the new, higher priority
7948 expression. Since precedence levels on the stack are
7949 monotonically increasing, we do not have to care about
7950 stack overflows. */
7959 pop:
7961 /* If the stack is not empty, we have parsed into LHS the right side
7962 (`4' in the example above) of an expression we had suspended.
7963 We can use the information on the stack to recover the LHS (`3')
7964 from the stack together with the tree code (`MULT_EXPR'), and
7965 the precedence of the higher level subexpression
7966 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7967 which will be used to actually build the additive expression. */
7972 }
7974 /* Undo the disabling of warnings done above. */
7981 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7982 ERROR_MARK for everything that is not a binary expression.
7983 This makes warn_about_parentheses miss some warnings that
7984 involve unary operators. For unary expressions we should
7985 pass the correct tree_code unless the unary expression was
7986 surrounded by parentheses.
7987 */
7993 == tcc_comparison
7996 else
8005 /* If the binary operator required the use of an overloaded operator,
8006 then this expression cannot be an integral constant-expression.
8007 An overloaded operator can be used even if both operands are
8008 otherwise permissible in an integral constant-expression if at
8009 least one of the operands is of enumeration type. */
8013 NIC_OVERLOADED))
8015 }
8018 }
8020 static tree
8025 {
8028 }
8030 /* Parse the `? expression : assignment-expression' part of a
8031 conditional-expression. The LOGICAL_OR_EXPR is the
8032 logical-or-expression that started the conditional-expression.
8033 Returns a representation of the entire conditional-expression.
8035 This routine is used by cp_parser_assignment_expression.
8037 ? expression : assignment-expression
8039 GNU Extensions:
8041 ? : assignment-expression */
8043 static tree
8045 {
8046 tree expr;
8047 tree assignment_expr;
8051 /* Consume the `?' token. */
8056 {
8059 /* Implicit true clause. */
8063 }
8064 else
8065 {
8068 /* Parse the expression. */
8071 c_inhibit_evaluation_warnings +=
8075 }
8077 /* The next token should be a `:'. */
8079 /* Parse the assignment-expression. */
8083 /* Build the conditional-expression. */
8085 expr,
8086 assignment_expr,
8087 tf_warning_or_error);
8088 }
8090 /* Parse an assignment-expression.
8092 assignment-expression:
8093 conditional-expression
8094 logical-or-expression assignment-operator assignment_expression
8095 throw-expression
8097 CAST_P is true if this expression is the target of a cast.
8098 DECLTYPE_P is true if this expression is the operand of decltype.
8100 Returns a representation for the expression. */
8102 static tree
8105 {
8106 tree expr;
8108 /* If the next token is the `throw' keyword, then we're looking at
8109 a throw-expression. */
8112 /* Otherwise, it must be that we are looking at a
8113 logical-or-expression. */
8114 else
8115 {
8116 /* Parse the binary expressions (logical-or-expression). */
8118 decltype_p,
8120 /* If the next token is a `?' then we're actually looking at a
8121 conditional-expression. */
8124 else
8125 {
8128 /* If it's an assignment-operator, we're using the second
8129 production. */
8130 enum tree_code assignment_operator
8133 {
8135 location_t saved_input_location;
8137 /* Parse the right-hand side of the assignment. */
8143 /* An assignment may not appear in a
8144 constant-expression. */
8146 NIC_ASSIGNMENT))
8148 /* Build the assignment expression. Its default
8149 location is the location of the '=' token. */
8153 assignment_operator,
8154 rhs,
8157 }
8158 }
8159 }
8162 }
8164 static tree
8167 {
8170 }
8172 /* Parse an (optional) assignment-operator.
8174 assignment-operator: one of
8175 = *= /= %= += -= >>= <<= &= ^= |=
8177 GNU Extension:
8179 assignment-operator: one of
8180 <?= >?=
8182 If the next token is an assignment operator, the corresponding tree
8183 code is returned, and the token is consumed. For example, for
8184 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
8185 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
8186 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
8187 operator, ERROR_MARK is returned. */
8189 static enum tree_code
8191 {
8195 /* Peek at the next token. */
8199 {
8245 /* Nothing else is an assignment operator. */
8247 }
8249 /* If it was an assignment operator, consume it. */
8254 }
8256 /* Parse an expression.
8258 expression:
8259 assignment-expression
8260 expression , assignment-expression
8262 CAST_P is true if this expression is the target of a cast.
8263 DECLTYPE_P is true if this expression is the immediate operand of decltype,
8264 except possibly parenthesized or on the RHS of a comma (N3276).
8266 Returns a representation of the expression. */
8268 static tree
8271 {
8276 {
8277 tree assignment_expression;
8279 /* Parse the next assignment-expression. */
8280 assignment_expression
8283 /* We don't create a temporary for a call that is the immediate operand
8284 of decltype or on the RHS of a comma. But when we see a comma, we
8285 need to create a temporary for a call on the LHS. */
8290 assignment_expression
8294 /* If this is the first assignment-expression, we can just
8295 save it away. */
8298 else
8300 assignment_expression,
8302 /* If the next token is not a comma, then we are done with the
8303 expression. */
8306 /* Consume the `,'. */
8309 /* A comma operator cannot appear in a constant-expression. */
8312 }
8315 }
8319 {
8321 }
8323 /* Parse a constant-expression.
8325 constant-expression:
8326 conditional-expression
8328 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
8329 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
8330 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
8331 is false, NON_CONSTANT_P should be NULL. */
8333 static tree
8337 {
8341 tree expression;
8343 /* It might seem that we could simply parse the
8344 conditional-expression, and then check to see if it were
8345 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
8346 one that the compiler can figure out is constant, possibly after
8347 doing some simplifications or optimizations. The standard has a
8348 precise definition of constant-expression, and we must honor
8349 that, even though it is somewhat more restrictive.
8351 For example:
8353 int i[(2, 3)];
8355 is not a legal declaration, because `(2, 3)' is not a
8356 constant-expression. The `,' operator is forbidden in a
8357 constant-expression. However, GCC's constant-folding machinery
8358 will fold this operation to an INTEGER_CST for `3'. */
8360 /* Save the old settings. */
8362 saved_allow_non_integral_constant_expression_p
8365 /* We are now parsing a constant-expression. */
8367 parser->allow_non_integral_constant_expression_p
8370 /* Although the grammar says "conditional-expression", we parse an
8371 "assignment-expression", which also permits "throw-expression"
8372 and the use of assignment operators. In the case that
8373 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
8374 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
8375 actually essential that we look for an assignment-expression.
8376 For example, cp_parser_initializer_clauses uses this function to
8377 determine whether a particular assignment-expression is in fact
8378 constant. */
8380 /* Restore the old settings. */
8381 parser->integral_constant_expression_p
8383 parser->allow_non_integral_constant_expression_p
8386 {
8387 /* Require an rvalue constant expression here; that's what our
8388 callers expect. Reference constant expressions are handled
8389 separately in e.g. cp_parser_template_argument. */
8394 }
8397 parser->non_integral_constant_expression_p
8401 }
8403 /* Parse __builtin_offsetof.
8405 offsetof-expression:
8406 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
8408 offsetof-member-designator:
8409 id-expression
8410 | offsetof-member-designator "." id-expression
8411 | offsetof-member-designator "[" expression "]"
8412 | offsetof-member-designator "->" id-expression */
8414 static tree
8416 {
8419 cp_id_kind dummy;
8422 /* We're about to accept non-integral-constant things, but will
8423 definitely yield an integral constant expression. Save and
8424 restore these values around our local parsing. */
8428 /* Consume the "__builtin_offsetof" token. */
8430 /* Consume the opening `('. */
8432 /* Parse the type-id. */
8434 /* Look for the `,'. */
8438 /* Build the (type *)null that begins the traditional offsetof macro. */
8440 tf_warning_or_error);
8442 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
8446 {
8449 {
8451 /* offsetof-member-designator "[" expression "]" */
8457 /* offsetof-member-designator "->" identifier */
8460 /* FALLTHRU */
8463 /* offsetof-member-designator "." identifier */
8471 /* Consume the ")" token. */
8476 /* Error. We know the following require will fail, but
8477 that gives the proper error message. */
8482 }
8483 }
8485 success:
8486 /* If we're processing a template, we can't finish the semantics yet.
8487 Otherwise we can fold the entire expression now. */
8490 else
8493 failure:
8498 }
8500 /* Parse a trait expression.
8502 Returns a representation of the expression, the underlying type
8503 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
8505 static tree
8507 {
8508 cp_trait_kind kind;
8511 cp_decl_specifier_seq decl_specs;
8514 {
8595 }
8597 /* Consume the token. */
8607 /* Build a trivial decl-specifier-seq. */
8611 /* Call grokdeclarator to figure out what type this is. */
8616 {
8624 /* Build a trivial decl-specifier-seq. */
8628 /* Call grokdeclarator to figure out what type this is. */
8631 }
8635 /* Complete the trait expression, which may mean either processing
8636 the trait expr now or saving it for template instantiation. */
8638 {
8647 }
8648 }
8650 /* Lambdas that appear in variable initializer or default argument scope
8651 get that in their mangling, so we need to record it. We might as well
8652 use the count for function and namespace scopes as well. */
8656 {
8657 tree t;
8662 static void
8664 {
8665 tree_int ti;
8667 /* Once we're inside a function, we ignore other scopes and just push
8668 the function again so that popping works properly. */
8675 {
8676 /* Don't reset the count if we're still in the same function. */
8679 }
8680 }
8682 static void
8684 {
8687 }
8689 static void
8691 {
8694 {
8697 }
8699 }
8701 /* Parse a lambda expression.
8703 lambda-expression:
8704 lambda-introducer lambda-declarator [opt] compound-statement
8706 Returns a representation of the expression. */
8708 static tree
8710 {
8712 tree type;
8722 /* We may be in the middle of deferred access check. Disable
8723 it now. */
8734 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8737 /* Now that we've started the type, add the capture fields for any
8738 explicit captures. */
8741 {
8742 /* Inside the class, surrounding template-parameter-lists do not apply. */
8743 unsigned int saved_num_template_parameter_lists
8747 bool fully_implicit_function_template_p
8759 /* By virtue of defining a local class, a lambda expression has access to
8760 the private variables of enclosing classes. */
8769 /* The capture list was built up in reverse order; fix that now. */
8781 parser->fully_implicit_function_template_p
8785 }
8789 /* This field is only used during parsing of the lambda. */
8792 /* This lambda shouldn't have any proxies left at this point. */
8794 /* And now that we're done, push proxies for an enclosing lambda. */
8799 else
8801 }
8803 /* Parse the beginning of a lambda expression.
8805 lambda-introducer:
8806 [ lambda-capture [opt] ]
8808 LAMBDA_EXPR is the current representation of the lambda expression. */
8810 static void
8812 {
8813 /* Need commas after the first capture. */
8816 /* Eat the leading `['. */
8819 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8827 {
8830 }
8833 {
8835 tree capture_id;
8836 tree capture_init_expr;
8840 enum capture_kind_type
8841 {
8842 BY_COPY,
8843 BY_REFERENCE
8844 };
8848 {
8851 }
8855 else
8858 /* Possibly capture `this'. */
8860 {
8870 explicit_init_p);
8872 }
8874 /* Remember whether we want to capture as a reference or not. */
8876 {
8879 }
8881 /* Get the identifier. */
8886 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8887 delimiters, but I modified this to stop on unnested ']' as well. It
8888 was already changed to stop on unnested '}', so the
8889 "closing_parenthesis" name is no more misleading with my change. */
8890 {
8896 }
8898 /* Find the initializer for this capture. */
8902 {
8904 /* An explicit initializer exists. */
8907 "lambda capture initializers "
8912 }
8913 else
8914 {
8917 /* Turn the identifier into an id-expression. */
8918 capture_init_expr
8923 {
8926 }
8930 {
8933 capture_init_expr);
8936 }
8939 {
8942 capture_init_expr);
8945 }
8947 capture_init_expr
8948 = finish_id_expression
8950 capture_init_expr,
8964 {
8967 }
8968 else
8970 }
8974 {
8979 capture_id);
8983 "capture of %qD redundant with by-reference capture "
8985 }
8988 capture_id,
8989 capture_init_expr,
8991 explicit_init_p);
8992 }
8995 }
8997 /* Parse the (optional) middle of a lambda expression.
8999 lambda-declarator:
9000 < template-parameter-list [opt] >
9001 ( parameter-declaration-clause [opt] )
9002 attribute-specifier [opt]
9003 mutable [opt]
9004 exception-specification [opt]
9005 lambda-return-type-clause [opt]
9007 LAMBDA_EXPR is the current representation of the lambda expression. */
9009 static bool
9011 {
9012 /* 5.1.1.4 of the standard says:
9013 If a lambda-expression does not include a lambda-declarator, it is as if
9014 the lambda-declarator were ().
9015 This means an empty parameter list, no attributes, and no exception
9016 specification. */
9022 /* The template-parameter-list is optional, but must begin with
9023 an opening angle if present. */
9025 {
9028 "lambda templates are only available with "
9037 /* We just processed one more parameter list. */
9039 }
9041 /* The parameter-declaration-clause is optional (unless
9042 template-parameter-list was given), but must begin with an
9043 opening parenthesis if present. */
9045 {
9050 /* Parse parameters. */
9053 /* Default arguments shall not be specified in the
9054 parameter-declaration-clause of a lambda-declarator. */
9064 /* Parse optional `mutable' keyword. */
9066 {
9069 }
9071 /* Parse optional exception specification. */
9074 /* Parse optional trailing return type. */
9076 {
9080 }
9082 /* The function parameters must be in scope all the way until after the
9083 trailing-return-type in case of decltype. */
9085 }
9089 /* Create the function call operator.
9091 Messing with declarators like this is no uglier than building up the
9092 FUNCTION_DECL by hand, and this is less likely to get out of sync with
9093 other code. */
9094 {
9095 cp_decl_specifier_seq return_type_specs;
9097 tree fco;
9104 else
9105 /* Maybe we will deduce the return type later. */
9111 sfk_none);
9116 VIRT_SPEC_UNSPECIFIED,
9117 REF_QUAL_NONE,
9118 exception_spec,
9123 declarator,
9124 attributes);
9126 {
9129 /* Give the object parameter a different name. */
9132 {
9136 }
9139 }
9146 }
9147 }
9149 /* Parse the body of a lambda expression, which is simply
9151 compound-statement
9153 but which requires special handling.
9154 LAMBDA_EXPR is the current representation of the lambda expression. */
9156 static void
9158 {
9163 else
9164 /* Still increment function_depth so that we don't GC in the
9165 middle of an expression. */
9167 /* Clear this in case we're in the middle of a default argument. */
9170 /* Finish the function call operator
9171 - class_specifier
9172 + late_parsing_for_member
9173 + function_definition_after_declarator
9174 + ctor_initializer_opt_and_function_body */
9175 {
9177 tree body;
9179 tree compound_stmt;
9180 tree cap;
9182 /* Let the front end know that we are going to be defining this
9183 function. */
9185 NULL_TREE,
9194 /* Push the proxies for any explicit captures. */
9201 /* 5.1.1.4 of the standard says:
9202 If a lambda-expression does not include a trailing-return-type, it
9203 is as if the trailing-return-type denotes the following type:
9204 * if the compound-statement is of the form
9205 { return attribute-specifier [opt] expression ; }
9206 the type of the returned expression after lvalue-to-rvalue
9207 conversion (_conv.lval_ 4.1), array-to-pointer conversion
9208 (_conv.array_ 4.2), and function-to-pointer conversion
9209 (_conv.func_ 4.3);
9210 * otherwise, void. */
9212 /* In a lambda that has neither a lambda-return-type-clause
9213 nor a deducible form, errors should be reported for return statements
9214 in the body. Since we used void as the placeholder return type, parsing
9215 the body as usual will give such desired behavior. */
9219 {
9223 /* Parse tentatively in case there's more after the initial return
9224 statement. */
9235 {
9239 /* Will get error here if type not deduced yet. */
9243 }
9244 }
9247 {
9252 }
9256 out:
9260 /* Finish the function and generate code for it if necessary. */
9263 /* Only expand if the call op is not a template. */
9266 }
9271 else
9273 }
9275 /* Statements [gram.stmt.stmt] */
9277 /* Parse a statement.
9279 statement:
9280 labeled-statement
9281 expression-statement
9282 compound-statement
9283 selection-statement
9284 iteration-statement
9285 jump-statement
9286 declaration-statement
9287 try-block
9289 C++11:
9291 statement:
9292 labeled-statement
9293 attribute-specifier-seq (opt) expression-statement
9294 attribute-specifier-seq (opt) compound-statement
9295 attribute-specifier-seq (opt) selection-statement
9296 attribute-specifier-seq (opt) iteration-statement
9297 attribute-specifier-seq (opt) jump-statement
9298 declaration-statement
9299 attribute-specifier-seq (opt) try-block
9301 TM Extension:
9303 statement:
9304 atomic-statement
9306 IN_COMPOUND is true when the statement is nested inside a
9307 cp_parser_compound_statement; this matters for certain pragmas.
9309 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9310 is a (possibly labeled) if statement which is not enclosed in braces
9311 and has an else clause. This is used to implement -Wparentheses. */
9313 static void
9316 {
9321 restart:
9324 /* There is no statement yet. */
9330 /* In obj-c++, seeing '[[' might be the either the beginning of
9331 c++11 attributes, or a nested objc-message-expression. So
9332 let's parse the c++11 attributes tentatively. */
9336 {
9339 }
9341 /* Peek at the next token. */
9343 /* Remember the location of the first token in the statement. */
9345 /* If this is a keyword, then that will often determine what kind of
9346 statement we have. */
9348 {
9352 {
9355 /* Looks like a labeled-statement with a case label.
9356 Parse the label, and then use tail recursion to parse
9357 the statement. */
9379 /* Objective-C++ exception-handling constructs. */
9393 /* This must be a namespace alias definition. */
9406 /* It might be a keyword like `int' that can start a
9407 declaration-statement. */
9409 }
9410 }
9412 {
9413 /* If the next token is a `:', then we are looking at a
9414 labeled-statement. */
9417 {
9418 /* Looks like a labeled-statement with an ordinary label.
9419 Parse the label, and then use tail recursion to parse
9420 the statement. */
9424 }
9425 }
9426 /* Anything that starts with a `{' must be a compound-statement. */
9429 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
9430 a statement all its own. */
9432 {
9433 /* Only certain OpenMP pragmas are attached to statements, and thus
9434 are considered statements themselves. All others are not. In
9435 the context of a compound, accept the pragma as a "statement" and
9436 return so that we can check for a close brace. Otherwise we
9437 require a real statement and must go back and read one. */
9443 }
9445 {
9448 }
9450 /* Everything else must be a declaration-statement or an
9451 expression-statement. Try for the declaration-statement
9452 first, unless we are looking at a `;', in which case we know that
9453 we have an expression-statement. */
9455 {
9457 {
9459 {
9460 /* Attributes should be parsed as part of the the
9461 declaration, so let's un-parse them. */
9464 }
9467 /* Try to parse the declaration-statement. */
9469 /* If that worked, we're done. */
9472 }
9473 /* Look for an expression-statement instead. */
9475 }
9477 /* Set the line number for the statement. */
9481 /* Note that for now, we don't do anything with c++11 statements
9482 parsed at this level. */
9485 OPT_Wattributes,
9487 }
9489 /* Parse the label for a labeled-statement, i.e.
9491 identifier :
9492 case constant-expression :
9493 default :
9495 GNU Extension:
9496 case constant-expression ... constant-expression : statement
9498 When a label is parsed without errors, the label is added to the
9499 parse tree by the finish_* functions, so this function doesn't
9500 have to return the label. */
9502 static void
9504 {
9509 /* The next token should be an identifier. */
9513 {
9516 }
9520 {
9522 {
9526 /* Consume the `case' token. */
9528 /* Parse the constant-expression. */
9531 NULL);
9535 {
9536 /* Consume the `...' token. */
9538 expr_hi =
9541 NULL);
9542 /* We don't need to emit warnings here, as the common code
9543 will do this for us. */
9544 }
9545 else
9550 else
9553 expr);
9554 }
9558 /* Consume the `default' token. */
9563 else
9568 /* Anything else must be an ordinary label. */
9571 }
9573 /* Require the `:' token. */
9576 /* An ordinary label may optionally be followed by attributes.
9577 However, this is only permitted if the attributes are then
9578 followed by a semicolon. This is because, for backward
9579 compatibility, when parsing
9580 lab: __attribute__ ((unused)) int i;
9581 we want the attribute to attach to "i", not "lab". */
9584 {
9585 tree attrs;
9592 ;
9593 else
9595 }
9601 }
9603 /* Parse an expression-statement.
9605 expression-statement:
9606 expression [opt] ;
9608 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9609 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9610 indicates whether this expression-statement is part of an
9611 expression statement. */
9613 static tree
9615 {
9619 /* If the next token is a ';', then there is no expression
9620 statement. */
9622 {
9626 {
9629 }
9630 }
9632 /* Give a helpful message for "A<T>::type t;" and the like. */
9635 {
9642 {
9643 /* A::A a; */
9648 }
9649 }
9651 /* Consume the final `;'. */
9656 /* This is the final expression statement of a statement
9657 expression. */
9663 }
9665 /* Parse a compound-statement.
9667 compound-statement:
9668 { statement-seq [opt] }
9670 GNU extension:
9672 compound-statement:
9673 { label-declaration-seq [opt] statement-seq [opt] }
9675 label-declaration-seq:
9676 label-declaration
9677 label-declaration-seq label-declaration
9679 Returns a tree representing the statement. */
9681 static tree
9684 {
9685 tree compound_stmt;
9687 /* Consume the `{'. */
9694 /* Begin the compound-statement. */
9696 /* If the next keyword is `__label__' we have a label declaration. */
9699 /* Parse an (optional) statement-seq. */
9701 /* Finish the compound-statement. */
9703 /* Consume the `}'. */
9707 }
9709 /* Parse an (optional) statement-seq.
9711 statement-seq:
9712 statement
9713 statement-seq [opt] statement */
9715 static void
9717 {
9718 /* Scan statements until there aren't any more. */
9720 {
9723 /* If we are looking at a `}', then we have run out of
9724 statements; the same is true if we have reached the end
9725 of file, or have stumbled upon a stray '@end'. */
9732 /* If we are in a compound statement and find 'else' then
9733 something went wrong. */
9735 {
9738 else
9739 {
9742 }
9743 }
9745 /* Parse the statement. */
9747 }
9748 }
9750 /* Parse a selection-statement.
9752 selection-statement:
9753 if ( condition ) statement
9754 if ( condition ) statement else statement
9755 switch ( condition ) statement
9757 Returns the new IF_STMT or SWITCH_STMT.
9759 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9760 is a (possibly labeled) if statement which is not enclosed in
9761 braces and has an else clause. This is used to implement
9762 -Wparentheses. */
9764 static tree
9766 {
9773 /* Peek at the next token. */
9776 /* See what kind of keyword it is. */
9779 {
9782 {
9783 tree statement;
9784 tree condition;
9786 /* Look for the `('. */
9788 {
9791 }
9793 /* Begin the selection-statement. */
9796 else
9799 /* Parse the condition. */
9801 /* Look for the `)'. */
9807 {
9811 /* Add the condition. */
9814 /* Parse the then-clause. */
9818 {
9826 }
9827 else
9833 /* If the next token is `else', parse the else-clause. */
9835 RID_ELSE))
9836 {
9837 /* Consume the `else' keyword. */
9840 /* Parse the else-clause. */
9842 {
9843 location_t loc;
9850 }
9851 else
9856 /* If we are currently parsing a then-clause, then
9857 IF_P will not be NULL. We set it to true to
9858 indicate that this if statement has an else clause.
9859 This may trigger the Wparentheses warning below
9860 when we get back up to the parent if statement. */
9863 }
9864 else
9865 {
9866 /* This if statement does not have an else clause. If
9867 NESTED_IF is true, then the then-clause is an if
9868 statement which does have an else clause. We warn
9869 about the potential ambiguity. */
9872 "suggest explicit braces to avoid ambiguous"
9874 }
9876 /* Now we're all done with the if-statement. */
9878 }
9879 else
9880 {
9884 /* Add the condition. */
9887 /* Parse the body of the switch-statement. */
9896 /* Now we're all done with the switch-statement. */
9898 }
9901 }
9907 }
9908 }
9910 /* Parse a condition.
9912 condition:
9913 expression
9914 type-specifier-seq declarator = initializer-clause
9915 type-specifier-seq declarator braced-init-list
9917 GNU Extension:
9919 condition:
9920 type-specifier-seq declarator asm-specification [opt]
9921 attributes [opt] = assignment-expression
9923 Returns the expression that should be tested. */
9925 static tree
9927 {
9928 cp_decl_specifier_seq type_specifiers;
9932 /* Try the declaration first. */
9934 /* New types are not allowed in the type-specifier-seq for a
9935 condition. */
9937 parser->type_definition_forbidden_message
9939 /* Parse the type-specifier-seq. */
9941 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9944 /* Restore the saved message. */
9946 /* If all is well, we might be looking at a declaration. */
9948 {
9949 tree decl;
9950 tree asm_specification;
9951 tree attributes;
9955 /* Parse the declarator. */
9960 /* Parse the attributes. */
9962 /* Parse the asm-specification. */
9964 /* If the next token is not an `=' or '{', then we might still be
9965 looking at an expression. For example:
9967 if (A(a).x)
9969 looks like a decl-specifier-seq and a declarator -- but then
9970 there is no `=', so this is an expression. */
9975 /* If we did see an `=' or '{', then we are looking at a declaration
9976 for sure. */
9978 {
9979 tree pushed_scope;
9983 /* Create the declaration. */
9989 /* Parse the initializer. */
9991 {
9995 }
9996 else
9997 {
9998 /* Consume the `='. */
10001 }
10005 /* Process the initializer. */
10008 asm_specification,
10009 flags);
10015 }
10016 }
10017 /* If we didn't even get past the declarator successfully, we are
10018 definitely not looking at a declaration. */
10019 else
10022 /* Otherwise, we are looking at an expression. */
10024 }
10026 /* Parses a for-statement or range-for-statement until the closing ')',
10027 not included. */
10029 static tree
10031 {
10035 /* Begin the for-statement. */
10038 /* Parse the initialization. */
10043 else
10045 }
10047 static tree
10049 {
10050 /* Normal for loop */
10053 tree stmt;
10056 /* The for-init-statement has already been parsed in
10057 cp_parser_for_init_statement, so no work is needed here. */
10060 /* If there's a condition, process it. */
10064 {
10068 }
10070 /* Look for the `;'. */
10073 /* If there's an expression, process it. */
10079 }
10081 /* Tries to parse a range-based for-statement:
10083 range-based-for:
10084 decl-specifier-seq declarator : expression
10086 The decl-specifier-seq declarator and the `:' are already parsed by
10087 cp_parser_for_init_statement. If processing_template_decl it returns a
10088 newly created RANGE_FOR_STMT; if not, it is converted to a
10089 regular FOR_STMT. */
10091 static tree
10094 {
10098 {
10101 }
10102 else
10105 /* If in template, STMT is converted to a normal for-statement
10106 at instantiation. If not, it is done just ahead. */
10108 {
10116 /* do_auto_deduction doesn't mess with template init-lists. */
10119 }
10120 else
10121 {
10124 }
10126 }
10128 /* Subroutine of cp_convert_range_for: given the initializer expression,
10129 builds up the range temporary. */
10131 static tree
10133 {
10136 /* Find out the type deduced by the declaration
10137 `auto &&__range = range_expr'. */
10142 /* Create the __range variable. */
10149 }
10151 /* Used by cp_parser_range_for in template context: we aren't going to
10152 do a full conversion yet, but we still need to resolve auto in the
10153 type of the for-range-declaration if present. This is basically
10154 a shortcut version of cp_convert_range_for. */
10156 static void
10158 {
10161 {
10164 iter_type = (cp_parser_perform_range_for_lookup
10167 {
10169 iter_type);
10171 tf_warning_or_error);
10174 }
10175 }
10176 }
10178 /* Converts a range-based for-statement into a normal
10179 for-statement, as per the definition.
10181 for (RANGE_DECL : RANGE_EXPR)
10182 BLOCK
10184 should be equivalent to:
10186 {
10187 auto &&__range = RANGE_EXPR;
10188 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
10189 __begin != __end;
10190 ++__begin)
10191 {
10192 RANGE_DECL = *__begin;
10193 BLOCK
10194 }
10195 }
10197 If RANGE_EXPR is an array:
10198 BEGIN_EXPR = __range
10199 END_EXPR = __range + ARRAY_SIZE(__range)
10200 Else if RANGE_EXPR has a member 'begin' or 'end':
10201 BEGIN_EXPR = __range.begin()
10202 END_EXPR = __range.end()
10203 Else:
10204 BEGIN_EXPR = begin(__range)
10205 END_EXPR = end(__range);
10207 If __range has a member 'begin' but not 'end', or vice versa, we must
10208 still use the second alternative (it will surely fail, however).
10209 When calling begin()/end() in the third alternative we must use
10210 argument dependent lookup, but always considering 'std' as an associated
10211 namespace. */
10213 tree
10216 {
10222 /* If an error happened previously do nothing or else a lot of
10223 unhelpful errors would be issued. */
10225 else
10226 {
10227 tree range_temp;
10231 /* Can't bind a reference to an array of runtime bound. */
10233 else
10234 {
10239 LOOKUP_ONLYCONVERTING);
10241 }
10244 }
10246 /* The new for initialization statement. */
10254 LOOKUP_ONLYCONVERTING);
10263 LOOKUP_ONLYCONVERTING);
10267 /* The new for condition. */
10274 /* The new increment expression. */
10277 tf_warning_or_error);
10280 /* The declaration is initialized with *__begin inside the loop body. */
10283 tf_warning_or_error),
10285 LOOKUP_ONLYCONVERTING);
10288 }
10290 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
10291 We need to solve both at the same time because the method used
10292 depends on the existence of members begin or end.
10293 Returns the type deduced for the iterator expression. */
10295 static tree
10297 {
10299 {
10302 }
10305 {
10310 }
10312 {
10313 /* If RANGE is an array, we will use pointer arithmetic. */
10316 range,
10320 }
10321 else
10322 {
10323 /* If it is not an array, we must do a bit of magic. */
10333 tf_warning_or_error);
10336 tf_warning_or_error);
10339 {
10340 /* Use the member functions. */
10343 else
10349 else
10352 }
10353 else
10354 {
10355 /* Use global functions with ADL. */
10363 tf_warning_or_error);
10365 tf_warning_or_error);
10368 tf_warning_or_error);
10370 tf_warning_or_error);
10373 }
10375 /* Last common checks. */
10377 {
10378 /* If one of the expressions is an error do no more checks. */
10381 }
10384 /* Can happen, when, eg, in a template context, Koenig lookup
10385 can't resolve begin/end (c++/58503). */
10387 else
10388 {
10390 /* The unqualified type of the __begin and __end temporaries should
10391 be the same, as required by the multiple auto declaration. */
10397 }
10398 }
10399 }
10401 /* Helper function for cp_parser_perform_range_for_lookup.
10402 Builds a tree for RANGE.IDENTIFIER(). */
10404 static tree
10406 {
10419 tf_warning_or_error);
10422 }
10424 /* Parse an iteration-statement.
10426 iteration-statement:
10427 while ( condition ) statement
10428 do statement while ( expression ) ;
10429 for ( for-init-statement condition [opt] ; expression [opt] )
10430 statement
10432 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
10434 static tree
10436 {
10439 tree statement;
10442 /* Peek at the next token. */
10447 /* Remember whether or not we are already within an iteration
10448 statement. */
10451 /* See what kind of keyword it is. */
10454 {
10456 {
10457 tree condition;
10459 /* Begin the while-statement. */
10461 /* Look for the `('. */
10463 /* Parse the condition. */
10466 /* Look for the `)'. */
10468 /* Parse the dependent statement. */
10472 /* We're done with the while-statement. */
10474 }
10478 {
10479 tree expression;
10481 /* Begin the do-statement. */
10483 /* Parse the body of the do-statement. */
10488 /* Look for the `while' keyword. */
10490 /* Look for the `('. */
10492 /* Parse the expression. */
10494 /* We're done with the do-statement. */
10496 /* Look for the `)'. */
10498 /* Look for the `;'. */
10500 }
10504 {
10505 /* Look for the `('. */
10510 /* Look for the `)'. */
10513 /* Parse the body of the for-statement. */
10518 /* We're done with the for-statement. */
10520 }
10527 }
10530 }
10532 /* Parse a for-init-statement or the declarator of a range-based-for.
10533 Returns true if a range-based-for declaration is seen.
10535 for-init-statement:
10536 expression-statement
10537 simple-declaration */
10539 static bool
10541 {
10542 /* If the next token is a `;', then we have an empty
10543 expression-statement. Grammatically, this is also a
10544 simple-declaration, but an invalid one, because it does not
10545 declare anything. Therefore, if we did not handle this case
10546 specially, we would issue an error message about an invalid
10547 declaration. */
10549 {
10555 /* We're going to speculatively look for a declaration, falling back
10556 to an expression, if necessary. */
10558 /* Parse the declaration. */
10561 decl);
10564 {
10565 /* It is a range-for, consume the ':' */
10569 {
10571 "range-based %<for%> loops are not allowed "
10574 }
10575 }
10576 else
10577 /* The ';' is not consumed yet because we told
10578 cp_parser_simple_declaration not to. */
10583 /* If the tentative parse failed, then we shall need to look for an
10584 expression-statement. */
10585 }
10586 /* If we are here, it is an expression-statement. */
10589 }
10591 /* Parse a jump-statement.
10593 jump-statement:
10594 break ;
10595 continue ;
10596 return expression [opt] ;
10597 return braced-init-list ;
10598 goto identifier ;
10600 GNU extension:
10602 jump-statement:
10603 goto * expression ;
10605 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
10607 static tree
10609 {
10615 /* Peek at the next token. */
10620 /* See what kind of keyword it is. */
10623 {
10627 {
10645 }
10651 {
10658 /* Fall through. */
10668 }
10673 {
10674 tree expr;
10678 {
10681 }
10684 else
10685 /* If the next token is a `;', then there is no
10686 expression. */
10688 /* Build the return-statement. */
10690 /* Look for the final `;'. */
10692 }
10696 /* Create the goto-statement. */
10698 {
10699 /* Issue a warning about this use of a GNU extension. */
10701 /* Consume the '*' token. */
10703 /* Parse the dependent expression. */
10705 }
10706 else
10708 /* Look for the final `;'. */
10715 }
10718 }
10720 /* Parse a declaration-statement.
10722 declaration-statement:
10723 block-declaration */
10725 static void
10727 {
10730 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10733 /* Parse the block-declaration. */
10736 /* Free any declarators allocated. */
10738 }
10740 /* Some dependent statements (like `if (cond) statement'), are
10741 implicitly in their own scope. In other words, if the statement is
10742 a single statement (as opposed to a compound-statement), it is
10743 none-the-less treated as if it were enclosed in braces. Any
10744 declarations appearing in the dependent statement are out of scope
10745 after control passes that point. This function parses a statement,
10746 but ensures that is in its own scope, even if it is not a
10747 compound-statement.
10749 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10750 is a (possibly labeled) if statement which is not enclosed in
10751 braces and has an else clause. This is used to implement
10752 -Wparentheses.
10754 Returns the new statement. */
10756 static tree
10758 {
10759 tree statement;
10764 /* Mark if () ; with a special NOP_EXPR. */
10766 {
10770 }
10771 /* if a compound is opened, we simply parse the statement directly. */
10774 /* If the token is not a `{', then we must take special action. */
10775 else
10776 {
10777 /* Create a compound-statement. */
10779 /* Parse the dependent-statement. */
10781 /* Finish the dummy compound-statement. */
10783 }
10785 /* Return the statement. */
10787 }
10789 /* For some dependent statements (like `while (cond) statement'), we
10790 have already created a scope. Therefore, even if the dependent
10791 statement is a compound-statement, we do not want to create another
10792 scope. */
10794 static void
10796 {
10797 /* If the token is a `{', then we must take special action. */
10800 else
10801 {
10802 /* Avoid calling cp_parser_compound_statement, so that we
10803 don't create a new scope. Do everything else by hand. */
10805 /* If the next keyword is `__label__' we have a label declaration. */
10808 /* Parse an (optional) statement-seq. */
10811 }
10812 }
10814 /* Declarations [gram.dcl.dcl] */
10816 /* Parse an optional declaration-sequence.
10818 declaration-seq:
10819 declaration
10820 declaration-seq declaration */
10822 static void
10824 {
10826 {
10837 {
10838 /* A declaration consisting of a single semicolon is
10839 invalid. Allow it unless we're being pedantic. */
10844 }
10846 /* If we're entering or exiting a region that's implicitly
10847 extern "C", modify the lang context appropriately. */
10849 {
10852 }
10854 {
10857 }
10860 {
10861 /* A top-level declaration can consist solely of a #pragma.
10862 A nested declaration cannot, so this is done here and not
10863 in cp_parser_declaration. (A #pragma at block scope is
10864 handled in cp_parser_statement.) */
10867 }
10869 /* Parse the declaration itself. */
10871 }
10872 }
10874 /* Parse a declaration.
10876 declaration:
10877 block-declaration
10878 function-definition
10879 template-declaration
10880 explicit-instantiation
10881 explicit-specialization
10882 linkage-specification
10883 namespace-definition
10885 GNU extension:
10887 declaration:
10888 __extension__ declaration */
10890 static void
10892 {
10893 cp_token token1;
10894 cp_token token2;
10899 /* Check for the `__extension__' keyword. */
10901 {
10902 /* Parse the qualified declaration. */
10904 /* Restore the PEDANTIC flag. */
10908 }
10910 /* Try to figure out what kind of declaration is present. */
10915 else
10916 {
10919 }
10921 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10924 /* If the next token is `extern' and the following token is a string
10925 literal, then we have a linkage specification. */
10929 /* If the next token is `template', then we have either a template
10930 declaration, an explicit instantiation, or an explicit
10931 specialization. */
10933 {
10934 /* `template <>' indicates a template specialization. */
10938 /* `template <' indicates a template declaration. */
10941 /* Anything else must be an explicit instantiation. */
10942 else
10944 }
10945 /* If the next token is `export', then we have a template
10946 declaration. */
10949 /* If the next token is `extern', 'static' or 'inline' and the one
10950 after that is `template', we have a GNU extended explicit
10951 instantiation directive. */
10958 /* If the next token is `namespace', check for a named or unnamed
10959 namespace definition. */
10965 /* An unnamed namespace definition. */
10969 /* An inline (associated) namespace definition. */
10973 /* Objective-C++ declaration/definition. */
10980 /* We must have either a block declaration or a function
10981 definition. */
10982 else
10983 /* Try to parse a block-declaration, or a function-definition. */
10986 /* Free any declarators allocated. */
10988 }
10990 /* Parse a block-declaration.
10992 block-declaration:
10993 simple-declaration
10994 asm-definition
10995 namespace-alias-definition
10996 using-declaration
10997 using-directive
10999 GNU Extension:
11001 block-declaration:
11002 __extension__ block-declaration
11004 C++0x Extension:
11006 block-declaration:
11007 static_assert-declaration
11009 If STATEMENT_P is TRUE, then this block-declaration is occurring as
11010 part of a declaration-statement. */
11012 static void
11015 {
11019 /* Check for the `__extension__' keyword. */
11021 {
11022 /* Parse the qualified declaration. */
11024 /* Restore the PEDANTIC flag. */
11028 }
11030 /* Peek at the next token to figure out which kind of declaration is
11031 present. */
11034 /* If the next keyword is `asm', we have an asm-definition. */
11036 {
11040 }
11041 /* If the next keyword is `namespace', we have a
11042 namespace-alias-definition. */
11045 /* If the next keyword is `using', we have a
11046 using-declaration, a using-directive, or an alias-declaration. */
11048 {
11053 /* If the token after `using' is `namespace', then we have a
11054 using-directive. */
11058 /* If the second token after 'using' is '=', then we have an
11059 alias-declaration. */
11065 /* Otherwise, it's a using-declaration. */
11066 else
11069 }
11070 /* If the next keyword is `__label__' we have a misplaced label
11071 declaration. */
11073 {
11077 /* If the next token is now a `;', consume it. */
11080 }
11081 /* If the next token is `static_assert' we have a static assertion. */
11084 /* Anything else must be a simple-declaration. */
11085 else
11088 }
11090 /* Parse a simple-declaration.
11092 simple-declaration:
11093 decl-specifier-seq [opt] init-declarator-list [opt] ;
11095 init-declarator-list:
11096 init-declarator
11097 init-declarator-list , init-declarator
11099 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
11100 function-definition as a simple-declaration.
11102 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
11103 parsed declaration if it is an uninitialized single declarator not followed
11104 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
11105 if present, will not be consumed. */
11107 static void
11111 {
11112 cp_decl_specifier_seq decl_specifiers;
11119 /* Defer access checks until we know what is being declared; the
11120 checks for names appearing in the decl-specifier-seq should be
11121 done as if we were in the scope of the thing being declared. */
11124 /* Parse the decl-specifier-seq. We have to keep track of whether
11125 or not the decl-specifier-seq declares a named class or
11126 enumeration type, since that is the only case in which the
11127 init-declarator-list is allowed to be empty.
11129 [dcl.dcl]
11131 In a simple-declaration, the optional init-declarator-list can be
11132 omitted only when declaring a class or enumeration, that is when
11133 the decl-specifier-seq contains either a class-specifier, an
11134 elaborated-type-specifier, or an enum-specifier. */
11136 CP_PARSER_FLAGS_OPTIONAL,
11139 /* We no longer need to defer access checks. */
11142 /* In a block scope, a valid declaration must always have a
11143 decl-specifier-seq. By not trying to parse declarators, we can
11144 resolve the declaration/expression ambiguity more quickly. */
11147 {
11150 }
11152 /* If the next two tokens are both identifiers, the code is
11153 erroneous. The usual cause of this situation is code like:
11155 T t;
11157 where "T" should name a type -- but does not. */
11160 {
11161 /* If parsing tentatively, we should commit; we really are
11162 looking at a declaration. */
11164 /* Give up. */
11166 }
11168 /* If we have seen at least one decl-specifier, and the next token
11169 is not a parenthesis, then we must be looking at a declaration.
11170 (After "int (" we might be looking at a functional cast.) */
11177 /* Keep going until we hit the `;' at the end of the simple
11178 declaration. */
11181 CPP_SEMICOLON))
11182 {
11185 tree decl;
11188 {
11189 /* If we are processing next declarator, coma is expected */
11195 }
11196 else
11199 /* Parse the init-declarator. */
11202 function_definition_allowed_p,
11204 declares_class_or_enum,
11206 maybe_range_for_decl);
11207 /* If an error occurred while parsing tentatively, exit quickly.
11208 (That usually happens when in the body of a function; each
11209 statement is treated as a declaration-statement until proven
11210 otherwise.) */
11213 /* Handle function definitions specially. */
11215 {
11216 /* If the next token is a `,', then we are probably
11217 processing something like:
11219 void f() {}, *p;
11221 which is erroneous. */
11223 {
11226 "mixing"
11228 }
11229 /* Otherwise, we're done with the list of declarators. */
11230 else
11231 {
11234 }
11235 }
11238 /* The next token should be either a `,' or a `;'. */
11240 /* If it's a `,', there are more declarators to come. */
11243 /* If it's a `;', we are done. */
11246 /* Anything else is an error. */
11247 else
11248 {
11249 /* If we have already issued an error message we don't need
11250 to issue another one. */
11254 /* Skip tokens until we reach the end of the statement. */
11256 /* If the next token is now a `;', consume it. */
11260 }
11261 /* After the first time around, a function-definition is not
11262 allowed -- even if it was OK at first. For example:
11264 int i, f() {}
11266 is not valid. */
11268 }
11270 /* Issue an error message if no declarators are present, and the
11271 decl-specifier-seq does not itself declare a class or
11272 enumeration: [dcl.dcl]/3. */
11274 {
11276 {
11280 /* Ensure an error is issued anyway when finish_decltype_type,
11281 called via cp_parser_decl_specifier_seq, returns a class or
11282 an enumeration (c++/51786). */
11285 }
11286 /* Perform any deferred access checks. */
11288 }
11290 /* Consume the `;'. */
11294 done:
11296 }
11298 /* Parse a decl-specifier-seq.
11300 decl-specifier-seq:
11301 decl-specifier-seq [opt] decl-specifier
11302 decl-specifier attribute-specifier-seq [opt] (C++11)
11304 decl-specifier:
11305 storage-class-specifier
11306 type-specifier
11307 function-specifier
11308 friend
11309 typedef
11311 GNU Extension:
11313 decl-specifier:
11314 attributes
11316 Concepts Extension:
11318 decl-specifier:
11319 concept
11322 Set *DECL_SPECS to a representation of the decl-specifier-seq.
11324 The parser flags FLAGS is used to control type-specifier parsing.
11326 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
11327 flags:
11329 1: one of the decl-specifiers is an elaborated-type-specifier
11330 (i.e., a type declaration)
11331 2: one of the decl-specifiers is an enum-specifier or a
11332 class-specifier (i.e., a type definition)
11334 */
11336 static void
11338 cp_parser_flags flags,
11341 {
11345 cp_decl_spec ds;
11347 /* Clear DECL_SPECS. */
11350 /* Assume no class or enumeration type is declared. */
11353 /* Keep reading specifiers until there are no more to read. */
11355 {
11360 /* Peek at the next token. */
11363 /* Save the first token of the decl spec list for error
11364 reporting. */
11367 /* Handle attributes. */
11369 {
11370 /* Parse the attributes. */
11373 /* In a sequence of declaration specifiers, c++11 attributes
11374 appertain to the type that precede them. In that case
11375 [dcl.spec]/1 says:
11377 The attribute-specifier-seq affects the type only for
11378 the declaration it appears in, not other declarations
11379 involving the same type.
11381 But for now let's force the user to position the
11382 attribute either at the beginning of the declaration or
11383 after the declarator-id, which would clearly mean that it
11384 applies to the declarator. */
11386 {
11388 /* The c++11 attribute is at the beginning of the
11389 declaration. It appertains to the entity being
11391 else
11392 {
11394 {
11395 /* This is an attribute following a
11396 class-specifier. */
11401 }
11402 else
11403 {
11404 decl_specs->std_attributes
11406 attrs);
11409 }
11411 }
11412 }
11414 decl_specs->attributes
11416 attrs);
11420 }
11421 /* Assume we will find a decl-specifier keyword. */
11423 /* If the next token is an appropriate keyword, we can simply
11424 add it to the list. */
11426 {
11427 /* decl-specifier:
11428 friend
11429 constexpr */
11432 {
11435 }
11436 else
11437 {
11439 /* Consume the token. */
11441 }
11454 /* function-specifier:
11455 inline
11456 virtual
11457 explicit */
11464 /* decl-specifier:
11465 typedef */
11468 /* Consume the token. */
11470 /* A constructor declarator cannot appear in a typedef. */
11472 /* The "typedef" keyword can only occur in a declaration; we
11473 may as well commit at this point. */
11480 /* storage-class-specifier:
11481 auto
11482 register
11483 static
11484 extern
11485 mutable
11487 GNU Extension:
11488 thread */
11491 {
11492 /* Consume the token. */
11495 /* Complain about `auto' as a storage specifier, if
11496 we're complaining about C++0x compatibility. */
11500 /* Set the storage class anyway. */
11502 token);
11503 }
11504 else
11505 /* C++0x auto type-specifier. */
11513 /* Consume the token. */
11516 token);
11519 /* Consume the token. */
11525 /* We did not yet find a decl-specifier yet. */
11528 }
11538 /* Constructors are a special case. The `S' in `S()' is not a
11539 decl-specifier; it is the beginning of the declarator. */
11540 constructor_p
11541 = (!found_decl_spec
11542 && constructor_possible_p
11543 && (cp_parser_constructor_declarator_p
11546 /* If we don't have a DECL_SPEC yet, then we must be looking at
11547 a type-specifier. */
11549 {
11552 tree type_spec;
11554 type_spec
11556 decl_specs,
11562 /* If this type-specifier referenced a user-defined type
11563 (a typedef, class-name, etc.), then we can't allow any
11564 more such type-specifiers henceforth.
11566 [dcl.spec]
11568 The longest sequence of decl-specifiers that could
11569 possibly be a type name is taken as the
11570 decl-specifier-seq of a declaration. The sequence shall
11571 be self-consistent as described below.
11573 [dcl.type]
11575 As a general rule, at most one type-specifier is allowed
11576 in the complete decl-specifier-seq of a declaration. The
11577 only exceptions are the following:
11579 -- const or volatile can be combined with any other
11580 type-specifier.
11582 -- signed or unsigned can be combined with char, long,
11583 short, or int.
11585 -- ..
11587 Example:
11589 typedef char* Pc;
11590 void g (const int Pc);
11592 Here, Pc is *not* part of the decl-specifier seq; it's
11593 the declarator. Therefore, once we see a type-specifier
11594 (other than a cv-qualifier), we forbid any additional
11595 user-defined types. We *do* still allow things like `int
11596 int' to be considered a decl-specifier-seq, and issue the
11597 error message later. */
11600 /* A constructor declarator cannot follow a type-specifier. */
11602 {
11607 }
11608 }
11610 /* If we still do not have a DECL_SPEC, then there are no more
11611 decl-specifiers. */
11616 /* After we see one decl-specifier, further decl-specifiers are
11617 always optional. */
11619 }
11621 /* Don't allow a friend specifier with a class definition. */
11626 }
11628 /* Parse an (optional) storage-class-specifier.
11630 storage-class-specifier:
11631 auto
11632 register
11633 static
11634 extern
11635 mutable
11637 GNU Extension:
11639 storage-class-specifier:
11640 thread
11642 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
11644 static tree
11646 {
11648 {
11652 /* Fall through for C++98. */
11659 /* Consume the token. */
11664 }
11665 }
11667 /* Parse an (optional) function-specifier.
11669 function-specifier:
11670 inline
11671 virtual
11672 explicit
11674 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11675 Updates DECL_SPECS, if it is non-NULL. */
11677 static tree
11680 {
11683 {
11689 /* 14.5.2.3 [temp.mem]
11691 A member function template shall not be virtual. */
11694 else
11704 }
11706 /* Consume the token. */
11708 }
11710 /* Parse a linkage-specification.
11712 linkage-specification:
11713 extern string-literal { declaration-seq [opt] }
11714 extern string-literal declaration */
11716 static void
11718 {
11719 tree linkage;
11721 /* Look for the `extern' keyword. */
11724 /* Look for the string-literal. */
11727 /* Transform the literal into an identifier. If the literal is a
11728 wide-character string, or contains embedded NULs, then we can't
11729 handle it as the user wants. */
11732 {
11734 /* Assume C++ linkage. */
11736 }
11737 else
11740 /* We're now using the new linkage. */
11743 /* If the next token is a `{', then we're using the first
11744 production. */
11746 {
11749 /* Consume the `{' token. */
11751 /* Parse the declarations. */
11753 /* Look for the closing `}'. */
11755 }
11756 /* Otherwise, there's just one declaration. */
11757 else
11758 {
11761 saved_in_unbraced_linkage_specification_p
11765 parser->in_unbraced_linkage_specification_p
11767 }
11769 /* We're done with the linkage-specification. */
11771 }
11773 /* Parse a static_assert-declaration.
11775 static_assert-declaration:
11776 static_assert ( constant-expression , string-literal ) ;
11778 If MEMBER_P, this static_assert is a class member. */
11780 static void
11782 {
11783 tree condition;
11784 tree message;
11786 location_t saved_loc;
11789 /* Peek at the `static_assert' token so we can keep track of exactly
11790 where the static assertion started. */
11794 /* Look for the `static_assert' keyword. */
11796 RT_STATIC_ASSERT))
11799 /* We know we are in a static assertion; commit to any tentative
11800 parse. */
11804 /* Parse the `(' starting the static assertion condition. */
11807 /* Parse the constant-expression. Allow a non-constant expression
11808 here in order to give better diagnostics in finish_static_assert. */
11809 condition =
11814 /* Parse the separating `,'. */
11817 /* Parse the string-literal message. */
11822 /* A `)' completes the static assertion. */
11829 /* A semicolon terminates the declaration. */
11832 /* Complete the static assertion, which may mean either processing
11833 the static assert now or saving it for template instantiation. */
11835 }
11837 /* Parse the expression in decltype ( expression ). */
11839 static tree
11842 {
11844 tree expr;
11846 /* First, try parsing an id-expression. */
11857 {
11860 cp_id_kind idk;
11864 /* Lookup the name we got back from the id-expression. */
11875 {
11876 /* Complete lookup of the id-expression. */
11877 expr = (finish_id_expression
11890 /* We found an id-expression, but it was something that we
11891 should not have found. This is an error, not something
11892 we can recover from, so note that we found an
11893 id-expression and we'll recover as gracefully as
11894 possible. */
11896 }
11901 /* We have an id-expression. */
11903 }
11906 {
11907 /* Abort the id-expression parse. */
11910 /* Parsing tentatively, again. */
11913 /* Parse a class member access. */
11921 /* We have an id-expression. */
11923 }
11926 /* We have parsed the complete id-expression or member access. */
11928 else
11929 {
11930 /* Abort our attempt to parse an id-expression or member access
11931 expression. */
11934 /* Parse a full expression. */
11937 }
11940 }
11942 /* Parse a `decltype' type. Returns the type.
11944 simple-type-specifier:
11945 decltype ( expression )
11946 C++14 proposal:
11947 decltype ( auto ) */
11949 static tree
11951 {
11952 tree expr;
11961 {
11962 /* Already parsed. */
11965 }
11967 /* Look for the `decltype' token. */
11971 /* Parse the opening `('. */
11975 /* decltype (auto) */
11978 {
11985 }
11987 /* Types cannot be defined in a `decltype' expression. Save away the
11988 old message. */
11991 /* And create the new one. */
11992 parser->type_definition_forbidden_message
11995 /* The restrictions on constant-expressions do not apply inside
11996 decltype expressions. */
11997 saved_integral_constant_expression_p
11999 saved_non_integral_constant_expression_p
12003 /* Within a parenthesized expression, a `>' token is always
12004 the greater-than operator. */
12005 saved_greater_than_is_operator_p
12009 /* Do not actually evaluate the expression. */
12012 /* Do not warn about problems with the expression. */
12017 /* Go back to evaluating expressions. */
12021 /* The `>' token might be the end of a template-id or
12022 template-parameter-list now. */
12023 parser->greater_than_is_operator_p
12026 /* Restore the old message and the integral constant expression
12027 flags. */
12029 parser->integral_constant_expression_p
12031 parser->non_integral_constant_expression_p
12034 /* Parse to the closing `)'. */
12036 {
12040 }
12043 tf_warning_or_error);
12045 rewrite:
12046 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
12047 it again. */
12054 }
12056 /* Special member functions [gram.special] */
12058 /* Parse a conversion-function-id.
12060 conversion-function-id:
12061 operator conversion-type-id
12063 Returns an IDENTIFIER_NODE representing the operator. */
12065 static tree
12067 {
12068 tree type;
12069 tree saved_scope;
12070 tree saved_qualifying_scope;
12071 tree saved_object_scope;
12074 /* Look for the `operator' token. */
12077 /* When we parse the conversion-type-id, the current scope will be
12078 reset. However, we need that information in able to look up the
12079 conversion function later, so we save it here. */
12083 /* We must enter the scope of the class so that the names of
12084 entities declared within the class are available in the
12085 conversion-type-id. For example, consider:
12087 struct S {
12088 typedef int I;
12089 operator I();
12090 };
12092 S::operator I() { ... }
12094 In order to see that `I' is a type-name in the definition, we
12095 must be in the scope of `S'. */
12098 /* Parse the conversion-type-id. */
12100 /* Leave the scope of the class, if any. */
12103 /* Restore the saved scope. */
12107 /* If the TYPE is invalid, indicate failure. */
12111 }
12113 /* Parse a conversion-type-id:
12115 conversion-type-id:
12116 type-specifier-seq conversion-declarator [opt]
12118 Returns the TYPE specified. */
12120 static tree
12122 {
12123 tree attributes;
12124 cp_decl_specifier_seq type_specifiers;
12126 tree type_specified;
12129 /* Parse the attributes. */
12133 parser->type_definition_forbidden_message
12136 /* Parse the type-specifiers. */
12143 /* If that didn't work, stop. */
12146 /* Parse the conversion-declarator. */
12154 /* Don't give this error when parsing tentatively. This happens to
12155 work because we always parse this definitively once. */
12158 {
12160 {
12163 }
12167 }
12170 }
12172 /* Parse an (optional) conversion-declarator.
12174 conversion-declarator:
12175 ptr-operator conversion-declarator [opt]
12177 */
12181 {
12184 cp_cv_quals cv_quals;
12186 /* We don't know if there's a ptr-operator next, or not. */
12188 /* Try the ptr-operator. */
12191 /* If it worked, look for more conversion-declarators. */
12193 {
12196 /* Parse another optional declarator. */
12199 declarator = cp_parser_make_indirect_declarator
12203 }
12206 }
12208 /* Parse an (optional) ctor-initializer.
12210 ctor-initializer:
12211 : mem-initializer-list
12213 Returns TRUE iff the ctor-initializer was actually present. */
12215 static bool
12217 {
12218 /* If the next token is not a `:', then there is no
12219 ctor-initializer. */
12221 {
12222 /* Do default initialization of any bases and members. */
12227 }
12229 /* Consume the `:' token. */
12231 /* And the mem-initializer-list. */
12235 }
12237 /* Parse a mem-initializer-list.
12239 mem-initializer-list:
12240 mem-initializer ... [opt]
12241 mem-initializer ... [opt] , mem-initializer-list */
12243 static void
12245 {
12250 /* Let the semantic analysis code know that we are starting the
12251 mem-initializer-list. */
12256 /* Loop through the list. */
12258 {
12259 tree mem_initializer;
12262 /* Parse the mem-initializer. */
12264 /* If the next token is a `...', we're expanding member initializers. */
12266 {
12267 /* Consume the `...'. */
12270 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
12271 can be expanded but members cannot. */
12274 {
12279 }
12281 /* Construct the pack expansion type. */
12284 }
12287 {
12291 }
12292 /* Look for a target constructor. */
12296 {
12299 {
12303 }
12305 }
12306 /* Add it to the list, unless it was erroneous. */
12308 {
12311 }
12312 /* If the next token is not a `,', we're done. */
12315 /* Consume the `,' token. */
12317 }
12319 /* Perform semantic analysis. */
12322 }
12324 /* Parse a mem-initializer.
12326 mem-initializer:
12327 mem-initializer-id ( expression-list [opt] )
12328 mem-initializer-id braced-init-list
12330 GNU extension:
12332 mem-initializer:
12333 ( expression-list [opt] )
12335 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
12336 class) or FIELD_DECL (for a non-static data member) to initialize;
12337 the TREE_VALUE is the expression-list. An empty initialization
12338 list is represented by void_list_node. */
12340 static tree
12342 {
12343 tree mem_initializer_id;
12344 tree expression_list;
12345 tree member;
12348 /* Find out what is being initialized. */
12350 {
12354 }
12355 else
12356 {
12360 }
12366 {
12372 }
12373 else
12374 {
12384 }
12394 }
12396 /* Parse a mem-initializer-id.
12398 mem-initializer-id:
12399 :: [opt] nested-name-specifier [opt] class-name
12400 identifier
12402 Returns a TYPE indicating the class to be initializer for the first
12403 production. Returns an IDENTIFIER_NODE indicating the data member
12404 to be initialized for the second production. */
12406 static tree
12408 {
12412 tree id;
12416 /* `typename' is not allowed in this context ([temp.res]). */
12418 {
12420 "keyword %<typename%> not allowed in this context (a qualified "
12423 }
12424 /* Look for the optional `::' operator. */
12425 global_scope_p
12429 /* Look for the optional nested-name-specifier. The simplest way to
12430 implement:
12432 [temp.res]
12434 The keyword `typename' is not permitted in a base-specifier or
12435 mem-initializer; in these contexts a qualified name that
12436 depends on a template-parameter is implicitly assumed to be a
12437 type name.
12439 is to assume that we have seen the `typename' keyword at this
12440 point. */
12441 nested_name_specifier_p
12450 /* If there is a `::' operator or a nested-name-specifier, then we
12451 are definitely looking for a class-name. */
12456 typename_type,
12460 /* Otherwise, we could also be looking for an ordinary identifier. */
12462 /* Try a class-name. */
12466 none_type,
12470 /* If we found one, we're done. */
12473 /* Otherwise, look for an ordinary identifier. */
12475 }
12477 /* Overloading [gram.over] */
12479 /* Parse an operator-function-id.
12481 operator-function-id:
12482 operator operator
12484 Returns an IDENTIFIER_NODE for the operator which is a
12485 human-readable spelling of the identifier, e.g., `operator +'. */
12487 static tree
12489 {
12490 /* Look for the `operator' keyword. */
12493 /* And then the name of the operator itself. */
12495 }
12497 /* Return an identifier node for a user-defined literal operator.
12498 The suffix identifier is chained to the operator name identifier. */
12500 static tree
12502 {
12503 tree identifier;
12510 }
12512 /* Parse an operator.
12514 operator:
12515 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
12516 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
12517 || ++ -- , ->* -> () []
12519 GNU Extensions:
12521 operator:
12522 <? >? <?= >?=
12524 Returns an IDENTIFIER_NODE for the operator which is a
12525 human-readable spelling of the identifier, e.g., `operator +'. */
12527 static tree
12529 {
12534 /* Peek at the next token. */
12536 /* Figure out which operator we have. */
12538 {
12540 {
12543 /* The keyword should be either `new' or `delete'. */
12548 else
12551 /* Consume the `new' or `delete' token. */
12554 /* Peek at the next token. */
12556 /* If it's a `[' token then this is the array variant of the
12557 operator. */
12559 {
12560 /* Consume the `[' token. */
12562 /* Look for the `]' token. */
12566 }
12567 /* Otherwise, we have the non-array variant. */
12568 else
12572 }
12719 /* Consume the `('. */
12721 /* Look for the matching `)'. */
12726 /* Consume the `['. */
12728 /* Look for the matching `]'. */
12737 /* Fall through. */
12743 {
12746 }
12748 {
12751 }
12752 /* Consume the string. */
12754 /* Look for the suffix identifier. */
12757 {
12760 {
12763 }
12764 }
12766 {
12770 }
12771 else
12772 {
12775 }
12782 /* Fall through. */
12788 {
12791 }
12792 {
12795 {
12798 }
12800 /* Consume the user-defined string literal. */
12803 {
12806 }
12807 else
12809 }
12812 /* Anything else is an error. */
12814 }
12816 /* If we have selected an identifier, we need to consume the
12817 operator token. */
12820 /* Otherwise, no valid operator name was present. */
12821 else
12822 {
12825 }
12828 }
12830 /* Parse a template-declaration.
12832 template-declaration:
12833 export [opt] template < template-parameter-list > declaration
12835 If MEMBER_P is TRUE, this template-declaration occurs within a
12836 class-specifier.
12838 The grammar rule given by the standard isn't correct. What
12839 is really meant is:
12841 template-declaration:
12842 export [opt] template-parameter-list-seq
12843 decl-specifier-seq [opt] init-declarator [opt] ;
12844 export [opt] template-parameter-list-seq
12845 function-definition
12847 template-parameter-list-seq:
12848 template-parameter-list-seq [opt]
12849 template < template-parameter-list >
12851 Concept Extensions:
12853 template-parameter-list-seq:
12854 template < template-parameter-list > template-requirement [opt]
12856 template-requirement:
12857 requires logical-or-expression
12858 */
12860 static void
12862 {
12863 /* Check for `export'. */
12865 {
12866 /* Consume the `export' token. */
12868 /* Warn that we do not support `export'. */
12870 }
12873 }
12875 /* Parse a template-parameter-list.
12877 template-parameter-list:
12878 template-parameter
12879 template-parameter-list , template-parameter
12881 Returns a TREE_LIST. Each node represents a template parameter.
12882 The nodes are connected via their TREE_CHAINs. */
12884 static tree
12886 {
12891 /* The loop below parses the template parms. We first need to know
12892 the total number of template parms to be able to compute proper
12893 canonical types of each dependent type. So after the loop, when
12894 we know the total number of template parms,
12895 end_template_parm_list computes the proper canonical types and
12896 fixes up the dependent types accordingly. */
12898 {
12899 tree parameter;
12902 location_t parm_loc;
12904 /* Parse the template-parameter. */
12909 /* Add it to the list. */
12912 parm_loc,
12913 parameter,
12914 is_non_type,
12915 is_parameter_pack);
12916 else
12917 {
12920 }
12922 /* If the next token is not a `,', we're done. */
12925 /* Otherwise, consume the `,' token. */
12927 }
12930 }
12932 // Returns a constrained parameter if PARM denotes a constrained
12933 // template parameter.
12936 {
12944 }
12946 // Finish parsing/processing a template type parameter.
12949 {
12951 }
12953 // Finish parsing/processing a template template parameter by borrowing
12954 // the template parameter list from the prototype parameter.
12955 static tree
12957 {
12960 // FIXME: This should probably be copied, and we may need to adjust
12961 // the template parameter depths.
12969 }
12971 // Create a new non-type template parameter from the given PARM declarator.
12972 static tree
12974 {
12979 }
12981 // Build a constrained template parameter based on the PARMDECL
12982 // declarator. The type of PARMDECL is the constrained type, which
12983 // refers to the prototype template parameter that ultimately
12984 // specifies the type of the declared parameter.
12985 static tree
12989 {
12995 // Remember if the user declared this as a parameter pack and
12996 // erase that flag on the annotation. Template packs are dealt
12997 // with separately.
13002 // Is the prototype a parameter pack? If so, but the declaration
13003 // does not include "...", then emit an error.
13008 // The prototype is a template parameter pack, then the resulting
13009 // parameter also needs to be a pack.
13013 tree parm;
13018 else
13019 {
13022 }
13024 // Finish the parameter decl and create a node attaching the
13025 // default argument and constraint.
13029 }
13032 /* Parse a template-parameter.
13034 template-parameter:
13035 type-parameter
13036 parameter-declaration
13038 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
13039 the parameter. The TREE_PURPOSE is the default value, if any.
13040 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
13041 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
13042 set to true iff this parameter is a parameter pack. */
13044 static tree
13047 {
13051 tree parm;
13053 /* Assume it is a type parameter or a template parameter. */
13055 /* Assume it not a parameter pack. */
13057 /* Peek at the next token. */
13059 /* If it is `class' or `template', we have a type-parameter. */
13062 /* If it is `class' or `typename' we do not know yet whether it is a
13063 type parameter or a non-type parameter. Consider:
13065 template <typename T, typename T::X X> ...
13067 or:
13069 template <class C, class D*> ...
13071 Here, the first parameter is a type parameter, and the second is
13072 a non-type parameter. We can tell by looking at the token after
13073 the identifier -- if it is a `,', `=', or `>' then we have a type
13074 parameter. */
13076 {
13077 /* Peek at the token after `class' or `typename'. */
13079 /* If it's an ellipsis, we have a template type parameter
13080 pack. */
13083 /* If it's an identifier, skip it. */
13086 /* Now, see if the token looks like the end of a template
13087 parameter. */
13092 }
13094 /* Otherwise, it is a non-type parameter.
13096 [temp.param]
13098 When parsing a default template-argument for a non-type
13099 template-parameter, the first non-nested `>' is taken as the end
13100 of the template parameter-list rather than a greater-than
13101 operator. */
13102 parameter_declarator
13106 // The parameter may have been constrained.
13109 is_non_type,
13110 is_parameter_pack);
13112 // Now we're sure that the parameter is a non-type parameter.
13116 /* If the parameter declaration is marked as a parameter pack, set
13117 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
13118 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
13119 grokdeclarator. */
13123 {
13126 }
13130 {
13131 /* Can happen in some cases of erroneous input (c++/34892). */
13133 /* Consume the `...' for better error recovery. */
13135 }
13136 /* If the next token is an ellipsis, and we don't already have it
13137 marked as a parameter pack, then we have a parameter pack (that
13138 has no declarator). */
13141 && (declarator_can_be_parameter_pack
13143 {
13144 /* Consume the `...'. */
13149 }
13150 /* We might end up with a pack expansion as the type of the non-type
13151 template parameter, in which case this is a non-type template
13152 parameter pack. */
13156 {
13160 }
13163 {
13164 /* Parameter packs cannot have default arguments. However, a
13165 user may try to do so, so we'll parse them and give an
13166 appropriate diagnostic here. */
13170 /* Find the name of the parameter pack. */
13179 else
13183 /* Parse the default argument, but throw away the result. */
13185 }
13195 }
13197 /* Parse a type-parameter.
13199 type-parameter:
13200 class identifier [opt]
13201 class identifier [opt] = type-id
13202 typename identifier [opt]
13203 typename identifier [opt] = type-id
13204 template < template-parameter-list > class identifier [opt]
13205 template < template-parameter-list > class identifier [opt]
13206 = id-expression
13208 GNU Extension (variadic templates):
13210 type-parameter:
13211 class ... identifier [opt]
13212 typename ... identifier [opt]
13214 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
13215 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
13216 the declaration of the parameter.
13218 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
13220 static tree
13222 {
13224 tree parameter;
13226 /* Look for a keyword to tell us what kind of parameter this is. */
13232 {
13235 {
13236 tree identifier;
13237 tree default_argument;
13239 /* If the next token is an ellipsis, we have a template
13240 argument pack. */
13242 {
13243 /* Consume the `...' token. */
13248 }
13250 /* If the next token is an identifier, then it names the
13251 parameter. */
13254 else
13257 /* Create the parameter. */
13260 /* If the next token is an `=', we have a default argument. */
13262 {
13263 /* Consume the `=' token. */
13265 /* Parse the default-argument. */
13269 /* Template parameter packs cannot have default
13270 arguments. */
13272 {
13275 "template parameter pack %qD cannot have a "
13277 else
13279 "template parameter packs cannot have "
13282 }
13284 }
13285 else
13288 /* Create the combined representation of the parameter and the
13289 default argument. */
13291 }
13295 {
13296 tree identifier;
13297 tree default_argument;
13299 // Save the current requirements before parsing the
13300 // template parameter list.
13303 /* Look for the `<'. */
13305 /* Parse the template-parameter-list. */
13307 /* Look for the `>'. */
13310 // If template requirements are present, parse them.
13312 {
13318 // Attach the constraints to the parameter list.
13321 }
13323 /* Look for the `class' keyword. */
13325 /* If the next token is an ellipsis, we have a template
13326 argument pack. */
13328 {
13329 /* Consume the `...' token. */
13334 }
13335 /* If the next token is an `=', then there is a
13336 default-argument. If the next token is a `>', we are at
13337 the end of the parameter-list. If the next token is a `,',
13338 then we are at the end of this parameter. */
13342 {
13344 /* Treat invalid names as if the parameter were nameless. */
13347 }
13348 else
13351 /* Create the template parameter. */
13353 identifier);
13355 // Restore the saved constraints.
13358 /* If the next token is an `=', then there is a
13359 default-argument. */
13361 {
13364 /* Consume the `='. */
13366 /* Parse the id-expression. */
13368 /* save token before parsing the id-expression, for error
13369 reporting */
13371 default_argument
13379 /* If the id-expression was a template-id that refers to
13380 a template-class, we already have the declaration here,
13381 so no further lookup is needed. */
13382 ;
13383 else
13384 /* Look up the name. */
13385 default_argument
13387 none_type,
13393 /* See if the default argument is valid. */
13394 default_argument
13397 /* Template parameter packs cannot have default
13398 arguments. */
13400 {
13403 "template parameter pack %qD cannot "
13405 identifier);
13406 else
13410 }
13412 }
13413 else
13416 /* Create the combined representation of the parameter and the
13417 default argument. */
13419 }
13425 }
13428 }
13430 /* Parse a template-id.
13432 template-id:
13433 template-name < template-argument-list [opt] >
13435 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
13436 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
13437 returned. Otherwise, if the template-name names a function, or set
13438 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
13439 names a class, returns a TYPE_DECL for the specialization.
13441 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
13442 uninstantiated templates. */
13444 static tree
13450 {
13452 tree templ;
13453 tree arguments;
13454 tree template_id;
13461 /* If the next token corresponds to a template-id, there is no need
13462 to reparse it. */
13465 {
13468 /* Get the stored value. */
13470 /* Perform any access checks that were deferred. */
13473 {
13478 tf_warning_or_error);
13479 }
13480 /* Return the stored value. */
13482 }
13484 /* Avoid performing name lookup if there is no possibility of
13485 finding a template-id. */
13488 && !cp_parser_nth_token_starts_template_argument_list_p
13490 {
13493 }
13495 /* Remember where the template-id starts. */
13501 /* Parse the template-name. */
13504 check_dependency_p,
13505 is_declaration,
13506 tag_type,
13509 {
13512 }
13514 /* If we find the sequence `[:' after a template-name, it's probably
13515 a digraph-typo for `< ::'. Substitute the tokens and check if we can
13516 parse correctly the argument list. */
13523 {
13525 /* Change `:' into `::'. */
13527 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
13528 CPP_LESS. */
13531 /* Parse the arguments. */
13534 {
13535 /* If we couldn't parse an argument list, then we revert our changes
13536 and return simply an error. Maybe this is not a template-id
13537 after all. */
13542 }
13543 /* Otherwise, emit an error about the invalid digraph, but continue
13544 parsing because we got our argument list. */
13547 {
13550 "%<<:%> is an alternate spelling for %<[%>."
13553 {
13555 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
13558 }
13559 }
13560 }
13561 else
13562 {
13563 /* Look for the `<' that starts the template-argument-list. */
13565 {
13568 }
13569 /* Parse the arguments. */
13571 }
13573 /* Build a representation of the specialization. */
13576 TEMPLATE_ID_EXPR,
13580 {
13582 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
13583 template (rather than some instantiation thereof) only if
13584 is not nested within some other construct. For example, in
13585 "template <typename T> void f(T) { A<T>::", A<T> is just an
13586 instantiation of A. */
13589 CPP_SCOPE));
13590 template_id
13592 }
13593 else
13594 {
13595 /* If it's not a class-template or a template-template, it should be
13596 a function-template. */
13602 }
13604 /* If parsing tentatively, replace the sequence of tokens that makes
13605 up the template-id with a CPP_TEMPLATE_ID token. That way,
13606 should we re-parse the token stream, we will not have to repeat
13607 the effort required to do the parse, nor will we issue duplicate
13608 error messages about problems during instantiation of the
13609 template. */
13611 {
13614 /* Reset the contents of the START_OF_ID token. */
13616 /* Retrieve any deferred checks. Do not pop this access checks yet
13617 so the memory will not be reclaimed during token replacing below. */
13623 /* Purge all subsequent tokens. */
13626 /* ??? Can we actually assume that, if template_id ==
13627 error_mark_node, we will have issued a diagnostic to the
13628 user, as opposed to simply marking the tentative parse as
13629 failed? */
13632 }
13636 }
13638 /* Parse a template-name.
13640 template-name:
13641 identifier
13643 The standard should actually say:
13645 template-name:
13646 identifier
13647 operator-function-id
13649 A defect report has been filed about this issue.
13651 A conversion-function-id cannot be a template name because they cannot
13652 be part of a template-id. In fact, looking at this code:
13654 a.operator K<int>()
13656 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
13657 It is impossible to call a templated conversion-function-id with an
13658 explicit argument list, since the only allowed template parameter is
13659 the type to which it is converting.
13661 If TEMPLATE_KEYWORD_P is true, then we have just seen the
13662 `template' keyword, in a construction like:
13664 T::template f<3>()
13666 In that case `f' is taken to be a template-name, even though there
13667 is no way of knowing for sure.
13669 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
13670 name refers to a set of overloaded functions, at least one of which
13671 is a template, or an IDENTIFIER_NODE with the name of the template,
13672 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
13673 names are looked up inside uninstantiated templates. */
13675 static tree
13682 {
13683 tree identifier;
13684 tree decl;
13685 tree fns;
13688 /* If the next token is `operator', then we have either an
13689 operator-function-id or a conversion-function-id. */
13691 {
13692 /* We don't know whether we're looking at an
13693 operator-function-id or a conversion-function-id. */
13695 /* Try an operator-function-id. */
13697 /* If that didn't work, try a conversion-function-id. */
13699 {
13702 }
13703 }
13704 /* Look for the identifier. */
13705 else
13708 /* If we didn't find an identifier, we don't have a template-id. */
13712 /* If the name immediately followed the `template' keyword, then it
13713 is a template-name. However, if the next token is not `<', then
13714 we do not treat it as a template-name, since it is not being used
13715 as part of a template-id. This enables us to handle constructs
13716 like:
13718 template <typename T> struct S { S(); };
13719 template <typename T> S<T>::S();
13721 correctly. We would treat `S' as a template -- if it were `S<T>'
13722 -- but we do not if there is no `<'. */
13726 {
13727 /* In a declaration, in a dependent context, we pretend that the
13728 "template" keyword was present in order to improve error
13729 recovery. For example, given:
13731 template <typename T> void f(T::X<int>);
13733 we want to treat "X<int>" as a template-id. */
13735 && !template_keyword_p
13737 && check_dependency_p
13739 /* Do not do this for dtors (or ctors), since they never
13740 need the template keyword before their name. */
13742 {
13745 /* Explain what went wrong. */
13747 identifier);
13750 /* If parsing tentatively, find the location of the "<" token. */
13753 /* Parse the template arguments so that we can issue error
13754 messages about them. */
13757 /* Skip tokens until we find a good place from which to
13758 continue parsing. */
13763 /* If parsing tentatively, permanently remove the
13764 template argument list. That will prevent duplicate
13765 error messages from being issued about the missing
13766 "template" keyword. */
13772 }
13774 /* If the "template" keyword is present, then there is generally
13775 no point in doing name-lookup, so we just return IDENTIFIER.
13776 But, if the qualifying scope is non-dependent then we can
13777 (and must) do name-lookup normally. */
13783 }
13785 /* Look up the name. */
13787 tag_type,
13790 check_dependency_p,
13794 /* If DECL is a template, then the name was a template-name. */
13796 ;
13797 else
13798 {
13801 /* The standard does not explicitly indicate whether a name that
13802 names a set of overloaded declarations, some of which are
13803 templates, is a template-name. However, such a name should
13804 be a template-name; otherwise, there is no way to form a
13805 template-id for the overloaded templates. */
13813 {
13814 /* The name does not name a template. */
13817 }
13818 }
13820 /* If DECL is dependent, and refers to a function, then just return
13821 its name; we will look it up again during template instantiation. */
13823 {
13827 }
13830 }
13832 /* Parse a template-argument-list.
13834 template-argument-list:
13835 template-argument ... [opt]
13836 template-argument-list , template-argument ... [opt]
13838 Returns a TREE_VEC containing the arguments. */
13840 static tree
13842 {
13847 tree vec;
13854 /* Even if the template-id appears in an integral
13855 constant-expression, the contents of the argument list do
13856 not. */
13862 /* Parse the arguments. */
13863 do
13864 {
13865 tree argument;
13868 /* Consume the comma. */
13871 /* Parse the template-argument. */
13874 /* If the next token is an ellipsis, we're expanding a template
13875 argument pack. */
13877 {
13879 {
13883 }
13884 /* Consume the `...' token. */
13887 /* Make the argument into a TYPE_PACK_EXPANSION or
13888 EXPR_PACK_EXPANSION. */
13890 }
13893 {
13897 {
13900 }
13901 else
13903 }
13905 }
13918 #ifdef ENABLE_CHECKING
13920 #endif
13922 }
13924 /* Parse a template-argument.
13926 template-argument:
13927 assignment-expression
13928 type-id
13929 id-expression
13931 The representation is that of an assignment-expression, type-id, or
13932 id-expression -- except that the qualified id-expression is
13933 evaluated, so that the value returned is either a DECL or an
13934 OVERLOAD.
13936 Although the standard says "assignment-expression", it forbids
13937 throw-expressions or assignments in the template argument.
13938 Therefore, we use "conditional-expression" instead. */
13940 static tree
13942 {
13943 tree argument;
13949 cp_id_kind idk;
13951 /* There's really no way to know what we're looking at, so we just
13952 try each alternative in order.
13954 [temp.arg]
13956 In a template-argument, an ambiguity between a type-id and an
13957 expression is resolved to a type-id, regardless of the form of
13958 the corresponding template-parameter.
13960 Therefore, we try a type-id first. */
13963 /* If there was no error parsing the type-id but the next token is a
13964 '>>', our behavior depends on which dialect of C++ we're
13965 parsing. In C++98, we probably found a typo for '> >'. But there
13966 are type-id which are also valid expressions. For instance:
13968 struct X { int operator >> (int); };
13969 template <int V> struct Foo {};
13970 Foo<X () >> 5> r;
13972 Here 'X()' is a valid type-id of a function type, but the user just
13973 wanted to write the expression "X() >> 5". Thus, we remember that we
13974 found a valid type-id, but we still try to parse the argument as an
13975 expression to see what happens.
13977 In C++0x, the '>>' will be considered two separate '>'
13978 tokens. */
13982 {
13985 }
13986 else
13987 {
13988 /* If the next token isn't a `,' or a `>', then this argument wasn't
13989 really finished. This means that the argument is not a valid
13990 type-id. */
13993 /* If that worked, we're done. */
13996 }
13997 /* We're still not sure what the argument will be. */
13999 /* Try a template. */
14007 /* If the next token isn't a `,' or a `>', then this argument wasn't
14008 really finished. */
14012 {
14013 /* Figure out what is being referred to. If the id-expression
14014 was for a class template specialization, then we will have a
14015 TYPE_DECL at this point. There is no need to do name lookup
14016 at this point in that case. */
14019 none_type,
14028 }
14031 /* It must be a non-type argument. There permitted cases are given
14032 in [temp.arg.nontype]:
14034 -- an integral constant-expression of integral or enumeration
14035 type; or
14037 -- the name of a non-type template-parameter; or
14039 -- the name of an object or function with external linkage...
14041 -- the address of an object or function with external linkage...
14043 -- a pointer to member... */
14044 /* Look for a non-type template parameter. */
14046 {
14058 }
14060 /* If the next token is "&", the argument must be the address of an
14061 object or function with external linkage. */
14064 {
14067 }
14068 /* See if we might have an id-expression. */
14075 {
14078 address_p,
14085 else
14086 {
14087 tree probe;
14090 {
14093 }
14095 /* If we're in a template, we represent a qualified-id referring
14096 to a static data member as a SCOPE_REF even if the scope isn't
14097 dependent so that we can check access control later. */
14102 {
14103 /* A variable without external linkage might still be a
14104 valid constant-expression, so no error is issued here
14105 if the external-linkage check fails. */
14108 }
14110 /* All overloaded functions are allowed; if the external
14111 linkage test does not pass, an error will be issued
14112 later. */
14113 ;
14117 /* A pointer-to-member. */
14118 ;
14120 ;
14121 else
14125 {
14128 tf_warning_or_error);
14130 }
14131 }
14132 }
14133 /* If the argument started with "&", there are no other valid
14134 alternatives at this point. */
14136 {
14139 }
14141 /* If the argument wasn't successfully parsed as a type-id followed
14142 by '>>', the argument can only be a constant expression now.
14143 Otherwise, we try parsing the constant-expression tentatively,
14144 because the argument could really be a type-id. */
14156 /* We did our best to parse the argument as a non type-id, but that
14157 was the only alternative that matched (albeit with a '>' after
14158 it). We can assume it's just a typo from the user, and a
14159 diagnostic will then be issued. */
14161 }
14163 /* Parse an explicit-instantiation.
14165 explicit-instantiation:
14166 template declaration
14168 Although the standard says `declaration', what it really means is:
14170 explicit-instantiation:
14171 template decl-specifier-seq [opt] declarator [opt] ;
14173 Things like `template int S<int>::i = 5, int S<double>::j;' are not
14174 supposed to be allowed. A defect report has been filed about this
14175 issue.
14177 GNU Extension:
14179 explicit-instantiation:
14180 storage-class-specifier template
14181 decl-specifier-seq [opt] declarator [opt] ;
14182 function-specifier template
14183 decl-specifier-seq [opt] declarator [opt] ; */
14185 static void
14187 {
14189 cp_decl_specifier_seq decl_specifiers;
14194 /* Look for an (optional) storage-class-specifier or
14195 function-specifier. */
14197 {
14198 extension_specifier
14201 extension_specifier
14204 }
14206 /* Look for the `template' keyword. */
14208 /* Let the front end know that we are processing an explicit
14209 instantiation. */
14211 /* [temp.explicit] says that we are supposed to ignore access
14212 control while processing explicit instantiation directives. */
14214 /* Parse a decl-specifier-seq. */
14216 CP_PARSER_FLAGS_OPTIONAL,
14219 /* If there was exactly one decl-specifier, and it declared a class,
14220 and there's no declarator, then we have an explicit type
14221 instantiation. */
14223 {
14224 tree type;
14228 /* Turn access control back on for names used during
14229 template instantiation. */
14234 }
14235 else
14236 {
14238 tree decl;
14240 /* Parse the declarator. */
14241 declarator
14251 {
14254 "explicit instantiation shall not use"
14258 "explicit instantiation shall not use"
14263 /* Turn access control back on for names used during
14264 template instantiation. */
14266 /* Do the explicit instantiation. */
14268 }
14269 else
14270 {
14272 /* Skip the body of the explicit instantiation. */
14274 }
14275 }
14276 /* We're done with the instantiation. */
14282 }
14284 /* Parse an explicit-specialization.
14286 explicit-specialization:
14287 template < > declaration
14289 Although the standard says `declaration', what it really means is:
14291 explicit-specialization:
14292 template <> decl-specifier [opt] init-declarator [opt] ;
14293 template <> function-definition
14294 template <> explicit-specialization
14295 template <> template-declaration */
14297 static void
14299 {
14303 /* Look for the `template' keyword. */
14305 /* Look for the `<'. */
14307 /* Look for the `>'. */
14309 /* We have processed another parameter list. */
14311 /* [temp]
14313 A template ... explicit specialization ... shall not have C
14314 linkage. */
14316 {
14318 /* Give it C++ linkage to avoid confusing other parts of the
14319 front end. */
14322 }
14323 else
14325 /* Let the front end know that we are beginning a specialization. */
14327 {
14330 }
14332 /* If the next keyword is `template', we need to figure out whether
14333 or not we're looking a template-declaration. */
14335 {
14340 else
14342 }
14343 else
14344 /* Parse the dependent declaration. */
14350 /* We're done with the specialization. */
14352 /* For the erroneous case of a template with C linkage, we pushed an
14353 implicit C++ linkage scope; exit that scope now. */
14356 /* We're done with this parameter list. */
14358 }
14360 /* Parse a type-specifier.
14362 type-specifier:
14363 simple-type-specifier
14364 class-specifier
14365 enum-specifier
14366 elaborated-type-specifier
14367 cv-qualifier
14369 GNU Extension:
14371 type-specifier:
14372 __complex__
14374 Returns a representation of the type-specifier. For a
14375 class-specifier, enum-specifier, or elaborated-type-specifier, a
14376 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
14378 The parser flags FLAGS is used to control type-specifier parsing.
14380 If IS_DECLARATION is TRUE, then this type-specifier is appearing
14381 in a decl-specifier-seq.
14383 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
14384 class-specifier, enum-specifier, or elaborated-type-specifier, then
14385 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
14386 if a type is declared; 2 if it is defined. Otherwise, it is set to
14387 zero.
14389 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
14390 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
14391 is set to FALSE. */
14393 static tree
14395 cp_parser_flags flags,
14400 {
14406 /* Assume this type-specifier does not declare a new type. */
14409 /* And that it does not specify a cv-qualifier. */
14412 /* Peek at the next token. */
14415 /* If we're looking at a keyword, we can use that to guide the
14416 production we choose. */
14419 {
14424 /* Look for the enum-specifier. */
14426 /* If that worked, we're done. */
14428 {
14433 type_spec,
14434 token,
14437 }
14438 else
14441 /* Any of these indicate either a class-specifier, or an
14442 elaborated-type-specifier. */
14449 /* Parse tentatively so that we can back up if we don't find a
14450 class-specifier. */
14452 /* Look for the class-specifier. */
14455 /* If that worked, we're done. */
14457 {
14462 type_spec,
14463 token,
14466 }
14468 /* Fall through. */
14469 elaborated_type_specifier:
14470 /* We're declaring (not defining) a class or enum. */
14474 /* Fall through. */
14476 /* Look for an elaborated-type-specifier. */
14477 type_spec
14478 = (cp_parser_elaborated_type_specifier
14481 is_declaration));
14484 type_spec,
14485 token,
14508 /* The `__complex__' keyword is a GNU extension. */
14514 }
14516 /* Handle simple keywords. */
14518 {
14520 {
14523 }
14525 }
14527 /* If we do not already have a type-specifier, assume we are looking
14528 at a simple-type-specifier. */
14530 decl_specs,
14531 flags);
14533 /* If we didn't find a type-specifier, and a type-specifier was not
14534 optional in this context, issue an error message. */
14536 {
14539 }
14542 }
14544 /* Parse a simple-type-specifier.
14546 simple-type-specifier:
14547 :: [opt] nested-name-specifier [opt] type-name
14548 :: [opt] nested-name-specifier template template-id
14549 char
14550 wchar_t
14551 bool
14552 short
14553 int
14554 long
14555 signed
14556 unsigned
14557 float
14558 double
14559 void
14561 C++0x Extension:
14563 simple-type-specifier:
14564 auto
14565 decltype ( expression )
14566 char16_t
14567 char32_t
14568 __underlying_type ( type-id )
14570 GNU Extension:
14572 simple-type-specifier:
14573 __int128
14574 __typeof__ unary-expression
14575 __typeof__ ( type-id )
14576 __typeof__ ( type-id ) { initializer-list , [opt] }
14578 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
14579 appropriately updated. */
14581 static tree
14584 cp_parser_flags flags)
14585 {
14589 /* Peek at the next token. */
14592 /* If we're looking at a keyword, things are easy. */
14594 {
14654 {
14658 {
14661 "use of %<auto%> in lambda parameter declaration "
14662 "only available with "
14664 }
14667 "use of %<auto%> in parameter declaration "
14668 "only available with "
14670 else
14672 "ISO C++ forbids use of %<auto%> in parameter "
14674 }
14675 else
14680 /* Since DR 743, decltype can either be a simple-type-specifier by
14681 itself or begin a nested-name-specifier. Parsing it will replace
14682 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
14683 handling below decide what to do. */
14689 /* Consume the `typeof' token. */
14691 /* Parse the operand to `typeof'. */
14693 /* If it is not already a TYPE, take its type. */
14699 token,
14708 token,
14718 token,
14723 }
14725 /* If token is an already-parsed decltype not followed by ::,
14726 it's a simple-type-specifier. */
14729 {
14733 token,
14737 }
14739 /* If the type-specifier was for a built-in type, we're done. */
14741 {
14742 /* Record the type. */
14749 type,
14750 token,
14755 /* Consume the token. */
14758 /* There is no valid C++ program where a non-template type is
14759 followed by a "<". That usually indicates that the user thought
14760 that the type was a template. */
14765 }
14767 /* The type-specifier must be a user-defined type. */
14769 {
14773 /* Don't gobble tokens or issue error messages if this is an
14774 optional type-specifier. */
14778 /* Look for the optional `::' operator. */
14779 global_p
14783 /* Look for the nested-name specifier. */
14784 qualified_p
14792 /* If we have seen a nested-name-specifier, and the next token
14793 is `template', then we are using the template-id production. */
14796 {
14797 /* Look for the template-id. */
14801 none_type,
14803 /* If the template-id did not name a type, we are out of
14804 luck. */
14806 {
14809 }
14810 }
14811 /* Otherwise, look for a type-name. */
14812 else
14814 /* Keep track of all name-lookups performed in class scopes. */
14816 && !global_p
14817 && !qualified_p
14821 /* If it didn't work out, we don't have a TYPE. */
14827 token,
14829 }
14831 /* If we didn't get a type-name, issue an error message. */
14833 {
14836 }
14839 {
14840 /* See if TYPE is an Objective-C type, and if so, parse and
14841 accept any protocol references following it. Do this before
14842 the cp_parser_check_for_invalid_template_id() call, because
14843 Objective-C types can be followed by '<...>' which would
14844 enclose protocol names rather than template arguments, and so
14845 everything is fine. */
14848 {
14852 /* Clobber the "unqualified" type previously entered into
14853 DECL_SPECS with the new, improved protocol-qualified version. */
14858 }
14860 /* There is no valid C++ program where a non-template type is
14861 followed by a "<". That usually indicates that the user
14862 thought that the type was a template. */
14864 none_type,
14866 }
14869 }
14871 /* Parse a type-name.
14873 type-name:
14874 class-name
14875 enum-name
14876 typedef-name
14877 simple-template-id [in c++0x]
14879 enum-name:
14880 identifier
14882 typedef-name:
14883 identifier
14885 Concepts:
14887 type-name:
14888 concept-name
14890 concept-name:
14891 identifier
14893 Returns a TYPE_DECL for the type. */
14895 static tree
14897 {
14898 tree type_decl;
14900 /* We can't know yet whether it is a class-name or not. */
14902 /* Try a class-name. */
14906 none_type,
14910 /* If it's not a class-name, keep looking. */
14912 {
14914 /* It must be a typedef-name or an enum-name. */
14918 /* It is either a simple-template-id representing an
14919 instantiation of an alias template... */
14923 none_type,
14925 /* Note that this must be an instantiation of an alias template
14926 because [temp.names]/6 says:
14928 A template-id that names an alias template specialization
14929 is a type-name.
14931 Whereas [temp.names]/7 says:
14933 A simple-template-id that names a class template
14934 specialization is a class-name. */
14939 else
14943 /* ... Or a typedef-name or an enum-name. */
14945 }
14948 }
14950 // If the result is a TYPE_DECL, its DECL_NAME is the name of the
14951 // concept (without arguments), its TREE_TYPE refers to the type of the
14952 // first template parameter of concept definition (the prototype parameter),
14953 // its DECL_INITIAL is the declaration of the prototype parameter, and
14954 // its DECL_SIZE_UNIT is the constraining concept declaration.
14955 //
14956 // TODO: A variable template may refer to a concept. The concept-name
14957 // could introduce a constrained placeholder type in the terse template
14958 // syntax.
14959 //
14960 // FIXME: This shouldn't be here... or the synthesize_implicit_template_parm
14961 // should be more accessible.
14962 static tree
14964 {
14967 // Try to build a call expression that evaluates the concept. This
14968 // can fail if the overload set refers only to non-templates.
14973 // Resolve the constraint check to deduce the declared parameter.
14978 // Get function and argument from the resolved check expression. If
14979 // the argument was a pack expansion, then get the first element
14980 // of that pack.
14986 // Get the protyping parameter bound to the placeholder.
14989 // How we process the constrained declaration depends on the scope.
14990 // In template scope, we return a "description" that will later be
14991 // transformed into a real template parameter by process_template_parm.
14995 // If we can synthesize a template paramter, we should do that here.
14997 {
15001 }
15004 }
15007 /* Parse a non-class type-name, that is, either an enum-name, a typedef-name,
15008 or a concept-name.
15010 enum-name:
15011 identifier
15013 typedef-name:
15014 identifier
15016 concept-name:
15017 identifier
15019 Returns a TYPE_DECL for the type. */
15021 static tree
15023 {
15024 tree type_decl;
15025 tree identifier;
15032 /* Look up the type-name. */
15035 // If we found an overload set, then it may refer to a concept-name.
15036 //
15037 // TODO: The name could also refer to a variable template or an
15038 // introduction (if followed by '{').
15040 {
15041 // Determine whether the overload refers to a concept.
15044 }
15047 {
15051 {
15052 /* We have found a type introduced by a using
15053 declaration at class scope that refers to a dependent
15054 type.
15056 using typename :: [opt] nested-name-specifier unqualified-id ;
15057 */
15063 }
15064 }
15068 {
15069 /* See if this is an Objective-C type. */
15074 }
15076 /* Issue an error if we did not find a type-name. */
15078 /* In Objective-C, we have the complication that class names are
15079 normally type names and start declarations (eg, the
15080 "NSObject" in "NSObject *object;"), but can be used in an
15081 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
15082 is an expression. So, a classname followed by a dot is not a
15083 valid type-name. */
15086 {
15091 }
15092 /* Remember that the name was used in the definition of the
15093 current class so that we can check later to see if the
15094 meaning would have been different after the class was
15095 entirely defined. */
15101 }
15103 /* Parse an elaborated-type-specifier. Note that the grammar given
15104 here incorporates the resolution to DR68.
15106 elaborated-type-specifier:
15107 class-key :: [opt] nested-name-specifier [opt] identifier
15108 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
15109 enum-key :: [opt] nested-name-specifier [opt] identifier
15110 typename :: [opt] nested-name-specifier identifier
15111 typename :: [opt] nested-name-specifier template [opt]
15112 template-id
15114 GNU extension:
15116 elaborated-type-specifier:
15117 class-key attributes :: [opt] nested-name-specifier [opt] identifier
15118 class-key attributes :: [opt] nested-name-specifier [opt]
15119 template [opt] template-id
15120 enum attributes :: [opt] nested-name-specifier [opt] identifier
15122 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
15123 declared `friend'. If IS_DECLARATION is TRUE, then this
15124 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
15125 something is being declared.
15127 Returns the TYPE specified. */
15129 static tree
15133 {
15135 tree identifier;
15138 tree globalscope;
15141 /* See if we're looking at the `enum' keyword. */
15143 {
15144 /* Consume the `enum' token. */
15146 /* Remember that it's an enumeration type. */
15148 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
15149 enums) is used here. */
15152 {
15156 /* Consume the `struct' or `class' and parse it anyway. */
15158 }
15159 /* Parse the attributes. */
15161 }
15162 /* Or, it might be `typename'. */
15164 RID_TYPENAME))
15165 {
15166 /* Consume the `typename' token. */
15168 /* Remember that it's a `typename' type. */
15170 }
15171 /* Otherwise it must be a class-key. */
15172 else
15173 {
15177 /* Parse the attributes. */
15179 }
15181 /* Look for the `::' operator. */
15184 /* Look for the nested-name-specifier. */
15186 {
15191 is_declaration))
15193 }
15194 else
15195 /* Even though `typename' is not present, the proposed resolution
15196 to Core Issue 180 says that in `class A<T>::B', `B' should be
15197 considered a type-name, even if `A<T>' is dependent. */
15202 is_declaration);
15203 /* For everything but enumeration types, consider a template-id.
15204 For an enumeration type, consider only a plain identifier. */
15206 {
15208 tree decl;
15210 /* Allow the `template' keyword. */
15212 /* If we didn't see `template', we don't know if there's a
15213 template-id or not. */
15216 /* Parse the template-id. */
15220 tag_type,
15221 is_declaration);
15222 /* If we didn't find a template-id, look for an ordinary
15223 identifier. */
15225 ;
15226 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
15227 in effect, then we must assume that, upon instantiation, the
15228 template will correspond to a class. */
15232 typename_type,
15234 /* If the `typename' keyword is in effect and DECL is not a type
15235 decl, then type is non existent. */
15237 ;
15243 }
15246 {
15251 {
15254 }
15256 /* For a `typename', we needn't call xref_tag. */
15260 identifier,
15262 /* Look up a qualified name in the usual way. */
15264 {
15265 tree decl;
15266 tree ambiguous_decls;
15269 tag_type,
15276 /* If the lookup was ambiguous, an error will already have been
15277 issued. */
15281 /* If we are parsing friend declaration, DECL may be a
15282 TEMPLATE_DECL tree node here. However, we need to check
15283 whether this TEMPLATE_DECL results in valid code. Consider
15284 the following example:
15286 namespace N {
15287 template <class T> class C {};
15288 }
15289 class X {
15290 template <class T> friend class N::C; // #1, valid code
15291 };
15292 template <class T> class Y {
15293 friend class N::C; // #2, invalid code
15294 };
15296 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
15297 name lookup of `N::C'. We see that friend declaration must
15298 be template for the code to be valid. Note that
15299 processing_template_decl does not work here since it is
15300 always 1 for the above two cases. */
15302 decl = (cp_parser_maybe_treat_template_as_class
15307 {
15310 identifier,
15313 }
15316 {
15320 allow_template);
15324 }
15326 /* Forward declarations of nested types, such as
15328 class C1::C2;
15329 class C1::C2::C3;
15331 are invalid unless all components preceding the final '::'
15332 are complete. If all enclosing types are complete, these
15333 declarations become merely pointless.
15335 Invalid forward declarations of nested types are errors
15336 caught elsewhere in parsing. Those that are pointless arrive
15337 here. */
15344 }
15345 else
15346 {
15347 /* An elaborated-type-specifier sometimes introduces a new type and
15348 sometimes names an existing type. Normally, the rule is that it
15349 introduces a new type only if there is not an existing type of
15350 the same name already in scope. For example, given:
15352 struct S {};
15353 void f() { struct S s; }
15355 the `struct S' in the body of `f' is the same `struct S' as in
15356 the global scope; the existing definition is used. However, if
15357 there were no global declaration, this would introduce a new
15358 local class named `S'.
15360 An exception to this rule applies to the following code:
15362 namespace N { struct S; }
15364 Here, the elaborated-type-specifier names a new type
15365 unconditionally; even if there is already an `S' in the
15366 containing scope this declaration names a new type.
15367 This exception only applies if the elaborated-type-specifier
15368 forms the complete declaration:
15370 [class.name]
15372 A declaration consisting solely of `class-key identifier ;' is
15373 either a redeclaration of the name in the current scope or a
15374 forward declaration of the identifier as a class name. It
15375 introduces the name into the current scope.
15377 We are in this situation precisely when the next token is a `;'.
15379 An exception to the exception is that a `friend' declaration does
15380 *not* name a new type; i.e., given:
15382 struct S { friend struct T; };
15384 `T' is not a new type in the scope of `S'.
15386 Also, `new struct S' or `sizeof (struct S)' never results in the
15387 definition of a new type; a new type can only be declared in a
15388 declaration context. */
15390 tag_scope ts;
15394 /* Friends have special name lookup rules. */
15398 CPP_SEMICOLON))
15399 /* This is a `class-key identifier ;' */
15401 else
15404 template_p =
15408 /* An unqualified name was used to reference this type, so
15409 there were no qualifying templates. */
15416 }
15417 }
15422 /* Allow attributes on forward declarations of classes. */
15424 {
15434 else
15437 }
15440 {
15441 /* Indicate whether this class was declared as a `class' or as a
15442 `struct'. */
15446 }
15448 /* A "<" cannot follow an elaborated type specifier. If that
15449 happens, the user was probably trying to form a template-id. */
15454 }
15456 /* Parse an enum-specifier.
15458 enum-specifier:
15459 enum-head { enumerator-list [opt] }
15460 enum-head { enumerator-list , } [C++0x]
15462 enum-head:
15463 enum-key identifier [opt] enum-base [opt]
15464 enum-key nested-name-specifier identifier enum-base [opt]
15466 enum-key:
15467 enum
15468 enum class [C++0x]
15469 enum struct [C++0x]
15471 enum-base: [C++0x]
15472 : type-specifier-seq
15474 opaque-enum-specifier:
15475 enum-key identifier enum-base [opt] ;
15477 GNU Extensions:
15478 enum-key attributes[opt] identifier [opt] enum-base [opt]
15479 { enumerator-list [opt] }attributes[opt]
15480 enum-key attributes[opt] identifier [opt] enum-base [opt]
15481 { enumerator-list, }attributes[opt] [C++0x]
15483 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
15484 if the token stream isn't an enum-specifier after all. */
15486 static tree
15488 {
15489 tree identifier;
15491 tree prev_scope;
15493 tree attributes;
15506 /* Parse tentatively so that we can back up if we don't find a
15507 enum-specifier. */
15510 /* Caller guarantees that the current token is 'enum', an identifier
15511 possibly follows, and the token after that is an opening brace.
15512 If we don't have an identifier, fabricate an anonymous name for
15513 the enumeration being defined. */
15516 /* Parse the "class" or "struct", which indicates a scoped
15517 enumeration type in C++0x. */
15520 {
15524 /* Consume the `struct' or `class' token. */
15528 }
15532 /* Clear the qualification. */
15537 /* Figure out in what scope the declaration is being placed. */
15543 nested_name_specifier
15551 {
15552 tree name;
15556 enum_type,
15561 input_location);
15563 {
15566 {
15567 /* Are template enums allowed in ISO? */
15571 /* ignore a typename reference, for it will be solved by name
15572 in start_enum. */
15574 }
15575 }
15578 else
15581 }
15582 else
15583 {
15586 else
15587 {
15593 }
15594 }
15597 /* Check for the `:' that denotes a specified underlying type in C++0x.
15598 Note that a ':' could also indicate a bitfield width, however. */
15600 {
15601 cp_decl_specifier_seq type_specifiers;
15603 /* Consume the `:'. */
15606 /* Parse the type-specifier-seq. */
15611 /* At this point this is surely not elaborated type specifier. */
15620 /* If that didn't work, stop. */
15622 {
15627 }
15628 }
15630 /* Look for the `{' but don't consume it yet. */
15632 {
15634 {
15637 {
15640 }
15641 }
15642 /* An opaque-enum-specifier must have a ';' here. */
15645 {
15648 {
15651 }
15652 }
15653 }
15659 {
15661 {
15665 }
15667 {
15669 }
15670 }
15672 /* Issue an error message if type-definitions are forbidden here. */
15675 else
15676 /* Create the new type. We do this before consuming the opening
15677 brace so the enum will be recorded as being on the line of its
15678 tag (or the 'enum' keyword, if there is no tag). */
15682 /* If the next token is not '{' it is an opaque-enum-specifier or an
15683 elaborated-type-specifier. */
15685 {
15689 {
15690 /* The following catches invalid code such as:
15691 enum class S<int>::E { A, B, C }; */
15698 /* If that scope does not contain the scope in which the
15699 class was originally declared, the program is invalid. */
15701 {
15704 "declaration of %qD in namespace %qD which does not "
15707 else
15712 }
15713 }
15718 /* Consume the opening brace. */
15725 {
15729 }
15730 else
15731 {
15736 }
15740 /* If the next token is not '}', then there are some enumerators. */
15742 {
15746 }
15747 else
15750 /* Consume the final '}'. */
15756 }
15757 else
15758 {
15759 /* If a ';' follows, then it is an opaque-enum-specifier
15760 and additional restrictions apply. */
15762 {
15769 }
15770 }
15772 /* Look for trailing attributes to apply to this enumeration, and
15773 apply them if appropriate. */
15775 {
15779 trailing_attr,
15781 }
15783 /* Finish up the enumeration. */
15785 {
15790 }
15793 {
15795 {
15798 }
15800 {
15802 }
15803 }
15804 out:
15807 }
15809 /* Parse an enumerator-list. The enumerators all have the indicated
15810 TYPE.
15812 enumerator-list:
15813 enumerator-definition
15814 enumerator-list , enumerator-definition */
15816 static void
15818 {
15820 {
15821 /* Parse an enumerator-definition. */
15824 /* If the next token is not a ',', we've reached the end of
15825 the list. */
15828 /* Otherwise, consume the `,' and keep going. */
15830 /* If the next token is a `}', there is a trailing comma. */
15832 {
15837 }
15838 }
15839 }
15841 /* Parse an enumerator-definition. The enumerator has the indicated
15842 TYPE.
15844 enumerator-definition:
15845 enumerator
15846 enumerator = constant-expression
15848 enumerator:
15849 identifier */
15851 static void
15853 {
15854 tree identifier;
15855 tree value;
15856 location_t loc;
15858 /* Save the input location because we are interested in the location
15859 of the identifier and not the location of the explicit value. */
15862 /* Look for the identifier. */
15867 /* If the next token is an '=', then there is an explicit value. */
15869 {
15870 /* Consume the `=' token. */
15872 /* Parse the value. */
15875 NULL);
15876 }
15877 else
15880 /* If we are processing a template, make sure the initializer of the
15881 enumerator doesn't contain any bare template parameter pack. */
15885 /* integral_constant_value will pull out this expression, so make sure
15886 it's folded as appropriate. */
15889 /* Create the enumerator. */
15891 }
15893 /* Parse a namespace-name.
15895 namespace-name:
15896 original-namespace-name
15897 namespace-alias
15899 Returns the NAMESPACE_DECL for the namespace. */
15901 static tree
15903 {
15904 tree identifier;
15905 tree namespace_decl;
15909 /* Get the name of the namespace. */
15914 /* Look up the identifier in the currently active scope. Look only
15915 for namespaces, due to:
15917 [basic.lookup.udir]
15919 When looking up a namespace-name in a using-directive or alias
15920 definition, only namespace names are considered.
15922 And:
15924 [basic.lookup.qual]
15926 During the lookup of a name preceding the :: scope resolution
15927 operator, object, function, and enumerator names are ignored.
15929 (Note that cp_parser_qualifying_entity only calls this
15930 function if the token after the name is the scope resolution
15931 operator.) */
15933 none_type,
15939 /* If it's not a namespace, issue an error. */
15942 {
15947 }
15950 }
15952 /* Parse a namespace-definition.
15954 namespace-definition:
15955 named-namespace-definition
15956 unnamed-namespace-definition
15958 named-namespace-definition:
15959 original-namespace-definition
15960 extension-namespace-definition
15962 original-namespace-definition:
15963 namespace identifier { namespace-body }
15965 extension-namespace-definition:
15966 namespace original-namespace-name { namespace-body }
15968 unnamed-namespace-definition:
15969 namespace { namespace-body } */
15971 static void
15973 {
15980 {
15984 }
15985 else
15988 /* Look for the `namespace' keyword. */
15991 /* Get the name of the namespace. We do not attempt to distinguish
15992 between an original-namespace-definition and an
15993 extension-namespace-definition at this point. The semantic
15994 analysis routines are responsible for that. */
15997 else
16000 /* Parse any specified attributes. */
16003 /* Look for the `{' to start the namespace. */
16005 /* Start the namespace. */
16008 /* "inline namespace" is equivalent to a stub namespace definition
16009 followed by a strong using directive. */
16011 {
16013 /* Set up namespace association. */
16017 /* Import the contents of the inline namespace. */
16021 }
16025 /* Parse the body of the namespace. */
16031 /* Finish the namespace. */
16033 /* Look for the final `}'. */
16035 }
16037 /* Parse a namespace-body.
16039 namespace-body:
16040 declaration-seq [opt] */
16042 static void
16044 {
16046 }
16048 /* Parse a namespace-alias-definition.
16050 namespace-alias-definition:
16051 namespace identifier = qualified-namespace-specifier ; */
16053 static void
16055 {
16056 tree identifier;
16057 tree namespace_specifier;
16061 /* Look for the `namespace' keyword. */
16063 /* Look for the identifier. */
16067 /* Look for the `=' token. */
16070 {
16072 /* Skip the definition. */
16077 }
16079 /* Look for the qualified-namespace-specifier. */
16080 namespace_specifier
16082 /* Look for the `;' token. */
16085 /* Register the alias in the symbol table. */
16087 }
16089 /* Parse a qualified-namespace-specifier.
16091 qualified-namespace-specifier:
16092 :: [opt] nested-name-specifier [opt] namespace-name
16094 Returns a NAMESPACE_DECL corresponding to the specified
16095 namespace. */
16097 static tree
16099 {
16100 /* Look for the optional `::'. */
16104 /* Look for the optional nested-name-specifier. */
16112 }
16114 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
16115 access declaration.
16117 using-declaration:
16118 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
16119 using :: unqualified-id ;
16121 access-declaration:
16122 qualified-id ;
16124 */
16126 static bool
16129 {
16133 tree decl;
16134 tree identifier;
16135 tree qscope;
16140 {
16143 }
16144 else
16145 {
16146 /* Look for the `using' keyword. */
16149 /* Peek at the next token. */
16151 /* See if it's `typename'. */
16153 {
16154 /* Remember that we've seen it. */
16156 /* Consume the `typename' token. */
16158 }
16159 }
16161 /* Look for the optional global scope qualification. */
16162 global_scope_p
16167 /* If we saw `typename', or didn't see `::', then there must be a
16168 nested-name-specifier present. */
16174 /* Otherwise, we could be in either of the two productions. In that
16175 case, treat the nested-name-specifier as optional. */
16176 else
16186 /* Something has already gone wrong; there's no need to parse
16187 further. Since an error has occurred, the return value of
16188 cp_parser_parse_definitely will be false, as required. */
16192 /* Parse the unqualified-id. */
16200 {
16205 }
16207 /* The function we call to handle a using-declaration is different
16208 depending on what scope we are in. */
16210 ;
16213 /* [namespace.udecl]
16215 A using declaration shall not name a template-id. */
16218 else
16219 {
16221 {
16222 /* Create the USING_DECL. */
16230 else
16231 /* Add it to the list of members in this class. */
16233 }
16234 else
16235 {
16237 identifier,
16247 else
16249 }
16250 }
16252 /* Look for the final `;'. */
16257 "access declarations are deprecated "
16258 "in favour of using-declarations; "
16262 }
16264 /* Parse an alias-declaration.
16266 alias-declaration:
16267 using identifier attribute-specifier-seq [opt] = type-id */
16269 static tree
16271 {
16273 location_t id_location;
16275 cp_decl_specifier_seq decl_specs;
16279 /* Look for the `using' keyword. */
16280 cp_token *using_token
16302 /* Now we are going to parse the type-id of the declaration. */
16304 /*
16305 [dcl.type]/3 says:
16307 "A type-specifier-seq shall not define a class or enumeration
16308 unless it appears in the type-id of an alias-declaration (7.1.3) that
16309 is not the declaration of a template-declaration."
16311 In other words, if we currently are in an alias template, the
16312 type-id should not define a type.
16314 So let's set parser->type_definition_forbidden_message in that
16315 case; cp_parser_check_type_definition (called by
16316 cp_parser_class_specifier) will then emit an error if a type is
16317 defined in the type-id. */
16319 {
16323 }
16327 /* Restore the error message if need be. */
16332 {
16335 }
16340 {
16343 }
16345 /* A typedef-name can also be introduced by an alias-declaration. The
16346 identifier following the using keyword becomes a typedef-name. It has
16347 the same semantics as if it were introduced by the typedef
16348 specifier. In particular, it does not define a new type and it shall
16349 not appear in the type-id. */
16354 {
16357 ds_attribute,
16358 attrs_token);
16359 }
16361 ds_typedef,
16362 using_token);
16364 ds_alias,
16365 using_token);
16374 else
16385 /* If decl is a template, return its TEMPLATE_DECL so that it gets
16386 added into the symbol table; otherwise, return the TYPE_DECL. */
16390 {
16394 }
16397 }
16399 /* Parse a using-directive.
16401 using-directive:
16402 using namespace :: [opt] nested-name-specifier [opt]
16403 namespace-name ; */
16405 static void
16407 {
16408 tree namespace_decl;
16409 tree attribs;
16411 /* Look for the `using' keyword. */
16413 /* And the `namespace' keyword. */
16415 /* Look for the optional `::' operator. */
16417 /* And the optional nested-name-specifier. */
16423 /* Get the namespace being used. */
16425 /* And any specified attributes. */
16427 /* Update the symbol table. */
16429 /* Look for the final `;'. */
16431 }
16433 /* Parse an asm-definition.
16435 asm-definition:
16436 asm ( string-literal ) ;
16438 GNU Extension:
16440 asm-definition:
16441 asm volatile [opt] ( string-literal ) ;
16442 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
16443 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16444 : asm-operand-list [opt] ) ;
16445 asm volatile [opt] ( string-literal : asm-operand-list [opt]
16446 : asm-operand-list [opt]
16447 : asm-clobber-list [opt] ) ;
16448 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
16449 : asm-clobber-list [opt]
16450 : asm-goto-list ) ; */
16452 static void
16454 {
16455 tree string;
16460 tree asm_stmt;
16468 /* Look for the `asm' keyword. */
16470 /* See if the next token is `volatile'. */
16473 {
16474 /* Remember that we saw the `volatile' keyword. */
16476 /* Consume the token. */
16478 }
16482 {
16483 /* Remember that we saw the `goto' keyword. */
16485 /* Consume the token. */
16487 }
16488 /* Look for the opening `('. */
16491 /* Look for the string. */
16494 {
16498 }
16500 /* If we're allowing GNU extensions, check for the extended assembly
16501 syntax. Unfortunately, the `:' tokens need not be separated by
16502 a space in C, and so, for compatibility, we tolerate that here
16503 too. Doing that means that we have to treat the `::' operator as
16504 two `:' tokens. */
16509 {
16514 /* The extended syntax was used. */
16517 /* Look for outputs. */
16519 {
16520 /* Consume the `:'. */
16522 /* Parse the output-operands. */
16524 CPP_COLON)
16526 CPP_SCOPE)
16528 CPP_CLOSE_PAREN)
16534 }
16535 /* If the next token is `::', there are no outputs, and the
16536 next token is the beginning of the inputs. */
16538 /* The inputs are coming next. */
16541 /* Look for inputs. */
16544 {
16545 /* Consume the `:' or `::'. */
16547 /* Parse the output-operands. */
16549 CPP_COLON)
16551 CPP_SCOPE)
16553 CPP_CLOSE_PAREN))
16558 }
16560 /* The clobbers are coming next. */
16563 /* Look for clobbers. */
16566 {
16568 /* Consume the `:' or `::'. */
16570 /* Parse the clobbers. */
16572 CPP_COLON)
16574 CPP_CLOSE_PAREN))
16576 }
16579 /* The labels are coming next. */
16582 /* Look for labels. */
16585 {
16587 /* Consume the `:' or `::'. */
16589 /* Parse the labels. */
16591 }
16595 }
16599 /* Look for the closing `)'. */
16607 {
16608 /* Create the ASM_EXPR. */
16610 {
16613 /* If the extended syntax was not used, mark the ASM_EXPR. */
16615 {
16621 }
16622 }
16623 else
16625 }
16626 }
16628 /* Declarators [gram.dcl.decl] */
16630 /* Parse an init-declarator.
16632 init-declarator:
16633 declarator initializer [opt]
16635 GNU Extension:
16637 init-declarator:
16638 declarator asm-specification [opt] attributes [opt] initializer [opt]
16640 function-definition:
16641 decl-specifier-seq [opt] declarator ctor-initializer [opt]
16642 function-body
16643 decl-specifier-seq [opt] declarator function-try-block
16645 GNU Extension:
16647 function-definition:
16648 __extension__ function-definition
16650 TM Extension:
16652 function-definition:
16653 decl-specifier-seq [opt] declarator function-transaction-block
16655 The DECL_SPECIFIERS apply to this declarator. Returns a
16656 representation of the entity declared. If MEMBER_P is TRUE, then
16657 this declarator appears in a class scope. The new DECL created by
16658 this declarator is returned.
16660 The CHECKS are access checks that should be performed once we know
16661 what entity is being declared (and, therefore, what classes have
16662 befriended it).
16664 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
16665 for a function-definition here as well. If the declarator is a
16666 declarator for a function-definition, *FUNCTION_DEFINITION_P will
16667 be TRUE upon return. By that point, the function-definition will
16668 have been completely parsed.
16670 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
16671 is FALSE.
16673 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
16674 parsed declaration if it is an uninitialized single declarator not followed
16675 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
16676 if present, will not be consumed. If returned, this declarator will be
16677 created with SD_INITIALIZED but will not call cp_finish_decl. */
16679 static tree
16688 {
16692 tree prefix_attributes;
16694 tree asm_specification;
16695 tree initializer;
16697 tree scope;
16699 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
16700 initialized with "= ..", CPP_OPEN_PAREN if initialized with
16701 "(...)". */
16711 /* Gather the attributes that were provided with the
16712 decl-specifiers. */
16715 /* Assume that this is not the declarator for a function
16716 definition. */
16720 /* Default arguments are only permitted for function parameters. */
16724 /* Defer access checks while parsing the declarator; we cannot know
16725 what names are accessible until we know what is being
16726 declared. */
16729 /* Parse the declarator. */
16731 declarator
16735 member_p);
16736 /* Gather up the deferred checks. */
16741 /* If the DECLARATOR was erroneous, there's no need to go
16742 further. */
16746 /* Check that the number of template-parameter-lists is OK. */
16756 /* Figure out what scope the entity declared by the DECLARATOR is
16757 located in. `grokdeclarator' sometimes changes the scope, so
16758 we compute it now. */
16761 /* Perform any lookups in the declared type which were thought to be
16762 dependent, but are not in the scope of the declarator. */
16763 decl_specifiers->type
16766 /* If we're allowing GNU extensions, look for an
16767 asm-specification. */
16769 {
16770 /* Look for an asm-specification. */
16773 }
16774 else
16777 /* Look for attributes. */
16781 // Save off the current template constraints. These will apply
16782 // to the nested scope, not the declarator. Consider, an out-of-class
16783 // member definition:
16784 //
16785 // template<typename T>
16786 // requires C<T>()
16787 // void S<T>::f() requires D<T>() { ... }
16788 //
16789 // At the point we parse the 2nd requires clause, the previous the
16790 // current constraints will have been used to resolve the enclosing
16791 // class S<T>. The D<T>() requirement applies only to the definition
16792 // of f and do not include C<T>().
16795 // Parse an optional requires clause. Currently, requirements can
16796 // be written for out-of-class member function definitions.
16797 //
16798 // TODO: It may be better to always parse and diagnose the error
16799 // as a semantic one later on.
16801 {
16804 }
16805 else
16809 /* Peek at the next token. */
16813 {
16814 /* Check to see if the token indicates the start of a
16815 function-definition. */
16817 {
16819 {
16820 /* If a function-definition should not appear here, issue an
16821 error message. */
16825 }
16827 location_t func_brace_location
16830 /* Neither attributes nor an asm-specification are allowed
16831 on a function-definition. */
16834 "an asm-specification is not allowed "
16838 "attributes are not allowed "
16840 /* This is a function-definition. */
16843 /* Parse the function definition. */
16846 decl_specifiers,
16847 declarator,
16848 prefix_attributes);
16849 else
16850 decl =
16851 (cp_parser_function_definition_from_specifiers_and_declarator
16855 {
16856 /* This is where the prologue starts... */
16859 }
16861 // Restore the current requirements before returing.
16865 }
16866 }
16868 /* [dcl.dcl]
16870 Only in function declarations for constructors, destructors, and
16871 type conversions can the decl-specifier-seq be omitted.
16873 We explicitly postpone this check past the point where we handle
16874 function-definitions because we tolerate function-definitions
16875 that are missing their return types in some modes. */
16877 {
16881 }
16883 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
16887 {
16895 {
16901 }
16902 }
16903 else
16904 {
16905 /* If the init-declarator isn't initialized and isn't followed by a
16906 `,' or `;', it's not a valid init-declarator. */
16909 {
16912 else
16913 {
16916 }
16917 }
16920 }
16922 /* Because start_decl has side-effects, we should only call it if we
16923 know we're going ahead. By this point, we know that we cannot
16924 possibly be looking at any other construct. */
16927 /* If the decl specifiers were bad, issue an error now that we're
16928 sure this was intended to be a declarator. Then continue
16929 declaring the variable(s), as int, to try to cut down on further
16930 errors. */
16933 {
16936 }
16938 /* Check to see whether or not this declaration is a friend. */
16941 /* Enter the newly declared entry in the symbol table. If we're
16942 processing a declaration in a class-specifier, we wait until
16943 after processing the initializer. */
16945 {
16952 /* Adjust location of decl if declarator->id_loc is more appropriate:
16953 set, and decl wasn't merged with another decl, in which case its
16954 location would be different from input_location, and more accurate. */
16959 }
16961 /* Enter the SCOPE. That way unqualified names appearing in the
16962 initializer will be looked up in SCOPE. */
16965 /* Perform deferred access control checks, now that we know in which
16966 SCOPE the declared entity resides. */
16968 {
16971 /* If the entity being declared is a function, pretend that we
16972 are in its scope. If it is a `friend', it may have access to
16973 things that would not otherwise be accessible. */
16975 {
16978 }
16980 /* Perform access checks for template parameters. */
16983 /* Perform the access control checks for the declarator and the
16984 decl-specifiers. */
16987 /* Restore the saved value. */
16990 }
16992 /* Parse the initializer. */
16997 {
16999 {
17003 else
17004 {
17005 /* If the declaration was erroneous, we don't really
17006 know what the user intended, so just silently
17007 consume the initializer. */
17015 }
17016 }
17017 else
17018 {
17019 /* We want to record the extra mangling scope for in-class
17020 initializers of class members and initializers of static data
17021 member templates. The former involves deferring
17022 parsing of the initializer until end of class as with default
17023 arguments. So right here we only handle the latter. */
17033 }
17034 }
17036 /* The old parser allows attributes to appear after a parenthesized
17037 initializer. Mark Mitchell proposed removing this functionality
17038 on the GCC mailing lists on 2002-08-13. This parser accepts the
17039 attributes -- but ignores them. */
17046 /* For an in-class declaration, use `grokfield' to create the
17047 declaration. */
17049 {
17051 {
17054 }
17062 }
17064 /* Finish processing the declaration. But, skip member
17065 declarations. */
17067 {
17070 asm_specification,
17071 /* If the initializer is in parentheses, then this is
17072 a direct-initialization, which means that an
17073 `explicit' constructor is OK. Otherwise, an
17074 `explicit' constructor cannot be used. */
17077 }
17080 /* Core issue #226 (C++0x only): A default template-argument
17081 shall not be specified in a friend class template
17082 declaration. */
17091 {
17094 else
17096 }
17099 }
17101 /* Parse a declarator.
17103 declarator:
17104 direct-declarator
17105 ptr-operator declarator
17107 abstract-declarator:
17108 ptr-operator abstract-declarator [opt]
17109 direct-abstract-declarator
17111 GNU Extensions:
17113 declarator:
17114 attributes [opt] direct-declarator
17115 attributes [opt] ptr-operator declarator
17117 abstract-declarator:
17118 attributes [opt] ptr-operator abstract-declarator [opt]
17119 attributes [opt] direct-abstract-declarator
17121 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
17122 detect constructor, destructor or conversion operators. It is set
17123 to -1 if the declarator is a name, and +1 if it is a
17124 function. Otherwise it is set to zero. Usually you just want to
17125 test for >0, but internally the negative value is used.
17127 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
17128 a decl-specifier-seq unless it declares a constructor, destructor,
17129 or conversion. It might seem that we could check this condition in
17130 semantic analysis, rather than parsing, but that makes it difficult
17131 to handle something like `f()'. We want to notice that there are
17132 no decl-specifiers, and therefore realize that this is an
17133 expression, not a declaration.)
17135 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
17136 the declarator is a direct-declarator of the form "(...)".
17138 MEMBER_P is true iff this declarator is a member-declarator. */
17142 cp_parser_declarator_kind dcl_kind,
17146 {
17149 cp_cv_quals cv_quals;
17150 tree class_type;
17153 /* Assume this is not a constructor, destructor, or type-conversion
17154 operator. */
17161 /* Check for the ptr-operator production. */
17163 /* Parse the ptr-operator. */
17169 /* If that worked, then we have a ptr-operator. */
17171 {
17172 /* If a ptr-operator was found, then this declarator was not
17173 parenthesized. */
17176 /* The dependent declarator is optional if we are parsing an
17177 abstract-declarator. */
17181 /* Parse the dependent declarator. */
17187 /* If we are parsing an abstract-declarator, we must handle the
17188 case where the dependent declarator is absent. */
17193 declarator = cp_parser_make_indirect_declarator
17195 }
17196 /* Everything else is a direct-declarator. */
17197 else
17198 {
17201 CPP_OPEN_PAREN);
17203 ctor_dtor_or_conv_p,
17204 member_p);
17205 }
17211 }
17213 /* Parse a direct-declarator or direct-abstract-declarator.
17215 direct-declarator:
17216 declarator-id
17217 direct-declarator ( parameter-declaration-clause )
17218 cv-qualifier-seq [opt]
17219 ref-qualifier [opt]
17220 exception-specification [opt]
17221 direct-declarator [ constant-expression [opt] ]
17222 ( declarator )
17224 direct-abstract-declarator:
17225 direct-abstract-declarator [opt]
17226 ( parameter-declaration-clause )
17227 cv-qualifier-seq [opt]
17228 ref-qualifier [opt]
17229 exception-specification [opt]
17230 direct-abstract-declarator [opt] [ constant-expression [opt] ]
17231 ( abstract-declarator )
17233 Returns a representation of the declarator. DCL_KIND is
17234 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
17235 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
17236 we are parsing a direct-declarator. It is
17237 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
17238 of ambiguity we prefer an abstract declarator, as per
17239 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
17240 cp_parser_declarator. */
17244 cp_parser_declarator_kind dcl_kind,
17247 {
17257 {
17258 /* Peek at the next token. */
17261 {
17262 /* This is either a parameter-declaration-clause, or a
17263 parenthesized declarator. When we know we are parsing a
17264 named declarator, it must be a parenthesized declarator
17265 if FIRST is true. For instance, `(int)' is a
17266 parameter-declaration-clause, with an omitted
17267 direct-abstract-declarator. But `((*))', is a
17268 parenthesized abstract declarator. Finally, when T is a
17269 template parameter `(T)' is a
17270 parameter-declaration-clause, and not a parenthesized
17271 named declarator.
17273 We first try and parse a parameter-declaration-clause,
17274 and then try a nested declarator (if FIRST is true).
17276 It is not an error for it not to be a
17277 parameter-declaration-clause, even when FIRST is
17278 false. Consider,
17280 int i (int);
17281 int i (3);
17283 The first is the declaration of a function while the
17284 second is the definition of a variable, including its
17285 initializer.
17287 Having seen only the parenthesis, we cannot know which of
17288 these two alternatives should be selected. Even more
17289 complex are examples like:
17291 int i (int (a));
17292 int i (int (3));
17294 The former is a function-declaration; the latter is a
17295 variable initialization.
17297 Thus again, we try a parameter-declaration-clause, and if
17298 that fails, we back out and return. */
17301 {
17302 tree params;
17306 /* In a member-declarator, the only valid interpretation
17307 of a parenthesis is the start of a
17308 parameter-declaration-clause. (It is invalid to
17309 initialize a static data member with a parenthesized
17310 initializer; only the "=" form of initialization is
17311 permitted.) */
17315 /* Consume the `('. */
17318 {
17319 /* If this is going to be an abstract declarator, we're
17320 in a declarator and we can't have default args. */
17323 }
17325 /* Inside the function parameter list, surrounding
17326 template-parameter-lists do not apply. */
17327 saved_num_template_parameter_lists
17333 /* Parse the parameter-declaration-clause. */
17336 /* Restore saved template parameter lists accounting for implicit
17337 template parameters. */
17338 parser->num_template_parameter_lists
17341 /* Consume the `)'. */
17344 /* If all went well, parse the cv-qualifier-seq,
17345 ref-qualifier and the exception-specification. */
17347 {
17348 cp_cv_quals cv_quals;
17349 cp_virt_specifiers virt_specifiers;
17350 cp_ref_qualifier ref_qual;
17351 tree exception_specification;
17352 tree late_return;
17353 tree attrs;
17363 /* Parse the cv-qualifier-seq. */
17365 /* Parse the ref-qualifier. */
17367 /* And the exception-specification. */
17368 exception_specification
17373 late_return = (cp_parser_late_return_type_opt
17378 /* Parse the virt-specifier-seq. */
17381 /* Create the function-declarator. */
17383 params,
17384 cv_quals,
17385 virt_specifiers,
17386 ref_qual,
17387 exception_specification,
17388 late_return);
17390 /* Any subsequent parameter lists are to do with
17391 return type, so are not those of the declared
17392 function. */
17394 }
17396 /* Remove the function parms from scope. */
17400 /* Repeat the main loop. */
17402 }
17404 /* If this is the first, we can try a parenthesized
17405 declarator. */
17407 {
17413 /* Consume the `('. */
17415 /* Parse the nested declarator. */
17418 declarator
17421 member_p);
17424 /* Expect a `)'. */
17431 }
17432 /* Otherwise, we must be done. */
17433 else
17435 }
17439 {
17440 /* Parse an array-declarator. */
17449 /* Consume the `['. */
17451 /* Peek at the next token. */
17453 /* If the next token is `]', then there is no
17454 constant-expression. */
17456 {
17458 bounds
17468 {
17469 /* Normally, the array bound must be an integral constant
17470 expression. However, as an extension, we allow VLAs
17471 in function scopes as long as they aren't part of a
17472 parameter declaration. */
17476 }
17478 {
17479 /* Remember this wasn't a constant-expression. */
17482 }
17483 }
17484 else
17486 /* Look for the closing `]'. */
17488 {
17491 }
17496 }
17498 {
17499 {
17500 tree qualifying_scope;
17501 tree unqualified_name;
17502 tree attrs;
17503 special_function_kind sfk;
17508 /* Parse a declarator-id */
17511 {
17514 /* If we see an ellipsis, we should be looking at a
17515 parameter pack. */
17517 {
17518 /* Consume the `...' */
17522 }
17523 }
17526 unqualified_name
17530 {
17534 {
17535 /* Check whether an error occurred. */
17538 /* We already consumed the ellipsis to mark a
17539 parameter pack, but we have no way to report it,
17540 so abort the tentative parse. We will be exiting
17541 immediately anyway. */
17543 }
17544 else
17550 && (qualifying_scope
17552 {
17555 }
17556 }
17561 {
17566 }
17572 {
17573 /* In the declaration of a member of a template class
17574 outside of the class itself, the SCOPE will sometimes
17575 be a TYPENAME_TYPE. For example, given:
17577 template <typename T>
17578 int S<T>::R::i = 3;
17580 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
17581 this context, we must resolve S<T>::R to an ordinary
17582 type, rather than a typename type.
17584 The reason we normally avoid resolving TYPENAME_TYPEs
17585 is that a specialization of `S' might render
17586 `S<T>::R' not a type. However, if `S' is
17587 specialized, then this `i' will not be used, so there
17588 is no harm in resolving the types here. */
17589 tree type;
17591 /* Resolve the TYPENAME_TYPE. */
17594 /* If that failed, the declarator is invalid. */
17596 {
17599 "cannot define member of dependent typedef "
17601 else
17606 }
17608 }
17613 {
17614 tree class_type;
17619 else
17623 {
17626 {
17629 {
17633 "use %<%T::%D%> instead of %<%T::%D%> to "
17635 class_type,
17640 }
17641 else
17643 }
17644 else
17645 {
17646 /* We do not attempt to print the declarator
17647 here because we do not have enough
17648 information about its original syntactic
17649 form. */
17653 }
17654 }
17657 {
17663 for an anonymous type, even if the type
17664 got a name for linkage purposes. */
17667 class_type))
17668 {
17671 }
17679 }
17680 }
17682 unqualified_name,
17683 sfk);
17690 }
17692 handle_declarator:;
17695 {
17696 /* Any names that appear after the declarator-id for a
17697 member are looked up in the containing scope. */
17699 {
17700 /* But declarations with qualified-ids can't appear in a
17701 function. */
17704 }
17706 }
17710 /* Default args are only allowed on function
17711 declarations. */
17713 else
17717 }
17718 /* We're done. */
17719 else
17721 }
17723 /* For an abstract declarator, we might wind up with nothing at this
17724 point. That's an error; the declarator is not optional. */
17728 /* If we entered a scope, we must exit it now. */
17736 }
17738 /* Parse a ptr-operator.
17740 ptr-operator:
17741 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17742 * cv-qualifier-seq [opt]
17743 &
17744 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
17745 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
17747 GNU Extension:
17749 ptr-operator:
17750 & cv-qualifier-seq [opt]
17752 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
17753 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
17754 an rvalue reference. In the case of a pointer-to-member, *TYPE is
17755 filled in with the TYPE containing the member. *CV_QUALS is
17756 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
17757 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
17758 Note that the tree codes returned by this function have nothing
17759 to do with the types of trees that will be eventually be created
17760 to represent the pointer or reference type being parsed. They are
17761 just constants with suggestive names. */
17762 static enum tree_code
17767 {
17772 /* Assume that it's not a pointer-to-member. */
17774 /* And that there are no cv-qualifiers. */
17777 /* Peek at the next token. */
17780 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
17790 {
17791 /* Consume the `*', `&' or `&&'. */
17794 /* A `*' can be followed by a cv-qualifier-seq, and so can a
17795 `&', if we are allowing GNU extensions. (The only qualifier
17796 that can legally appear after `&' is `restrict', but that is
17797 enforced during semantic analysis. */
17805 }
17806 else
17807 {
17808 /* Try the pointer-to-member case. */
17810 /* Look for the optional `::' operator. */
17813 /* Look for the nested-name specifier. */
17820 /* If we found it, and the next token is a `*', then we are
17821 indeed looking at a pointer-to-member operator. */
17824 {
17825 /* Indicate that the `*' operator was used. */
17833 else
17834 {
17835 /* The type of which the member is a member is given by the
17836 current SCOPE. */
17838 /* The next name will not be qualified. */
17842 /* Look for optional c++11 attributes. */
17846 /* Look for the optional cv-qualifier-seq. */
17848 }
17849 }
17850 /* If that didn't work we don't have a ptr-operator. */
17853 }
17856 }
17858 /* Parse an (optional) cv-qualifier-seq.
17860 cv-qualifier-seq:
17861 cv-qualifier cv-qualifier-seq [opt]
17863 cv-qualifier:
17864 const
17865 volatile
17867 GNU Extension:
17869 cv-qualifier:
17870 __restrict__
17872 Returns a bitmask representing the cv-qualifiers. */
17874 static cp_cv_quals
17876 {
17880 {
17882 cp_cv_quals cv_qualifier;
17884 /* Peek at the next token. */
17886 /* See if it's a cv-qualifier. */
17888 {
17904 }
17910 {
17913 }
17914 else
17915 {
17918 }
17919 }
17922 }
17924 /* Parse an (optional) ref-qualifier
17926 ref-qualifier:
17927 &
17928 &&
17930 Returns cp_ref_qualifier representing ref-qualifier. */
17932 static cp_ref_qualifier
17934 {
17937 /* Don't try to parse bitwise '&' as a ref-qualifier (c++/57532). */
17942 {
17947 {
17959 }
17964 {
17967 }
17968 else
17969 {
17972 }
17973 }
17976 }
17978 /* Parse an (optional) virt-specifier-seq.
17980 virt-specifier-seq:
17981 virt-specifier virt-specifier-seq [opt]
17983 virt-specifier:
17984 override
17985 final
17987 Returns a bitmask representing the virt-specifiers. */
17989 static cp_virt_specifiers
17991 {
17995 {
17997 cp_virt_specifiers virt_specifier;
17999 /* Peek at the next token. */
18001 /* See if it's a virt-specifier-qualifier. */
18005 {
18008 }
18010 {
18013 }
18015 {
18017 }
18018 else
18022 {
18025 }
18026 else
18027 {
18030 }
18031 }
18033 }
18035 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
18036 is in scope even though it isn't real. */
18038 static void
18040 {
18041 tree this_parm;
18044 {
18045 /* We don't clear this between NSDMIs. Is it already what we want? */
18050 }
18053 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
18055 current_class_ref
18058 }
18060 /* Return true iff our current scope is a non-static data member
18061 initializer. */
18063 bool
18065 {
18066 /* We recognize NSDMI context by the context-less 'this' pointer set up
18067 by the function above. */
18071 }
18073 /* Parse a late-specified return type, if any. This is not a separate
18074 non-terminal, but part of a function declarator, which looks like
18076 -> trailing-type-specifier-seq abstract-declarator(opt)
18078 Returns the type indicated by the type-id.
18080 In addition to this this parses any queued up omp declare simd
18081 clauses.
18083 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
18084 function. */
18086 static tree
18088 cp_cv_quals quals)
18089 {
18093 && declarator
18096 /* Peek at the next token. */
18098 /* A late-specified return type is indicated by an initial '->'. */
18105 {
18106 /* DR 1207: 'this' is in scope in the trailing return type. */
18108 }
18111 {
18112 /* Consume the ->. */
18116 }
18119 declarator->std_attributes
18124 {
18127 }
18130 }
18132 /* Parse a declarator-id.
18134 declarator-id:
18135 id-expression
18136 :: [opt] nested-name-specifier [opt] type-name
18138 In the `id-expression' case, the value returned is as for
18139 cp_parser_id_expression if the id-expression was an unqualified-id.
18140 If the id-expression was a qualified-id, then a SCOPE_REF is
18141 returned. The first operand is the scope (either a NAMESPACE_DECL
18142 or TREE_TYPE), but the second is still just a representation of an
18143 unqualified-id. */
18145 static tree
18147 {
18148 tree id;
18149 /* The expression must be an id-expression. Assume that qualified
18150 names are the names of types so that:
18152 template <class T>
18153 int S<T>::R::i = 3;
18155 will work; we must treat `S<T>::R' as the name of a type.
18156 Similarly, assume that qualified names are templates, where
18157 required, so that:
18159 template <class T>
18160 int S<T>::R<T>::i = 3;
18162 will work, too. */
18168 optional_p);
18172 }
18174 /* Parse a type-id.
18176 type-id:
18177 type-specifier-seq abstract-declarator [opt]
18179 Returns the TYPE specified. */
18181 static tree
18184 {
18185 cp_decl_specifier_seq type_specifier_seq;
18188 /* Parse the type-specifier-seq. */
18190 is_trailing_return,
18195 /* There might or might not be an abstract declarator. */
18197 /* Look for the declarator. */
18198 abstract_declarator
18202 /* Check to see if there really was a declarator. */
18209 {
18210 /* A type-id with type 'auto' is only ok if the abstract declarator
18211 is a function declarator with a late-specified return type. */
18216 else
18217 {
18220 }
18221 }
18224 is_template_arg);
18225 }
18228 {
18230 }
18233 {
18234 tree r;
18236 parser->type_definition_forbidden_message
18241 }
18244 {
18246 }
18248 /* Parse a type-specifier-seq.
18250 type-specifier-seq:
18251 type-specifier type-specifier-seq [opt]
18253 GNU extension:
18255 type-specifier-seq:
18256 attributes type-specifier-seq [opt]
18258 If IS_DECLARATION is true, we are at the start of a "condition" or
18259 exception-declaration, so we might be followed by a declarator-id.
18261 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
18262 i.e. we've just seen "->".
18264 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
18266 static void
18271 {
18276 /* Clear the TYPE_SPECIFIER_SEQ. */
18279 /* In the context of a trailing return type, enum E { } is an
18280 elaborated-type-specifier followed by a function-body, not an
18281 enum-specifier. */
18285 /* Parse the type-specifiers and attributes. */
18287 {
18288 tree type_specifier;
18291 /* Check for attributes first. */
18293 {
18298 }
18300 /* record the token of the beginning of the type specifier seq,
18301 for error reporting purposes*/
18305 /* Look for the type-specifier. */
18307 flags,
18308 type_specifier_seq,
18310 NULL,
18313 {
18314 /* If the first type-specifier could not be found, this is not a
18315 type-specifier-seq at all. */
18317 {
18321 }
18322 /* If subsequent type-specifiers could not be found, the
18323 type-specifier-seq is complete. */
18325 }
18328 /* The standard says that a condition can be:
18330 type-specifier-seq declarator = assignment-expression
18332 However, given:
18334 struct S {};
18335 if (int S = ...)
18337 we should treat the "S" as a declarator, not as a
18338 type-specifier. The standard doesn't say that explicitly for
18339 type-specifier-seq, but it does say that for
18340 decl-specifier-seq in an ordinary declaration. Perhaps it
18341 would be clearer just to allow a decl-specifier-seq here, and
18342 then add a semantic restriction that if any decl-specifiers
18343 that are not type-specifiers appear, the program is invalid. */
18346 }
18347 }
18349 /* Parse a parameter-declaration-clause.
18351 parameter-declaration-clause:
18352 parameter-declaration-list [opt] ... [opt]
18353 parameter-declaration-list , ...
18355 Returns a representation for the parameter declarations. A return
18356 value of NULL indicates a parameter-declaration-clause consisting
18357 only of an ellipsis. */
18359 static tree
18361 {
18362 tree parameters;
18371 parser->auto_is_implicit_function_template_parm_p
18373 }
18381 /* Peek at the next token. */
18383 /* Check for trivial parameter-declaration-clauses. */
18385 {
18386 /* Consume the `...' token. */
18389 }
18391 /* There are no parameters. */
18392 {
18393 #ifndef NO_IMPLICIT_EXTERN_C
18397 else
18398 #endif
18400 }
18401 /* Check for `(void)', too, which is a special case. */
18405 {
18406 /* Consume the `void' token. */
18408 /* There are no parameters. */
18410 }
18412 /* Parse the parameter-declaration-list. */
18414 /* If a parse error occurred while parsing the
18415 parameter-declaration-list, then the entire
18416 parameter-declaration-clause is erroneous. */
18420 /* Peek at the next token. */
18422 /* If it's a `,', the clause should terminate with an ellipsis. */
18424 {
18425 /* Consume the `,'. */
18427 /* Expect an ellipsis. */
18428 ellipsis_p
18430 }
18431 /* It might also be `...' if the optional trailing `,' was
18432 omitted. */
18434 {
18435 /* Consume the `...' token. */
18437 /* And remember that we saw it. */
18439 }
18440 else
18443 /* Finish the parameter list. */
18448 }
18450 /* Parse a parameter-declaration-list.
18452 parameter-declaration-list:
18453 parameter-declaration
18454 parameter-declaration-list , parameter-declaration
18456 Returns a representation of the parameter-declaration-list, as for
18457 cp_parser_parameter_declaration_clause. However, the
18458 `void_list_node' is never appended to the list. Upon return,
18459 *IS_ERROR will be true iff an error occurred. */
18461 static tree
18463 {
18469 /* Assume all will go well. */
18471 /* The special considerations that apply to a function within an
18472 unbraced linkage specifications do not apply to the parameters
18473 to the function. */
18474 saved_in_unbraced_linkage_specification_p
18478 /* Look for more parameters. */
18480 {
18488 /* Parse the parameter. */
18489 parameter
18494 /* We don't know yet if the enclosing context is deprecated, so wait
18495 and warn in grokparms if appropriate. */
18499 {
18500 /* If a function parameter pack was specified and an implicit template
18501 parameter was introduced during cp_parser_parameter_declaration,
18502 change any implicit parameters introduced into packs. */
18506 {
18514 }
18518 PARM,
18521 }
18525 /* If a parse error occurred parsing the parameter declaration,
18526 then the entire parameter-declaration-list is erroneous. */
18528 {
18532 }
18542 {
18546 }
18548 /* Add the new parameter to the list. */
18552 /* Peek at the next token. */
18555 /* These are for Objective-C++ */
18558 /* The parameter-declaration-list is complete. */
18561 {
18564 /* Peek at the next token. */
18566 /* If it's an ellipsis, then the list is complete. */
18569 /* Otherwise, there must be more parameters. Consume the
18570 `,'. */
18572 /* When parsing something like:
18574 int i(float f, double d)
18576 we can tell after seeing the declaration for "f" that we
18577 are not looking at an initialization of a variable "i",
18578 but rather at the declaration of a function "i".
18580 Due to the fact that the parsing of template arguments
18581 (as specified to a template-id) requires backtracking we
18582 cannot use this technique when inside a template argument
18583 list. */
18587 /* However, a parameter-declaration of the form
18588 "float(f)" (which is a valid declaration of a
18589 parameter "f") can also be interpreted as an
18590 expression (the conversion of "f" to "float"). */
18593 }
18594 else
18595 {
18603 }
18604 }
18606 parser->in_unbraced_linkage_specification_p
18611 {
18614 }
18617 }
18619 /* Parse a parameter declaration.
18621 parameter-declaration:
18622 decl-specifier-seq ... [opt] declarator
18623 decl-specifier-seq declarator = assignment-expression
18624 decl-specifier-seq ... [opt] abstract-declarator [opt]
18625 decl-specifier-seq abstract-declarator [opt] = assignment-expression
18627 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
18628 declares a template parameter. (In that case, a non-nested `>'
18629 token encountered during the parsing of the assignment-expression
18630 is not interpreted as a greater-than operator.)
18632 Returns a representation of the parameter, or NULL if an error
18633 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
18634 true iff the declarator is of the form "(p)". */
18640 {
18642 cp_decl_specifier_seq decl_specifiers;
18644 tree default_argument;
18648 /* In a template parameter, `>' is not an operator.
18650 [temp.param]
18652 When parsing a default template-argument for a non-type
18653 template-parameter, the first non-nested `>' is taken as the end
18654 of the template parameter-list rather than a greater-than
18655 operator. */
18657 /* Type definitions may not appear in parameter types. */
18659 parser->type_definition_forbidden_message
18662 /* Parse the declaration-specifiers. */
18664 CP_PARSER_FLAGS_NONE,
18668 /* Complain about missing 'typename' or other invalid type names. */
18673 /* If an error occurred, there's no reason to attempt to parse the
18674 rest of the declaration. */
18676 {
18679 }
18681 /* Peek at the next token. */
18684 /* If the next token is a `)', `,', `=', `>', or `...', then there
18685 is no declarator. However, when variadic templates are enabled,
18686 there may be a declarator following `...'. */
18691 {
18695 }
18696 /* Otherwise, there should be a declarator. */
18697 else
18698 {
18702 /* After seeing a decl-specifier-seq, if the next token is not a
18703 "(", there is no possibility that the code is a valid
18704 expression. Therefore, if parsing tentatively, we commit at
18705 this point. */
18707 /* In an expression context, having seen:
18709 (int((char ...
18711 we cannot be sure whether we are looking at a
18712 function-type (taking a "char" as a parameter) or a cast
18713 of some object of type "char" to "int". */
18719 /* Parse the declarator. */
18722 CP_PARSER_DECLARATOR_EITHER,
18724 parenthesized_p,
18727 /* After the declarator, allow more attributes. */
18728 decl_specifiers.attributes
18731 }
18733 /* If the next token is an ellipsis, and we have not seen a
18734 declarator name, and the type of the declarator contains parameter
18735 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
18736 a parameter pack expansion expression. Otherwise, leave the
18737 ellipsis for a C-style variadic function. */
18740 {
18751 {
18752 /* Consume the `...'. */
18756 /* Build a pack expansion type */
18759 else
18761 }
18762 }
18764 /* The restriction on defining new types applies only to the type
18765 of the parameter, not to the default argument. */
18768 /* If the next token is `=', then process a default argument. */
18770 {
18772 /* If we are defining a class, then the tokens that make up the
18773 default argument must be saved and processed later. */
18778 /* Outside of a class definition, we can just parse the
18779 assignment-expression. */
18780 else
18781 default_argument
18785 {
18788 else
18789 {
18791 "default arguments are only "
18794 }
18795 }
18799 {
18800 /* Find the name of the parameter pack. */
18807 template_parm_p
18813 else
18815 template_parm_p
18822 }
18823 }
18824 else
18828 declarator,
18829 default_argument);
18830 }
18832 /* Parse a default argument and return it.
18834 TEMPLATE_PARM_P is true if this is a default argument for a
18835 non-type template parameter. */
18836 static tree
18838 {
18844 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
18845 set correctly. */
18848 /* Local variable names (and the `this' keyword) may not
18849 appear in a default argument. */
18852 /* Parse the assignment-expression. */
18855 default_argument
18865 }
18867 /* Parse a function-body.
18869 function-body:
18870 compound_statement */
18872 static void
18874 {
18876 }
18878 /* Parse a ctor-initializer-opt followed by a function-body. Return
18879 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
18880 is true we are parsing a function-try-block. */
18882 static bool
18885 {
18893 /* Begin the function body. */
18895 /* Parse the optional ctor-initializer. */
18898 /* If we're parsing a constexpr constructor definition, we need
18899 to check that the constructor body is indeed empty. However,
18900 before we get to cp_parser_function_body lot of junk has been
18901 generated, so we can't just check that we have an empty block.
18902 Rather we take a snapshot of the outermost block, and check whether
18903 cp_parser_function_body changed its state. */
18905 {
18909 }
18910 /* Parse the function-body. */
18914 /* Finish the function body. */
18918 }
18920 /* Parse an initializer.
18922 initializer:
18923 = initializer-clause
18924 ( expression-list )
18926 Returns an expression representing the initializer. If no
18927 initializer is present, NULL_TREE is returned.
18929 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
18930 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
18931 set to TRUE if there is no initializer present. If there is an
18932 initializer, and it is not a constant-expression, *NON_CONSTANT_P
18933 is set to true; otherwise it is set to false. */
18935 static tree
18938 {
18940 tree init;
18942 /* Peek at the next token. */
18945 /* Let our caller know whether or not this initializer was
18946 parenthesized. */
18948 /* Assume that the initializer is constant. */
18952 {
18953 /* Consume the `='. */
18955 /* Parse the initializer-clause. */
18957 }
18959 {
18964 non_constant_p);
18969 }
18971 {
18975 }
18976 else
18977 {
18978 /* Anything else is an error. */
18981 }
18984 }
18986 /* Parse an initializer-clause.
18988 initializer-clause:
18989 assignment-expression
18990 braced-init-list
18992 Returns an expression representing the initializer.
18994 If the `assignment-expression' production is used the value
18995 returned is simply a representation for the expression.
18997 Otherwise, calls cp_parser_braced_list. */
18999 static tree
19001 {
19002 tree initializer;
19004 /* Assume the expression is constant. */
19007 /* If it is not a `{', then we are looking at an
19008 assignment-expression. */
19010 {
19011 initializer
19014 non_constant_p);
19015 }
19016 else
19020 }
19022 /* Parse a brace-enclosed initializer list.
19024 braced-init-list:
19025 { initializer-list , [opt] }
19026 { }
19028 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
19029 the elements of the initializer-list (or NULL, if the last
19030 production is used). The TREE_TYPE for the CONSTRUCTOR will be
19031 NULL_TREE. There is no way to detect whether or not the optional
19032 trailing `,' was provided. NON_CONSTANT_P is as for
19033 cp_parser_initializer. */
19035 static tree
19037 {
19038 tree initializer;
19040 /* Consume the `{' token. */
19042 /* Create a CONSTRUCTOR to represent the braced-initializer. */
19044 /* If it's not a `}', then there is a non-trivial initializer. */
19046 {
19047 /* Parse the initializer list. */
19050 /* A trailing `,' token is allowed. */
19053 }
19054 else
19056 /* Now, there should be a trailing `}'. */
19060 }
19062 /* Parse an initializer-list.
19064 initializer-list:
19065 initializer-clause ... [opt]
19066 initializer-list , initializer-clause ... [opt]
19068 GNU Extension:
19070 initializer-list:
19071 designation initializer-clause ...[opt]
19072 initializer-list , designation initializer-clause ...[opt]
19074 designation:
19075 . identifier =
19076 identifier :
19077 [ constant-expression ] =
19079 Returns a vec of constructor_elt. The VALUE of each elt is an expression
19080 for the initializer. If the INDEX of the elt is non-NULL, it is the
19081 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
19082 as for cp_parser_initializer. */
19086 {
19089 /* Assume all of the expressions are constant. */
19092 /* Parse the rest of the list. */
19094 {
19096 tree designator;
19097 tree initializer;
19100 /* If the next token is an identifier and the following one is a
19101 colon, we are looking at the GNU designated-initializer
19102 syntax. */
19106 {
19107 /* Warn the user that they are using an extension. */
19110 /* Consume the identifier. */
19112 /* Consume the `:'. */
19114 }
19115 /* Also handle the C99 syntax, '. id ='. */
19120 {
19121 /* Warn the user that they are using an extension. */
19124 /* Consume the `.'. */
19126 /* Consume the identifier. */
19128 /* Consume the `='. */
19130 }
19131 /* Also handle C99 array designators, '[ const ] ='. */
19135 {
19136 /* In C++11, [ could start a lambda-introducer. */
19148 }
19149 else
19152 /* Parse the initializer. */
19155 /* If any clause is non-constant, so is the entire initializer. */
19159 /* If we have an ellipsis, this is an initializer pack
19160 expansion. */
19162 {
19163 /* Consume the `...'. */
19166 /* Turn the initializer into an initializer expansion. */
19168 }
19170 /* Add it to the vector. */
19173 /* If the next token is not a comma, we have reached the end of
19174 the list. */
19178 /* Peek at the next token. */
19180 /* If the next token is a `}', then we're still done. An
19181 initializer-clause can have a trailing `,' after the
19182 initializer-list and before the closing `}'. */
19186 /* Consume the `,' token. */
19188 }
19191 }
19193 /* Classes [gram.class] */
19195 /* Parse a class-name.
19197 class-name:
19198 identifier
19199 template-id
19201 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
19202 to indicate that names looked up in dependent types should be
19203 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
19204 keyword has been used to indicate that the name that appears next
19205 is a template. TAG_TYPE indicates the explicit tag given before
19206 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
19207 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
19208 is the class being defined in a class-head.
19210 Returns the TYPE_DECL representing the class. */
19212 static tree
19220 {
19221 tree decl;
19222 tree scope;
19227 /* All class-names start with an identifier. */
19230 {
19233 }
19235 /* PARSER->SCOPE can be cleared when parsing the template-arguments
19236 to a template-id, so we save it here. */
19241 /* Any name names a type if we're following the `typename' keyword
19242 in a qualified name where the enclosing scope is type-dependent. */
19245 /* Handle the common case (an identifier, but not a template-id)
19246 efficiently. */
19249 {
19253 /* Look for the identifier. */
19257 /* If the next token isn't an identifier, we are certainly not
19258 looking at a class-name. */
19261 /* If we know this is a type-name, there's no need to look it
19262 up. */
19265 else
19266 {
19267 tree ambiguous_decls;
19268 /* If we already know that this lookup is ambiguous, then
19269 we've already issued an error message; there's no reason
19270 to check again. */
19272 {
19275 }
19276 /* If the next token is a `::', then the name must be a type
19277 name.
19279 [basic.lookup.qual]
19281 During the lookup for a name preceding the :: scope
19282 resolution operator, object, function, and enumerator
19283 names are ignored. */
19286 /* Look up the name. */
19288 tag_type,
19291 check_dependency_p,
19295 {
19299 }
19300 }
19301 }
19302 else
19303 {
19304 /* Try a template-id. */
19306 check_dependency_p,
19307 tag_type,
19308 is_declaration);
19311 }
19315 /* If this is a typename, create a TYPENAME_TYPE. */
19317 {
19322 }
19326 /* Check to see that it is really the name of a class. */
19330 /* Situations like this:
19332 template <typename T> struct A {
19333 typename T::template X<int>::I i;
19334 };
19336 are problematic. Is `T::template X<int>' a class-name? The
19337 standard does not seem to be definitive, but there is no other
19338 valid interpretation of the following `::'. Therefore, those
19339 names are considered class-names. */
19340 {
19344 }
19348 /* In Objective-C 2.0, a classname followed by '.' starts a
19349 dot-syntax expression, and it's not a type-name. */
19361 }
19363 /* Parse a class-specifier.
19365 class-specifier:
19366 class-head { member-specification [opt] }
19368 Returns the TREE_TYPE representing the class. */
19370 static tree
19372 {
19373 tree type;
19387 /* Parse the class-head. */
19390 /* If the class-head was a semantic disaster, skip the entire body
19391 of the class. */
19393 {
19397 }
19399 /* Look for the `{'. */
19401 {
19404 }
19408 /* Issue an error message if type-definitions are forbidden here. */
19410 /* Remember that we are defining one more class. */
19412 /* Inside the class, surrounding template-parameter-lists do not
19413 apply. */
19414 saved_num_template_parameter_lists
19417 /* We are not in a function body. */
19420 /* Or in a loop. */
19423 /* Or in a switch. */
19426 /* We are not immediately inside an extern "lang" block. */
19427 saved_in_unbraced_linkage_specification_p
19431 /* Start the class. */
19433 {
19436 }
19440 /* If the type is erroneous, skip the entire body of the class. */
19442 else
19443 /* Parse the member-specification. */
19446 /* Look for the trailing `}'. */
19448 /* Look for trailing attributes to apply to this class. */
19456 /* We've finished a type definition. Check for the common syntax
19457 error of forgetting a semicolon after the definition. We need to
19458 be careful, as we can't just check for not-a-semicolon and be done
19459 with it; the user might have typed:
19461 class X { } c = ...;
19462 class X { } *p = ...;
19464 and so forth. Instead, enumerate all the possible tokens that
19465 might follow this production; if we don't see one of them, then
19466 complain and silently insert the semicolon. */
19467 {
19472 /* Don't try to parse c++11 attributes here. As per the
19473 grammar, that should be a task for
19474 cp_parser_decl_specifier_seq. */
19478 {
19489 /* While it's legal for type qualifiers and storage class
19490 specifiers to follow type definitions in the grammar, only
19491 compiler testsuites contain code like that. Assume that if
19492 we see such code, then what we're really seeing is a case
19493 like:
19495 class X { }
19496 const <type> var = ...;
19498 or
19500 class Y { }
19501 static <type> func (...) ...
19503 i.e. the qualifier or specifier applies to the next
19504 declaration. To do so, however, we need to look ahead one
19505 more token to see if *that* token is a type specifier.
19507 This code could be improved to handle:
19509 class Z { }
19510 static const <type> var = ...; */
19513 {
19516 /* Handling user-defined types here would be nice, but very
19517 tricky. */
19518 want_semicolon
19521 }
19525 }
19527 /* If we don't have a type, then something is very wrong and we
19528 shouldn't try to do anything clever. Likewise for not seeing the
19529 closing brace. */
19531 {
19532 cp_token_position prev
19543 else
19546 /* Unget one token and smash it to look as though we encountered
19547 a semicolon in the input stream. */
19552 }
19553 }
19555 /* If this class is not itself within the scope of another class,
19556 then we need to parse the bodies of all of the queued function
19557 definitions. Note that the queued functions defined in a class
19558 are not always processed immediately following the
19559 class-specifier for that class. Consider:
19561 struct A {
19562 struct B { void f() { sizeof (A); } };
19563 };
19565 If `f' were processed before the processing of `A' were
19566 completed, there would be no way to compute the size of `A'.
19567 Note that the nesting we are interested in here is lexical --
19568 not the semantic nesting given by TYPE_CONTEXT. In particular,
19569 for:
19571 struct A { struct B; };
19572 struct A::B { void f() { } };
19574 there is no need to delay the parsing of `A::B::f'. */
19576 {
19577 tree decl;
19584 /* In a first pass, parse default arguments to the functions.
19585 Then, in a second pass, parse the bodies of the functions.
19586 This two-phased approach handles cases like:
19588 struct S {
19589 void f() { g(); }
19590 void g(int i = 3);
19591 };
19593 */
19595 {
19597 /* If there are default arguments that have not yet been processed,
19598 take care of them now. */
19600 {
19605 }
19606 /* Make sure that any template parameters are in scope. */
19608 /* Parse the default argument expressions. */
19610 /* Remove any template parameters from the symbol table. */
19612 }
19614 /* Now parse any NSDMIs. */
19618 {
19620 {
19625 }
19628 }
19634 /* Now parse the body of the functions. */
19636 {
19637 /* OpenMP UDRs need to be parsed before all other functions. */
19644 }
19645 else
19649 }
19651 /* Put back any saved access checks. */
19654 /* Restore saved state. */
19658 parser->num_template_parameter_lists
19660 parser->in_unbraced_linkage_specification_p
19664 }
19666 static tree
19668 {
19669 tree ret;
19674 }
19676 /* Parse a class-head.
19678 class-head:
19679 class-key identifier [opt] base-clause [opt]
19680 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
19681 class-key nested-name-specifier [opt] template-id
19682 base-clause [opt]
19684 class-virt-specifier:
19685 final
19687 GNU Extensions:
19688 class-key attributes identifier [opt] base-clause [opt]
19689 class-key attributes nested-name-specifier identifier base-clause [opt]
19690 class-key attributes nested-name-specifier [opt] template-id
19691 base-clause [opt]
19693 Upon return BASES is initialized to the list of base classes (or
19694 NULL, if there are none) in the same form returned by
19695 cp_parser_base_clause.
19697 Returns the TYPE of the indicated class. Sets
19698 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
19699 involving a nested-name-specifier was used, and FALSE otherwise.
19701 Returns error_mark_node if this is not a class-head.
19703 Returns NULL_TREE if the class-head is syntactically valid, but
19704 semantically invalid in a way that means we should skip the entire
19705 body of the class. */
19707 static tree
19710 {
19711 tree nested_name_specifier;
19715 tree attributes;
19716 tree bases;
19726 /* Assume no nested-name-specifier will be present. */
19728 /* Assume no template parameter lists will be used in defining the
19729 type. */
19733 /* Look for the class-key. */
19738 /* Parse the attributes. */
19741 /* If the next token is `::', that is invalid -- but sometimes
19742 people do try to write:
19744 struct ::S {};
19746 Handle this gracefully by accepting the extra qualifier, and then
19747 issuing an error about it later if this really is a
19748 class-head. If it turns out just to be an elaborated type
19749 specifier, remain silent. */
19755 /* Determine the name of the class. Begin by looking for an
19756 optional nested-name-specifier. */
19758 nested_name_specifier
19764 /* If there was a nested-name-specifier, then there *must* be an
19765 identifier. */
19767 {
19769 /* Although the grammar says `identifier', it really means
19770 `class-name' or `template-name'. You are only allowed to
19771 define a class that has already been declared with this
19772 syntax.
19774 The proposed resolution for Core Issue 180 says that wherever
19775 you see `class T::X' you should treat `X' as a type-name.
19777 It is OK to define an inaccessible class; for example:
19779 class A { class B; };
19780 class A::B {};
19782 We do not know if we will see a class-name, or a
19783 template-name. We look for a class-name first, in case the
19784 class-name is a template-id; if we looked for the
19785 template-name first we would stop after the template-name. */
19790 class_type,
19794 /* If that didn't work, ignore the nested-name-specifier. */
19796 {
19802 }
19803 /* If we could not find a corresponding TYPE, treat this
19804 declaration like an unqualified declaration. */
19807 /* Otherwise, count the number of templates used in TYPE and its
19808 containing scopes. */
19809 else
19810 {
19811 tree scope;
19823 }
19824 }
19825 /* Otherwise, the identifier is optional. */
19826 else
19827 {
19828 /* We don't know whether what comes next is a template-id,
19829 an identifier, or nothing at all. */
19831 /* Check for a template-id. */
19836 class_key,
19838 /* If that didn't work, it could still be an identifier. */
19840 {
19842 {
19845 }
19846 else
19848 }
19849 else
19850 {
19853 }
19854 }
19859 {
19861 class_key,
19863 }
19866 /* If it's not a `:' or a `{' then we can't really be looking at a
19867 class-head, since a class-head only appears as part of a
19868 class-specifier. We have to detect this situation before calling
19869 xref_tag, since that has irreversible side-effects. */
19871 {
19875 }
19877 /* At this point, we're going ahead with the class-specifier, even
19878 if some other problem occurs. */
19881 {
19886 }
19887 /* Issue the error about the overly-qualified name now. */
19889 {
19894 }
19896 {
19901 }
19903 {
19904 tree scope;
19906 /* Reject typedef-names in class heads. */
19908 {
19911 type);
19914 }
19916 /* Figure out in what scope the declaration is being placed. */
19918 /* If that scope does not contain the scope in which the
19919 class was originally declared, the program is invalid. */
19921 {
19924 "declaration of %qD in namespace %qD which does not "
19927 else
19933 }
19934 /* [dcl.meaning]
19936 A declarator-id shall not be qualified except for the
19937 definition of a ... nested class outside of its class
19938 ... [or] the definition or explicit instantiation of a
19939 class member of a namespace outside of its namespace. */
19941 {
19946 }
19947 }
19948 /* An explicit-specialization must be preceded by "template <>". If
19949 it is not, try to recover gracefully. */
19953 {
19957 /* Take the same action that would have been taken by
19958 cp_parser_explicit_specialization. */
19961 }
19962 /* There must be no "return" statements between this point and the
19963 end of this function; set "type "to the correct return value and
19964 use "goto done;" to return. */
19965 /* Make sure that the right number of template parameters were
19966 present. */
19970 {
19971 /* If something went wrong, there is no point in even trying to
19972 process the class-definition. */
19975 }
19977 /* Look up the type. */
19979 {
19983 {
19987 }
19988 else
19989 {
19992 }
19995 }
19997 {
19998 tree class_type;
20000 /* Given:
20002 template <typename T> struct S { struct T };
20003 template <typename T> struct S<T>::T { };
20005 we will get a TYPENAME_TYPE when processing the definition of
20006 `S::T'. We need to resolve it to the actual type before we
20007 try to define it. */
20009 {
20014 else
20015 {
20018 }
20019 }
20023 {
20026 }
20029 /* Enter the scope indicated by the nested-name-specifier. */
20031 /* Get the canonical version of this type. */
20035 {
20038 {
20041 }
20042 }
20046 }
20048 {
20049 /* If the class was unnamed, create a dummy name. */
20054 }
20056 /* Indicate whether this class was declared as a `class' or as a
20057 `struct'. */
20062 /* If this type was already complete, and we see another definition,
20063 that's an error. */
20065 {
20067 type);
20069 type);
20072 }
20077 {
20078 /* Apply attributes now, before any use of the class as a template
20079 argument in its base list. */
20082 }
20084 /* We will have entered the scope containing the class; the names of
20085 base classes should be looked up in that context. For example:
20087 struct A { struct B {}; struct C; };
20088 struct A::C : B {};
20090 is valid. */
20092 /* Get the list of base-classes, if there is one. */
20095 else
20098 /* If we're really defining a class, process the base classes.
20099 If they're invalid, fail. */
20104 done:
20105 /* Leave the scope given by the nested-name-specifier. We will
20106 enter the class scope itself while processing the members. */
20111 {
20114 }
20120 out:
20123 }
20125 /* Parse a class-key.
20127 class-key:
20128 class
20129 struct
20130 union
20132 Returns the kind of class-key specified, or none_type to indicate
20133 error. */
20135 static enum tag_types
20137 {
20141 /* Look for the class-key. */
20146 /* Check to see if the TOKEN is a class-key. */
20151 }
20153 /* Parse an (optional) member-specification.
20155 member-specification:
20156 member-declaration member-specification [opt]
20157 access-specifier : member-specification [opt] */
20159 static void
20161 {
20163 {
20167 /* Peek at the next token. */
20169 /* If it's a `}', or EOF then we've seen all the members. */
20175 /* See if this token is a keyword. */
20178 {
20182 /* Consume the access-specifier. */
20184 /* Remember which access-specifier is active. */
20186 /* Look for the `:'. */
20191 /* Accept #pragmas at class scope. */
20193 {
20196 }
20198 /* Otherwise, the next construction must be a
20199 member-declaration. */
20201 }
20202 }
20203 }
20205 /* Parse a member-declaration.
20207 member-declaration:
20208 decl-specifier-seq [opt] member-declarator-list [opt] ;
20209 function-definition ; [opt]
20210 :: [opt] nested-name-specifier template [opt] unqualified-id ;
20211 using-declaration
20212 template-declaration
20213 alias-declaration
20215 member-declarator-list:
20216 member-declarator
20217 member-declarator-list , member-declarator
20219 member-declarator:
20220 declarator pure-specifier [opt]
20221 declarator constant-initializer [opt]
20222 identifier [opt] : constant-expression
20224 GNU Extensions:
20226 member-declaration:
20227 __extension__ member-declaration
20229 member-declarator:
20230 declarator attributes [opt] pure-specifier [opt]
20231 declarator attributes [opt] constant-initializer [opt]
20232 identifier [opt] attributes [opt] : constant-expression
20234 C++0x Extensions:
20236 member-declaration:
20237 static_assert-declaration */
20239 static void
20241 {
20242 cp_decl_specifier_seq decl_specifiers;
20243 tree prefix_attributes;
20244 tree decl;
20253 /* Check for the `__extension__' keyword. */
20255 {
20256 /* Recurse. */
20258 /* Restore the old value of the PEDANTIC flag. */
20262 }
20264 /* Check for a template-declaration. */
20266 {
20267 /* An explicit specialization here is an error condition, and we
20268 expect the specialization handler to detect and report this. */
20272 else
20276 }
20278 /* Check for a using-declaration. */
20280 {
20282 {
20283 /* Parse the using-declaration. */
20287 }
20288 else
20289 {
20290 tree decl;
20294 /* Note that if we actually see the '=' token after the
20295 identifier, cp_parser_alias_declaration commits the
20296 tentative parse. In that case, we really expects an
20297 alias-declaration. Otherwise, we expect a using
20298 declaration. */
20299 alias_decl_expected =
20305 else
20309 }
20310 }
20312 /* Check for @defs. */
20314 {
20319 {
20324 }
20326 }
20328 /* If the next token is `static_assert' we have a static assertion. */
20330 {
20333 }
20340 /* Parse the decl-specifier-seq. */
20343 CP_PARSER_FLAGS_OPTIONAL,
20346 /* Check for an invalid type-name. */
20350 /* If there is no declarator, then the decl-specifier-seq should
20351 specify a type. */
20353 {
20354 /* If there was no decl-specifier-seq, and the next token is a
20355 `;', then we have something like:
20357 struct S { ; };
20359 [class.mem]
20361 Each member-declaration shall declare at least one member
20362 name of the class. */
20364 {
20368 }
20369 else
20370 {
20371 tree type;
20373 /* See if this declaration is a friend. */
20375 /* If there were decl-specifiers, check to see if there was
20376 a class-declaration. */
20379 /* Nested classes have already been added to the class, but
20380 a `friend' needs to be explicitly registered. */
20382 {
20383 /* If the `friend' keyword was present, the friend must
20384 be introduced with a class-key. */
20387 "in C++03 a class-key must be used "
20389 /* In this case:
20391 template <typename T> struct A {
20392 friend struct A<T>::B;
20393 };
20395 A<T>::B will be represented by a TYPENAME_TYPE, and
20396 therefore not recognized by check_tag_decl. */
20398 {
20402 }
20405 "friend declaration does not name a class or "
20407 else
20410 }
20411 /* If there is no TYPE, an error message will already have
20412 been issued. */
20414 ;
20415 /* An anonymous aggregate has to be handled specially; such
20416 a declaration really declares a data member (with a
20417 particular type), as opposed to a nested class. */
20419 {
20420 /* C++11 9.5/6. */
20423 "a storage class on an anonymous aggregate "
20426 /* Remove constructors and such from TYPE, now that we
20427 know it is an anonymous aggregate. */
20429 /* And make the corresponding data member. */
20432 /* Add it to the class. */
20434 }
20435 else
20436 cp_parser_check_access_in_redeclaration
20439 }
20440 }
20441 else
20442 {
20445 /* Clear attributes from the decl_specifiers but keep them
20446 around as prefix attributes that apply them to the entity
20447 being declared. */
20451 /* See if these declarations will be friends. */
20454 /* Keep going until we hit the `;' at the end of the
20455 declaration. */
20457 {
20459 tree first_attribute;
20461 /* Peek at the next token. */
20464 /* Check for a bitfield declaration. */
20469 {
20470 tree identifier;
20471 tree width;
20473 /* Get the name of the bitfield. Note that we cannot just
20474 check TOKEN here because it may have been invalidated by
20475 the call to cp_lexer_peek_nth_token above. */
20478 else
20481 /* Consume the `:' token. */
20483 /* Get the width of the bitfield. */
20484 width
20487 NULL);
20489 /* Look for attributes that apply to the bitfield. */
20491 /* Remember which attributes are prefix attributes and
20492 which are not. */
20494 /* Combine the attributes. */
20497 /* Create the bitfield declaration. */
20500 identifier,
20501 sfk_none)
20504 width,
20505 attributes);
20506 }
20507 else
20508 {
20510 tree initializer;
20511 tree asm_specification;
20514 /* Parse the declarator. */
20515 declarator
20521 /* If something went wrong parsing the declarator, make sure
20522 that we at least consume some tokens. */
20524 {
20525 /* Skip to the end of the statement. */
20527 /* If the next token is not a semicolon, that is
20528 probably because we just skipped over the body of
20529 a function. So, we consume a semicolon if
20530 present, but do not issue an error message if it
20531 is not present. */
20533 CPP_SEMICOLON))
20536 }
20539 cp_parser_check_for_definition_in_return_type
20543 /* Look for an asm-specification. */
20545 /* Look for attributes that apply to the declaration. */
20547 /* Remember which attributes are prefix attributes and
20548 which are not. */
20550 /* Combine the attributes. */
20553 /* If it's an `=', then we have a constant-initializer or a
20554 pure-specifier. It is not correct to parse the
20555 initializer before registering the member declaration
20556 since the member declaration should be in scope while
20557 its initializer is processed. However, the rest of the
20558 front end does not yet provide an interface that allows
20559 us to handle this correctly. */
20561 {
20562 /* In [class.mem]:
20564 A pure-specifier shall be used only in the declaration of
20565 a virtual function.
20567 A member-declarator can contain a constant-initializer
20568 only if it declares a static member of integral or
20569 enumeration type.
20571 Therefore, if the DECLARATOR is for a function, we look
20572 for a pure-specifier; otherwise, we look for a
20573 constant-initializer. When we call `grokfield', it will
20574 perform more stringent semantics checks. */
20586 {
20588 /* Don't require a constant rvalue in C++11, since we
20589 might want a reference constant. We'll enforce
20590 constancy later. */
20592 /* Parse the initializer. */
20595 }
20596 else
20597 /* Parse the initializer. */
20599 }
20602 {
20606 else
20608 }
20609 /* Otherwise, there is no initializer. */
20610 else
20613 // If we're looking at a member function declaration, then a
20614 // requires clause may follow the declaration.
20617 {
20618 // Because this is a non-template member, there are no
20619 // template requirements to conjoin.
20622 }
20624 /* See if we are probably looking at a function
20625 definition. We are certainly not looking at a
20626 member-declarator. Calling `grokfield' has
20627 side-effects, so we must not do it unless we are sure
20628 that we are looking at a member-declarator. */
20631 {
20632 /* The grammar does not allow a pure-specifier to be
20633 used when a member function is defined. (It is
20634 possible that this fact is an oversight in the
20635 standard, since a pure function may be defined
20636 outside of the class-specifier. */
20642 declarator,
20643 attributes);
20644 /* If the member was not a friend, declare it here. */
20646 {
20650 }
20655 /* Peek at the next token. */
20657 /* If the next token is a semicolon, consume it. */
20661 // Restore the current template requirements.
20665 }
20666 else
20669 /* Create the declaration. */
20676 // Restore the current template requirments.
20678 }
20682 /* Reset PREFIX_ATTRIBUTES. */
20688 /* If there is any qualification still in effect, clear it
20689 now; we will be starting fresh with the next declarator. */
20693 /* If it's a `,', then there are more declarators. */
20695 {
20698 {
20702 }
20703 }
20704 /* If the next token isn't a `;', then we have a parse error. */
20706 CPP_SEMICOLON))
20707 {
20708 /* The next token might be a ways away from where the
20709 actual semicolon is missing. Find the previous token
20710 and use that for our error position. */
20715 /* Assume that the user meant to provide a semicolon. If
20716 we were to cp_parser_skip_to_end_of_statement, we might
20717 skip to a semicolon inside a member function definition
20718 and issue nonsensical error messages. */
20720 }
20723 {
20724 /* Add DECL to the list of members. */
20733 /* Add DECL to the queue of NSDMI to be parsed later. */
20735 }
20739 }
20740 }
20743 out:
20745 }
20747 /* Parse a pure-specifier.
20749 pure-specifier:
20750 = 0
20752 Returns INTEGER_ZERO_NODE if a pure specifier is found.
20753 Otherwise, ERROR_MARK_NODE is returned. */
20755 static tree
20757 {
20760 /* Look for the `=' token. */
20763 /* Look for the `0' token. */
20772 /* Accept = default or = delete in c++0x mode. */
20775 {
20778 }
20780 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
20782 {
20787 }
20789 {
20792 }
20795 }
20797 /* Parse a constant-initializer.
20799 constant-initializer:
20800 = constant-expression
20802 Returns a representation of the constant-expression. */
20804 static tree
20806 {
20807 /* Look for the `=' token. */
20811 /* It is invalid to write:
20813 struct S { static const int i = { 7 }; };
20815 */
20817 {
20820 /* Consume the opening brace. */
20822 /* Skip the initializer. */
20824 /* Look for the trailing `}'. */
20828 }
20832 NULL);
20833 }
20835 /* Derived classes [gram.class.derived] */
20837 /* Parse a base-clause.
20839 base-clause:
20840 : base-specifier-list
20842 base-specifier-list:
20843 base-specifier ... [opt]
20844 base-specifier-list , base-specifier ... [opt]
20846 Returns a TREE_LIST representing the base-classes, in the order in
20847 which they were declared. The representation of each node is as
20848 described by cp_parser_base_specifier.
20850 In the case that no bases are specified, this function will return
20851 NULL_TREE, not ERROR_MARK_NODE. */
20853 static tree
20855 {
20858 /* Look for the `:' that begins the list. */
20861 /* Scan the base-specifier-list. */
20863 {
20865 tree base;
20868 /* Look for the base-specifier. */
20870 /* Look for the (optional) ellipsis. */
20872 {
20873 /* Consume the `...'. */
20877 }
20879 /* Add BASE to the front of the list. */
20881 {
20883 /* Make this a pack expansion type. */
20887 {
20890 }
20891 }
20892 /* Peek at the next token. */
20894 /* If it's not a comma, then the list is complete. */
20897 /* Consume the `,'. */
20899 }
20901 /* PARSER->SCOPE may still be non-NULL at this point, if the last
20902 base class had a qualified name. However, the next name that
20903 appears is certainly not qualified. */
20909 }
20911 /* Parse a base-specifier.
20913 base-specifier:
20914 :: [opt] nested-name-specifier [opt] class-name
20915 virtual access-specifier [opt] :: [opt] nested-name-specifier
20916 [opt] class-name
20917 access-specifier virtual [opt] :: [opt] nested-name-specifier
20918 [opt] class-name
20920 Returns a TREE_LIST. The TREE_PURPOSE will be one of
20921 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
20922 indicate the specifiers provided. The TREE_VALUE will be a TYPE
20923 (or the ERROR_MARK_NODE) indicating the type that was specified. */
20925 static tree
20927 {
20935 tree type;
20937 /* Process the optional `virtual' and `access-specifier'. */
20939 {
20940 /* Peek at the next token. */
20942 /* Process `virtual'. */
20944 {
20946 /* If `virtual' appears more than once, issue an error. */
20948 {
20952 }
20956 /* Consume the `virtual' token. */
20964 /* If more than one access specifier appears, issue an
20965 error. */
20968 {
20972 }
20976 /* Consume the access-specifier. */
20984 }
20985 }
20986 /* It is not uncommon to see programs mechanically, erroneously, use
20987 the 'typename' keyword to denote (dependent) qualified types
20988 as base classes. */
20990 {
20995 else
20997 "keyword %<typename%> not allowed in this context "
21000 }
21002 /* Look for the optional `::' operator. */
21004 /* Look for the nested-name-specifier. The simplest way to
21005 implement:
21007 [temp.res]
21009 The keyword `typename' is not permitted in a base-specifier or
21010 mem-initializer; in these contexts a qualified name that
21011 depends on a template-parameter is implicitly assumed to be a
21012 type name.
21014 is to pretend that we have seen the `typename' keyword at this
21015 point. */
21019 typename_type,
21021 /* If the base class is given by a qualified name, assume that names
21022 we see are type names or templates, as appropriate. */
21028 /* DR 950 allows decltype as a base-specifier. */
21030 else
21031 {
21032 /* Otherwise, look for the class-name. */
21034 class_scope_p,
21035 template_p,
21036 typename_type,
21041 }
21047 }
21049 /* Exception handling [gram.exception] */
21051 /* Parse an (optional) noexcept-specification.
21053 noexcept-specification:
21054 noexcept ( constant-expression ) [opt]
21056 If no noexcept-specification is present, returns NULL_TREE.
21057 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
21058 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
21059 there are no parentheses. CONSUMED_EXPR will be set accordingly.
21060 Otherwise, returns a noexcept specification unless RETURN_COND is true,
21061 in which case a boolean condition is returned instead. */
21063 static tree
21068 {
21072 /* Peek at the next token. */
21075 /* Is it a noexcept-specification? */
21077 {
21078 tree expr;
21082 {
21086 {
21087 /* Types may not be defined in an exception-specification. */
21089 parser->type_definition_forbidden_message
21094 /* Restore the saved message. */
21096 }
21097 else
21098 {
21101 }
21104 }
21105 else
21106 {
21110 }
21112 /* We cannot build a noexcept-spec right away because this will check
21113 that expr is a constexpr. */
21116 else
21118 }
21119 else
21121 }
21123 /* Parse an (optional) exception-specification.
21125 exception-specification:
21126 throw ( type-id-list [opt] )
21128 Returns a TREE_LIST representing the exception-specification. The
21129 TREE_VALUE of each node is a type. */
21131 static tree
21133 {
21135 tree type_id_list;
21138 /* Peek at the next token. */
21141 /* Is it a noexcept-specification? */
21147 /* If it's not `throw', then there's no exception-specification. */
21151 #if 0
21152 /* Enable this once a lot of code has transitioned to noexcept? */
21156 #endif
21158 /* Consume the `throw'. */
21161 /* Look for the `('. */
21164 /* Peek at the next token. */
21166 /* If it's not a `)', then there is a type-id-list. */
21168 {
21169 /* Types may not be defined in an exception-specification. */
21171 parser->type_definition_forbidden_message
21173 /* Parse the type-id-list. */
21175 /* Restore the saved message. */
21177 }
21178 else
21181 /* Look for the `)'. */
21185 }
21187 /* Parse an (optional) type-id-list.
21189 type-id-list:
21190 type-id ... [opt]
21191 type-id-list , type-id ... [opt]
21193 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
21194 in the order that the types were presented. */
21196 static tree
21198 {
21202 {
21204 tree type;
21206 /* Get the next type-id. */
21208 /* Parse the optional ellipsis. */
21210 {
21211 /* Consume the `...'. */
21214 /* Turn the type into a pack expansion expression. */
21216 }
21217 /* Add it to the list. */
21219 /* Peek at the next token. */
21221 /* If it is not a `,', we are done. */
21224 /* Consume the `,'. */
21226 }
21229 }
21231 /* Parse a try-block.
21233 try-block:
21234 try compound-statement handler-seq */
21236 static tree
21238 {
21239 tree try_block;
21249 }
21251 /* Parse a function-try-block.
21253 function-try-block:
21254 try ctor-initializer [opt] function-body handler-seq */
21256 static bool
21258 {
21259 tree compound_stmt;
21260 tree try_block;
21263 /* Look for the `try' keyword. */
21266 /* Let the rest of the front end know where we are. */
21268 /* Parse the function-body. */
21269 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21271 /* We're done with the `try' part. */
21273 /* Parse the handlers. */
21275 /* We're done with the handlers. */
21279 }
21281 /* Parse a handler-seq.
21283 handler-seq:
21284 handler handler-seq [opt] */
21286 static void
21288 {
21290 {
21293 /* Parse the handler. */
21295 /* Peek at the next token. */
21297 /* If it's not `catch' then there are no more handlers. */
21300 }
21301 }
21303 /* Parse a handler.
21305 handler:
21306 catch ( exception-declaration ) compound-statement */
21308 static void
21310 {
21311 tree handler;
21312 tree declaration;
21322 }
21324 /* Parse an exception-declaration.
21326 exception-declaration:
21327 type-specifier-seq declarator
21328 type-specifier-seq abstract-declarator
21329 type-specifier-seq
21330 ...
21332 Returns a VAR_DECL for the declaration, or NULL_TREE if the
21333 ellipsis variant is used. */
21335 static tree
21337 {
21338 cp_decl_specifier_seq type_specifiers;
21342 /* If it's an ellipsis, it's easy to handle. */
21344 {
21345 /* Consume the `...' token. */
21348 }
21350 /* Types may not be defined in exception-declarations. */
21352 parser->type_definition_forbidden_message
21355 /* Parse the type-specifier-seq. */
21359 /* If it's a `)', then there is no declarator. */
21362 else
21368 /* Restore the saved message. */
21375 }
21377 /* Parse a throw-expression.
21379 throw-expression:
21380 throw assignment-expression [opt]
21382 Returns a THROW_EXPR representing the throw-expression. */
21384 static tree
21386 {
21387 tree expression;
21392 /* Figure out whether or not there is an assignment-expression
21393 following the "throw" keyword. */
21401 else
21406 }
21408 /* GNU Extensions */
21410 /* Parse an (optional) asm-specification.
21412 asm-specification:
21413 asm ( string-literal )
21415 If the asm-specification is present, returns a STRING_CST
21416 corresponding to the string-literal. Otherwise, returns
21417 NULL_TREE. */
21419 static tree
21421 {
21423 tree asm_specification;
21425 /* Peek at the next token. */
21427 /* If the next token isn't the `asm' keyword, then there's no
21428 asm-specification. */
21432 /* Consume the `asm' token. */
21434 /* Look for the `('. */
21437 /* Look for the string-literal. */
21440 /* Look for the `)'. */
21444 }
21446 /* Parse an asm-operand-list.
21448 asm-operand-list:
21449 asm-operand
21450 asm-operand-list , asm-operand
21452 asm-operand:
21453 string-literal ( expression )
21454 [ string-literal ] string-literal ( expression )
21456 Returns a TREE_LIST representing the operands. The TREE_VALUE of
21457 each node is the expression. The TREE_PURPOSE is itself a
21458 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
21459 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
21460 is a STRING_CST for the string literal before the parenthesis. Returns
21461 ERROR_MARK_NODE if any of the operands are invalid. */
21463 static tree
21465 {
21470 {
21471 tree string_literal;
21472 tree expression;
21473 tree name;
21476 {
21477 /* Consume the `[' token. */
21479 /* Read the operand name. */
21484 /* Look for the closing `]'. */
21486 }
21487 else
21489 /* Look for the string-literal. */
21492 /* Look for the `('. */
21494 /* Parse the expression. */
21496 /* Look for the `)'. */
21504 /* Add this operand to the list. */
21506 expression,
21507 asm_operands);
21508 /* If the next token is not a `,', there are no more
21509 operands. */
21512 /* Consume the `,'. */
21514 }
21517 }
21519 /* Parse an asm-clobber-list.
21521 asm-clobber-list:
21522 string-literal
21523 asm-clobber-list , string-literal
21525 Returns a TREE_LIST, indicating the clobbers in the order that they
21526 appeared. The TREE_VALUE of each node is a STRING_CST. */
21528 static tree
21530 {
21534 {
21535 tree string_literal;
21537 /* Look for the string literal. */
21539 /* Add it to the list. */
21541 /* If the next token is not a `,', then the list is
21542 complete. */
21545 /* Consume the `,' token. */
21547 }
21550 }
21552 /* Parse an asm-label-list.
21554 asm-label-list:
21555 identifier
21556 asm-label-list , identifier
21558 Returns a TREE_LIST, indicating the labels in the order that they
21559 appeared. The TREE_VALUE of each node is a label. */
21561 static tree
21563 {
21567 {
21570 /* Look for the identifier. */
21573 {
21576 {
21582 }
21583 }
21584 /* If the next token is not a `,', then the list is
21585 complete. */
21588 /* Consume the `,' token. */
21590 }
21593 }
21595 /* Return TRUE iff the next tokens in the stream are possibly the
21596 beginning of a GNU extension attribute. */
21598 static bool
21600 {
21602 }
21604 /* Return TRUE iff the next tokens in the stream are possibly the
21605 beginning of a standard C++-11 attribute specifier. */
21607 static bool
21609 {
21611 }
21613 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21614 beginning of a standard C++-11 attribute specifier. */
21616 static bool
21618 {
21626 }
21628 /* Return TRUE iff the next Nth tokens in the stream are possibly the
21629 beginning of a GNU extension attribute. */
21631 static bool
21633 {
21637 }
21639 /* Return true iff the next tokens can be the beginning of either a
21640 GNU attribute list, or a standard C++11 attribute sequence. */
21642 static bool
21644 {
21647 }
21649 /* Return true iff the next Nth tokens can be the beginning of either
21650 a GNU attribute list, or a standard C++11 attribute sequence. */
21652 static bool
21654 {
21657 }
21659 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
21660 of GNU attributes, or return NULL. */
21662 static tree
21664 {
21668 }
21670 /* Parse an (optional) series of attributes.
21672 attributes:
21673 attributes attribute
21675 attribute:
21676 __attribute__ (( attribute-list [opt] ))
21678 The return value is as for cp_parser_gnu_attribute_list. */
21680 static tree
21682 {
21686 {
21688 tree attribute_list;
21691 /* Peek at the next token. */
21693 /* If it's not `__attribute__', then we're done. */
21697 /* Consume the `__attribute__' keyword. */
21699 /* Look for the two `(' tokens. */
21703 /* Peek at the next token. */
21706 /* Parse the attribute-list. */
21708 else
21709 /* If the next token is a `)', then there is no attribute
21710 list. */
21713 /* Look for the two `)' tokens. */
21721 /* Add these new attributes to the list. */
21723 }
21726 }
21728 /* Parse a GNU attribute-list.
21730 attribute-list:
21731 attribute
21732 attribute-list , attribute
21734 attribute:
21735 identifier
21736 identifier ( identifier )
21737 identifier ( identifier , expression-list )
21738 identifier ( expression-list )
21740 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
21741 to an attribute. The TREE_PURPOSE of each node is the identifier
21742 indicating which attribute is in use. The TREE_VALUE represents
21743 the arguments, if any. */
21745 static tree
21747 {
21753 {
21755 tree identifier;
21756 tree attribute;
21758 /* Look for the identifier. We also allow keywords here; for
21759 example `__attribute__ ((const))' is legal. */
21763 {
21766 /* Consume the token. */
21769 /* Save away the identifier that indicates which attribute
21770 this is. */
21772 /* For keywords, use the canonical spelling, not the
21773 parsed identifier. */
21779 /* Peek at the next token. */
21781 /* If it's an `(', then parse the attribute arguments. */
21783 {
21787 vec = cp_parser_parenthesized_expression_list
21793 else
21794 {
21797 }
21798 /* Save the arguments away. */
21800 }
21803 {
21804 /* Add this attribute to the list. */
21807 }
21810 }
21811 /* Now, look for more attributes. If the next token isn't a
21812 `,', we're done. */
21816 /* Consume the comma and keep going. */
21818 }
21821 /* We built up the list in reverse order. */
21823 }
21825 /* Parse a standard C++11 attribute.
21827 The returned representation is a TREE_LIST which TREE_PURPOSE is
21828 the scoped name of the attribute, and the TREE_VALUE is its
21829 arguments list.
21831 Note that the scoped name of the attribute is itself a TREE_LIST
21832 which TREE_PURPOSE is the namespace of the attribute, and
21833 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
21834 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
21835 and which TREE_PURPOSE is directly the attribute name.
21837 Clients of the attribute code should use get_attribute_namespace
21838 and get_attribute_name to get the actual namespace and name of
21839 attributes, regardless of their being GNU or C++11 attributes.
21841 attribute:
21842 attribute-token attribute-argument-clause [opt]
21844 attribute-token:
21845 identifier
21846 attribute-scoped-token
21848 attribute-scoped-token:
21849 attribute-namespace :: identifier
21851 attribute-namespace:
21852 identifier
21854 attribute-argument-clause:
21855 ( balanced-token-seq )
21857 balanced-token-seq:
21858 balanced-token [opt]
21859 balanced-token-seq balanced-token
21861 balanced-token:
21862 ( balanced-token-seq )
21863 [ balanced-token-seq ]
21864 { balanced-token-seq }. */
21866 static tree
21868 {
21872 /* First, parse name of the the attribute, a.k.a
21873 attribute-token. */
21890 {
21891 /* We are seeing a scoped attribute token. */
21901 else
21902 {
21906 }
21908 NULL_TREE);
21910 }
21911 else
21912 {
21914 NULL_TREE);
21915 /* C++11 noreturn attribute is equivalent to GNU's. */
21918 /* C++14 deprecated attribute is equivalent to GNU's. */
21921 }
21923 /* Now parse the optional argument clause of the attribute. */
21928 {
21934 /* A GNU attribute that takes an identifier in parameter. */
21937 vec = cp_parser_parenthesized_expression_list
21943 else
21944 {
21947 }
21951 else
21953 }
21956 }
21958 /* Parse a list of standard C++-11 attributes.
21960 attribute-list:
21961 attribute [opt]
21962 attribute-list , attribute[opt]
21963 attribute ...
21964 attribute-list , attribute ...
21965 */
21967 static tree
21969 {
21974 {
21979 {
21982 }
21987 }
21990 }
21992 /* Parse a standard C++-11 attribute specifier.
21994 attribute-specifier:
21995 [ [ attribute-list ] ]
21996 alignment-specifier
21998 alignment-specifier:
21999 alignas ( type-id ... [opt] )
22000 alignas ( alignment-expression ... [opt] ). */
22002 static tree
22004 {
22010 {
22019 else
22020 /* Warn about parsing c++11 attribute in non-c++1 mode, only
22021 when we are sure that we have actually parsed them. */
22023 }
22024 else
22025 {
22026 tree alignas_expr;
22028 /* Look for an alignment-specifier. */
22040 {
22043 }
22049 {
22053 alignas_expr =
22061 }
22064 {
22067 }
22071 /* Build the C++-11 representation of an 'aligned'
22072 attribute. */
22073 attributes =
22077 }
22080 }
22082 /* Parse a standard C++-11 attribute-specifier-seq.
22084 attribute-specifier-seq:
22085 attribute-specifier-seq [opt] attribute-specifier
22086 */
22088 static tree
22090 {
22094 {
22103 }
22107 }
22109 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
22110 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
22111 current value of the PEDANTIC flag, regardless of whether or not
22112 the `__extension__' keyword is present. The caller is responsible
22113 for restoring the value of the PEDANTIC flag. */
22115 static bool
22117 {
22118 /* Save the old value of the PEDANTIC flag. */
22122 {
22123 /* Consume the `__extension__' token. */
22125 /* We're not being pedantic while the `__extension__' keyword is
22126 in effect. */
22130 }
22133 }
22135 /* Parse a label declaration.
22137 label-declaration:
22138 __label__ label-declarator-seq ;
22140 label-declarator-seq:
22141 identifier , label-declarator-seq
22142 identifier */
22144 static void
22146 {
22147 /* Look for the `__label__' keyword. */
22151 {
22152 tree identifier;
22154 /* Look for an identifier. */
22156 /* If we failed, stop. */
22159 /* Declare it as a label. */
22161 /* If the next token is a `;', stop. */
22164 /* Look for the `,' separating the label declarations. */
22166 }
22168 /* Look for the final `;'. */
22170 }
22172 // -------------------------------------------------------------------------- //
22173 // Requires Clause
22175 // Parse a requires clause.
22176 //
22177 // requires-clause:
22178 // 'requires' logical-or-expression
22179 //
22180 // The required logical-or-expression must be a constant expression.
22181 static tree
22183 {
22184 // Parse the constant expression.
22185 tree expr =
22190 }
22192 // Optionally parse a requires clause:
22193 //
22194 // requires-clause:
22195 // 'requires' logical-or-expression
22196 //
22197 // The required logical-or-expression must be a constant expression.
22198 static tree
22200 {
22205 }
22208 // -------------------------------------------------------------------------- //
22209 // Requires Expression
22212 // An RAII helper that provides scoped control for entering and exiting
22213 // the local scope defined by a requires expression. Name bindings introduced
22214 // within the scope are popped prior to exiting the scope.
22215 struct cp_parser_requires_expr_scope
22216 {
22217 // Enter a scope of kind K belonging to the decl D.
22219 {
22221 }
22224 {
22228 }
22229 };
22231 // Parse a requires expression
22232 //
22233 // requirement-expression:
22234 // 'requires' requirement-parameter-list requirement-body
22235 static tree
22237 {
22241 // TODO: Earlier versions of the concepts lite spec did not allow
22242 // requires expressions outside of template declarations. That
22243 // restriction was relaxed in Chicago, but it has not been implemented.
22245 {
22249 }
22252 // TODO: Check that requires expressions are only written inside of
22253 // template declarations. They don't need to be concepts, just templates.
22255 // Parse the optional parameter list. Any local parameter declarations
22256 // are added to a new scope and are visible within the nested
22257 // requirement list.
22258 cp_parser_requires_expr_scope guard;
22263 // Parse the requirement body.
22269 }
22271 // Parse a parameterized requirement.
22272 //
22273 // requirement-parameter-list:
22274 // '(' parameter-declaration-clause ')'
22275 static tree
22277 {
22281 // Parse the nested parameter declaration clause.
22290 }
22292 // Parse the body of a requirement.
22293 //
22294 // requirement-body:
22295 // '{' requirement-list '}'
22296 static tree
22298 {
22308 }
22310 // Parse a list of requirements.
22311 //
22312 // requirement-list:
22313 // requirement
22314 // requirement-list ';' requirement[opt]
22315 static tree
22317 {
22320 {
22327 // If we see a semi-colon, consume it.
22331 // If we've found the end of the list, stop processing
22332 // the list.
22335 }
22337 // Reverse the order of requirements so they are analyzed in
22338 // declaration order.
22340 }
22342 // Parse a syntactic requirement or type requirement.
22343 //
22344 // requirement:
22345 // simple-requirement
22346 // compound-requirement
22347 // type-requirement
22348 // nested-requirement
22349 static tree
22351 {
22358 // Try parsing a type requirement first.
22364 }
22366 // Parse a nested requirement. This is the same as a requires clause.
22367 //
22368 // nested-requirement:
22369 // requires-clause
22370 static tree
22372 {
22378 }
22380 // Parse a simple requirement.
22381 //
22382 // simple-requirement:
22383 // expression
22384 static tree
22386 {
22391 }
22393 // Parse a compound requirement
22394 //
22395 // compound-requirement:
22396 // '{' expression '}' trailing-constraint-specifiers
22397 //
22398 // trailing-constraint-specifiers:
22399 // constraint-specifiers-seq[opt] result-type-requirement[opt]
22400 //
22401 // result-type-requirement:
22402 // '->' type-id
22403 static tree
22405 {
22406 // Parse an expression enclosed in '{ }'s.
22417 // Parse trailing expression specifiers.
22420 // Parse the optional trailing type requirement.
22423 {
22428 }
22431 }
22433 // Parse a type requirement
22434 //
22435 // type-requirement
22436 // type-id
22437 static tree
22439 {
22440 // Try parsing the type-id
22445 // It can only be a type requirement if nothing comes after it.
22446 // For example, this:
22447 //
22448 // typename T::value_type x = a;
22449 //
22450 // Is not a type requirement even though it stars with a type-id.
22455 }
22457 // Parse an optional constexpr specifier in a constraint expression.
22458 static tree
22460 {
22463 }
22465 // Parse an optional noexcept specifier in a constraint expression.
22466 static tree
22468 {
22471 }
22473 static tree
22475 {
22481 }
22483 // Parse an optional expression specifier sequence.
22484 //
22485 // constraint-specifier-sequence:
22486 // constexpr [opt] noexcept [opt]
22487 static tree
22489 {
22492 {
22493 // If we can parse a constraint specifier, insert it into
22494 // the list of requirements.
22496 {
22499 }
22501 }
22503 }
22505 /* Support Functions */
22507 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
22508 NAME should have one of the representations used for an
22509 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
22510 is returned. If PARSER->SCOPE is a dependent type, then a
22511 SCOPE_REF is returned.
22513 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
22514 returned; the name was already resolved when the TEMPLATE_ID_EXPR
22515 was formed. Abstractly, such entities should not be passed to this
22516 function, because they do not need to be looked up, but it is
22517 simpler to check for this special case here, rather than at the
22518 call-sites.
22520 In cases not explicitly covered above, this function returns a
22521 DECL, OVERLOAD, or baselink representing the result of the lookup.
22522 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
22523 is returned.
22525 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
22526 (e.g., "struct") that was used. In that case bindings that do not
22527 refer to types are ignored.
22529 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
22530 ignored.
22532 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
22533 are ignored.
22535 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
22536 types.
22538 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
22539 TREE_LIST of candidates if name-lookup results in an ambiguity, and
22540 NULL_TREE otherwise. */
22542 static tree
22549 location_t name_location)
22550 {
22551 tree decl;
22554 /* Assume that the lookup will be unambiguous. */
22558 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
22559 no longer valid. Note that if we are parsing tentatively, and
22560 the parse fails, OBJECT_TYPE will be automatically restored. */
22566 /* A template-id has already been resolved; there is no lookup to
22567 do. */
22571 {
22575 }
22577 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
22578 it should already have been checked to make sure that the name
22579 used matches the type being destroyed. */
22581 {
22582 tree type;
22584 /* Figure out to which type this destructor applies. */
22589 else
22591 /* If that's not a class type, there is no destructor. */
22598 /* If it was a class type, return the destructor. */
22600 }
22602 /* By this point, the NAME should be an ordinary identifier. If
22603 the id-expression was a qualified name, the qualifying scope is
22604 stored in PARSER->SCOPE at this point. */
22607 /* Perform the lookup. */
22609 {
22615 /* If the SCOPE is dependent, the lookup must be deferred until
22616 the template is instantiated -- unless we are explicitly
22617 looking up names in uninstantiated templates. Even then, we
22618 cannot look up the name if the scope is not a class type; it
22619 might, for example, be a template type parameter. */
22624 /* Defer lookup. */
22626 else
22627 {
22630 /* If PARSER->SCOPE is a dependent type, then it must be a
22631 class type, and we must not be checking dependencies;
22632 otherwise, we would have processed this lookup above. So
22633 that PARSER->SCOPE is not considered a dependent base by
22634 lookup_member, we must enter the scope here. */
22638 /* If the PARSER->SCOPE is a template specialization, it
22639 may be instantiated during name lookup. In that case,
22640 errors may be issued. Even if we rollback the current
22641 tentative parse, those errors are valid. */
22646 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
22647 lookup result and the nested-name-specifier nominates a class C:
22648 * if the name specified after the nested-name-specifier, when
22649 looked up in C, is the injected-class-name of C (Clause 9), or
22650 * if the name specified after the nested-name-specifier is the
22651 same as the identifier or the simple-template-id's template-
22652 name in the last component of the nested-name-specifier,
22653 the name is instead considered to name the constructor of
22654 class C. [ Note: for example, the constructor is not an
22655 acceptable lookup result in an elaborated-type-specifier so
22656 the constructor would not be used in place of the
22657 injected-class-name. --end note ] Such a constructor name
22658 shall be used only in the declarator-id of a declaration that
22659 names a constructor or in a using-declaration. */
22667 /* If we have a single function from a using decl, pull it out. */
22674 }
22676 /* If the scope is a dependent type and either we deferred lookup or
22677 we did lookup but didn't find the name, rememeber the name. */
22680 {
22682 {
22683 tree type;
22685 /* The resolution to Core Issue 180 says that `struct
22686 A::B' should be considered a type-name, even if `A'
22687 is dependent. */
22692 }
22696 CPP_CLOSE_PAREN)))
22700 else
22703 is_template);
22704 }
22707 }
22709 {
22710 /* Look up the name in the scope of the OBJECT_TYPE, unless the
22711 OBJECT_TYPE is not a class. */
22713 /* If the OBJECT_TYPE is a template specialization, it may
22714 be instantiated during name lookup. In that case, errors
22715 may be issued. Even if we rollback the current tentative
22716 parse, those errors are valid. */
22718 name,
22721 tf_warning_or_error);
22722 else
22726 /* Look it up in the enclosing context. */
22732 }
22733 else
22734 {
22740 }
22742 /* If the lookup failed, let our caller know. */
22746 /* Pull out the template from an injected-class-name (or multiple). */
22750 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
22752 {
22755 /* The error message we have to print is too complicated for
22756 cp_parser_error, so we incorporate its actions directly. */
22758 {
22760 name);
22762 }
22764 }
22772 /* If we have resolved the name of a member declaration, check to
22773 see if the declaration is accessible. When the name resolves to
22774 set of overloaded functions, accessibility is checked when
22775 overload resolution is done.
22777 During an explicit instantiation, access is not checked at all,
22778 as per [temp.explicit]. */
22785 }
22787 /* Like cp_parser_lookup_name, but for use in the typical case where
22788 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
22789 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
22791 static tree
22793 {
22795 none_type,
22800 location);
22801 }
22803 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
22804 the current context, return the TYPE_DECL. If TAG_NAME_P is
22805 true, the DECL indicates the class being defined in a class-head,
22806 or declared in an elaborated-type-specifier.
22808 Otherwise, return DECL. */
22810 static tree
22812 {
22813 /* If the TEMPLATE_DECL is being declared as part of a class-head,
22814 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
22816 struct A {
22817 template <typename T> struct B;
22818 };
22820 template <typename T> struct A::B {};
22822 Similarly, in an elaborated-type-specifier:
22824 namespace N { struct X{}; }
22826 struct A {
22827 template <typename T> friend struct N::X;
22828 };
22830 However, if the DECL refers to a class type, and we are in
22831 the scope of the class, then the name lookup automatically
22832 finds the TYPE_DECL created by build_self_reference rather
22833 than a TEMPLATE_DECL. For example, in:
22835 template <class T> struct S {
22836 S s;
22837 };
22839 there is no need to handle such case. */
22845 }
22847 /* If too many, or too few, template-parameter lists apply to the
22848 declarator, issue an error message. Returns TRUE if all went well,
22849 and FALSE otherwise. */
22851 static bool
22854 location_t declarator_location)
22855 {
22857 {
22859 {
22867 /* If the DECLARATOR has the form `X<y>' then it uses one
22868 additional level of template parameters. */
22871 return cp_parser_check_template_parameters
22873 }
22888 }
22890 }
22892 /* NUM_TEMPLATES were used in the current declaration. If that is
22893 invalid, return FALSE and issue an error messages. Otherwise,
22894 return TRUE. If DECLARATOR is non-NULL, then we are checking a
22895 declarator and we can print more accurate diagnostics. */
22897 static bool
22900 location_t location,
22902 {
22903 /* If there are the same number of template classes and parameter
22904 lists, that's OK. */
22907 /* If there are more, but only one more, then we are referring to a
22908 member template. That's OK too. */
22911 /* If there are more template classes than parameter lists, we have
22912 something like:
22914 template <class T> void S<T>::R<T>::f (); */
22916 {
22926 else
22929 }
22930 /* Otherwise, there are too many template parameter lists. We have
22931 something like:
22933 template <class T> template <class U> void S::f(); */
22936 }
22938 /* Parse an optional `::' token indicating that the following name is
22939 from the global namespace. If so, PARSER->SCOPE is set to the
22940 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
22941 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
22942 Returns the new value of PARSER->SCOPE, if the `::' token is
22943 present, and NULL_TREE otherwise. */
22945 static tree
22947 {
22950 /* Peek at the next token. */
22952 /* If we're looking at a `::' token then we're starting from the
22953 global namespace, not our current location. */
22955 {
22956 /* Consume the `::' token. */
22958 /* Set the SCOPE so that we know where to start the lookup. */
22964 }
22966 {
22970 }
22973 }
22975 /* Returns TRUE if the upcoming token sequence is the start of a
22976 constructor declarator. If FRIEND_P is true, the declarator is
22977 preceded by the `friend' specifier. */
22979 static bool
22981 {
22984 tree nested_name_specifier;
22987 /* The common case is that this is not a constructor declarator, so
22988 try to avoid doing lots of work if at all possible. It's not
22989 valid declare a constructor at function scope. */
22992 /* And only certain tokens can begin a constructor declarator. */
23000 /* Parse tentatively; we are going to roll back all of the tokens
23001 consumed here. */
23003 /* Assume that we are looking at a constructor declarator. */
23006 /* Look for the optional `::' operator. */
23009 /* Look for the nested-name-specifier. */
23010 nested_name_specifier
23021 /* Outside of a class-specifier, there must be a
23022 nested-name-specifier. */
23028 /* If we have a class scope, this is easy; DR 147 says that S::S always
23029 names the constructor, and no other qualified name could. */
23032 {
23042 }
23043 /* If we still think that this might be a constructor-declarator,
23044 look for a class-name. */
23046 {
23047 /* If we have:
23049 template <typename T> struct S {
23050 S();
23051 };
23053 we must recognize that the nested `S' names a class. */
23054 tree type_decl;
23058 none_type,
23062 /* If there was no class-name, then this is not a constructor.
23063 Otherwise, if we are in a class-specifier and we aren't
23064 handling a friend declaration, check that its type matches
23065 current_class_type (c++/38313). Note: error_mark_node
23066 is left alone for error recovery purposes. */
23068 && (outside_class_specifier_p
23073 /* If we're still considering a constructor, we have to see a `(',
23074 to begin the parameter-declaration-clause, followed by either a
23075 `)', an `...', or a decl-specifier. We need to check for a
23076 type-specifier to avoid being fooled into thinking that:
23078 S (f) (int);
23080 is a constructor. (It is actually a function named `f' that
23081 takes one parameter (of type `int') and returns a value of type
23082 `S'. */
23090 /* A parameter declaration begins with a decl-specifier,
23091 which is either the "attribute" keyword, a storage class
23092 specifier, or (usually) a type-specifier. */
23094 {
23095 tree type;
23099 /* Names appearing in the type-specifier should be looked up
23100 in the scope of the class. */
23103 else
23104 {
23107 {
23111 {
23114 }
23115 }
23117 }
23119 /* Inside the constructor parameter list, surrounding
23120 template-parameter-lists do not apply. */
23121 saved_num_template_parameter_lists
23125 /* Look for the type-specifier. */
23127 CP_PARSER_FLAGS_NONE,
23133 parser->num_template_parameter_lists
23136 /* Leave the scope of the class. */
23141 }
23142 }
23144 /* We did not really want to consume any tokens. */
23148 }
23150 /* Parse the definition of the function given by the DECL_SPECIFIERS,
23151 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
23152 they must be performed once we are in the scope of the function.
23154 Returns the function defined. */
23156 static tree
23157 cp_parser_function_definition_from_specifiers_and_declarator
23160 tree attributes,
23162 {
23163 tree fn;
23166 /* Begin the function-definition. */
23169 /* The things we're about to see are not directly qualified by any
23170 template headers we've seen thus far. */
23173 /* If there were names looked up in the decl-specifier-seq that we
23174 did not check, check them now. We must wait until we are in the
23175 scope of the function to perform the checks, since the function
23176 might be a friend. */
23180 {
23183 }
23186 {
23187 /* Skip the entire function. */
23190 }
23192 {
23193 /* Seen already, skip it. An error message has already been output. */
23197 /* If this is a function from a class, pop the nested class. */
23200 }
23201 else
23202 {
23203 timevar_id_t tv;
23206 else
23212 }
23215 }
23217 /* Parse the part of a function-definition that follows the
23218 declarator. INLINE_P is TRUE iff this function is an inline
23219 function defined within a class-specifier.
23221 Returns the function defined. */
23223 static tree
23226 {
23227 tree fn;
23233 bool fully_implicit_function_template_p
23236 tree implicit_template_parms
23239 cp_binding_level* implicit_template_scope
23245 /* If the next token is `return', then the code may be trying to
23246 make use of the "named return value" extension that G++ used to
23247 support. */
23250 {
23251 /* Consume the `return' keyword. */
23253 /* Look for the identifier that indicates what value is to be
23254 returned. */
23256 /* Issue an error message. */
23259 /* Skip tokens until we reach the start of the function body. */
23261 {
23268 }
23269 }
23270 /* The `extern' in `extern "C" void f () { ... }' does not apply to
23271 anything declared inside `f'. */
23272 saved_in_unbraced_linkage_specification_p
23275 /* Inside the function, surrounding template-parameter-lists do not
23276 apply. */
23277 saved_num_template_parameter_lists
23283 /* If the next token is `try', `__transaction_atomic', or
23284 `__transaction_relaxed`, then we are looking at either function-try-block
23285 or function-transaction-block. Note that all of these include the
23286 function-body. */
23289 RID_TRANSACTION_ATOMIC);
23291 RID_TRANSACTION_RELAXED))
23293 RID_TRANSACTION_RELAXED);
23296 else
23297 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
23302 /* Finish the function. */
23305 /* Generate code for it, if necessary. */
23307 /* Restore the saved values. */
23308 parser->in_unbraced_linkage_specification_p
23310 parser->num_template_parameter_lists
23314 parser->fully_implicit_function_template_p
23316 parser->implicit_template_parms
23318 parser->implicit_template_scope
23322 // Attach implicit constraints to the function template.
23327 }
23330 }
23332 /* Parse a template-declaration, assuming that the `export' (and
23333 `extern') keywords, if present, has already been scanned. MEMBER_P
23334 is as for cp_parser_template_declaration. */
23336 static void
23338 {
23341 tree parameter_list;
23346 /* Look for the `template' keyword. */
23351 /* And the `<'. */
23355 {
23356 /* 14.5.2.2 [temp.mem]
23358 A local class shall not have member templates. */
23363 }
23364 /* [temp]
23366 A template ... shall not have C linkage. */
23368 {
23370 /* Give it C++ linkage to avoid confusing other parts of the
23371 front end. */
23374 }
23375 else
23378 /* We cannot perform access checks on the template parameter
23379 declarations until we know what is being declared, just as we
23380 cannot check the decl-specifier list. */
23383 // Save the current template requirements.
23386 /* If the next token is `>', then we have an invalid
23387 specialization. Rather than complain about an invalid template
23388 parameter, issue an error message here. */
23390 {
23394 }
23395 else
23396 {
23397 /* Parse the template parameters. */
23399 }
23401 /* Get the deferred access checks from the parameter list. These
23402 will be checked once we know what is being declared, as for a
23403 member template the checks must be performed in the scope of the
23404 class containing the member. */
23407 /* Look for the `>'. */
23409 /* We just processed one more parameter list. */
23412 // Manage template requirements
23414 {
23420 // Attach the constraints to the template parameter list.
23423 }
23425 /* If the next token is `template', there are more template
23426 parameters. */
23428 RID_TEMPLATE))
23433 else
23434 {
23435 /* There are no access checks when parsing a template, as we do not
23436 know if a specialization will be a friend. */
23440 checks,
23441 member_p,
23446 /* If this is a member template declaration, let the front
23447 end know. */
23449 {
23454 }
23459 }
23460 /* We are done with the current parameter list. */
23465 /* Finish up. */
23468 // Restore the current template requirements.
23471 /* Check the template arguments for a literal operator template. */
23475 {
23479 else
23480 {
23483 {
23489 }
23491 {
23499 }
23500 else
23502 }
23505 " Expected non-type template argument pack <char...>"
23507 decl);
23508 }
23509 /* Register member declarations. */
23512 /* For the erroneous case of a template with C linkage, we pushed an
23513 implicit C++ linkage scope; exit that scope now. */
23516 /* If DECL is a function template, we must return to parse it later.
23517 (Even though there is no definition, there might be default
23518 arguments that need handling.) */
23522 }
23524 /* Perform the deferred access checks from a template-parameter-list.
23525 CHECKS is a TREE_LIST of access checks, as returned by
23526 get_deferred_access_checks. */
23528 static void
23529 cp_parser_perform_template_parameter_access_checks (vec<deferred_access_check, va_gc> *checks)
23530 {
23534 }
23536 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
23537 `function-definition' sequence that follows a template header.
23538 If MEMBER_P is true, this declaration appears in a class scope.
23540 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
23541 *FRIEND_P is set to TRUE iff the declaration is a friend. */
23543 static tree
23549 {
23552 cp_decl_specifier_seq decl_specifiers;
23556 /* This function is only used when processing a template
23557 declaration. */
23561 /* Defer access checks until we know what is being declared. */
23564 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
23565 alternative. */
23568 CP_PARSER_FLAGS_OPTIONAL,
23574 /* There are no template typedefs. */
23576 {
23580 }
23582 /* Gather up the access checks that occurred the
23583 decl-specifier-seq. */
23586 /* Check for the declaration of a template class. */
23588 {
23590 {
23593 /* In this case:
23595 struct C {
23596 friend template <typename T> struct A<T>::B;
23597 };
23599 A<T>::B will be represented by a TYPENAME_TYPE, and
23600 therefore not recognized by shadow_tag. */
23602 && !decl
23609 else
23612 /* Perform access checks for template parameters. */
23614 }
23615 }
23617 /* Complain about missing 'typename' or other invalid type names. */
23620 {
23621 /* cp_parser_parse_and_diagnose_invalid_type_name calls
23622 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
23623 the rest of this declaration. */
23626 }
23628 /* If it's not a template class, try for a template function. If
23629 the next token is a `;', then this declaration does not declare
23630 anything. But, if there were errors in the decl-specifiers, then
23631 the error might well have come from an attempted class-specifier.
23632 In that case, there's no need to warn about a missing declarator. */
23636 {
23639 checks,
23641 member_p,
23642 declares_class_or_enum,
23644 NULL);
23646 /* 7.1.1-1 [dcl.stc]
23648 A storage-class-specifier shall not be specified in an explicit
23649 specialization... */
23651 && explicit_specialization_p
23653 {
23657 }
23661 }
23663 /* Look for a trailing `;' after the declaration. */
23669 out:
23672 /* Clear any current qualification; whatever comes next is the start
23673 of something new. */
23679 }
23681 /* Parse a cast-expression that is not the operand of a unary "&". */
23683 static tree
23685 {
23688 }
23690 /* Parse a functional cast to TYPE. Returns an expression
23691 representing the cast. */
23693 static tree
23695 {
23697 tree expression_list;
23698 tree cast;
23702 {
23709 tf_warning_or_error);
23710 }
23719 else
23720 {
23723 }
23726 tf_warning_or_error);
23727 /* [expr.const]/1: In an integral constant expression "only type
23728 conversions to integral or enumeration type can be used". */
23734 NIC_CONSTRUCTOR))
23737 }
23739 /* Save the tokens that make up the body of a member function defined
23740 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
23741 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
23742 specifiers applied to the declaration. Returns the FUNCTION_DECL
23743 for the member function. */
23745 static tree
23749 tree attributes)
23750 {
23753 tree fn;
23755 /* Create the FUNCTION_DECL. */
23758 /* If something went badly wrong, bail out now. */
23760 {
23761 /* If there's a function-body, skip it. */
23766 }
23768 /* Remember it, if there default args to post process. */
23771 /* Save away the tokens that make up the body of the
23772 function. */
23774 /* Handle function try blocks. */
23777 /* We can have braced-init-list mem-initializers before the fn body. */
23779 {
23782 {
23783 /* cache_group will stop after an un-nested { } pair, too. */
23787 /* variadic mem-inits have ... after the ')'. */
23790 }
23791 }
23793 /* Handle function try blocks. */
23798 /* Save away the inline definition; we will process it when the
23799 class is complete. */
23803 /* We need to know that this was defined in the class, so that
23804 friend templates are handled correctly. */
23807 /* Add FN to the queue of functions to be parsed later. */
23811 }
23813 /* Save the tokens that make up the in-class initializer for a non-static
23814 data member. Returns a DEFAULT_ARG. */
23816 static tree
23818 {
23820 }
23822 /* Parse a template-argument-list, as well as the trailing ">" (but
23823 not the opening "<"). See cp_parser_template_argument_list for the
23824 return value. */
23826 static tree
23828 {
23829 tree arguments;
23830 tree saved_scope;
23831 tree saved_qualifying_scope;
23832 tree saved_object_scope;
23837 /* [temp.names]
23839 When parsing a template-id, the first non-nested `>' is taken as
23840 the end of the template-argument-list rather than a greater-than
23841 operator. */
23842 saved_greater_than_is_operator_p
23845 /* Parsing the argument list may modify SCOPE, so we save it
23846 here. */
23850 /* We need to evaluate the template arguments, even though this
23851 template-id may be nested within a "sizeof". */
23856 /* Parse the template-argument-list itself. */
23860 else
23862 /* Look for the `>' that ends the template-argument-list. If we find
23863 a '>>' instead, it's probably just a typo. */
23865 {
23867 {
23868 /* In C++0x, a `>>' in a template argument list or cast
23869 expression is considered to be two separate `>'
23870 tokens. So, change the current token to a `>', but don't
23871 consume it: it will be consumed later when the outer
23872 template argument list (or cast expression) is parsed.
23873 Note that this replacement of `>' for `>>' is necessary
23874 even if we are parsing tentatively: in the tentative
23875 case, after calling
23876 cp_parser_enclosed_template_argument_list we will always
23877 throw away all of the template arguments and the first
23878 closing `>', either because the template argument list
23879 was erroneous or because we are replacing those tokens
23880 with a CPP_TEMPLATE_ID token. The second `>' (which will
23881 not have been thrown away) is needed either to close an
23882 outer template argument list or to complete a new-style
23883 cast. */
23886 }
23888 {
23889 /* If we're in a nested template argument list, the '>>' has
23890 to be a typo for '> >'. We emit the error message, but we
23891 continue parsing and we push a '>' as next token, so that
23892 the argument list will be parsed correctly. Note that the
23893 global source location is still on the token before the
23894 '>>', so we need to say explicitly where we want it. */
23900 }
23901 else
23902 {
23903 /* If this is not a nested template argument list, the '>>'
23904 is a typo for '>'. Emit an error message and continue.
23905 Same deal about the token location, but here we can get it
23906 right by consuming the '>>' before issuing the diagnostic. */
23909 "spurious %<>>%>, use %<>%> to terminate "
23911 }
23912 }
23913 else
23915 /* The `>' token might be a greater-than operator again now. */
23916 parser->greater_than_is_operator_p
23918 /* Restore the SAVED_SCOPE. */
23926 }
23928 /* MEMBER_FUNCTION is a member function, or a friend. If default
23929 arguments, or the body of the function have not yet been parsed,
23930 parse them now. */
23932 static void
23934 {
23936 /* If this member is a template, get the underlying
23937 FUNCTION_DECL. */
23941 /* There should not be any class definitions in progress at this
23942 point; the bodies of members are only parsed outside of all class
23943 definitions. */
23945 /* While we're parsing the member functions we might encounter more
23946 classes. We want to handle them right away, but we don't want
23947 them getting mixed up with functions that are currently in the
23948 queue. */
23951 /* Make sure that any template parameters are in scope. */
23954 // Restore the declaration's requirements for the parsing of
23955 // the definition.
23956 //
23960 /* If the body of the function has not yet been parsed, parse it
23961 now. */
23963 {
23964 tree function_scope;
23967 /* The function is no longer pending; we are processing it. */
23972 /* If this is a local class, enter the scope of the containing
23973 function. */
23978 /* Push the body of the function onto the lexer stack. */
23981 /* Let the front end know that we going to be defining this
23982 function. */
23986 /* Don't do access checking if it is a templated function. */
23990 /* #pragma omp declare reduction needs special parsing. */
23992 {
23997 }
23998 else
23999 /* Now, parse the body of the function. */
24006 /* Leave the scope of the containing function. */
24010 }
24012 /* Remove any template parameters from the symbol table. */
24015 // Restore the template requirements.
24018 /* Restore the queue. */
24021 }
24023 /* If DECL contains any default args, remember it on the unparsed
24024 functions queue. */
24026 static void
24028 {
24029 tree probe;
24032 probe;
24035 {
24039 }
24040 }
24042 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
24043 which is either a FIELD_DECL or PARM_DECL. Parse it and return
24044 the result. For a PARM_DECL, PARMTYPE is the corresponding type
24045 from the parameter-type-list. */
24047 static tree
24050 {
24052 tree parsed_arg;
24058 /* Push the saved tokens for the default argument onto the parser's
24059 lexer stack. */
24065 /* Parse the default argument. */
24076 {
24077 /* In a non-template class, check conversions now. In a template,
24078 we'll wait and instantiate these as needed. */
24081 tf_warning_or_error);
24082 else
24083 {
24090 /* This represents the whole initialization. */
24092 }
24093 }
24095 /* If the token stream has not been completely used up, then
24096 there was extra junk after the end of the default
24097 argument. */
24099 {
24102 else
24104 }
24106 /* Revert to the main lexer. */
24110 }
24112 /* FIELD is a non-static data member with an initializer which we saved for
24113 later; parse it now. */
24115 static void
24117 {
24118 tree def;
24125 NULL_TREE);
24131 }
24133 /* FN is a FUNCTION_DECL which may contains a parameter with an
24134 unparsed DEFAULT_ARG. Parse the default args now. This function
24135 assumes that the current scope is the scope in which the default
24136 argument should be processed. */
24138 static void
24140 {
24144 /* While we're parsing the default args, we might (due to the
24145 statement expression extension) encounter more classes. We want
24146 to handle them right away, but we don't want them getting mixed
24147 up with default args that are currently in the queue. */
24150 /* Local variable names (and the `this' keyword) may not appear
24151 in a default argument. */
24162 {
24164 tree parsed_arg;
24166 tree copy;
24173 /* This can happen for a friend declaration for a function
24174 already declared with default arguments. */
24177 parsed_arg
24179 default_arg,
24182 {
24184 }
24188 /* Update any instantiations we've already created. */
24192 }
24196 /* Make sure no default arg is missing. */
24199 /* Restore the state of local_variables_forbidden_p. */
24202 /* Restore the queue. */
24204 }
24206 /* Subroutine of cp_parser_sizeof_operand, for handling C++11
24208 sizeof ... ( identifier )
24210 where the 'sizeof' token has already been consumed. */
24212 static tree
24214 {
24215 /* Consume the `...'. */
24222 else
24230 /* The name is not qualified. */
24248 }
24250 /* Parse the operand of `sizeof' (or a similar operator). Returns
24251 either a TYPE or an expression, depending on the form of the
24252 input. The KEYWORD indicates which kind of expression we have
24253 encountered. */
24255 static tree
24257 {
24264 /* If it's a `...', then we are computing the length of a parameter
24265 pack. */
24270 /* Types cannot be defined in a `sizeof' expression. Save away the
24271 old message. */
24273 /* And create the new one. */
24279 /* The restrictions on constant-expressions do not apply inside
24280 sizeof expressions. */
24281 saved_integral_constant_expression_p
24283 saved_non_integral_constant_expression_p
24287 /* Do not actually evaluate the expression. */
24290 /* If it's a `(', then we might be looking at the type-id
24291 construction. */
24293 {
24297 /* We can't be sure yet whether we're looking at a type-id or an
24298 expression. */
24300 /* Consume the `('. */
24302 /* Note: as a GNU Extension, compound literals are considered
24303 postfix-expressions as they are in C99, so they are valid
24304 arguments to sizeof. See comment in cp_parser_cast_expression
24305 for details. */
24307 /* Skip tokens until the next token is a closing parenthesis.
24308 If we find the closing `)', and the next token is a `{', then
24309 we are looking at a compound-literal. */
24310 compound_literal_p
24314 /* Roll back the tokens we skipped. */
24316 /* If we were looking at a compound-literal, simulate an error
24317 so that the call to cp_parser_parse_definitely below will
24318 fail. */
24321 else
24322 {
24325 /* Look for the type-id. */
24327 /* Look for the closing `)'. */
24330 }
24332 /* If all went well, then we're done. */
24334 {
24335 cp_decl_specifier_seq decl_specs;
24337 /* Build a trivial decl-specifier-seq. */
24341 /* Call grokdeclarator to figure out what type this is. */
24344 TYPENAME,
24347 }
24348 }
24350 /* If the type-id production did not work out, then we must be
24351 looking at the unary-expression production. */
24356 /* Go back to evaluating expressions. */
24360 /* Free the message we created. */
24362 /* And restore the old one. */
24364 parser->integral_constant_expression_p
24366 parser->non_integral_constant_expression_p
24370 }
24372 /* If the current declaration has no declarator, return true. */
24374 static bool
24376 {
24377 /* If the next token is a `;' or a `,' then there is no
24378 declarator. */
24381 }
24383 /* Update the DECL_SPECS to reflect the storage class indicated by
24384 KEYWORD. */
24386 static void
24391 {
24392 cp_storage_class storage_class;
24395 {
24399 }
24401 {
24404 }
24409 {
24412 }
24415 {
24433 }
24437 /* A storage class specifier cannot be applied alongside a typedef
24438 specifier. If there is a typedef specifier present then set
24439 conflicting_specifiers_p which will trigger an error later
24440 on in grokdeclarator. */
24443 }
24445 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
24446 is true, the type is a class or enum definition. */
24448 static void
24450 tree type_spec,
24453 {
24456 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
24457 (with, for example, in "typedef int wchar_t;") we remember that
24458 this is what happened. In system headers, we ignore these
24459 declarations so that G++ can work with system headers that are not
24460 C++-safe. */
24462 && !type_definition_p
24472 {
24475 ds_redefined_builtin_type_spec,
24476 token);
24478 {
24482 }
24483 }
24486 else
24487 {
24492 }
24493 }
24495 /* True iff TOKEN is the GNU keyword __thread. */
24497 static bool
24499 {
24502 }
24504 /* Set the location for a declarator specifier and check if it is
24505 duplicated.
24507 DECL_SPECS is the sequence of declarator specifiers onto which to
24508 set the location.
24510 DS is the single declarator specifier to set which location is to
24511 be set onto the existing sequence of declarators.
24513 LOCATION is the location for the declarator specifier to
24514 consider. */
24516 static void
24519 {
24528 {
24532 }
24533 else
24534 {
24536 {
24540 else
24541 {
24544 OPT_Wlong_long,
24546 }
24547 }
24549 {
24554 else
24556 }
24557 else
24558 {
24574 "__complex"
24575 };
24578 }
24579 }
24580 }
24582 /* Return true iff the declarator specifier DS is present in the
24583 sequence of declarator specifiers DECL_SPECS. */
24585 bool
24587 cp_decl_spec ds)
24588 {
24595 }
24597 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
24598 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
24600 static bool
24602 {
24604 }
24606 /* Issue an error message indicating that TOKEN_DESC was expected.
24607 If KEYWORD is true, it indicated this function is called by
24608 cp_parser_require_keword and the required token can only be
24609 a indicated keyword. */
24611 static void
24613 required_token token_desc,
24615 {
24617 {
24686 }
24688 {
24690 {
24769 }
24770 }
24771 else
24773 }
24777 /* If the next token is of the indicated TYPE, consume it. Otherwise,
24778 issue an error message indicating that TOKEN_DESC was expected.
24780 Returns the token consumed, if the token had the appropriate type.
24781 Otherwise, returns NULL. */
24786 required_token token_desc)
24787 {
24790 else
24791 {
24792 /* Output the MESSAGE -- unless we're parsing tentatively. */
24796 }
24797 }
24799 /* An error message is produced if the next token is not '>'.
24800 All further tokens are skipped until the desired token is
24801 found or '{', '}', ';' or an unbalanced ')' or ']'. */
24803 static void
24805 {
24806 /* Current level of '< ... >'. */
24808 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
24811 /* Are we ready, yet? If not, issue error message. */
24815 /* Skip tokens until the desired token is found. */
24817 {
24818 /* Peek at the next token. */
24820 {
24828 /* C++0x views the `>>' operator as two `>' tokens, but
24829 C++98 does not. */
24832 {
24833 /* We've hit a `>>' where the first `>' closes the
24834 template argument list, and the second `>' is
24835 spurious. Just consume the `>>' and stop; we've
24836 already produced at least one error. */
24839 }
24840 /* Fall through for C++0x, so we handle the second `>' in
24841 the `>>'. */
24845 {
24846 /* We've reached the token we want, consume it and stop. */
24849 }
24868 /* The '>' was probably forgotten, don't look further. */
24873 }
24875 /* Consume this token. */
24877 }
24878 }
24880 /* If the next token is the indicated keyword, consume it. Otherwise,
24881 issue an error message indicating that TOKEN_DESC was expected.
24883 Returns the token consumed, if the token had the appropriate type.
24884 Otherwise, returns NULL. */
24889 required_token token_desc)
24890 {
24894 {
24897 }
24900 }
24902 /* Returns TRUE iff TOKEN is a token that can begin the body of a
24903 function-definition. */
24905 static bool
24907 {
24910 /* A ctor-initializer begins with a `:'. */
24912 /* A function-try-block begins with `try'. */
24914 /* A function-transaction-block begins with `__transaction_atomic'
24915 or `__transaction_relaxed'. */
24918 /* The named return value extension begins with `return'. */
24920 }
24922 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
24923 definition. */
24925 static bool
24927 {
24934 }
24936 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
24937 C++0x) ending a template-argument. */
24939 static bool
24941 {
24949 }
24951 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
24952 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
24954 static bool
24957 {
24963 /* Check for the sequence `<::' in the original code. It would be lexed as
24964 `[:', where `[' is a digraph, and there is no whitespace before
24965 `:'. */
24967 {
24972 }
24974 }
24976 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
24977 or none_type otherwise. */
24979 static enum tag_types
24981 {
24983 {
24993 }
24994 }
24996 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
24998 static void
25000 {
25004 {
25008 type))
25011 }
25012 }
25014 /* Issue an error message if DECL is redeclared with different
25015 access than its original declaration [class.access.spec/3].
25016 This applies to nested classes and nested class templates.
25017 [class.mem/1]. */
25019 static void
25021 {
25030 }
25032 /* Look for the `template' keyword, as a syntactic disambiguator.
25033 Return TRUE iff it is present, in which case it will be
25034 consumed. */
25036 static bool
25038 {
25040 {
25041 /* In C++98 the `template' keyword can only be used within templates;
25042 outside templates the parser can always figure out what is a
25043 template and what is not. In C++11, per the resolution of DR 468,
25044 `template' is allowed in cases where it is not strictly necessary. */
25047 {
25050 "in C++98 %<template%> (as a disambiguator) is only "
25052 /* If this part of the token stream is rescanned, the same
25053 error message would be generated. So, we purge the token
25054 from the stream. */
25057 }
25058 else
25059 {
25060 /* Consume the `template' keyword. */
25063 }
25064 }
25066 }
25068 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
25069 set PARSER->SCOPE, and perform other related actions. */
25071 static void
25073 {
25079 /* Get the stored value. */
25081 /* Perform any access checks that were deferred. */
25084 {
25089 }
25090 /* Set the scope from the stored value. */
25094 }
25096 /* Consume tokens up through a non-nested END token. Returns TRUE if we
25097 encounter the end of a block before what we were looking for. */
25099 static bool
25103 {
25105 {
25108 /* Abort a parenthesized expression if we encounter a semicolon. */
25112 /* If we've reached the end of the file, stop. */
25118 /* We've hit the end of an enclosing block, so there's been some
25119 kind of syntax error. */
25122 /* Consume the token. */
25124 /* See if it starts a new group. */
25126 {
25128 /* In theory this should probably check end == '}', but
25129 cp_parser_save_member_function_body needs it to exit
25130 after either '}' or ')' when called with ')'. */
25133 }
25135 {
25139 }
25144 }
25145 }
25147 /* Like above, for caching a default argument or NSDMI. Both of these are
25148 terminated by a non-nested comma, but it can be unclear whether or not a
25149 comma is nested in a template argument list unless we do more parsing.
25150 In order to handle this ambiguity, when we encounter a ',' after a '<'
25151 we try to parse what follows as a parameter-declaration-list (in the
25152 case of a default argument) or a member-declarator (in the case of an
25153 NSDMI). If that succeeds, then we stop caching. */
25155 static tree
25157 {
25162 tree default_argument;
25164 /* Add tokens until we have processed the entire default
25165 argument. We add the range [first_token, token). */
25168 {
25169 /* For list-initialization, this is straightforward. */
25172 }
25174 {
25177 /* Peek at the next token. */
25179 /* What we do depends on what token we have. */
25181 {
25182 /* In valid code, a default argument must be
25183 immediately followed by a `,' `)', or `...'. */
25186 {
25187 /* If we've seen a '<', we might be in a
25188 template-argument-list. Until Core issue 325 is
25189 resolved, we don't know how this situation ought
25190 to be handled, so try to DTRT. We check whether
25191 what comes after the comma is a valid parameter
25192 declaration list. If it is, then the comma ends
25193 the default argument; otherwise the default
25194 argument continues. */
25197 /* Set ITALP so cp_parser_parameter_declaration_list
25198 doesn't decide to commit to this parse. */
25206 {
25212 }
25213 else
25214 {
25218 }
25225 }
25228 /* If we run into a non-nested `;', `}', or `]',
25229 then the code is invalid -- but the default
25230 argument is certainly over. */
25235 /* Handle correctly int n = sizeof ... ( p ); */
25238 /* Update DEPTH, if necessary. */
25253 /* This might be the comparison operator, or it might
25254 start a template argument list. */
25261 /* Fall through for C++0x, which treats the `>>'
25262 operator like two `>' tokens in certain
25263 cases. */
25267 {
25268 /* This might be an operator, or it might close a
25269 template argument list. But if a previous '<'
25270 started a template argument list, this will have
25271 closed it, so we can't be in one anymore. */
25275 }
25278 /* If we run out of tokens, issue an error message. */
25287 /* In these cases, we should look for template-ids.
25288 For example, if the default argument is
25289 `X<int, double>()', we need to do name lookup to
25290 figure out whether or not `X' is a template; if
25291 so, the `,' does not end the default argument.
25293 That is not yet done. */
25298 }
25300 /* If we've reached the end, stop. */
25304 /* Add the token to the token block. */
25306 }
25308 /* Create a DEFAULT_ARG to represent the unparsed default
25309 argument. */
25316 }
25318 /* Begin parsing tentatively. We always save tokens while parsing
25319 tentatively so that if the tentative parsing fails we can restore the
25320 tokens. */
25322 static void
25324 {
25325 /* Enter a new parsing context. */
25327 /* Begin saving tokens. */
25329 /* In order to avoid repetitive access control error messages,
25330 access checks are queued up until we are no longer parsing
25331 tentatively. */
25333 }
25335 /* Commit to the currently active tentative parse. */
25337 static void
25339 {
25343 /* Mark all of the levels as committed. */
25346 {
25353 }
25354 }
25356 /* Commit to the topmost currently active tentative parse.
25358 Note that this function shouldn't be called when there are
25359 irreversible side-effects while in a tentative state. For
25360 example, we shouldn't create a permanent entry in the symbol
25361 table, or issue an error message that might not apply if the
25362 tentative parse is aborted. */
25364 static void
25366 {
25371 {
25379 }
25380 }
25382 /* Abort the currently active tentative parse. All consumed tokens
25383 will be rolled back, and no diagnostics will be issued. */
25385 static void
25387 {
25391 /* Now, pretend that we want to see if the construct was
25392 successfully parsed. */
25394 }
25396 /* Stop parsing tentatively. If a parse error has occurred, restore the
25397 token stream. Otherwise, commit to the tokens we have consumed.
25398 Returns true if no error occurred; false otherwise. */
25400 static bool
25402 {
25406 /* Remember whether or not an error occurred, since we are about to
25407 destroy that information. */
25409 /* Remove the topmost context from the stack. */
25412 /* If no parse errors occurred, commit to the tentative parse. */
25414 {
25415 /* Commit to the tokens read tentatively, unless that was
25416 already done. */
25421 }
25422 /* Otherwise, if errors occurred, roll back our state so that things
25423 are just as they were before we began the tentative parse. */
25424 else
25425 {
25428 }
25429 /* Add the context to the front of the free list. */
25434 }
25436 /* Returns true if we are parsing tentatively and are not committed to
25437 this tentative parse. */
25439 static bool
25441 {
25444 }
25446 /* Returns nonzero iff an error has occurred during the most recent
25447 tentative parse. */
25449 static bool
25451 {
25454 }
25456 /* Returns nonzero if GNU extensions are allowed. */
25458 static bool
25460 {
25462 }
25463 \f
25464 /* Objective-C++ Productions */
25467 /* Parse an Objective-C expression, which feeds into a primary-expression
25468 above.
25470 objc-expression:
25471 objc-message-expression
25472 objc-string-literal
25473 objc-encode-expression
25474 objc-protocol-expression
25475 objc-selector-expression
25477 Returns a tree representation of the expression. */
25479 static tree
25481 {
25482 /* Try to figure out what kind of declaration is present. */
25486 {
25496 {
25508 }
25514 }
25517 }
25519 /* Parse an Objective-C message expression.
25521 objc-message-expression:
25522 [ objc-message-receiver objc-message-args ]
25524 Returns a representation of an Objective-C message. */
25526 static tree
25528 {
25537 }
25539 /* Parse an objc-message-receiver.
25541 objc-message-receiver:
25542 expression
25543 simple-type-specifier
25545 Returns a representation of the type or expression. */
25547 static tree
25549 {
25550 tree rcv;
25552 /* An Objective-C message receiver may be either (1) a type
25553 or (2) an expression. */
25562 CP_PARSER_FLAGS_NONE);
25565 }
25567 /* Parse the arguments and selectors comprising an Objective-C message.
25569 objc-message-args:
25570 objc-selector
25571 objc-selector-args
25572 objc-selector-args , objc-comma-args
25574 objc-selector-args:
25575 objc-selector [opt] : assignment-expression
25576 objc-selector-args objc-selector [opt] : assignment-expression
25578 objc-comma-args:
25579 assignment-expression
25580 objc-comma-args , assignment-expression
25582 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
25583 selector arguments and TREE_VALUE containing a list of comma
25584 arguments. */
25586 static tree
25588 {
25594 {
25600 /* Detect if we have a unary selector. */
25609 sel_args
25614 }
25616 /* Handle non-selector arguments, if any. */
25618 {
25619 tree arg;
25624 addl_args
25629 }
25632 {
25635 }
25638 }
25640 /* Parse an Objective-C encode expression.
25642 objc-encode-expression:
25643 @encode objc-typename
25645 Returns an encoded representation of the type argument. */
25647 static tree
25649 {
25650 tree type;
25660 {
25664 }
25666 /* This happens if we find @encode(T) (where T is a template
25667 typename or something dependent on a template typename) when
25668 parsing a template. In that case, we can't compile it
25669 immediately, but we rather create an AT_ENCODE_EXPR which will
25670 need to be instantiated when the template is used.
25671 */
25673 {
25677 }
25680 }
25682 /* Parse an Objective-C @defs expression. */
25684 static tree
25686 {
25687 tree name;
25695 }
25697 /* Parse an Objective-C protocol expression.
25699 objc-protocol-expression:
25700 @protocol ( identifier )
25702 Returns a representation of the protocol expression. */
25704 static tree
25706 {
25707 tree proto;
25715 }
25717 /* Parse an Objective-C selector expression.
25719 objc-selector-expression:
25720 @selector ( objc-method-signature )
25722 objc-method-signature:
25723 objc-selector
25724 objc-selector-seq
25726 objc-selector-seq:
25727 objc-selector :
25728 objc-selector-seq objc-selector :
25730 Returns a representation of the method selector. */
25732 static tree
25734 {
25746 {
25755 {
25756 /* Detect if we have a unary selector. */
25758 {
25761 }
25762 else
25763 {
25765 }
25766 }
25771 {
25772 sel_seq
25775 sel_seq
25778 }
25779 else
25780 sel_seq
25785 }
25787 finish_selector:
25791 }
25793 /* Parse a list of identifiers.
25795 objc-identifier-list:
25796 identifier
25797 objc-identifier-list , identifier
25799 Returns a TREE_LIST of identifier nodes. */
25801 static tree
25803 {
25804 tree identifier;
25805 tree list;
25816 {
25823 identifier));
25825 }
25828 }
25830 /* Parse an Objective-C alias declaration.
25832 objc-alias-declaration:
25833 @compatibility_alias identifier identifier ;
25835 This function registers the alias mapping with the Objective-C front end.
25836 It returns nothing. */
25838 static void
25840 {
25848 }
25850 /* Parse an Objective-C class forward-declaration.
25852 objc-class-declaration:
25853 @class objc-identifier-list ;
25855 The function registers the forward declarations with the Objective-C
25856 front end. It returns nothing. */
25858 static void
25860 {
25863 {
25864 tree id;
25874 else
25876 }
25878 }
25880 /* Parse a list of Objective-C protocol references.
25882 objc-protocol-refs-opt:
25883 objc-protocol-refs [opt]
25885 objc-protocol-refs:
25886 < objc-identifier-list >
25888 Returns a TREE_LIST of identifiers, if any. */
25890 static tree
25892 {
25896 {
25900 }
25903 }
25905 /* Parse a Objective-C visibility specification. */
25907 static void
25909 {
25913 {
25928 }
25930 /* Eat '@private'/'@protected'/'@public'. */
25932 }
25934 /* Parse an Objective-C method type. Return 'true' if it is a class
25935 (+) method, and 'false' if it is an instance (-) method. */
25939 {
25942 else
25944 }
25946 /* Parse an Objective-C protocol qualifier. */
25948 static tree
25950 {
25963 {
25968 }
25971 }
25973 /* Parse an Objective-C typename. */
25975 static tree
25977 {
25981 {
25987 /* An ObjC type name may consist of just protocol qualifiers, in which
25988 case the type shall default to 'id'. */
25990 {
25993 /* If the type could not be parsed, an error has already
25994 been produced. For error recovery, behave as if it had
25995 not been specified, which will use the default type
25996 'id'. */
25998 {
26000 /* We need to skip to the closing parenthesis as
26001 cp_parser_type_id() does not seem to do it for
26002 us. */
26007 }
26008 }
26012 }
26015 }
26017 /* Check to see if TYPE refers to an Objective-C selector name. */
26019 static bool
26021 {
26027 }
26029 /* Parse an Objective-C selector. */
26031 static tree
26033 {
26037 {
26040 }
26042 /* C++ operator names are allowed to appear in ObjC selectors. */
26044 {
26057 }
26058 }
26060 /* Parse an Objective-C params list. */
26062 static tree
26064 {
26070 {
26080 /* Detect if we have a unary selector. */
26083 {
26086 }
26090 {
26091 /* Something went quite wrong. There should be a colon
26092 here, but there is not. Stop parsing parameters. */
26094 }
26096 /* New ObjC allows attributes on parameters too. */
26101 params
26104 type_name,
26105 identifier,
26106 parm_attr));
26109 }
26112 {
26115 }
26117 /* We allow tail attributes for the method. */
26119 {
26127 }
26130 {
26133 }
26135 }
26137 /* Parse the non-keyword Objective-C params. */
26139 static tree
26142 {
26148 {
26150 tree parm;
26156 {
26161 }
26163 /* TODO: parse attributes for tail parameters. */
26172 }
26174 /* We allow tail attributes for the method. */
26176 {
26178 {
26183 }
26184 else
26185 /* We have an error, but parse the attributes, so that we can
26186 carry on. */
26192 }
26195 }
26197 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
26199 static void
26201 {
26204 /* If the next token is `extern' and the following token is a string
26205 literal, then we have a linkage specification. */
26207 && cp_parser_is_pure_string_literal
26210 /* Handle #pragma, if any. */
26213 /* Allow stray semicolons. */
26216 /* Mark methods as optional or required, when building protocols. */
26218 {
26221 }
26223 {
26226 }
26229 /* Other stray characters must generate errors. */
26231 {
26235 }
26236 /* Finally, try to parse a block-declaration, or a function-definition. */
26237 else
26239 }
26241 /* Parse a method signature. */
26243 static tree
26245 {
26261 }
26263 static bool
26265 {
26266 tree tattr;
26271 /* If the attributes are followed by a method introducer, this is not allowed.
26272 Dump the attributes and flag the situation. */
26277 /* Otherwise, the attributes introduce some interstitial code, possibly so
26278 rewind to allow that check. */
26281 }
26283 /* Parse an Objective-C method prototype list. */
26285 static void
26287 {
26291 {
26293 {
26298 else
26302 {
26306 }
26309 }
26315 OPT_Wattributes,
26317 else
26318 /* Allow for interspersed non-ObjC++ code. */
26322 }
26326 else
26330 }
26332 /* Parse an Objective-C method definition list. */
26334 static void
26336 {
26340 {
26341 tree meth;
26344 {
26350 else
26355 {
26359 }
26361 NULL_TREE);
26363 /* For historical reasons, we accept an optional semicolon. */
26370 {
26377 }
26378 }
26379 /* The following case will be removed once @synthesize is
26380 completely implemented. */
26391 else
26392 /* Allow for interspersed non-ObjC++ code. */
26396 }
26400 else
26404 }
26406 /* Parse Objective-C ivars. */
26408 static void
26410 {
26421 {
26422 cp_decl_specifier_seq declspecs;
26424 tree prefix_attributes;
26432 CP_PARSER_FLAGS_OPTIONAL,
26436 /* auto, register, static, extern, mutable. */
26438 {
26441 }
26443 /* thread_local. */
26445 {
26448 }
26450 /* typedef. */
26452 {
26455 }
26460 /* Keep going until we hit the `;' at the end of the
26461 declaration. */
26463 {
26468 /* Check for a (possibly unnamed) bitfield declaration. */
26476 {
26477 /* Get the name of the bitfield. */
26480 sfk_none);
26482 eat_colon:
26484 /* Get the width of the bitfield. */
26485 width
26488 NULL);
26489 }
26490 else
26491 {
26492 /* Parse the declarator. */
26493 declarator
26498 }
26500 /* Look for attributes that apply to the ivar. */
26502 /* Remember which attributes are prefix attributes and
26503 which are not. */
26505 /* Combine the attributes. */
26509 /* Create the bitfield declaration. */
26511 width,
26512 attributes);
26513 else
26518 /* Add the instance variable. */
26522 /* Reset PREFIX_ATTRIBUTES. */
26531 {
26534 }
26536 }
26540 }
26545 /* Do not consume the RID_AT_END, so it will be read again as terminating
26546 the @interface of @implementation. */
26550 /* For historical reasons, we accept an optional semicolon. */
26553 }
26555 /* Parse an Objective-C protocol declaration. */
26557 static void
26559 {
26565 {
26570 }
26572 /* See if we have a forward declaration or a definition. */
26575 /* Try a forward declaration first. */
26577 {
26579 {
26580 tree id;
26590 else
26592 }
26594 }
26596 /* Ok, we got a full-fledged definition (or at least should). */
26597 else
26598 {
26603 }
26604 }
26606 /* Parse an Objective-C superclass or category. */
26608 static void
26613 {
26619 {
26622 }
26624 {
26627 /* If there is no category name, and this is an @interface, we
26628 have a class extension. */
26630 {
26633 }
26634 else
26638 }
26639 }
26641 /* Parse an Objective-C class interface. */
26643 static void
26645 {
26652 {
26653 /* It's hard to recover because even if valid @interface stuff
26654 is to follow, we can't compile it (or validate it) if we
26655 don't even know which class it refers to. Let's assume this
26656 was a stray '@interface' token in the stream and skip it.
26657 */
26659 }
26664 /* We have either a class or a category on our hands. */
26667 else
26668 {
26670 /* Handle instance variable declarations, if any. */
26673 }
26676 }
26678 /* Parse an Objective-C class implementation. */
26680 static void
26682 {
26689 {
26690 /* It's hard to recover because even if valid @implementation
26691 stuff is to follow, we can't compile it (or validate it) if
26692 we don't even know which class it refers to. Let's assume
26693 this was a stray '@implementation' token in the stream and
26694 skip it.
26695 */
26697 }
26701 /* We have either a class or a category on our hands. */
26704 else
26705 {
26707 /* Handle instance variable declarations, if any. */
26710 }
26713 }
26715 /* Consume the @end token and finish off the implementation. */
26717 static void
26719 {
26722 }
26724 /* Parse an Objective-C declaration. */
26726 static void
26728 {
26729 /* Try to figure out what kind of declaration is present. */
26734 {
26750 }
26753 {
26776 }
26777 }
26779 /* Parse an Objective-C try-catch-finally statement.
26781 objc-try-catch-finally-stmt:
26782 @try compound-statement objc-catch-clause-seq [opt]
26783 objc-finally-clause [opt]
26785 objc-catch-clause-seq:
26786 objc-catch-clause objc-catch-clause-seq [opt]
26788 objc-catch-clause:
26789 @catch ( objc-exception-declaration ) compound-statement
26791 objc-finally-clause:
26792 @finally compound-statement
26794 objc-exception-declaration:
26795 parameter-declaration
26796 '...'
26798 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
26800 Returns NULL_TREE.
26802 PS: This function is identical to c_parser_objc_try_catch_finally_statement
26803 for C. Keep them in sync. */
26805 static tree
26807 {
26808 location_t location;
26809 tree stmt;
26814 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
26815 node, lest it get absorbed into the surrounding block. */
26821 {
26830 {
26831 /* We have "@catch (...)" (where the '...' are literally
26832 what is in the code). Skip the '...'.
26833 parameter_declaration is set to NULL_TREE, and
26834 objc_being_catch_clauses() knows that that means
26835 '...'. */
26838 }
26839 else
26840 {
26841 /* We have "@catch (NSException *exception)" or something
26842 like that. Parse the parameter declaration. */
26846 else
26851 }
26854 else
26855 {
26856 /* If there was no open parenthesis, we are recovering from
26857 an error, and we are trying to figure out what mistake
26858 the user has made. */
26860 /* If there is an immediate closing parenthesis, the user
26861 probably forgot the opening one (ie, they typed "@catch
26862 NSException *e)". Parse the closing parenthesis and keep
26863 going. */
26867 /* If these is no immediate closing parenthesis, the user
26868 probably doesn't know that parenthesis are required at
26869 all (ie, they typed "@catch NSException *e"). So, just
26870 forget about the closing parenthesis and keep going. */
26871 }
26875 }
26877 {
26880 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
26881 node, lest it get absorbed into the surrounding block. */
26885 }
26888 }
26890 /* Parse an Objective-C synchronized statement.
26892 objc-synchronized-stmt:
26893 @synchronized ( expression ) compound-statement
26895 Returns NULL_TREE. */
26897 static tree
26899 {
26900 location_t location;
26911 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
26912 node, lest it get absorbed into the surrounding block. */
26917 }
26919 /* Parse an Objective-C throw statement.
26921 objc-throw-stmt:
26922 @throw assignment-expression [opt] ;
26924 Returns a constructed '@throw' statement. */
26926 static tree
26928 {
26940 }
26942 /* Parse an Objective-C statement. */
26944 static tree
26946 {
26947 /* Try to figure out what kind of declaration is present. */
26951 {
26962 }
26965 }
26967 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
26968 look ahead to see if an objc keyword follows the attributes. This
26969 is to detect the use of prefix attributes on ObjC @interface and
26970 @protocol. */
26972 static bool
26974 {
26979 {
26982 }
26985 }
26987 /* This routine is a minimal replacement for
26988 c_parser_struct_declaration () used when parsing the list of
26989 types/names or ObjC++ properties. For example, when parsing the
26990 code
26992 @property (readonly) int a, b, c;
26994 this function is responsible for parsing "int a, int b, int c" and
26995 returning the declarations as CHAIN of DECLs.
26997 TODO: Share this code with cp_parser_objc_class_ivars. It's very
26998 similar parsing. */
26999 static tree
27001 {
27003 cp_decl_specifier_seq declspecs;
27005 tree prefix_attributes;
27008 CP_PARSER_FLAGS_NONE,
27015 /* auto, register, static, extern, mutable. */
27017 {
27020 }
27022 /* thread_local. */
27024 {
27027 }
27029 /* typedef. */
27031 {
27034 }
27039 /* Keep going until we hit the `;' at the end of the declaration. */
27041 {
27046 /* Parse the declarator. */
27050 /* Look for attributes that apply to the ivar. */
27052 /* Remember which attributes are prefix attributes and
27053 which are not. */
27055 /* Combine the attributes. */
27065 /* Reset PREFIX_ATTRIBUTES. */
27076 {
27079 }
27080 else
27082 }
27084 }
27086 /* Parse an Objective-C @property declaration. The syntax is:
27088 objc-property-declaration:
27089 '@property' objc-property-attributes[opt] struct-declaration ;
27091 objc-property-attributes:
27092 '(' objc-property-attribute-list ')'
27094 objc-property-attribute-list:
27095 objc-property-attribute
27096 objc-property-attribute-list, objc-property-attribute
27098 objc-property-attribute
27099 'getter' = identifier
27100 'setter' = identifier
27101 'readonly'
27102 'readwrite'
27103 'assign'
27104 'retain'
27105 'copy'
27106 'nonatomic'
27108 For example:
27109 @property NSString *name;
27110 @property (readonly) id object;
27111 @property (retain, nonatomic, getter=getTheName) id name;
27112 @property int a, b, c;
27114 PS: This function is identical to
27115 c_parser_objc_at_property_declaration for C. Keep them in sync. */
27116 static void
27118 {
27119 /* The following variables hold the attributes of the properties as
27120 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
27121 seen. When we see an attribute, we set them to 'true' (if they
27122 are boolean properties) or to the identifier (if they have an
27123 argument, ie, for getter and setter). Note that here we only
27124 parse the list of attributes, check the syntax and accumulate the
27125 attributes that we find. objc_add_property_declaration() will
27126 then process the information. */
27136 /* 'properties' is the list of properties that we read. Usually a
27137 single one, but maybe more (eg, in "@property int a, b, c;" there
27138 are three). */
27139 tree properties;
27140 location_t loc;
27146 /* Parse the optional attribute list... */
27148 {
27149 /* Eat the '('. */
27153 {
27159 {
27162 }
27166 {
27177 {
27181 else
27186 }
27189 {
27193 }
27195 {
27197 {
27200 }
27201 else
27205 else
27207 }
27208 else
27209 {
27211 {
27214 }
27215 else
27217 }
27223 }
27230 else
27232 }
27234 /* FIXME: "@property (setter, assign);" will generate a spurious
27235 "error: expected ‘)’ before ‘,’ token". This is because
27236 cp_parser_require, unlike the C counterpart, will produce an
27237 error even if we are in error recovery. */
27239 {
27244 }
27245 }
27247 /* ... and the property declaration(s). */
27251 {
27253 /* If the next token is now a `;', consume it. */
27257 }
27261 else
27262 {
27263 /* Comma-separated properties are chained together in
27264 reverse order; add them one by one. */
27273 }
27276 }
27278 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
27280 objc-synthesize-declaration:
27281 @synthesize objc-synthesize-identifier-list ;
27283 objc-synthesize-identifier-list:
27284 objc-synthesize-identifier
27285 objc-synthesize-identifier-list, objc-synthesize-identifier
27287 objc-synthesize-identifier
27288 identifier
27289 identifier = identifier
27291 For example:
27292 @synthesize MyProperty;
27293 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
27295 PS: This function is identical to c_parser_objc_at_synthesize_declaration
27296 for C. Keep them in sync.
27297 */
27298 static void
27300 {
27302 location_t loc;
27307 {
27311 {
27314 }
27316 {
27320 {
27323 }
27324 }
27325 else
27330 else
27332 }
27335 }
27337 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
27339 objc-dynamic-declaration:
27340 @dynamic identifier-list ;
27342 For example:
27343 @dynamic MyProperty;
27344 @dynamic MyProperty, AnotherProperty;
27346 PS: This function is identical to c_parser_objc_at_dynamic_declaration
27347 for C. Keep them in sync.
27348 */
27349 static void
27351 {
27353 location_t loc;
27358 {
27359 tree property;
27362 {
27365 }
27369 else
27371 }
27374 }
27376 \f
27377 /* OpenMP 2.5 / 3.0 / 3.1 / 4.0 parsing routines. */
27379 /* Returns name of the next clause.
27380 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
27381 the token is not consumed. Otherwise appropriate pragma_omp_clause is
27382 returned and the token is consumed. */
27384 static pragma_omp_clause
27386 {
27398 {
27403 {
27498 }
27499 }
27505 }
27507 /* Validate that a clause of the given type does not already exist. */
27509 static void
27512 {
27513 tree c;
27517 {
27520 }
27521 }
27523 /* OpenMP 2.5:
27524 variable-list:
27525 identifier
27526 variable-list , identifier
27528 In addition, we match a closing parenthesis (or, if COLON is non-NULL,
27529 colon). An opening parenthesis will have been consumed by the caller.
27531 If KIND is nonzero, create the appropriate node and install the decl
27532 in OMP_CLAUSE_DECL and add the node to the head of the list.
27534 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
27535 return the list created.
27537 COLON can be NULL if only closing parenthesis should end the list,
27538 or pointer to bool which will receive false if the list is terminated
27539 by closing parenthesis or true if the list is terminated by colon. */
27541 static tree
27544 {
27548 {
27551 }
27553 {
27570 {
27572 {
27578 {
27585 NULL);
27587 parser->colon_corrects_to_scope_p
27591 else
27592 {
27593 /* Look for `:'. */
27597 CPP_CLOSE_SQUARE))
27600 NULL);
27601 }
27602 /* Look for the closing `]'. */
27604 RT_CLOSE_SQUARE))
27607 }
27611 }
27617 }
27618 else
27621 get_comma:
27625 }
27631 {
27635 }
27638 {
27641 /* Try to resync to an unnested comma. Copied from
27642 cp_parser_parenthesized_expression_list. */
27643 skip_comma:
27652 }
27655 }
27657 /* Similarly, but expect leading and trailing parenthesis. This is a very
27658 common case for omp clauses. */
27660 static tree
27662 {
27666 }
27668 /* OpenMP 3.0:
27669 collapse ( constant-expression ) */
27671 static tree
27673 {
27675 location_t loc;
27676 HOST_WIDE_INT n;
27696 {
27699 }
27707 }
27709 /* OpenMP 2.5:
27710 default ( shared | none ) */
27712 static tree
27714 {
27716 tree c;
27721 {
27726 {
27741 }
27744 }
27745 else
27746 {
27747 invalid_kind:
27749 }
27765 }
27767 /* OpenMP 3.1:
27768 final ( expression ) */
27770 static tree
27772 {
27793 }
27795 /* OpenMP 2.5:
27796 if ( expression ) */
27798 static tree
27800 {
27821 }
27823 /* OpenMP 3.1:
27824 mergeable */
27826 static tree
27829 {
27830 tree c;
27833 location);
27838 }
27840 /* OpenMP 2.5:
27841 nowait */
27843 static tree
27846 {
27847 tree c;
27854 }
27856 /* OpenMP 2.5:
27857 num_threads ( expression ) */
27859 static tree
27861 location_t location)
27862 {
27884 }
27886 /* OpenMP 2.5:
27887 ordered */
27889 static tree
27892 {
27893 tree c;
27901 }
27903 /* OpenMP 2.5:
27904 reduction ( reduction-operator : variable-list )
27906 reduction-operator:
27907 One of: + * - & ^ | && ||
27909 OpenMP 3.1:
27911 reduction-operator:
27912 One of: + * - & ^ | && || min max
27914 OpenMP 4.0:
27916 reduction-operator:
27917 One of: + * - & ^ | && ||
27918 id-expression */
27920 static tree
27922 {
27930 {
27940 }
27944 else
27945 {
27956 {
27986 }
27987 else
27988 {
27990 resync_fail:
27995 }
27996 }
28002 NULL);
28004 {
28007 }
28010 }
28012 /* OpenMP 2.5:
28013 schedule ( schedule-kind )
28014 schedule ( schedule-kind , expression )
28016 schedule-kind:
28017 static | dynamic | guided | runtime | auto */
28019 static tree
28021 {
28030 {
28035 {
28056 }
28057 }
28062 else
28067 {
28082 else
28087 }
28095 invalid_kind:
28097 resync_fail:
28102 }
28104 /* OpenMP 3.0:
28105 untied */
28107 static tree
28110 {
28111 tree c;
28118 }
28120 /* OpenMP 4.0:
28121 inbranch
28122 notinbranch */
28124 static tree
28127 {
28132 }
28134 /* OpenMP 4.0:
28135 parallel
28136 for
28137 sections
28138 taskgroup */
28140 static tree
28144 {
28148 }
28150 /* OpenMP 4.0:
28151 num_teams ( expression ) */
28153 static tree
28155 location_t location)
28156 {
28178 }
28180 /* OpenMP 4.0:
28181 thread_limit ( expression ) */
28183 static tree
28185 location_t location)
28186 {
28208 }
28210 /* OpenMP 4.0:
28211 aligned ( variable-list )
28212 aligned ( variable-list : constant-expression ) */
28214 static tree
28216 {
28227 {
28237 }
28243 }
28245 /* OpenMP 4.0:
28246 linear ( variable-list )
28247 linear ( variable-list : expression ) */
28249 static tree
28251 {
28262 {
28272 }
28278 }
28280 /* OpenMP 4.0:
28281 safelen ( constant-expression ) */
28283 static tree
28285 location_t location)
28286 {
28307 }
28309 /* OpenMP 4.0:
28310 simdlen ( constant-expression ) */
28312 static tree
28314 location_t location)
28315 {
28336 }
28338 /* OpenMP 4.0:
28339 depend ( depend-kind : variable-list )
28341 depend-kind:
28342 in | out | inout */
28344 static tree
28346 {
28354 {
28364 else
28366 }
28367 else
28375 NULL);
28382 invalid_kind:
28384 resync_fail:
28389 }
28391 /* OpenMP 4.0:
28392 map ( map-kind : variable-list )
28393 map ( variable-list )
28395 map-kind:
28396 alloc | to | from | tofrom */
28398 static tree
28400 {
28409 {
28421 else
28422 {
28428 }
28431 }
28434 NULL);
28440 }
28442 /* OpenMP 4.0:
28443 device ( expression ) */
28445 static tree
28447 location_t location)
28448 {
28470 }
28472 /* OpenMP 4.0:
28473 dist_schedule ( static )
28474 dist_schedule ( static , expression ) */
28476 static tree
28478 location_t location)
28479 {
28492 {
28503 }
28508 location);
28512 invalid_kind:
28514 resync_fail:
28519 }
28521 /* OpenMP 4.0:
28522 proc_bind ( proc-bind-kind )
28524 proc-bind-kind:
28525 master | close | spread */
28527 static tree
28529 location_t location)
28530 {
28531 tree c;
28538 {
28548 else
28550 }
28551 else
28560 location);
28565 invalid_kind:
28567 resync_fail:
28572 }
28574 /* Parse all OpenMP clauses. The set clauses allowed by the directive
28575 is a bitmask in MASK. Return the list of clauses found; the result
28576 of clause default goes in *pdefault. */
28578 static tree
28582 {
28588 {
28589 pragma_omp_clause c_kind;
28600 {
28612 clauses);
28626 clauses);
28635 clauses);
28659 clauses);
28673 clauses);
28688 OMP_CLAUSE_NOTINBRANCH,
28697 {
28698 clause_not_first:
28702 }
28727 clauses);
28732 clauses);
28737 clauses);
28794 }
28799 {
28800 /* Remove the invalid clause(s) from the list to avoid
28801 confusing the rest of the compiler. */
28804 }
28805 }
28806 saw_error:
28811 }
28813 /* OpenMP 2.5:
28814 structured-block:
28815 statement
28817 In practice, we're also interested in adding the statement to an
28818 outer node. So it is convenient if we work around the fact that
28819 cp_parser_statement calls add_stmt. */
28821 static unsigned
28823 {
28826 /* Only move the values to IN_OMP_BLOCK if they weren't false.
28827 This preserves the "not within loop or switch" style error messages
28828 for nonsense cases like
28829 void foo() {
28830 #pragma omp single
28831 break;
28832 }
28833 */
28838 }
28840 static void
28842 {
28844 }
28846 static tree
28848 {
28856 }
28858 /* OpenMP 2.5:
28859 # pragma omp atomic new-line
28860 expression-stmt
28862 expression-stmt:
28863 x binop= expr | x++ | ++x | x-- | --x
28864 binop:
28865 +, *, -, /, &, ^, |, <<, >>
28867 where x is an lvalue expression with scalar type.
28869 OpenMP 3.1:
28870 # pragma omp atomic new-line
28871 update-stmt
28873 # pragma omp atomic read new-line
28874 read-stmt
28876 # pragma omp atomic write new-line
28877 write-stmt
28879 # pragma omp atomic update new-line
28880 update-stmt
28882 # pragma omp atomic capture new-line
28883 capture-stmt
28885 # pragma omp atomic capture new-line
28886 capture-block
28888 read-stmt:
28889 v = x
28890 write-stmt:
28891 x = expr
28892 update-stmt:
28893 expression-stmt | x = x binop expr
28894 capture-stmt:
28895 v = expression-stmt
28896 capture-block:
28897 { v = x; update-stmt; } | { update-stmt; v = x; }
28899 OpenMP 4.0:
28900 update-stmt:
28901 expression-stmt | x = x binop expr | x = expr binop x
28902 capture-stmt:
28903 v = update-stmt
28904 capture-block:
28905 { v = x; update-stmt; } | { update-stmt; v = x; } | { v = x; x = expr; }
28907 where x and v are lvalue expressions with scalar type. */
28909 static void
28911 {
28919 {
28931 else
28935 }
28938 {
28943 {
28946 }
28947 }
28951 {
28962 else
28968 {
28969 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
28970 opcode. */
28975 }
28979 {
28982 }
28983 else
28984 {
28991 }
28994 }
28996 restart:
29001 {
29008 /* FALLTHROUGH */
29018 /* FALLTHROUGH */
29033 /* Undo effects of boolean_increment for post {in,de}crement. */
29035 /* FALLTHRU */
29039 {
29040 /* Undo effects of boolean_increment. */
29042 {
29043 /* This is pre or post increment. */
29048 && !structured_block
29052 }
29053 }
29054 /* FALLTHRU */
29057 {
29092 {
29096 }
29099 {
29105 {
29110 }
29112 {
29123 {
29125 {
29130 }
29131 else
29133 }
29137 }
29140 {
29147 }
29151 }
29155 {
29158 {
29166 }
29168 {
29173 }
29208 }
29219 /* FALLTHROUGH */
29224 }
29231 }
29232 stmt_done:
29234 {
29247 }
29249 {
29252 }
29253 done:
29259 saw_error:
29262 {
29266 {
29270 }
29271 }
29272 }
29275 /* OpenMP 2.5:
29276 # pragma omp barrier new-line */
29278 static void
29280 {
29283 }
29285 /* OpenMP 2.5:
29286 # pragma omp critical [(name)] new-line
29287 structured-block */
29289 static tree
29291 {
29295 {
29307 }
29312 }
29314 /* OpenMP 2.5:
29315 # pragma omp flush flush-vars[opt] new-line
29317 flush-vars:
29318 ( variable-list ) */
29320 static void
29322 {
29328 }
29330 /* Helper function, to parse omp for increment expression. */
29332 static tree
29334 {
29339 {
29342 }
29345 {
29354 /* Fall through: OpenMP disallows NE_EXPR. */
29357 }
29359 /* If decl is an iterator, preserve LHS and RHS of the relational
29360 expr until finish_omp_for. */
29370 }
29372 /* Helper function, to parse omp for increment expression. */
29374 static tree
29376 {
29380 cp_id_kind idk;
29384 {
29392 }
29400 {
29405 }
29412 {
29416 }
29428 do
29429 {
29436 {
29438 {
29441 else
29443 tf_warning_or_error);
29444 }
29445 else
29448 }
29449 }
29453 {
29457 }
29458 else
29462 }
29464 /* Parse the initialization statement of either an OpenMP for loop or
29465 a Cilk Plus for loop.
29467 PARSING_OPENMP is true if parsing OpenMP, or false if parsing Cilk
29468 Plus.
29470 Return true if the resulting construct should have an
29471 OMP_CLAUSE_PRIVATE added to it. */
29473 static bool
29481 {
29487 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
29489 init-expr:
29490 var = lb
29491 integer-type var = lb
29492 random-access-iterator-type var = lb
29493 pointer-type var = lb
29494 */
29495 cp_decl_specifier_seq type_specifiers;
29497 /* First, try to parse as an initialized declaration. See
29498 cp_parser_condition, from whence the bulk of this is copied. */
29505 {
29506 /* If parsing a type specifier seq succeeded, then this
29507 MUST be a initialized declaration. */
29512 CP_PARSER_DECLARATOR_NAMED,
29522 else
29523 {
29533 {
29535 CPP_OPEN_PAREN))
29536 {
29540 else
29543 }
29544 else
29545 /* Trigger an error. */
29550 }
29554 {
29562 {
29565 auto_node);
29570 }
29573 asm_specification,
29574 LOOKUP_ONLYCONVERTING);
29576 {
29579 }
29580 else
29583 }
29584 else
29585 {
29586 /* Consume '='. */
29590 non_class:
29593 else
29596 asm_specification,
29597 LOOKUP_ONLYCONVERTING);
29598 }
29602 }
29603 }
29604 else
29605 {
29606 cp_id_kind idk;
29607 /* If parsing a type specifier sequence failed, then
29608 this MUST be a simple expression. */
29613 && decl
29616 {
29617 tree rhs;
29624 rhs,
29625 tf_warning_or_error));
29627 }
29628 else
29629 {
29634 {
29638 }
29639 }
29640 }
29642 }
29644 /* Parse the restricted form of the for statement allowed by OpenMP. */
29646 static tree
29649 {
29653 location_t loc_first;
29672 {
29675 location_t loc;
29678 {
29681 }
29690 add_private_clause
29698 {
29701 {
29707 }
29708 else
29710 }
29717 {
29722 {
29726 }
29729 {
29730 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
29731 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
29740 }
29741 else
29742 {
29747 }
29748 }
29751 {
29752 tree c;
29754 {
29763 decl);
29767 decl);
29768 }
29770 {
29775 {
29778 }
29779 }
29780 }
29789 {
29790 /* If decl is an iterator, preserve the operator on decl
29791 until finish_omp_for. */
29793 && ((processing_template_decl
29797 else
29801 }
29816 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
29817 in between the collapsed for loops to be still considered perfectly
29818 nested. Hopefully the final version clarifies this.
29819 For now handle (multiple) {'s and empty statements. */
29821 do
29822 {
29826 {
29828 bracecount++;
29829 }
29833 else
29834 {
29841 }
29842 }
29846 {
29849 }
29850 }
29852 /* Note that we saved the original contents of this flag when we entered
29853 the structured block, and so we don't need to re-save it here. */
29856 else
29859 /* Note that the grammar doesn't call for a structured block here,
29860 though the loop as a whole is a structured block. */
29867 else
29872 {
29874 {
29876 nbraces--;
29877 }
29880 else
29881 {
29883 {
29886 }
29891 }
29892 }
29899 }
29901 /* Helper function for OpenMP parsing, split clauses and call
29902 finish_omp_clauses on each of the set of clauses afterwards. */
29904 static void
29907 {
29913 }
29915 /* OpenMP 4.0:
29916 #pragma omp simd simd-clause[optseq] new-line
29917 for-loop */
29919 #define OMP_SIMD_CLAUSE_MASK \
29920 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SAFELEN) \
29921 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
29922 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
29923 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29924 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29925 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29926 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29928 static tree
29931 {
29943 {
29946 }
29957 }
29959 /* OpenMP 2.5:
29960 #pragma omp for for-clause[optseq] new-line
29961 for-loop
29963 OpenMP 4.0:
29964 #pragma omp for simd for-simd-clause[optseq] new-line
29965 for-loop */
29967 #define OMP_FOR_CLAUSE_MASK \
29968 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
29969 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
29970 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
29971 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
29972 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ORDERED) \
29973 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SCHEDULE) \
29974 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT) \
29975 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
29977 static tree
29980 {
29991 {
29996 {
30004 cclauses);
30008 cclauses);
30020 }
30021 }
30023 {
30026 }
30031 {
30034 }
30045 }
30047 /* OpenMP 2.5:
30048 # pragma omp master new-line
30049 structured-block */
30051 static tree
30053 {
30057 }
30059 /* OpenMP 2.5:
30060 # pragma omp ordered new-line
30061 structured-block */
30063 static tree
30065 {
30069 }
30071 /* OpenMP 2.5:
30073 section-scope:
30074 { section-sequence }
30076 section-sequence:
30077 section-directive[opt] structured-block
30078 section-sequence section-directive structured-block */
30080 static tree
30082 {
30093 {
30097 }
30100 {
30108 {
30112 }
30114 {
30117 }
30122 }
30133 }
30135 /* OpenMP 2.5:
30136 # pragma omp sections sections-clause[optseq] newline
30137 sections-scope */
30139 #define OMP_SECTIONS_CLAUSE_MASK \
30140 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30141 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30142 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
30143 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30144 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30146 static tree
30149 {
30161 {
30164 }
30171 }
30173 /* OpenMP 2.5:
30174 # pragma parallel parallel-clause new-line
30175 # pragma parallel for parallel-for-clause new-line
30176 # pragma parallel sections parallel-sections-clause new-line
30178 OpenMP 4.0:
30179 # pragma parallel for simd parallel-for-simd-clause new-line */
30181 #define OMP_PARALLEL_CLAUSE_MASK \
30182 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30183 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30184 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30185 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30186 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30187 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYIN) \
30188 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30189 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_THREADS) \
30190 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PROC_BIND))
30192 static tree
30195 {
30204 {
30217 block);
30220 }
30222 {
30226 }
30228 {
30231 }
30233 {
30237 {
30247 block);
30250 }
30251 }
30261 }
30263 /* OpenMP 2.5:
30264 # pragma omp single single-clause[optseq] new-line
30265 structured-block */
30267 #define OMP_SINGLE_CLAUSE_MASK \
30268 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30269 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30270 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
30271 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOWAIT))
30273 static tree
30275 {
30285 }
30287 /* OpenMP 3.0:
30288 # pragma omp task task-clause[optseq] new-line
30289 structured-block */
30291 #define OMP_TASK_CLAUSE_MASK \
30292 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF) \
30293 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNTIED) \
30294 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT) \
30295 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30296 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30297 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30298 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FINAL) \
30299 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MERGEABLE) \
30300 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEPEND))
30302 static tree
30304 {
30315 }
30317 /* OpenMP 3.0:
30318 # pragma omp taskwait new-line */
30320 static void
30322 {
30325 }
30327 /* OpenMP 3.1:
30328 # pragma omp taskyield new-line */
30330 static void
30332 {
30335 }
30337 /* OpenMP 4.0:
30338 # pragma omp taskgroup new-line
30339 structured-block */
30341 static tree
30343 {
30347 }
30350 /* OpenMP 2.5:
30351 # pragma omp threadprivate (variable-list) */
30353 static void
30355 {
30356 tree vars;
30362 }
30364 /* OpenMP 4.0:
30365 # pragma omp cancel cancel-clause[optseq] new-line */
30367 #define OMP_CANCEL_CLAUSE_MASK \
30368 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30369 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30370 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30371 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP) \
30372 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30374 static void
30376 {
30380 }
30382 /* OpenMP 4.0:
30383 # pragma omp cancellation point cancelpt-clause[optseq] new-line */
30385 #define OMP_CANCELLATION_POINT_CLAUSE_MASK \
30386 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PARALLEL) \
30387 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FOR) \
30388 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SECTIONS) \
30389 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TASKGROUP))
30391 static void
30393 {
30394 tree clauses;
30398 {
30403 {
30406 }
30407 }
30409 {
30413 }
30416 OMP_CANCELLATION_POINT_CLAUSE_MASK,
30418 pragma_tok);
30420 }
30422 /* OpenMP 4.0:
30423 #pragma omp distribute distribute-clause[optseq] new-line
30424 for-loop */
30426 #define OMP_DISTRIBUTE_CLAUSE_MASK \
30427 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30428 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30429 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DIST_SCHEDULE)\
30430 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_COLLAPSE))
30432 static tree
30435 {
30444 {
30452 else
30455 {
30461 {
30464 cclauses);
30465 else
30467 cclauses);
30468 }
30473 cclauses);
30474 else
30476 cclauses);
30488 }
30489 }
30491 {
30494 }
30499 {
30502 }
30513 }
30515 /* OpenMP 4.0:
30516 # pragma omp teams teams-clause[optseq] new-line
30517 structured-block */
30519 #define OMP_TEAMS_CLAUSE_MASK \
30520 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_PRIVATE) \
30521 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
30522 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SHARED) \
30523 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_REDUCTION) \
30524 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NUM_TEAMS) \
30525 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_THREAD_LIMIT) \
30526 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEFAULT))
30528 static tree
30531 {
30540 {
30544 {
30552 cclauses);
30556 cclauses);
30567 }
30568 }
30570 {
30573 }
30578 {
30581 }
30589 }
30591 /* OpenMP 4.0:
30592 # pragma omp target data target-data-clause[optseq] new-line
30593 structured-block */
30595 #define OMP_TARGET_DATA_CLAUSE_MASK \
30596 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30597 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30598 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30600 static tree
30602 {
30614 }
30616 /* OpenMP 4.0:
30617 # pragma omp target update target-update-clause[optseq] new-line */
30619 #define OMP_TARGET_UPDATE_CLAUSE_MASK \
30620 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_FROM) \
30621 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_TO) \
30622 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30623 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30625 static bool
30628 {
30630 {
30632 "%<#pragma omp target update%> may only be "
30636 }
30638 tree clauses
30643 {
30645 "%<#pragma omp target update must contain at least one "
30648 }
30656 }
30658 /* OpenMP 4.0:
30659 # pragma omp target target-clause[optseq] new-line
30660 structured-block */
30662 #define OMP_TARGET_CLAUSE_MASK \
30663 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_DEVICE) \
30664 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_MAP) \
30665 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_IF))
30667 static bool
30670 {
30672 {
30676 }
30679 {
30684 {
30709 }
30711 {
30714 }
30716 {
30720 }
30722 {
30725 }
30726 }
30740 }
30742 /* OpenMP 4.0:
30743 # pragma omp declare simd declare-simd-clauses[optseq] new-line */
30745 #define OMP_DECLARE_SIMD_CLAUSE_MASK \
30746 ( (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_SIMDLEN) \
30747 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_LINEAR) \
30748 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_ALIGNED) \
30749 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_UNIFORM) \
30750 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_INBRANCH) \
30751 | (OMP_CLAUSE_MASK_1 << PRAGMA_OMP_CLAUSE_NOTINBRANCH))
30753 static void
30756 {
30758 cp_omp_declare_simd_data data;
30760 {
30765 }
30776 {
30780 {
30793 }
30798 "%<#pragma omp declare simd%> not immediately followed by "
30802 }
30803 }
30805 /* Finalize #pragma omp declare simd clauses after direct declarator has
30806 been parsed, and put that into "omp declare simd" attribute. */
30808 static tree
30810 {
30816 {
30821 }
30826 {
30844 }
30848 }
30851 /* OpenMP 4.0:
30852 # pragma omp declare target new-line
30853 declarations and definitions
30854 # pragma omp end declare target new-line */
30856 static void
30858 {
30861 }
30863 static void
30865 {
30868 {
30871 }
30873 {
30877 {
30880 }
30883 else
30884 {
30888 }
30889 }
30890 else
30891 {
30895 }
30899 "%<#pragma omp end declare target%> without corresponding "
30901 else
30903 }
30905 /* Helper function of cp_parser_omp_declare_reduction. Parse the combiner
30906 expression and optional initializer clause of
30907 #pragma omp declare reduction. We store the expression(s) as
30908 either 3, 6 or 7 special statements inside of the artificial function's
30909 body. The first two statements are DECL_EXPRs for the artificial
30910 OMP_OUT resp. OMP_IN variables, followed by a statement with the combiner
30911 expression that uses those variables.
30912 If there was any INITIALIZER clause, this is followed by further statements,
30913 the fourth and fifth statements are DECL_EXPRs for the artificial
30914 OMP_PRIV resp. OMP_ORIG variables. If the INITIALIZER clause wasn't the
30915 constructor variant (first token after open paren is not omp_priv),
30916 then the sixth statement is a statement with the function call expression
30917 that uses the OMP_PRIV and optionally OMP_ORIG variable.
30918 Otherwise, the sixth statement is whatever statement cp_finish_decl emits
30919 to initialize the OMP_PRIV artificial variable and there is seventh
30920 statement, a DECL_EXPR of the OMP_PRIV statement again. */
30922 static bool
30924 {
30936 tree combiner;
30951 {
30954 }
30957 {
30964 {
30967 }
30983 {
30987 /* Reject initializer (omp_priv) and initializer (omp_priv ()). */
30991 == CPP_CLOSE_PAREN
30994 {
30998 }
31003 }
31004 else
31005 {
31021 {
31026 }
31028 tree arg;
31041 }
31052 }
31058 }
31060 /* OpenMP 4.0
31061 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31062 initializer-clause[opt] new-line
31064 initializer-clause:
31065 initializer (omp_priv initializer)
31066 initializer (function-name (argument-list)) */
31068 static void
31071 {
31084 {
31116 }
31128 /* Types may not be defined in declare reduction type list. */
31131 parser->type_definition_forbidden_message
31137 saved_colon_doesnt_start_class_def_p
31142 {
31146 ;
31167 else
31172 else
31174 }
31176 /* Restore the saved message. */
31179 parser->colon_doesnt_start_class_def_p
31184 {
31185 fail:
31189 }
31195 {
31196 tree fntype
31199 NULL_TREE);
31218 {
31223 }
31225 {
31227 {
31236 }
31243 }
31244 else
31245 {
31248 }
31251 else
31254 {
31257 }
31259 {
31262 else
31267 }
31272 else
31273 {
31282 }
31289 }
31293 }
31295 /* OpenMP 4.0
31296 #pragma omp declare simd declare-simd-clauses[optseq] new-line
31297 #pragma omp declare reduction (reduction-id : typename-list : expression) \
31298 initializer-clause[opt] new-line
31299 #pragma omp declare target new-line */
31301 static void
31304 {
31306 {
31311 {
31314 context);
31316 }
31319 {
31322 context);
31324 }
31326 {
31329 }
31331 {
31335 }
31336 }
31340 }
31342 /* Main entry point to OpenMP statement pragmas. */
31344 static void
31346 {
31347 tree stmt;
31352 {
31400 }
31404 }
31405 \f
31406 /* Transactional Memory parsing routines. */
31408 /* Parse a transaction attribute.
31410 txn-attribute:
31411 attribute
31412 [ [ identifier ] ]
31414 ??? Simplify this when C++0x bracket attributes are
31415 implemented properly. */
31417 static tree
31419 {
31434 {
31438 /* For keywords, use the canonical spelling,
31439 not the parsed identifier. */
31443 }
31444 else
31448 error1:
31451 }
31453 /* Parse a __transaction_atomic or __transaction_relaxed statement.
31455 transaction-statement:
31456 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
31457 compound-statement
31458 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
31459 */
31461 static tree
31463 {
31478 else
31479 {
31483 }
31485 /* Parse a noexcept specification. */
31488 /* Keep track if we're in the lexical scope of an outer transaction. */
31500 }
31502 /* Parse a __transaction_atomic or __transaction_relaxed expression.
31504 transaction-expression:
31505 __transaction_atomic txn-noexcept-spec[opt] ( expression )
31506 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
31507 */
31509 static tree
31511 {
31536 /* Set this early. This might mean that we allow transaction_cancel in
31537 an expression that we find out later actually has to be a constexpr.
31538 However, we expect that cxx_constant_value will be able to deal with
31539 this; also, if the noexcept has no constexpr, then what we parse next
31540 really is a transaction's body. */
31543 /* Parse a noexcept specification. */
31549 {
31556 }
31557 else
31558 {
31559 /* The only expression that is available got parsed for the noexcept
31560 already. noexcept is true then. */
31563 }
31572 }
31574 /* Parse a function-transaction-block.
31576 function-transaction-block:
31577 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
31578 function-body
31579 __transaction_atomic txn-attribute[opt] function-try-block
31580 __transaction_relaxed ctor-initializer[opt] function-body
31581 __transaction_relaxed function-try-block
31582 */
31584 static bool
31586 {
31602 else
31603 {
31607 }
31615 else
31616 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
31624 }
31626 /* Parse a __transaction_cancel statement.
31628 cancel-statement:
31629 __transaction_cancel txn-attribute[opt] ;
31630 __transaction_cancel txn-attribute[opt] throw-expression ;
31632 ??? Cancel and throw is not yet implemented. */
31634 static tree
31636 {
31642 RT_TRANSACTION_CANCEL);
31649 /* ??? Parse cancel-and-throw here. */
31654 {
31658 }
31660 {
31664 }
31666 {
31669 {
31675 }
31676 }
31678 {
31682 }
31688 }
31689 \f
31690 /* The parser. */
31694 \f
31695 /* Special handling for the first token or line in the file. The first
31696 thing in the file might be #pragma GCC pch_preprocess, which loads a
31697 PCH file, which is a GC collection point. So we need to handle this
31698 first pragma without benefit of an existing lexer structure.
31700 Always returns one token to the caller in *FIRST_TOKEN. This is
31701 either the true first token of the file, or the first token after
31702 the initial pragma. */
31704 static void
31706 {
31715 {
31722 }
31723 else
31726 /* Skip to the end of the pragma. */
31730 /* Now actually load the PCH file. */
31734 /* Read one more token to return to our caller. We have to do this
31735 after reading the PCH file in, since its pointers have to be
31736 live. */
31738 }
31740 /* Normal parsing of a pragma token. Here we can (and must) use the
31741 regular lexer. */
31743 static bool
31745 {
31757 {
31765 {
31775 }
31780 {
31790 }
31795 {
31801 "%<#pragma omp taskwait%> may only be "
31806 }
31811 {
31817 "%<#pragma omp taskyield%> may only be "
31822 }
31827 {
31833 "%<#pragma omp cancel%> may only be "
31838 }
31843 {
31849 "%<#pragma omp cancellation point%> may only be "
31854 }
31892 "%<#pragma omp section%> may only be used in "
31897 {
31904 {
31907 }
31910 }
31914 {
31918 }
31927 bad_stmt:
31930 }
31934 }
31936 /* The interface the pragma parsers have to the lexer. */
31938 enum cpp_ttype
31940 {
31953 else
31954 {
31958 }
31961 }
31963 \f
31964 /* External interface. */
31966 /* Parse one entire translation unit. */
31968 void
31970 {
31974 {
31977 }
31985 }
31987 /* Parses the Cilk Plus #pragma simd vectorlength clause:
31988 Syntax:
31989 vectorlength ( constant-expression ) */
31991 static tree
31993 {
31995 tree expr;
31996 /* The vectorlength clause behaves exactly like OpenMP's safelen
31997 clause. Thus, vectorlength is represented as OMP 4.0
31998 safelen. */
32011 {
32016 }
32021 }
32023 /* Handles the Cilk Plus #pragma simd linear clause.
32024 Syntax:
32025 linear ( simd-linear-variable-list )
32027 simd-linear-variable-list:
32028 simd-linear-variable
32029 simd-linear-variable-list , simd-linear-variable
32031 simd-linear-variable:
32032 id-expression
32033 id-expression : simd-linear-step
32035 simd-linear-step:
32036 conditional-expression */
32038 static tree
32040 {
32046 {
32050 }
32055 {
32058 {
32062 }
32069 {
32073 }
32074 else
32075 {
32079 /* If present, parse the linear step. Otherwise, assume the default
32080 value of 1. */
32082 {
32089 {
32090 /* If an error has occurred, then the whole pragma is
32091 considered ill-formed. Thus, no reason to keep
32092 parsing. */
32095 }
32103 else
32105 "step size must be an integer constant "
32107 }
32109 /* Use the OMP_CLAUSE_LINEAR, which has the same semantics. */
32115 }
32120 else
32121 {
32126 }
32127 }
32131 }
32133 /* Returns the name of the next clause. If the clause is not
32134 recognized, then PRAGMA_CILK_CLAUSE_NONE is returned and the next
32135 token is not consumed. Otherwise, the appropriate enum from the
32136 pragma_simd_clause is returned and the token is consumed. */
32138 static pragma_cilk_clause
32140 {
32141 pragma_cilk_clause clause_type;
32158 else
32163 }
32165 /* Parses all the #pragma simd clauses. Returns a list of clauses found. */
32167 static tree
32169 {
32174 {
32175 pragma_cilk_clause c_kind;
32182 /* Use the OpenMP 4.0 equivalent function. */
32185 /* Use the OpenMP 4.0 equivalent function. */
32187 clauses);
32189 /* Use the OMP 4.0 equivalent function. */
32191 clauses);
32193 /* Use the OMP 4.0 equivalent function. */
32195 else
32196 {
32200 }
32201 }
32207 else
32209 }
32211 /* Main entry-point for parsing Cilk Plus <#pragma simd> for loops. */
32213 static void
32215 {
32222 {
32226 }
32236 }
32238 /* Create an identifier for a generic parameter type (a synthesized
32239 template parameter implied by `auto' or a concept identifier). */
32242 static tree
32244 {
32248 }
32250 /* Predicate that behaves as is_auto_or_concept but matches the parent
32251 node of the generic type rather than the generic type itself. This
32252 allows for type transformation in add_implicit_template_parms. */
32256 {
32258 }
32260 // Return the template decl being called or evaluated as part of the
32261 // constraint check.
32262 //
32263 // TODO: This is a bit of a hack. When we finish the template parameter
32264 // the constraint is just a call expression, but we don't have the full
32265 // context that we used to build that call expression. Since we're going
32266 // to be comparing declarations, it would helpful to have that. This
32267 // means we'll have to make the TREE_TYPE of the parameter node a pair
32268 // containing the context (the TYPE_DECL) and the constraint.
32269 static tree
32271 {
32277 }
32279 /* Add an implicit template type parameter to the CURRENT_TEMPLATE_PARMS
32280 (creating a new template parameter list if necessary). Returns the newly
32281 created template type parm. */
32283 tree
32285 {
32288 // Before committing to modifying any scope, if we're in an implicit
32289 // template scope, and we're trying to synthesize a constrained
32290 // parameter, try to find a previous parameter with the same name.
32292 {
32295 {
32300 }
32301 }
32304 /* We are either continuing a function template that already contains implicit
32305 template parameters, creating a new fully-implicit function template, or
32306 extending an existing explicit function template with implicit template
32307 parameters. */
32315 {
32319 }
32320 else
32321 {
32322 /* Roll back to the existing template parameter scope (in the case of
32323 extending an explicit function template) or introduce a new template
32324 parameter scope ahead of the function parameter scope (or class scope
32325 in the case of out-of-line member definitions). The function scope is
32326 added back after template parameter synthesis below. */
32331 {
32334 }
32338 {
32341 }
32346 {
32347 /* Introduce a new template parameter list for implicit template
32348 parameters. */
32352 parser->implicit_template_scope
32359 }
32360 else
32361 {
32362 /* Synthesize implicit template parameters at the end of the explicit
32363 template parameter list. */
32370 parser->implicit_template_parms
32372 }
32373 }
32375 /* Synthesize a new template parameter and track the current template
32376 parameter chain with implicit_template_parms. */
32380 synth_id);
32382 // Attach the constraint to the parm before processing.
32386 tree new_parm
32388 input_location,
32389 node,
32395 parser->implicit_template_parms
32397 else
32402 /* If creating a fully implicit function template, start the new implicit
32403 template parameter list with this synthesized type, otherwise grow the
32404 current template parameter list. */
32407 {
32414 }
32415 else
32416 {
32421 }
32426 }
32428 /* Finish the declaration of a fully implicit function template. Such a
32429 template has no explicit template parameter list so has not been through the
32430 normal template head and tail processing. synthesize_implicit_template_parm
32431 tries to do the head; this tries to do the tail. MEMBER_DECL_OPT should be
32432 provided if the declaration is a class member such that its template
32433 declaration can be completed. If MEMBER_DECL_OPT is provided the finished
32434 form is returned. Otherwise NULL_TREE is returned. */
32436 tree
32438 {
32443 {
32447 }
32457 }